/usr/bin/java -ea -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data --core.log.level.for.class de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=WARN -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationJordan_32.epf -i ../../../trunk/examples/svcomp/loops-crafted-1/mono-crafted_1.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-fb4f59a-m [2022-04-28 03:42:11,290 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-04-28 03:42:11,291 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-04-28 03:42:11,346 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-04-28 03:42:11,346 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-04-28 03:42:11,347 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-04-28 03:42:11,350 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-04-28 03:42:11,352 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-04-28 03:42:11,354 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-04-28 03:42:11,358 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-04-28 03:42:11,359 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-04-28 03:42:11,360 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-04-28 03:42:11,361 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-04-28 03:42:11,363 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-04-28 03:42:11,363 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-04-28 03:42:11,366 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-04-28 03:42:11,366 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-04-28 03:42:11,367 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-04-28 03:42:11,369 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-04-28 03:42:11,373 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-04-28 03:42:11,375 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-04-28 03:42:11,376 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-04-28 03:42:11,376 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-04-28 03:42:11,377 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-04-28 03:42:11,378 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-04-28 03:42:11,384 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-04-28 03:42:11,385 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-04-28 03:42:11,385 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-04-28 03:42:11,386 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-04-28 03:42:11,386 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-04-28 03:42:11,387 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-04-28 03:42:11,387 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-04-28 03:42:11,388 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-04-28 03:42:11,389 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-04-28 03:42:11,389 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-04-28 03:42:11,390 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-04-28 03:42:11,390 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-04-28 03:42:11,391 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-04-28 03:42:11,391 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-04-28 03:42:11,391 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-04-28 03:42:11,392 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-04-28 03:42:11,393 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-04-28 03:42:11,394 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationJordan_32.epf [2022-04-28 03:42:11,405 INFO L113 SettingsManager]: Loading preferences was successful [2022-04-28 03:42:11,405 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-04-28 03:42:11,406 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-04-28 03:42:11,406 INFO L138 SettingsManager]: * sizeof long=4 [2022-04-28 03:42:11,407 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-04-28 03:42:11,407 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-04-28 03:42:11,407 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-04-28 03:42:11,407 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-04-28 03:42:11,407 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-04-28 03:42:11,408 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-04-28 03:42:11,408 INFO L138 SettingsManager]: * sizeof long double=12 [2022-04-28 03:42:11,408 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-04-28 03:42:11,408 INFO L138 SettingsManager]: * Use constant arrays=true [2022-04-28 03:42:11,408 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-04-28 03:42:11,409 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-04-28 03:42:11,409 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-04-28 03:42:11,409 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-04-28 03:42:11,409 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-04-28 03:42:11,409 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-28 03:42:11,409 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-04-28 03:42:11,409 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_NestedInterpolation [2022-04-28 03:42:11,410 INFO L138 SettingsManager]: * Trace refinement strategy=ACCELERATED_INTERPOLATION [2022-04-28 03:42:11,410 INFO L138 SettingsManager]: * Trace refinement strategy used in Accelerated Interpolation=CAMEL [2022-04-28 03:42:11,410 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-04-28 03:42:11,410 INFO L138 SettingsManager]: * Loop acceleration method that is used by accelerated interpolation=JORDAN [2022-04-28 03:42:11,410 INFO L138 SettingsManager]: * Use separate solver for trace checks=false WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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.core: Log level for class -> de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=WARN; [2022-04-28 03:42:11,626 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-04-28 03:42:11,651 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-04-28 03:42:11,653 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-04-28 03:42:11,654 INFO L271 PluginConnector]: Initializing CDTParser... [2022-04-28 03:42:11,655 INFO L275 PluginConnector]: CDTParser initialized [2022-04-28 03:42:11,656 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/loops-crafted-1/mono-crafted_1.c [2022-04-28 03:42:11,703 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b0767449e/5d1fb7861d7e4b7fad609065c6ed2d4c/FLAG19fb67dc0 [2022-04-28 03:42:12,025 INFO L306 CDTParser]: Found 1 translation units. [2022-04-28 03:42:12,026 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loops-crafted-1/mono-crafted_1.c [2022-04-28 03:42:12,030 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b0767449e/5d1fb7861d7e4b7fad609065c6ed2d4c/FLAG19fb67dc0 [2022-04-28 03:42:12,465 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b0767449e/5d1fb7861d7e4b7fad609065c6ed2d4c [2022-04-28 03:42:12,467 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-04-28 03:42:12,468 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2022-04-28 03:42:12,471 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-04-28 03:42:12,472 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-04-28 03:42:12,474 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-04-28 03:42:12,475 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.04 03:42:12" (1/1) ... [2022-04-28 03:42:12,476 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@27a580b6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 03:42:12, skipping insertion in model container [2022-04-28 03:42:12,476 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.04 03:42:12" (1/1) ... [2022-04-28 03:42:12,482 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-04-28 03:42:12,492 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-04-28 03:42:12,597 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loops-crafted-1/mono-crafted_1.c[318,331] [2022-04-28 03:42:12,626 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-28 03:42:12,632 INFO L203 MainTranslator]: Completed pre-run [2022-04-28 03:42:12,641 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loops-crafted-1/mono-crafted_1.c[318,331] [2022-04-28 03:42:12,644 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-28 03:42:12,654 INFO L208 MainTranslator]: Completed translation [2022-04-28 03:42:12,654 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 03:42:12 WrapperNode [2022-04-28 03:42:12,654 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-04-28 03:42:12,655 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-04-28 03:42:12,655 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-04-28 03:42:12,655 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-04-28 03:42:12,663 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 03:42:12" (1/1) ... [2022-04-28 03:42:12,663 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 03:42:12" (1/1) ... [2022-04-28 03:42:12,667 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 03:42:12" (1/1) ... [2022-04-28 03:42:12,668 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 03:42:12" (1/1) ... [2022-04-28 03:42:12,672 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 03:42:12" (1/1) ... [2022-04-28 03:42:12,675 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 03:42:12" (1/1) ... [2022-04-28 03:42:12,675 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 03:42:12" (1/1) ... [2022-04-28 03:42:12,677 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-04-28 03:42:12,677 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-04-28 03:42:12,678 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-04-28 03:42:12,678 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-04-28 03:42:12,678 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 03:42:12" (1/1) ... [2022-04-28 03:42:12,684 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-28 03:42:12,693 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 03:42:12,703 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-04-28 03:42:12,712 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-04-28 03:42:12,731 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-04-28 03:42:12,731 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-04-28 03:42:12,731 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-04-28 03:42:12,731 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-04-28 03:42:12,731 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-04-28 03:42:12,732 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-04-28 03:42:12,732 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-04-28 03:42:12,732 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-04-28 03:42:12,732 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-04-28 03:42:12,732 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-04-28 03:42:12,732 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-04-28 03:42:12,732 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-04-28 03:42:12,732 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-04-28 03:42:12,732 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-04-28 03:42:12,732 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-04-28 03:42:12,733 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-04-28 03:42:12,733 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-04-28 03:42:12,780 INFO L234 CfgBuilder]: Building ICFG [2022-04-28 03:42:12,782 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-04-28 03:42:12,896 INFO L275 CfgBuilder]: Performing block encoding [2022-04-28 03:42:12,902 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-04-28 03:42:12,902 INFO L299 CfgBuilder]: Removed 2 assume(true) statements. [2022-04-28 03:42:12,904 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.04 03:42:12 BoogieIcfgContainer [2022-04-28 03:42:12,904 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-04-28 03:42:12,905 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-04-28 03:42:12,905 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-04-28 03:42:12,908 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-04-28 03:42:12,908 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.04 03:42:12" (1/3) ... [2022-04-28 03:42:12,909 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1173a499 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.04 03:42:12, skipping insertion in model container [2022-04-28 03:42:12,909 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 03:42:12" (2/3) ... [2022-04-28 03:42:12,909 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1173a499 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.04 03:42:12, skipping insertion in model container [2022-04-28 03:42:12,909 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.04 03:42:12" (3/3) ... [2022-04-28 03:42:12,910 INFO L111 eAbstractionObserver]: Analyzing ICFG mono-crafted_1.c [2022-04-28 03:42:12,921 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2022-04-28 03:42:12,921 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-04-28 03:42:12,954 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-04-28 03:42:12,959 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=Craig_NestedInterpolation, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=FINITE_AUTOMATA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=All, 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=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@51caf8e7, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@363afddc [2022-04-28 03:42:12,959 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-04-28 03:42:12,966 INFO L276 IsEmpty]: Start isEmpty. Operand has 21 states, 13 states have (on average 1.5384615384615385) internal successors, (20), 14 states have internal predecessors, (20), 3 states have call successors, (3), 3 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-28 03:42:12,971 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-04-28 03:42:12,971 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 03:42:12,971 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 03:42:12,972 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 03:42:12,976 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 03:42:12,976 INFO L85 PathProgramCache]: Analyzing trace with hash -1168619535, now seen corresponding path program 1 times [2022-04-28 03:42:12,987 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 03:42:12,987 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [741386992] [2022-04-28 03:42:12,998 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 03:42:12,998 INFO L85 PathProgramCache]: Analyzing trace with hash -1168619535, now seen corresponding path program 2 times [2022-04-28 03:42:13,001 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 03:42:13,001 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [83758458] [2022-04-28 03:42:13,002 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:42:13,002 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 03:42:13,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:42:13,204 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 03:42:13,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:42:13,226 INFO L290 TraceCheckUtils]: 0: Hoare triple {29#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(17, 2);call #Ultimate.allocInit(12, 3); {24#true} is VALID [2022-04-28 03:42:13,226 INFO L290 TraceCheckUtils]: 1: Hoare triple {24#true} assume true; {24#true} is VALID [2022-04-28 03:42:13,226 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {24#true} {24#true} #52#return; {24#true} is VALID [2022-04-28 03:42:13,228 INFO L272 TraceCheckUtils]: 0: Hoare triple {24#true} call ULTIMATE.init(); {29#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 03:42:13,228 INFO L290 TraceCheckUtils]: 1: Hoare triple {29#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(17, 2);call #Ultimate.allocInit(12, 3); {24#true} is VALID [2022-04-28 03:42:13,228 INFO L290 TraceCheckUtils]: 2: Hoare triple {24#true} assume true; {24#true} is VALID [2022-04-28 03:42:13,229 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {24#true} {24#true} #52#return; {24#true} is VALID [2022-04-28 03:42:13,229 INFO L272 TraceCheckUtils]: 4: Hoare triple {24#true} call #t~ret9 := main(); {24#true} is VALID [2022-04-28 03:42:13,229 INFO L290 TraceCheckUtils]: 5: Hoare triple {24#true} ~x~0 := 0;~y~0 := 50000;~z~0 := 0;~x~0 := 0; {24#true} is VALID [2022-04-28 03:42:13,230 INFO L290 TraceCheckUtils]: 6: Hoare triple {24#true} assume !true; {25#false} is VALID [2022-04-28 03:42:13,230 INFO L290 TraceCheckUtils]: 7: Hoare triple {25#false} assume !true; {25#false} is VALID [2022-04-28 03:42:13,230 INFO L272 TraceCheckUtils]: 8: Hoare triple {25#false} call __VERIFIER_assert((if ~x~0 == ~z~0 then 1 else 0)); {25#false} is VALID [2022-04-28 03:42:13,230 INFO L290 TraceCheckUtils]: 9: Hoare triple {25#false} ~cond := #in~cond; {25#false} is VALID [2022-04-28 03:42:13,231 INFO L290 TraceCheckUtils]: 10: Hoare triple {25#false} assume 0 == ~cond; {25#false} is VALID [2022-04-28 03:42:13,232 INFO L290 TraceCheckUtils]: 11: Hoare triple {25#false} assume !false; {25#false} is VALID [2022-04-28 03:42:13,232 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 03:42:13,233 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 03:42:13,233 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [83758458] [2022-04-28 03:42:13,234 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [83758458] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 03:42:13,235 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 03:42:13,235 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-04-28 03:42:13,238 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 03:42:13,239 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [741386992] [2022-04-28 03:42:13,239 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [741386992] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 03:42:13,239 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 03:42:13,240 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-04-28 03:42:13,240 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1258524040] [2022-04-28 03:42:13,240 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 03:42:13,244 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 2 states have internal predecessors, (8), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 12 [2022-04-28 03:42:13,246 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 03:42:13,248 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 2 states have internal predecessors, (8), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:42:13,274 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 12 edges. 12 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 03:42:13,274 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-04-28 03:42:13,275 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 03:42:13,303 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-04-28 03:42:13,303 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-28 03:42:13,307 INFO L87 Difference]: Start difference. First operand has 21 states, 13 states have (on average 1.5384615384615385) internal successors, (20), 14 states have internal predecessors, (20), 3 states have call successors, (3), 3 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 2 states have internal predecessors, (8), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:42:13,404 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:42:13,405 INFO L93 Difference]: Finished difference Result 34 states and 42 transitions. [2022-04-28 03:42:13,405 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-04-28 03:42:13,405 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 2 states have internal predecessors, (8), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 12 [2022-04-28 03:42:13,405 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 03:42:13,406 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 2 states have internal predecessors, (8), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:42:13,414 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 42 transitions. [2022-04-28 03:42:13,415 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 2 states have internal predecessors, (8), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:42:13,422 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 42 transitions. [2022-04-28 03:42:13,422 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 3 states and 42 transitions. [2022-04-28 03:42:13,496 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 42 edges. 42 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 03:42:13,503 INFO L225 Difference]: With dead ends: 34 [2022-04-28 03:42:13,503 INFO L226 Difference]: Without dead ends: 14 [2022-04-28 03:42:13,506 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-28 03:42:13,508 INFO L413 NwaCegarLoop]: 22 mSDtfsCounter, 14 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 25 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-28 03:42:13,509 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [15 Valid, 25 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-28 03:42:13,525 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14 states. [2022-04-28 03:42:13,535 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14 to 14. [2022-04-28 03:42:13,537 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 03:42:13,537 INFO L82 GeneralOperation]: Start isEquivalent. First operand 14 states. Second operand has 14 states, 9 states have (on average 1.3333333333333333) internal successors, (12), 9 states have internal predecessors, (12), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:42:13,538 INFO L74 IsIncluded]: Start isIncluded. First operand 14 states. Second operand has 14 states, 9 states have (on average 1.3333333333333333) internal successors, (12), 9 states have internal predecessors, (12), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:42:13,538 INFO L87 Difference]: Start difference. First operand 14 states. Second operand has 14 states, 9 states have (on average 1.3333333333333333) internal successors, (12), 9 states have internal predecessors, (12), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:42:13,540 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:42:13,541 INFO L93 Difference]: Finished difference Result 14 states and 16 transitions. [2022-04-28 03:42:13,541 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 16 transitions. [2022-04-28 03:42:13,541 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:42:13,541 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:42:13,542 INFO L74 IsIncluded]: Start isIncluded. First operand has 14 states, 9 states have (on average 1.3333333333333333) internal successors, (12), 9 states have internal predecessors, (12), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 14 states. [2022-04-28 03:42:13,542 INFO L87 Difference]: Start difference. First operand has 14 states, 9 states have (on average 1.3333333333333333) internal successors, (12), 9 states have internal predecessors, (12), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 14 states. [2022-04-28 03:42:13,544 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:42:13,544 INFO L93 Difference]: Finished difference Result 14 states and 16 transitions. [2022-04-28 03:42:13,544 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 16 transitions. [2022-04-28 03:42:13,545 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:42:13,545 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:42:13,545 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 03:42:13,545 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 03:42:13,545 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 9 states have (on average 1.3333333333333333) internal successors, (12), 9 states have internal predecessors, (12), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:42:13,547 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 16 transitions. [2022-04-28 03:42:13,548 INFO L78 Accepts]: Start accepts. Automaton has 14 states and 16 transitions. Word has length 12 [2022-04-28 03:42:13,548 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 03:42:13,548 INFO L495 AbstractCegarLoop]: Abstraction has 14 states and 16 transitions. [2022-04-28 03:42:13,549 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 2 states have internal predecessors, (8), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:42:13,549 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 14 states and 16 transitions. [2022-04-28 03:42:13,568 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 16 edges. 16 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 03:42:13,568 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 16 transitions. [2022-04-28 03:42:13,568 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-04-28 03:42:13,569 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 03:42:13,569 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 03:42:13,569 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-04-28 03:42:13,569 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 03:42:13,570 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 03:42:13,570 INFO L85 PathProgramCache]: Analyzing trace with hash -1458605129, now seen corresponding path program 1 times [2022-04-28 03:42:13,570 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 03:42:13,571 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [311057205] [2022-04-28 03:42:13,572 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 03:42:13,572 INFO L85 PathProgramCache]: Analyzing trace with hash -1458605129, now seen corresponding path program 2 times [2022-04-28 03:42:13,572 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 03:42:13,572 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1561284612] [2022-04-28 03:42:13,572 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:42:13,573 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 03:42:13,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:42:13,657 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 03:42:13,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:42:13,678 INFO L290 TraceCheckUtils]: 0: Hoare triple {162#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(17, 2);call #Ultimate.allocInit(12, 3); {156#true} is VALID [2022-04-28 03:42:13,679 INFO L290 TraceCheckUtils]: 1: Hoare triple {156#true} assume true; {156#true} is VALID [2022-04-28 03:42:13,679 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {156#true} {156#true} #52#return; {156#true} is VALID [2022-04-28 03:42:13,680 INFO L272 TraceCheckUtils]: 0: Hoare triple {156#true} call ULTIMATE.init(); {162#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 03:42:13,681 INFO L290 TraceCheckUtils]: 1: Hoare triple {162#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(17, 2);call #Ultimate.allocInit(12, 3); {156#true} is VALID [2022-04-28 03:42:13,681 INFO L290 TraceCheckUtils]: 2: Hoare triple {156#true} assume true; {156#true} is VALID [2022-04-28 03:42:13,682 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {156#true} {156#true} #52#return; {156#true} is VALID [2022-04-28 03:42:13,682 INFO L272 TraceCheckUtils]: 4: Hoare triple {156#true} call #t~ret9 := main(); {156#true} is VALID [2022-04-28 03:42:13,682 INFO L290 TraceCheckUtils]: 5: Hoare triple {156#true} ~x~0 := 0;~y~0 := 50000;~z~0 := 0;~x~0 := 0; {161#(= main_~x~0 0)} is VALID [2022-04-28 03:42:13,683 INFO L290 TraceCheckUtils]: 6: Hoare triple {161#(= main_~x~0 0)} assume !(~x~0 < 1000000); {157#false} is VALID [2022-04-28 03:42:13,684 INFO L290 TraceCheckUtils]: 7: Hoare triple {157#false} assume !(~y~0 > ~z~0); {157#false} is VALID [2022-04-28 03:42:13,684 INFO L272 TraceCheckUtils]: 8: Hoare triple {157#false} call __VERIFIER_assert((if ~x~0 == ~z~0 then 1 else 0)); {157#false} is VALID [2022-04-28 03:42:13,684 INFO L290 TraceCheckUtils]: 9: Hoare triple {157#false} ~cond := #in~cond; {157#false} is VALID [2022-04-28 03:42:13,684 INFO L290 TraceCheckUtils]: 10: Hoare triple {157#false} assume 0 == ~cond; {157#false} is VALID [2022-04-28 03:42:13,685 INFO L290 TraceCheckUtils]: 11: Hoare triple {157#false} assume !false; {157#false} is VALID [2022-04-28 03:42:13,685 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 03:42:13,685 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 03:42:13,687 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1561284612] [2022-04-28 03:42:13,687 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1561284612] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 03:42:13,687 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 03:42:13,687 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-28 03:42:13,688 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 03:42:13,688 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [311057205] [2022-04-28 03:42:13,689 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [311057205] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 03:42:13,689 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 03:42:13,689 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-28 03:42:13,689 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [433237658] [2022-04-28 03:42:13,690 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 03:42:13,691 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.0) internal successors, (8), 3 states have internal predecessors, (8), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 12 [2022-04-28 03:42:13,691 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 03:42:13,692 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 2.0) internal successors, (8), 3 states have internal predecessors, (8), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:42:13,708 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 12 edges. 12 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 03:42:13,709 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-28 03:42:13,709 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 03:42:13,711 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-28 03:42:13,711 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-28 03:42:13,712 INFO L87 Difference]: Start difference. First operand 14 states and 16 transitions. Second operand has 4 states, 4 states have (on average 2.0) internal successors, (8), 3 states have internal predecessors, (8), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:42:13,808 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:42:13,808 INFO L93 Difference]: Finished difference Result 24 states and 30 transitions. [2022-04-28 03:42:13,809 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-28 03:42:13,809 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.0) internal successors, (8), 3 states have internal predecessors, (8), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 12 [2022-04-28 03:42:13,809 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 03:42:13,809 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 2.0) internal successors, (8), 3 states have internal predecessors, (8), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:42:13,811 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 30 transitions. [2022-04-28 03:42:13,811 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 2.0) internal successors, (8), 3 states have internal predecessors, (8), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:42:13,812 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 30 transitions. [2022-04-28 03:42:13,812 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 30 transitions. [2022-04-28 03:42:13,844 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 30 edges. 30 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 03:42:13,849 INFO L225 Difference]: With dead ends: 24 [2022-04-28 03:42:13,849 INFO L226 Difference]: Without dead ends: 16 [2022-04-28 03:42:13,849 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-04-28 03:42:13,851 INFO L413 NwaCegarLoop]: 14 mSDtfsCounter, 12 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 21 SdHoareTripleChecker+Invalid, 17 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-28 03:42:13,851 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 21 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-28 03:42:13,853 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states. [2022-04-28 03:42:13,858 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 16. [2022-04-28 03:42:13,859 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 03:42:13,859 INFO L82 GeneralOperation]: Start isEquivalent. First operand 16 states. Second operand has 16 states, 11 states have (on average 1.2727272727272727) internal successors, (14), 11 states have internal predecessors, (14), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:42:13,859 INFO L74 IsIncluded]: Start isIncluded. First operand 16 states. Second operand has 16 states, 11 states have (on average 1.2727272727272727) internal successors, (14), 11 states have internal predecessors, (14), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:42:13,860 INFO L87 Difference]: Start difference. First operand 16 states. Second operand has 16 states, 11 states have (on average 1.2727272727272727) internal successors, (14), 11 states have internal predecessors, (14), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:42:13,864 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:42:13,864 INFO L93 Difference]: Finished difference Result 16 states and 18 transitions. [2022-04-28 03:42:13,864 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 18 transitions. [2022-04-28 03:42:13,864 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:42:13,864 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:42:13,865 INFO L74 IsIncluded]: Start isIncluded. First operand has 16 states, 11 states have (on average 1.2727272727272727) internal successors, (14), 11 states have internal predecessors, (14), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 16 states. [2022-04-28 03:42:13,865 INFO L87 Difference]: Start difference. First operand has 16 states, 11 states have (on average 1.2727272727272727) internal successors, (14), 11 states have internal predecessors, (14), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 16 states. [2022-04-28 03:42:13,866 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:42:13,866 INFO L93 Difference]: Finished difference Result 16 states and 18 transitions. [2022-04-28 03:42:13,867 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 18 transitions. [2022-04-28 03:42:13,867 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:42:13,867 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:42:13,867 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 03:42:13,867 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 03:42:13,867 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16 states, 11 states have (on average 1.2727272727272727) internal successors, (14), 11 states have internal predecessors, (14), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:42:13,868 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 18 transitions. [2022-04-28 03:42:13,869 INFO L78 Accepts]: Start accepts. Automaton has 16 states and 18 transitions. Word has length 12 [2022-04-28 03:42:13,869 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 03:42:13,869 INFO L495 AbstractCegarLoop]: Abstraction has 16 states and 18 transitions. [2022-04-28 03:42:13,869 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.0) internal successors, (8), 3 states have internal predecessors, (8), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:42:13,869 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 16 states and 18 transitions. [2022-04-28 03:42:13,886 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 18 edges. 18 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 03:42:13,887 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 18 transitions. [2022-04-28 03:42:13,887 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-04-28 03:42:13,888 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 03:42:13,888 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 03:42:13,888 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-04-28 03:42:13,891 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 03:42:13,892 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 03:42:13,893 INFO L85 PathProgramCache]: Analyzing trace with hash -1316432198, now seen corresponding path program 1 times [2022-04-28 03:42:13,893 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 03:42:13,893 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [539335531] [2022-04-28 03:42:14,126 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 1 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 03:42:14,128 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-28 03:42:14,130 INFO L85 PathProgramCache]: Analyzing trace with hash -1148992352, now seen corresponding path program 1 times [2022-04-28 03:42:14,131 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 03:42:14,131 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1524280620] [2022-04-28 03:42:14,131 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:42:14,131 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 03:42:14,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:42:14,186 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 03:42:14,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:42:14,193 INFO L290 TraceCheckUtils]: 0: Hoare triple {285#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(17, 2);call #Ultimate.allocInit(12, 3); {279#true} is VALID [2022-04-28 03:42:14,193 INFO L290 TraceCheckUtils]: 1: Hoare triple {279#true} assume true; {279#true} is VALID [2022-04-28 03:42:14,193 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {279#true} {279#true} #52#return; {279#true} is VALID [2022-04-28 03:42:14,194 INFO L272 TraceCheckUtils]: 0: Hoare triple {279#true} call ULTIMATE.init(); {285#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 03:42:14,194 INFO L290 TraceCheckUtils]: 1: Hoare triple {285#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(17, 2);call #Ultimate.allocInit(12, 3); {279#true} is VALID [2022-04-28 03:42:14,194 INFO L290 TraceCheckUtils]: 2: Hoare triple {279#true} assume true; {279#true} is VALID [2022-04-28 03:42:14,194 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {279#true} {279#true} #52#return; {279#true} is VALID [2022-04-28 03:42:14,195 INFO L272 TraceCheckUtils]: 4: Hoare triple {279#true} call #t~ret9 := main(); {279#true} is VALID [2022-04-28 03:42:14,195 INFO L290 TraceCheckUtils]: 5: Hoare triple {279#true} ~x~0 := 0;~y~0 := 50000;~z~0 := 0;~x~0 := 0; {284#(and (= main_~z~0 0) (<= 50000 main_~y~0))} is VALID [2022-04-28 03:42:14,196 INFO L290 TraceCheckUtils]: 6: Hoare triple {284#(and (= main_~z~0 0) (<= 50000 main_~y~0))} [58] L11-2-->L18-1_primed: Formula: (let ((.cse0 (= v_main_~x~0_14 v_main_~x~0_13)) (.cse1 (= |v_main_#t~post4_4| |v_main_#t~post4_3|))) (or (and (< v_main_~x~0_14 v_main_~x~0_13) (< v_main_~x~0_13 50001)) (and .cse0 .cse1) (and (not (< v_main_~x~0_14 50000)) .cse0 .cse1))) InVars {main_~x~0=v_main_~x~0_14, main_#t~post4=|v_main_#t~post4_4|} OutVars{main_~x~0=v_main_~x~0_13, main_#t~post4=|v_main_#t~post4_3|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {284#(and (= main_~z~0 0) (<= 50000 main_~y~0))} is VALID [2022-04-28 03:42:14,197 INFO L290 TraceCheckUtils]: 7: Hoare triple {284#(and (= main_~z~0 0) (<= 50000 main_~y~0))} [57] L18-1_primed-->L18-1: Formula: (not (< v_main_~x~0_11 1000000)) InVars {main_~x~0=v_main_~x~0_11} OutVars{main_~x~0=v_main_~x~0_11} AuxVars[] AssignedVars[] {284#(and (= main_~z~0 0) (<= 50000 main_~y~0))} is VALID [2022-04-28 03:42:14,197 INFO L290 TraceCheckUtils]: 8: Hoare triple {284#(and (= main_~z~0 0) (<= 50000 main_~y~0))} assume !(~y~0 > ~z~0); {280#false} is VALID [2022-04-28 03:42:14,197 INFO L272 TraceCheckUtils]: 9: Hoare triple {280#false} call __VERIFIER_assert((if ~x~0 == ~z~0 then 1 else 0)); {280#false} is VALID [2022-04-28 03:42:14,198 INFO L290 TraceCheckUtils]: 10: Hoare triple {280#false} ~cond := #in~cond; {280#false} is VALID [2022-04-28 03:42:14,198 INFO L290 TraceCheckUtils]: 11: Hoare triple {280#false} assume 0 == ~cond; {280#false} is VALID [2022-04-28 03:42:14,198 INFO L290 TraceCheckUtils]: 12: Hoare triple {280#false} assume !false; {280#false} is VALID [2022-04-28 03:42:14,198 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 03:42:14,198 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 03:42:14,198 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1524280620] [2022-04-28 03:42:14,199 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1524280620] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 03:42:14,199 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 03:42:14,199 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-28 03:42:14,251 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 03:42:14,251 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [539335531] [2022-04-28 03:42:14,251 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [539335531] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 03:42:14,251 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 03:42:14,251 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-28 03:42:14,251 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1272518831] [2022-04-28 03:42:14,251 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 03:42:14,252 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 1.6666666666666667) internal successors, (10), 5 states have internal predecessors, (10), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 14 [2022-04-28 03:42:14,252 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 03:42:14,252 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 6 states, 6 states have (on average 1.6666666666666667) internal successors, (10), 5 states have internal predecessors, (10), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:42:14,264 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 14 edges. 14 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 03:42:14,264 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-28 03:42:14,264 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 03:42:14,265 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-28 03:42:14,265 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2022-04-28 03:42:14,265 INFO L87 Difference]: Start difference. First operand 16 states and 18 transitions. Second operand has 6 states, 6 states have (on average 1.6666666666666667) internal successors, (10), 5 states have internal predecessors, (10), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:42:14,388 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:42:14,388 INFO L93 Difference]: Finished difference Result 26 states and 32 transitions. [2022-04-28 03:42:14,388 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-04-28 03:42:14,388 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 1.6666666666666667) internal successors, (10), 5 states have internal predecessors, (10), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 14 [2022-04-28 03:42:14,389 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 03:42:14,389 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 1.6666666666666667) internal successors, (10), 5 states have internal predecessors, (10), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:42:14,391 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 30 transitions. [2022-04-28 03:42:14,391 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 1.6666666666666667) internal successors, (10), 5 states have internal predecessors, (10), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:42:14,392 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 30 transitions. [2022-04-28 03:42:14,392 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 6 states and 30 transitions. [2022-04-28 03:42:14,421 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 30 edges. 30 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 03:42:14,422 INFO L225 Difference]: With dead ends: 26 [2022-04-28 03:42:14,422 INFO L226 Difference]: Without dead ends: 20 [2022-04-28 03:42:14,423 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 8 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2022-04-28 03:42:14,424 INFO L413 NwaCegarLoop]: 12 mSDtfsCounter, 15 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 24 SdHoareTripleChecker+Invalid, 36 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 21 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-28 03:42:14,424 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [15 Valid, 24 Invalid, 36 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-28 03:42:14,425 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2022-04-28 03:42:14,435 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 20. [2022-04-28 03:42:14,436 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 03:42:14,436 INFO L82 GeneralOperation]: Start isEquivalent. First operand 20 states. Second operand has 20 states, 15 states have (on average 1.2666666666666666) internal successors, (19), 15 states have internal predecessors, (19), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:42:14,436 INFO L74 IsIncluded]: Start isIncluded. First operand 20 states. Second operand has 20 states, 15 states have (on average 1.2666666666666666) internal successors, (19), 15 states have internal predecessors, (19), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:42:14,436 INFO L87 Difference]: Start difference. First operand 20 states. Second operand has 20 states, 15 states have (on average 1.2666666666666666) internal successors, (19), 15 states have internal predecessors, (19), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:42:14,438 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:42:14,438 INFO L93 Difference]: Finished difference Result 20 states and 23 transitions. [2022-04-28 03:42:14,438 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 23 transitions. [2022-04-28 03:42:14,438 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:42:14,438 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:42:14,438 INFO L74 IsIncluded]: Start isIncluded. First operand has 20 states, 15 states have (on average 1.2666666666666666) internal successors, (19), 15 states have internal predecessors, (19), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 20 states. [2022-04-28 03:42:14,439 INFO L87 Difference]: Start difference. First operand has 20 states, 15 states have (on average 1.2666666666666666) internal successors, (19), 15 states have internal predecessors, (19), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 20 states. [2022-04-28 03:42:14,440 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:42:14,440 INFO L93 Difference]: Finished difference Result 20 states and 23 transitions. [2022-04-28 03:42:14,440 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 23 transitions. [2022-04-28 03:42:14,440 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:42:14,440 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:42:14,440 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 03:42:14,441 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 03:42:14,441 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20 states, 15 states have (on average 1.2666666666666666) internal successors, (19), 15 states have internal predecessors, (19), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:42:14,442 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 23 transitions. [2022-04-28 03:42:14,442 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 23 transitions. Word has length 14 [2022-04-28 03:42:14,442 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 03:42:14,442 INFO L495 AbstractCegarLoop]: Abstraction has 20 states and 23 transitions. [2022-04-28 03:42:14,442 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 1.6666666666666667) internal successors, (10), 5 states have internal predecessors, (10), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:42:14,443 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 20 states and 23 transitions. [2022-04-28 03:42:14,465 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 23 edges. 23 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 03:42:14,465 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 23 transitions. [2022-04-28 03:42:14,466 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-04-28 03:42:14,466 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 03:42:14,466 INFO L195 NwaCegarLoop]: trace histogram [3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 03:42:14,466 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-04-28 03:42:14,466 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 03:42:14,467 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 03:42:14,467 INFO L85 PathProgramCache]: Analyzing trace with hash -1342594849, now seen corresponding path program 1 times [2022-04-28 03:42:14,467 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 03:42:14,467 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [881169168] [2022-04-28 03:42:18,598 WARN L977 rdanLoopAcceleration]: Unable to prove correctness of quantifier elimination. [2022-04-28 03:42:18,746 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 1 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 03:42:19,110 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={1=1, 2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 03:42:19,111 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-28 03:42:19,115 INFO L85 PathProgramCache]: Analyzing trace with hash -538275198, now seen corresponding path program 1 times [2022-04-28 03:42:19,115 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 03:42:19,115 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [618160233] [2022-04-28 03:42:19,115 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:42:19,115 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 03:42:19,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:42:19,252 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 03:42:19,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:42:19,259 INFO L290 TraceCheckUtils]: 0: Hoare triple {438#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(17, 2);call #Ultimate.allocInit(12, 3); {428#true} is VALID [2022-04-28 03:42:19,260 INFO L290 TraceCheckUtils]: 1: Hoare triple {428#true} assume true; {428#true} is VALID [2022-04-28 03:42:19,260 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {428#true} {428#true} #52#return; {428#true} is VALID [2022-04-28 03:42:19,261 INFO L272 TraceCheckUtils]: 0: Hoare triple {428#true} call ULTIMATE.init(); {438#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 03:42:19,261 INFO L290 TraceCheckUtils]: 1: Hoare triple {438#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(17, 2);call #Ultimate.allocInit(12, 3); {428#true} is VALID [2022-04-28 03:42:19,261 INFO L290 TraceCheckUtils]: 2: Hoare triple {428#true} assume true; {428#true} is VALID [2022-04-28 03:42:19,261 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {428#true} {428#true} #52#return; {428#true} is VALID [2022-04-28 03:42:19,261 INFO L272 TraceCheckUtils]: 4: Hoare triple {428#true} call #t~ret9 := main(); {428#true} is VALID [2022-04-28 03:42:19,262 INFO L290 TraceCheckUtils]: 5: Hoare triple {428#true} ~x~0 := 0;~y~0 := 50000;~z~0 := 0;~x~0 := 0; {433#(and (= main_~z~0 0) (= main_~x~0 0) (<= 50000 main_~y~0))} is VALID [2022-04-28 03:42:19,263 INFO L290 TraceCheckUtils]: 6: Hoare triple {433#(and (= main_~z~0 0) (= main_~x~0 0) (<= 50000 main_~y~0))} [60] L11-2-->L18-1_primed: Formula: (let ((.cse0 (= |v_main_#t~post4_9| |v_main_#t~post4_8|)) (.cse1 (= v_main_~x~0_21 v_main_~x~0_20))) (or (and (not (< v_main_~x~0_21 50000)) .cse0 .cse1) (and (< v_main_~x~0_20 50001) (< v_main_~x~0_21 v_main_~x~0_20)) (and .cse0 .cse1))) InVars {main_~x~0=v_main_~x~0_21, main_#t~post4=|v_main_#t~post4_9|} OutVars{main_~x~0=v_main_~x~0_20, main_#t~post4=|v_main_#t~post4_8|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {434#(or (= main_~x~0 0) (and (= main_~z~0 0) (<= main_~x~0 main_~y~0) (<= main_~x~0 50000)))} is VALID [2022-04-28 03:42:19,264 INFO L290 TraceCheckUtils]: 7: Hoare triple {434#(or (= main_~x~0 0) (and (= main_~z~0 0) (<= main_~x~0 main_~y~0) (<= main_~x~0 50000)))} [61] L18-1_primed-->L11-2: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {434#(or (= main_~x~0 0) (and (= main_~z~0 0) (<= main_~x~0 main_~y~0) (<= main_~x~0 50000)))} is VALID [2022-04-28 03:42:19,265 INFO L290 TraceCheckUtils]: 8: Hoare triple {434#(or (= main_~x~0 0) (and (= main_~z~0 0) (<= main_~x~0 main_~y~0) (<= main_~x~0 50000)))} [62] L11-2-->L18-1_primed: Formula: (let ((.cse0 (<= 50000 v_main_~x~0_23)) (.cse1 (= |v_main_#t~post6_4| |v_main_#t~post6_3|)) (.cse2 (= |v_main_#t~post5_4| |v_main_#t~post5_3|)) (.cse3 (= v_main_~y~0_8 v_main_~y~0_7)) (.cse4 (= v_main_~x~0_23 v_main_~x~0_22))) (or (and (< v_main_~x~0_22 1000001) .cse0 (< v_main_~x~0_23 v_main_~x~0_22) (= (+ v_main_~x~0_22 v_main_~y~0_8) (+ v_main_~x~0_23 v_main_~y~0_7))) (and .cse1 .cse2 .cse3 .cse4 (or (not .cse0) (not (< v_main_~x~0_23 1000000)))) (and .cse1 .cse2 .cse3 .cse4))) InVars {main_~y~0=v_main_~y~0_8, main_#t~post5=|v_main_#t~post5_4|, main_~x~0=v_main_~x~0_23, main_#t~post6=|v_main_#t~post6_4|} OutVars{main_~y~0=v_main_~y~0_7, main_#t~post5=|v_main_#t~post5_3|, main_~x~0=v_main_~x~0_22, main_#t~post6=|v_main_#t~post6_3|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {435#(or (and (= main_~z~0 0) (<= main_~x~0 main_~y~0)) (<= main_~x~0 50000))} is VALID [2022-04-28 03:42:19,266 INFO L290 TraceCheckUtils]: 9: Hoare triple {435#(or (and (= main_~z~0 0) (<= main_~x~0 main_~y~0)) (<= main_~x~0 50000))} [59] L18-1_primed-->L18-1: Formula: (not (< v_main_~x~0_11 1000000)) InVars {main_~x~0=v_main_~x~0_11} OutVars{main_~x~0=v_main_~x~0_11} AuxVars[] AssignedVars[] {436#(and (= main_~z~0 0) (<= 1000000 main_~y~0))} is VALID [2022-04-28 03:42:19,266 INFO L290 TraceCheckUtils]: 10: Hoare triple {436#(and (= main_~z~0 0) (<= 1000000 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {437#(and (= main_~z~0 0) (<= 999999 main_~y~0))} is VALID [2022-04-28 03:42:19,267 INFO L290 TraceCheckUtils]: 11: Hoare triple {437#(and (= main_~z~0 0) (<= 999999 main_~y~0))} assume !(~y~0 > ~z~0); {429#false} is VALID [2022-04-28 03:42:19,267 INFO L272 TraceCheckUtils]: 12: Hoare triple {429#false} call __VERIFIER_assert((if ~x~0 == ~z~0 then 1 else 0)); {429#false} is VALID [2022-04-28 03:42:19,267 INFO L290 TraceCheckUtils]: 13: Hoare triple {429#false} ~cond := #in~cond; {429#false} is VALID [2022-04-28 03:42:19,267 INFO L290 TraceCheckUtils]: 14: Hoare triple {429#false} assume 0 == ~cond; {429#false} is VALID [2022-04-28 03:42:19,268 INFO L290 TraceCheckUtils]: 15: Hoare triple {429#false} assume !false; {429#false} is VALID [2022-04-28 03:42:19,268 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 03:42:19,268 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 03:42:19,268 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [618160233] [2022-04-28 03:42:19,268 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [618160233] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 03:42:19,269 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1084779640] [2022-04-28 03:42:19,269 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:42:19,269 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 03:42:19,269 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 03:42:19,271 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 03:42:19,308 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-04-28 03:42:19,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:42:19,333 INFO L263 TraceCheckSpWp]: Trace formula consists of 64 conjuncts, 8 conjunts are in the unsatisfiable core [2022-04-28 03:42:19,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:42:19,349 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 03:42:19,923 INFO L272 TraceCheckUtils]: 0: Hoare triple {428#true} call ULTIMATE.init(); {428#true} is VALID [2022-04-28 03:42:19,924 INFO L290 TraceCheckUtils]: 1: Hoare triple {428#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(17, 2);call #Ultimate.allocInit(12, 3); {428#true} is VALID [2022-04-28 03:42:19,924 INFO L290 TraceCheckUtils]: 2: Hoare triple {428#true} assume true; {428#true} is VALID [2022-04-28 03:42:19,924 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {428#true} {428#true} #52#return; {428#true} is VALID [2022-04-28 03:42:19,924 INFO L272 TraceCheckUtils]: 4: Hoare triple {428#true} call #t~ret9 := main(); {428#true} is VALID [2022-04-28 03:42:19,926 INFO L290 TraceCheckUtils]: 5: Hoare triple {428#true} ~x~0 := 0;~y~0 := 50000;~z~0 := 0;~x~0 := 0; {457#(and (<= main_~z~0 0) (<= main_~x~0 0) (<= 50000 main_~y~0))} is VALID [2022-04-28 03:42:19,927 INFO L290 TraceCheckUtils]: 6: Hoare triple {457#(and (<= main_~z~0 0) (<= main_~x~0 0) (<= 50000 main_~y~0))} [60] L11-2-->L18-1_primed: Formula: (let ((.cse0 (= |v_main_#t~post4_9| |v_main_#t~post4_8|)) (.cse1 (= v_main_~x~0_21 v_main_~x~0_20))) (or (and (not (< v_main_~x~0_21 50000)) .cse0 .cse1) (and (< v_main_~x~0_20 50001) (< v_main_~x~0_21 v_main_~x~0_20)) (and .cse0 .cse1))) InVars {main_~x~0=v_main_~x~0_21, main_#t~post4=|v_main_#t~post4_9|} OutVars{main_~x~0=v_main_~x~0_20, main_#t~post4=|v_main_#t~post4_8|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {461#(and (<= main_~z~0 0) (< main_~x~0 50001) (<= 50000 main_~y~0))} is VALID [2022-04-28 03:42:19,927 INFO L290 TraceCheckUtils]: 7: Hoare triple {461#(and (<= main_~z~0 0) (< main_~x~0 50001) (<= 50000 main_~y~0))} [61] L18-1_primed-->L11-2: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {461#(and (<= main_~z~0 0) (< main_~x~0 50001) (<= 50000 main_~y~0))} is VALID [2022-04-28 03:42:19,931 INFO L290 TraceCheckUtils]: 8: Hoare triple {461#(and (<= main_~z~0 0) (< main_~x~0 50001) (<= 50000 main_~y~0))} [62] L11-2-->L18-1_primed: Formula: (let ((.cse0 (<= 50000 v_main_~x~0_23)) (.cse1 (= |v_main_#t~post6_4| |v_main_#t~post6_3|)) (.cse2 (= |v_main_#t~post5_4| |v_main_#t~post5_3|)) (.cse3 (= v_main_~y~0_8 v_main_~y~0_7)) (.cse4 (= v_main_~x~0_23 v_main_~x~0_22))) (or (and (< v_main_~x~0_22 1000001) .cse0 (< v_main_~x~0_23 v_main_~x~0_22) (= (+ v_main_~x~0_22 v_main_~y~0_8) (+ v_main_~x~0_23 v_main_~y~0_7))) (and .cse1 .cse2 .cse3 .cse4 (or (not .cse0) (not (< v_main_~x~0_23 1000000)))) (and .cse1 .cse2 .cse3 .cse4))) InVars {main_~y~0=v_main_~y~0_8, main_#t~post5=|v_main_#t~post5_4|, main_~x~0=v_main_~x~0_23, main_#t~post6=|v_main_#t~post6_4|} OutVars{main_~y~0=v_main_~y~0_7, main_#t~post5=|v_main_#t~post5_3|, main_~x~0=v_main_~x~0_22, main_#t~post6=|v_main_#t~post6_3|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {468#(and (<= main_~z~0 0) (or (and (< main_~x~0 50001) (<= 50000 main_~y~0)) (and (< main_~x~0 (+ main_~y~0 1)) (< main_~x~0 1000001) (< 50000 main_~x~0))))} is VALID [2022-04-28 03:42:19,935 INFO L290 TraceCheckUtils]: 9: Hoare triple {468#(and (<= main_~z~0 0) (or (and (< main_~x~0 50001) (<= 50000 main_~y~0)) (and (< main_~x~0 (+ main_~y~0 1)) (< main_~x~0 1000001) (< 50000 main_~x~0))))} [59] L18-1_primed-->L18-1: Formula: (not (< v_main_~x~0_11 1000000)) InVars {main_~x~0=v_main_~x~0_11} OutVars{main_~x~0=v_main_~x~0_11} AuxVars[] AssignedVars[] {472#(and (<= main_~z~0 0) (< 999999 main_~y~0))} is VALID [2022-04-28 03:42:19,936 INFO L290 TraceCheckUtils]: 10: Hoare triple {472#(and (<= main_~z~0 0) (< 999999 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {476#(and (<= main_~z~0 0) (< 999998 main_~y~0))} is VALID [2022-04-28 03:42:19,937 INFO L290 TraceCheckUtils]: 11: Hoare triple {476#(and (<= main_~z~0 0) (< 999998 main_~y~0))} assume !(~y~0 > ~z~0); {429#false} is VALID [2022-04-28 03:42:19,937 INFO L272 TraceCheckUtils]: 12: Hoare triple {429#false} call __VERIFIER_assert((if ~x~0 == ~z~0 then 1 else 0)); {429#false} is VALID [2022-04-28 03:42:19,937 INFO L290 TraceCheckUtils]: 13: Hoare triple {429#false} ~cond := #in~cond; {429#false} is VALID [2022-04-28 03:42:19,937 INFO L290 TraceCheckUtils]: 14: Hoare triple {429#false} assume 0 == ~cond; {429#false} is VALID [2022-04-28 03:42:19,938 INFO L290 TraceCheckUtils]: 15: Hoare triple {429#false} assume !false; {429#false} is VALID [2022-04-28 03:42:19,938 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 03:42:19,938 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 03:42:20,697 INFO L290 TraceCheckUtils]: 15: Hoare triple {429#false} assume !false; {429#false} is VALID [2022-04-28 03:42:20,698 INFO L290 TraceCheckUtils]: 14: Hoare triple {429#false} assume 0 == ~cond; {429#false} is VALID [2022-04-28 03:42:20,698 INFO L290 TraceCheckUtils]: 13: Hoare triple {429#false} ~cond := #in~cond; {429#false} is VALID [2022-04-28 03:42:20,698 INFO L272 TraceCheckUtils]: 12: Hoare triple {429#false} call __VERIFIER_assert((if ~x~0 == ~z~0 then 1 else 0)); {429#false} is VALID [2022-04-28 03:42:20,698 INFO L290 TraceCheckUtils]: 11: Hoare triple {504#(< main_~z~0 main_~y~0)} assume !(~y~0 > ~z~0); {429#false} is VALID [2022-04-28 03:42:20,699 INFO L290 TraceCheckUtils]: 10: Hoare triple {508#(< (+ main_~z~0 1) main_~y~0)} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {504#(< main_~z~0 main_~y~0)} is VALID [2022-04-28 03:42:20,700 INFO L290 TraceCheckUtils]: 9: Hoare triple {512#(or (< main_~x~0 1000000) (< (+ main_~z~0 1) main_~y~0))} [59] L18-1_primed-->L18-1: Formula: (not (< v_main_~x~0_11 1000000)) InVars {main_~x~0=v_main_~x~0_11} OutVars{main_~x~0=v_main_~x~0_11} AuxVars[] AssignedVars[] {508#(< (+ main_~z~0 1) main_~y~0)} is VALID [2022-04-28 03:42:20,702 INFO L290 TraceCheckUtils]: 8: Hoare triple {516#(and (or (< (+ main_~z~0 main_~x~0) (+ 999999 main_~y~0)) (<= (+ main_~z~0 1) main_~y~0) (not (<= 50000 main_~x~0))) (or (< main_~x~0 1000000) (< (+ main_~z~0 1) main_~y~0)))} [62] L11-2-->L18-1_primed: Formula: (let ((.cse0 (<= 50000 v_main_~x~0_23)) (.cse1 (= |v_main_#t~post6_4| |v_main_#t~post6_3|)) (.cse2 (= |v_main_#t~post5_4| |v_main_#t~post5_3|)) (.cse3 (= v_main_~y~0_8 v_main_~y~0_7)) (.cse4 (= v_main_~x~0_23 v_main_~x~0_22))) (or (and (< v_main_~x~0_22 1000001) .cse0 (< v_main_~x~0_23 v_main_~x~0_22) (= (+ v_main_~x~0_22 v_main_~y~0_8) (+ v_main_~x~0_23 v_main_~y~0_7))) (and .cse1 .cse2 .cse3 .cse4 (or (not .cse0) (not (< v_main_~x~0_23 1000000)))) (and .cse1 .cse2 .cse3 .cse4))) InVars {main_~y~0=v_main_~y~0_8, main_#t~post5=|v_main_#t~post5_4|, main_~x~0=v_main_~x~0_23, main_#t~post6=|v_main_#t~post6_4|} OutVars{main_~y~0=v_main_~y~0_7, main_#t~post5=|v_main_#t~post5_3|, main_~x~0=v_main_~x~0_22, main_#t~post6=|v_main_#t~post6_3|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {512#(or (< main_~x~0 1000000) (< (+ main_~z~0 1) main_~y~0))} is VALID [2022-04-28 03:42:20,703 INFO L290 TraceCheckUtils]: 7: Hoare triple {516#(and (or (< (+ main_~z~0 main_~x~0) (+ 999999 main_~y~0)) (<= (+ main_~z~0 1) main_~y~0) (not (<= 50000 main_~x~0))) (or (< main_~x~0 1000000) (< (+ main_~z~0 1) main_~y~0)))} [61] L18-1_primed-->L11-2: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {516#(and (or (< (+ main_~z~0 main_~x~0) (+ 999999 main_~y~0)) (<= (+ main_~z~0 1) main_~y~0) (not (<= 50000 main_~x~0))) (or (< main_~x~0 1000000) (< (+ main_~z~0 1) main_~y~0)))} is VALID [2022-04-28 03:42:20,704 INFO L290 TraceCheckUtils]: 6: Hoare triple {523#(and (or (and (<= main_~z~0 (+ main_~y~0 949998)) (< (+ main_~z~0 main_~x~0) (+ 999999 main_~y~0))) (<= (+ main_~z~0 1) main_~y~0)) (or (< main_~x~0 1000000) (< (+ main_~z~0 1) main_~y~0)))} [60] L11-2-->L18-1_primed: Formula: (let ((.cse0 (= |v_main_#t~post4_9| |v_main_#t~post4_8|)) (.cse1 (= v_main_~x~0_21 v_main_~x~0_20))) (or (and (not (< v_main_~x~0_21 50000)) .cse0 .cse1) (and (< v_main_~x~0_20 50001) (< v_main_~x~0_21 v_main_~x~0_20)) (and .cse0 .cse1))) InVars {main_~x~0=v_main_~x~0_21, main_#t~post4=|v_main_#t~post4_9|} OutVars{main_~x~0=v_main_~x~0_20, main_#t~post4=|v_main_#t~post4_8|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {516#(and (or (< (+ main_~z~0 main_~x~0) (+ 999999 main_~y~0)) (<= (+ main_~z~0 1) main_~y~0) (not (<= 50000 main_~x~0))) (or (< main_~x~0 1000000) (< (+ main_~z~0 1) main_~y~0)))} is VALID [2022-04-28 03:42:20,706 INFO L290 TraceCheckUtils]: 5: Hoare triple {428#true} ~x~0 := 0;~y~0 := 50000;~z~0 := 0;~x~0 := 0; {523#(and (or (and (<= main_~z~0 (+ main_~y~0 949998)) (< (+ main_~z~0 main_~x~0) (+ 999999 main_~y~0))) (<= (+ main_~z~0 1) main_~y~0)) (or (< main_~x~0 1000000) (< (+ main_~z~0 1) main_~y~0)))} is VALID [2022-04-28 03:42:20,706 INFO L272 TraceCheckUtils]: 4: Hoare triple {428#true} call #t~ret9 := main(); {428#true} is VALID [2022-04-28 03:42:20,706 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {428#true} {428#true} #52#return; {428#true} is VALID [2022-04-28 03:42:20,706 INFO L290 TraceCheckUtils]: 2: Hoare triple {428#true} assume true; {428#true} is VALID [2022-04-28 03:42:20,706 INFO L290 TraceCheckUtils]: 1: Hoare triple {428#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(17, 2);call #Ultimate.allocInit(12, 3); {428#true} is VALID [2022-04-28 03:42:20,707 INFO L272 TraceCheckUtils]: 0: Hoare triple {428#true} call ULTIMATE.init(); {428#true} is VALID [2022-04-28 03:42:20,707 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 03:42:20,707 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1084779640] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 03:42:20,707 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 03:42:20,707 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7, 7] total 18 [2022-04-28 03:42:20,930 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 03:42:20,930 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [881169168] [2022-04-28 03:42:20,930 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [881169168] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 03:42:20,930 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 03:42:20,930 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-04-28 03:42:20,930 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1801170624] [2022-04-28 03:42:20,931 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 03:42:20,931 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 1.6666666666666667) internal successors, (15), 8 states have internal predecessors, (15), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 19 [2022-04-28 03:42:20,931 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 03:42:20,931 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 9 states, 9 states have (on average 1.6666666666666667) internal successors, (15), 8 states have internal predecessors, (15), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:42:20,954 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 19 edges. 19 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 03:42:20,954 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-04-28 03:42:20,955 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 03:42:20,955 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-04-28 03:42:20,956 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=141, Invalid=321, Unknown=0, NotChecked=0, Total=462 [2022-04-28 03:42:20,956 INFO L87 Difference]: Start difference. First operand 20 states and 23 transitions. Second operand has 9 states, 9 states have (on average 1.6666666666666667) internal successors, (15), 8 states have internal predecessors, (15), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:42:21,269 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:42:21,269 INFO L93 Difference]: Finished difference Result 38 states and 48 transitions. [2022-04-28 03:42:21,269 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-04-28 03:42:21,270 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 1.6666666666666667) internal successors, (15), 8 states have internal predecessors, (15), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 19 [2022-04-28 03:42:21,270 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 03:42:21,270 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 9 states have (on average 1.6666666666666667) internal successors, (15), 8 states have internal predecessors, (15), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:42:21,271 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 38 transitions. [2022-04-28 03:42:21,272 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 9 states have (on average 1.6666666666666667) internal successors, (15), 8 states have internal predecessors, (15), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:42:21,273 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 38 transitions. [2022-04-28 03:42:21,273 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 7 states and 38 transitions. [2022-04-28 03:42:21,318 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 38 edges. 38 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 03:42:21,321 INFO L225 Difference]: With dead ends: 38 [2022-04-28 03:42:21,321 INFO L226 Difference]: Without dead ends: 26 [2022-04-28 03:42:21,322 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 30 SyntacticMatches, 2 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 158 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=191, Invalid=459, Unknown=0, NotChecked=0, Total=650 [2022-04-28 03:42:21,324 INFO L413 NwaCegarLoop]: 13 mSDtfsCounter, 14 mSDsluCounter, 27 mSDsCounter, 0 mSdLazyCounter, 85 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 40 SdHoareTripleChecker+Invalid, 95 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 85 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-28 03:42:21,325 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 40 Invalid, 95 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 85 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-28 03:42:21,327 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2022-04-28 03:42:21,357 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 26. [2022-04-28 03:42:21,357 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 03:42:21,359 INFO L82 GeneralOperation]: Start isEquivalent. First operand 26 states. Second operand has 26 states, 21 states have (on average 1.2380952380952381) internal successors, (26), 21 states have internal predecessors, (26), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:42:21,360 INFO L74 IsIncluded]: Start isIncluded. First operand 26 states. Second operand has 26 states, 21 states have (on average 1.2380952380952381) internal successors, (26), 21 states have internal predecessors, (26), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:42:21,360 INFO L87 Difference]: Start difference. First operand 26 states. Second operand has 26 states, 21 states have (on average 1.2380952380952381) internal successors, (26), 21 states have internal predecessors, (26), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:42:21,364 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:42:21,364 INFO L93 Difference]: Finished difference Result 26 states and 30 transitions. [2022-04-28 03:42:21,364 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 30 transitions. [2022-04-28 03:42:21,364 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:42:21,364 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:42:21,365 INFO L74 IsIncluded]: Start isIncluded. First operand has 26 states, 21 states have (on average 1.2380952380952381) internal successors, (26), 21 states have internal predecessors, (26), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 26 states. [2022-04-28 03:42:21,365 INFO L87 Difference]: Start difference. First operand has 26 states, 21 states have (on average 1.2380952380952381) internal successors, (26), 21 states have internal predecessors, (26), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 26 states. [2022-04-28 03:42:21,371 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:42:21,372 INFO L93 Difference]: Finished difference Result 26 states and 30 transitions. [2022-04-28 03:42:21,372 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 30 transitions. [2022-04-28 03:42:21,373 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:42:21,373 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:42:21,373 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 03:42:21,373 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 03:42:21,375 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26 states, 21 states have (on average 1.2380952380952381) internal successors, (26), 21 states have internal predecessors, (26), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:42:21,376 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 30 transitions. [2022-04-28 03:42:21,376 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 30 transitions. Word has length 19 [2022-04-28 03:42:21,376 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 03:42:21,376 INFO L495 AbstractCegarLoop]: Abstraction has 26 states and 30 transitions. [2022-04-28 03:42:21,376 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 1.6666666666666667) internal successors, (15), 8 states have internal predecessors, (15), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:42:21,376 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 26 states and 30 transitions. [2022-04-28 03:42:21,408 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 30 edges. 30 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 03:42:21,408 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 30 transitions. [2022-04-28 03:42:21,408 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-04-28 03:42:21,408 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 03:42:21,409 INFO L195 NwaCegarLoop]: trace histogram [4, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 03:42:21,431 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-04-28 03:42:21,623 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 03:42:21,624 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 03:42:21,624 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 03:42:21,624 INFO L85 PathProgramCache]: Analyzing trace with hash 952217402, now seen corresponding path program 2 times [2022-04-28 03:42:21,624 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 03:42:21,624 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1917486519] [2022-04-28 03:42:21,752 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 1 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 03:42:22,050 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={1=1, 2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 03:42:22,051 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-28 03:42:22,053 INFO L85 PathProgramCache]: Analyzing trace with hash 1967108994, now seen corresponding path program 1 times [2022-04-28 03:42:22,054 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 03:42:22,054 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1916600959] [2022-04-28 03:42:22,054 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:42:22,054 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 03:42:22,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:42:22,112 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 03:42:22,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:42:22,124 INFO L290 TraceCheckUtils]: 0: Hoare triple {743#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(17, 2);call #Ultimate.allocInit(12, 3); {736#true} is VALID [2022-04-28 03:42:22,125 INFO L290 TraceCheckUtils]: 1: Hoare triple {736#true} assume true; {736#true} is VALID [2022-04-28 03:42:22,125 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {736#true} {736#true} #52#return; {736#true} is VALID [2022-04-28 03:42:22,125 INFO L272 TraceCheckUtils]: 0: Hoare triple {736#true} call ULTIMATE.init(); {743#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 03:42:22,125 INFO L290 TraceCheckUtils]: 1: Hoare triple {743#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(17, 2);call #Ultimate.allocInit(12, 3); {736#true} is VALID [2022-04-28 03:42:22,126 INFO L290 TraceCheckUtils]: 2: Hoare triple {736#true} assume true; {736#true} is VALID [2022-04-28 03:42:22,126 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {736#true} {736#true} #52#return; {736#true} is VALID [2022-04-28 03:42:22,126 INFO L272 TraceCheckUtils]: 4: Hoare triple {736#true} call #t~ret9 := main(); {736#true} is VALID [2022-04-28 03:42:22,130 INFO L290 TraceCheckUtils]: 5: Hoare triple {736#true} ~x~0 := 0;~y~0 := 50000;~z~0 := 0;~x~0 := 0; {741#(and (= main_~z~0 0) (<= 50000 main_~y~0))} is VALID [2022-04-28 03:42:22,131 INFO L290 TraceCheckUtils]: 6: Hoare triple {741#(and (= main_~z~0 0) (<= 50000 main_~y~0))} [64] L11-2-->L18-1_primed: Formula: (let ((.cse0 (= v_main_~x~0_42 v_main_~x~0_41)) (.cse1 (= |v_main_#t~post4_16| |v_main_#t~post4_15|))) (or (and .cse0 (not (< v_main_~x~0_42 50000)) .cse1) (and .cse0 .cse1) (and (< v_main_~x~0_42 v_main_~x~0_41) (< v_main_~x~0_41 50001)))) InVars {main_~x~0=v_main_~x~0_42, main_#t~post4=|v_main_#t~post4_16|} OutVars{main_~x~0=v_main_~x~0_41, main_#t~post4=|v_main_#t~post4_15|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {741#(and (= main_~z~0 0) (<= 50000 main_~y~0))} is VALID [2022-04-28 03:42:22,132 INFO L290 TraceCheckUtils]: 7: Hoare triple {741#(and (= main_~z~0 0) (<= 50000 main_~y~0))} [65] L18-1_primed-->L11-2: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {741#(and (= main_~z~0 0) (<= 50000 main_~y~0))} is VALID [2022-04-28 03:42:22,133 INFO L290 TraceCheckUtils]: 8: Hoare triple {741#(and (= main_~z~0 0) (<= 50000 main_~y~0))} [66] L11-2-->L18-1_primed: Formula: (let ((.cse0 (<= 50000 v_main_~x~0_44)) (.cse1 (= v_main_~y~0_21 v_main_~y~0_20)) (.cse2 (= |v_main_#t~post5_11| |v_main_#t~post5_10|)) (.cse3 (= v_main_~x~0_44 v_main_~x~0_43)) (.cse4 (= |v_main_#t~post6_11| |v_main_#t~post6_10|))) (or (and (or (not (< v_main_~x~0_44 1000000)) (not .cse0)) .cse1 .cse2 .cse3 .cse4) (and .cse0 (= (+ v_main_~x~0_44 v_main_~y~0_20) (+ v_main_~x~0_43 v_main_~y~0_21)) (< v_main_~x~0_43 1000001) (< v_main_~x~0_44 v_main_~x~0_43)) (and .cse1 .cse2 .cse3 .cse4))) InVars {main_~y~0=v_main_~y~0_21, main_#t~post5=|v_main_#t~post5_11|, main_~x~0=v_main_~x~0_44, main_#t~post6=|v_main_#t~post6_11|} OutVars{main_~y~0=v_main_~y~0_20, main_#t~post5=|v_main_#t~post5_10|, main_~x~0=v_main_~x~0_43, main_#t~post6=|v_main_#t~post6_10|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {741#(and (= main_~z~0 0) (<= 50000 main_~y~0))} is VALID [2022-04-28 03:42:22,133 INFO L290 TraceCheckUtils]: 9: Hoare triple {741#(and (= main_~z~0 0) (<= 50000 main_~y~0))} [63] L18-1_primed-->L18-1: Formula: (not (< v_main_~x~0_11 1000000)) InVars {main_~x~0=v_main_~x~0_11} OutVars{main_~x~0=v_main_~x~0_11} AuxVars[] AssignedVars[] {741#(and (= main_~z~0 0) (<= 50000 main_~y~0))} is VALID [2022-04-28 03:42:22,134 INFO L290 TraceCheckUtils]: 10: Hoare triple {741#(and (= main_~z~0 0) (<= 50000 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {742#(and (= main_~z~0 0) (<= 49999 main_~y~0))} is VALID [2022-04-28 03:42:22,134 INFO L290 TraceCheckUtils]: 11: Hoare triple {742#(and (= main_~z~0 0) (<= 49999 main_~y~0))} assume !(~y~0 > ~z~0); {737#false} is VALID [2022-04-28 03:42:22,135 INFO L272 TraceCheckUtils]: 12: Hoare triple {737#false} call __VERIFIER_assert((if ~x~0 == ~z~0 then 1 else 0)); {737#false} is VALID [2022-04-28 03:42:22,135 INFO L290 TraceCheckUtils]: 13: Hoare triple {737#false} ~cond := #in~cond; {737#false} is VALID [2022-04-28 03:42:22,135 INFO L290 TraceCheckUtils]: 14: Hoare triple {737#false} assume 0 == ~cond; {737#false} is VALID [2022-04-28 03:42:22,135 INFO L290 TraceCheckUtils]: 15: Hoare triple {737#false} assume !false; {737#false} is VALID [2022-04-28 03:42:22,135 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-04-28 03:42:22,135 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 03:42:22,136 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1916600959] [2022-04-28 03:42:22,136 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1916600959] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 03:42:22,136 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1905164001] [2022-04-28 03:42:22,136 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:42:22,136 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 03:42:22,136 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 03:42:22,137 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 03:42:22,138 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-04-28 03:42:22,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:42:22,172 INFO L263 TraceCheckSpWp]: Trace formula consists of 64 conjuncts, 5 conjunts are in the unsatisfiable core [2022-04-28 03:42:22,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:42:22,181 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 03:42:22,478 INFO L272 TraceCheckUtils]: 0: Hoare triple {736#true} call ULTIMATE.init(); {736#true} is VALID [2022-04-28 03:42:22,480 INFO L290 TraceCheckUtils]: 1: Hoare triple {736#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(17, 2);call #Ultimate.allocInit(12, 3); {736#true} is VALID [2022-04-28 03:42:22,480 INFO L290 TraceCheckUtils]: 2: Hoare triple {736#true} assume true; {736#true} is VALID [2022-04-28 03:42:22,488 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {736#true} {736#true} #52#return; {736#true} is VALID [2022-04-28 03:42:22,488 INFO L272 TraceCheckUtils]: 4: Hoare triple {736#true} call #t~ret9 := main(); {736#true} is VALID [2022-04-28 03:42:22,489 INFO L290 TraceCheckUtils]: 5: Hoare triple {736#true} ~x~0 := 0;~y~0 := 50000;~z~0 := 0;~x~0 := 0; {762#(and (<= main_~z~0 0) (<= 50000 main_~y~0))} is VALID [2022-04-28 03:42:22,489 INFO L290 TraceCheckUtils]: 6: Hoare triple {762#(and (<= main_~z~0 0) (<= 50000 main_~y~0))} [64] L11-2-->L18-1_primed: Formula: (let ((.cse0 (= v_main_~x~0_42 v_main_~x~0_41)) (.cse1 (= |v_main_#t~post4_16| |v_main_#t~post4_15|))) (or (and .cse0 (not (< v_main_~x~0_42 50000)) .cse1) (and .cse0 .cse1) (and (< v_main_~x~0_42 v_main_~x~0_41) (< v_main_~x~0_41 50001)))) InVars {main_~x~0=v_main_~x~0_42, main_#t~post4=|v_main_#t~post4_16|} OutVars{main_~x~0=v_main_~x~0_41, main_#t~post4=|v_main_#t~post4_15|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {762#(and (<= main_~z~0 0) (<= 50000 main_~y~0))} is VALID [2022-04-28 03:42:22,490 INFO L290 TraceCheckUtils]: 7: Hoare triple {762#(and (<= main_~z~0 0) (<= 50000 main_~y~0))} [65] L18-1_primed-->L11-2: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {762#(and (<= main_~z~0 0) (<= 50000 main_~y~0))} is VALID [2022-04-28 03:42:22,491 INFO L290 TraceCheckUtils]: 8: Hoare triple {762#(and (<= main_~z~0 0) (<= 50000 main_~y~0))} [66] L11-2-->L18-1_primed: Formula: (let ((.cse0 (<= 50000 v_main_~x~0_44)) (.cse1 (= v_main_~y~0_21 v_main_~y~0_20)) (.cse2 (= |v_main_#t~post5_11| |v_main_#t~post5_10|)) (.cse3 (= v_main_~x~0_44 v_main_~x~0_43)) (.cse4 (= |v_main_#t~post6_11| |v_main_#t~post6_10|))) (or (and (or (not (< v_main_~x~0_44 1000000)) (not .cse0)) .cse1 .cse2 .cse3 .cse4) (and .cse0 (= (+ v_main_~x~0_44 v_main_~y~0_20) (+ v_main_~x~0_43 v_main_~y~0_21)) (< v_main_~x~0_43 1000001) (< v_main_~x~0_44 v_main_~x~0_43)) (and .cse1 .cse2 .cse3 .cse4))) InVars {main_~y~0=v_main_~y~0_21, main_#t~post5=|v_main_#t~post5_11|, main_~x~0=v_main_~x~0_44, main_#t~post6=|v_main_#t~post6_11|} OutVars{main_~y~0=v_main_~y~0_20, main_#t~post5=|v_main_#t~post5_10|, main_~x~0=v_main_~x~0_43, main_#t~post6=|v_main_#t~post6_10|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {762#(and (<= main_~z~0 0) (<= 50000 main_~y~0))} is VALID [2022-04-28 03:42:22,491 INFO L290 TraceCheckUtils]: 9: Hoare triple {762#(and (<= main_~z~0 0) (<= 50000 main_~y~0))} [63] L18-1_primed-->L18-1: Formula: (not (< v_main_~x~0_11 1000000)) InVars {main_~x~0=v_main_~x~0_11} OutVars{main_~x~0=v_main_~x~0_11} AuxVars[] AssignedVars[] {762#(and (<= main_~z~0 0) (<= 50000 main_~y~0))} is VALID [2022-04-28 03:42:22,492 INFO L290 TraceCheckUtils]: 10: Hoare triple {762#(and (<= main_~z~0 0) (<= 50000 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {778#(and (<= main_~z~0 0) (<= 49999 main_~y~0))} is VALID [2022-04-28 03:42:22,492 INFO L290 TraceCheckUtils]: 11: Hoare triple {778#(and (<= main_~z~0 0) (<= 49999 main_~y~0))} assume !(~y~0 > ~z~0); {737#false} is VALID [2022-04-28 03:42:22,492 INFO L272 TraceCheckUtils]: 12: Hoare triple {737#false} call __VERIFIER_assert((if ~x~0 == ~z~0 then 1 else 0)); {737#false} is VALID [2022-04-28 03:42:22,493 INFO L290 TraceCheckUtils]: 13: Hoare triple {737#false} ~cond := #in~cond; {737#false} is VALID [2022-04-28 03:42:22,493 INFO L290 TraceCheckUtils]: 14: Hoare triple {737#false} assume 0 == ~cond; {737#false} is VALID [2022-04-28 03:42:22,493 INFO L290 TraceCheckUtils]: 15: Hoare triple {737#false} assume !false; {737#false} is VALID [2022-04-28 03:42:22,493 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-04-28 03:42:22,493 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 03:42:22,815 INFO L290 TraceCheckUtils]: 15: Hoare triple {737#false} assume !false; {737#false} is VALID [2022-04-28 03:42:22,816 INFO L290 TraceCheckUtils]: 14: Hoare triple {737#false} assume 0 == ~cond; {737#false} is VALID [2022-04-28 03:42:22,816 INFO L290 TraceCheckUtils]: 13: Hoare triple {737#false} ~cond := #in~cond; {737#false} is VALID [2022-04-28 03:42:22,816 INFO L272 TraceCheckUtils]: 12: Hoare triple {737#false} call __VERIFIER_assert((if ~x~0 == ~z~0 then 1 else 0)); {737#false} is VALID [2022-04-28 03:42:22,816 INFO L290 TraceCheckUtils]: 11: Hoare triple {806#(< main_~z~0 main_~y~0)} assume !(~y~0 > ~z~0); {737#false} is VALID [2022-04-28 03:42:22,817 INFO L290 TraceCheckUtils]: 10: Hoare triple {810#(< (+ main_~z~0 1) main_~y~0)} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {806#(< main_~z~0 main_~y~0)} is VALID [2022-04-28 03:42:22,817 INFO L290 TraceCheckUtils]: 9: Hoare triple {810#(< (+ main_~z~0 1) main_~y~0)} [63] L18-1_primed-->L18-1: Formula: (not (< v_main_~x~0_11 1000000)) InVars {main_~x~0=v_main_~x~0_11} OutVars{main_~x~0=v_main_~x~0_11} AuxVars[] AssignedVars[] {810#(< (+ main_~z~0 1) main_~y~0)} is VALID [2022-04-28 03:42:22,818 INFO L290 TraceCheckUtils]: 8: Hoare triple {810#(< (+ main_~z~0 1) main_~y~0)} [66] L11-2-->L18-1_primed: Formula: (let ((.cse0 (<= 50000 v_main_~x~0_44)) (.cse1 (= v_main_~y~0_21 v_main_~y~0_20)) (.cse2 (= |v_main_#t~post5_11| |v_main_#t~post5_10|)) (.cse3 (= v_main_~x~0_44 v_main_~x~0_43)) (.cse4 (= |v_main_#t~post6_11| |v_main_#t~post6_10|))) (or (and (or (not (< v_main_~x~0_44 1000000)) (not .cse0)) .cse1 .cse2 .cse3 .cse4) (and .cse0 (= (+ v_main_~x~0_44 v_main_~y~0_20) (+ v_main_~x~0_43 v_main_~y~0_21)) (< v_main_~x~0_43 1000001) (< v_main_~x~0_44 v_main_~x~0_43)) (and .cse1 .cse2 .cse3 .cse4))) InVars {main_~y~0=v_main_~y~0_21, main_#t~post5=|v_main_#t~post5_11|, main_~x~0=v_main_~x~0_44, main_#t~post6=|v_main_#t~post6_11|} OutVars{main_~y~0=v_main_~y~0_20, main_#t~post5=|v_main_#t~post5_10|, main_~x~0=v_main_~x~0_43, main_#t~post6=|v_main_#t~post6_10|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {810#(< (+ main_~z~0 1) main_~y~0)} is VALID [2022-04-28 03:42:22,819 INFO L290 TraceCheckUtils]: 7: Hoare triple {810#(< (+ main_~z~0 1) main_~y~0)} [65] L18-1_primed-->L11-2: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {810#(< (+ main_~z~0 1) main_~y~0)} is VALID [2022-04-28 03:42:22,819 INFO L290 TraceCheckUtils]: 6: Hoare triple {810#(< (+ main_~z~0 1) main_~y~0)} [64] L11-2-->L18-1_primed: Formula: (let ((.cse0 (= v_main_~x~0_42 v_main_~x~0_41)) (.cse1 (= |v_main_#t~post4_16| |v_main_#t~post4_15|))) (or (and .cse0 (not (< v_main_~x~0_42 50000)) .cse1) (and .cse0 .cse1) (and (< v_main_~x~0_42 v_main_~x~0_41) (< v_main_~x~0_41 50001)))) InVars {main_~x~0=v_main_~x~0_42, main_#t~post4=|v_main_#t~post4_16|} OutVars{main_~x~0=v_main_~x~0_41, main_#t~post4=|v_main_#t~post4_15|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {810#(< (+ main_~z~0 1) main_~y~0)} is VALID [2022-04-28 03:42:22,819 INFO L290 TraceCheckUtils]: 5: Hoare triple {736#true} ~x~0 := 0;~y~0 := 50000;~z~0 := 0;~x~0 := 0; {810#(< (+ main_~z~0 1) main_~y~0)} is VALID [2022-04-28 03:42:22,820 INFO L272 TraceCheckUtils]: 4: Hoare triple {736#true} call #t~ret9 := main(); {736#true} is VALID [2022-04-28 03:42:22,820 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {736#true} {736#true} #52#return; {736#true} is VALID [2022-04-28 03:42:22,820 INFO L290 TraceCheckUtils]: 2: Hoare triple {736#true} assume true; {736#true} is VALID [2022-04-28 03:42:22,820 INFO L290 TraceCheckUtils]: 1: Hoare triple {736#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(17, 2);call #Ultimate.allocInit(12, 3); {736#true} is VALID [2022-04-28 03:42:22,820 INFO L272 TraceCheckUtils]: 0: Hoare triple {736#true} call ULTIMATE.init(); {736#true} is VALID [2022-04-28 03:42:22,820 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-04-28 03:42:22,820 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1905164001] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 03:42:22,820 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 03:42:22,820 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4, 4] total 9 [2022-04-28 03:42:22,989 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 03:42:22,989 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1917486519] [2022-04-28 03:42:22,989 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1917486519] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 03:42:22,989 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 03:42:22,989 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-04-28 03:42:22,989 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1833515465] [2022-04-28 03:42:22,989 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 03:42:22,991 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 1.7) internal successors, (17), 9 states have internal predecessors, (17), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 21 [2022-04-28 03:42:22,991 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 03:42:22,991 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 10 states, 10 states have (on average 1.7) internal successors, (17), 9 states have internal predecessors, (17), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:42:23,007 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 21 edges. 21 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 03:42:23,007 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-04-28 03:42:23,007 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 03:42:23,008 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-04-28 03:42:23,008 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=73, Invalid=109, Unknown=0, NotChecked=0, Total=182 [2022-04-28 03:42:23,009 INFO L87 Difference]: Start difference. First operand 26 states and 30 transitions. Second operand has 10 states, 10 states have (on average 1.7) internal successors, (17), 9 states have internal predecessors, (17), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:42:23,326 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:42:23,326 INFO L93 Difference]: Finished difference Result 45 states and 59 transitions. [2022-04-28 03:42:23,326 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-04-28 03:42:23,327 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 1.7) internal successors, (17), 9 states have internal predecessors, (17), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 21 [2022-04-28 03:42:23,327 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 03:42:23,327 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 10 states have (on average 1.7) internal successors, (17), 9 states have internal predecessors, (17), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:42:23,329 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 45 transitions. [2022-04-28 03:42:23,329 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 10 states have (on average 1.7) internal successors, (17), 9 states have internal predecessors, (17), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:42:23,330 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 45 transitions. [2022-04-28 03:42:23,330 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 10 states and 45 transitions. [2022-04-28 03:42:23,368 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 45 edges. 45 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 03:42:23,369 INFO L225 Difference]: With dead ends: 45 [2022-04-28 03:42:23,369 INFO L226 Difference]: Without dead ends: 33 [2022-04-28 03:42:23,370 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 38 SyntacticMatches, 2 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 91 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=158, Invalid=262, Unknown=0, NotChecked=0, Total=420 [2022-04-28 03:42:23,370 INFO L413 NwaCegarLoop]: 12 mSDtfsCounter, 21 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 64 mSolverCounterSat, 31 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 29 SdHoareTripleChecker+Invalid, 95 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 31 IncrementalHoareTripleChecker+Valid, 64 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-28 03:42:23,371 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [21 Valid, 29 Invalid, 95 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [31 Valid, 64 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-28 03:42:23,371 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2022-04-28 03:42:23,400 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 27. [2022-04-28 03:42:23,401 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 03:42:23,401 INFO L82 GeneralOperation]: Start isEquivalent. First operand 33 states. Second operand has 27 states, 22 states have (on average 1.1818181818181819) internal successors, (26), 22 states have internal predecessors, (26), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:42:23,401 INFO L74 IsIncluded]: Start isIncluded. First operand 33 states. Second operand has 27 states, 22 states have (on average 1.1818181818181819) internal successors, (26), 22 states have internal predecessors, (26), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:42:23,401 INFO L87 Difference]: Start difference. First operand 33 states. Second operand has 27 states, 22 states have (on average 1.1818181818181819) internal successors, (26), 22 states have internal predecessors, (26), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:42:23,402 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:42:23,402 INFO L93 Difference]: Finished difference Result 33 states and 37 transitions. [2022-04-28 03:42:23,402 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 37 transitions. [2022-04-28 03:42:23,403 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:42:23,403 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:42:23,403 INFO L74 IsIncluded]: Start isIncluded. First operand has 27 states, 22 states have (on average 1.1818181818181819) internal successors, (26), 22 states have internal predecessors, (26), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 33 states. [2022-04-28 03:42:23,403 INFO L87 Difference]: Start difference. First operand has 27 states, 22 states have (on average 1.1818181818181819) internal successors, (26), 22 states have internal predecessors, (26), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 33 states. [2022-04-28 03:42:23,404 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:42:23,404 INFO L93 Difference]: Finished difference Result 33 states and 37 transitions. [2022-04-28 03:42:23,404 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 37 transitions. [2022-04-28 03:42:23,405 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:42:23,405 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:42:23,405 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 03:42:23,405 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 03:42:23,405 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27 states, 22 states have (on average 1.1818181818181819) internal successors, (26), 22 states have internal predecessors, (26), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:42:23,406 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 30 transitions. [2022-04-28 03:42:23,406 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 30 transitions. Word has length 21 [2022-04-28 03:42:23,406 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 03:42:23,406 INFO L495 AbstractCegarLoop]: Abstraction has 27 states and 30 transitions. [2022-04-28 03:42:23,407 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 1.7) internal successors, (17), 9 states have internal predecessors, (17), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:42:23,407 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 27 states and 30 transitions. [2022-04-28 03:42:23,439 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 30 edges. 30 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 03:42:23,439 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 30 transitions. [2022-04-28 03:42:23,440 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2022-04-28 03:42:23,440 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 03:42:23,441 INFO L195 NwaCegarLoop]: trace histogram [6, 5, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 03:42:23,465 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-04-28 03:42:23,657 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 03:42:23,658 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 03:42:23,658 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 03:42:23,658 INFO L85 PathProgramCache]: Analyzing trace with hash 2108341683, now seen corresponding path program 3 times [2022-04-28 03:42:23,658 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 03:42:23,658 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1234860213] [2022-04-28 03:42:25,946 WARN L977 rdanLoopAcceleration]: Unable to prove correctness of quantifier elimination. [2022-04-28 03:42:26,006 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 1 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 03:42:26,318 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={1=1, 2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 03:42:26,319 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-28 03:42:26,322 INFO L85 PathProgramCache]: Analyzing trace with hash 1243873057, now seen corresponding path program 1 times [2022-04-28 03:42:26,322 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 03:42:26,322 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1394806138] [2022-04-28 03:42:26,322 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:42:26,322 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 03:42:26,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:42:26,461 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 03:42:26,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:42:26,468 INFO L290 TraceCheckUtils]: 0: Hoare triple {1083#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(17, 2);call #Ultimate.allocInit(12, 3); {1072#true} is VALID [2022-04-28 03:42:26,468 INFO L290 TraceCheckUtils]: 1: Hoare triple {1072#true} assume true; {1072#true} is VALID [2022-04-28 03:42:26,468 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {1072#true} {1072#true} #52#return; {1072#true} is VALID [2022-04-28 03:42:26,469 INFO L272 TraceCheckUtils]: 0: Hoare triple {1072#true} call ULTIMATE.init(); {1083#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 03:42:26,469 INFO L290 TraceCheckUtils]: 1: Hoare triple {1083#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(17, 2);call #Ultimate.allocInit(12, 3); {1072#true} is VALID [2022-04-28 03:42:26,469 INFO L290 TraceCheckUtils]: 2: Hoare triple {1072#true} assume true; {1072#true} is VALID [2022-04-28 03:42:26,469 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1072#true} {1072#true} #52#return; {1072#true} is VALID [2022-04-28 03:42:26,470 INFO L272 TraceCheckUtils]: 4: Hoare triple {1072#true} call #t~ret9 := main(); {1072#true} is VALID [2022-04-28 03:42:26,470 INFO L290 TraceCheckUtils]: 5: Hoare triple {1072#true} ~x~0 := 0;~y~0 := 50000;~z~0 := 0;~x~0 := 0; {1077#(and (= main_~z~0 0) (= main_~x~0 0) (<= 50000 main_~y~0))} is VALID [2022-04-28 03:42:26,471 INFO L290 TraceCheckUtils]: 6: Hoare triple {1077#(and (= main_~z~0 0) (= main_~x~0 0) (<= 50000 main_~y~0))} [68] L11-2-->L18-1_primed: Formula: (let ((.cse0 (= |v_main_#t~post4_22| |v_main_#t~post4_21|)) (.cse1 (= v_main_~x~0_63 v_main_~x~0_62))) (or (and .cse0 (<= 50000 v_main_~x~0_63) .cse1) (and .cse0 .cse1) (and (< v_main_~x~0_62 50001) (< v_main_~x~0_63 v_main_~x~0_62)))) InVars {main_~x~0=v_main_~x~0_63, main_#t~post4=|v_main_#t~post4_22|} OutVars{main_~x~0=v_main_~x~0_62, main_#t~post4=|v_main_#t~post4_21|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {1078#(and (= main_~z~0 0) (<= main_~x~0 main_~y~0) (<= main_~x~0 50000))} is VALID [2022-04-28 03:42:26,472 INFO L290 TraceCheckUtils]: 7: Hoare triple {1078#(and (= main_~z~0 0) (<= main_~x~0 main_~y~0) (<= main_~x~0 50000))} [69] L18-1_primed-->L11-2: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1078#(and (= main_~z~0 0) (<= main_~x~0 main_~y~0) (<= main_~x~0 50000))} is VALID [2022-04-28 03:42:26,473 INFO L290 TraceCheckUtils]: 8: Hoare triple {1078#(and (= main_~z~0 0) (<= main_~x~0 main_~y~0) (<= main_~x~0 50000))} [70] L11-2-->L18-1_primed: Formula: (let ((.cse0 (<= 50000 v_main_~x~0_65)) (.cse1 (= |v_main_#t~post5_18| |v_main_#t~post5_17|)) (.cse2 (= v_main_~x~0_65 v_main_~x~0_64)) (.cse3 (= v_main_~y~0_35 v_main_~y~0_34)) (.cse4 (= |v_main_#t~post6_18| |v_main_#t~post6_17|))) (or (and .cse0 (< v_main_~x~0_65 v_main_~x~0_64) (= (+ v_main_~x~0_64 v_main_~y~0_35) (+ v_main_~x~0_65 v_main_~y~0_34)) (< v_main_~x~0_64 1000001)) (and (or (not (< v_main_~x~0_65 1000000)) (not .cse0)) .cse1 .cse2 .cse3 .cse4) (and .cse1 .cse2 .cse3 .cse4))) InVars {main_~y~0=v_main_~y~0_35, main_#t~post5=|v_main_#t~post5_18|, main_~x~0=v_main_~x~0_65, main_#t~post6=|v_main_#t~post6_18|} OutVars{main_~y~0=v_main_~y~0_34, main_#t~post5=|v_main_#t~post5_17|, main_~x~0=v_main_~x~0_64, main_#t~post6=|v_main_#t~post6_17|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {1079#(and (= main_~z~0 0) (or (<= main_~x~0 main_~y~0) (<= main_~x~0 50000)))} is VALID [2022-04-28 03:42:26,473 INFO L290 TraceCheckUtils]: 9: Hoare triple {1079#(and (= main_~z~0 0) (or (<= main_~x~0 main_~y~0) (<= main_~x~0 50000)))} [67] L18-1_primed-->L18-1: Formula: (not (< v_main_~x~0_11 1000000)) InVars {main_~x~0=v_main_~x~0_11} OutVars{main_~x~0=v_main_~x~0_11} AuxVars[] AssignedVars[] {1080#(and (= main_~z~0 0) (<= 1000000 main_~y~0))} is VALID [2022-04-28 03:42:26,474 INFO L290 TraceCheckUtils]: 10: Hoare triple {1080#(and (= main_~z~0 0) (<= 1000000 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {1081#(and (= main_~z~0 0) (<= 999999 main_~y~0))} is VALID [2022-04-28 03:42:26,475 INFO L290 TraceCheckUtils]: 11: Hoare triple {1081#(and (= main_~z~0 0) (<= 999999 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {1082#(and (= main_~z~0 0) (<= 999998 main_~y~0))} is VALID [2022-04-28 03:42:26,475 INFO L290 TraceCheckUtils]: 12: Hoare triple {1082#(and (= main_~z~0 0) (<= 999998 main_~y~0))} assume !(~y~0 > ~z~0); {1073#false} is VALID [2022-04-28 03:42:26,475 INFO L272 TraceCheckUtils]: 13: Hoare triple {1073#false} call __VERIFIER_assert((if ~x~0 == ~z~0 then 1 else 0)); {1073#false} is VALID [2022-04-28 03:42:26,476 INFO L290 TraceCheckUtils]: 14: Hoare triple {1073#false} ~cond := #in~cond; {1073#false} is VALID [2022-04-28 03:42:26,476 INFO L290 TraceCheckUtils]: 15: Hoare triple {1073#false} assume 0 == ~cond; {1073#false} is VALID [2022-04-28 03:42:26,476 INFO L290 TraceCheckUtils]: 16: Hoare triple {1073#false} assume !false; {1073#false} is VALID [2022-04-28 03:42:26,476 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 03:42:26,476 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 03:42:26,476 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1394806138] [2022-04-28 03:42:26,476 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1394806138] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 03:42:26,476 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [197097570] [2022-04-28 03:42:26,477 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:42:26,477 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 03:42:26,477 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 03:42:26,478 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 03:42:26,479 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-04-28 03:42:26,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:42:26,509 INFO L263 TraceCheckSpWp]: Trace formula consists of 69 conjuncts, 9 conjunts are in the unsatisfiable core [2022-04-28 03:42:26,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:42:26,520 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 03:42:27,017 INFO L272 TraceCheckUtils]: 0: Hoare triple {1072#true} call ULTIMATE.init(); {1072#true} is VALID [2022-04-28 03:42:27,018 INFO L290 TraceCheckUtils]: 1: Hoare triple {1072#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(17, 2);call #Ultimate.allocInit(12, 3); {1072#true} is VALID [2022-04-28 03:42:27,018 INFO L290 TraceCheckUtils]: 2: Hoare triple {1072#true} assume true; {1072#true} is VALID [2022-04-28 03:42:27,018 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1072#true} {1072#true} #52#return; {1072#true} is VALID [2022-04-28 03:42:27,018 INFO L272 TraceCheckUtils]: 4: Hoare triple {1072#true} call #t~ret9 := main(); {1072#true} is VALID [2022-04-28 03:42:27,019 INFO L290 TraceCheckUtils]: 5: Hoare triple {1072#true} ~x~0 := 0;~y~0 := 50000;~z~0 := 0;~x~0 := 0; {1102#(and (<= main_~z~0 0) (<= main_~x~0 0) (<= 50000 main_~y~0))} is VALID [2022-04-28 03:42:27,019 INFO L290 TraceCheckUtils]: 6: Hoare triple {1102#(and (<= main_~z~0 0) (<= main_~x~0 0) (<= 50000 main_~y~0))} [68] L11-2-->L18-1_primed: Formula: (let ((.cse0 (= |v_main_#t~post4_22| |v_main_#t~post4_21|)) (.cse1 (= v_main_~x~0_63 v_main_~x~0_62))) (or (and .cse0 (<= 50000 v_main_~x~0_63) .cse1) (and .cse0 .cse1) (and (< v_main_~x~0_62 50001) (< v_main_~x~0_63 v_main_~x~0_62)))) InVars {main_~x~0=v_main_~x~0_63, main_#t~post4=|v_main_#t~post4_22|} OutVars{main_~x~0=v_main_~x~0_62, main_#t~post4=|v_main_#t~post4_21|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {1106#(and (<= main_~z~0 0) (< main_~x~0 50001) (<= 50000 main_~y~0))} is VALID [2022-04-28 03:42:27,020 INFO L290 TraceCheckUtils]: 7: Hoare triple {1106#(and (<= main_~z~0 0) (< main_~x~0 50001) (<= 50000 main_~y~0))} [69] L18-1_primed-->L11-2: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1106#(and (<= main_~z~0 0) (< main_~x~0 50001) (<= 50000 main_~y~0))} is VALID [2022-04-28 03:42:27,021 INFO L290 TraceCheckUtils]: 8: Hoare triple {1106#(and (<= main_~z~0 0) (< main_~x~0 50001) (<= 50000 main_~y~0))} [70] L11-2-->L18-1_primed: Formula: (let ((.cse0 (<= 50000 v_main_~x~0_65)) (.cse1 (= |v_main_#t~post5_18| |v_main_#t~post5_17|)) (.cse2 (= v_main_~x~0_65 v_main_~x~0_64)) (.cse3 (= v_main_~y~0_35 v_main_~y~0_34)) (.cse4 (= |v_main_#t~post6_18| |v_main_#t~post6_17|))) (or (and .cse0 (< v_main_~x~0_65 v_main_~x~0_64) (= (+ v_main_~x~0_64 v_main_~y~0_35) (+ v_main_~x~0_65 v_main_~y~0_34)) (< v_main_~x~0_64 1000001)) (and (or (not (< v_main_~x~0_65 1000000)) (not .cse0)) .cse1 .cse2 .cse3 .cse4) (and .cse1 .cse2 .cse3 .cse4))) InVars {main_~y~0=v_main_~y~0_35, main_#t~post5=|v_main_#t~post5_18|, main_~x~0=v_main_~x~0_65, main_#t~post6=|v_main_#t~post6_18|} OutVars{main_~y~0=v_main_~y~0_34, main_#t~post5=|v_main_#t~post5_17|, main_~x~0=v_main_~x~0_64, main_#t~post6=|v_main_#t~post6_17|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {1113#(and (<= main_~z~0 0) (or (and (< main_~x~0 50001) (<= 50000 main_~y~0)) (and (< main_~x~0 (+ main_~y~0 1)) (< main_~x~0 1000001) (< 50000 main_~x~0))))} is VALID [2022-04-28 03:42:27,022 INFO L290 TraceCheckUtils]: 9: Hoare triple {1113#(and (<= main_~z~0 0) (or (and (< main_~x~0 50001) (<= 50000 main_~y~0)) (and (< main_~x~0 (+ main_~y~0 1)) (< main_~x~0 1000001) (< 50000 main_~x~0))))} [67] L18-1_primed-->L18-1: Formula: (not (< v_main_~x~0_11 1000000)) InVars {main_~x~0=v_main_~x~0_11} OutVars{main_~x~0=v_main_~x~0_11} AuxVars[] AssignedVars[] {1117#(and (<= main_~z~0 0) (< 999999 main_~y~0))} is VALID [2022-04-28 03:42:27,022 INFO L290 TraceCheckUtils]: 10: Hoare triple {1117#(and (<= main_~z~0 0) (< 999999 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {1121#(and (<= main_~z~0 0) (< 999998 main_~y~0))} is VALID [2022-04-28 03:42:27,023 INFO L290 TraceCheckUtils]: 11: Hoare triple {1121#(and (<= main_~z~0 0) (< 999998 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {1125#(and (<= main_~z~0 0) (< 999997 main_~y~0))} is VALID [2022-04-28 03:42:27,024 INFO L290 TraceCheckUtils]: 12: Hoare triple {1125#(and (<= main_~z~0 0) (< 999997 main_~y~0))} assume !(~y~0 > ~z~0); {1073#false} is VALID [2022-04-28 03:42:27,024 INFO L272 TraceCheckUtils]: 13: Hoare triple {1073#false} call __VERIFIER_assert((if ~x~0 == ~z~0 then 1 else 0)); {1073#false} is VALID [2022-04-28 03:42:27,024 INFO L290 TraceCheckUtils]: 14: Hoare triple {1073#false} ~cond := #in~cond; {1073#false} is VALID [2022-04-28 03:42:27,025 INFO L290 TraceCheckUtils]: 15: Hoare triple {1073#false} assume 0 == ~cond; {1073#false} is VALID [2022-04-28 03:42:27,025 INFO L290 TraceCheckUtils]: 16: Hoare triple {1073#false} assume !false; {1073#false} is VALID [2022-04-28 03:42:27,025 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 03:42:27,025 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 03:42:27,666 INFO L290 TraceCheckUtils]: 16: Hoare triple {1073#false} assume !false; {1073#false} is VALID [2022-04-28 03:42:27,667 INFO L290 TraceCheckUtils]: 15: Hoare triple {1073#false} assume 0 == ~cond; {1073#false} is VALID [2022-04-28 03:42:27,667 INFO L290 TraceCheckUtils]: 14: Hoare triple {1073#false} ~cond := #in~cond; {1073#false} is VALID [2022-04-28 03:42:27,667 INFO L272 TraceCheckUtils]: 13: Hoare triple {1073#false} call __VERIFIER_assert((if ~x~0 == ~z~0 then 1 else 0)); {1073#false} is VALID [2022-04-28 03:42:27,671 INFO L290 TraceCheckUtils]: 12: Hoare triple {1153#(< main_~z~0 main_~y~0)} assume !(~y~0 > ~z~0); {1073#false} is VALID [2022-04-28 03:42:27,672 INFO L290 TraceCheckUtils]: 11: Hoare triple {1157#(< (+ main_~z~0 1) main_~y~0)} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {1153#(< main_~z~0 main_~y~0)} is VALID [2022-04-28 03:42:27,673 INFO L290 TraceCheckUtils]: 10: Hoare triple {1161#(< (+ main_~z~0 2) main_~y~0)} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {1157#(< (+ main_~z~0 1) main_~y~0)} is VALID [2022-04-28 03:42:27,673 INFO L290 TraceCheckUtils]: 9: Hoare triple {1165#(or (< main_~x~0 1000000) (< (+ main_~z~0 2) main_~y~0))} [67] L18-1_primed-->L18-1: Formula: (not (< v_main_~x~0_11 1000000)) InVars {main_~x~0=v_main_~x~0_11} OutVars{main_~x~0=v_main_~x~0_11} AuxVars[] AssignedVars[] {1161#(< (+ main_~z~0 2) main_~y~0)} is VALID [2022-04-28 03:42:27,674 INFO L290 TraceCheckUtils]: 8: Hoare triple {1169#(and (or (< main_~x~0 1000000) (< (+ main_~z~0 2) main_~y~0)) (or (<= 1000000 main_~x~0) (< (+ main_~z~0 main_~x~0) (+ main_~y~0 999998)) (not (<= 50000 main_~x~0))))} [70] L11-2-->L18-1_primed: Formula: (let ((.cse0 (<= 50000 v_main_~x~0_65)) (.cse1 (= |v_main_#t~post5_18| |v_main_#t~post5_17|)) (.cse2 (= v_main_~x~0_65 v_main_~x~0_64)) (.cse3 (= v_main_~y~0_35 v_main_~y~0_34)) (.cse4 (= |v_main_#t~post6_18| |v_main_#t~post6_17|))) (or (and .cse0 (< v_main_~x~0_65 v_main_~x~0_64) (= (+ v_main_~x~0_64 v_main_~y~0_35) (+ v_main_~x~0_65 v_main_~y~0_34)) (< v_main_~x~0_64 1000001)) (and (or (not (< v_main_~x~0_65 1000000)) (not .cse0)) .cse1 .cse2 .cse3 .cse4) (and .cse1 .cse2 .cse3 .cse4))) InVars {main_~y~0=v_main_~y~0_35, main_#t~post5=|v_main_#t~post5_18|, main_~x~0=v_main_~x~0_65, main_#t~post6=|v_main_#t~post6_18|} OutVars{main_~y~0=v_main_~y~0_34, main_#t~post5=|v_main_#t~post5_17|, main_~x~0=v_main_~x~0_64, main_#t~post6=|v_main_#t~post6_17|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {1165#(or (< main_~x~0 1000000) (< (+ main_~z~0 2) main_~y~0))} is VALID [2022-04-28 03:42:27,675 INFO L290 TraceCheckUtils]: 7: Hoare triple {1169#(and (or (< main_~x~0 1000000) (< (+ main_~z~0 2) main_~y~0)) (or (<= 1000000 main_~x~0) (< (+ main_~z~0 main_~x~0) (+ main_~y~0 999998)) (not (<= 50000 main_~x~0))))} [69] L18-1_primed-->L11-2: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1169#(and (or (< main_~x~0 1000000) (< (+ main_~z~0 2) main_~y~0)) (or (<= 1000000 main_~x~0) (< (+ main_~z~0 main_~x~0) (+ main_~y~0 999998)) (not (<= 50000 main_~x~0))))} is VALID [2022-04-28 03:42:27,676 INFO L290 TraceCheckUtils]: 6: Hoare triple {1176#(and (or (< main_~x~0 1000000) (< (+ main_~z~0 2) main_~y~0)) (or (<= 1000000 main_~x~0) (< (+ main_~z~0 main_~x~0) (+ main_~y~0 999998))) (<= main_~z~0 (+ 949997 main_~y~0)))} [68] L11-2-->L18-1_primed: Formula: (let ((.cse0 (= |v_main_#t~post4_22| |v_main_#t~post4_21|)) (.cse1 (= v_main_~x~0_63 v_main_~x~0_62))) (or (and .cse0 (<= 50000 v_main_~x~0_63) .cse1) (and .cse0 .cse1) (and (< v_main_~x~0_62 50001) (< v_main_~x~0_63 v_main_~x~0_62)))) InVars {main_~x~0=v_main_~x~0_63, main_#t~post4=|v_main_#t~post4_22|} OutVars{main_~x~0=v_main_~x~0_62, main_#t~post4=|v_main_#t~post4_21|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {1169#(and (or (< main_~x~0 1000000) (< (+ main_~z~0 2) main_~y~0)) (or (<= 1000000 main_~x~0) (< (+ main_~z~0 main_~x~0) (+ main_~y~0 999998)) (not (<= 50000 main_~x~0))))} is VALID [2022-04-28 03:42:27,677 INFO L290 TraceCheckUtils]: 5: Hoare triple {1072#true} ~x~0 := 0;~y~0 := 50000;~z~0 := 0;~x~0 := 0; {1176#(and (or (< main_~x~0 1000000) (< (+ main_~z~0 2) main_~y~0)) (or (<= 1000000 main_~x~0) (< (+ main_~z~0 main_~x~0) (+ main_~y~0 999998))) (<= main_~z~0 (+ 949997 main_~y~0)))} is VALID [2022-04-28 03:42:27,677 INFO L272 TraceCheckUtils]: 4: Hoare triple {1072#true} call #t~ret9 := main(); {1072#true} is VALID [2022-04-28 03:42:27,677 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1072#true} {1072#true} #52#return; {1072#true} is VALID [2022-04-28 03:42:27,677 INFO L290 TraceCheckUtils]: 2: Hoare triple {1072#true} assume true; {1072#true} is VALID [2022-04-28 03:42:27,677 INFO L290 TraceCheckUtils]: 1: Hoare triple {1072#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(17, 2);call #Ultimate.allocInit(12, 3); {1072#true} is VALID [2022-04-28 03:42:27,677 INFO L272 TraceCheckUtils]: 0: Hoare triple {1072#true} call ULTIMATE.init(); {1072#true} is VALID [2022-04-28 03:42:27,678 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 03:42:27,678 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [197097570] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 03:42:27,678 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 03:42:27,678 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8, 8] total 21 [2022-04-28 03:42:27,985 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 03:42:27,985 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1234860213] [2022-04-28 03:42:27,985 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1234860213] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 03:42:27,985 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 03:42:27,985 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2022-04-28 03:42:27,985 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2106386876] [2022-04-28 03:42:27,985 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 03:42:27,986 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 1.6923076923076923) internal successors, (22), 12 states have internal predecessors, (22), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 26 [2022-04-28 03:42:27,986 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 03:42:27,986 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 13 states, 13 states have (on average 1.6923076923076923) internal successors, (22), 12 states have internal predecessors, (22), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:42:28,009 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 26 edges. 26 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 03:42:28,009 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-04-28 03:42:28,009 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 03:42:28,010 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-04-28 03:42:28,010 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=208, Invalid=548, Unknown=0, NotChecked=0, Total=756 [2022-04-28 03:42:28,011 INFO L87 Difference]: Start difference. First operand 27 states and 30 transitions. Second operand has 13 states, 13 states have (on average 1.6923076923076923) internal successors, (22), 12 states have internal predecessors, (22), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:42:28,617 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:42:28,617 INFO L93 Difference]: Finished difference Result 58 states and 68 transitions. [2022-04-28 03:42:28,617 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-04-28 03:42:28,618 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 1.6923076923076923) internal successors, (22), 12 states have internal predecessors, (22), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 26 [2022-04-28 03:42:28,618 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 03:42:28,618 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13 states, 13 states have (on average 1.6923076923076923) internal successors, (22), 12 states have internal predecessors, (22), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:42:28,619 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 44 transitions. [2022-04-28 03:42:28,619 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13 states, 13 states have (on average 1.6923076923076923) internal successors, (22), 12 states have internal predecessors, (22), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:42:28,620 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 44 transitions. [2022-04-28 03:42:28,620 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 10 states and 44 transitions. [2022-04-28 03:42:28,663 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 44 edges. 44 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 03:42:28,664 INFO L225 Difference]: With dead ends: 58 [2022-04-28 03:42:28,664 INFO L226 Difference]: Without dead ends: 39 [2022-04-28 03:42:28,665 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 33 SyntacticMatches, 2 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 272 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=298, Invalid=892, Unknown=0, NotChecked=0, Total=1190 [2022-04-28 03:42:28,665 INFO L413 NwaCegarLoop]: 13 mSDtfsCounter, 17 mSDsluCounter, 47 mSDsCounter, 0 mSdLazyCounter, 207 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 60 SdHoareTripleChecker+Invalid, 220 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 207 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-04-28 03:42:28,666 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 60 Invalid, 220 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 207 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-04-28 03:42:28,666 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2022-04-28 03:42:28,728 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 39. [2022-04-28 03:42:28,728 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 03:42:28,728 INFO L82 GeneralOperation]: Start isEquivalent. First operand 39 states. Second operand has 39 states, 34 states have (on average 1.1470588235294117) internal successors, (39), 34 states have internal predecessors, (39), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:42:28,729 INFO L74 IsIncluded]: Start isIncluded. First operand 39 states. Second operand has 39 states, 34 states have (on average 1.1470588235294117) internal successors, (39), 34 states have internal predecessors, (39), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:42:28,729 INFO L87 Difference]: Start difference. First operand 39 states. Second operand has 39 states, 34 states have (on average 1.1470588235294117) internal successors, (39), 34 states have internal predecessors, (39), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:42:28,732 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:42:28,732 INFO L93 Difference]: Finished difference Result 39 states and 43 transitions. [2022-04-28 03:42:28,732 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 43 transitions. [2022-04-28 03:42:28,732 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:42:28,732 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:42:28,733 INFO L74 IsIncluded]: Start isIncluded. First operand has 39 states, 34 states have (on average 1.1470588235294117) internal successors, (39), 34 states have internal predecessors, (39), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 39 states. [2022-04-28 03:42:28,733 INFO L87 Difference]: Start difference. First operand has 39 states, 34 states have (on average 1.1470588235294117) internal successors, (39), 34 states have internal predecessors, (39), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 39 states. [2022-04-28 03:42:28,734 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:42:28,734 INFO L93 Difference]: Finished difference Result 39 states and 43 transitions. [2022-04-28 03:42:28,734 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 43 transitions. [2022-04-28 03:42:28,738 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:42:28,738 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:42:28,738 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 03:42:28,738 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 03:42:28,738 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 39 states, 34 states have (on average 1.1470588235294117) internal successors, (39), 34 states have internal predecessors, (39), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:42:28,739 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 43 transitions. [2022-04-28 03:42:28,740 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 43 transitions. Word has length 26 [2022-04-28 03:42:28,741 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 03:42:28,741 INFO L495 AbstractCegarLoop]: Abstraction has 39 states and 43 transitions. [2022-04-28 03:42:28,741 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 1.6923076923076923) internal successors, (22), 12 states have internal predecessors, (22), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:42:28,741 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 39 states and 43 transitions. [2022-04-28 03:42:28,784 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 43 edges. 43 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 03:42:28,784 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 43 transitions. [2022-04-28 03:42:28,785 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2022-04-28 03:42:28,785 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 03:42:28,785 INFO L195 NwaCegarLoop]: trace histogram [7, 6, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 03:42:28,802 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-04-28 03:42:28,991 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 03:42:28,991 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 03:42:28,992 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 03:42:28,992 INFO L85 PathProgramCache]: Analyzing trace with hash 1096934136, now seen corresponding path program 4 times [2022-04-28 03:42:28,992 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 03:42:28,992 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [825172153] [2022-04-28 03:42:33,078 WARN L977 rdanLoopAcceleration]: Unable to prove correctness of quantifier elimination. [2022-04-28 03:42:33,133 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 1 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 03:42:33,420 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={1=1, 2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 03:42:33,421 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-28 03:42:33,424 INFO L85 PathProgramCache]: Analyzing trace with hash 1601371681, now seen corresponding path program 1 times [2022-04-28 03:42:33,424 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 03:42:33,424 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1619335975] [2022-04-28 03:42:33,424 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:42:33,424 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 03:42:33,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:42:33,535 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 03:42:33,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:42:33,542 INFO L290 TraceCheckUtils]: 0: Hoare triple {1501#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(17, 2);call #Ultimate.allocInit(12, 3); {1490#true} is VALID [2022-04-28 03:42:33,542 INFO L290 TraceCheckUtils]: 1: Hoare triple {1490#true} assume true; {1490#true} is VALID [2022-04-28 03:42:33,542 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {1490#true} {1490#true} #52#return; {1490#true} is VALID [2022-04-28 03:42:33,543 INFO L272 TraceCheckUtils]: 0: Hoare triple {1490#true} call ULTIMATE.init(); {1501#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 03:42:33,543 INFO L290 TraceCheckUtils]: 1: Hoare triple {1501#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(17, 2);call #Ultimate.allocInit(12, 3); {1490#true} is VALID [2022-04-28 03:42:33,543 INFO L290 TraceCheckUtils]: 2: Hoare triple {1490#true} assume true; {1490#true} is VALID [2022-04-28 03:42:33,543 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1490#true} {1490#true} #52#return; {1490#true} is VALID [2022-04-28 03:42:33,543 INFO L272 TraceCheckUtils]: 4: Hoare triple {1490#true} call #t~ret9 := main(); {1490#true} is VALID [2022-04-28 03:42:33,543 INFO L290 TraceCheckUtils]: 5: Hoare triple {1490#true} ~x~0 := 0;~y~0 := 50000;~z~0 := 0;~x~0 := 0; {1495#(and (= main_~z~0 0) (= main_~x~0 0) (<= 50000 main_~y~0))} is VALID [2022-04-28 03:42:33,544 INFO L290 TraceCheckUtils]: 6: Hoare triple {1495#(and (= main_~z~0 0) (= main_~x~0 0) (<= 50000 main_~y~0))} [72] L11-2-->L18-1_primed: Formula: (let ((.cse0 (= v_main_~x~0_88 v_main_~x~0_87)) (.cse1 (= |v_main_#t~post4_29| |v_main_#t~post4_28|))) (or (and .cse0 .cse1) (and (< v_main_~x~0_87 50001) (< v_main_~x~0_88 v_main_~x~0_87)) (and .cse0 .cse1 (<= 50000 v_main_~x~0_88)))) InVars {main_~x~0=v_main_~x~0_88, main_#t~post4=|v_main_#t~post4_29|} OutVars{main_~x~0=v_main_~x~0_87, main_#t~post4=|v_main_#t~post4_28|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {1496#(and (= main_~z~0 0) (<= main_~x~0 50000) (<= 50000 main_~y~0))} is VALID [2022-04-28 03:42:33,545 INFO L290 TraceCheckUtils]: 7: Hoare triple {1496#(and (= main_~z~0 0) (<= main_~x~0 50000) (<= 50000 main_~y~0))} [73] L18-1_primed-->L11-2: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1496#(and (= main_~z~0 0) (<= main_~x~0 50000) (<= 50000 main_~y~0))} is VALID [2022-04-28 03:42:33,546 INFO L290 TraceCheckUtils]: 8: Hoare triple {1496#(and (= main_~z~0 0) (<= main_~x~0 50000) (<= 50000 main_~y~0))} [74] L11-2-->L18-1_primed: Formula: (let ((.cse0 (= |v_main_#t~post5_25| |v_main_#t~post5_24|)) (.cse2 (= v_main_~y~0_53 v_main_~y~0_52)) (.cse3 (= |v_main_#t~post6_25| |v_main_#t~post6_24|)) (.cse1 (<= 50000 v_main_~x~0_90))) (or (and .cse0 (or (not .cse1) (not (< v_main_~x~0_90 1000000))) .cse2 (= v_main_~x~0_89 v_main_~x~0_90) .cse3) (and .cse0 .cse2 (= v_main_~x~0_90 v_main_~x~0_89) .cse3) (let ((.cse4 (+ v_main_~x~0_90 v_main_~y~0_52))) (and (< .cse4 (+ v_main_~y~0_53 1000001)) (< v_main_~y~0_53 v_main_~y~0_52) .cse1 (= (+ v_main_~x~0_89 v_main_~y~0_53) .cse4))))) InVars {main_~y~0=v_main_~y~0_53, main_#t~post5=|v_main_#t~post5_25|, main_~x~0=v_main_~x~0_90, main_#t~post6=|v_main_#t~post6_25|} OutVars{main_~y~0=v_main_~y~0_52, main_#t~post5=|v_main_#t~post5_24|, main_~x~0=v_main_~x~0_89, main_#t~post6=|v_main_#t~post6_24|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {1497#(or (<= main_~x~0 50000) (and (= main_~z~0 0) (<= 50001 main_~y~0)))} is VALID [2022-04-28 03:42:33,546 INFO L290 TraceCheckUtils]: 9: Hoare triple {1497#(or (<= main_~x~0 50000) (and (= main_~z~0 0) (<= 50001 main_~y~0)))} [71] L18-1_primed-->L18-1: Formula: (not (< v_main_~x~0_11 1000000)) InVars {main_~x~0=v_main_~x~0_11} OutVars{main_~x~0=v_main_~x~0_11} AuxVars[] AssignedVars[] {1498#(and (= main_~z~0 0) (<= 50001 main_~y~0))} is VALID [2022-04-28 03:42:33,547 INFO L290 TraceCheckUtils]: 10: Hoare triple {1498#(and (= main_~z~0 0) (<= 50001 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {1499#(and (= main_~z~0 0) (<= 50000 main_~y~0))} is VALID [2022-04-28 03:42:33,547 INFO L290 TraceCheckUtils]: 11: Hoare triple {1499#(and (= main_~z~0 0) (<= 50000 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {1500#(and (= main_~z~0 0) (<= 49999 main_~y~0))} is VALID [2022-04-28 03:42:33,548 INFO L290 TraceCheckUtils]: 12: Hoare triple {1500#(and (= main_~z~0 0) (<= 49999 main_~y~0))} assume !(~y~0 > ~z~0); {1491#false} is VALID [2022-04-28 03:42:33,548 INFO L272 TraceCheckUtils]: 13: Hoare triple {1491#false} call __VERIFIER_assert((if ~x~0 == ~z~0 then 1 else 0)); {1491#false} is VALID [2022-04-28 03:42:33,548 INFO L290 TraceCheckUtils]: 14: Hoare triple {1491#false} ~cond := #in~cond; {1491#false} is VALID [2022-04-28 03:42:33,548 INFO L290 TraceCheckUtils]: 15: Hoare triple {1491#false} assume 0 == ~cond; {1491#false} is VALID [2022-04-28 03:42:33,548 INFO L290 TraceCheckUtils]: 16: Hoare triple {1491#false} assume !false; {1491#false} is VALID [2022-04-28 03:42:33,548 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 03:42:33,548 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 03:42:33,549 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1619335975] [2022-04-28 03:42:33,549 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1619335975] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 03:42:33,549 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1245595689] [2022-04-28 03:42:33,549 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:42:33,549 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 03:42:33,549 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 03:42:33,550 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 03:42:33,580 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-04-28 03:42:33,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:42:33,600 INFO L263 TraceCheckSpWp]: Trace formula consists of 69 conjuncts, 6 conjunts are in the unsatisfiable core [2022-04-28 03:42:33,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:42:33,616 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 03:42:33,901 INFO L272 TraceCheckUtils]: 0: Hoare triple {1490#true} call ULTIMATE.init(); {1490#true} is VALID [2022-04-28 03:42:33,901 INFO L290 TraceCheckUtils]: 1: Hoare triple {1490#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(17, 2);call #Ultimate.allocInit(12, 3); {1490#true} is VALID [2022-04-28 03:42:33,901 INFO L290 TraceCheckUtils]: 2: Hoare triple {1490#true} assume true; {1490#true} is VALID [2022-04-28 03:42:33,901 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1490#true} {1490#true} #52#return; {1490#true} is VALID [2022-04-28 03:42:33,901 INFO L272 TraceCheckUtils]: 4: Hoare triple {1490#true} call #t~ret9 := main(); {1490#true} is VALID [2022-04-28 03:42:33,902 INFO L290 TraceCheckUtils]: 5: Hoare triple {1490#true} ~x~0 := 0;~y~0 := 50000;~z~0 := 0;~x~0 := 0; {1520#(and (<= main_~z~0 0) (<= 50000 main_~y~0))} is VALID [2022-04-28 03:42:33,903 INFO L290 TraceCheckUtils]: 6: Hoare triple {1520#(and (<= main_~z~0 0) (<= 50000 main_~y~0))} [72] L11-2-->L18-1_primed: Formula: (let ((.cse0 (= v_main_~x~0_88 v_main_~x~0_87)) (.cse1 (= |v_main_#t~post4_29| |v_main_#t~post4_28|))) (or (and .cse0 .cse1) (and (< v_main_~x~0_87 50001) (< v_main_~x~0_88 v_main_~x~0_87)) (and .cse0 .cse1 (<= 50000 v_main_~x~0_88)))) InVars {main_~x~0=v_main_~x~0_88, main_#t~post4=|v_main_#t~post4_29|} OutVars{main_~x~0=v_main_~x~0_87, main_#t~post4=|v_main_#t~post4_28|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {1520#(and (<= main_~z~0 0) (<= 50000 main_~y~0))} is VALID [2022-04-28 03:42:33,903 INFO L290 TraceCheckUtils]: 7: Hoare triple {1520#(and (<= main_~z~0 0) (<= 50000 main_~y~0))} [73] L18-1_primed-->L11-2: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1520#(and (<= main_~z~0 0) (<= 50000 main_~y~0))} is VALID [2022-04-28 03:42:33,904 INFO L290 TraceCheckUtils]: 8: Hoare triple {1520#(and (<= main_~z~0 0) (<= 50000 main_~y~0))} [74] L11-2-->L18-1_primed: Formula: (let ((.cse0 (= |v_main_#t~post5_25| |v_main_#t~post5_24|)) (.cse2 (= v_main_~y~0_53 v_main_~y~0_52)) (.cse3 (= |v_main_#t~post6_25| |v_main_#t~post6_24|)) (.cse1 (<= 50000 v_main_~x~0_90))) (or (and .cse0 (or (not .cse1) (not (< v_main_~x~0_90 1000000))) .cse2 (= v_main_~x~0_89 v_main_~x~0_90) .cse3) (and .cse0 .cse2 (= v_main_~x~0_90 v_main_~x~0_89) .cse3) (let ((.cse4 (+ v_main_~x~0_90 v_main_~y~0_52))) (and (< .cse4 (+ v_main_~y~0_53 1000001)) (< v_main_~y~0_53 v_main_~y~0_52) .cse1 (= (+ v_main_~x~0_89 v_main_~y~0_53) .cse4))))) InVars {main_~y~0=v_main_~y~0_53, main_#t~post5=|v_main_#t~post5_25|, main_~x~0=v_main_~x~0_90, main_#t~post6=|v_main_#t~post6_25|} OutVars{main_~y~0=v_main_~y~0_52, main_#t~post5=|v_main_#t~post5_24|, main_~x~0=v_main_~x~0_89, main_#t~post6=|v_main_#t~post6_24|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {1520#(and (<= main_~z~0 0) (<= 50000 main_~y~0))} is VALID [2022-04-28 03:42:33,905 INFO L290 TraceCheckUtils]: 9: Hoare triple {1520#(and (<= main_~z~0 0) (<= 50000 main_~y~0))} [71] L18-1_primed-->L18-1: Formula: (not (< v_main_~x~0_11 1000000)) InVars {main_~x~0=v_main_~x~0_11} OutVars{main_~x~0=v_main_~x~0_11} AuxVars[] AssignedVars[] {1520#(and (<= main_~z~0 0) (<= 50000 main_~y~0))} is VALID [2022-04-28 03:42:33,905 INFO L290 TraceCheckUtils]: 10: Hoare triple {1520#(and (<= main_~z~0 0) (<= 50000 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {1536#(and (<= main_~z~0 0) (<= 49999 main_~y~0))} is VALID [2022-04-28 03:42:33,906 INFO L290 TraceCheckUtils]: 11: Hoare triple {1536#(and (<= main_~z~0 0) (<= 49999 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {1540#(and (<= main_~z~0 0) (<= 49998 main_~y~0))} is VALID [2022-04-28 03:42:33,907 INFO L290 TraceCheckUtils]: 12: Hoare triple {1540#(and (<= main_~z~0 0) (<= 49998 main_~y~0))} assume !(~y~0 > ~z~0); {1491#false} is VALID [2022-04-28 03:42:33,907 INFO L272 TraceCheckUtils]: 13: Hoare triple {1491#false} call __VERIFIER_assert((if ~x~0 == ~z~0 then 1 else 0)); {1491#false} is VALID [2022-04-28 03:42:33,907 INFO L290 TraceCheckUtils]: 14: Hoare triple {1491#false} ~cond := #in~cond; {1491#false} is VALID [2022-04-28 03:42:33,907 INFO L290 TraceCheckUtils]: 15: Hoare triple {1491#false} assume 0 == ~cond; {1491#false} is VALID [2022-04-28 03:42:33,907 INFO L290 TraceCheckUtils]: 16: Hoare triple {1491#false} assume !false; {1491#false} is VALID [2022-04-28 03:42:33,907 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-04-28 03:42:33,907 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 03:42:34,209 INFO L290 TraceCheckUtils]: 16: Hoare triple {1491#false} assume !false; {1491#false} is VALID [2022-04-28 03:42:34,209 INFO L290 TraceCheckUtils]: 15: Hoare triple {1491#false} assume 0 == ~cond; {1491#false} is VALID [2022-04-28 03:42:34,209 INFO L290 TraceCheckUtils]: 14: Hoare triple {1491#false} ~cond := #in~cond; {1491#false} is VALID [2022-04-28 03:42:34,210 INFO L272 TraceCheckUtils]: 13: Hoare triple {1491#false} call __VERIFIER_assert((if ~x~0 == ~z~0 then 1 else 0)); {1491#false} is VALID [2022-04-28 03:42:34,210 INFO L290 TraceCheckUtils]: 12: Hoare triple {1568#(< main_~z~0 main_~y~0)} assume !(~y~0 > ~z~0); {1491#false} is VALID [2022-04-28 03:42:34,210 INFO L290 TraceCheckUtils]: 11: Hoare triple {1572#(< (+ main_~z~0 1) main_~y~0)} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {1568#(< main_~z~0 main_~y~0)} is VALID [2022-04-28 03:42:34,211 INFO L290 TraceCheckUtils]: 10: Hoare triple {1576#(< (+ main_~z~0 2) main_~y~0)} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {1572#(< (+ main_~z~0 1) main_~y~0)} is VALID [2022-04-28 03:42:34,212 INFO L290 TraceCheckUtils]: 9: Hoare triple {1576#(< (+ main_~z~0 2) main_~y~0)} [71] L18-1_primed-->L18-1: Formula: (not (< v_main_~x~0_11 1000000)) InVars {main_~x~0=v_main_~x~0_11} OutVars{main_~x~0=v_main_~x~0_11} AuxVars[] AssignedVars[] {1576#(< (+ main_~z~0 2) main_~y~0)} is VALID [2022-04-28 03:42:34,213 INFO L290 TraceCheckUtils]: 8: Hoare triple {1576#(< (+ main_~z~0 2) main_~y~0)} [74] L11-2-->L18-1_primed: Formula: (let ((.cse0 (= |v_main_#t~post5_25| |v_main_#t~post5_24|)) (.cse2 (= v_main_~y~0_53 v_main_~y~0_52)) (.cse3 (= |v_main_#t~post6_25| |v_main_#t~post6_24|)) (.cse1 (<= 50000 v_main_~x~0_90))) (or (and .cse0 (or (not .cse1) (not (< v_main_~x~0_90 1000000))) .cse2 (= v_main_~x~0_89 v_main_~x~0_90) .cse3) (and .cse0 .cse2 (= v_main_~x~0_90 v_main_~x~0_89) .cse3) (let ((.cse4 (+ v_main_~x~0_90 v_main_~y~0_52))) (and (< .cse4 (+ v_main_~y~0_53 1000001)) (< v_main_~y~0_53 v_main_~y~0_52) .cse1 (= (+ v_main_~x~0_89 v_main_~y~0_53) .cse4))))) InVars {main_~y~0=v_main_~y~0_53, main_#t~post5=|v_main_#t~post5_25|, main_~x~0=v_main_~x~0_90, main_#t~post6=|v_main_#t~post6_25|} OutVars{main_~y~0=v_main_~y~0_52, main_#t~post5=|v_main_#t~post5_24|, main_~x~0=v_main_~x~0_89, main_#t~post6=|v_main_#t~post6_24|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {1576#(< (+ main_~z~0 2) main_~y~0)} is VALID [2022-04-28 03:42:34,215 INFO L290 TraceCheckUtils]: 7: Hoare triple {1576#(< (+ main_~z~0 2) main_~y~0)} [73] L18-1_primed-->L11-2: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1576#(< (+ main_~z~0 2) main_~y~0)} is VALID [2022-04-28 03:42:34,215 INFO L290 TraceCheckUtils]: 6: Hoare triple {1576#(< (+ main_~z~0 2) main_~y~0)} [72] L11-2-->L18-1_primed: Formula: (let ((.cse0 (= v_main_~x~0_88 v_main_~x~0_87)) (.cse1 (= |v_main_#t~post4_29| |v_main_#t~post4_28|))) (or (and .cse0 .cse1) (and (< v_main_~x~0_87 50001) (< v_main_~x~0_88 v_main_~x~0_87)) (and .cse0 .cse1 (<= 50000 v_main_~x~0_88)))) InVars {main_~x~0=v_main_~x~0_88, main_#t~post4=|v_main_#t~post4_29|} OutVars{main_~x~0=v_main_~x~0_87, main_#t~post4=|v_main_#t~post4_28|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {1576#(< (+ main_~z~0 2) main_~y~0)} is VALID [2022-04-28 03:42:34,217 INFO L290 TraceCheckUtils]: 5: Hoare triple {1490#true} ~x~0 := 0;~y~0 := 50000;~z~0 := 0;~x~0 := 0; {1576#(< (+ main_~z~0 2) main_~y~0)} is VALID [2022-04-28 03:42:34,217 INFO L272 TraceCheckUtils]: 4: Hoare triple {1490#true} call #t~ret9 := main(); {1490#true} is VALID [2022-04-28 03:42:34,217 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1490#true} {1490#true} #52#return; {1490#true} is VALID [2022-04-28 03:42:34,217 INFO L290 TraceCheckUtils]: 2: Hoare triple {1490#true} assume true; {1490#true} is VALID [2022-04-28 03:42:34,217 INFO L290 TraceCheckUtils]: 1: Hoare triple {1490#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(17, 2);call #Ultimate.allocInit(12, 3); {1490#true} is VALID [2022-04-28 03:42:34,217 INFO L272 TraceCheckUtils]: 0: Hoare triple {1490#true} call ULTIMATE.init(); {1490#true} is VALID [2022-04-28 03:42:34,217 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-04-28 03:42:34,218 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1245595689] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 03:42:34,218 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 03:42:34,218 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 5, 5] total 15 [2022-04-28 03:42:34,540 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 03:42:34,540 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [825172153] [2022-04-28 03:42:34,540 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [825172153] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 03:42:34,540 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 03:42:34,541 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2022-04-28 03:42:34,541 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1998020974] [2022-04-28 03:42:34,541 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 03:42:34,542 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 1.7142857142857142) internal successors, (24), 13 states have internal predecessors, (24), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 28 [2022-04-28 03:42:34,543 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 03:42:34,543 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 14 states, 14 states have (on average 1.7142857142857142) internal successors, (24), 13 states have internal predecessors, (24), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:42:34,568 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 28 edges. 28 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 03:42:34,568 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-04-28 03:42:34,568 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 03:42:34,569 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-04-28 03:42:34,569 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=180, Invalid=326, Unknown=0, NotChecked=0, Total=506 [2022-04-28 03:42:34,569 INFO L87 Difference]: Start difference. First operand 39 states and 43 transitions. Second operand has 14 states, 14 states have (on average 1.7142857142857142) internal successors, (24), 13 states have internal predecessors, (24), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:42:35,146 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:42:35,146 INFO L93 Difference]: Finished difference Result 61 states and 71 transitions. [2022-04-28 03:42:35,146 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-04-28 03:42:35,146 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 1.7142857142857142) internal successors, (24), 13 states have internal predecessors, (24), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 28 [2022-04-28 03:42:35,146 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 03:42:35,146 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 14 states have (on average 1.7142857142857142) internal successors, (24), 13 states have internal predecessors, (24), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:42:35,148 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 49 transitions. [2022-04-28 03:42:35,148 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 14 states have (on average 1.7142857142857142) internal successors, (24), 13 states have internal predecessors, (24), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:42:35,149 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 49 transitions. [2022-04-28 03:42:35,149 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 14 states and 49 transitions. [2022-04-28 03:42:35,194 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 49 edges. 49 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 03:42:35,195 INFO L225 Difference]: With dead ends: 61 [2022-04-28 03:42:35,195 INFO L226 Difference]: Without dead ends: 42 [2022-04-28 03:42:35,196 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 74 GetRequests, 40 SyntacticMatches, 2 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 297 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=352, Invalid=770, Unknown=0, NotChecked=0, Total=1122 [2022-04-28 03:42:35,197 INFO L413 NwaCegarLoop]: 13 mSDtfsCounter, 34 mSDsluCounter, 32 mSDsCounter, 0 mSdLazyCounter, 183 mSolverCounterSat, 35 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 34 SdHoareTripleChecker+Valid, 45 SdHoareTripleChecker+Invalid, 218 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 35 IncrementalHoareTripleChecker+Valid, 183 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-04-28 03:42:35,197 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [34 Valid, 45 Invalid, 218 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [35 Valid, 183 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-04-28 03:42:35,197 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2022-04-28 03:42:35,267 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 42. [2022-04-28 03:42:35,267 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 03:42:35,268 INFO L82 GeneralOperation]: Start isEquivalent. First operand 42 states. Second operand has 42 states, 37 states have (on average 1.135135135135135) internal successors, (42), 37 states have internal predecessors, (42), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:42:35,268 INFO L74 IsIncluded]: Start isIncluded. First operand 42 states. Second operand has 42 states, 37 states have (on average 1.135135135135135) internal successors, (42), 37 states have internal predecessors, (42), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:42:35,268 INFO L87 Difference]: Start difference. First operand 42 states. Second operand has 42 states, 37 states have (on average 1.135135135135135) internal successors, (42), 37 states have internal predecessors, (42), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:42:35,269 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:42:35,269 INFO L93 Difference]: Finished difference Result 42 states and 46 transitions. [2022-04-28 03:42:35,269 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 46 transitions. [2022-04-28 03:42:35,271 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:42:35,271 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:42:35,271 INFO L74 IsIncluded]: Start isIncluded. First operand has 42 states, 37 states have (on average 1.135135135135135) internal successors, (42), 37 states have internal predecessors, (42), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 42 states. [2022-04-28 03:42:35,271 INFO L87 Difference]: Start difference. First operand has 42 states, 37 states have (on average 1.135135135135135) internal successors, (42), 37 states have internal predecessors, (42), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 42 states. [2022-04-28 03:42:35,274 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:42:35,275 INFO L93 Difference]: Finished difference Result 42 states and 46 transitions. [2022-04-28 03:42:35,275 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 46 transitions. [2022-04-28 03:42:35,275 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:42:35,275 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:42:35,275 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 03:42:35,275 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 03:42:35,276 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 42 states, 37 states have (on average 1.135135135135135) internal successors, (42), 37 states have internal predecessors, (42), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:42:35,277 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 46 transitions. [2022-04-28 03:42:35,277 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 46 transitions. Word has length 28 [2022-04-28 03:42:35,277 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 03:42:35,277 INFO L495 AbstractCegarLoop]: Abstraction has 42 states and 46 transitions. [2022-04-28 03:42:35,277 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 1.7142857142857142) internal successors, (24), 13 states have internal predecessors, (24), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:42:35,277 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 42 states and 46 transitions. [2022-04-28 03:42:35,321 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 46 edges. 46 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 03:42:35,322 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 46 transitions. [2022-04-28 03:42:35,322 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2022-04-28 03:42:35,322 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 03:42:35,322 INFO L195 NwaCegarLoop]: trace histogram [8, 7, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 03:42:35,345 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2022-04-28 03:42:35,535 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 03:42:35,535 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 03:42:35,536 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 03:42:35,536 INFO L85 PathProgramCache]: Analyzing trace with hash -1965893626, now seen corresponding path program 5 times [2022-04-28 03:42:35,536 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 03:42:35,536 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [542762469] [2022-04-28 03:42:35,645 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 1 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 03:42:39,779 WARN L977 rdanLoopAcceleration]: Unable to prove correctness of quantifier elimination. [2022-04-28 03:42:39,920 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={1=1, 2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 03:42:39,922 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-28 03:42:39,924 INFO L85 PathProgramCache]: Analyzing trace with hash 630975074, now seen corresponding path program 1 times [2022-04-28 03:42:39,924 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 03:42:39,924 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [195804976] [2022-04-28 03:42:39,924 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:42:39,925 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 03:42:39,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:42:40,010 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 03:42:40,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:42:40,015 INFO L290 TraceCheckUtils]: 0: Hoare triple {1938#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(17, 2);call #Ultimate.allocInit(12, 3); {1929#true} is VALID [2022-04-28 03:42:40,015 INFO L290 TraceCheckUtils]: 1: Hoare triple {1929#true} assume true; {1929#true} is VALID [2022-04-28 03:42:40,015 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {1929#true} {1929#true} #52#return; {1929#true} is VALID [2022-04-28 03:42:40,016 INFO L272 TraceCheckUtils]: 0: Hoare triple {1929#true} call ULTIMATE.init(); {1938#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 03:42:40,016 INFO L290 TraceCheckUtils]: 1: Hoare triple {1938#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(17, 2);call #Ultimate.allocInit(12, 3); {1929#true} is VALID [2022-04-28 03:42:40,016 INFO L290 TraceCheckUtils]: 2: Hoare triple {1929#true} assume true; {1929#true} is VALID [2022-04-28 03:42:40,016 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1929#true} {1929#true} #52#return; {1929#true} is VALID [2022-04-28 03:42:40,016 INFO L272 TraceCheckUtils]: 4: Hoare triple {1929#true} call #t~ret9 := main(); {1929#true} is VALID [2022-04-28 03:42:40,016 INFO L290 TraceCheckUtils]: 5: Hoare triple {1929#true} ~x~0 := 0;~y~0 := 50000;~z~0 := 0;~x~0 := 0; {1934#(and (= main_~z~0 0) (<= 50000 main_~y~0))} is VALID [2022-04-28 03:42:40,017 INFO L290 TraceCheckUtils]: 6: Hoare triple {1934#(and (= main_~z~0 0) (<= 50000 main_~y~0))} [76] L11-2-->L18-1_primed: Formula: (let ((.cse0 (= |v_main_#t~post4_35| |v_main_#t~post4_34|)) (.cse1 (= v_main_~x~0_113 v_main_~x~0_112))) (or (and .cse0 .cse1 (<= 50000 v_main_~x~0_113)) (and .cse0 .cse1) (and (< v_main_~x~0_112 50001) (< v_main_~x~0_113 v_main_~x~0_112)))) InVars {main_~x~0=v_main_~x~0_113, main_#t~post4=|v_main_#t~post4_35|} OutVars{main_~x~0=v_main_~x~0_112, main_#t~post4=|v_main_#t~post4_34|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {1934#(and (= main_~z~0 0) (<= 50000 main_~y~0))} is VALID [2022-04-28 03:42:40,017 INFO L290 TraceCheckUtils]: 7: Hoare triple {1934#(and (= main_~z~0 0) (<= 50000 main_~y~0))} [77] L18-1_primed-->L11-2: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1934#(and (= main_~z~0 0) (<= 50000 main_~y~0))} is VALID [2022-04-28 03:42:40,019 INFO L290 TraceCheckUtils]: 8: Hoare triple {1934#(and (= main_~z~0 0) (<= 50000 main_~y~0))} [78] L11-2-->L18-1_primed: Formula: (let ((.cse1 (<= 50000 v_main_~x~0_115)) (.cse2 (= v_main_~x~0_115 v_main_~x~0_114)) (.cse3 (= |v_main_#t~post6_32| |v_main_#t~post6_31|)) (.cse4 (= |v_main_#t~post5_32| |v_main_#t~post5_31|))) (or (let ((.cse0 (+ v_main_~x~0_115 v_main_~y~0_71))) (and (= .cse0 (+ v_main_~x~0_114 v_main_~y~0_72)) .cse1 (< .cse0 (+ v_main_~y~0_72 1000001)) (< v_main_~y~0_72 v_main_~y~0_71))) (and .cse2 (or (not .cse1) (not (< v_main_~x~0_115 1000000))) (= v_main_~y~0_71 v_main_~y~0_72) .cse3 .cse4) (and .cse2 .cse3 .cse4 (= v_main_~y~0_72 v_main_~y~0_71)))) InVars {main_~y~0=v_main_~y~0_72, main_#t~post5=|v_main_#t~post5_32|, main_~x~0=v_main_~x~0_115, main_#t~post6=|v_main_#t~post6_32|} OutVars{main_~y~0=v_main_~y~0_71, main_#t~post5=|v_main_#t~post5_31|, main_~x~0=v_main_~x~0_114, main_#t~post6=|v_main_#t~post6_31|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {1934#(and (= main_~z~0 0) (<= 50000 main_~y~0))} is VALID [2022-04-28 03:42:40,019 INFO L290 TraceCheckUtils]: 9: Hoare triple {1934#(and (= main_~z~0 0) (<= 50000 main_~y~0))} [75] L18-1_primed-->L18-1: Formula: (not (< v_main_~x~0_11 1000000)) InVars {main_~x~0=v_main_~x~0_11} OutVars{main_~x~0=v_main_~x~0_11} AuxVars[] AssignedVars[] {1934#(and (= main_~z~0 0) (<= 50000 main_~y~0))} is VALID [2022-04-28 03:42:40,020 INFO L290 TraceCheckUtils]: 10: Hoare triple {1934#(and (= main_~z~0 0) (<= 50000 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {1935#(and (= main_~z~0 0) (<= 49999 main_~y~0))} is VALID [2022-04-28 03:42:40,020 INFO L290 TraceCheckUtils]: 11: Hoare triple {1935#(and (= main_~z~0 0) (<= 49999 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {1936#(and (<= 49998 main_~y~0) (= main_~z~0 0))} is VALID [2022-04-28 03:42:40,021 INFO L290 TraceCheckUtils]: 12: Hoare triple {1936#(and (<= 49998 main_~y~0) (= main_~z~0 0))} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {1937#(and (= main_~z~0 0) (<= 49997 main_~y~0))} is VALID [2022-04-28 03:42:40,021 INFO L290 TraceCheckUtils]: 13: Hoare triple {1937#(and (= main_~z~0 0) (<= 49997 main_~y~0))} assume !(~y~0 > ~z~0); {1930#false} is VALID [2022-04-28 03:42:40,021 INFO L272 TraceCheckUtils]: 14: Hoare triple {1930#false} call __VERIFIER_assert((if ~x~0 == ~z~0 then 1 else 0)); {1930#false} is VALID [2022-04-28 03:42:40,022 INFO L290 TraceCheckUtils]: 15: Hoare triple {1930#false} ~cond := #in~cond; {1930#false} is VALID [2022-04-28 03:42:40,022 INFO L290 TraceCheckUtils]: 16: Hoare triple {1930#false} assume 0 == ~cond; {1930#false} is VALID [2022-04-28 03:42:40,022 INFO L290 TraceCheckUtils]: 17: Hoare triple {1930#false} assume !false; {1930#false} is VALID [2022-04-28 03:42:40,022 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-04-28 03:42:40,022 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 03:42:40,022 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [195804976] [2022-04-28 03:42:40,022 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [195804976] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 03:42:40,022 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1515781657] [2022-04-28 03:42:40,022 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:42:40,023 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 03:42:40,023 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 03:42:40,028 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 03:42:40,029 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-04-28 03:42:40,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:42:40,064 INFO L263 TraceCheckSpWp]: Trace formula consists of 74 conjuncts, 7 conjunts are in the unsatisfiable core [2022-04-28 03:42:40,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:42:40,074 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 03:42:40,414 INFO L272 TraceCheckUtils]: 0: Hoare triple {1929#true} call ULTIMATE.init(); {1929#true} is VALID [2022-04-28 03:42:40,414 INFO L290 TraceCheckUtils]: 1: Hoare triple {1929#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(17, 2);call #Ultimate.allocInit(12, 3); {1929#true} is VALID [2022-04-28 03:42:40,414 INFO L290 TraceCheckUtils]: 2: Hoare triple {1929#true} assume true; {1929#true} is VALID [2022-04-28 03:42:40,414 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1929#true} {1929#true} #52#return; {1929#true} is VALID [2022-04-28 03:42:40,414 INFO L272 TraceCheckUtils]: 4: Hoare triple {1929#true} call #t~ret9 := main(); {1929#true} is VALID [2022-04-28 03:42:40,415 INFO L290 TraceCheckUtils]: 5: Hoare triple {1929#true} ~x~0 := 0;~y~0 := 50000;~z~0 := 0;~x~0 := 0; {1957#(and (<= main_~z~0 0) (<= 50000 main_~y~0))} is VALID [2022-04-28 03:42:40,415 INFO L290 TraceCheckUtils]: 6: Hoare triple {1957#(and (<= main_~z~0 0) (<= 50000 main_~y~0))} [76] L11-2-->L18-1_primed: Formula: (let ((.cse0 (= |v_main_#t~post4_35| |v_main_#t~post4_34|)) (.cse1 (= v_main_~x~0_113 v_main_~x~0_112))) (or (and .cse0 .cse1 (<= 50000 v_main_~x~0_113)) (and .cse0 .cse1) (and (< v_main_~x~0_112 50001) (< v_main_~x~0_113 v_main_~x~0_112)))) InVars {main_~x~0=v_main_~x~0_113, main_#t~post4=|v_main_#t~post4_35|} OutVars{main_~x~0=v_main_~x~0_112, main_#t~post4=|v_main_#t~post4_34|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {1957#(and (<= main_~z~0 0) (<= 50000 main_~y~0))} is VALID [2022-04-28 03:42:40,415 INFO L290 TraceCheckUtils]: 7: Hoare triple {1957#(and (<= main_~z~0 0) (<= 50000 main_~y~0))} [77] L18-1_primed-->L11-2: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1957#(and (<= main_~z~0 0) (<= 50000 main_~y~0))} is VALID [2022-04-28 03:42:40,416 INFO L290 TraceCheckUtils]: 8: Hoare triple {1957#(and (<= main_~z~0 0) (<= 50000 main_~y~0))} [78] L11-2-->L18-1_primed: Formula: (let ((.cse1 (<= 50000 v_main_~x~0_115)) (.cse2 (= v_main_~x~0_115 v_main_~x~0_114)) (.cse3 (= |v_main_#t~post6_32| |v_main_#t~post6_31|)) (.cse4 (= |v_main_#t~post5_32| |v_main_#t~post5_31|))) (or (let ((.cse0 (+ v_main_~x~0_115 v_main_~y~0_71))) (and (= .cse0 (+ v_main_~x~0_114 v_main_~y~0_72)) .cse1 (< .cse0 (+ v_main_~y~0_72 1000001)) (< v_main_~y~0_72 v_main_~y~0_71))) (and .cse2 (or (not .cse1) (not (< v_main_~x~0_115 1000000))) (= v_main_~y~0_71 v_main_~y~0_72) .cse3 .cse4) (and .cse2 .cse3 .cse4 (= v_main_~y~0_72 v_main_~y~0_71)))) InVars {main_~y~0=v_main_~y~0_72, main_#t~post5=|v_main_#t~post5_32|, main_~x~0=v_main_~x~0_115, main_#t~post6=|v_main_#t~post6_32|} OutVars{main_~y~0=v_main_~y~0_71, main_#t~post5=|v_main_#t~post5_31|, main_~x~0=v_main_~x~0_114, main_#t~post6=|v_main_#t~post6_31|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {1957#(and (<= main_~z~0 0) (<= 50000 main_~y~0))} is VALID [2022-04-28 03:42:40,419 INFO L290 TraceCheckUtils]: 9: Hoare triple {1957#(and (<= main_~z~0 0) (<= 50000 main_~y~0))} [75] L18-1_primed-->L18-1: Formula: (not (< v_main_~x~0_11 1000000)) InVars {main_~x~0=v_main_~x~0_11} OutVars{main_~x~0=v_main_~x~0_11} AuxVars[] AssignedVars[] {1957#(and (<= main_~z~0 0) (<= 50000 main_~y~0))} is VALID [2022-04-28 03:42:40,420 INFO L290 TraceCheckUtils]: 10: Hoare triple {1957#(and (<= main_~z~0 0) (<= 50000 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {1973#(and (<= main_~z~0 0) (<= 49999 main_~y~0))} is VALID [2022-04-28 03:42:40,421 INFO L290 TraceCheckUtils]: 11: Hoare triple {1973#(and (<= main_~z~0 0) (<= 49999 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {1977#(and (<= main_~z~0 0) (<= 49998 main_~y~0))} is VALID [2022-04-28 03:42:40,421 INFO L290 TraceCheckUtils]: 12: Hoare triple {1977#(and (<= main_~z~0 0) (<= 49998 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {1981#(and (<= main_~z~0 0) (<= 49997 main_~y~0))} is VALID [2022-04-28 03:42:40,422 INFO L290 TraceCheckUtils]: 13: Hoare triple {1981#(and (<= main_~z~0 0) (<= 49997 main_~y~0))} assume !(~y~0 > ~z~0); {1930#false} is VALID [2022-04-28 03:42:40,422 INFO L272 TraceCheckUtils]: 14: Hoare triple {1930#false} call __VERIFIER_assert((if ~x~0 == ~z~0 then 1 else 0)); {1930#false} is VALID [2022-04-28 03:42:40,422 INFO L290 TraceCheckUtils]: 15: Hoare triple {1930#false} ~cond := #in~cond; {1930#false} is VALID [2022-04-28 03:42:40,422 INFO L290 TraceCheckUtils]: 16: Hoare triple {1930#false} assume 0 == ~cond; {1930#false} is VALID [2022-04-28 03:42:40,422 INFO L290 TraceCheckUtils]: 17: Hoare triple {1930#false} assume !false; {1930#false} is VALID [2022-04-28 03:42:40,422 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-04-28 03:42:40,423 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 03:42:40,706 INFO L290 TraceCheckUtils]: 17: Hoare triple {1930#false} assume !false; {1930#false} is VALID [2022-04-28 03:42:40,707 INFO L290 TraceCheckUtils]: 16: Hoare triple {1930#false} assume 0 == ~cond; {1930#false} is VALID [2022-04-28 03:42:40,707 INFO L290 TraceCheckUtils]: 15: Hoare triple {1930#false} ~cond := #in~cond; {1930#false} is VALID [2022-04-28 03:42:40,707 INFO L272 TraceCheckUtils]: 14: Hoare triple {1930#false} call __VERIFIER_assert((if ~x~0 == ~z~0 then 1 else 0)); {1930#false} is VALID [2022-04-28 03:42:40,707 INFO L290 TraceCheckUtils]: 13: Hoare triple {2009#(< main_~z~0 main_~y~0)} assume !(~y~0 > ~z~0); {1930#false} is VALID [2022-04-28 03:42:40,708 INFO L290 TraceCheckUtils]: 12: Hoare triple {2013#(< (+ main_~z~0 1) main_~y~0)} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {2009#(< main_~z~0 main_~y~0)} is VALID [2022-04-28 03:42:40,708 INFO L290 TraceCheckUtils]: 11: Hoare triple {2017#(< (+ main_~z~0 2) main_~y~0)} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {2013#(< (+ main_~z~0 1) main_~y~0)} is VALID [2022-04-28 03:42:40,709 INFO L290 TraceCheckUtils]: 10: Hoare triple {2021#(< (+ main_~z~0 3) main_~y~0)} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {2017#(< (+ main_~z~0 2) main_~y~0)} is VALID [2022-04-28 03:42:40,709 INFO L290 TraceCheckUtils]: 9: Hoare triple {2021#(< (+ main_~z~0 3) main_~y~0)} [75] L18-1_primed-->L18-1: Formula: (not (< v_main_~x~0_11 1000000)) InVars {main_~x~0=v_main_~x~0_11} OutVars{main_~x~0=v_main_~x~0_11} AuxVars[] AssignedVars[] {2021#(< (+ main_~z~0 3) main_~y~0)} is VALID [2022-04-28 03:42:40,710 INFO L290 TraceCheckUtils]: 8: Hoare triple {2021#(< (+ main_~z~0 3) main_~y~0)} [78] L11-2-->L18-1_primed: Formula: (let ((.cse1 (<= 50000 v_main_~x~0_115)) (.cse2 (= v_main_~x~0_115 v_main_~x~0_114)) (.cse3 (= |v_main_#t~post6_32| |v_main_#t~post6_31|)) (.cse4 (= |v_main_#t~post5_32| |v_main_#t~post5_31|))) (or (let ((.cse0 (+ v_main_~x~0_115 v_main_~y~0_71))) (and (= .cse0 (+ v_main_~x~0_114 v_main_~y~0_72)) .cse1 (< .cse0 (+ v_main_~y~0_72 1000001)) (< v_main_~y~0_72 v_main_~y~0_71))) (and .cse2 (or (not .cse1) (not (< v_main_~x~0_115 1000000))) (= v_main_~y~0_71 v_main_~y~0_72) .cse3 .cse4) (and .cse2 .cse3 .cse4 (= v_main_~y~0_72 v_main_~y~0_71)))) InVars {main_~y~0=v_main_~y~0_72, main_#t~post5=|v_main_#t~post5_32|, main_~x~0=v_main_~x~0_115, main_#t~post6=|v_main_#t~post6_32|} OutVars{main_~y~0=v_main_~y~0_71, main_#t~post5=|v_main_#t~post5_31|, main_~x~0=v_main_~x~0_114, main_#t~post6=|v_main_#t~post6_31|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {2021#(< (+ main_~z~0 3) main_~y~0)} is VALID [2022-04-28 03:42:40,710 INFO L290 TraceCheckUtils]: 7: Hoare triple {2021#(< (+ main_~z~0 3) main_~y~0)} [77] L18-1_primed-->L11-2: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2021#(< (+ main_~z~0 3) main_~y~0)} is VALID [2022-04-28 03:42:40,711 INFO L290 TraceCheckUtils]: 6: Hoare triple {2021#(< (+ main_~z~0 3) main_~y~0)} [76] L11-2-->L18-1_primed: Formula: (let ((.cse0 (= |v_main_#t~post4_35| |v_main_#t~post4_34|)) (.cse1 (= v_main_~x~0_113 v_main_~x~0_112))) (or (and .cse0 .cse1 (<= 50000 v_main_~x~0_113)) (and .cse0 .cse1) (and (< v_main_~x~0_112 50001) (< v_main_~x~0_113 v_main_~x~0_112)))) InVars {main_~x~0=v_main_~x~0_113, main_#t~post4=|v_main_#t~post4_35|} OutVars{main_~x~0=v_main_~x~0_112, main_#t~post4=|v_main_#t~post4_34|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {2021#(< (+ main_~z~0 3) main_~y~0)} is VALID [2022-04-28 03:42:40,711 INFO L290 TraceCheckUtils]: 5: Hoare triple {1929#true} ~x~0 := 0;~y~0 := 50000;~z~0 := 0;~x~0 := 0; {2021#(< (+ main_~z~0 3) main_~y~0)} is VALID [2022-04-28 03:42:40,711 INFO L272 TraceCheckUtils]: 4: Hoare triple {1929#true} call #t~ret9 := main(); {1929#true} is VALID [2022-04-28 03:42:40,711 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1929#true} {1929#true} #52#return; {1929#true} is VALID [2022-04-28 03:42:40,711 INFO L290 TraceCheckUtils]: 2: Hoare triple {1929#true} assume true; {1929#true} is VALID [2022-04-28 03:42:40,711 INFO L290 TraceCheckUtils]: 1: Hoare triple {1929#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(17, 2);call #Ultimate.allocInit(12, 3); {1929#true} is VALID [2022-04-28 03:42:40,712 INFO L272 TraceCheckUtils]: 0: Hoare triple {1929#true} call ULTIMATE.init(); {1929#true} is VALID [2022-04-28 03:42:40,712 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-04-28 03:42:40,712 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1515781657] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 03:42:40,712 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 03:42:40,712 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6, 6] total 15 [2022-04-28 03:42:40,976 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 03:42:40,976 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [542762469] [2022-04-28 03:42:40,976 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [542762469] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 03:42:40,976 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 03:42:40,976 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2022-04-28 03:42:40,976 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [748675081] [2022-04-28 03:42:40,976 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 03:42:40,977 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 1.6875) internal successors, (27), 15 states have internal predecessors, (27), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 31 [2022-04-28 03:42:40,977 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 03:42:40,977 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 16 states, 16 states have (on average 1.6875) internal successors, (27), 15 states have internal predecessors, (27), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:42:41,000 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 31 edges. 31 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 03:42:41,000 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2022-04-28 03:42:41,000 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 03:42:41,001 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-04-28 03:42:41,002 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=221, Invalid=331, Unknown=0, NotChecked=0, Total=552 [2022-04-28 03:42:41,002 INFO L87 Difference]: Start difference. First operand 42 states and 46 transitions. Second operand has 16 states, 16 states have (on average 1.6875) internal successors, (27), 15 states have internal predecessors, (27), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:42:41,608 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:42:41,608 INFO L93 Difference]: Finished difference Result 71 states and 87 transitions. [2022-04-28 03:42:41,608 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-04-28 03:42:41,608 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 1.6875) internal successors, (27), 15 states have internal predecessors, (27), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 31 [2022-04-28 03:42:41,608 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 03:42:41,609 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16 states, 16 states have (on average 1.6875) internal successors, (27), 15 states have internal predecessors, (27), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:42:41,610 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 57 transitions. [2022-04-28 03:42:41,610 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16 states, 16 states have (on average 1.6875) internal successors, (27), 15 states have internal predecessors, (27), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:42:41,611 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 57 transitions. [2022-04-28 03:42:41,612 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 16 states and 57 transitions. [2022-04-28 03:42:41,668 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 57 edges. 57 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 03:42:41,669 INFO L225 Difference]: With dead ends: 71 [2022-04-28 03:42:41,669 INFO L226 Difference]: Without dead ends: 51 [2022-04-28 03:42:41,670 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 79 GetRequests, 42 SyntacticMatches, 2 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 339 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=471, Invalid=861, Unknown=0, NotChecked=0, Total=1332 [2022-04-28 03:42:41,671 INFO L413 NwaCegarLoop]: 12 mSDtfsCounter, 29 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 167 mSolverCounterSat, 46 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 29 SdHoareTripleChecker+Valid, 29 SdHoareTripleChecker+Invalid, 213 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 46 IncrementalHoareTripleChecker+Valid, 167 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-04-28 03:42:41,671 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [29 Valid, 29 Invalid, 213 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [46 Valid, 167 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-04-28 03:42:41,671 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2022-04-28 03:42:41,725 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 37. [2022-04-28 03:42:41,725 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 03:42:41,725 INFO L82 GeneralOperation]: Start isEquivalent. First operand 51 states. Second operand has 37 states, 32 states have (on average 1.125) internal successors, (36), 32 states have internal predecessors, (36), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:42:41,726 INFO L74 IsIncluded]: Start isIncluded. First operand 51 states. Second operand has 37 states, 32 states have (on average 1.125) internal successors, (36), 32 states have internal predecessors, (36), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:42:41,726 INFO L87 Difference]: Start difference. First operand 51 states. Second operand has 37 states, 32 states have (on average 1.125) internal successors, (36), 32 states have internal predecessors, (36), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:42:41,727 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:42:41,727 INFO L93 Difference]: Finished difference Result 51 states and 55 transitions. [2022-04-28 03:42:41,727 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 55 transitions. [2022-04-28 03:42:41,728 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:42:41,728 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:42:41,728 INFO L74 IsIncluded]: Start isIncluded. First operand has 37 states, 32 states have (on average 1.125) internal successors, (36), 32 states have internal predecessors, (36), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 51 states. [2022-04-28 03:42:41,728 INFO L87 Difference]: Start difference. First operand has 37 states, 32 states have (on average 1.125) internal successors, (36), 32 states have internal predecessors, (36), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 51 states. [2022-04-28 03:42:41,729 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:42:41,729 INFO L93 Difference]: Finished difference Result 51 states and 55 transitions. [2022-04-28 03:42:41,730 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 55 transitions. [2022-04-28 03:42:41,730 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:42:41,730 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:42:41,730 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 03:42:41,730 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 03:42:41,730 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 37 states, 32 states have (on average 1.125) internal successors, (36), 32 states have internal predecessors, (36), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:42:41,731 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 40 transitions. [2022-04-28 03:42:41,731 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 40 transitions. Word has length 31 [2022-04-28 03:42:41,731 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 03:42:41,731 INFO L495 AbstractCegarLoop]: Abstraction has 37 states and 40 transitions. [2022-04-28 03:42:41,731 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 1.6875) internal successors, (27), 15 states have internal predecessors, (27), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:42:41,731 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 37 states and 40 transitions. [2022-04-28 03:42:41,773 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 40 edges. 40 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 03:42:41,773 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 40 transitions. [2022-04-28 03:42:41,773 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2022-04-28 03:42:41,774 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 03:42:41,774 INFO L195 NwaCegarLoop]: trace histogram [10, 9, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 03:42:41,789 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2022-04-28 03:42:41,979 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 03:42:41,979 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 03:42:41,980 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 03:42:41,980 INFO L85 PathProgramCache]: Analyzing trace with hash 804248039, now seen corresponding path program 6 times [2022-04-28 03:42:41,980 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 03:42:41,980 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [745096241] [2022-04-28 03:42:42,136 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 1 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 03:42:42,409 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={1=1, 2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 03:42:42,411 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-28 03:42:42,414 INFO L85 PathProgramCache]: Analyzing trace with hash -1920277439, now seen corresponding path program 1 times [2022-04-28 03:42:42,414 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 03:42:42,414 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [58708535] [2022-04-28 03:42:42,414 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:42:42,415 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 03:42:42,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:42:42,560 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 03:42:42,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:42:42,569 INFO L290 TraceCheckUtils]: 0: Hoare triple {2420#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(17, 2);call #Ultimate.allocInit(12, 3); {2407#true} is VALID [2022-04-28 03:42:42,569 INFO L290 TraceCheckUtils]: 1: Hoare triple {2407#true} assume true; {2407#true} is VALID [2022-04-28 03:42:42,569 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {2407#true} {2407#true} #52#return; {2407#true} is VALID [2022-04-28 03:42:42,570 INFO L272 TraceCheckUtils]: 0: Hoare triple {2407#true} call ULTIMATE.init(); {2420#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 03:42:42,570 INFO L290 TraceCheckUtils]: 1: Hoare triple {2420#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(17, 2);call #Ultimate.allocInit(12, 3); {2407#true} is VALID [2022-04-28 03:42:42,570 INFO L290 TraceCheckUtils]: 2: Hoare triple {2407#true} assume true; {2407#true} is VALID [2022-04-28 03:42:42,570 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2407#true} {2407#true} #52#return; {2407#true} is VALID [2022-04-28 03:42:42,570 INFO L272 TraceCheckUtils]: 4: Hoare triple {2407#true} call #t~ret9 := main(); {2407#true} is VALID [2022-04-28 03:42:42,571 INFO L290 TraceCheckUtils]: 5: Hoare triple {2407#true} ~x~0 := 0;~y~0 := 50000;~z~0 := 0;~x~0 := 0; {2412#(and (= main_~z~0 0) (= main_~x~0 0) (<= 50000 main_~y~0))} is VALID [2022-04-28 03:42:42,571 INFO L290 TraceCheckUtils]: 6: Hoare triple {2412#(and (= main_~z~0 0) (= main_~x~0 0) (<= 50000 main_~y~0))} [80] L11-2-->L18-1_primed: Formula: (let ((.cse0 (= |v_main_#t~post4_41| |v_main_#t~post4_40|))) (or (and (= v_main_~x~0_140 v_main_~x~0_139) .cse0) (and (< v_main_~x~0_140 v_main_~x~0_139) (< v_main_~x~0_139 50001)) (and (not (< v_main_~x~0_140 50000)) (= v_main_~x~0_139 v_main_~x~0_140) .cse0))) InVars {main_~x~0=v_main_~x~0_140, main_#t~post4=|v_main_#t~post4_41|} OutVars{main_~x~0=v_main_~x~0_139, main_#t~post4=|v_main_#t~post4_40|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {2413#(and (= main_~z~0 0) (<= main_~x~0 50000) (<= 50000 main_~y~0))} is VALID [2022-04-28 03:42:42,572 INFO L290 TraceCheckUtils]: 7: Hoare triple {2413#(and (= main_~z~0 0) (<= main_~x~0 50000) (<= 50000 main_~y~0))} [81] L18-1_primed-->L11-2: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2413#(and (= main_~z~0 0) (<= main_~x~0 50000) (<= 50000 main_~y~0))} is VALID [2022-04-28 03:42:42,573 INFO L290 TraceCheckUtils]: 8: Hoare triple {2413#(and (= main_~z~0 0) (<= main_~x~0 50000) (<= 50000 main_~y~0))} [82] L11-2-->L18-1_primed: Formula: (let ((.cse2 (= |v_main_#t~post6_39| |v_main_#t~post6_38|)) (.cse3 (= v_main_~x~0_142 v_main_~x~0_141)) (.cse1 (<= 50000 v_main_~x~0_142))) (or (let ((.cse0 (+ v_main_~x~0_142 v_main_~y~0_93))) (and (< .cse0 (+ v_main_~y~0_94 1000001)) (< v_main_~y~0_94 v_main_~y~0_93) .cse1 (= .cse0 (+ v_main_~x~0_141 v_main_~y~0_94)))) (and .cse2 .cse3 (= |v_main_#t~post5_39| |v_main_#t~post5_38|) (= v_main_~y~0_94 v_main_~y~0_93)) (and (= |v_main_#t~post5_38| |v_main_#t~post5_39|) .cse2 .cse3 (= v_main_~y~0_93 v_main_~y~0_94) (or (not .cse1) (not (< v_main_~x~0_142 1000000)))))) InVars {main_~y~0=v_main_~y~0_94, main_#t~post5=|v_main_#t~post5_39|, main_~x~0=v_main_~x~0_142, main_#t~post6=|v_main_#t~post6_39|} OutVars{main_~y~0=v_main_~y~0_93, main_#t~post5=|v_main_#t~post5_38|, main_~x~0=v_main_~x~0_141, main_#t~post6=|v_main_#t~post6_38|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {2414#(or (<= main_~x~0 50000) (and (= main_~z~0 0) (<= 50001 main_~y~0)))} is VALID [2022-04-28 03:42:42,574 INFO L290 TraceCheckUtils]: 9: Hoare triple {2414#(or (<= main_~x~0 50000) (and (= main_~z~0 0) (<= 50001 main_~y~0)))} [79] L18-1_primed-->L18-1: Formula: (not (< v_main_~x~0_11 1000000)) InVars {main_~x~0=v_main_~x~0_11} OutVars{main_~x~0=v_main_~x~0_11} AuxVars[] AssignedVars[] {2415#(and (= main_~z~0 0) (<= 50001 main_~y~0))} is VALID [2022-04-28 03:42:42,574 INFO L290 TraceCheckUtils]: 10: Hoare triple {2415#(and (= main_~z~0 0) (<= 50001 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {2416#(and (= main_~z~0 0) (<= 50000 main_~y~0))} is VALID [2022-04-28 03:42:42,575 INFO L290 TraceCheckUtils]: 11: Hoare triple {2416#(and (= main_~z~0 0) (<= 50000 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {2417#(and (= main_~z~0 0) (<= 49999 main_~y~0))} is VALID [2022-04-28 03:42:42,576 INFO L290 TraceCheckUtils]: 12: Hoare triple {2417#(and (= main_~z~0 0) (<= 49999 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {2418#(and (<= 49998 main_~y~0) (= main_~z~0 0))} is VALID [2022-04-28 03:42:42,576 INFO L290 TraceCheckUtils]: 13: Hoare triple {2418#(and (<= 49998 main_~y~0) (= main_~z~0 0))} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {2419#(and (= main_~z~0 0) (<= 49997 main_~y~0))} is VALID [2022-04-28 03:42:42,578 INFO L290 TraceCheckUtils]: 14: Hoare triple {2419#(and (= main_~z~0 0) (<= 49997 main_~y~0))} assume !(~y~0 > ~z~0); {2408#false} is VALID [2022-04-28 03:42:42,578 INFO L272 TraceCheckUtils]: 15: Hoare triple {2408#false} call __VERIFIER_assert((if ~x~0 == ~z~0 then 1 else 0)); {2408#false} is VALID [2022-04-28 03:42:42,578 INFO L290 TraceCheckUtils]: 16: Hoare triple {2408#false} ~cond := #in~cond; {2408#false} is VALID [2022-04-28 03:42:42,578 INFO L290 TraceCheckUtils]: 17: Hoare triple {2408#false} assume 0 == ~cond; {2408#false} is VALID [2022-04-28 03:42:42,578 INFO L290 TraceCheckUtils]: 18: Hoare triple {2408#false} assume !false; {2408#false} is VALID [2022-04-28 03:42:42,579 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 03:42:42,579 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 03:42:42,579 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [58708535] [2022-04-28 03:42:42,579 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [58708535] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 03:42:42,579 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1809529285] [2022-04-28 03:42:42,579 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:42:42,579 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 03:42:42,579 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 03:42:42,580 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 03:42:42,589 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2022-04-28 03:42:42,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:42:42,623 INFO L263 TraceCheckSpWp]: Trace formula consists of 79 conjuncts, 8 conjunts are in the unsatisfiable core [2022-04-28 03:42:42,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:42:42,631 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 03:42:42,989 INFO L272 TraceCheckUtils]: 0: Hoare triple {2407#true} call ULTIMATE.init(); {2407#true} is VALID [2022-04-28 03:42:42,990 INFO L290 TraceCheckUtils]: 1: Hoare triple {2407#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(17, 2);call #Ultimate.allocInit(12, 3); {2407#true} is VALID [2022-04-28 03:42:42,990 INFO L290 TraceCheckUtils]: 2: Hoare triple {2407#true} assume true; {2407#true} is VALID [2022-04-28 03:42:42,990 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2407#true} {2407#true} #52#return; {2407#true} is VALID [2022-04-28 03:42:42,990 INFO L272 TraceCheckUtils]: 4: Hoare triple {2407#true} call #t~ret9 := main(); {2407#true} is VALID [2022-04-28 03:42:42,990 INFO L290 TraceCheckUtils]: 5: Hoare triple {2407#true} ~x~0 := 0;~y~0 := 50000;~z~0 := 0;~x~0 := 0; {2439#(and (<= main_~z~0 0) (<= 50000 main_~y~0))} is VALID [2022-04-28 03:42:42,991 INFO L290 TraceCheckUtils]: 6: Hoare triple {2439#(and (<= main_~z~0 0) (<= 50000 main_~y~0))} [80] L11-2-->L18-1_primed: Formula: (let ((.cse0 (= |v_main_#t~post4_41| |v_main_#t~post4_40|))) (or (and (= v_main_~x~0_140 v_main_~x~0_139) .cse0) (and (< v_main_~x~0_140 v_main_~x~0_139) (< v_main_~x~0_139 50001)) (and (not (< v_main_~x~0_140 50000)) (= v_main_~x~0_139 v_main_~x~0_140) .cse0))) InVars {main_~x~0=v_main_~x~0_140, main_#t~post4=|v_main_#t~post4_41|} OutVars{main_~x~0=v_main_~x~0_139, main_#t~post4=|v_main_#t~post4_40|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {2439#(and (<= main_~z~0 0) (<= 50000 main_~y~0))} is VALID [2022-04-28 03:42:42,991 INFO L290 TraceCheckUtils]: 7: Hoare triple {2439#(and (<= main_~z~0 0) (<= 50000 main_~y~0))} [81] L18-1_primed-->L11-2: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2439#(and (<= main_~z~0 0) (<= 50000 main_~y~0))} is VALID [2022-04-28 03:42:42,992 INFO L290 TraceCheckUtils]: 8: Hoare triple {2439#(and (<= main_~z~0 0) (<= 50000 main_~y~0))} [82] L11-2-->L18-1_primed: Formula: (let ((.cse2 (= |v_main_#t~post6_39| |v_main_#t~post6_38|)) (.cse3 (= v_main_~x~0_142 v_main_~x~0_141)) (.cse1 (<= 50000 v_main_~x~0_142))) (or (let ((.cse0 (+ v_main_~x~0_142 v_main_~y~0_93))) (and (< .cse0 (+ v_main_~y~0_94 1000001)) (< v_main_~y~0_94 v_main_~y~0_93) .cse1 (= .cse0 (+ v_main_~x~0_141 v_main_~y~0_94)))) (and .cse2 .cse3 (= |v_main_#t~post5_39| |v_main_#t~post5_38|) (= v_main_~y~0_94 v_main_~y~0_93)) (and (= |v_main_#t~post5_38| |v_main_#t~post5_39|) .cse2 .cse3 (= v_main_~y~0_93 v_main_~y~0_94) (or (not .cse1) (not (< v_main_~x~0_142 1000000)))))) InVars {main_~y~0=v_main_~y~0_94, main_#t~post5=|v_main_#t~post5_39|, main_~x~0=v_main_~x~0_142, main_#t~post6=|v_main_#t~post6_39|} OutVars{main_~y~0=v_main_~y~0_93, main_#t~post5=|v_main_#t~post5_38|, main_~x~0=v_main_~x~0_141, main_#t~post6=|v_main_#t~post6_38|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {2439#(and (<= main_~z~0 0) (<= 50000 main_~y~0))} is VALID [2022-04-28 03:42:42,992 INFO L290 TraceCheckUtils]: 9: Hoare triple {2439#(and (<= main_~z~0 0) (<= 50000 main_~y~0))} [79] L18-1_primed-->L18-1: Formula: (not (< v_main_~x~0_11 1000000)) InVars {main_~x~0=v_main_~x~0_11} OutVars{main_~x~0=v_main_~x~0_11} AuxVars[] AssignedVars[] {2439#(and (<= main_~z~0 0) (<= 50000 main_~y~0))} is VALID [2022-04-28 03:42:42,993 INFO L290 TraceCheckUtils]: 10: Hoare triple {2439#(and (<= main_~z~0 0) (<= 50000 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {2455#(and (<= main_~z~0 0) (<= 49999 main_~y~0))} is VALID [2022-04-28 03:42:42,993 INFO L290 TraceCheckUtils]: 11: Hoare triple {2455#(and (<= main_~z~0 0) (<= 49999 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {2459#(and (<= main_~z~0 0) (<= 49998 main_~y~0))} is VALID [2022-04-28 03:42:42,994 INFO L290 TraceCheckUtils]: 12: Hoare triple {2459#(and (<= main_~z~0 0) (<= 49998 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {2463#(and (<= main_~z~0 0) (<= 49997 main_~y~0))} is VALID [2022-04-28 03:42:42,994 INFO L290 TraceCheckUtils]: 13: Hoare triple {2463#(and (<= main_~z~0 0) (<= 49997 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {2467#(and (<= main_~z~0 0) (<= 49996 main_~y~0))} is VALID [2022-04-28 03:42:42,995 INFO L290 TraceCheckUtils]: 14: Hoare triple {2467#(and (<= main_~z~0 0) (<= 49996 main_~y~0))} assume !(~y~0 > ~z~0); {2408#false} is VALID [2022-04-28 03:42:42,995 INFO L272 TraceCheckUtils]: 15: Hoare triple {2408#false} call __VERIFIER_assert((if ~x~0 == ~z~0 then 1 else 0)); {2408#false} is VALID [2022-04-28 03:42:42,995 INFO L290 TraceCheckUtils]: 16: Hoare triple {2408#false} ~cond := #in~cond; {2408#false} is VALID [2022-04-28 03:42:42,995 INFO L290 TraceCheckUtils]: 17: Hoare triple {2408#false} assume 0 == ~cond; {2408#false} is VALID [2022-04-28 03:42:42,995 INFO L290 TraceCheckUtils]: 18: Hoare triple {2408#false} assume !false; {2408#false} is VALID [2022-04-28 03:42:42,995 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-04-28 03:42:42,995 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 03:42:43,381 INFO L290 TraceCheckUtils]: 18: Hoare triple {2408#false} assume !false; {2408#false} is VALID [2022-04-28 03:42:43,381 INFO L290 TraceCheckUtils]: 17: Hoare triple {2408#false} assume 0 == ~cond; {2408#false} is VALID [2022-04-28 03:42:43,381 INFO L290 TraceCheckUtils]: 16: Hoare triple {2408#false} ~cond := #in~cond; {2408#false} is VALID [2022-04-28 03:42:43,382 INFO L272 TraceCheckUtils]: 15: Hoare triple {2408#false} call __VERIFIER_assert((if ~x~0 == ~z~0 then 1 else 0)); {2408#false} is VALID [2022-04-28 03:42:43,382 INFO L290 TraceCheckUtils]: 14: Hoare triple {2495#(< main_~z~0 main_~y~0)} assume !(~y~0 > ~z~0); {2408#false} is VALID [2022-04-28 03:42:43,383 INFO L290 TraceCheckUtils]: 13: Hoare triple {2499#(< (+ main_~z~0 1) main_~y~0)} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {2495#(< main_~z~0 main_~y~0)} is VALID [2022-04-28 03:42:43,383 INFO L290 TraceCheckUtils]: 12: Hoare triple {2503#(< (+ main_~z~0 2) main_~y~0)} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {2499#(< (+ main_~z~0 1) main_~y~0)} is VALID [2022-04-28 03:42:43,384 INFO L290 TraceCheckUtils]: 11: Hoare triple {2507#(< (+ main_~z~0 3) main_~y~0)} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {2503#(< (+ main_~z~0 2) main_~y~0)} is VALID [2022-04-28 03:42:43,385 INFO L290 TraceCheckUtils]: 10: Hoare triple {2511#(< (+ main_~z~0 4) main_~y~0)} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {2507#(< (+ main_~z~0 3) main_~y~0)} is VALID [2022-04-28 03:42:43,385 INFO L290 TraceCheckUtils]: 9: Hoare triple {2511#(< (+ main_~z~0 4) main_~y~0)} [79] L18-1_primed-->L18-1: Formula: (not (< v_main_~x~0_11 1000000)) InVars {main_~x~0=v_main_~x~0_11} OutVars{main_~x~0=v_main_~x~0_11} AuxVars[] AssignedVars[] {2511#(< (+ main_~z~0 4) main_~y~0)} is VALID [2022-04-28 03:42:43,386 INFO L290 TraceCheckUtils]: 8: Hoare triple {2511#(< (+ main_~z~0 4) main_~y~0)} [82] L11-2-->L18-1_primed: Formula: (let ((.cse2 (= |v_main_#t~post6_39| |v_main_#t~post6_38|)) (.cse3 (= v_main_~x~0_142 v_main_~x~0_141)) (.cse1 (<= 50000 v_main_~x~0_142))) (or (let ((.cse0 (+ v_main_~x~0_142 v_main_~y~0_93))) (and (< .cse0 (+ v_main_~y~0_94 1000001)) (< v_main_~y~0_94 v_main_~y~0_93) .cse1 (= .cse0 (+ v_main_~x~0_141 v_main_~y~0_94)))) (and .cse2 .cse3 (= |v_main_#t~post5_39| |v_main_#t~post5_38|) (= v_main_~y~0_94 v_main_~y~0_93)) (and (= |v_main_#t~post5_38| |v_main_#t~post5_39|) .cse2 .cse3 (= v_main_~y~0_93 v_main_~y~0_94) (or (not .cse1) (not (< v_main_~x~0_142 1000000)))))) InVars {main_~y~0=v_main_~y~0_94, main_#t~post5=|v_main_#t~post5_39|, main_~x~0=v_main_~x~0_142, main_#t~post6=|v_main_#t~post6_39|} OutVars{main_~y~0=v_main_~y~0_93, main_#t~post5=|v_main_#t~post5_38|, main_~x~0=v_main_~x~0_141, main_#t~post6=|v_main_#t~post6_38|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {2511#(< (+ main_~z~0 4) main_~y~0)} is VALID [2022-04-28 03:42:43,387 INFO L290 TraceCheckUtils]: 7: Hoare triple {2511#(< (+ main_~z~0 4) main_~y~0)} [81] L18-1_primed-->L11-2: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2511#(< (+ main_~z~0 4) main_~y~0)} is VALID [2022-04-28 03:42:43,387 INFO L290 TraceCheckUtils]: 6: Hoare triple {2511#(< (+ main_~z~0 4) main_~y~0)} [80] L11-2-->L18-1_primed: Formula: (let ((.cse0 (= |v_main_#t~post4_41| |v_main_#t~post4_40|))) (or (and (= v_main_~x~0_140 v_main_~x~0_139) .cse0) (and (< v_main_~x~0_140 v_main_~x~0_139) (< v_main_~x~0_139 50001)) (and (not (< v_main_~x~0_140 50000)) (= v_main_~x~0_139 v_main_~x~0_140) .cse0))) InVars {main_~x~0=v_main_~x~0_140, main_#t~post4=|v_main_#t~post4_41|} OutVars{main_~x~0=v_main_~x~0_139, main_#t~post4=|v_main_#t~post4_40|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {2511#(< (+ main_~z~0 4) main_~y~0)} is VALID [2022-04-28 03:42:43,388 INFO L290 TraceCheckUtils]: 5: Hoare triple {2407#true} ~x~0 := 0;~y~0 := 50000;~z~0 := 0;~x~0 := 0; {2511#(< (+ main_~z~0 4) main_~y~0)} is VALID [2022-04-28 03:42:43,388 INFO L272 TraceCheckUtils]: 4: Hoare triple {2407#true} call #t~ret9 := main(); {2407#true} is VALID [2022-04-28 03:42:43,388 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2407#true} {2407#true} #52#return; {2407#true} is VALID [2022-04-28 03:42:43,388 INFO L290 TraceCheckUtils]: 2: Hoare triple {2407#true} assume true; {2407#true} is VALID [2022-04-28 03:42:43,388 INFO L290 TraceCheckUtils]: 1: Hoare triple {2407#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(17, 2);call #Ultimate.allocInit(12, 3); {2407#true} is VALID [2022-04-28 03:42:43,388 INFO L272 TraceCheckUtils]: 0: Hoare triple {2407#true} call ULTIMATE.init(); {2407#true} is VALID [2022-04-28 03:42:43,388 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-04-28 03:42:43,388 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1809529285] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 03:42:43,388 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 03:42:43,388 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 7, 7] total 21 [2022-04-28 03:42:43,793 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 03:42:43,793 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [745096241] [2022-04-28 03:42:43,793 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [745096241] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 03:42:43,793 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 03:42:43,793 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [19] imperfect sequences [] total 19 [2022-04-28 03:42:43,794 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1989309177] [2022-04-28 03:42:43,794 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 03:42:43,794 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 1.6842105263157894) internal successors, (32), 18 states have internal predecessors, (32), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 36 [2022-04-28 03:42:43,794 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 03:42:43,794 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 19 states, 19 states have (on average 1.6842105263157894) internal successors, (32), 18 states have internal predecessors, (32), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:42:43,822 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 36 edges. 36 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 03:42:43,822 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2022-04-28 03:42:43,823 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 03:42:43,823 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2022-04-28 03:42:43,823 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=370, Invalid=622, Unknown=0, NotChecked=0, Total=992 [2022-04-28 03:42:43,823 INFO L87 Difference]: Start difference. First operand 37 states and 40 transitions. Second operand has 19 states, 19 states have (on average 1.6842105263157894) internal successors, (32), 18 states have internal predecessors, (32), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:42:44,761 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:42:44,761 INFO L93 Difference]: Finished difference Result 87 states and 98 transitions. [2022-04-28 03:42:44,761 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2022-04-28 03:42:44,762 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 1.6842105263157894) internal successors, (32), 18 states have internal predecessors, (32), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 36 [2022-04-28 03:42:44,762 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 03:42:44,762 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19 states, 19 states have (on average 1.6842105263157894) internal successors, (32), 18 states have internal predecessors, (32), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:42:44,764 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 58 transitions. [2022-04-28 03:42:44,764 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19 states, 19 states have (on average 1.6842105263157894) internal successors, (32), 18 states have internal predecessors, (32), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:42:44,765 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 58 transitions. [2022-04-28 03:42:44,765 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 19 states and 58 transitions. [2022-04-28 03:42:44,819 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 58 edges. 58 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 03:42:44,820 INFO L225 Difference]: With dead ends: 87 [2022-04-28 03:42:44,820 INFO L226 Difference]: Without dead ends: 58 [2022-04-28 03:42:44,821 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 91 GetRequests, 43 SyntacticMatches, 2 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 624 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=730, Invalid=1526, Unknown=0, NotChecked=0, Total=2256 [2022-04-28 03:42:44,822 INFO L413 NwaCegarLoop]: 13 mSDtfsCounter, 44 mSDsluCounter, 27 mSDsCounter, 0 mSdLazyCounter, 303 mSolverCounterSat, 47 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 44 SdHoareTripleChecker+Valid, 40 SdHoareTripleChecker+Invalid, 350 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 47 IncrementalHoareTripleChecker+Valid, 303 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-04-28 03:42:44,822 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [44 Valid, 40 Invalid, 350 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [47 Valid, 303 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-04-28 03:42:44,823 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2022-04-28 03:42:44,953 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 58. [2022-04-28 03:42:44,953 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 03:42:44,954 INFO L82 GeneralOperation]: Start isEquivalent. First operand 58 states. Second operand has 58 states, 53 states have (on average 1.0943396226415094) internal successors, (58), 53 states have internal predecessors, (58), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:42:44,955 INFO L74 IsIncluded]: Start isIncluded. First operand 58 states. Second operand has 58 states, 53 states have (on average 1.0943396226415094) internal successors, (58), 53 states have internal predecessors, (58), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:42:44,955 INFO L87 Difference]: Start difference. First operand 58 states. Second operand has 58 states, 53 states have (on average 1.0943396226415094) internal successors, (58), 53 states have internal predecessors, (58), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:42:44,957 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:42:44,957 INFO L93 Difference]: Finished difference Result 58 states and 62 transitions. [2022-04-28 03:42:44,957 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 62 transitions. [2022-04-28 03:42:44,957 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:42:44,957 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:42:44,957 INFO L74 IsIncluded]: Start isIncluded. First operand has 58 states, 53 states have (on average 1.0943396226415094) internal successors, (58), 53 states have internal predecessors, (58), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 58 states. [2022-04-28 03:42:44,957 INFO L87 Difference]: Start difference. First operand has 58 states, 53 states have (on average 1.0943396226415094) internal successors, (58), 53 states have internal predecessors, (58), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 58 states. [2022-04-28 03:42:44,958 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:42:44,958 INFO L93 Difference]: Finished difference Result 58 states and 62 transitions. [2022-04-28 03:42:44,958 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 62 transitions. [2022-04-28 03:42:44,958 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:42:44,958 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:42:44,958 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 03:42:44,958 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 03:42:44,959 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 58 states, 53 states have (on average 1.0943396226415094) internal successors, (58), 53 states have internal predecessors, (58), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:42:44,960 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 62 transitions. [2022-04-28 03:42:44,960 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 62 transitions. Word has length 36 [2022-04-28 03:42:44,960 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 03:42:44,960 INFO L495 AbstractCegarLoop]: Abstraction has 58 states and 62 transitions. [2022-04-28 03:42:44,960 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 1.6842105263157894) internal successors, (32), 18 states have internal predecessors, (32), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:42:44,960 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 58 states and 62 transitions. [2022-04-28 03:42:45,020 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 62 edges. 62 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 03:42:45,021 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 62 transitions. [2022-04-28 03:42:45,021 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2022-04-28 03:42:45,021 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 03:42:45,021 INFO L195 NwaCegarLoop]: trace histogram [11, 10, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 03:42:45,037 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2022-04-28 03:42:45,223 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 03:42:45,223 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 03:42:45,224 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 03:42:45,224 INFO L85 PathProgramCache]: Analyzing trace with hash 601551863, now seen corresponding path program 7 times [2022-04-28 03:42:45,224 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 03:42:45,224 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1044534487] [2022-04-28 03:42:49,314 WARN L977 rdanLoopAcceleration]: Unable to prove correctness of quantifier elimination. [2022-04-28 03:42:49,360 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 1 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 03:42:53,499 WARN L977 rdanLoopAcceleration]: Unable to prove correctness of quantifier elimination. [2022-04-28 03:42:53,656 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={1=1, 2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 03:42:53,657 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-28 03:42:53,659 INFO L85 PathProgramCache]: Analyzing trace with hash -640907198, now seen corresponding path program 1 times [2022-04-28 03:42:53,659 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 03:42:53,659 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1220797397] [2022-04-28 03:42:53,660 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:42:53,660 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 03:42:53,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:42:53,803 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 03:42:53,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:42:53,811 INFO L290 TraceCheckUtils]: 0: Hoare triple {3007#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(17, 2);call #Ultimate.allocInit(12, 3); {2993#true} is VALID [2022-04-28 03:42:53,812 INFO L290 TraceCheckUtils]: 1: Hoare triple {2993#true} assume true; {2993#true} is VALID [2022-04-28 03:42:53,812 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {2993#true} {2993#true} #52#return; {2993#true} is VALID [2022-04-28 03:42:53,812 INFO L272 TraceCheckUtils]: 0: Hoare triple {2993#true} call ULTIMATE.init(); {3007#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 03:42:53,812 INFO L290 TraceCheckUtils]: 1: Hoare triple {3007#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(17, 2);call #Ultimate.allocInit(12, 3); {2993#true} is VALID [2022-04-28 03:42:53,812 INFO L290 TraceCheckUtils]: 2: Hoare triple {2993#true} assume true; {2993#true} is VALID [2022-04-28 03:42:53,813 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2993#true} {2993#true} #52#return; {2993#true} is VALID [2022-04-28 03:42:53,813 INFO L272 TraceCheckUtils]: 4: Hoare triple {2993#true} call #t~ret9 := main(); {2993#true} is VALID [2022-04-28 03:42:53,813 INFO L290 TraceCheckUtils]: 5: Hoare triple {2993#true} ~x~0 := 0;~y~0 := 50000;~z~0 := 0;~x~0 := 0; {2998#(and (= main_~z~0 0) (= main_~x~0 0) (<= 50000 main_~y~0))} is VALID [2022-04-28 03:42:53,814 INFO L290 TraceCheckUtils]: 6: Hoare triple {2998#(and (= main_~z~0 0) (= main_~x~0 0) (<= 50000 main_~y~0))} [84] L11-2-->L18-1_primed: Formula: (let ((.cse0 (= |v_main_#t~post4_47| |v_main_#t~post4_46|))) (or (and (< v_main_~x~0_170 v_main_~x~0_169) (< v_main_~x~0_169 50001)) (and .cse0 (= v_main_~x~0_169 v_main_~x~0_170) (not (< v_main_~x~0_170 50000))) (and .cse0 (= v_main_~x~0_170 v_main_~x~0_169)))) InVars {main_~x~0=v_main_~x~0_170, main_#t~post4=|v_main_#t~post4_47|} OutVars{main_~x~0=v_main_~x~0_169, main_#t~post4=|v_main_#t~post4_46|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {2999#(and (= main_~z~0 0) (<= main_~x~0 50000) (<= 50000 main_~y~0))} is VALID [2022-04-28 03:42:53,814 INFO L290 TraceCheckUtils]: 7: Hoare triple {2999#(and (= main_~z~0 0) (<= main_~x~0 50000) (<= 50000 main_~y~0))} [85] L18-1_primed-->L11-2: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2999#(and (= main_~z~0 0) (<= main_~x~0 50000) (<= 50000 main_~y~0))} is VALID [2022-04-28 03:42:53,816 INFO L290 TraceCheckUtils]: 8: Hoare triple {2999#(and (= main_~z~0 0) (<= main_~x~0 50000) (<= 50000 main_~y~0))} [86] L11-2-->L18-1_primed: Formula: (let ((.cse4 (<= 50000 v_main_~x~0_172)) (.cse0 (= |v_main_#t~post5_46| |v_main_#t~post5_45|)) (.cse1 (= v_main_~x~0_172 v_main_~x~0_171)) (.cse2 (= |v_main_#t~post6_46| |v_main_#t~post6_45|))) (or (and .cse0 .cse1 .cse2 (= v_main_~y~0_120 v_main_~y~0_119)) (let ((.cse3 (+ v_main_~x~0_172 v_main_~y~0_119))) (and (< .cse3 (+ v_main_~y~0_120 1000001)) .cse4 (= (+ v_main_~x~0_171 v_main_~y~0_120) .cse3) (< v_main_~y~0_120 v_main_~y~0_119))) (and (or (not .cse4) (not (< v_main_~x~0_172 1000000))) .cse0 (= v_main_~y~0_119 v_main_~y~0_120) .cse1 .cse2))) InVars {main_~y~0=v_main_~y~0_120, main_#t~post5=|v_main_#t~post5_46|, main_~x~0=v_main_~x~0_172, main_#t~post6=|v_main_#t~post6_46|} OutVars{main_~y~0=v_main_~y~0_119, main_#t~post5=|v_main_#t~post5_45|, main_~x~0=v_main_~x~0_171, main_#t~post6=|v_main_#t~post6_45|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {3000#(or (<= main_~x~0 50000) (and (= main_~z~0 0) (<= 50001 main_~y~0)))} is VALID [2022-04-28 03:42:53,816 INFO L290 TraceCheckUtils]: 9: Hoare triple {3000#(or (<= main_~x~0 50000) (and (= main_~z~0 0) (<= 50001 main_~y~0)))} [83] L18-1_primed-->L18-1: Formula: (not (< v_main_~x~0_11 1000000)) InVars {main_~x~0=v_main_~x~0_11} OutVars{main_~x~0=v_main_~x~0_11} AuxVars[] AssignedVars[] {3001#(and (= main_~z~0 0) (<= 50001 main_~y~0))} is VALID [2022-04-28 03:42:53,817 INFO L290 TraceCheckUtils]: 10: Hoare triple {3001#(and (= main_~z~0 0) (<= 50001 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {3002#(and (= main_~z~0 0) (<= 50000 main_~y~0))} is VALID [2022-04-28 03:42:53,817 INFO L290 TraceCheckUtils]: 11: Hoare triple {3002#(and (= main_~z~0 0) (<= 50000 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {3003#(and (= main_~z~0 0) (<= 49999 main_~y~0))} is VALID [2022-04-28 03:42:53,818 INFO L290 TraceCheckUtils]: 12: Hoare triple {3003#(and (= main_~z~0 0) (<= 49999 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {3004#(and (<= 49998 main_~y~0) (= main_~z~0 0))} is VALID [2022-04-28 03:42:53,818 INFO L290 TraceCheckUtils]: 13: Hoare triple {3004#(and (<= 49998 main_~y~0) (= main_~z~0 0))} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {3005#(and (= main_~z~0 0) (<= 49997 main_~y~0))} is VALID [2022-04-28 03:42:53,819 INFO L290 TraceCheckUtils]: 14: Hoare triple {3005#(and (= main_~z~0 0) (<= 49997 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {3006#(and (= main_~z~0 0) (<= 49996 main_~y~0))} is VALID [2022-04-28 03:42:53,819 INFO L290 TraceCheckUtils]: 15: Hoare triple {3006#(and (= main_~z~0 0) (<= 49996 main_~y~0))} assume !(~y~0 > ~z~0); {2994#false} is VALID [2022-04-28 03:42:53,819 INFO L272 TraceCheckUtils]: 16: Hoare triple {2994#false} call __VERIFIER_assert((if ~x~0 == ~z~0 then 1 else 0)); {2994#false} is VALID [2022-04-28 03:42:53,819 INFO L290 TraceCheckUtils]: 17: Hoare triple {2994#false} ~cond := #in~cond; {2994#false} is VALID [2022-04-28 03:42:53,820 INFO L290 TraceCheckUtils]: 18: Hoare triple {2994#false} assume 0 == ~cond; {2994#false} is VALID [2022-04-28 03:42:53,820 INFO L290 TraceCheckUtils]: 19: Hoare triple {2994#false} assume !false; {2994#false} is VALID [2022-04-28 03:42:53,820 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 17 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 03:42:53,820 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 03:42:53,820 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1220797397] [2022-04-28 03:42:53,820 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1220797397] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 03:42:53,820 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1193898863] [2022-04-28 03:42:53,820 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:42:53,820 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 03:42:53,820 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 03:42:53,821 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 03:42:53,822 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2022-04-28 03:42:53,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:42:53,854 INFO L263 TraceCheckSpWp]: Trace formula consists of 84 conjuncts, 9 conjunts are in the unsatisfiable core [2022-04-28 03:42:53,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:42:53,863 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 03:42:54,204 INFO L272 TraceCheckUtils]: 0: Hoare triple {2993#true} call ULTIMATE.init(); {2993#true} is VALID [2022-04-28 03:42:54,204 INFO L290 TraceCheckUtils]: 1: Hoare triple {2993#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(17, 2);call #Ultimate.allocInit(12, 3); {2993#true} is VALID [2022-04-28 03:42:54,204 INFO L290 TraceCheckUtils]: 2: Hoare triple {2993#true} assume true; {2993#true} is VALID [2022-04-28 03:42:54,204 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2993#true} {2993#true} #52#return; {2993#true} is VALID [2022-04-28 03:42:54,205 INFO L272 TraceCheckUtils]: 4: Hoare triple {2993#true} call #t~ret9 := main(); {2993#true} is VALID [2022-04-28 03:42:54,205 INFO L290 TraceCheckUtils]: 5: Hoare triple {2993#true} ~x~0 := 0;~y~0 := 50000;~z~0 := 0;~x~0 := 0; {3026#(and (<= main_~z~0 0) (<= 50000 main_~y~0))} is VALID [2022-04-28 03:42:54,205 INFO L290 TraceCheckUtils]: 6: Hoare triple {3026#(and (<= main_~z~0 0) (<= 50000 main_~y~0))} [84] L11-2-->L18-1_primed: Formula: (let ((.cse0 (= |v_main_#t~post4_47| |v_main_#t~post4_46|))) (or (and (< v_main_~x~0_170 v_main_~x~0_169) (< v_main_~x~0_169 50001)) (and .cse0 (= v_main_~x~0_169 v_main_~x~0_170) (not (< v_main_~x~0_170 50000))) (and .cse0 (= v_main_~x~0_170 v_main_~x~0_169)))) InVars {main_~x~0=v_main_~x~0_170, main_#t~post4=|v_main_#t~post4_47|} OutVars{main_~x~0=v_main_~x~0_169, main_#t~post4=|v_main_#t~post4_46|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {3026#(and (<= main_~z~0 0) (<= 50000 main_~y~0))} is VALID [2022-04-28 03:42:54,206 INFO L290 TraceCheckUtils]: 7: Hoare triple {3026#(and (<= main_~z~0 0) (<= 50000 main_~y~0))} [85] L18-1_primed-->L11-2: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {3026#(and (<= main_~z~0 0) (<= 50000 main_~y~0))} is VALID [2022-04-28 03:42:54,207 INFO L290 TraceCheckUtils]: 8: Hoare triple {3026#(and (<= main_~z~0 0) (<= 50000 main_~y~0))} [86] L11-2-->L18-1_primed: Formula: (let ((.cse4 (<= 50000 v_main_~x~0_172)) (.cse0 (= |v_main_#t~post5_46| |v_main_#t~post5_45|)) (.cse1 (= v_main_~x~0_172 v_main_~x~0_171)) (.cse2 (= |v_main_#t~post6_46| |v_main_#t~post6_45|))) (or (and .cse0 .cse1 .cse2 (= v_main_~y~0_120 v_main_~y~0_119)) (let ((.cse3 (+ v_main_~x~0_172 v_main_~y~0_119))) (and (< .cse3 (+ v_main_~y~0_120 1000001)) .cse4 (= (+ v_main_~x~0_171 v_main_~y~0_120) .cse3) (< v_main_~y~0_120 v_main_~y~0_119))) (and (or (not .cse4) (not (< v_main_~x~0_172 1000000))) .cse0 (= v_main_~y~0_119 v_main_~y~0_120) .cse1 .cse2))) InVars {main_~y~0=v_main_~y~0_120, main_#t~post5=|v_main_#t~post5_46|, main_~x~0=v_main_~x~0_172, main_#t~post6=|v_main_#t~post6_46|} OutVars{main_~y~0=v_main_~y~0_119, main_#t~post5=|v_main_#t~post5_45|, main_~x~0=v_main_~x~0_171, main_#t~post6=|v_main_#t~post6_45|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {3026#(and (<= main_~z~0 0) (<= 50000 main_~y~0))} is VALID [2022-04-28 03:42:54,216 INFO L290 TraceCheckUtils]: 9: Hoare triple {3026#(and (<= main_~z~0 0) (<= 50000 main_~y~0))} [83] L18-1_primed-->L18-1: Formula: (not (< v_main_~x~0_11 1000000)) InVars {main_~x~0=v_main_~x~0_11} OutVars{main_~x~0=v_main_~x~0_11} AuxVars[] AssignedVars[] {3026#(and (<= main_~z~0 0) (<= 50000 main_~y~0))} is VALID [2022-04-28 03:42:54,217 INFO L290 TraceCheckUtils]: 10: Hoare triple {3026#(and (<= main_~z~0 0) (<= 50000 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {3042#(and (<= main_~z~0 0) (<= 49999 main_~y~0))} is VALID [2022-04-28 03:42:54,218 INFO L290 TraceCheckUtils]: 11: Hoare triple {3042#(and (<= main_~z~0 0) (<= 49999 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {3046#(and (<= main_~z~0 0) (<= 49998 main_~y~0))} is VALID [2022-04-28 03:42:54,218 INFO L290 TraceCheckUtils]: 12: Hoare triple {3046#(and (<= main_~z~0 0) (<= 49998 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {3050#(and (<= main_~z~0 0) (<= 49997 main_~y~0))} is VALID [2022-04-28 03:42:54,219 INFO L290 TraceCheckUtils]: 13: Hoare triple {3050#(and (<= main_~z~0 0) (<= 49997 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {3054#(and (<= main_~z~0 0) (<= 49996 main_~y~0))} is VALID [2022-04-28 03:42:54,219 INFO L290 TraceCheckUtils]: 14: Hoare triple {3054#(and (<= main_~z~0 0) (<= 49996 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {3058#(and (<= main_~z~0 0) (<= 49995 main_~y~0))} is VALID [2022-04-28 03:42:54,220 INFO L290 TraceCheckUtils]: 15: Hoare triple {3058#(and (<= main_~z~0 0) (<= 49995 main_~y~0))} assume !(~y~0 > ~z~0); {2994#false} is VALID [2022-04-28 03:42:54,220 INFO L272 TraceCheckUtils]: 16: Hoare triple {2994#false} call __VERIFIER_assert((if ~x~0 == ~z~0 then 1 else 0)); {2994#false} is VALID [2022-04-28 03:42:54,220 INFO L290 TraceCheckUtils]: 17: Hoare triple {2994#false} ~cond := #in~cond; {2994#false} is VALID [2022-04-28 03:42:54,220 INFO L290 TraceCheckUtils]: 18: Hoare triple {2994#false} assume 0 == ~cond; {2994#false} is VALID [2022-04-28 03:42:54,220 INFO L290 TraceCheckUtils]: 19: Hoare triple {2994#false} assume !false; {2994#false} is VALID [2022-04-28 03:42:54,221 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-04-28 03:42:54,221 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 03:42:54,569 INFO L290 TraceCheckUtils]: 19: Hoare triple {2994#false} assume !false; {2994#false} is VALID [2022-04-28 03:42:54,569 INFO L290 TraceCheckUtils]: 18: Hoare triple {2994#false} assume 0 == ~cond; {2994#false} is VALID [2022-04-28 03:42:54,569 INFO L290 TraceCheckUtils]: 17: Hoare triple {2994#false} ~cond := #in~cond; {2994#false} is VALID [2022-04-28 03:42:54,569 INFO L272 TraceCheckUtils]: 16: Hoare triple {2994#false} call __VERIFIER_assert((if ~x~0 == ~z~0 then 1 else 0)); {2994#false} is VALID [2022-04-28 03:42:54,570 INFO L290 TraceCheckUtils]: 15: Hoare triple {3086#(< main_~z~0 main_~y~0)} assume !(~y~0 > ~z~0); {2994#false} is VALID [2022-04-28 03:42:54,570 INFO L290 TraceCheckUtils]: 14: Hoare triple {3090#(< (+ main_~z~0 1) main_~y~0)} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {3086#(< main_~z~0 main_~y~0)} is VALID [2022-04-28 03:42:54,571 INFO L290 TraceCheckUtils]: 13: Hoare triple {3094#(< (+ main_~z~0 2) main_~y~0)} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {3090#(< (+ main_~z~0 1) main_~y~0)} is VALID [2022-04-28 03:42:54,571 INFO L290 TraceCheckUtils]: 12: Hoare triple {3098#(< (+ main_~z~0 3) main_~y~0)} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {3094#(< (+ main_~z~0 2) main_~y~0)} is VALID [2022-04-28 03:42:54,572 INFO L290 TraceCheckUtils]: 11: Hoare triple {3102#(< (+ main_~z~0 4) main_~y~0)} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {3098#(< (+ main_~z~0 3) main_~y~0)} is VALID [2022-04-28 03:42:54,572 INFO L290 TraceCheckUtils]: 10: Hoare triple {3106#(< (+ 5 main_~z~0) main_~y~0)} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {3102#(< (+ main_~z~0 4) main_~y~0)} is VALID [2022-04-28 03:42:54,573 INFO L290 TraceCheckUtils]: 9: Hoare triple {3106#(< (+ 5 main_~z~0) main_~y~0)} [83] L18-1_primed-->L18-1: Formula: (not (< v_main_~x~0_11 1000000)) InVars {main_~x~0=v_main_~x~0_11} OutVars{main_~x~0=v_main_~x~0_11} AuxVars[] AssignedVars[] {3106#(< (+ 5 main_~z~0) main_~y~0)} is VALID [2022-04-28 03:42:54,574 INFO L290 TraceCheckUtils]: 8: Hoare triple {3106#(< (+ 5 main_~z~0) main_~y~0)} [86] L11-2-->L18-1_primed: Formula: (let ((.cse4 (<= 50000 v_main_~x~0_172)) (.cse0 (= |v_main_#t~post5_46| |v_main_#t~post5_45|)) (.cse1 (= v_main_~x~0_172 v_main_~x~0_171)) (.cse2 (= |v_main_#t~post6_46| |v_main_#t~post6_45|))) (or (and .cse0 .cse1 .cse2 (= v_main_~y~0_120 v_main_~y~0_119)) (let ((.cse3 (+ v_main_~x~0_172 v_main_~y~0_119))) (and (< .cse3 (+ v_main_~y~0_120 1000001)) .cse4 (= (+ v_main_~x~0_171 v_main_~y~0_120) .cse3) (< v_main_~y~0_120 v_main_~y~0_119))) (and (or (not .cse4) (not (< v_main_~x~0_172 1000000))) .cse0 (= v_main_~y~0_119 v_main_~y~0_120) .cse1 .cse2))) InVars {main_~y~0=v_main_~y~0_120, main_#t~post5=|v_main_#t~post5_46|, main_~x~0=v_main_~x~0_172, main_#t~post6=|v_main_#t~post6_46|} OutVars{main_~y~0=v_main_~y~0_119, main_#t~post5=|v_main_#t~post5_45|, main_~x~0=v_main_~x~0_171, main_#t~post6=|v_main_#t~post6_45|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {3106#(< (+ 5 main_~z~0) main_~y~0)} is VALID [2022-04-28 03:42:54,574 INFO L290 TraceCheckUtils]: 7: Hoare triple {3106#(< (+ 5 main_~z~0) main_~y~0)} [85] L18-1_primed-->L11-2: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {3106#(< (+ 5 main_~z~0) main_~y~0)} is VALID [2022-04-28 03:42:54,575 INFO L290 TraceCheckUtils]: 6: Hoare triple {3106#(< (+ 5 main_~z~0) main_~y~0)} [84] L11-2-->L18-1_primed: Formula: (let ((.cse0 (= |v_main_#t~post4_47| |v_main_#t~post4_46|))) (or (and (< v_main_~x~0_170 v_main_~x~0_169) (< v_main_~x~0_169 50001)) (and .cse0 (= v_main_~x~0_169 v_main_~x~0_170) (not (< v_main_~x~0_170 50000))) (and .cse0 (= v_main_~x~0_170 v_main_~x~0_169)))) InVars {main_~x~0=v_main_~x~0_170, main_#t~post4=|v_main_#t~post4_47|} OutVars{main_~x~0=v_main_~x~0_169, main_#t~post4=|v_main_#t~post4_46|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {3106#(< (+ 5 main_~z~0) main_~y~0)} is VALID [2022-04-28 03:42:54,575 INFO L290 TraceCheckUtils]: 5: Hoare triple {2993#true} ~x~0 := 0;~y~0 := 50000;~z~0 := 0;~x~0 := 0; {3106#(< (+ 5 main_~z~0) main_~y~0)} is VALID [2022-04-28 03:42:54,575 INFO L272 TraceCheckUtils]: 4: Hoare triple {2993#true} call #t~ret9 := main(); {2993#true} is VALID [2022-04-28 03:42:54,575 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2993#true} {2993#true} #52#return; {2993#true} is VALID [2022-04-28 03:42:54,575 INFO L290 TraceCheckUtils]: 2: Hoare triple {2993#true} assume true; {2993#true} is VALID [2022-04-28 03:42:54,575 INFO L290 TraceCheckUtils]: 1: Hoare triple {2993#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(17, 2);call #Ultimate.allocInit(12, 3); {2993#true} is VALID [2022-04-28 03:42:54,575 INFO L272 TraceCheckUtils]: 0: Hoare triple {2993#true} call ULTIMATE.init(); {2993#true} is VALID [2022-04-28 03:42:54,575 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-04-28 03:42:54,576 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1193898863] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 03:42:54,576 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 03:42:54,576 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 8, 8] total 24 [2022-04-28 03:42:54,962 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 03:42:54,962 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1044534487] [2022-04-28 03:42:54,962 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1044534487] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 03:42:54,962 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 03:42:54,962 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [21] imperfect sequences [] total 21 [2022-04-28 03:42:54,962 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2064195552] [2022-04-28 03:42:54,962 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 03:42:54,963 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 21 states have (on average 1.6666666666666667) internal successors, (35), 20 states have internal predecessors, (35), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 39 [2022-04-28 03:42:54,963 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 03:42:54,963 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 21 states, 21 states have (on average 1.6666666666666667) internal successors, (35), 20 states have internal predecessors, (35), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:42:54,993 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 39 edges. 39 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 03:42:54,993 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2022-04-28 03:42:54,993 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 03:42:54,993 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2022-04-28 03:42:54,994 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=480, Invalid=780, Unknown=0, NotChecked=0, Total=1260 [2022-04-28 03:42:54,994 INFO L87 Difference]: Start difference. First operand 58 states and 62 transitions. Second operand has 21 states, 21 states have (on average 1.6666666666666667) internal successors, (35), 20 states have internal predecessors, (35), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:42:56,060 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:42:56,061 INFO L93 Difference]: Finished difference Result 91 states and 101 transitions. [2022-04-28 03:42:56,061 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2022-04-28 03:42:56,061 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 21 states have (on average 1.6666666666666667) internal successors, (35), 20 states have internal predecessors, (35), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 39 [2022-04-28 03:42:56,061 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 03:42:56,061 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21 states, 21 states have (on average 1.6666666666666667) internal successors, (35), 20 states have internal predecessors, (35), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:42:56,063 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 60 transitions. [2022-04-28 03:42:56,063 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21 states, 21 states have (on average 1.6666666666666667) internal successors, (35), 20 states have internal predecessors, (35), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:42:56,064 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 60 transitions. [2022-04-28 03:42:56,064 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 21 states and 60 transitions. [2022-04-28 03:42:56,125 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 60 edges. 60 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 03:42:56,126 INFO L225 Difference]: With dead ends: 91 [2022-04-28 03:42:56,126 INFO L226 Difference]: Without dead ends: 61 [2022-04-28 03:42:56,127 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 98 GetRequests, 44 SyntacticMatches, 2 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 797 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=945, Invalid=1917, Unknown=0, NotChecked=0, Total=2862 [2022-04-28 03:42:56,127 INFO L413 NwaCegarLoop]: 13 mSDtfsCounter, 77 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 356 mSolverCounterSat, 80 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 77 SdHoareTripleChecker+Valid, 25 SdHoareTripleChecker+Invalid, 436 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 80 IncrementalHoareTripleChecker+Valid, 356 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-04-28 03:42:56,127 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [77 Valid, 25 Invalid, 436 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [80 Valid, 356 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-04-28 03:42:56,128 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2022-04-28 03:42:56,232 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 61. [2022-04-28 03:42:56,232 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 03:42:56,233 INFO L82 GeneralOperation]: Start isEquivalent. First operand 61 states. Second operand has 61 states, 56 states have (on average 1.0892857142857142) internal successors, (61), 56 states have internal predecessors, (61), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:42:56,233 INFO L74 IsIncluded]: Start isIncluded. First operand 61 states. Second operand has 61 states, 56 states have (on average 1.0892857142857142) internal successors, (61), 56 states have internal predecessors, (61), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:42:56,233 INFO L87 Difference]: Start difference. First operand 61 states. Second operand has 61 states, 56 states have (on average 1.0892857142857142) internal successors, (61), 56 states have internal predecessors, (61), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:42:56,235 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:42:56,235 INFO L93 Difference]: Finished difference Result 61 states and 65 transitions. [2022-04-28 03:42:56,235 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 65 transitions. [2022-04-28 03:42:56,235 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:42:56,235 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:42:56,236 INFO L74 IsIncluded]: Start isIncluded. First operand has 61 states, 56 states have (on average 1.0892857142857142) internal successors, (61), 56 states have internal predecessors, (61), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 61 states. [2022-04-28 03:42:56,236 INFO L87 Difference]: Start difference. First operand has 61 states, 56 states have (on average 1.0892857142857142) internal successors, (61), 56 states have internal predecessors, (61), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 61 states. [2022-04-28 03:42:56,237 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:42:56,237 INFO L93 Difference]: Finished difference Result 61 states and 65 transitions. [2022-04-28 03:42:56,237 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 65 transitions. [2022-04-28 03:42:56,237 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:42:56,237 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:42:56,237 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 03:42:56,237 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 03:42:56,237 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 61 states, 56 states have (on average 1.0892857142857142) internal successors, (61), 56 states have internal predecessors, (61), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:42:56,238 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 65 transitions. [2022-04-28 03:42:56,238 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 65 transitions. Word has length 39 [2022-04-28 03:42:56,239 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 03:42:56,239 INFO L495 AbstractCegarLoop]: Abstraction has 61 states and 65 transitions. [2022-04-28 03:42:56,239 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 21 states have (on average 1.6666666666666667) internal successors, (35), 20 states have internal predecessors, (35), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:42:56,239 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 61 states and 65 transitions. [2022-04-28 03:42:56,302 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 65 edges. 65 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 03:42:56,302 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 65 transitions. [2022-04-28 03:42:56,302 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2022-04-28 03:42:56,303 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 03:42:56,303 INFO L195 NwaCegarLoop]: trace histogram [12, 11, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 03:42:56,324 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2022-04-28 03:42:56,519 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 03:42:56,520 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 03:42:56,520 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 03:42:56,520 INFO L85 PathProgramCache]: Analyzing trace with hash -1080568111, now seen corresponding path program 8 times [2022-04-28 03:42:56,520 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 03:42:56,520 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1198524775] [2022-04-28 03:42:56,639 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 1 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 03:42:56,864 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={1=1, 2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 03:42:56,865 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-28 03:42:56,867 INFO L85 PathProgramCache]: Analyzing trace with hash 697975393, now seen corresponding path program 1 times [2022-04-28 03:42:56,867 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 03:42:56,867 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1592340863] [2022-04-28 03:42:56,867 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:42:56,867 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 03:42:56,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:42:57,067 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 03:42:57,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:42:57,071 INFO L290 TraceCheckUtils]: 0: Hoare triple {3628#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(17, 2);call #Ultimate.allocInit(12, 3); {3613#true} is VALID [2022-04-28 03:42:57,071 INFO L290 TraceCheckUtils]: 1: Hoare triple {3613#true} assume true; {3613#true} is VALID [2022-04-28 03:42:57,072 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {3613#true} {3613#true} #52#return; {3613#true} is VALID [2022-04-28 03:42:57,072 INFO L272 TraceCheckUtils]: 0: Hoare triple {3613#true} call ULTIMATE.init(); {3628#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 03:42:57,072 INFO L290 TraceCheckUtils]: 1: Hoare triple {3628#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(17, 2);call #Ultimate.allocInit(12, 3); {3613#true} is VALID [2022-04-28 03:42:57,072 INFO L290 TraceCheckUtils]: 2: Hoare triple {3613#true} assume true; {3613#true} is VALID [2022-04-28 03:42:57,072 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3613#true} {3613#true} #52#return; {3613#true} is VALID [2022-04-28 03:42:57,072 INFO L272 TraceCheckUtils]: 4: Hoare triple {3613#true} call #t~ret9 := main(); {3613#true} is VALID [2022-04-28 03:42:57,073 INFO L290 TraceCheckUtils]: 5: Hoare triple {3613#true} ~x~0 := 0;~y~0 := 50000;~z~0 := 0;~x~0 := 0; {3618#(and (= main_~z~0 0) (= main_~x~0 0) (<= 50000 main_~y~0))} is VALID [2022-04-28 03:42:57,073 INFO L290 TraceCheckUtils]: 6: Hoare triple {3618#(and (= main_~z~0 0) (= main_~x~0 0) (<= 50000 main_~y~0))} [88] L11-2-->L18-1_primed: Formula: (let ((.cse0 (= v_main_~x~0_202 v_main_~x~0_201)) (.cse1 (= |v_main_#t~post4_53| |v_main_#t~post4_52|))) (or (and .cse0 .cse1) (and (< v_main_~x~0_201 50001) (< v_main_~x~0_202 v_main_~x~0_201)) (and .cse0 (<= 50000 v_main_~x~0_202) .cse1))) InVars {main_~x~0=v_main_~x~0_202, main_#t~post4=|v_main_#t~post4_53|} OutVars{main_~x~0=v_main_~x~0_201, main_#t~post4=|v_main_#t~post4_52|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {3619#(and (= main_~z~0 0) (<= main_~x~0 main_~y~0) (<= main_~x~0 50000))} is VALID [2022-04-28 03:42:57,074 INFO L290 TraceCheckUtils]: 7: Hoare triple {3619#(and (= main_~z~0 0) (<= main_~x~0 main_~y~0) (<= main_~x~0 50000))} [89] L18-1_primed-->L11-2: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {3619#(and (= main_~z~0 0) (<= main_~x~0 main_~y~0) (<= main_~x~0 50000))} is VALID [2022-04-28 03:42:57,075 INFO L290 TraceCheckUtils]: 8: Hoare triple {3619#(and (= main_~z~0 0) (<= main_~x~0 main_~y~0) (<= main_~x~0 50000))} [90] L11-2-->L18-1_primed: Formula: (let ((.cse3 (<= 50000 v_main_~x~0_204)) (.cse0 (= |v_main_#t~post5_53| |v_main_#t~post5_52|)) (.cse1 (= v_main_~y~0_149 v_main_~y~0_148)) (.cse2 (= |v_main_#t~post6_53| |v_main_#t~post6_52|))) (or (and .cse0 .cse1 .cse2 (or (not .cse3) (not (< v_main_~x~0_204 1000000))) (= v_main_~x~0_203 v_main_~x~0_204)) (and (< v_main_~x~0_203 1000001) (< v_main_~x~0_204 v_main_~x~0_203) (= (+ v_main_~x~0_204 v_main_~y~0_148) (+ v_main_~x~0_203 v_main_~y~0_149)) .cse3) (and (= v_main_~x~0_204 v_main_~x~0_203) .cse0 .cse1 .cse2))) InVars {main_~y~0=v_main_~y~0_149, main_#t~post5=|v_main_#t~post5_53|, main_~x~0=v_main_~x~0_204, main_#t~post6=|v_main_#t~post6_53|} OutVars{main_~y~0=v_main_~y~0_148, main_#t~post5=|v_main_#t~post5_52|, main_~x~0=v_main_~x~0_203, main_#t~post6=|v_main_#t~post6_52|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {3620#(and (= main_~z~0 0) (or (<= main_~x~0 main_~y~0) (<= main_~x~0 50000)))} is VALID [2022-04-28 03:42:57,075 INFO L290 TraceCheckUtils]: 9: Hoare triple {3620#(and (= main_~z~0 0) (or (<= main_~x~0 main_~y~0) (<= main_~x~0 50000)))} [87] L18-1_primed-->L18-1: Formula: (not (< v_main_~x~0_11 1000000)) InVars {main_~x~0=v_main_~x~0_11} OutVars{main_~x~0=v_main_~x~0_11} AuxVars[] AssignedVars[] {3621#(and (= main_~z~0 0) (<= 1000000 main_~y~0))} is VALID [2022-04-28 03:42:57,076 INFO L290 TraceCheckUtils]: 10: Hoare triple {3621#(and (= main_~z~0 0) (<= 1000000 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {3622#(and (= main_~z~0 0) (<= 999999 main_~y~0))} is VALID [2022-04-28 03:42:57,076 INFO L290 TraceCheckUtils]: 11: Hoare triple {3622#(and (= main_~z~0 0) (<= 999999 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {3623#(and (= main_~z~0 0) (<= 999998 main_~y~0))} is VALID [2022-04-28 03:42:57,077 INFO L290 TraceCheckUtils]: 12: Hoare triple {3623#(and (= main_~z~0 0) (<= 999998 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {3624#(and (= main_~z~0 0) (<= 999997 main_~y~0))} is VALID [2022-04-28 03:42:57,077 INFO L290 TraceCheckUtils]: 13: Hoare triple {3624#(and (= main_~z~0 0) (<= 999997 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {3625#(and (<= 999996 main_~y~0) (= main_~z~0 0))} is VALID [2022-04-28 03:42:57,078 INFO L290 TraceCheckUtils]: 14: Hoare triple {3625#(and (<= 999996 main_~y~0) (= main_~z~0 0))} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {3626#(and (= main_~z~0 0) (<= 999995 main_~y~0))} is VALID [2022-04-28 03:42:57,078 INFO L290 TraceCheckUtils]: 15: Hoare triple {3626#(and (= main_~z~0 0) (<= 999995 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {3627#(and (= main_~z~0 0) (<= 999994 main_~y~0))} is VALID [2022-04-28 03:42:57,078 INFO L290 TraceCheckUtils]: 16: Hoare triple {3627#(and (= main_~z~0 0) (<= 999994 main_~y~0))} assume !(~y~0 > ~z~0); {3614#false} is VALID [2022-04-28 03:42:57,079 INFO L272 TraceCheckUtils]: 17: Hoare triple {3614#false} call __VERIFIER_assert((if ~x~0 == ~z~0 then 1 else 0)); {3614#false} is VALID [2022-04-28 03:42:57,079 INFO L290 TraceCheckUtils]: 18: Hoare triple {3614#false} ~cond := #in~cond; {3614#false} is VALID [2022-04-28 03:42:57,079 INFO L290 TraceCheckUtils]: 19: Hoare triple {3614#false} assume 0 == ~cond; {3614#false} is VALID [2022-04-28 03:42:57,079 INFO L290 TraceCheckUtils]: 20: Hoare triple {3614#false} assume !false; {3614#false} is VALID [2022-04-28 03:42:57,079 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 0 proven. 23 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 03:42:57,079 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 03:42:57,079 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1592340863] [2022-04-28 03:42:57,079 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1592340863] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 03:42:57,079 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1122632879] [2022-04-28 03:42:57,080 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:42:57,080 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 03:42:57,080 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 03:42:57,081 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 03:42:57,081 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2022-04-28 03:42:57,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:42:57,116 INFO L263 TraceCheckSpWp]: Trace formula consists of 89 conjuncts, 10 conjunts are in the unsatisfiable core [2022-04-28 03:42:57,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:42:57,130 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 03:42:57,572 INFO L272 TraceCheckUtils]: 0: Hoare triple {3613#true} call ULTIMATE.init(); {3613#true} is VALID [2022-04-28 03:42:57,573 INFO L290 TraceCheckUtils]: 1: Hoare triple {3613#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(17, 2);call #Ultimate.allocInit(12, 3); {3613#true} is VALID [2022-04-28 03:42:57,573 INFO L290 TraceCheckUtils]: 2: Hoare triple {3613#true} assume true; {3613#true} is VALID [2022-04-28 03:42:57,573 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3613#true} {3613#true} #52#return; {3613#true} is VALID [2022-04-28 03:42:57,573 INFO L272 TraceCheckUtils]: 4: Hoare triple {3613#true} call #t~ret9 := main(); {3613#true} is VALID [2022-04-28 03:42:57,573 INFO L290 TraceCheckUtils]: 5: Hoare triple {3613#true} ~x~0 := 0;~y~0 := 50000;~z~0 := 0;~x~0 := 0; {3647#(and (<= main_~z~0 0) (<= 50000 main_~y~0))} is VALID [2022-04-28 03:42:57,574 INFO L290 TraceCheckUtils]: 6: Hoare triple {3647#(and (<= main_~z~0 0) (<= 50000 main_~y~0))} [88] L11-2-->L18-1_primed: Formula: (let ((.cse0 (= v_main_~x~0_202 v_main_~x~0_201)) (.cse1 (= |v_main_#t~post4_53| |v_main_#t~post4_52|))) (or (and .cse0 .cse1) (and (< v_main_~x~0_201 50001) (< v_main_~x~0_202 v_main_~x~0_201)) (and .cse0 (<= 50000 v_main_~x~0_202) .cse1))) InVars {main_~x~0=v_main_~x~0_202, main_#t~post4=|v_main_#t~post4_53|} OutVars{main_~x~0=v_main_~x~0_201, main_#t~post4=|v_main_#t~post4_52|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {3647#(and (<= main_~z~0 0) (<= 50000 main_~y~0))} is VALID [2022-04-28 03:42:57,574 INFO L290 TraceCheckUtils]: 7: Hoare triple {3647#(and (<= main_~z~0 0) (<= 50000 main_~y~0))} [89] L18-1_primed-->L11-2: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {3647#(and (<= main_~z~0 0) (<= 50000 main_~y~0))} is VALID [2022-04-28 03:42:57,576 INFO L290 TraceCheckUtils]: 8: Hoare triple {3647#(and (<= main_~z~0 0) (<= 50000 main_~y~0))} [90] L11-2-->L18-1_primed: Formula: (let ((.cse3 (<= 50000 v_main_~x~0_204)) (.cse0 (= |v_main_#t~post5_53| |v_main_#t~post5_52|)) (.cse1 (= v_main_~y~0_149 v_main_~y~0_148)) (.cse2 (= |v_main_#t~post6_53| |v_main_#t~post6_52|))) (or (and .cse0 .cse1 .cse2 (or (not .cse3) (not (< v_main_~x~0_204 1000000))) (= v_main_~x~0_203 v_main_~x~0_204)) (and (< v_main_~x~0_203 1000001) (< v_main_~x~0_204 v_main_~x~0_203) (= (+ v_main_~x~0_204 v_main_~y~0_148) (+ v_main_~x~0_203 v_main_~y~0_149)) .cse3) (and (= v_main_~x~0_204 v_main_~x~0_203) .cse0 .cse1 .cse2))) InVars {main_~y~0=v_main_~y~0_149, main_#t~post5=|v_main_#t~post5_53|, main_~x~0=v_main_~x~0_204, main_#t~post6=|v_main_#t~post6_53|} OutVars{main_~y~0=v_main_~y~0_148, main_#t~post5=|v_main_#t~post5_52|, main_~x~0=v_main_~x~0_203, main_#t~post6=|v_main_#t~post6_52|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {3647#(and (<= main_~z~0 0) (<= 50000 main_~y~0))} is VALID [2022-04-28 03:42:57,576 INFO L290 TraceCheckUtils]: 9: Hoare triple {3647#(and (<= main_~z~0 0) (<= 50000 main_~y~0))} [87] L18-1_primed-->L18-1: Formula: (not (< v_main_~x~0_11 1000000)) InVars {main_~x~0=v_main_~x~0_11} OutVars{main_~x~0=v_main_~x~0_11} AuxVars[] AssignedVars[] {3647#(and (<= main_~z~0 0) (<= 50000 main_~y~0))} is VALID [2022-04-28 03:42:57,577 INFO L290 TraceCheckUtils]: 10: Hoare triple {3647#(and (<= main_~z~0 0) (<= 50000 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {3663#(and (<= main_~z~0 0) (<= 49999 main_~y~0))} is VALID [2022-04-28 03:42:57,577 INFO L290 TraceCheckUtils]: 11: Hoare triple {3663#(and (<= main_~z~0 0) (<= 49999 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {3667#(and (<= main_~z~0 0) (<= 49998 main_~y~0))} is VALID [2022-04-28 03:42:57,578 INFO L290 TraceCheckUtils]: 12: Hoare triple {3667#(and (<= main_~z~0 0) (<= 49998 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {3671#(and (<= main_~z~0 0) (<= 49997 main_~y~0))} is VALID [2022-04-28 03:42:57,578 INFO L290 TraceCheckUtils]: 13: Hoare triple {3671#(and (<= main_~z~0 0) (<= 49997 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {3675#(and (<= main_~z~0 0) (<= 49996 main_~y~0))} is VALID [2022-04-28 03:42:57,579 INFO L290 TraceCheckUtils]: 14: Hoare triple {3675#(and (<= main_~z~0 0) (<= 49996 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {3679#(and (<= main_~z~0 0) (<= 49995 main_~y~0))} is VALID [2022-04-28 03:42:57,579 INFO L290 TraceCheckUtils]: 15: Hoare triple {3679#(and (<= main_~z~0 0) (<= 49995 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {3683#(and (<= main_~z~0 0) (<= 49994 main_~y~0))} is VALID [2022-04-28 03:42:57,580 INFO L290 TraceCheckUtils]: 16: Hoare triple {3683#(and (<= main_~z~0 0) (<= 49994 main_~y~0))} assume !(~y~0 > ~z~0); {3614#false} is VALID [2022-04-28 03:42:57,580 INFO L272 TraceCheckUtils]: 17: Hoare triple {3614#false} call __VERIFIER_assert((if ~x~0 == ~z~0 then 1 else 0)); {3614#false} is VALID [2022-04-28 03:42:57,580 INFO L290 TraceCheckUtils]: 18: Hoare triple {3614#false} ~cond := #in~cond; {3614#false} is VALID [2022-04-28 03:42:57,580 INFO L290 TraceCheckUtils]: 19: Hoare triple {3614#false} assume 0 == ~cond; {3614#false} is VALID [2022-04-28 03:42:57,580 INFO L290 TraceCheckUtils]: 20: Hoare triple {3614#false} assume !false; {3614#false} is VALID [2022-04-28 03:42:57,580 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-04-28 03:42:57,580 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 03:42:58,028 INFO L290 TraceCheckUtils]: 20: Hoare triple {3614#false} assume !false; {3614#false} is VALID [2022-04-28 03:42:58,028 INFO L290 TraceCheckUtils]: 19: Hoare triple {3614#false} assume 0 == ~cond; {3614#false} is VALID [2022-04-28 03:42:58,028 INFO L290 TraceCheckUtils]: 18: Hoare triple {3614#false} ~cond := #in~cond; {3614#false} is VALID [2022-04-28 03:42:58,028 INFO L272 TraceCheckUtils]: 17: Hoare triple {3614#false} call __VERIFIER_assert((if ~x~0 == ~z~0 then 1 else 0)); {3614#false} is VALID [2022-04-28 03:42:58,029 INFO L290 TraceCheckUtils]: 16: Hoare triple {3711#(< main_~z~0 main_~y~0)} assume !(~y~0 > ~z~0); {3614#false} is VALID [2022-04-28 03:42:58,029 INFO L290 TraceCheckUtils]: 15: Hoare triple {3715#(< (+ main_~z~0 1) main_~y~0)} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {3711#(< main_~z~0 main_~y~0)} is VALID [2022-04-28 03:42:58,030 INFO L290 TraceCheckUtils]: 14: Hoare triple {3719#(< (+ main_~z~0 2) main_~y~0)} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {3715#(< (+ main_~z~0 1) main_~y~0)} is VALID [2022-04-28 03:42:58,030 INFO L290 TraceCheckUtils]: 13: Hoare triple {3723#(< (+ main_~z~0 3) main_~y~0)} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {3719#(< (+ main_~z~0 2) main_~y~0)} is VALID [2022-04-28 03:42:58,031 INFO L290 TraceCheckUtils]: 12: Hoare triple {3727#(< (+ main_~z~0 4) main_~y~0)} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {3723#(< (+ main_~z~0 3) main_~y~0)} is VALID [2022-04-28 03:42:58,031 INFO L290 TraceCheckUtils]: 11: Hoare triple {3731#(< (+ 5 main_~z~0) main_~y~0)} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {3727#(< (+ main_~z~0 4) main_~y~0)} is VALID [2022-04-28 03:42:58,032 INFO L290 TraceCheckUtils]: 10: Hoare triple {3735#(< (+ main_~z~0 6) main_~y~0)} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {3731#(< (+ 5 main_~z~0) main_~y~0)} is VALID [2022-04-28 03:42:58,032 INFO L290 TraceCheckUtils]: 9: Hoare triple {3735#(< (+ main_~z~0 6) main_~y~0)} [87] L18-1_primed-->L18-1: Formula: (not (< v_main_~x~0_11 1000000)) InVars {main_~x~0=v_main_~x~0_11} OutVars{main_~x~0=v_main_~x~0_11} AuxVars[] AssignedVars[] {3735#(< (+ main_~z~0 6) main_~y~0)} is VALID [2022-04-28 03:42:58,033 INFO L290 TraceCheckUtils]: 8: Hoare triple {3735#(< (+ main_~z~0 6) main_~y~0)} [90] L11-2-->L18-1_primed: Formula: (let ((.cse3 (<= 50000 v_main_~x~0_204)) (.cse0 (= |v_main_#t~post5_53| |v_main_#t~post5_52|)) (.cse1 (= v_main_~y~0_149 v_main_~y~0_148)) (.cse2 (= |v_main_#t~post6_53| |v_main_#t~post6_52|))) (or (and .cse0 .cse1 .cse2 (or (not .cse3) (not (< v_main_~x~0_204 1000000))) (= v_main_~x~0_203 v_main_~x~0_204)) (and (< v_main_~x~0_203 1000001) (< v_main_~x~0_204 v_main_~x~0_203) (= (+ v_main_~x~0_204 v_main_~y~0_148) (+ v_main_~x~0_203 v_main_~y~0_149)) .cse3) (and (= v_main_~x~0_204 v_main_~x~0_203) .cse0 .cse1 .cse2))) InVars {main_~y~0=v_main_~y~0_149, main_#t~post5=|v_main_#t~post5_53|, main_~x~0=v_main_~x~0_204, main_#t~post6=|v_main_#t~post6_53|} OutVars{main_~y~0=v_main_~y~0_148, main_#t~post5=|v_main_#t~post5_52|, main_~x~0=v_main_~x~0_203, main_#t~post6=|v_main_#t~post6_52|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {3735#(< (+ main_~z~0 6) main_~y~0)} is VALID [2022-04-28 03:42:58,033 INFO L290 TraceCheckUtils]: 7: Hoare triple {3735#(< (+ main_~z~0 6) main_~y~0)} [89] L18-1_primed-->L11-2: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {3735#(< (+ main_~z~0 6) main_~y~0)} is VALID [2022-04-28 03:42:58,033 INFO L290 TraceCheckUtils]: 6: Hoare triple {3735#(< (+ main_~z~0 6) main_~y~0)} [88] L11-2-->L18-1_primed: Formula: (let ((.cse0 (= v_main_~x~0_202 v_main_~x~0_201)) (.cse1 (= |v_main_#t~post4_53| |v_main_#t~post4_52|))) (or (and .cse0 .cse1) (and (< v_main_~x~0_201 50001) (< v_main_~x~0_202 v_main_~x~0_201)) (and .cse0 (<= 50000 v_main_~x~0_202) .cse1))) InVars {main_~x~0=v_main_~x~0_202, main_#t~post4=|v_main_#t~post4_53|} OutVars{main_~x~0=v_main_~x~0_201, main_#t~post4=|v_main_#t~post4_52|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {3735#(< (+ main_~z~0 6) main_~y~0)} is VALID [2022-04-28 03:42:58,034 INFO L290 TraceCheckUtils]: 5: Hoare triple {3613#true} ~x~0 := 0;~y~0 := 50000;~z~0 := 0;~x~0 := 0; {3735#(< (+ main_~z~0 6) main_~y~0)} is VALID [2022-04-28 03:42:58,034 INFO L272 TraceCheckUtils]: 4: Hoare triple {3613#true} call #t~ret9 := main(); {3613#true} is VALID [2022-04-28 03:42:58,034 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3613#true} {3613#true} #52#return; {3613#true} is VALID [2022-04-28 03:42:58,034 INFO L290 TraceCheckUtils]: 2: Hoare triple {3613#true} assume true; {3613#true} is VALID [2022-04-28 03:42:58,034 INFO L290 TraceCheckUtils]: 1: Hoare triple {3613#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(17, 2);call #Ultimate.allocInit(12, 3); {3613#true} is VALID [2022-04-28 03:42:58,034 INFO L272 TraceCheckUtils]: 0: Hoare triple {3613#true} call ULTIMATE.init(); {3613#true} is VALID [2022-04-28 03:42:58,034 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-04-28 03:42:58,034 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1122632879] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 03:42:58,035 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 03:42:58,035 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 9, 9] total 27 [2022-04-28 03:42:58,508 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 03:42:58,508 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1198524775] [2022-04-28 03:42:58,508 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1198524775] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 03:42:58,508 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 03:42:58,508 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [23] imperfect sequences [] total 23 [2022-04-28 03:42:58,508 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [418600675] [2022-04-28 03:42:58,508 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 03:42:58,509 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 23 states have (on average 1.6521739130434783) internal successors, (38), 22 states have internal predecessors, (38), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 42 [2022-04-28 03:42:58,509 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 03:42:58,509 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 23 states, 23 states have (on average 1.6521739130434783) internal successors, (38), 22 states have internal predecessors, (38), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:42:58,540 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 42 edges. 42 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 03:42:58,540 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2022-04-28 03:42:58,540 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 03:42:58,540 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2022-04-28 03:42:58,541 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=503, Invalid=1057, Unknown=0, NotChecked=0, Total=1560 [2022-04-28 03:42:58,541 INFO L87 Difference]: Start difference. First operand 61 states and 65 transitions. Second operand has 23 states, 23 states have (on average 1.6521739130434783) internal successors, (38), 22 states have internal predecessors, (38), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:42:59,671 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:42:59,671 INFO L93 Difference]: Finished difference Result 94 states and 103 transitions. [2022-04-28 03:42:59,671 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-04-28 03:42:59,671 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 23 states have (on average 1.6521739130434783) internal successors, (38), 22 states have internal predecessors, (38), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 42 [2022-04-28 03:42:59,672 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 03:42:59,672 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23 states, 23 states have (on average 1.6521739130434783) internal successors, (38), 22 states have internal predecessors, (38), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:42:59,673 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 55 transitions. [2022-04-28 03:42:59,673 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23 states, 23 states have (on average 1.6521739130434783) internal successors, (38), 22 states have internal predecessors, (38), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:42:59,673 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 55 transitions. [2022-04-28 03:42:59,673 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 16 states and 55 transitions. [2022-04-28 03:42:59,716 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 55 edges. 55 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 03:42:59,717 INFO L225 Difference]: With dead ends: 94 [2022-04-28 03:42:59,717 INFO L226 Difference]: Without dead ends: 63 [2022-04-28 03:42:59,718 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 98 GetRequests, 45 SyntacticMatches, 2 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 660 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=754, Invalid=2002, Unknown=0, NotChecked=0, Total=2756 [2022-04-28 03:42:59,718 INFO L413 NwaCegarLoop]: 13 mSDtfsCounter, 23 mSDsluCounter, 72 mSDsCounter, 0 mSdLazyCounter, 490 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 85 SdHoareTripleChecker+Invalid, 508 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 490 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-04-28 03:42:59,719 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [23 Valid, 85 Invalid, 508 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 490 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-04-28 03:42:59,720 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2022-04-28 03:42:59,832 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 63. [2022-04-28 03:42:59,832 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 03:42:59,833 INFO L82 GeneralOperation]: Start isEquivalent. First operand 63 states. Second operand has 63 states, 58 states have (on average 1.0862068965517242) internal successors, (63), 58 states have internal predecessors, (63), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:42:59,833 INFO L74 IsIncluded]: Start isIncluded. First operand 63 states. Second operand has 63 states, 58 states have (on average 1.0862068965517242) internal successors, (63), 58 states have internal predecessors, (63), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:42:59,833 INFO L87 Difference]: Start difference. First operand 63 states. Second operand has 63 states, 58 states have (on average 1.0862068965517242) internal successors, (63), 58 states have internal predecessors, (63), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:42:59,834 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:42:59,834 INFO L93 Difference]: Finished difference Result 63 states and 67 transitions. [2022-04-28 03:42:59,834 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 67 transitions. [2022-04-28 03:42:59,834 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:42:59,834 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:42:59,835 INFO L74 IsIncluded]: Start isIncluded. First operand has 63 states, 58 states have (on average 1.0862068965517242) internal successors, (63), 58 states have internal predecessors, (63), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 63 states. [2022-04-28 03:42:59,835 INFO L87 Difference]: Start difference. First operand has 63 states, 58 states have (on average 1.0862068965517242) internal successors, (63), 58 states have internal predecessors, (63), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 63 states. [2022-04-28 03:42:59,836 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:42:59,836 INFO L93 Difference]: Finished difference Result 63 states and 67 transitions. [2022-04-28 03:42:59,836 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 67 transitions. [2022-04-28 03:42:59,836 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:42:59,836 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:42:59,836 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 03:42:59,836 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 03:42:59,836 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 63 states, 58 states have (on average 1.0862068965517242) internal successors, (63), 58 states have internal predecessors, (63), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:42:59,837 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 67 transitions. [2022-04-28 03:42:59,837 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 67 transitions. Word has length 42 [2022-04-28 03:42:59,837 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 03:42:59,837 INFO L495 AbstractCegarLoop]: Abstraction has 63 states and 67 transitions. [2022-04-28 03:42:59,838 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 1.6521739130434783) internal successors, (38), 22 states have internal predecessors, (38), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:42:59,838 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 63 states and 67 transitions. [2022-04-28 03:42:59,898 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 67 edges. 67 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 03:42:59,898 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 67 transitions. [2022-04-28 03:42:59,898 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2022-04-28 03:42:59,898 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 03:42:59,899 INFO L195 NwaCegarLoop]: trace histogram [13, 12, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 03:42:59,916 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2022-04-28 03:43:00,107 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2022-04-28 03:43:00,108 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 03:43:00,108 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 03:43:00,108 INFO L85 PathProgramCache]: Analyzing trace with hash -2144480746, now seen corresponding path program 9 times [2022-04-28 03:43:00,108 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 03:43:00,108 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1637451110] [2022-04-28 03:43:00,202 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 1 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 03:43:04,325 WARN L977 rdanLoopAcceleration]: Unable to prove correctness of quantifier elimination. [2022-04-28 03:43:04,423 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={1=1, 2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 03:43:04,424 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-28 03:43:04,426 INFO L85 PathProgramCache]: Analyzing trace with hash -246300319, now seen corresponding path program 1 times [2022-04-28 03:43:04,427 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 03:43:04,427 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1257085434] [2022-04-28 03:43:04,427 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:43:04,427 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 03:43:04,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:43:04,605 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 03:43:04,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:43:04,616 INFO L290 TraceCheckUtils]: 0: Hoare triple {4262#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(17, 2);call #Ultimate.allocInit(12, 3); {4247#true} is VALID [2022-04-28 03:43:04,617 INFO L290 TraceCheckUtils]: 1: Hoare triple {4247#true} assume true; {4247#true} is VALID [2022-04-28 03:43:04,617 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {4247#true} {4247#true} #52#return; {4247#true} is VALID [2022-04-28 03:43:04,619 INFO L272 TraceCheckUtils]: 0: Hoare triple {4247#true} call ULTIMATE.init(); {4262#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 03:43:04,619 INFO L290 TraceCheckUtils]: 1: Hoare triple {4262#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(17, 2);call #Ultimate.allocInit(12, 3); {4247#true} is VALID [2022-04-28 03:43:04,619 INFO L290 TraceCheckUtils]: 2: Hoare triple {4247#true} assume true; {4247#true} is VALID [2022-04-28 03:43:04,619 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {4247#true} {4247#true} #52#return; {4247#true} is VALID [2022-04-28 03:43:04,619 INFO L272 TraceCheckUtils]: 4: Hoare triple {4247#true} call #t~ret9 := main(); {4247#true} is VALID [2022-04-28 03:43:04,620 INFO L290 TraceCheckUtils]: 5: Hoare triple {4247#true} ~x~0 := 0;~y~0 := 50000;~z~0 := 0;~x~0 := 0; {4252#(and (= main_~z~0 0) (= main_~x~0 0) (<= 50000 main_~y~0))} is VALID [2022-04-28 03:43:04,621 INFO L290 TraceCheckUtils]: 6: Hoare triple {4252#(and (= main_~z~0 0) (= main_~x~0 0) (<= 50000 main_~y~0))} [92] L11-2-->L18-1_primed: Formula: (let ((.cse0 (= v_main_~x~0_236 v_main_~x~0_235)) (.cse1 (= |v_main_#t~post4_59| |v_main_#t~post4_58|))) (or (and .cse0 .cse1) (and .cse0 .cse1 (<= 50000 v_main_~x~0_236)) (and (< v_main_~x~0_235 50001) (< v_main_~x~0_236 v_main_~x~0_235)))) InVars {main_~x~0=v_main_~x~0_236, main_#t~post4=|v_main_#t~post4_59|} OutVars{main_~x~0=v_main_~x~0_235, main_#t~post4=|v_main_#t~post4_58|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {4253#(and (<= main_~x~0 999999) (= main_~z~0 0) (<= 50000 main_~y~0))} is VALID [2022-04-28 03:43:04,621 INFO L290 TraceCheckUtils]: 7: Hoare triple {4253#(and (<= main_~x~0 999999) (= main_~z~0 0) (<= 50000 main_~y~0))} [93] L18-1_primed-->L11-2: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {4253#(and (<= main_~x~0 999999) (= main_~z~0 0) (<= 50000 main_~y~0))} is VALID [2022-04-28 03:43:04,622 INFO L290 TraceCheckUtils]: 8: Hoare triple {4253#(and (<= main_~x~0 999999) (= main_~z~0 0) (<= 50000 main_~y~0))} [94] L11-2-->L18-1_primed: Formula: (let ((.cse0 (<= 50000 v_main_~x~0_238)) (.cse2 (= |v_main_#t~post6_60| |v_main_#t~post6_59|)) (.cse3 (= v_main_~y~0_181 v_main_~y~0_180)) (.cse4 (= v_main_~x~0_238 v_main_~x~0_237))) (or (let ((.cse1 (+ v_main_~x~0_238 v_main_~y~0_180))) (and (< v_main_~y~0_181 v_main_~y~0_180) .cse0 (< .cse1 (+ v_main_~y~0_181 1000001)) (= .cse1 (+ v_main_~x~0_237 v_main_~y~0_181)))) (and .cse2 .cse3 (or (not (< v_main_~x~0_238 1000000)) (not .cse0)) (= |v_main_#t~post5_59| |v_main_#t~post5_60|) .cse4) (and (= |v_main_#t~post5_60| |v_main_#t~post5_59|) .cse2 .cse3 .cse4))) InVars {main_~y~0=v_main_~y~0_181, main_#t~post5=|v_main_#t~post5_60|, main_~x~0=v_main_~x~0_238, main_#t~post6=|v_main_#t~post6_60|} OutVars{main_~y~0=v_main_~y~0_180, main_#t~post5=|v_main_#t~post5_59|, main_~x~0=v_main_~x~0_237, main_#t~post6=|v_main_#t~post6_59|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {4254#(or (<= main_~x~0 999999) (and (= main_~z~0 0) (<= 50001 main_~y~0)))} is VALID [2022-04-28 03:43:04,623 INFO L290 TraceCheckUtils]: 9: Hoare triple {4254#(or (<= main_~x~0 999999) (and (= main_~z~0 0) (<= 50001 main_~y~0)))} [91] L18-1_primed-->L18-1: Formula: (not (< v_main_~x~0_11 1000000)) InVars {main_~x~0=v_main_~x~0_11} OutVars{main_~x~0=v_main_~x~0_11} AuxVars[] AssignedVars[] {4255#(and (= main_~z~0 0) (<= 50001 main_~y~0))} is VALID [2022-04-28 03:43:04,623 INFO L290 TraceCheckUtils]: 10: Hoare triple {4255#(and (= main_~z~0 0) (<= 50001 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {4256#(and (= main_~z~0 0) (<= 50000 main_~y~0))} is VALID [2022-04-28 03:43:04,624 INFO L290 TraceCheckUtils]: 11: Hoare triple {4256#(and (= main_~z~0 0) (<= 50000 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {4257#(and (= main_~z~0 0) (<= 49999 main_~y~0))} is VALID [2022-04-28 03:43:04,624 INFO L290 TraceCheckUtils]: 12: Hoare triple {4257#(and (= main_~z~0 0) (<= 49999 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {4258#(and (<= 49998 main_~y~0) (= main_~z~0 0))} is VALID [2022-04-28 03:43:04,625 INFO L290 TraceCheckUtils]: 13: Hoare triple {4258#(and (<= 49998 main_~y~0) (= main_~z~0 0))} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {4259#(and (= main_~z~0 0) (<= 49997 main_~y~0))} is VALID [2022-04-28 03:43:04,626 INFO L290 TraceCheckUtils]: 14: Hoare triple {4259#(and (= main_~z~0 0) (<= 49997 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {4260#(and (= main_~z~0 0) (<= 49996 main_~y~0))} is VALID [2022-04-28 03:43:04,626 INFO L290 TraceCheckUtils]: 15: Hoare triple {4260#(and (= main_~z~0 0) (<= 49996 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {4261#(and (= main_~z~0 0) (<= 49995 main_~y~0))} is VALID [2022-04-28 03:43:04,627 INFO L290 TraceCheckUtils]: 16: Hoare triple {4261#(and (= main_~z~0 0) (<= 49995 main_~y~0))} assume !(~y~0 > ~z~0); {4248#false} is VALID [2022-04-28 03:43:04,627 INFO L272 TraceCheckUtils]: 17: Hoare triple {4248#false} call __VERIFIER_assert((if ~x~0 == ~z~0 then 1 else 0)); {4248#false} is VALID [2022-04-28 03:43:04,627 INFO L290 TraceCheckUtils]: 18: Hoare triple {4248#false} ~cond := #in~cond; {4248#false} is VALID [2022-04-28 03:43:04,627 INFO L290 TraceCheckUtils]: 19: Hoare triple {4248#false} assume 0 == ~cond; {4248#false} is VALID [2022-04-28 03:43:04,627 INFO L290 TraceCheckUtils]: 20: Hoare triple {4248#false} assume !false; {4248#false} is VALID [2022-04-28 03:43:04,627 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 0 proven. 23 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 03:43:04,627 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 03:43:04,628 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1257085434] [2022-04-28 03:43:04,628 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1257085434] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 03:43:04,628 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2052188718] [2022-04-28 03:43:04,628 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:43:04,628 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 03:43:04,628 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 03:43:04,632 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 03:43:04,633 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2022-04-28 03:43:04,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:43:04,666 INFO L263 TraceCheckSpWp]: Trace formula consists of 89 conjuncts, 10 conjunts are in the unsatisfiable core [2022-04-28 03:43:04,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:43:04,676 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 03:43:05,041 INFO L272 TraceCheckUtils]: 0: Hoare triple {4247#true} call ULTIMATE.init(); {4247#true} is VALID [2022-04-28 03:43:05,041 INFO L290 TraceCheckUtils]: 1: Hoare triple {4247#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(17, 2);call #Ultimate.allocInit(12, 3); {4247#true} is VALID [2022-04-28 03:43:05,041 INFO L290 TraceCheckUtils]: 2: Hoare triple {4247#true} assume true; {4247#true} is VALID [2022-04-28 03:43:05,041 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {4247#true} {4247#true} #52#return; {4247#true} is VALID [2022-04-28 03:43:05,041 INFO L272 TraceCheckUtils]: 4: Hoare triple {4247#true} call #t~ret9 := main(); {4247#true} is VALID [2022-04-28 03:43:05,041 INFO L290 TraceCheckUtils]: 5: Hoare triple {4247#true} ~x~0 := 0;~y~0 := 50000;~z~0 := 0;~x~0 := 0; {4281#(and (<= main_~z~0 0) (<= 50000 main_~y~0))} is VALID [2022-04-28 03:43:05,042 INFO L290 TraceCheckUtils]: 6: Hoare triple {4281#(and (<= main_~z~0 0) (<= 50000 main_~y~0))} [92] L11-2-->L18-1_primed: Formula: (let ((.cse0 (= v_main_~x~0_236 v_main_~x~0_235)) (.cse1 (= |v_main_#t~post4_59| |v_main_#t~post4_58|))) (or (and .cse0 .cse1) (and .cse0 .cse1 (<= 50000 v_main_~x~0_236)) (and (< v_main_~x~0_235 50001) (< v_main_~x~0_236 v_main_~x~0_235)))) InVars {main_~x~0=v_main_~x~0_236, main_#t~post4=|v_main_#t~post4_59|} OutVars{main_~x~0=v_main_~x~0_235, main_#t~post4=|v_main_#t~post4_58|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {4281#(and (<= main_~z~0 0) (<= 50000 main_~y~0))} is VALID [2022-04-28 03:43:05,043 INFO L290 TraceCheckUtils]: 7: Hoare triple {4281#(and (<= main_~z~0 0) (<= 50000 main_~y~0))} [93] L18-1_primed-->L11-2: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {4281#(and (<= main_~z~0 0) (<= 50000 main_~y~0))} is VALID [2022-04-28 03:43:05,044 INFO L290 TraceCheckUtils]: 8: Hoare triple {4281#(and (<= main_~z~0 0) (<= 50000 main_~y~0))} [94] L11-2-->L18-1_primed: Formula: (let ((.cse0 (<= 50000 v_main_~x~0_238)) (.cse2 (= |v_main_#t~post6_60| |v_main_#t~post6_59|)) (.cse3 (= v_main_~y~0_181 v_main_~y~0_180)) (.cse4 (= v_main_~x~0_238 v_main_~x~0_237))) (or (let ((.cse1 (+ v_main_~x~0_238 v_main_~y~0_180))) (and (< v_main_~y~0_181 v_main_~y~0_180) .cse0 (< .cse1 (+ v_main_~y~0_181 1000001)) (= .cse1 (+ v_main_~x~0_237 v_main_~y~0_181)))) (and .cse2 .cse3 (or (not (< v_main_~x~0_238 1000000)) (not .cse0)) (= |v_main_#t~post5_59| |v_main_#t~post5_60|) .cse4) (and (= |v_main_#t~post5_60| |v_main_#t~post5_59|) .cse2 .cse3 .cse4))) InVars {main_~y~0=v_main_~y~0_181, main_#t~post5=|v_main_#t~post5_60|, main_~x~0=v_main_~x~0_238, main_#t~post6=|v_main_#t~post6_60|} OutVars{main_~y~0=v_main_~y~0_180, main_#t~post5=|v_main_#t~post5_59|, main_~x~0=v_main_~x~0_237, main_#t~post6=|v_main_#t~post6_59|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {4281#(and (<= main_~z~0 0) (<= 50000 main_~y~0))} is VALID [2022-04-28 03:43:05,044 INFO L290 TraceCheckUtils]: 9: Hoare triple {4281#(and (<= main_~z~0 0) (<= 50000 main_~y~0))} [91] L18-1_primed-->L18-1: Formula: (not (< v_main_~x~0_11 1000000)) InVars {main_~x~0=v_main_~x~0_11} OutVars{main_~x~0=v_main_~x~0_11} AuxVars[] AssignedVars[] {4281#(and (<= main_~z~0 0) (<= 50000 main_~y~0))} is VALID [2022-04-28 03:43:05,045 INFO L290 TraceCheckUtils]: 10: Hoare triple {4281#(and (<= main_~z~0 0) (<= 50000 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {4297#(and (<= main_~z~0 0) (<= 49999 main_~y~0))} is VALID [2022-04-28 03:43:05,045 INFO L290 TraceCheckUtils]: 11: Hoare triple {4297#(and (<= main_~z~0 0) (<= 49999 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {4301#(and (<= main_~z~0 0) (<= 49998 main_~y~0))} is VALID [2022-04-28 03:43:05,046 INFO L290 TraceCheckUtils]: 12: Hoare triple {4301#(and (<= main_~z~0 0) (<= 49998 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {4305#(and (<= main_~z~0 0) (<= 49997 main_~y~0))} is VALID [2022-04-28 03:43:05,046 INFO L290 TraceCheckUtils]: 13: Hoare triple {4305#(and (<= main_~z~0 0) (<= 49997 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {4309#(and (<= main_~z~0 0) (<= 49996 main_~y~0))} is VALID [2022-04-28 03:43:05,047 INFO L290 TraceCheckUtils]: 14: Hoare triple {4309#(and (<= main_~z~0 0) (<= 49996 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {4313#(and (<= main_~z~0 0) (<= 49995 main_~y~0))} is VALID [2022-04-28 03:43:05,047 INFO L290 TraceCheckUtils]: 15: Hoare triple {4313#(and (<= main_~z~0 0) (<= 49995 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {4317#(and (<= main_~z~0 0) (<= 49994 main_~y~0))} is VALID [2022-04-28 03:43:05,048 INFO L290 TraceCheckUtils]: 16: Hoare triple {4317#(and (<= main_~z~0 0) (<= 49994 main_~y~0))} assume !(~y~0 > ~z~0); {4248#false} is VALID [2022-04-28 03:43:05,048 INFO L272 TraceCheckUtils]: 17: Hoare triple {4248#false} call __VERIFIER_assert((if ~x~0 == ~z~0 then 1 else 0)); {4248#false} is VALID [2022-04-28 03:43:05,048 INFO L290 TraceCheckUtils]: 18: Hoare triple {4248#false} ~cond := #in~cond; {4248#false} is VALID [2022-04-28 03:43:05,048 INFO L290 TraceCheckUtils]: 19: Hoare triple {4248#false} assume 0 == ~cond; {4248#false} is VALID [2022-04-28 03:43:05,048 INFO L290 TraceCheckUtils]: 20: Hoare triple {4248#false} assume !false; {4248#false} is VALID [2022-04-28 03:43:05,048 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-04-28 03:43:05,048 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 03:43:05,457 INFO L290 TraceCheckUtils]: 20: Hoare triple {4248#false} assume !false; {4248#false} is VALID [2022-04-28 03:43:05,457 INFO L290 TraceCheckUtils]: 19: Hoare triple {4248#false} assume 0 == ~cond; {4248#false} is VALID [2022-04-28 03:43:05,457 INFO L290 TraceCheckUtils]: 18: Hoare triple {4248#false} ~cond := #in~cond; {4248#false} is VALID [2022-04-28 03:43:05,457 INFO L272 TraceCheckUtils]: 17: Hoare triple {4248#false} call __VERIFIER_assert((if ~x~0 == ~z~0 then 1 else 0)); {4248#false} is VALID [2022-04-28 03:43:05,457 INFO L290 TraceCheckUtils]: 16: Hoare triple {4345#(< main_~z~0 main_~y~0)} assume !(~y~0 > ~z~0); {4248#false} is VALID [2022-04-28 03:43:05,458 INFO L290 TraceCheckUtils]: 15: Hoare triple {4349#(< (+ main_~z~0 1) main_~y~0)} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {4345#(< main_~z~0 main_~y~0)} is VALID [2022-04-28 03:43:05,458 INFO L290 TraceCheckUtils]: 14: Hoare triple {4353#(< (+ main_~z~0 2) main_~y~0)} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {4349#(< (+ main_~z~0 1) main_~y~0)} is VALID [2022-04-28 03:43:05,459 INFO L290 TraceCheckUtils]: 13: Hoare triple {4357#(< (+ main_~z~0 3) main_~y~0)} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {4353#(< (+ main_~z~0 2) main_~y~0)} is VALID [2022-04-28 03:43:05,459 INFO L290 TraceCheckUtils]: 12: Hoare triple {4361#(< (+ main_~z~0 4) main_~y~0)} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {4357#(< (+ main_~z~0 3) main_~y~0)} is VALID [2022-04-28 03:43:05,460 INFO L290 TraceCheckUtils]: 11: Hoare triple {4365#(< (+ 5 main_~z~0) main_~y~0)} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {4361#(< (+ main_~z~0 4) main_~y~0)} is VALID [2022-04-28 03:43:05,460 INFO L290 TraceCheckUtils]: 10: Hoare triple {4369#(< (+ main_~z~0 6) main_~y~0)} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {4365#(< (+ 5 main_~z~0) main_~y~0)} is VALID [2022-04-28 03:43:05,461 INFO L290 TraceCheckUtils]: 9: Hoare triple {4369#(< (+ main_~z~0 6) main_~y~0)} [91] L18-1_primed-->L18-1: Formula: (not (< v_main_~x~0_11 1000000)) InVars {main_~x~0=v_main_~x~0_11} OutVars{main_~x~0=v_main_~x~0_11} AuxVars[] AssignedVars[] {4369#(< (+ main_~z~0 6) main_~y~0)} is VALID [2022-04-28 03:43:05,462 INFO L290 TraceCheckUtils]: 8: Hoare triple {4369#(< (+ main_~z~0 6) main_~y~0)} [94] L11-2-->L18-1_primed: Formula: (let ((.cse0 (<= 50000 v_main_~x~0_238)) (.cse2 (= |v_main_#t~post6_60| |v_main_#t~post6_59|)) (.cse3 (= v_main_~y~0_181 v_main_~y~0_180)) (.cse4 (= v_main_~x~0_238 v_main_~x~0_237))) (or (let ((.cse1 (+ v_main_~x~0_238 v_main_~y~0_180))) (and (< v_main_~y~0_181 v_main_~y~0_180) .cse0 (< .cse1 (+ v_main_~y~0_181 1000001)) (= .cse1 (+ v_main_~x~0_237 v_main_~y~0_181)))) (and .cse2 .cse3 (or (not (< v_main_~x~0_238 1000000)) (not .cse0)) (= |v_main_#t~post5_59| |v_main_#t~post5_60|) .cse4) (and (= |v_main_#t~post5_60| |v_main_#t~post5_59|) .cse2 .cse3 .cse4))) InVars {main_~y~0=v_main_~y~0_181, main_#t~post5=|v_main_#t~post5_60|, main_~x~0=v_main_~x~0_238, main_#t~post6=|v_main_#t~post6_60|} OutVars{main_~y~0=v_main_~y~0_180, main_#t~post5=|v_main_#t~post5_59|, main_~x~0=v_main_~x~0_237, main_#t~post6=|v_main_#t~post6_59|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {4369#(< (+ main_~z~0 6) main_~y~0)} is VALID [2022-04-28 03:43:05,462 INFO L290 TraceCheckUtils]: 7: Hoare triple {4369#(< (+ main_~z~0 6) main_~y~0)} [93] L18-1_primed-->L11-2: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {4369#(< (+ main_~z~0 6) main_~y~0)} is VALID [2022-04-28 03:43:05,462 INFO L290 TraceCheckUtils]: 6: Hoare triple {4369#(< (+ main_~z~0 6) main_~y~0)} [92] L11-2-->L18-1_primed: Formula: (let ((.cse0 (= v_main_~x~0_236 v_main_~x~0_235)) (.cse1 (= |v_main_#t~post4_59| |v_main_#t~post4_58|))) (or (and .cse0 .cse1) (and .cse0 .cse1 (<= 50000 v_main_~x~0_236)) (and (< v_main_~x~0_235 50001) (< v_main_~x~0_236 v_main_~x~0_235)))) InVars {main_~x~0=v_main_~x~0_236, main_#t~post4=|v_main_#t~post4_59|} OutVars{main_~x~0=v_main_~x~0_235, main_#t~post4=|v_main_#t~post4_58|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {4369#(< (+ main_~z~0 6) main_~y~0)} is VALID [2022-04-28 03:43:05,463 INFO L290 TraceCheckUtils]: 5: Hoare triple {4247#true} ~x~0 := 0;~y~0 := 50000;~z~0 := 0;~x~0 := 0; {4369#(< (+ main_~z~0 6) main_~y~0)} is VALID [2022-04-28 03:43:05,463 INFO L272 TraceCheckUtils]: 4: Hoare triple {4247#true} call #t~ret9 := main(); {4247#true} is VALID [2022-04-28 03:43:05,463 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {4247#true} {4247#true} #52#return; {4247#true} is VALID [2022-04-28 03:43:05,463 INFO L290 TraceCheckUtils]: 2: Hoare triple {4247#true} assume true; {4247#true} is VALID [2022-04-28 03:43:05,463 INFO L290 TraceCheckUtils]: 1: Hoare triple {4247#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(17, 2);call #Ultimate.allocInit(12, 3); {4247#true} is VALID [2022-04-28 03:43:05,463 INFO L272 TraceCheckUtils]: 0: Hoare triple {4247#true} call ULTIMATE.init(); {4247#true} is VALID [2022-04-28 03:43:05,463 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-04-28 03:43:05,463 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2052188718] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 03:43:05,463 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 03:43:05,463 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 9, 9] total 27 [2022-04-28 03:43:05,906 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 03:43:05,907 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1637451110] [2022-04-28 03:43:05,907 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1637451110] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 03:43:05,907 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 03:43:05,907 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [24] imperfect sequences [] total 24 [2022-04-28 03:43:05,907 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [124959221] [2022-04-28 03:43:05,907 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 03:43:05,908 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 24 states have (on average 1.6666666666666667) internal successors, (40), 23 states have internal predecessors, (40), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 44 [2022-04-28 03:43:05,908 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 03:43:05,908 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 24 states, 24 states have (on average 1.6666666666666667) internal successors, (40), 23 states have internal predecessors, (40), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:43:05,952 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 44 edges. 44 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 03:43:05,953 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2022-04-28 03:43:05,953 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 03:43:05,953 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2022-04-28 03:43:05,953 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=640, Invalid=1000, Unknown=0, NotChecked=0, Total=1640 [2022-04-28 03:43:05,954 INFO L87 Difference]: Start difference. First operand 63 states and 67 transitions. Second operand has 24 states, 24 states have (on average 1.6666666666666667) internal successors, (40), 23 states have internal predecessors, (40), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:43:07,159 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:43:07,159 INFO L93 Difference]: Finished difference Result 97 states and 107 transitions. [2022-04-28 03:43:07,159 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2022-04-28 03:43:07,159 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 24 states have (on average 1.6666666666666667) internal successors, (40), 23 states have internal predecessors, (40), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 44 [2022-04-28 03:43:07,160 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 03:43:07,160 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24 states, 24 states have (on average 1.6666666666666667) internal successors, (40), 23 states have internal predecessors, (40), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:43:07,161 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 65 transitions. [2022-04-28 03:43:07,161 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24 states, 24 states have (on average 1.6666666666666667) internal successors, (40), 23 states have internal predecessors, (40), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:43:07,162 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 65 transitions. [2022-04-28 03:43:07,162 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 24 states and 65 transitions. [2022-04-28 03:43:07,220 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 65 edges. 65 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 03:43:07,221 INFO L225 Difference]: With dead ends: 97 [2022-04-28 03:43:07,221 INFO L226 Difference]: Without dead ends: 66 [2022-04-28 03:43:07,222 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 108 GetRequests, 46 SyntacticMatches, 2 SemanticMatches, 60 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1064 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=1268, Invalid=2514, Unknown=0, NotChecked=0, Total=3782 [2022-04-28 03:43:07,222 INFO L413 NwaCegarLoop]: 13 mSDtfsCounter, 39 mSDsluCounter, 27 mSDsCounter, 0 mSdLazyCounter, 404 mSolverCounterSat, 43 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 39 SdHoareTripleChecker+Valid, 40 SdHoareTripleChecker+Invalid, 447 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 43 IncrementalHoareTripleChecker+Valid, 404 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-04-28 03:43:07,223 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [39 Valid, 40 Invalid, 447 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [43 Valid, 404 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-04-28 03:43:07,223 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2022-04-28 03:43:07,344 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 66. [2022-04-28 03:43:07,344 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 03:43:07,345 INFO L82 GeneralOperation]: Start isEquivalent. First operand 66 states. Second operand has 66 states, 61 states have (on average 1.0819672131147542) internal successors, (66), 61 states have internal predecessors, (66), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:43:07,345 INFO L74 IsIncluded]: Start isIncluded. First operand 66 states. Second operand has 66 states, 61 states have (on average 1.0819672131147542) internal successors, (66), 61 states have internal predecessors, (66), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:43:07,345 INFO L87 Difference]: Start difference. First operand 66 states. Second operand has 66 states, 61 states have (on average 1.0819672131147542) internal successors, (66), 61 states have internal predecessors, (66), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:43:07,346 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:43:07,346 INFO L93 Difference]: Finished difference Result 66 states and 70 transitions. [2022-04-28 03:43:07,346 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 70 transitions. [2022-04-28 03:43:07,346 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:43:07,346 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:43:07,346 INFO L74 IsIncluded]: Start isIncluded. First operand has 66 states, 61 states have (on average 1.0819672131147542) internal successors, (66), 61 states have internal predecessors, (66), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 66 states. [2022-04-28 03:43:07,346 INFO L87 Difference]: Start difference. First operand has 66 states, 61 states have (on average 1.0819672131147542) internal successors, (66), 61 states have internal predecessors, (66), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 66 states. [2022-04-28 03:43:07,347 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:43:07,347 INFO L93 Difference]: Finished difference Result 66 states and 70 transitions. [2022-04-28 03:43:07,347 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 70 transitions. [2022-04-28 03:43:07,347 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:43:07,347 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:43:07,347 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 03:43:07,347 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 03:43:07,348 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 66 states, 61 states have (on average 1.0819672131147542) internal successors, (66), 61 states have internal predecessors, (66), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:43:07,348 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 70 transitions. [2022-04-28 03:43:07,348 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 70 transitions. Word has length 44 [2022-04-28 03:43:07,349 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 03:43:07,349 INFO L495 AbstractCegarLoop]: Abstraction has 66 states and 70 transitions. [2022-04-28 03:43:07,349 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 24 states have (on average 1.6666666666666667) internal successors, (40), 23 states have internal predecessors, (40), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:43:07,349 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 66 states and 70 transitions. [2022-04-28 03:43:07,420 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 70 edges. 70 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 03:43:07,420 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 70 transitions. [2022-04-28 03:43:07,420 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2022-04-28 03:43:07,420 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 03:43:07,420 INFO L195 NwaCegarLoop]: trace histogram [14, 13, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 03:43:07,436 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2022-04-28 03:43:07,621 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 03:43:07,621 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 03:43:07,621 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 03:43:07,621 INFO L85 PathProgramCache]: Analyzing trace with hash -181520728, now seen corresponding path program 10 times [2022-04-28 03:43:07,621 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 03:43:07,621 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [805811318] [2022-04-28 03:43:07,714 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 1 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 03:43:07,943 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={1=1, 2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 03:43:07,944 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-28 03:43:07,946 INFO L85 PathProgramCache]: Analyzing trace with hash 1782386466, now seen corresponding path program 1 times [2022-04-28 03:43:07,946 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 03:43:07,948 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1398293680] [2022-04-28 03:43:07,948 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:43:07,948 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 03:43:07,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:43:08,130 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 03:43:08,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:43:08,137 INFO L290 TraceCheckUtils]: 0: Hoare triple {4932#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(17, 2);call #Ultimate.allocInit(12, 3); {4916#true} is VALID [2022-04-28 03:43:08,137 INFO L290 TraceCheckUtils]: 1: Hoare triple {4916#true} assume true; {4916#true} is VALID [2022-04-28 03:43:08,137 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {4916#true} {4916#true} #52#return; {4916#true} is VALID [2022-04-28 03:43:08,137 INFO L272 TraceCheckUtils]: 0: Hoare triple {4916#true} call ULTIMATE.init(); {4932#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 03:43:08,137 INFO L290 TraceCheckUtils]: 1: Hoare triple {4932#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(17, 2);call #Ultimate.allocInit(12, 3); {4916#true} is VALID [2022-04-28 03:43:08,138 INFO L290 TraceCheckUtils]: 2: Hoare triple {4916#true} assume true; {4916#true} is VALID [2022-04-28 03:43:08,138 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {4916#true} {4916#true} #52#return; {4916#true} is VALID [2022-04-28 03:43:08,138 INFO L272 TraceCheckUtils]: 4: Hoare triple {4916#true} call #t~ret9 := main(); {4916#true} is VALID [2022-04-28 03:43:08,138 INFO L290 TraceCheckUtils]: 5: Hoare triple {4916#true} ~x~0 := 0;~y~0 := 50000;~z~0 := 0;~x~0 := 0; {4921#(and (= main_~z~0 0) (= main_~x~0 0) (<= 50000 main_~y~0))} is VALID [2022-04-28 03:43:08,139 INFO L290 TraceCheckUtils]: 6: Hoare triple {4921#(and (= main_~z~0 0) (= main_~x~0 0) (<= 50000 main_~y~0))} [96] L11-2-->L18-1_primed: Formula: (let ((.cse0 (= v_main_~x~0_271 v_main_~x~0_270)) (.cse1 (= |v_main_#t~post4_65| |v_main_#t~post4_64|))) (or (and (< v_main_~x~0_271 v_main_~x~0_270) (< v_main_~x~0_270 50001)) (and .cse0 .cse1 (<= 50000 v_main_~x~0_271)) (and .cse0 .cse1))) InVars {main_~x~0=v_main_~x~0_271, main_#t~post4=|v_main_#t~post4_65|} OutVars{main_~x~0=v_main_~x~0_270, main_#t~post4=|v_main_#t~post4_64|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {4922#(or (<= main_~x~0 0) (and (= main_~z~0 0) (<= main_~x~0 main_~y~0) (<= main_~x~0 50000)))} is VALID [2022-04-28 03:43:08,139 INFO L290 TraceCheckUtils]: 7: Hoare triple {4922#(or (<= main_~x~0 0) (and (= main_~z~0 0) (<= main_~x~0 main_~y~0) (<= main_~x~0 50000)))} [97] L18-1_primed-->L11-2: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {4922#(or (<= main_~x~0 0) (and (= main_~z~0 0) (<= main_~x~0 main_~y~0) (<= main_~x~0 50000)))} is VALID [2022-04-28 03:43:08,140 INFO L290 TraceCheckUtils]: 8: Hoare triple {4922#(or (<= main_~x~0 0) (and (= main_~z~0 0) (<= main_~x~0 main_~y~0) (<= main_~x~0 50000)))} [98] L11-2-->L18-1_primed: Formula: (let ((.cse0 (= v_main_~x~0_273 v_main_~x~0_272)) (.cse1 (= v_main_~y~0_214 v_main_~y~0_213)) (.cse2 (= |v_main_#t~post6_67| |v_main_#t~post6_66|)) (.cse3 (= |v_main_#t~post5_67| |v_main_#t~post5_66|)) (.cse4 (<= 50000 v_main_~x~0_273))) (or (and .cse0 .cse1 .cse2 .cse3) (and .cse0 .cse1 (or (not (< v_main_~x~0_273 1000000)) (not .cse4)) .cse2 .cse3) (and (< v_main_~x~0_272 1000001) .cse4 (< v_main_~x~0_273 v_main_~x~0_272) (= (+ v_main_~x~0_273 v_main_~y~0_213) (+ v_main_~x~0_272 v_main_~y~0_214))))) InVars {main_~y~0=v_main_~y~0_214, main_#t~post5=|v_main_#t~post5_67|, main_~x~0=v_main_~x~0_273, main_#t~post6=|v_main_#t~post6_67|} OutVars{main_~y~0=v_main_~y~0_213, main_#t~post5=|v_main_#t~post5_66|, main_~x~0=v_main_~x~0_272, main_#t~post6=|v_main_#t~post6_66|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {4923#(or (and (= main_~z~0 0) (<= main_~x~0 main_~y~0)) (<= main_~x~0 50000))} is VALID [2022-04-28 03:43:08,140 INFO L290 TraceCheckUtils]: 9: Hoare triple {4923#(or (and (= main_~z~0 0) (<= main_~x~0 main_~y~0)) (<= main_~x~0 50000))} [95] L18-1_primed-->L18-1: Formula: (not (< v_main_~x~0_11 1000000)) InVars {main_~x~0=v_main_~x~0_11} OutVars{main_~x~0=v_main_~x~0_11} AuxVars[] AssignedVars[] {4924#(and (= main_~z~0 0) (<= 1000000 main_~y~0))} is VALID [2022-04-28 03:43:08,141 INFO L290 TraceCheckUtils]: 10: Hoare triple {4924#(and (= main_~z~0 0) (<= 1000000 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {4925#(and (= main_~z~0 0) (<= 999999 main_~y~0))} is VALID [2022-04-28 03:43:08,141 INFO L290 TraceCheckUtils]: 11: Hoare triple {4925#(and (= main_~z~0 0) (<= 999999 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {4926#(and (= main_~z~0 0) (<= 999998 main_~y~0))} is VALID [2022-04-28 03:43:08,142 INFO L290 TraceCheckUtils]: 12: Hoare triple {4926#(and (= main_~z~0 0) (<= 999998 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {4927#(and (= main_~z~0 0) (<= 999997 main_~y~0))} is VALID [2022-04-28 03:43:08,142 INFO L290 TraceCheckUtils]: 13: Hoare triple {4927#(and (= main_~z~0 0) (<= 999997 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {4928#(and (<= 999996 main_~y~0) (= main_~z~0 0))} is VALID [2022-04-28 03:43:08,143 INFO L290 TraceCheckUtils]: 14: Hoare triple {4928#(and (<= 999996 main_~y~0) (= main_~z~0 0))} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {4929#(and (= main_~z~0 0) (<= 999995 main_~y~0))} is VALID [2022-04-28 03:43:08,143 INFO L290 TraceCheckUtils]: 15: Hoare triple {4929#(and (= main_~z~0 0) (<= 999995 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {4930#(and (= main_~z~0 0) (<= 999994 main_~y~0))} is VALID [2022-04-28 03:43:08,144 INFO L290 TraceCheckUtils]: 16: Hoare triple {4930#(and (= main_~z~0 0) (<= 999994 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {4931#(and (= main_~z~0 0) (<= 999993 main_~y~0))} is VALID [2022-04-28 03:43:08,144 INFO L290 TraceCheckUtils]: 17: Hoare triple {4931#(and (= main_~z~0 0) (<= 999993 main_~y~0))} assume !(~y~0 > ~z~0); {4917#false} is VALID [2022-04-28 03:43:08,144 INFO L272 TraceCheckUtils]: 18: Hoare triple {4917#false} call __VERIFIER_assert((if ~x~0 == ~z~0 then 1 else 0)); {4917#false} is VALID [2022-04-28 03:43:08,144 INFO L290 TraceCheckUtils]: 19: Hoare triple {4917#false} ~cond := #in~cond; {4917#false} is VALID [2022-04-28 03:43:08,144 INFO L290 TraceCheckUtils]: 20: Hoare triple {4917#false} assume 0 == ~cond; {4917#false} is VALID [2022-04-28 03:43:08,144 INFO L290 TraceCheckUtils]: 21: Hoare triple {4917#false} assume !false; {4917#false} is VALID [2022-04-28 03:43:08,145 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 30 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 03:43:08,145 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 03:43:08,145 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1398293680] [2022-04-28 03:43:08,145 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1398293680] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 03:43:08,145 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1219740981] [2022-04-28 03:43:08,145 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:43:08,145 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 03:43:08,145 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 03:43:08,146 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 03:43:08,147 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2022-04-28 03:43:08,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:43:08,178 INFO L263 TraceCheckSpWp]: Trace formula consists of 94 conjuncts, 11 conjunts are in the unsatisfiable core [2022-04-28 03:43:08,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:43:08,187 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 03:43:08,596 INFO L272 TraceCheckUtils]: 0: Hoare triple {4916#true} call ULTIMATE.init(); {4916#true} is VALID [2022-04-28 03:43:08,596 INFO L290 TraceCheckUtils]: 1: Hoare triple {4916#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(17, 2);call #Ultimate.allocInit(12, 3); {4916#true} is VALID [2022-04-28 03:43:08,596 INFO L290 TraceCheckUtils]: 2: Hoare triple {4916#true} assume true; {4916#true} is VALID [2022-04-28 03:43:08,596 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {4916#true} {4916#true} #52#return; {4916#true} is VALID [2022-04-28 03:43:08,596 INFO L272 TraceCheckUtils]: 4: Hoare triple {4916#true} call #t~ret9 := main(); {4916#true} is VALID [2022-04-28 03:43:08,597 INFO L290 TraceCheckUtils]: 5: Hoare triple {4916#true} ~x~0 := 0;~y~0 := 50000;~z~0 := 0;~x~0 := 0; {4951#(and (<= main_~z~0 0) (<= 50000 main_~y~0))} is VALID [2022-04-28 03:43:08,597 INFO L290 TraceCheckUtils]: 6: Hoare triple {4951#(and (<= main_~z~0 0) (<= 50000 main_~y~0))} [96] L11-2-->L18-1_primed: Formula: (let ((.cse0 (= v_main_~x~0_271 v_main_~x~0_270)) (.cse1 (= |v_main_#t~post4_65| |v_main_#t~post4_64|))) (or (and (< v_main_~x~0_271 v_main_~x~0_270) (< v_main_~x~0_270 50001)) (and .cse0 .cse1 (<= 50000 v_main_~x~0_271)) (and .cse0 .cse1))) InVars {main_~x~0=v_main_~x~0_271, main_#t~post4=|v_main_#t~post4_65|} OutVars{main_~x~0=v_main_~x~0_270, main_#t~post4=|v_main_#t~post4_64|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {4951#(and (<= main_~z~0 0) (<= 50000 main_~y~0))} is VALID [2022-04-28 03:43:08,597 INFO L290 TraceCheckUtils]: 7: Hoare triple {4951#(and (<= main_~z~0 0) (<= 50000 main_~y~0))} [97] L18-1_primed-->L11-2: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {4951#(and (<= main_~z~0 0) (<= 50000 main_~y~0))} is VALID [2022-04-28 03:43:08,598 INFO L290 TraceCheckUtils]: 8: Hoare triple {4951#(and (<= main_~z~0 0) (<= 50000 main_~y~0))} [98] L11-2-->L18-1_primed: Formula: (let ((.cse0 (= v_main_~x~0_273 v_main_~x~0_272)) (.cse1 (= v_main_~y~0_214 v_main_~y~0_213)) (.cse2 (= |v_main_#t~post6_67| |v_main_#t~post6_66|)) (.cse3 (= |v_main_#t~post5_67| |v_main_#t~post5_66|)) (.cse4 (<= 50000 v_main_~x~0_273))) (or (and .cse0 .cse1 .cse2 .cse3) (and .cse0 .cse1 (or (not (< v_main_~x~0_273 1000000)) (not .cse4)) .cse2 .cse3) (and (< v_main_~x~0_272 1000001) .cse4 (< v_main_~x~0_273 v_main_~x~0_272) (= (+ v_main_~x~0_273 v_main_~y~0_213) (+ v_main_~x~0_272 v_main_~y~0_214))))) InVars {main_~y~0=v_main_~y~0_214, main_#t~post5=|v_main_#t~post5_67|, main_~x~0=v_main_~x~0_273, main_#t~post6=|v_main_#t~post6_67|} OutVars{main_~y~0=v_main_~y~0_213, main_#t~post5=|v_main_#t~post5_66|, main_~x~0=v_main_~x~0_272, main_#t~post6=|v_main_#t~post6_66|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {4951#(and (<= main_~z~0 0) (<= 50000 main_~y~0))} is VALID [2022-04-28 03:43:08,598 INFO L290 TraceCheckUtils]: 9: Hoare triple {4951#(and (<= main_~z~0 0) (<= 50000 main_~y~0))} [95] L18-1_primed-->L18-1: Formula: (not (< v_main_~x~0_11 1000000)) InVars {main_~x~0=v_main_~x~0_11} OutVars{main_~x~0=v_main_~x~0_11} AuxVars[] AssignedVars[] {4951#(and (<= main_~z~0 0) (<= 50000 main_~y~0))} is VALID [2022-04-28 03:43:08,599 INFO L290 TraceCheckUtils]: 10: Hoare triple {4951#(and (<= main_~z~0 0) (<= 50000 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {4967#(and (<= main_~z~0 0) (<= 49999 main_~y~0))} is VALID [2022-04-28 03:43:08,600 INFO L290 TraceCheckUtils]: 11: Hoare triple {4967#(and (<= main_~z~0 0) (<= 49999 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {4971#(and (<= main_~z~0 0) (<= 49998 main_~y~0))} is VALID [2022-04-28 03:43:08,600 INFO L290 TraceCheckUtils]: 12: Hoare triple {4971#(and (<= main_~z~0 0) (<= 49998 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {4975#(and (<= main_~z~0 0) (<= 49997 main_~y~0))} is VALID [2022-04-28 03:43:08,600 INFO L290 TraceCheckUtils]: 13: Hoare triple {4975#(and (<= main_~z~0 0) (<= 49997 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {4979#(and (<= main_~z~0 0) (<= 49996 main_~y~0))} is VALID [2022-04-28 03:43:08,601 INFO L290 TraceCheckUtils]: 14: Hoare triple {4979#(and (<= main_~z~0 0) (<= 49996 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {4983#(and (<= main_~z~0 0) (<= 49995 main_~y~0))} is VALID [2022-04-28 03:43:08,601 INFO L290 TraceCheckUtils]: 15: Hoare triple {4983#(and (<= main_~z~0 0) (<= 49995 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {4987#(and (<= main_~z~0 0) (<= 49994 main_~y~0))} is VALID [2022-04-28 03:43:08,602 INFO L290 TraceCheckUtils]: 16: Hoare triple {4987#(and (<= main_~z~0 0) (<= 49994 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {4991#(and (<= main_~z~0 0) (<= 49993 main_~y~0))} is VALID [2022-04-28 03:43:08,602 INFO L290 TraceCheckUtils]: 17: Hoare triple {4991#(and (<= main_~z~0 0) (<= 49993 main_~y~0))} assume !(~y~0 > ~z~0); {4917#false} is VALID [2022-04-28 03:43:08,602 INFO L272 TraceCheckUtils]: 18: Hoare triple {4917#false} call __VERIFIER_assert((if ~x~0 == ~z~0 then 1 else 0)); {4917#false} is VALID [2022-04-28 03:43:08,602 INFO L290 TraceCheckUtils]: 19: Hoare triple {4917#false} ~cond := #in~cond; {4917#false} is VALID [2022-04-28 03:43:08,603 INFO L290 TraceCheckUtils]: 20: Hoare triple {4917#false} assume 0 == ~cond; {4917#false} is VALID [2022-04-28 03:43:08,603 INFO L290 TraceCheckUtils]: 21: Hoare triple {4917#false} assume !false; {4917#false} is VALID [2022-04-28 03:43:08,603 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-04-28 03:43:08,603 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 03:43:09,094 INFO L290 TraceCheckUtils]: 21: Hoare triple {4917#false} assume !false; {4917#false} is VALID [2022-04-28 03:43:09,094 INFO L290 TraceCheckUtils]: 20: Hoare triple {4917#false} assume 0 == ~cond; {4917#false} is VALID [2022-04-28 03:43:09,094 INFO L290 TraceCheckUtils]: 19: Hoare triple {4917#false} ~cond := #in~cond; {4917#false} is VALID [2022-04-28 03:43:09,094 INFO L272 TraceCheckUtils]: 18: Hoare triple {4917#false} call __VERIFIER_assert((if ~x~0 == ~z~0 then 1 else 0)); {4917#false} is VALID [2022-04-28 03:43:09,094 INFO L290 TraceCheckUtils]: 17: Hoare triple {5019#(< main_~z~0 main_~y~0)} assume !(~y~0 > ~z~0); {4917#false} is VALID [2022-04-28 03:43:09,095 INFO L290 TraceCheckUtils]: 16: Hoare triple {5023#(< (+ main_~z~0 1) main_~y~0)} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {5019#(< main_~z~0 main_~y~0)} is VALID [2022-04-28 03:43:09,096 INFO L290 TraceCheckUtils]: 15: Hoare triple {5027#(< (+ main_~z~0 2) main_~y~0)} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {5023#(< (+ main_~z~0 1) main_~y~0)} is VALID [2022-04-28 03:43:09,096 INFO L290 TraceCheckUtils]: 14: Hoare triple {5031#(< (+ main_~z~0 3) main_~y~0)} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {5027#(< (+ main_~z~0 2) main_~y~0)} is VALID [2022-04-28 03:43:09,096 INFO L290 TraceCheckUtils]: 13: Hoare triple {5035#(< (+ main_~z~0 4) main_~y~0)} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {5031#(< (+ main_~z~0 3) main_~y~0)} is VALID [2022-04-28 03:43:09,097 INFO L290 TraceCheckUtils]: 12: Hoare triple {5039#(< (+ 5 main_~z~0) main_~y~0)} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {5035#(< (+ main_~z~0 4) main_~y~0)} is VALID [2022-04-28 03:43:09,097 INFO L290 TraceCheckUtils]: 11: Hoare triple {5043#(< (+ main_~z~0 6) main_~y~0)} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {5039#(< (+ 5 main_~z~0) main_~y~0)} is VALID [2022-04-28 03:43:09,098 INFO L290 TraceCheckUtils]: 10: Hoare triple {5047#(< (+ 7 main_~z~0) main_~y~0)} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {5043#(< (+ main_~z~0 6) main_~y~0)} is VALID [2022-04-28 03:43:09,098 INFO L290 TraceCheckUtils]: 9: Hoare triple {5047#(< (+ 7 main_~z~0) main_~y~0)} [95] L18-1_primed-->L18-1: Formula: (not (< v_main_~x~0_11 1000000)) InVars {main_~x~0=v_main_~x~0_11} OutVars{main_~x~0=v_main_~x~0_11} AuxVars[] AssignedVars[] {5047#(< (+ 7 main_~z~0) main_~y~0)} is VALID [2022-04-28 03:43:09,099 INFO L290 TraceCheckUtils]: 8: Hoare triple {5047#(< (+ 7 main_~z~0) main_~y~0)} [98] L11-2-->L18-1_primed: Formula: (let ((.cse0 (= v_main_~x~0_273 v_main_~x~0_272)) (.cse1 (= v_main_~y~0_214 v_main_~y~0_213)) (.cse2 (= |v_main_#t~post6_67| |v_main_#t~post6_66|)) (.cse3 (= |v_main_#t~post5_67| |v_main_#t~post5_66|)) (.cse4 (<= 50000 v_main_~x~0_273))) (or (and .cse0 .cse1 .cse2 .cse3) (and .cse0 .cse1 (or (not (< v_main_~x~0_273 1000000)) (not .cse4)) .cse2 .cse3) (and (< v_main_~x~0_272 1000001) .cse4 (< v_main_~x~0_273 v_main_~x~0_272) (= (+ v_main_~x~0_273 v_main_~y~0_213) (+ v_main_~x~0_272 v_main_~y~0_214))))) InVars {main_~y~0=v_main_~y~0_214, main_#t~post5=|v_main_#t~post5_67|, main_~x~0=v_main_~x~0_273, main_#t~post6=|v_main_#t~post6_67|} OutVars{main_~y~0=v_main_~y~0_213, main_#t~post5=|v_main_#t~post5_66|, main_~x~0=v_main_~x~0_272, main_#t~post6=|v_main_#t~post6_66|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {5047#(< (+ 7 main_~z~0) main_~y~0)} is VALID [2022-04-28 03:43:09,099 INFO L290 TraceCheckUtils]: 7: Hoare triple {5047#(< (+ 7 main_~z~0) main_~y~0)} [97] L18-1_primed-->L11-2: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {5047#(< (+ 7 main_~z~0) main_~y~0)} is VALID [2022-04-28 03:43:09,099 INFO L290 TraceCheckUtils]: 6: Hoare triple {5047#(< (+ 7 main_~z~0) main_~y~0)} [96] L11-2-->L18-1_primed: Formula: (let ((.cse0 (= v_main_~x~0_271 v_main_~x~0_270)) (.cse1 (= |v_main_#t~post4_65| |v_main_#t~post4_64|))) (or (and (< v_main_~x~0_271 v_main_~x~0_270) (< v_main_~x~0_270 50001)) (and .cse0 .cse1 (<= 50000 v_main_~x~0_271)) (and .cse0 .cse1))) InVars {main_~x~0=v_main_~x~0_271, main_#t~post4=|v_main_#t~post4_65|} OutVars{main_~x~0=v_main_~x~0_270, main_#t~post4=|v_main_#t~post4_64|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {5047#(< (+ 7 main_~z~0) main_~y~0)} is VALID [2022-04-28 03:43:09,100 INFO L290 TraceCheckUtils]: 5: Hoare triple {4916#true} ~x~0 := 0;~y~0 := 50000;~z~0 := 0;~x~0 := 0; {5047#(< (+ 7 main_~z~0) main_~y~0)} is VALID [2022-04-28 03:43:09,100 INFO L272 TraceCheckUtils]: 4: Hoare triple {4916#true} call #t~ret9 := main(); {4916#true} is VALID [2022-04-28 03:43:09,100 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {4916#true} {4916#true} #52#return; {4916#true} is VALID [2022-04-28 03:43:09,100 INFO L290 TraceCheckUtils]: 2: Hoare triple {4916#true} assume true; {4916#true} is VALID [2022-04-28 03:43:09,100 INFO L290 TraceCheckUtils]: 1: Hoare triple {4916#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(17, 2);call #Ultimate.allocInit(12, 3); {4916#true} is VALID [2022-04-28 03:43:09,100 INFO L272 TraceCheckUtils]: 0: Hoare triple {4916#true} call ULTIMATE.init(); {4916#true} is VALID [2022-04-28 03:43:09,100 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-04-28 03:43:09,100 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1219740981] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 03:43:09,100 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 03:43:09,101 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 10, 10] total 30 [2022-04-28 03:43:09,665 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 03:43:09,665 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [805811318] [2022-04-28 03:43:09,665 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [805811318] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 03:43:09,665 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 03:43:09,665 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [26] imperfect sequences [] total 26 [2022-04-28 03:43:09,666 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [371223130] [2022-04-28 03:43:09,666 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 03:43:09,666 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 26 states have (on average 1.6538461538461537) internal successors, (43), 25 states have internal predecessors, (43), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 47 [2022-04-28 03:43:09,666 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 03:43:09,666 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 26 states, 26 states have (on average 1.6538461538461537) internal successors, (43), 25 states have internal predecessors, (43), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:43:09,706 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 47 edges. 47 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 03:43:09,706 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2022-04-28 03:43:09,706 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 03:43:09,707 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2022-04-28 03:43:09,708 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=641, Invalid=1339, Unknown=0, NotChecked=0, Total=1980 [2022-04-28 03:43:09,708 INFO L87 Difference]: Start difference. First operand 66 states and 70 transitions. Second operand has 26 states, 26 states have (on average 1.6538461538461537) internal successors, (43), 25 states have internal predecessors, (43), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:43:11,248 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:43:11,249 INFO L93 Difference]: Finished difference Result 100 states and 109 transitions. [2022-04-28 03:43:11,249 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2022-04-28 03:43:11,249 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 26 states have (on average 1.6538461538461537) internal successors, (43), 25 states have internal predecessors, (43), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 47 [2022-04-28 03:43:11,249 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 03:43:11,249 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26 states, 26 states have (on average 1.6538461538461537) internal successors, (43), 25 states have internal predecessors, (43), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:43:11,250 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 59 transitions. [2022-04-28 03:43:11,251 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26 states, 26 states have (on average 1.6538461538461537) internal successors, (43), 25 states have internal predecessors, (43), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:43:11,251 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 59 transitions. [2022-04-28 03:43:11,251 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 18 states and 59 transitions. [2022-04-28 03:43:11,305 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 59 edges. 59 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 03:43:11,306 INFO L225 Difference]: With dead ends: 100 [2022-04-28 03:43:11,306 INFO L226 Difference]: Without dead ends: 68 [2022-04-28 03:43:11,307 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 107 GetRequests, 47 SyntacticMatches, 2 SemanticMatches, 58 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 852 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=960, Invalid=2580, Unknown=0, NotChecked=0, Total=3540 [2022-04-28 03:43:11,308 INFO L413 NwaCegarLoop]: 13 mSDtfsCounter, 25 mSDsluCounter, 92 mSDsCounter, 0 mSdLazyCounter, 702 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 25 SdHoareTripleChecker+Valid, 105 SdHoareTripleChecker+Invalid, 722 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 702 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-04-28 03:43:11,308 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [25 Valid, 105 Invalid, 722 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 702 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-04-28 03:43:11,308 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2022-04-28 03:43:11,423 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 68. [2022-04-28 03:43:11,424 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 03:43:11,424 INFO L82 GeneralOperation]: Start isEquivalent. First operand 68 states. Second operand has 68 states, 63 states have (on average 1.0793650793650793) internal successors, (68), 63 states have internal predecessors, (68), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:43:11,424 INFO L74 IsIncluded]: Start isIncluded. First operand 68 states. Second operand has 68 states, 63 states have (on average 1.0793650793650793) internal successors, (68), 63 states have internal predecessors, (68), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:43:11,424 INFO L87 Difference]: Start difference. First operand 68 states. Second operand has 68 states, 63 states have (on average 1.0793650793650793) internal successors, (68), 63 states have internal predecessors, (68), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:43:11,426 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:43:11,426 INFO L93 Difference]: Finished difference Result 68 states and 72 transitions. [2022-04-28 03:43:11,426 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 72 transitions. [2022-04-28 03:43:11,426 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:43:11,426 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:43:11,426 INFO L74 IsIncluded]: Start isIncluded. First operand has 68 states, 63 states have (on average 1.0793650793650793) internal successors, (68), 63 states have internal predecessors, (68), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 68 states. [2022-04-28 03:43:11,426 INFO L87 Difference]: Start difference. First operand has 68 states, 63 states have (on average 1.0793650793650793) internal successors, (68), 63 states have internal predecessors, (68), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 68 states. [2022-04-28 03:43:11,427 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:43:11,427 INFO L93 Difference]: Finished difference Result 68 states and 72 transitions. [2022-04-28 03:43:11,428 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 72 transitions. [2022-04-28 03:43:11,428 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:43:11,428 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:43:11,428 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 03:43:11,428 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 03:43:11,428 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 68 states, 63 states have (on average 1.0793650793650793) internal successors, (68), 63 states have internal predecessors, (68), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:43:11,429 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 72 transitions. [2022-04-28 03:43:11,429 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 72 transitions. Word has length 47 [2022-04-28 03:43:11,429 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 03:43:11,429 INFO L495 AbstractCegarLoop]: Abstraction has 68 states and 72 transitions. [2022-04-28 03:43:11,430 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 26 states have (on average 1.6538461538461537) internal successors, (43), 25 states have internal predecessors, (43), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:43:11,430 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 68 states and 72 transitions. [2022-04-28 03:43:11,497 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 72 edges. 72 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 03:43:11,497 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 72 transitions. [2022-04-28 03:43:11,497 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2022-04-28 03:43:11,498 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 03:43:11,498 INFO L195 NwaCegarLoop]: trace histogram [15, 14, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 03:43:11,516 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2022-04-28 03:43:11,699 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2022-04-28 03:43:11,699 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 03:43:11,700 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 03:43:11,700 INFO L85 PathProgramCache]: Analyzing trace with hash 266043011, now seen corresponding path program 11 times [2022-04-28 03:43:11,700 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 03:43:11,700 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [890435553] [2022-04-28 03:43:11,802 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 1 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 03:43:15,949 WARN L977 rdanLoopAcceleration]: Unable to prove correctness of quantifier elimination. [2022-04-28 03:43:16,071 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={1=1, 2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 03:43:16,072 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-28 03:43:16,074 INFO L85 PathProgramCache]: Analyzing trace with hash -1720356830, now seen corresponding path program 1 times [2022-04-28 03:43:16,074 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 03:43:16,074 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1696077303] [2022-04-28 03:43:16,074 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:43:16,074 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 03:43:16,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:43:16,223 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 03:43:16,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:43:16,228 INFO L290 TraceCheckUtils]: 0: Hoare triple {5610#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(17, 2);call #Ultimate.allocInit(12, 3); {5597#true} is VALID [2022-04-28 03:43:16,228 INFO L290 TraceCheckUtils]: 1: Hoare triple {5597#true} assume true; {5597#true} is VALID [2022-04-28 03:43:16,229 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {5597#true} {5597#true} #52#return; {5597#true} is VALID [2022-04-28 03:43:16,232 INFO L272 TraceCheckUtils]: 0: Hoare triple {5597#true} call ULTIMATE.init(); {5610#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 03:43:16,232 INFO L290 TraceCheckUtils]: 1: Hoare triple {5610#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(17, 2);call #Ultimate.allocInit(12, 3); {5597#true} is VALID [2022-04-28 03:43:16,232 INFO L290 TraceCheckUtils]: 2: Hoare triple {5597#true} assume true; {5597#true} is VALID [2022-04-28 03:43:16,232 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {5597#true} {5597#true} #52#return; {5597#true} is VALID [2022-04-28 03:43:16,232 INFO L272 TraceCheckUtils]: 4: Hoare triple {5597#true} call #t~ret9 := main(); {5597#true} is VALID [2022-04-28 03:43:16,232 INFO L290 TraceCheckUtils]: 5: Hoare triple {5597#true} ~x~0 := 0;~y~0 := 50000;~z~0 := 0;~x~0 := 0; {5602#(and (= main_~z~0 0) (<= 50000 main_~y~0))} is VALID [2022-04-28 03:43:16,233 INFO L290 TraceCheckUtils]: 6: Hoare triple {5602#(and (= main_~z~0 0) (<= 50000 main_~y~0))} [100] L11-2-->L18-1_primed: Formula: (let ((.cse0 (= |v_main_#t~post4_71| |v_main_#t~post4_70|)) (.cse1 (= v_main_~x~0_308 v_main_~x~0_307))) (or (and (<= 50000 v_main_~x~0_308) .cse0 .cse1) (and .cse0 .cse1) (and (< v_main_~x~0_308 v_main_~x~0_307) (< v_main_~x~0_307 50001)))) InVars {main_~x~0=v_main_~x~0_308, main_#t~post4=|v_main_#t~post4_71|} OutVars{main_~x~0=v_main_~x~0_307, main_#t~post4=|v_main_#t~post4_70|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {5602#(and (= main_~z~0 0) (<= 50000 main_~y~0))} is VALID [2022-04-28 03:43:16,233 INFO L290 TraceCheckUtils]: 7: Hoare triple {5602#(and (= main_~z~0 0) (<= 50000 main_~y~0))} [101] L18-1_primed-->L11-2: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {5602#(and (= main_~z~0 0) (<= 50000 main_~y~0))} is VALID [2022-04-28 03:43:16,234 INFO L290 TraceCheckUtils]: 8: Hoare triple {5602#(and (= main_~z~0 0) (<= 50000 main_~y~0))} [102] L11-2-->L18-1_primed: Formula: (let ((.cse0 (<= 50000 v_main_~x~0_310)) (.cse1 (= |v_main_#t~post6_74| |v_main_#t~post6_73|)) (.cse2 (= |v_main_#t~post5_74| |v_main_#t~post5_73|))) (or (and (or (not .cse0) (not (< v_main_~x~0_310 1000000))) .cse1 (= v_main_~x~0_309 v_main_~x~0_310) (= v_main_~y~0_249 v_main_~y~0_250) .cse2) (let ((.cse3 (+ v_main_~x~0_310 v_main_~y~0_249))) (and (< v_main_~y~0_250 v_main_~y~0_249) (= .cse3 (+ v_main_~x~0_309 v_main_~y~0_250)) .cse0 (< .cse3 (+ v_main_~y~0_250 1000001)))) (and .cse1 (= v_main_~x~0_310 v_main_~x~0_309) (= v_main_~y~0_250 v_main_~y~0_249) .cse2))) InVars {main_~y~0=v_main_~y~0_250, main_#t~post5=|v_main_#t~post5_74|, main_~x~0=v_main_~x~0_310, main_#t~post6=|v_main_#t~post6_74|} OutVars{main_~y~0=v_main_~y~0_249, main_#t~post5=|v_main_#t~post5_73|, main_~x~0=v_main_~x~0_309, main_#t~post6=|v_main_#t~post6_73|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {5602#(and (= main_~z~0 0) (<= 50000 main_~y~0))} is VALID [2022-04-28 03:43:16,235 INFO L290 TraceCheckUtils]: 9: Hoare triple {5602#(and (= main_~z~0 0) (<= 50000 main_~y~0))} [99] L18-1_primed-->L18-1: Formula: (not (< v_main_~x~0_11 1000000)) InVars {main_~x~0=v_main_~x~0_11} OutVars{main_~x~0=v_main_~x~0_11} AuxVars[] AssignedVars[] {5602#(and (= main_~z~0 0) (<= 50000 main_~y~0))} is VALID [2022-04-28 03:43:16,236 INFO L290 TraceCheckUtils]: 10: Hoare triple {5602#(and (= main_~z~0 0) (<= 50000 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {5603#(and (= main_~z~0 0) (<= 49999 main_~y~0))} is VALID [2022-04-28 03:43:16,236 INFO L290 TraceCheckUtils]: 11: Hoare triple {5603#(and (= main_~z~0 0) (<= 49999 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {5604#(and (<= 49998 main_~y~0) (= main_~z~0 0))} is VALID [2022-04-28 03:43:16,237 INFO L290 TraceCheckUtils]: 12: Hoare triple {5604#(and (<= 49998 main_~y~0) (= main_~z~0 0))} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {5605#(and (= main_~z~0 0) (<= 49997 main_~y~0))} is VALID [2022-04-28 03:43:16,237 INFO L290 TraceCheckUtils]: 13: Hoare triple {5605#(and (= main_~z~0 0) (<= 49997 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {5606#(and (= main_~z~0 0) (<= 49996 main_~y~0))} is VALID [2022-04-28 03:43:16,238 INFO L290 TraceCheckUtils]: 14: Hoare triple {5606#(and (= main_~z~0 0) (<= 49996 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {5607#(and (= main_~z~0 0) (<= 49995 main_~y~0))} is VALID [2022-04-28 03:43:16,239 INFO L290 TraceCheckUtils]: 15: Hoare triple {5607#(and (= main_~z~0 0) (<= 49995 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {5608#(and (= main_~z~0 0) (<= 49994 main_~y~0))} is VALID [2022-04-28 03:43:16,239 INFO L290 TraceCheckUtils]: 16: Hoare triple {5608#(and (= main_~z~0 0) (<= 49994 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {5609#(and (= main_~z~0 0) (<= 49993 main_~y~0))} is VALID [2022-04-28 03:43:16,240 INFO L290 TraceCheckUtils]: 17: Hoare triple {5609#(and (= main_~z~0 0) (<= 49993 main_~y~0))} assume !(~y~0 > ~z~0); {5598#false} is VALID [2022-04-28 03:43:16,240 INFO L272 TraceCheckUtils]: 18: Hoare triple {5598#false} call __VERIFIER_assert((if ~x~0 == ~z~0 then 1 else 0)); {5598#false} is VALID [2022-04-28 03:43:16,240 INFO L290 TraceCheckUtils]: 19: Hoare triple {5598#false} ~cond := #in~cond; {5598#false} is VALID [2022-04-28 03:43:16,240 INFO L290 TraceCheckUtils]: 20: Hoare triple {5598#false} assume 0 == ~cond; {5598#false} is VALID [2022-04-28 03:43:16,240 INFO L290 TraceCheckUtils]: 21: Hoare triple {5598#false} assume !false; {5598#false} is VALID [2022-04-28 03:43:16,240 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-04-28 03:43:16,240 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 03:43:16,241 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1696077303] [2022-04-28 03:43:16,241 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1696077303] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 03:43:16,241 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1191842933] [2022-04-28 03:43:16,241 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:43:16,241 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 03:43:16,242 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 03:43:16,244 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 03:43:16,245 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2022-04-28 03:43:16,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:43:16,282 INFO L263 TraceCheckSpWp]: Trace formula consists of 94 conjuncts, 11 conjunts are in the unsatisfiable core [2022-04-28 03:43:16,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:43:16,299 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 03:43:16,742 INFO L272 TraceCheckUtils]: 0: Hoare triple {5597#true} call ULTIMATE.init(); {5597#true} is VALID [2022-04-28 03:43:16,742 INFO L290 TraceCheckUtils]: 1: Hoare triple {5597#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(17, 2);call #Ultimate.allocInit(12, 3); {5597#true} is VALID [2022-04-28 03:43:16,742 INFO L290 TraceCheckUtils]: 2: Hoare triple {5597#true} assume true; {5597#true} is VALID [2022-04-28 03:43:16,742 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {5597#true} {5597#true} #52#return; {5597#true} is VALID [2022-04-28 03:43:16,742 INFO L272 TraceCheckUtils]: 4: Hoare triple {5597#true} call #t~ret9 := main(); {5597#true} is VALID [2022-04-28 03:43:16,743 INFO L290 TraceCheckUtils]: 5: Hoare triple {5597#true} ~x~0 := 0;~y~0 := 50000;~z~0 := 0;~x~0 := 0; {5629#(and (<= main_~z~0 0) (<= 50000 main_~y~0))} is VALID [2022-04-28 03:43:16,743 INFO L290 TraceCheckUtils]: 6: Hoare triple {5629#(and (<= main_~z~0 0) (<= 50000 main_~y~0))} [100] L11-2-->L18-1_primed: Formula: (let ((.cse0 (= |v_main_#t~post4_71| |v_main_#t~post4_70|)) (.cse1 (= v_main_~x~0_308 v_main_~x~0_307))) (or (and (<= 50000 v_main_~x~0_308) .cse0 .cse1) (and .cse0 .cse1) (and (< v_main_~x~0_308 v_main_~x~0_307) (< v_main_~x~0_307 50001)))) InVars {main_~x~0=v_main_~x~0_308, main_#t~post4=|v_main_#t~post4_71|} OutVars{main_~x~0=v_main_~x~0_307, main_#t~post4=|v_main_#t~post4_70|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {5629#(and (<= main_~z~0 0) (<= 50000 main_~y~0))} is VALID [2022-04-28 03:43:16,743 INFO L290 TraceCheckUtils]: 7: Hoare triple {5629#(and (<= main_~z~0 0) (<= 50000 main_~y~0))} [101] L18-1_primed-->L11-2: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {5629#(and (<= main_~z~0 0) (<= 50000 main_~y~0))} is VALID [2022-04-28 03:43:16,744 INFO L290 TraceCheckUtils]: 8: Hoare triple {5629#(and (<= main_~z~0 0) (<= 50000 main_~y~0))} [102] L11-2-->L18-1_primed: Formula: (let ((.cse0 (<= 50000 v_main_~x~0_310)) (.cse1 (= |v_main_#t~post6_74| |v_main_#t~post6_73|)) (.cse2 (= |v_main_#t~post5_74| |v_main_#t~post5_73|))) (or (and (or (not .cse0) (not (< v_main_~x~0_310 1000000))) .cse1 (= v_main_~x~0_309 v_main_~x~0_310) (= v_main_~y~0_249 v_main_~y~0_250) .cse2) (let ((.cse3 (+ v_main_~x~0_310 v_main_~y~0_249))) (and (< v_main_~y~0_250 v_main_~y~0_249) (= .cse3 (+ v_main_~x~0_309 v_main_~y~0_250)) .cse0 (< .cse3 (+ v_main_~y~0_250 1000001)))) (and .cse1 (= v_main_~x~0_310 v_main_~x~0_309) (= v_main_~y~0_250 v_main_~y~0_249) .cse2))) InVars {main_~y~0=v_main_~y~0_250, main_#t~post5=|v_main_#t~post5_74|, main_~x~0=v_main_~x~0_310, main_#t~post6=|v_main_#t~post6_74|} OutVars{main_~y~0=v_main_~y~0_249, main_#t~post5=|v_main_#t~post5_73|, main_~x~0=v_main_~x~0_309, main_#t~post6=|v_main_#t~post6_73|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {5629#(and (<= main_~z~0 0) (<= 50000 main_~y~0))} is VALID [2022-04-28 03:43:16,745 INFO L290 TraceCheckUtils]: 9: Hoare triple {5629#(and (<= main_~z~0 0) (<= 50000 main_~y~0))} [99] L18-1_primed-->L18-1: Formula: (not (< v_main_~x~0_11 1000000)) InVars {main_~x~0=v_main_~x~0_11} OutVars{main_~x~0=v_main_~x~0_11} AuxVars[] AssignedVars[] {5629#(and (<= main_~z~0 0) (<= 50000 main_~y~0))} is VALID [2022-04-28 03:43:16,745 INFO L290 TraceCheckUtils]: 10: Hoare triple {5629#(and (<= main_~z~0 0) (<= 50000 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {5645#(and (<= main_~z~0 0) (<= 49999 main_~y~0))} is VALID [2022-04-28 03:43:16,746 INFO L290 TraceCheckUtils]: 11: Hoare triple {5645#(and (<= main_~z~0 0) (<= 49999 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {5649#(and (<= main_~z~0 0) (<= 49998 main_~y~0))} is VALID [2022-04-28 03:43:16,746 INFO L290 TraceCheckUtils]: 12: Hoare triple {5649#(and (<= main_~z~0 0) (<= 49998 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {5653#(and (<= main_~z~0 0) (<= 49997 main_~y~0))} is VALID [2022-04-28 03:43:16,747 INFO L290 TraceCheckUtils]: 13: Hoare triple {5653#(and (<= main_~z~0 0) (<= 49997 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {5657#(and (<= main_~z~0 0) (<= 49996 main_~y~0))} is VALID [2022-04-28 03:43:16,747 INFO L290 TraceCheckUtils]: 14: Hoare triple {5657#(and (<= main_~z~0 0) (<= 49996 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {5661#(and (<= main_~z~0 0) (<= 49995 main_~y~0))} is VALID [2022-04-28 03:43:16,748 INFO L290 TraceCheckUtils]: 15: Hoare triple {5661#(and (<= main_~z~0 0) (<= 49995 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {5665#(and (<= main_~z~0 0) (<= 49994 main_~y~0))} is VALID [2022-04-28 03:43:16,748 INFO L290 TraceCheckUtils]: 16: Hoare triple {5665#(and (<= main_~z~0 0) (<= 49994 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {5669#(and (<= main_~z~0 0) (<= 49993 main_~y~0))} is VALID [2022-04-28 03:43:16,749 INFO L290 TraceCheckUtils]: 17: Hoare triple {5669#(and (<= main_~z~0 0) (<= 49993 main_~y~0))} assume !(~y~0 > ~z~0); {5598#false} is VALID [2022-04-28 03:43:16,749 INFO L272 TraceCheckUtils]: 18: Hoare triple {5598#false} call __VERIFIER_assert((if ~x~0 == ~z~0 then 1 else 0)); {5598#false} is VALID [2022-04-28 03:43:16,749 INFO L290 TraceCheckUtils]: 19: Hoare triple {5598#false} ~cond := #in~cond; {5598#false} is VALID [2022-04-28 03:43:16,749 INFO L290 TraceCheckUtils]: 20: Hoare triple {5598#false} assume 0 == ~cond; {5598#false} is VALID [2022-04-28 03:43:16,749 INFO L290 TraceCheckUtils]: 21: Hoare triple {5598#false} assume !false; {5598#false} is VALID [2022-04-28 03:43:16,749 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-04-28 03:43:16,749 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 03:43:17,210 INFO L290 TraceCheckUtils]: 21: Hoare triple {5598#false} assume !false; {5598#false} is VALID [2022-04-28 03:43:17,210 INFO L290 TraceCheckUtils]: 20: Hoare triple {5598#false} assume 0 == ~cond; {5598#false} is VALID [2022-04-28 03:43:17,210 INFO L290 TraceCheckUtils]: 19: Hoare triple {5598#false} ~cond := #in~cond; {5598#false} is VALID [2022-04-28 03:43:17,210 INFO L272 TraceCheckUtils]: 18: Hoare triple {5598#false} call __VERIFIER_assert((if ~x~0 == ~z~0 then 1 else 0)); {5598#false} is VALID [2022-04-28 03:43:17,210 INFO L290 TraceCheckUtils]: 17: Hoare triple {5697#(< main_~z~0 main_~y~0)} assume !(~y~0 > ~z~0); {5598#false} is VALID [2022-04-28 03:43:17,211 INFO L290 TraceCheckUtils]: 16: Hoare triple {5701#(< (+ main_~z~0 1) main_~y~0)} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {5697#(< main_~z~0 main_~y~0)} is VALID [2022-04-28 03:43:17,212 INFO L290 TraceCheckUtils]: 15: Hoare triple {5705#(< (+ main_~z~0 2) main_~y~0)} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {5701#(< (+ main_~z~0 1) main_~y~0)} is VALID [2022-04-28 03:43:17,212 INFO L290 TraceCheckUtils]: 14: Hoare triple {5709#(< (+ main_~z~0 3) main_~y~0)} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {5705#(< (+ main_~z~0 2) main_~y~0)} is VALID [2022-04-28 03:43:17,212 INFO L290 TraceCheckUtils]: 13: Hoare triple {5713#(< (+ main_~z~0 4) main_~y~0)} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {5709#(< (+ main_~z~0 3) main_~y~0)} is VALID [2022-04-28 03:43:17,213 INFO L290 TraceCheckUtils]: 12: Hoare triple {5717#(< (+ 5 main_~z~0) main_~y~0)} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {5713#(< (+ main_~z~0 4) main_~y~0)} is VALID [2022-04-28 03:43:17,213 INFO L290 TraceCheckUtils]: 11: Hoare triple {5721#(< (+ main_~z~0 6) main_~y~0)} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {5717#(< (+ 5 main_~z~0) main_~y~0)} is VALID [2022-04-28 03:43:17,214 INFO L290 TraceCheckUtils]: 10: Hoare triple {5725#(< (+ 7 main_~z~0) main_~y~0)} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {5721#(< (+ main_~z~0 6) main_~y~0)} is VALID [2022-04-28 03:43:17,214 INFO L290 TraceCheckUtils]: 9: Hoare triple {5725#(< (+ 7 main_~z~0) main_~y~0)} [99] L18-1_primed-->L18-1: Formula: (not (< v_main_~x~0_11 1000000)) InVars {main_~x~0=v_main_~x~0_11} OutVars{main_~x~0=v_main_~x~0_11} AuxVars[] AssignedVars[] {5725#(< (+ 7 main_~z~0) main_~y~0)} is VALID [2022-04-28 03:43:17,215 INFO L290 TraceCheckUtils]: 8: Hoare triple {5725#(< (+ 7 main_~z~0) main_~y~0)} [102] L11-2-->L18-1_primed: Formula: (let ((.cse0 (<= 50000 v_main_~x~0_310)) (.cse1 (= |v_main_#t~post6_74| |v_main_#t~post6_73|)) (.cse2 (= |v_main_#t~post5_74| |v_main_#t~post5_73|))) (or (and (or (not .cse0) (not (< v_main_~x~0_310 1000000))) .cse1 (= v_main_~x~0_309 v_main_~x~0_310) (= v_main_~y~0_249 v_main_~y~0_250) .cse2) (let ((.cse3 (+ v_main_~x~0_310 v_main_~y~0_249))) (and (< v_main_~y~0_250 v_main_~y~0_249) (= .cse3 (+ v_main_~x~0_309 v_main_~y~0_250)) .cse0 (< .cse3 (+ v_main_~y~0_250 1000001)))) (and .cse1 (= v_main_~x~0_310 v_main_~x~0_309) (= v_main_~y~0_250 v_main_~y~0_249) .cse2))) InVars {main_~y~0=v_main_~y~0_250, main_#t~post5=|v_main_#t~post5_74|, main_~x~0=v_main_~x~0_310, main_#t~post6=|v_main_#t~post6_74|} OutVars{main_~y~0=v_main_~y~0_249, main_#t~post5=|v_main_#t~post5_73|, main_~x~0=v_main_~x~0_309, main_#t~post6=|v_main_#t~post6_73|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {5725#(< (+ 7 main_~z~0) main_~y~0)} is VALID [2022-04-28 03:43:17,215 INFO L290 TraceCheckUtils]: 7: Hoare triple {5725#(< (+ 7 main_~z~0) main_~y~0)} [101] L18-1_primed-->L11-2: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {5725#(< (+ 7 main_~z~0) main_~y~0)} is VALID [2022-04-28 03:43:17,216 INFO L290 TraceCheckUtils]: 6: Hoare triple {5725#(< (+ 7 main_~z~0) main_~y~0)} [100] L11-2-->L18-1_primed: Formula: (let ((.cse0 (= |v_main_#t~post4_71| |v_main_#t~post4_70|)) (.cse1 (= v_main_~x~0_308 v_main_~x~0_307))) (or (and (<= 50000 v_main_~x~0_308) .cse0 .cse1) (and .cse0 .cse1) (and (< v_main_~x~0_308 v_main_~x~0_307) (< v_main_~x~0_307 50001)))) InVars {main_~x~0=v_main_~x~0_308, main_#t~post4=|v_main_#t~post4_71|} OutVars{main_~x~0=v_main_~x~0_307, main_#t~post4=|v_main_#t~post4_70|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {5725#(< (+ 7 main_~z~0) main_~y~0)} is VALID [2022-04-28 03:43:17,216 INFO L290 TraceCheckUtils]: 5: Hoare triple {5597#true} ~x~0 := 0;~y~0 := 50000;~z~0 := 0;~x~0 := 0; {5725#(< (+ 7 main_~z~0) main_~y~0)} is VALID [2022-04-28 03:43:17,216 INFO L272 TraceCheckUtils]: 4: Hoare triple {5597#true} call #t~ret9 := main(); {5597#true} is VALID [2022-04-28 03:43:17,216 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {5597#true} {5597#true} #52#return; {5597#true} is VALID [2022-04-28 03:43:17,216 INFO L290 TraceCheckUtils]: 2: Hoare triple {5597#true} assume true; {5597#true} is VALID [2022-04-28 03:43:17,216 INFO L290 TraceCheckUtils]: 1: Hoare triple {5597#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(17, 2);call #Ultimate.allocInit(12, 3); {5597#true} is VALID [2022-04-28 03:43:17,216 INFO L272 TraceCheckUtils]: 0: Hoare triple {5597#true} call ULTIMATE.init(); {5597#true} is VALID [2022-04-28 03:43:17,217 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-04-28 03:43:17,217 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1191842933] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 03:43:17,217 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 03:43:17,217 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10, 10] total 27 [2022-04-28 03:43:17,697 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 03:43:17,697 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [890435553] [2022-04-28 03:43:17,697 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [890435553] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 03:43:17,697 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 03:43:17,697 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [27] imperfect sequences [] total 27 [2022-04-28 03:43:17,697 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1096536014] [2022-04-28 03:43:17,697 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 03:43:17,698 INFO L78 Accepts]: Start accepts. Automaton has has 27 states, 27 states have (on average 1.6666666666666667) internal successors, (45), 26 states have internal predecessors, (45), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 49 [2022-04-28 03:43:17,698 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 03:43:17,698 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 27 states, 27 states have (on average 1.6666666666666667) internal successors, (45), 26 states have internal predecessors, (45), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:43:17,742 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 49 edges. 49 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 03:43:17,742 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2022-04-28 03:43:17,742 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 03:43:17,743 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2022-04-28 03:43:17,743 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=730, Invalid=1076, Unknown=0, NotChecked=0, Total=1806 [2022-04-28 03:43:17,743 INFO L87 Difference]: Start difference. First operand 68 states and 72 transitions. Second operand has 27 states, 27 states have (on average 1.6666666666666667) internal successors, (45), 26 states have internal predecessors, (45), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:43:19,253 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:43:19,253 INFO L93 Difference]: Finished difference Result 115 states and 137 transitions. [2022-04-28 03:43:19,253 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2022-04-28 03:43:19,254 INFO L78 Accepts]: Start accepts. Automaton has has 27 states, 27 states have (on average 1.6666666666666667) internal successors, (45), 26 states have internal predecessors, (45), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 49 [2022-04-28 03:43:19,254 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 03:43:19,254 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27 states, 27 states have (on average 1.6666666666666667) internal successors, (45), 26 states have internal predecessors, (45), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:43:19,255 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 81 transitions. [2022-04-28 03:43:19,255 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27 states, 27 states have (on average 1.6666666666666667) internal successors, (45), 26 states have internal predecessors, (45), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:43:19,256 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 81 transitions. [2022-04-28 03:43:19,256 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 27 states and 81 transitions. [2022-04-28 03:43:19,333 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 81 edges. 81 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 03:43:19,334 INFO L225 Difference]: With dead ends: 115 [2022-04-28 03:43:19,334 INFO L226 Difference]: Without dead ends: 83 [2022-04-28 03:43:19,337 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 116 GetRequests, 49 SyntacticMatches, 2 SemanticMatches, 65 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1213 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=1524, Invalid=2898, Unknown=0, NotChecked=0, Total=4422 [2022-04-28 03:43:19,337 INFO L413 NwaCegarLoop]: 12 mSDtfsCounter, 61 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 511 mSolverCounterSat, 93 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 61 SdHoareTripleChecker+Valid, 24 SdHoareTripleChecker+Invalid, 604 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 93 IncrementalHoareTripleChecker+Valid, 511 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-04-28 03:43:19,337 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [61 Valid, 24 Invalid, 604 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [93 Valid, 511 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-04-28 03:43:19,338 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2022-04-28 03:43:19,438 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 55. [2022-04-28 03:43:19,438 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 03:43:19,439 INFO L82 GeneralOperation]: Start isEquivalent. First operand 83 states. Second operand has 55 states, 50 states have (on average 1.08) internal successors, (54), 50 states have internal predecessors, (54), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:43:19,439 INFO L74 IsIncluded]: Start isIncluded. First operand 83 states. Second operand has 55 states, 50 states have (on average 1.08) internal successors, (54), 50 states have internal predecessors, (54), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:43:19,439 INFO L87 Difference]: Start difference. First operand 83 states. Second operand has 55 states, 50 states have (on average 1.08) internal successors, (54), 50 states have internal predecessors, (54), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:43:19,440 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:43:19,440 INFO L93 Difference]: Finished difference Result 83 states and 87 transitions. [2022-04-28 03:43:19,440 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 87 transitions. [2022-04-28 03:43:19,440 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:43:19,440 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:43:19,440 INFO L74 IsIncluded]: Start isIncluded. First operand has 55 states, 50 states have (on average 1.08) internal successors, (54), 50 states have internal predecessors, (54), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 83 states. [2022-04-28 03:43:19,440 INFO L87 Difference]: Start difference. First operand has 55 states, 50 states have (on average 1.08) internal successors, (54), 50 states have internal predecessors, (54), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 83 states. [2022-04-28 03:43:19,442 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:43:19,442 INFO L93 Difference]: Finished difference Result 83 states and 87 transitions. [2022-04-28 03:43:19,442 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 87 transitions. [2022-04-28 03:43:19,442 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:43:19,442 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:43:19,442 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 03:43:19,442 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 03:43:19,442 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 55 states, 50 states have (on average 1.08) internal successors, (54), 50 states have internal predecessors, (54), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:43:19,443 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 58 transitions. [2022-04-28 03:43:19,443 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 58 transitions. Word has length 49 [2022-04-28 03:43:19,443 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 03:43:19,443 INFO L495 AbstractCegarLoop]: Abstraction has 55 states and 58 transitions. [2022-04-28 03:43:19,444 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 27 states have (on average 1.6666666666666667) internal successors, (45), 26 states have internal predecessors, (45), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:43:19,444 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 55 states and 58 transitions. [2022-04-28 03:43:19,496 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 58 edges. 58 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 03:43:19,496 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 58 transitions. [2022-04-28 03:43:19,496 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2022-04-28 03:43:19,497 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 03:43:19,497 INFO L195 NwaCegarLoop]: trace histogram [17, 16, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 03:43:19,512 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Ended with exit code 0 [2022-04-28 03:43:19,697 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2022-04-28 03:43:19,697 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 03:43:19,698 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 03:43:19,698 INFO L85 PathProgramCache]: Analyzing trace with hash 2144068746, now seen corresponding path program 12 times [2022-04-28 03:43:19,698 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 03:43:19,698 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [794893650] [2022-04-28 03:43:22,079 WARN L977 rdanLoopAcceleration]: Unable to prove correctness of quantifier elimination. [2022-04-28 03:43:22,127 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 1 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 03:43:22,357 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={1=1, 2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 03:43:22,358 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-28 03:43:22,360 INFO L85 PathProgramCache]: Analyzing trace with hash 1328191105, now seen corresponding path program 1 times [2022-04-28 03:43:22,360 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 03:43:22,360 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1006141419] [2022-04-28 03:43:22,361 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:43:22,361 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 03:43:22,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:43:22,555 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 03:43:22,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:43:22,559 INFO L290 TraceCheckUtils]: 0: Hoare triple {6345#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(17, 2);call #Ultimate.allocInit(12, 3); {6328#true} is VALID [2022-04-28 03:43:22,560 INFO L290 TraceCheckUtils]: 1: Hoare triple {6328#true} assume true; {6328#true} is VALID [2022-04-28 03:43:22,560 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {6328#true} {6328#true} #52#return; {6328#true} is VALID [2022-04-28 03:43:22,560 INFO L272 TraceCheckUtils]: 0: Hoare triple {6328#true} call ULTIMATE.init(); {6345#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 03:43:22,560 INFO L290 TraceCheckUtils]: 1: Hoare triple {6345#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(17, 2);call #Ultimate.allocInit(12, 3); {6328#true} is VALID [2022-04-28 03:43:22,560 INFO L290 TraceCheckUtils]: 2: Hoare triple {6328#true} assume true; {6328#true} is VALID [2022-04-28 03:43:22,560 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {6328#true} {6328#true} #52#return; {6328#true} is VALID [2022-04-28 03:43:22,560 INFO L272 TraceCheckUtils]: 4: Hoare triple {6328#true} call #t~ret9 := main(); {6328#true} is VALID [2022-04-28 03:43:22,561 INFO L290 TraceCheckUtils]: 5: Hoare triple {6328#true} ~x~0 := 0;~y~0 := 50000;~z~0 := 0;~x~0 := 0; {6333#(and (= main_~z~0 0) (= main_~x~0 0) (<= 50000 main_~y~0))} is VALID [2022-04-28 03:43:22,561 INFO L290 TraceCheckUtils]: 6: Hoare triple {6333#(and (= main_~z~0 0) (= main_~x~0 0) (<= 50000 main_~y~0))} [104] L11-2-->L18-1_primed: Formula: (let ((.cse0 (= |v_main_#t~post4_77| |v_main_#t~post4_76|)) (.cse1 (= v_main_~x~0_346 v_main_~x~0_345))) (or (and .cse0 .cse1) (and (< v_main_~x~0_345 50001) (< v_main_~x~0_346 v_main_~x~0_345)) (and .cse0 .cse1 (not (< v_main_~x~0_346 50000))))) InVars {main_~x~0=v_main_~x~0_346, main_#t~post4=|v_main_#t~post4_77|} OutVars{main_~x~0=v_main_~x~0_345, main_#t~post4=|v_main_#t~post4_76|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {6334#(and (= main_~z~0 0) (<= main_~x~0 main_~y~0) (<= main_~x~0 50000))} is VALID [2022-04-28 03:43:22,562 INFO L290 TraceCheckUtils]: 7: Hoare triple {6334#(and (= main_~z~0 0) (<= main_~x~0 main_~y~0) (<= main_~x~0 50000))} [105] L18-1_primed-->L11-2: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {6334#(and (= main_~z~0 0) (<= main_~x~0 main_~y~0) (<= main_~x~0 50000))} is VALID [2022-04-28 03:43:22,562 INFO L290 TraceCheckUtils]: 8: Hoare triple {6334#(and (= main_~z~0 0) (<= main_~x~0 main_~y~0) (<= main_~x~0 50000))} [106] L11-2-->L18-1_primed: Formula: (let ((.cse1 (= v_main_~y~0_287 v_main_~y~0_286)) (.cse2 (= v_main_~x~0_348 v_main_~x~0_347)) (.cse3 (= |v_main_#t~post6_81| |v_main_#t~post6_80|)) (.cse4 (= |v_main_#t~post5_81| |v_main_#t~post5_80|)) (.cse0 (<= 50000 v_main_~x~0_348))) (or (and .cse0 (= (+ v_main_~x~0_348 v_main_~y~0_286) (+ v_main_~x~0_347 v_main_~y~0_287)) (< v_main_~x~0_347 1000001) (< v_main_~x~0_348 v_main_~x~0_347)) (and .cse1 .cse2 .cse3 .cse4) (and .cse1 .cse2 .cse3 .cse4 (or (not .cse0) (not (< v_main_~x~0_348 1000000)))))) InVars {main_~y~0=v_main_~y~0_287, main_#t~post5=|v_main_#t~post5_81|, main_~x~0=v_main_~x~0_348, main_#t~post6=|v_main_#t~post6_81|} OutVars{main_~y~0=v_main_~y~0_286, main_#t~post5=|v_main_#t~post5_80|, main_~x~0=v_main_~x~0_347, main_#t~post6=|v_main_#t~post6_80|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {6335#(and (= main_~z~0 0) (or (<= main_~x~0 main_~y~0) (<= main_~x~0 50000)))} is VALID [2022-04-28 03:43:22,563 INFO L290 TraceCheckUtils]: 9: Hoare triple {6335#(and (= main_~z~0 0) (or (<= main_~x~0 main_~y~0) (<= main_~x~0 50000)))} [103] L18-1_primed-->L18-1: Formula: (not (< v_main_~x~0_11 1000000)) InVars {main_~x~0=v_main_~x~0_11} OutVars{main_~x~0=v_main_~x~0_11} AuxVars[] AssignedVars[] {6336#(and (= main_~z~0 0) (<= 1000000 main_~y~0))} is VALID [2022-04-28 03:43:22,563 INFO L290 TraceCheckUtils]: 10: Hoare triple {6336#(and (= main_~z~0 0) (<= 1000000 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {6337#(and (= main_~z~0 0) (<= 999999 main_~y~0))} is VALID [2022-04-28 03:43:22,564 INFO L290 TraceCheckUtils]: 11: Hoare triple {6337#(and (= main_~z~0 0) (<= 999999 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {6338#(and (= main_~z~0 0) (<= 999998 main_~y~0))} is VALID [2022-04-28 03:43:22,564 INFO L290 TraceCheckUtils]: 12: Hoare triple {6338#(and (= main_~z~0 0) (<= 999998 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {6339#(and (= main_~z~0 0) (<= 999997 main_~y~0))} is VALID [2022-04-28 03:43:22,565 INFO L290 TraceCheckUtils]: 13: Hoare triple {6339#(and (= main_~z~0 0) (<= 999997 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {6340#(and (<= 999996 main_~y~0) (= main_~z~0 0))} is VALID [2022-04-28 03:43:22,565 INFO L290 TraceCheckUtils]: 14: Hoare triple {6340#(and (<= 999996 main_~y~0) (= main_~z~0 0))} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {6341#(and (= main_~z~0 0) (<= 999995 main_~y~0))} is VALID [2022-04-28 03:43:22,566 INFO L290 TraceCheckUtils]: 15: Hoare triple {6341#(and (= main_~z~0 0) (<= 999995 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {6342#(and (= main_~z~0 0) (<= 999994 main_~y~0))} is VALID [2022-04-28 03:43:22,567 INFO L290 TraceCheckUtils]: 16: Hoare triple {6342#(and (= main_~z~0 0) (<= 999994 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {6343#(and (= main_~z~0 0) (<= 999993 main_~y~0))} is VALID [2022-04-28 03:43:22,568 INFO L290 TraceCheckUtils]: 17: Hoare triple {6343#(and (= main_~z~0 0) (<= 999993 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {6344#(and (= main_~z~0 0) (<= 999992 main_~y~0))} is VALID [2022-04-28 03:43:22,568 INFO L290 TraceCheckUtils]: 18: Hoare triple {6344#(and (= main_~z~0 0) (<= 999992 main_~y~0))} assume !(~y~0 > ~z~0); {6329#false} is VALID [2022-04-28 03:43:22,569 INFO L272 TraceCheckUtils]: 19: Hoare triple {6329#false} call __VERIFIER_assert((if ~x~0 == ~z~0 then 1 else 0)); {6329#false} is VALID [2022-04-28 03:43:22,569 INFO L290 TraceCheckUtils]: 20: Hoare triple {6329#false} ~cond := #in~cond; {6329#false} is VALID [2022-04-28 03:43:22,569 INFO L290 TraceCheckUtils]: 21: Hoare triple {6329#false} assume 0 == ~cond; {6329#false} is VALID [2022-04-28 03:43:22,569 INFO L290 TraceCheckUtils]: 22: Hoare triple {6329#false} assume !false; {6329#false} is VALID [2022-04-28 03:43:22,569 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 0 proven. 38 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 03:43:22,569 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 03:43:22,569 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1006141419] [2022-04-28 03:43:22,569 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1006141419] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 03:43:22,569 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1154611111] [2022-04-28 03:43:22,570 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:43:22,570 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 03:43:22,570 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 03:43:22,573 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 03:43:22,574 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2022-04-28 03:43:22,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:43:22,604 INFO L263 TraceCheckSpWp]: Trace formula consists of 99 conjuncts, 12 conjunts are in the unsatisfiable core [2022-04-28 03:43:22,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:43:22,615 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 03:43:23,056 INFO L272 TraceCheckUtils]: 0: Hoare triple {6328#true} call ULTIMATE.init(); {6328#true} is VALID [2022-04-28 03:43:23,057 INFO L290 TraceCheckUtils]: 1: Hoare triple {6328#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(17, 2);call #Ultimate.allocInit(12, 3); {6328#true} is VALID [2022-04-28 03:43:23,057 INFO L290 TraceCheckUtils]: 2: Hoare triple {6328#true} assume true; {6328#true} is VALID [2022-04-28 03:43:23,057 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {6328#true} {6328#true} #52#return; {6328#true} is VALID [2022-04-28 03:43:23,057 INFO L272 TraceCheckUtils]: 4: Hoare triple {6328#true} call #t~ret9 := main(); {6328#true} is VALID [2022-04-28 03:43:23,057 INFO L290 TraceCheckUtils]: 5: Hoare triple {6328#true} ~x~0 := 0;~y~0 := 50000;~z~0 := 0;~x~0 := 0; {6364#(and (<= main_~z~0 0) (<= 50000 main_~y~0))} is VALID [2022-04-28 03:43:23,058 INFO L290 TraceCheckUtils]: 6: Hoare triple {6364#(and (<= main_~z~0 0) (<= 50000 main_~y~0))} [104] L11-2-->L18-1_primed: Formula: (let ((.cse0 (= |v_main_#t~post4_77| |v_main_#t~post4_76|)) (.cse1 (= v_main_~x~0_346 v_main_~x~0_345))) (or (and .cse0 .cse1) (and (< v_main_~x~0_345 50001) (< v_main_~x~0_346 v_main_~x~0_345)) (and .cse0 .cse1 (not (< v_main_~x~0_346 50000))))) InVars {main_~x~0=v_main_~x~0_346, main_#t~post4=|v_main_#t~post4_77|} OutVars{main_~x~0=v_main_~x~0_345, main_#t~post4=|v_main_#t~post4_76|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {6364#(and (<= main_~z~0 0) (<= 50000 main_~y~0))} is VALID [2022-04-28 03:43:23,058 INFO L290 TraceCheckUtils]: 7: Hoare triple {6364#(and (<= main_~z~0 0) (<= 50000 main_~y~0))} [105] L18-1_primed-->L11-2: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {6364#(and (<= main_~z~0 0) (<= 50000 main_~y~0))} is VALID [2022-04-28 03:43:23,059 INFO L290 TraceCheckUtils]: 8: Hoare triple {6364#(and (<= main_~z~0 0) (<= 50000 main_~y~0))} [106] L11-2-->L18-1_primed: Formula: (let ((.cse1 (= v_main_~y~0_287 v_main_~y~0_286)) (.cse2 (= v_main_~x~0_348 v_main_~x~0_347)) (.cse3 (= |v_main_#t~post6_81| |v_main_#t~post6_80|)) (.cse4 (= |v_main_#t~post5_81| |v_main_#t~post5_80|)) (.cse0 (<= 50000 v_main_~x~0_348))) (or (and .cse0 (= (+ v_main_~x~0_348 v_main_~y~0_286) (+ v_main_~x~0_347 v_main_~y~0_287)) (< v_main_~x~0_347 1000001) (< v_main_~x~0_348 v_main_~x~0_347)) (and .cse1 .cse2 .cse3 .cse4) (and .cse1 .cse2 .cse3 .cse4 (or (not .cse0) (not (< v_main_~x~0_348 1000000)))))) InVars {main_~y~0=v_main_~y~0_287, main_#t~post5=|v_main_#t~post5_81|, main_~x~0=v_main_~x~0_348, main_#t~post6=|v_main_#t~post6_81|} OutVars{main_~y~0=v_main_~y~0_286, main_#t~post5=|v_main_#t~post5_80|, main_~x~0=v_main_~x~0_347, main_#t~post6=|v_main_#t~post6_80|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {6364#(and (<= main_~z~0 0) (<= 50000 main_~y~0))} is VALID [2022-04-28 03:43:23,059 INFO L290 TraceCheckUtils]: 9: Hoare triple {6364#(and (<= main_~z~0 0) (<= 50000 main_~y~0))} [103] L18-1_primed-->L18-1: Formula: (not (< v_main_~x~0_11 1000000)) InVars {main_~x~0=v_main_~x~0_11} OutVars{main_~x~0=v_main_~x~0_11} AuxVars[] AssignedVars[] {6364#(and (<= main_~z~0 0) (<= 50000 main_~y~0))} is VALID [2022-04-28 03:43:23,060 INFO L290 TraceCheckUtils]: 10: Hoare triple {6364#(and (<= main_~z~0 0) (<= 50000 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {6380#(and (<= main_~z~0 0) (<= 49999 main_~y~0))} is VALID [2022-04-28 03:43:23,060 INFO L290 TraceCheckUtils]: 11: Hoare triple {6380#(and (<= main_~z~0 0) (<= 49999 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {6384#(and (<= main_~z~0 0) (<= 49998 main_~y~0))} is VALID [2022-04-28 03:43:23,061 INFO L290 TraceCheckUtils]: 12: Hoare triple {6384#(and (<= main_~z~0 0) (<= 49998 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {6388#(and (<= main_~z~0 0) (<= 49997 main_~y~0))} is VALID [2022-04-28 03:43:23,061 INFO L290 TraceCheckUtils]: 13: Hoare triple {6388#(and (<= main_~z~0 0) (<= 49997 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {6392#(and (<= main_~z~0 0) (<= 49996 main_~y~0))} is VALID [2022-04-28 03:43:23,062 INFO L290 TraceCheckUtils]: 14: Hoare triple {6392#(and (<= main_~z~0 0) (<= 49996 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {6396#(and (<= main_~z~0 0) (<= 49995 main_~y~0))} is VALID [2022-04-28 03:43:23,062 INFO L290 TraceCheckUtils]: 15: Hoare triple {6396#(and (<= main_~z~0 0) (<= 49995 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {6400#(and (<= main_~z~0 0) (<= 49994 main_~y~0))} is VALID [2022-04-28 03:43:23,063 INFO L290 TraceCheckUtils]: 16: Hoare triple {6400#(and (<= main_~z~0 0) (<= 49994 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {6404#(and (<= main_~z~0 0) (<= 49993 main_~y~0))} is VALID [2022-04-28 03:43:23,063 INFO L290 TraceCheckUtils]: 17: Hoare triple {6404#(and (<= main_~z~0 0) (<= 49993 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {6408#(and (<= main_~z~0 0) (<= 49992 main_~y~0))} is VALID [2022-04-28 03:43:23,063 INFO L290 TraceCheckUtils]: 18: Hoare triple {6408#(and (<= main_~z~0 0) (<= 49992 main_~y~0))} assume !(~y~0 > ~z~0); {6329#false} is VALID [2022-04-28 03:43:23,064 INFO L272 TraceCheckUtils]: 19: Hoare triple {6329#false} call __VERIFIER_assert((if ~x~0 == ~z~0 then 1 else 0)); {6329#false} is VALID [2022-04-28 03:43:23,064 INFO L290 TraceCheckUtils]: 20: Hoare triple {6329#false} ~cond := #in~cond; {6329#false} is VALID [2022-04-28 03:43:23,064 INFO L290 TraceCheckUtils]: 21: Hoare triple {6329#false} assume 0 == ~cond; {6329#false} is VALID [2022-04-28 03:43:23,064 INFO L290 TraceCheckUtils]: 22: Hoare triple {6329#false} assume !false; {6329#false} is VALID [2022-04-28 03:43:23,064 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-04-28 03:43:23,064 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 03:43:23,559 INFO L290 TraceCheckUtils]: 22: Hoare triple {6329#false} assume !false; {6329#false} is VALID [2022-04-28 03:43:23,559 INFO L290 TraceCheckUtils]: 21: Hoare triple {6329#false} assume 0 == ~cond; {6329#false} is VALID [2022-04-28 03:43:23,559 INFO L290 TraceCheckUtils]: 20: Hoare triple {6329#false} ~cond := #in~cond; {6329#false} is VALID [2022-04-28 03:43:23,559 INFO L272 TraceCheckUtils]: 19: Hoare triple {6329#false} call __VERIFIER_assert((if ~x~0 == ~z~0 then 1 else 0)); {6329#false} is VALID [2022-04-28 03:43:23,559 INFO L290 TraceCheckUtils]: 18: Hoare triple {6436#(< main_~z~0 main_~y~0)} assume !(~y~0 > ~z~0); {6329#false} is VALID [2022-04-28 03:43:23,560 INFO L290 TraceCheckUtils]: 17: Hoare triple {6440#(< (+ main_~z~0 1) main_~y~0)} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {6436#(< main_~z~0 main_~y~0)} is VALID [2022-04-28 03:43:23,560 INFO L290 TraceCheckUtils]: 16: Hoare triple {6444#(< (+ main_~z~0 2) main_~y~0)} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {6440#(< (+ main_~z~0 1) main_~y~0)} is VALID [2022-04-28 03:43:23,561 INFO L290 TraceCheckUtils]: 15: Hoare triple {6448#(< (+ main_~z~0 3) main_~y~0)} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {6444#(< (+ main_~z~0 2) main_~y~0)} is VALID [2022-04-28 03:43:23,561 INFO L290 TraceCheckUtils]: 14: Hoare triple {6452#(< (+ main_~z~0 4) main_~y~0)} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {6448#(< (+ main_~z~0 3) main_~y~0)} is VALID [2022-04-28 03:43:23,562 INFO L290 TraceCheckUtils]: 13: Hoare triple {6456#(< (+ 5 main_~z~0) main_~y~0)} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {6452#(< (+ main_~z~0 4) main_~y~0)} is VALID [2022-04-28 03:43:23,562 INFO L290 TraceCheckUtils]: 12: Hoare triple {6460#(< (+ main_~z~0 6) main_~y~0)} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {6456#(< (+ 5 main_~z~0) main_~y~0)} is VALID [2022-04-28 03:43:23,563 INFO L290 TraceCheckUtils]: 11: Hoare triple {6464#(< (+ 7 main_~z~0) main_~y~0)} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {6460#(< (+ main_~z~0 6) main_~y~0)} is VALID [2022-04-28 03:43:23,563 INFO L290 TraceCheckUtils]: 10: Hoare triple {6468#(< (+ main_~z~0 8) main_~y~0)} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {6464#(< (+ 7 main_~z~0) main_~y~0)} is VALID [2022-04-28 03:43:23,564 INFO L290 TraceCheckUtils]: 9: Hoare triple {6468#(< (+ main_~z~0 8) main_~y~0)} [103] L18-1_primed-->L18-1: Formula: (not (< v_main_~x~0_11 1000000)) InVars {main_~x~0=v_main_~x~0_11} OutVars{main_~x~0=v_main_~x~0_11} AuxVars[] AssignedVars[] {6468#(< (+ main_~z~0 8) main_~y~0)} is VALID [2022-04-28 03:43:23,564 INFO L290 TraceCheckUtils]: 8: Hoare triple {6468#(< (+ main_~z~0 8) main_~y~0)} [106] L11-2-->L18-1_primed: Formula: (let ((.cse1 (= v_main_~y~0_287 v_main_~y~0_286)) (.cse2 (= v_main_~x~0_348 v_main_~x~0_347)) (.cse3 (= |v_main_#t~post6_81| |v_main_#t~post6_80|)) (.cse4 (= |v_main_#t~post5_81| |v_main_#t~post5_80|)) (.cse0 (<= 50000 v_main_~x~0_348))) (or (and .cse0 (= (+ v_main_~x~0_348 v_main_~y~0_286) (+ v_main_~x~0_347 v_main_~y~0_287)) (< v_main_~x~0_347 1000001) (< v_main_~x~0_348 v_main_~x~0_347)) (and .cse1 .cse2 .cse3 .cse4) (and .cse1 .cse2 .cse3 .cse4 (or (not .cse0) (not (< v_main_~x~0_348 1000000)))))) InVars {main_~y~0=v_main_~y~0_287, main_#t~post5=|v_main_#t~post5_81|, main_~x~0=v_main_~x~0_348, main_#t~post6=|v_main_#t~post6_81|} OutVars{main_~y~0=v_main_~y~0_286, main_#t~post5=|v_main_#t~post5_80|, main_~x~0=v_main_~x~0_347, main_#t~post6=|v_main_#t~post6_80|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {6468#(< (+ main_~z~0 8) main_~y~0)} is VALID [2022-04-28 03:43:23,565 INFO L290 TraceCheckUtils]: 7: Hoare triple {6468#(< (+ main_~z~0 8) main_~y~0)} [105] L18-1_primed-->L11-2: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {6468#(< (+ main_~z~0 8) main_~y~0)} is VALID [2022-04-28 03:43:23,565 INFO L290 TraceCheckUtils]: 6: Hoare triple {6468#(< (+ main_~z~0 8) main_~y~0)} [104] L11-2-->L18-1_primed: Formula: (let ((.cse0 (= |v_main_#t~post4_77| |v_main_#t~post4_76|)) (.cse1 (= v_main_~x~0_346 v_main_~x~0_345))) (or (and .cse0 .cse1) (and (< v_main_~x~0_345 50001) (< v_main_~x~0_346 v_main_~x~0_345)) (and .cse0 .cse1 (not (< v_main_~x~0_346 50000))))) InVars {main_~x~0=v_main_~x~0_346, main_#t~post4=|v_main_#t~post4_77|} OutVars{main_~x~0=v_main_~x~0_345, main_#t~post4=|v_main_#t~post4_76|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {6468#(< (+ main_~z~0 8) main_~y~0)} is VALID [2022-04-28 03:43:23,565 INFO L290 TraceCheckUtils]: 5: Hoare triple {6328#true} ~x~0 := 0;~y~0 := 50000;~z~0 := 0;~x~0 := 0; {6468#(< (+ main_~z~0 8) main_~y~0)} is VALID [2022-04-28 03:43:23,566 INFO L272 TraceCheckUtils]: 4: Hoare triple {6328#true} call #t~ret9 := main(); {6328#true} is VALID [2022-04-28 03:43:23,566 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {6328#true} {6328#true} #52#return; {6328#true} is VALID [2022-04-28 03:43:23,566 INFO L290 TraceCheckUtils]: 2: Hoare triple {6328#true} assume true; {6328#true} is VALID [2022-04-28 03:43:23,566 INFO L290 TraceCheckUtils]: 1: Hoare triple {6328#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(17, 2);call #Ultimate.allocInit(12, 3); {6328#true} is VALID [2022-04-28 03:43:23,566 INFO L272 TraceCheckUtils]: 0: Hoare triple {6328#true} call ULTIMATE.init(); {6328#true} is VALID [2022-04-28 03:43:23,566 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-04-28 03:43:23,566 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1154611111] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 03:43:23,566 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 03:43:23,566 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 11, 11] total 33 [2022-04-28 03:43:24,259 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 03:43:24,259 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [794893650] [2022-04-28 03:43:24,259 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [794893650] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 03:43:24,259 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 03:43:24,260 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [30] imperfect sequences [] total 30 [2022-04-28 03:43:24,260 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [862113037] [2022-04-28 03:43:24,260 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 03:43:24,260 INFO L78 Accepts]: Start accepts. Automaton has has 30 states, 30 states have (on average 1.6666666666666667) internal successors, (50), 29 states have internal predecessors, (50), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 54 [2022-04-28 03:43:24,260 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 03:43:24,260 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 30 states, 30 states have (on average 1.6666666666666667) internal successors, (50), 29 states have internal predecessors, (50), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:43:24,302 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 54 edges. 54 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 03:43:24,302 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2022-04-28 03:43:24,303 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 03:43:24,303 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2022-04-28 03:43:24,304 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=817, Invalid=1733, Unknown=0, NotChecked=0, Total=2550 [2022-04-28 03:43:24,304 INFO L87 Difference]: Start difference. First operand 55 states and 58 transitions. Second operand has 30 states, 30 states have (on average 1.6666666666666667) internal successors, (50), 29 states have internal predecessors, (50), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:43:26,414 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:43:26,414 INFO L93 Difference]: Finished difference Result 136 states and 146 transitions. [2022-04-28 03:43:26,414 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2022-04-28 03:43:26,414 INFO L78 Accepts]: Start accepts. Automaton has has 30 states, 30 states have (on average 1.6666666666666667) internal successors, (50), 29 states have internal predecessors, (50), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 54 [2022-04-28 03:43:26,415 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 03:43:26,415 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30 states, 30 states have (on average 1.6666666666666667) internal successors, (50), 29 states have internal predecessors, (50), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:43:26,416 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 66 transitions. [2022-04-28 03:43:26,416 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30 states, 30 states have (on average 1.6666666666666667) internal successors, (50), 29 states have internal predecessors, (50), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:43:26,416 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 66 transitions. [2022-04-28 03:43:26,417 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 21 states and 66 transitions. [2022-04-28 03:43:26,477 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 66 edges. 66 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 03:43:26,479 INFO L225 Difference]: With dead ends: 136 [2022-04-28 03:43:26,479 INFO L226 Difference]: Without dead ends: 89 [2022-04-28 03:43:26,483 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 119 GetRequests, 50 SyntacticMatches, 2 SemanticMatches, 67 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1135 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=1235, Invalid=3457, Unknown=0, NotChecked=0, Total=4692 [2022-04-28 03:43:26,484 INFO L413 NwaCegarLoop]: 13 mSDtfsCounter, 28 mSDsluCounter, 107 mSDsCounter, 0 mSdLazyCounter, 945 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 28 SdHoareTripleChecker+Valid, 120 SdHoareTripleChecker+Invalid, 969 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 945 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2022-04-28 03:43:26,484 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [28 Valid, 120 Invalid, 969 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 945 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2022-04-28 03:43:26,485 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2022-04-28 03:43:26,664 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 89. [2022-04-28 03:43:26,664 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 03:43:26,665 INFO L82 GeneralOperation]: Start isEquivalent. First operand 89 states. Second operand has 89 states, 84 states have (on average 1.0595238095238095) internal successors, (89), 84 states have internal predecessors, (89), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:43:26,665 INFO L74 IsIncluded]: Start isIncluded. First operand 89 states. Second operand has 89 states, 84 states have (on average 1.0595238095238095) internal successors, (89), 84 states have internal predecessors, (89), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:43:26,665 INFO L87 Difference]: Start difference. First operand 89 states. Second operand has 89 states, 84 states have (on average 1.0595238095238095) internal successors, (89), 84 states have internal predecessors, (89), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:43:26,666 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:43:26,667 INFO L93 Difference]: Finished difference Result 89 states and 93 transitions. [2022-04-28 03:43:26,667 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 93 transitions. [2022-04-28 03:43:26,667 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:43:26,667 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:43:26,667 INFO L74 IsIncluded]: Start isIncluded. First operand has 89 states, 84 states have (on average 1.0595238095238095) internal successors, (89), 84 states have internal predecessors, (89), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 89 states. [2022-04-28 03:43:26,667 INFO L87 Difference]: Start difference. First operand has 89 states, 84 states have (on average 1.0595238095238095) internal successors, (89), 84 states have internal predecessors, (89), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 89 states. [2022-04-28 03:43:26,669 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:43:26,669 INFO L93 Difference]: Finished difference Result 89 states and 93 transitions. [2022-04-28 03:43:26,669 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 93 transitions. [2022-04-28 03:43:26,669 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:43:26,669 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:43:26,669 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 03:43:26,669 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 03:43:26,669 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 89 states, 84 states have (on average 1.0595238095238095) internal successors, (89), 84 states have internal predecessors, (89), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:43:26,670 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 93 transitions. [2022-04-28 03:43:26,671 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 93 transitions. Word has length 54 [2022-04-28 03:43:26,671 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 03:43:26,671 INFO L495 AbstractCegarLoop]: Abstraction has 89 states and 93 transitions. [2022-04-28 03:43:26,671 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 30 states, 30 states have (on average 1.6666666666666667) internal successors, (50), 29 states have internal predecessors, (50), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:43:26,671 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 89 states and 93 transitions. [2022-04-28 03:43:26,756 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 93 edges. 93 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 03:43:26,756 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 93 transitions. [2022-04-28 03:43:26,757 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2022-04-28 03:43:26,757 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 03:43:26,757 INFO L195 NwaCegarLoop]: trace histogram [18, 17, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 03:43:26,773 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Ended with exit code 0 [2022-04-28 03:43:26,957 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2022-04-28 03:43:26,958 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 03:43:26,958 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 03:43:26,958 INFO L85 PathProgramCache]: Analyzing trace with hash -913170353, now seen corresponding path program 13 times [2022-04-28 03:43:26,958 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 03:43:26,958 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [136009896] [2022-04-28 03:43:27,072 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 1 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 03:43:31,209 WARN L977 rdanLoopAcceleration]: Unable to prove correctness of quantifier elimination. [2022-04-28 03:43:31,329 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={1=1, 2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 03:43:31,330 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-28 03:43:31,333 INFO L85 PathProgramCache]: Analyzing trace with hash 117331329, now seen corresponding path program 1 times [2022-04-28 03:43:31,333 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 03:43:31,333 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [38809811] [2022-04-28 03:43:31,333 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:43:31,334 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 03:43:31,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:43:31,479 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 03:43:31,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:43:31,485 INFO L290 TraceCheckUtils]: 0: Hoare triple {7197#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(17, 2);call #Ultimate.allocInit(12, 3); {7183#true} is VALID [2022-04-28 03:43:31,485 INFO L290 TraceCheckUtils]: 1: Hoare triple {7183#true} assume true; {7183#true} is VALID [2022-04-28 03:43:31,485 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {7183#true} {7183#true} #52#return; {7183#true} is VALID [2022-04-28 03:43:31,486 INFO L272 TraceCheckUtils]: 0: Hoare triple {7183#true} call ULTIMATE.init(); {7197#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 03:43:31,486 INFO L290 TraceCheckUtils]: 1: Hoare triple {7197#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(17, 2);call #Ultimate.allocInit(12, 3); {7183#true} is VALID [2022-04-28 03:43:31,486 INFO L290 TraceCheckUtils]: 2: Hoare triple {7183#true} assume true; {7183#true} is VALID [2022-04-28 03:43:31,486 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {7183#true} {7183#true} #52#return; {7183#true} is VALID [2022-04-28 03:43:31,486 INFO L272 TraceCheckUtils]: 4: Hoare triple {7183#true} call #t~ret9 := main(); {7183#true} is VALID [2022-04-28 03:43:31,486 INFO L290 TraceCheckUtils]: 5: Hoare triple {7183#true} ~x~0 := 0;~y~0 := 50000;~z~0 := 0;~x~0 := 0; {7188#(and (= main_~z~0 0) (<= 50000 main_~y~0))} is VALID [2022-04-28 03:43:31,487 INFO L290 TraceCheckUtils]: 6: Hoare triple {7188#(and (= main_~z~0 0) (<= 50000 main_~y~0))} [108] L11-2-->L18-1_primed: Formula: (let ((.cse0 (= |v_main_#t~post4_83| |v_main_#t~post4_82|)) (.cse1 (= v_main_~x~0_387 v_main_~x~0_386))) (or (and .cse0 .cse1) (and (< v_main_~x~0_386 50001) (< v_main_~x~0_387 v_main_~x~0_386)) (and .cse0 .cse1 (<= 50000 v_main_~x~0_387)))) InVars {main_~x~0=v_main_~x~0_387, main_#t~post4=|v_main_#t~post4_83|} OutVars{main_~x~0=v_main_~x~0_386, main_#t~post4=|v_main_#t~post4_82|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {7188#(and (= main_~z~0 0) (<= 50000 main_~y~0))} is VALID [2022-04-28 03:43:31,487 INFO L290 TraceCheckUtils]: 7: Hoare triple {7188#(and (= main_~z~0 0) (<= 50000 main_~y~0))} [109] L18-1_primed-->L11-2: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {7188#(and (= main_~z~0 0) (<= 50000 main_~y~0))} is VALID [2022-04-28 03:43:31,488 INFO L290 TraceCheckUtils]: 8: Hoare triple {7188#(and (= main_~z~0 0) (<= 50000 main_~y~0))} [110] L11-2-->L18-1_primed: Formula: (let ((.cse0 (= v_main_~y~0_328 v_main_~y~0_327)) (.cse1 (= |v_main_#t~post6_88| |v_main_#t~post6_87|)) (.cse2 (= v_main_~x~0_389 v_main_~x~0_388)) (.cse3 (= |v_main_#t~post5_88| |v_main_#t~post5_87|)) (.cse4 (<= 50000 v_main_~x~0_389))) (or (and .cse0 .cse1 .cse2 .cse3) (and .cse0 .cse1 (or (not .cse4) (not (< v_main_~x~0_389 1000000))) .cse2 .cse3) (let ((.cse5 (+ v_main_~x~0_389 v_main_~y~0_327))) (and (< .cse5 (+ v_main_~y~0_328 1000001)) .cse4 (< v_main_~y~0_328 v_main_~y~0_327) (= .cse5 (+ v_main_~x~0_388 v_main_~y~0_328)))))) InVars {main_~y~0=v_main_~y~0_328, main_#t~post5=|v_main_#t~post5_88|, main_~x~0=v_main_~x~0_389, main_#t~post6=|v_main_#t~post6_88|} OutVars{main_~y~0=v_main_~y~0_327, main_#t~post5=|v_main_#t~post5_87|, main_~x~0=v_main_~x~0_388, main_#t~post6=|v_main_#t~post6_87|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {7188#(and (= main_~z~0 0) (<= 50000 main_~y~0))} is VALID [2022-04-28 03:43:31,488 INFO L290 TraceCheckUtils]: 9: Hoare triple {7188#(and (= main_~z~0 0) (<= 50000 main_~y~0))} [107] L18-1_primed-->L18-1: Formula: (not (< v_main_~x~0_11 1000000)) InVars {main_~x~0=v_main_~x~0_11} OutVars{main_~x~0=v_main_~x~0_11} AuxVars[] AssignedVars[] {7188#(and (= main_~z~0 0) (<= 50000 main_~y~0))} is VALID [2022-04-28 03:43:31,489 INFO L290 TraceCheckUtils]: 10: Hoare triple {7188#(and (= main_~z~0 0) (<= 50000 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {7189#(and (= main_~z~0 0) (<= 49999 main_~y~0))} is VALID [2022-04-28 03:43:31,489 INFO L290 TraceCheckUtils]: 11: Hoare triple {7189#(and (= main_~z~0 0) (<= 49999 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {7190#(and (<= 49998 main_~y~0) (= main_~z~0 0))} is VALID [2022-04-28 03:43:31,490 INFO L290 TraceCheckUtils]: 12: Hoare triple {7190#(and (<= 49998 main_~y~0) (= main_~z~0 0))} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {7191#(and (= main_~z~0 0) (<= 49997 main_~y~0))} is VALID [2022-04-28 03:43:31,490 INFO L290 TraceCheckUtils]: 13: Hoare triple {7191#(and (= main_~z~0 0) (<= 49997 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {7192#(and (= main_~z~0 0) (<= 49996 main_~y~0))} is VALID [2022-04-28 03:43:31,491 INFO L290 TraceCheckUtils]: 14: Hoare triple {7192#(and (= main_~z~0 0) (<= 49996 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {7193#(and (= main_~z~0 0) (<= 49995 main_~y~0))} is VALID [2022-04-28 03:43:31,491 INFO L290 TraceCheckUtils]: 15: Hoare triple {7193#(and (= main_~z~0 0) (<= 49995 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {7194#(and (= main_~z~0 0) (<= 49994 main_~y~0))} is VALID [2022-04-28 03:43:31,492 INFO L290 TraceCheckUtils]: 16: Hoare triple {7194#(and (= main_~z~0 0) (<= 49994 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {7195#(and (= main_~z~0 0) (<= 49993 main_~y~0))} is VALID [2022-04-28 03:43:31,492 INFO L290 TraceCheckUtils]: 17: Hoare triple {7195#(and (= main_~z~0 0) (<= 49993 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {7196#(and (= main_~z~0 0) (<= 49992 main_~y~0))} is VALID [2022-04-28 03:43:31,493 INFO L290 TraceCheckUtils]: 18: Hoare triple {7196#(and (= main_~z~0 0) (<= 49992 main_~y~0))} assume !(~y~0 > ~z~0); {7184#false} is VALID [2022-04-28 03:43:31,493 INFO L272 TraceCheckUtils]: 19: Hoare triple {7184#false} call __VERIFIER_assert((if ~x~0 == ~z~0 then 1 else 0)); {7184#false} is VALID [2022-04-28 03:43:31,493 INFO L290 TraceCheckUtils]: 20: Hoare triple {7184#false} ~cond := #in~cond; {7184#false} is VALID [2022-04-28 03:43:31,493 INFO L290 TraceCheckUtils]: 21: Hoare triple {7184#false} assume 0 == ~cond; {7184#false} is VALID [2022-04-28 03:43:31,493 INFO L290 TraceCheckUtils]: 22: Hoare triple {7184#false} assume !false; {7184#false} is VALID [2022-04-28 03:43:31,493 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-04-28 03:43:31,493 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 03:43:31,493 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [38809811] [2022-04-28 03:43:31,493 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [38809811] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 03:43:31,493 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1534466320] [2022-04-28 03:43:31,493 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:43:31,493 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 03:43:31,493 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 03:43:31,494 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 03:43:31,495 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2022-04-28 03:43:31,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:43:31,525 INFO L263 TraceCheckSpWp]: Trace formula consists of 99 conjuncts, 12 conjunts are in the unsatisfiable core [2022-04-28 03:43:31,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:43:31,537 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 03:43:32,021 INFO L272 TraceCheckUtils]: 0: Hoare triple {7183#true} call ULTIMATE.init(); {7183#true} is VALID [2022-04-28 03:43:32,021 INFO L290 TraceCheckUtils]: 1: Hoare triple {7183#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(17, 2);call #Ultimate.allocInit(12, 3); {7183#true} is VALID [2022-04-28 03:43:32,021 INFO L290 TraceCheckUtils]: 2: Hoare triple {7183#true} assume true; {7183#true} is VALID [2022-04-28 03:43:32,021 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {7183#true} {7183#true} #52#return; {7183#true} is VALID [2022-04-28 03:43:32,021 INFO L272 TraceCheckUtils]: 4: Hoare triple {7183#true} call #t~ret9 := main(); {7183#true} is VALID [2022-04-28 03:43:32,021 INFO L290 TraceCheckUtils]: 5: Hoare triple {7183#true} ~x~0 := 0;~y~0 := 50000;~z~0 := 0;~x~0 := 0; {7216#(and (<= main_~z~0 0) (<= 50000 main_~y~0))} is VALID [2022-04-28 03:43:32,022 INFO L290 TraceCheckUtils]: 6: Hoare triple {7216#(and (<= main_~z~0 0) (<= 50000 main_~y~0))} [108] L11-2-->L18-1_primed: Formula: (let ((.cse0 (= |v_main_#t~post4_83| |v_main_#t~post4_82|)) (.cse1 (= v_main_~x~0_387 v_main_~x~0_386))) (or (and .cse0 .cse1) (and (< v_main_~x~0_386 50001) (< v_main_~x~0_387 v_main_~x~0_386)) (and .cse0 .cse1 (<= 50000 v_main_~x~0_387)))) InVars {main_~x~0=v_main_~x~0_387, main_#t~post4=|v_main_#t~post4_83|} OutVars{main_~x~0=v_main_~x~0_386, main_#t~post4=|v_main_#t~post4_82|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {7216#(and (<= main_~z~0 0) (<= 50000 main_~y~0))} is VALID [2022-04-28 03:43:32,022 INFO L290 TraceCheckUtils]: 7: Hoare triple {7216#(and (<= main_~z~0 0) (<= 50000 main_~y~0))} [109] L18-1_primed-->L11-2: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {7216#(and (<= main_~z~0 0) (<= 50000 main_~y~0))} is VALID [2022-04-28 03:43:32,023 INFO L290 TraceCheckUtils]: 8: Hoare triple {7216#(and (<= main_~z~0 0) (<= 50000 main_~y~0))} [110] L11-2-->L18-1_primed: Formula: (let ((.cse0 (= v_main_~y~0_328 v_main_~y~0_327)) (.cse1 (= |v_main_#t~post6_88| |v_main_#t~post6_87|)) (.cse2 (= v_main_~x~0_389 v_main_~x~0_388)) (.cse3 (= |v_main_#t~post5_88| |v_main_#t~post5_87|)) (.cse4 (<= 50000 v_main_~x~0_389))) (or (and .cse0 .cse1 .cse2 .cse3) (and .cse0 .cse1 (or (not .cse4) (not (< v_main_~x~0_389 1000000))) .cse2 .cse3) (let ((.cse5 (+ v_main_~x~0_389 v_main_~y~0_327))) (and (< .cse5 (+ v_main_~y~0_328 1000001)) .cse4 (< v_main_~y~0_328 v_main_~y~0_327) (= .cse5 (+ v_main_~x~0_388 v_main_~y~0_328)))))) InVars {main_~y~0=v_main_~y~0_328, main_#t~post5=|v_main_#t~post5_88|, main_~x~0=v_main_~x~0_389, main_#t~post6=|v_main_#t~post6_88|} OutVars{main_~y~0=v_main_~y~0_327, main_#t~post5=|v_main_#t~post5_87|, main_~x~0=v_main_~x~0_388, main_#t~post6=|v_main_#t~post6_87|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {7216#(and (<= main_~z~0 0) (<= 50000 main_~y~0))} is VALID [2022-04-28 03:43:32,023 INFO L290 TraceCheckUtils]: 9: Hoare triple {7216#(and (<= main_~z~0 0) (<= 50000 main_~y~0))} [107] L18-1_primed-->L18-1: Formula: (not (< v_main_~x~0_11 1000000)) InVars {main_~x~0=v_main_~x~0_11} OutVars{main_~x~0=v_main_~x~0_11} AuxVars[] AssignedVars[] {7216#(and (<= main_~z~0 0) (<= 50000 main_~y~0))} is VALID [2022-04-28 03:43:32,024 INFO L290 TraceCheckUtils]: 10: Hoare triple {7216#(and (<= main_~z~0 0) (<= 50000 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {7232#(and (<= main_~z~0 0) (<= 49999 main_~y~0))} is VALID [2022-04-28 03:43:32,024 INFO L290 TraceCheckUtils]: 11: Hoare triple {7232#(and (<= main_~z~0 0) (<= 49999 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {7236#(and (<= main_~z~0 0) (<= 49998 main_~y~0))} is VALID [2022-04-28 03:43:32,025 INFO L290 TraceCheckUtils]: 12: Hoare triple {7236#(and (<= main_~z~0 0) (<= 49998 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {7240#(and (<= main_~z~0 0) (<= 49997 main_~y~0))} is VALID [2022-04-28 03:43:32,025 INFO L290 TraceCheckUtils]: 13: Hoare triple {7240#(and (<= main_~z~0 0) (<= 49997 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {7244#(and (<= main_~z~0 0) (<= 49996 main_~y~0))} is VALID [2022-04-28 03:43:32,026 INFO L290 TraceCheckUtils]: 14: Hoare triple {7244#(and (<= main_~z~0 0) (<= 49996 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {7248#(and (<= main_~z~0 0) (<= 49995 main_~y~0))} is VALID [2022-04-28 03:43:32,026 INFO L290 TraceCheckUtils]: 15: Hoare triple {7248#(and (<= main_~z~0 0) (<= 49995 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {7252#(and (<= main_~z~0 0) (<= 49994 main_~y~0))} is VALID [2022-04-28 03:43:32,027 INFO L290 TraceCheckUtils]: 16: Hoare triple {7252#(and (<= main_~z~0 0) (<= 49994 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {7256#(and (<= main_~z~0 0) (<= 49993 main_~y~0))} is VALID [2022-04-28 03:43:32,027 INFO L290 TraceCheckUtils]: 17: Hoare triple {7256#(and (<= main_~z~0 0) (<= 49993 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {7260#(and (<= main_~z~0 0) (<= 49992 main_~y~0))} is VALID [2022-04-28 03:43:32,028 INFO L290 TraceCheckUtils]: 18: Hoare triple {7260#(and (<= main_~z~0 0) (<= 49992 main_~y~0))} assume !(~y~0 > ~z~0); {7184#false} is VALID [2022-04-28 03:43:32,028 INFO L272 TraceCheckUtils]: 19: Hoare triple {7184#false} call __VERIFIER_assert((if ~x~0 == ~z~0 then 1 else 0)); {7184#false} is VALID [2022-04-28 03:43:32,028 INFO L290 TraceCheckUtils]: 20: Hoare triple {7184#false} ~cond := #in~cond; {7184#false} is VALID [2022-04-28 03:43:32,028 INFO L290 TraceCheckUtils]: 21: Hoare triple {7184#false} assume 0 == ~cond; {7184#false} is VALID [2022-04-28 03:43:32,028 INFO L290 TraceCheckUtils]: 22: Hoare triple {7184#false} assume !false; {7184#false} is VALID [2022-04-28 03:43:32,028 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-04-28 03:43:32,028 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 03:43:32,465 INFO L290 TraceCheckUtils]: 22: Hoare triple {7184#false} assume !false; {7184#false} is VALID [2022-04-28 03:43:32,465 INFO L290 TraceCheckUtils]: 21: Hoare triple {7184#false} assume 0 == ~cond; {7184#false} is VALID [2022-04-28 03:43:32,465 INFO L290 TraceCheckUtils]: 20: Hoare triple {7184#false} ~cond := #in~cond; {7184#false} is VALID [2022-04-28 03:43:32,465 INFO L272 TraceCheckUtils]: 19: Hoare triple {7184#false} call __VERIFIER_assert((if ~x~0 == ~z~0 then 1 else 0)); {7184#false} is VALID [2022-04-28 03:43:32,466 INFO L290 TraceCheckUtils]: 18: Hoare triple {7288#(< main_~z~0 main_~y~0)} assume !(~y~0 > ~z~0); {7184#false} is VALID [2022-04-28 03:43:32,471 INFO L290 TraceCheckUtils]: 17: Hoare triple {7292#(< (+ main_~z~0 1) main_~y~0)} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {7288#(< main_~z~0 main_~y~0)} is VALID [2022-04-28 03:43:32,472 INFO L290 TraceCheckUtils]: 16: Hoare triple {7296#(< (+ main_~z~0 2) main_~y~0)} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {7292#(< (+ main_~z~0 1) main_~y~0)} is VALID [2022-04-28 03:43:32,472 INFO L290 TraceCheckUtils]: 15: Hoare triple {7300#(< (+ main_~z~0 3) main_~y~0)} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {7296#(< (+ main_~z~0 2) main_~y~0)} is VALID [2022-04-28 03:43:32,473 INFO L290 TraceCheckUtils]: 14: Hoare triple {7304#(< (+ main_~z~0 4) main_~y~0)} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {7300#(< (+ main_~z~0 3) main_~y~0)} is VALID [2022-04-28 03:43:32,473 INFO L290 TraceCheckUtils]: 13: Hoare triple {7308#(< (+ 5 main_~z~0) main_~y~0)} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {7304#(< (+ main_~z~0 4) main_~y~0)} is VALID [2022-04-28 03:43:32,474 INFO L290 TraceCheckUtils]: 12: Hoare triple {7312#(< (+ main_~z~0 6) main_~y~0)} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {7308#(< (+ 5 main_~z~0) main_~y~0)} is VALID [2022-04-28 03:43:32,475 INFO L290 TraceCheckUtils]: 11: Hoare triple {7316#(< (+ 7 main_~z~0) main_~y~0)} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {7312#(< (+ main_~z~0 6) main_~y~0)} is VALID [2022-04-28 03:43:32,475 INFO L290 TraceCheckUtils]: 10: Hoare triple {7320#(< (+ main_~z~0 8) main_~y~0)} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {7316#(< (+ 7 main_~z~0) main_~y~0)} is VALID [2022-04-28 03:43:32,476 INFO L290 TraceCheckUtils]: 9: Hoare triple {7320#(< (+ main_~z~0 8) main_~y~0)} [107] L18-1_primed-->L18-1: Formula: (not (< v_main_~x~0_11 1000000)) InVars {main_~x~0=v_main_~x~0_11} OutVars{main_~x~0=v_main_~x~0_11} AuxVars[] AssignedVars[] {7320#(< (+ main_~z~0 8) main_~y~0)} is VALID [2022-04-28 03:43:32,477 INFO L290 TraceCheckUtils]: 8: Hoare triple {7320#(< (+ main_~z~0 8) main_~y~0)} [110] L11-2-->L18-1_primed: Formula: (let ((.cse0 (= v_main_~y~0_328 v_main_~y~0_327)) (.cse1 (= |v_main_#t~post6_88| |v_main_#t~post6_87|)) (.cse2 (= v_main_~x~0_389 v_main_~x~0_388)) (.cse3 (= |v_main_#t~post5_88| |v_main_#t~post5_87|)) (.cse4 (<= 50000 v_main_~x~0_389))) (or (and .cse0 .cse1 .cse2 .cse3) (and .cse0 .cse1 (or (not .cse4) (not (< v_main_~x~0_389 1000000))) .cse2 .cse3) (let ((.cse5 (+ v_main_~x~0_389 v_main_~y~0_327))) (and (< .cse5 (+ v_main_~y~0_328 1000001)) .cse4 (< v_main_~y~0_328 v_main_~y~0_327) (= .cse5 (+ v_main_~x~0_388 v_main_~y~0_328)))))) InVars {main_~y~0=v_main_~y~0_328, main_#t~post5=|v_main_#t~post5_88|, main_~x~0=v_main_~x~0_389, main_#t~post6=|v_main_#t~post6_88|} OutVars{main_~y~0=v_main_~y~0_327, main_#t~post5=|v_main_#t~post5_87|, main_~x~0=v_main_~x~0_388, main_#t~post6=|v_main_#t~post6_87|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {7320#(< (+ main_~z~0 8) main_~y~0)} is VALID [2022-04-28 03:43:32,477 INFO L290 TraceCheckUtils]: 7: Hoare triple {7320#(< (+ main_~z~0 8) main_~y~0)} [109] L18-1_primed-->L11-2: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {7320#(< (+ main_~z~0 8) main_~y~0)} is VALID [2022-04-28 03:43:32,477 INFO L290 TraceCheckUtils]: 6: Hoare triple {7320#(< (+ main_~z~0 8) main_~y~0)} [108] L11-2-->L18-1_primed: Formula: (let ((.cse0 (= |v_main_#t~post4_83| |v_main_#t~post4_82|)) (.cse1 (= v_main_~x~0_387 v_main_~x~0_386))) (or (and .cse0 .cse1) (and (< v_main_~x~0_386 50001) (< v_main_~x~0_387 v_main_~x~0_386)) (and .cse0 .cse1 (<= 50000 v_main_~x~0_387)))) InVars {main_~x~0=v_main_~x~0_387, main_#t~post4=|v_main_#t~post4_83|} OutVars{main_~x~0=v_main_~x~0_386, main_#t~post4=|v_main_#t~post4_82|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {7320#(< (+ main_~z~0 8) main_~y~0)} is VALID [2022-04-28 03:43:32,478 INFO L290 TraceCheckUtils]: 5: Hoare triple {7183#true} ~x~0 := 0;~y~0 := 50000;~z~0 := 0;~x~0 := 0; {7320#(< (+ main_~z~0 8) main_~y~0)} is VALID [2022-04-28 03:43:32,478 INFO L272 TraceCheckUtils]: 4: Hoare triple {7183#true} call #t~ret9 := main(); {7183#true} is VALID [2022-04-28 03:43:32,478 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {7183#true} {7183#true} #52#return; {7183#true} is VALID [2022-04-28 03:43:32,478 INFO L290 TraceCheckUtils]: 2: Hoare triple {7183#true} assume true; {7183#true} is VALID [2022-04-28 03:43:32,478 INFO L290 TraceCheckUtils]: 1: Hoare triple {7183#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(17, 2);call #Ultimate.allocInit(12, 3); {7183#true} is VALID [2022-04-28 03:43:32,478 INFO L272 TraceCheckUtils]: 0: Hoare triple {7183#true} call ULTIMATE.init(); {7183#true} is VALID [2022-04-28 03:43:32,479 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-04-28 03:43:32,479 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1534466320] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 03:43:32,479 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 03:43:32,479 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 11, 11] total 30 [2022-04-28 03:43:33,081 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 03:43:33,081 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [136009896] [2022-04-28 03:43:33,081 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [136009896] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 03:43:33,081 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 03:43:33,081 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [31] imperfect sequences [] total 31 [2022-04-28 03:43:33,081 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [790656996] [2022-04-28 03:43:33,081 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 03:43:33,082 INFO L78 Accepts]: Start accepts. Automaton has has 31 states, 31 states have (on average 1.6774193548387097) internal successors, (52), 30 states have internal predecessors, (52), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 56 [2022-04-28 03:43:33,082 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 03:43:33,082 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 31 states, 31 states have (on average 1.6774193548387097) internal successors, (52), 30 states have internal predecessors, (52), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:43:33,123 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 56 edges. 56 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 03:43:33,123 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 31 states [2022-04-28 03:43:33,123 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 03:43:33,123 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2022-04-28 03:43:33,124 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=941, Invalid=1411, Unknown=0, NotChecked=0, Total=2352 [2022-04-28 03:43:33,124 INFO L87 Difference]: Start difference. First operand 89 states and 93 transitions. Second operand has 31 states, 31 states have (on average 1.6774193548387097) internal successors, (52), 30 states have internal predecessors, (52), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:43:35,049 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:43:35,050 INFO L93 Difference]: Finished difference Result 143 states and 157 transitions. [2022-04-28 03:43:35,050 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2022-04-28 03:43:35,050 INFO L78 Accepts]: Start accepts. Automaton has has 31 states, 31 states have (on average 1.6774193548387097) internal successors, (52), 30 states have internal predecessors, (52), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 56 [2022-04-28 03:43:35,050 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 03:43:35,050 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31 states, 31 states have (on average 1.6774193548387097) internal successors, (52), 30 states have internal predecessors, (52), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:43:35,051 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 80 transitions. [2022-04-28 03:43:35,052 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31 states, 31 states have (on average 1.6774193548387097) internal successors, (52), 30 states have internal predecessors, (52), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:43:35,053 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 80 transitions. [2022-04-28 03:43:35,053 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 31 states and 80 transitions. [2022-04-28 03:43:35,140 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 80 edges. 80 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 03:43:35,141 INFO L225 Difference]: With dead ends: 143 [2022-04-28 03:43:35,141 INFO L226 Difference]: Without dead ends: 96 [2022-04-28 03:43:35,143 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 129 GetRequests, 52 SyntacticMatches, 2 SemanticMatches, 75 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1624 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=1971, Invalid=3881, Unknown=0, NotChecked=0, Total=5852 [2022-04-28 03:43:35,143 INFO L413 NwaCegarLoop]: 12 mSDtfsCounter, 69 mSDsluCounter, 27 mSDsCounter, 0 mSdLazyCounter, 731 mSolverCounterSat, 82 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 69 SdHoareTripleChecker+Valid, 39 SdHoareTripleChecker+Invalid, 813 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 82 IncrementalHoareTripleChecker+Valid, 731 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-04-28 03:43:35,143 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [69 Valid, 39 Invalid, 813 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [82 Valid, 731 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-04-28 03:43:35,143 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2022-04-28 03:43:35,242 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 62. [2022-04-28 03:43:35,242 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 03:43:35,243 INFO L82 GeneralOperation]: Start isEquivalent. First operand 96 states. Second operand has 62 states, 57 states have (on average 1.0701754385964912) internal successors, (61), 57 states have internal predecessors, (61), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:43:35,243 INFO L74 IsIncluded]: Start isIncluded. First operand 96 states. Second operand has 62 states, 57 states have (on average 1.0701754385964912) internal successors, (61), 57 states have internal predecessors, (61), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:43:35,243 INFO L87 Difference]: Start difference. First operand 96 states. Second operand has 62 states, 57 states have (on average 1.0701754385964912) internal successors, (61), 57 states have internal predecessors, (61), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:43:35,245 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:43:35,245 INFO L93 Difference]: Finished difference Result 96 states and 100 transitions. [2022-04-28 03:43:35,245 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 100 transitions. [2022-04-28 03:43:35,245 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:43:35,245 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:43:35,245 INFO L74 IsIncluded]: Start isIncluded. First operand has 62 states, 57 states have (on average 1.0701754385964912) internal successors, (61), 57 states have internal predecessors, (61), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 96 states. [2022-04-28 03:43:35,245 INFO L87 Difference]: Start difference. First operand has 62 states, 57 states have (on average 1.0701754385964912) internal successors, (61), 57 states have internal predecessors, (61), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 96 states. [2022-04-28 03:43:35,247 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:43:35,247 INFO L93 Difference]: Finished difference Result 96 states and 100 transitions. [2022-04-28 03:43:35,247 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 100 transitions. [2022-04-28 03:43:35,247 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:43:35,247 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:43:35,247 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 03:43:35,247 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 03:43:35,247 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 62 states, 57 states have (on average 1.0701754385964912) internal successors, (61), 57 states have internal predecessors, (61), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:43:35,248 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 65 transitions. [2022-04-28 03:43:35,248 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 65 transitions. Word has length 56 [2022-04-28 03:43:35,248 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 03:43:35,248 INFO L495 AbstractCegarLoop]: Abstraction has 62 states and 65 transitions. [2022-04-28 03:43:35,249 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 31 states, 31 states have (on average 1.6774193548387097) internal successors, (52), 30 states have internal predecessors, (52), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:43:35,249 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 62 states and 65 transitions. [2022-04-28 03:43:35,313 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 65 edges. 65 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 03:43:35,314 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 65 transitions. [2022-04-28 03:43:35,314 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2022-04-28 03:43:35,314 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 03:43:35,314 INFO L195 NwaCegarLoop]: trace histogram [20, 19, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 03:43:35,330 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Forceful destruction successful, exit code 0 [2022-04-28 03:43:35,514 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2022-04-28 03:43:35,515 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 03:43:35,515 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 03:43:35,515 INFO L85 PathProgramCache]: Analyzing trace with hash 2122774122, now seen corresponding path program 14 times [2022-04-28 03:43:35,515 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 03:43:35,515 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1787871583] [2022-04-28 03:43:39,585 WARN L977 rdanLoopAcceleration]: Unable to prove correctness of quantifier elimination. [2022-04-28 03:43:39,632 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 1 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 03:43:39,878 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={1=1, 2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 03:43:39,879 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-28 03:43:39,881 INFO L85 PathProgramCache]: Analyzing trace with hash 495894274, now seen corresponding path program 1 times [2022-04-28 03:43:39,881 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 03:43:39,882 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [228044172] [2022-04-28 03:43:39,882 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:43:39,882 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 03:43:39,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:43:40,071 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 03:43:40,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:43:40,087 INFO L290 TraceCheckUtils]: 0: Hoare triple {8048#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(17, 2);call #Ultimate.allocInit(12, 3); {8030#true} is VALID [2022-04-28 03:43:40,088 INFO L290 TraceCheckUtils]: 1: Hoare triple {8030#true} assume true; {8030#true} is VALID [2022-04-28 03:43:40,088 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {8030#true} {8030#true} #52#return; {8030#true} is VALID [2022-04-28 03:43:40,088 INFO L272 TraceCheckUtils]: 0: Hoare triple {8030#true} call ULTIMATE.init(); {8048#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 03:43:40,088 INFO L290 TraceCheckUtils]: 1: Hoare triple {8048#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(17, 2);call #Ultimate.allocInit(12, 3); {8030#true} is VALID [2022-04-28 03:43:40,088 INFO L290 TraceCheckUtils]: 2: Hoare triple {8030#true} assume true; {8030#true} is VALID [2022-04-28 03:43:40,088 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {8030#true} {8030#true} #52#return; {8030#true} is VALID [2022-04-28 03:43:40,089 INFO L272 TraceCheckUtils]: 4: Hoare triple {8030#true} call #t~ret9 := main(); {8030#true} is VALID [2022-04-28 03:43:40,089 INFO L290 TraceCheckUtils]: 5: Hoare triple {8030#true} ~x~0 := 0;~y~0 := 50000;~z~0 := 0;~x~0 := 0; {8035#(and (= main_~z~0 0) (= main_~x~0 0) (<= 50000 main_~y~0))} is VALID [2022-04-28 03:43:40,090 INFO L290 TraceCheckUtils]: 6: Hoare triple {8035#(and (= main_~z~0 0) (= main_~x~0 0) (<= 50000 main_~y~0))} [112] L11-2-->L18-1_primed: Formula: (let ((.cse0 (= v_main_~x~0_429 v_main_~x~0_428)) (.cse1 (= |v_main_#t~post4_89| |v_main_#t~post4_88|))) (or (and (< v_main_~x~0_429 v_main_~x~0_428) (< v_main_~x~0_428 50001)) (and .cse0 .cse1) (and (<= 50000 v_main_~x~0_429) .cse0 .cse1))) InVars {main_~x~0=v_main_~x~0_429, main_#t~post4=|v_main_#t~post4_89|} OutVars{main_~x~0=v_main_~x~0_428, main_#t~post4=|v_main_#t~post4_88|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {8036#(and (= main_~z~0 0) (<= main_~x~0 50000) (<= 50000 main_~y~0))} is VALID [2022-04-28 03:43:40,090 INFO L290 TraceCheckUtils]: 7: Hoare triple {8036#(and (= main_~z~0 0) (<= main_~x~0 50000) (<= 50000 main_~y~0))} [113] L18-1_primed-->L11-2: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {8036#(and (= main_~z~0 0) (<= main_~x~0 50000) (<= 50000 main_~y~0))} is VALID [2022-04-28 03:43:40,091 INFO L290 TraceCheckUtils]: 8: Hoare triple {8036#(and (= main_~z~0 0) (<= main_~x~0 50000) (<= 50000 main_~y~0))} [114] L11-2-->L18-1_primed: Formula: (let ((.cse0 (= |v_main_#t~post5_95| |v_main_#t~post5_94|)) (.cse1 (= |v_main_#t~post6_95| |v_main_#t~post6_94|)) (.cse2 (= v_main_~x~0_431 v_main_~x~0_430)) (.cse3 (<= 50000 v_main_~x~0_431))) (or (and .cse0 .cse1 .cse2 (= v_main_~y~0_370 v_main_~y~0_369)) (and .cse0 (= v_main_~y~0_369 v_main_~y~0_370) (or (not .cse3) (not (< v_main_~x~0_431 1000000))) .cse1 .cse2) (let ((.cse4 (+ v_main_~x~0_431 v_main_~y~0_369))) (and .cse3 (< .cse4 (+ v_main_~y~0_370 1000001)) (= .cse4 (+ v_main_~x~0_430 v_main_~y~0_370)) (< v_main_~y~0_370 v_main_~y~0_369))))) InVars {main_~y~0=v_main_~y~0_370, main_#t~post5=|v_main_#t~post5_95|, main_~x~0=v_main_~x~0_431, main_#t~post6=|v_main_#t~post6_95|} OutVars{main_~y~0=v_main_~y~0_369, main_#t~post5=|v_main_#t~post5_94|, main_~x~0=v_main_~x~0_430, main_#t~post6=|v_main_#t~post6_94|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {8037#(or (<= main_~x~0 50000) (and (= main_~z~0 0) (<= 50001 main_~y~0)))} is VALID [2022-04-28 03:43:40,092 INFO L290 TraceCheckUtils]: 9: Hoare triple {8037#(or (<= main_~x~0 50000) (and (= main_~z~0 0) (<= 50001 main_~y~0)))} [111] L18-1_primed-->L18-1: Formula: (not (< v_main_~x~0_11 1000000)) InVars {main_~x~0=v_main_~x~0_11} OutVars{main_~x~0=v_main_~x~0_11} AuxVars[] AssignedVars[] {8038#(and (= main_~z~0 0) (<= 50001 main_~y~0))} is VALID [2022-04-28 03:43:40,092 INFO L290 TraceCheckUtils]: 10: Hoare triple {8038#(and (= main_~z~0 0) (<= 50001 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {8039#(and (= main_~z~0 0) (<= 50000 main_~y~0))} is VALID [2022-04-28 03:43:40,093 INFO L290 TraceCheckUtils]: 11: Hoare triple {8039#(and (= main_~z~0 0) (<= 50000 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {8040#(and (= main_~z~0 0) (<= 49999 main_~y~0))} is VALID [2022-04-28 03:43:40,094 INFO L290 TraceCheckUtils]: 12: Hoare triple {8040#(and (= main_~z~0 0) (<= 49999 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {8041#(and (<= 49998 main_~y~0) (= main_~z~0 0))} is VALID [2022-04-28 03:43:40,094 INFO L290 TraceCheckUtils]: 13: Hoare triple {8041#(and (<= 49998 main_~y~0) (= main_~z~0 0))} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {8042#(and (= main_~z~0 0) (<= 49997 main_~y~0))} is VALID [2022-04-28 03:43:40,095 INFO L290 TraceCheckUtils]: 14: Hoare triple {8042#(and (= main_~z~0 0) (<= 49997 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {8043#(and (= main_~z~0 0) (<= 49996 main_~y~0))} is VALID [2022-04-28 03:43:40,096 INFO L290 TraceCheckUtils]: 15: Hoare triple {8043#(and (= main_~z~0 0) (<= 49996 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {8044#(and (= main_~z~0 0) (<= 49995 main_~y~0))} is VALID [2022-04-28 03:43:40,096 INFO L290 TraceCheckUtils]: 16: Hoare triple {8044#(and (= main_~z~0 0) (<= 49995 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {8045#(and (= main_~z~0 0) (<= 49994 main_~y~0))} is VALID [2022-04-28 03:43:40,097 INFO L290 TraceCheckUtils]: 17: Hoare triple {8045#(and (= main_~z~0 0) (<= 49994 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {8046#(and (= main_~z~0 0) (<= 49993 main_~y~0))} is VALID [2022-04-28 03:43:40,097 INFO L290 TraceCheckUtils]: 18: Hoare triple {8046#(and (= main_~z~0 0) (<= 49993 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {8047#(and (= main_~z~0 0) (<= 49992 main_~y~0))} is VALID [2022-04-28 03:43:40,098 INFO L290 TraceCheckUtils]: 19: Hoare triple {8047#(and (= main_~z~0 0) (<= 49992 main_~y~0))} assume !(~y~0 > ~z~0); {8031#false} is VALID [2022-04-28 03:43:40,098 INFO L272 TraceCheckUtils]: 20: Hoare triple {8031#false} call __VERIFIER_assert((if ~x~0 == ~z~0 then 1 else 0)); {8031#false} is VALID [2022-04-28 03:43:40,098 INFO L290 TraceCheckUtils]: 21: Hoare triple {8031#false} ~cond := #in~cond; {8031#false} is VALID [2022-04-28 03:43:40,098 INFO L290 TraceCheckUtils]: 22: Hoare triple {8031#false} assume 0 == ~cond; {8031#false} is VALID [2022-04-28 03:43:40,098 INFO L290 TraceCheckUtils]: 23: Hoare triple {8031#false} assume !false; {8031#false} is VALID [2022-04-28 03:43:40,098 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 0 proven. 47 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 03:43:40,098 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 03:43:40,099 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [228044172] [2022-04-28 03:43:40,099 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [228044172] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 03:43:40,099 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1983721695] [2022-04-28 03:43:40,099 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:43:40,099 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 03:43:40,099 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 03:43:40,108 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 03:43:40,110 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2022-04-28 03:43:40,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:43:40,140 INFO L263 TraceCheckSpWp]: Trace formula consists of 104 conjuncts, 13 conjunts are in the unsatisfiable core [2022-04-28 03:43:40,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:43:40,151 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 03:43:40,674 INFO L272 TraceCheckUtils]: 0: Hoare triple {8030#true} call ULTIMATE.init(); {8030#true} is VALID [2022-04-28 03:43:40,674 INFO L290 TraceCheckUtils]: 1: Hoare triple {8030#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(17, 2);call #Ultimate.allocInit(12, 3); {8030#true} is VALID [2022-04-28 03:43:40,674 INFO L290 TraceCheckUtils]: 2: Hoare triple {8030#true} assume true; {8030#true} is VALID [2022-04-28 03:43:40,674 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {8030#true} {8030#true} #52#return; {8030#true} is VALID [2022-04-28 03:43:40,674 INFO L272 TraceCheckUtils]: 4: Hoare triple {8030#true} call #t~ret9 := main(); {8030#true} is VALID [2022-04-28 03:43:40,675 INFO L290 TraceCheckUtils]: 5: Hoare triple {8030#true} ~x~0 := 0;~y~0 := 50000;~z~0 := 0;~x~0 := 0; {8067#(and (<= main_~z~0 0) (<= 50000 main_~y~0))} is VALID [2022-04-28 03:43:40,675 INFO L290 TraceCheckUtils]: 6: Hoare triple {8067#(and (<= main_~z~0 0) (<= 50000 main_~y~0))} [112] L11-2-->L18-1_primed: Formula: (let ((.cse0 (= v_main_~x~0_429 v_main_~x~0_428)) (.cse1 (= |v_main_#t~post4_89| |v_main_#t~post4_88|))) (or (and (< v_main_~x~0_429 v_main_~x~0_428) (< v_main_~x~0_428 50001)) (and .cse0 .cse1) (and (<= 50000 v_main_~x~0_429) .cse0 .cse1))) InVars {main_~x~0=v_main_~x~0_429, main_#t~post4=|v_main_#t~post4_89|} OutVars{main_~x~0=v_main_~x~0_428, main_#t~post4=|v_main_#t~post4_88|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {8067#(and (<= main_~z~0 0) (<= 50000 main_~y~0))} is VALID [2022-04-28 03:43:40,675 INFO L290 TraceCheckUtils]: 7: Hoare triple {8067#(and (<= main_~z~0 0) (<= 50000 main_~y~0))} [113] L18-1_primed-->L11-2: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {8067#(and (<= main_~z~0 0) (<= 50000 main_~y~0))} is VALID [2022-04-28 03:43:40,676 INFO L290 TraceCheckUtils]: 8: Hoare triple {8067#(and (<= main_~z~0 0) (<= 50000 main_~y~0))} [114] L11-2-->L18-1_primed: Formula: (let ((.cse0 (= |v_main_#t~post5_95| |v_main_#t~post5_94|)) (.cse1 (= |v_main_#t~post6_95| |v_main_#t~post6_94|)) (.cse2 (= v_main_~x~0_431 v_main_~x~0_430)) (.cse3 (<= 50000 v_main_~x~0_431))) (or (and .cse0 .cse1 .cse2 (= v_main_~y~0_370 v_main_~y~0_369)) (and .cse0 (= v_main_~y~0_369 v_main_~y~0_370) (or (not .cse3) (not (< v_main_~x~0_431 1000000))) .cse1 .cse2) (let ((.cse4 (+ v_main_~x~0_431 v_main_~y~0_369))) (and .cse3 (< .cse4 (+ v_main_~y~0_370 1000001)) (= .cse4 (+ v_main_~x~0_430 v_main_~y~0_370)) (< v_main_~y~0_370 v_main_~y~0_369))))) InVars {main_~y~0=v_main_~y~0_370, main_#t~post5=|v_main_#t~post5_95|, main_~x~0=v_main_~x~0_431, main_#t~post6=|v_main_#t~post6_95|} OutVars{main_~y~0=v_main_~y~0_369, main_#t~post5=|v_main_#t~post5_94|, main_~x~0=v_main_~x~0_430, main_#t~post6=|v_main_#t~post6_94|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {8067#(and (<= main_~z~0 0) (<= 50000 main_~y~0))} is VALID [2022-04-28 03:43:40,676 INFO L290 TraceCheckUtils]: 9: Hoare triple {8067#(and (<= main_~z~0 0) (<= 50000 main_~y~0))} [111] L18-1_primed-->L18-1: Formula: (not (< v_main_~x~0_11 1000000)) InVars {main_~x~0=v_main_~x~0_11} OutVars{main_~x~0=v_main_~x~0_11} AuxVars[] AssignedVars[] {8067#(and (<= main_~z~0 0) (<= 50000 main_~y~0))} is VALID [2022-04-28 03:43:40,677 INFO L290 TraceCheckUtils]: 10: Hoare triple {8067#(and (<= main_~z~0 0) (<= 50000 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {8083#(and (<= main_~z~0 0) (<= 49999 main_~y~0))} is VALID [2022-04-28 03:43:40,677 INFO L290 TraceCheckUtils]: 11: Hoare triple {8083#(and (<= main_~z~0 0) (<= 49999 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {8087#(and (<= main_~z~0 0) (<= 49998 main_~y~0))} is VALID [2022-04-28 03:43:40,678 INFO L290 TraceCheckUtils]: 12: Hoare triple {8087#(and (<= main_~z~0 0) (<= 49998 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {8091#(and (<= main_~z~0 0) (<= 49997 main_~y~0))} is VALID [2022-04-28 03:43:40,678 INFO L290 TraceCheckUtils]: 13: Hoare triple {8091#(and (<= main_~z~0 0) (<= 49997 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {8095#(and (<= main_~z~0 0) (<= 49996 main_~y~0))} is VALID [2022-04-28 03:43:40,679 INFO L290 TraceCheckUtils]: 14: Hoare triple {8095#(and (<= main_~z~0 0) (<= 49996 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {8099#(and (<= main_~z~0 0) (<= 49995 main_~y~0))} is VALID [2022-04-28 03:43:40,683 INFO L290 TraceCheckUtils]: 15: Hoare triple {8099#(and (<= main_~z~0 0) (<= 49995 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {8103#(and (<= main_~z~0 0) (<= 49994 main_~y~0))} is VALID [2022-04-28 03:43:40,683 INFO L290 TraceCheckUtils]: 16: Hoare triple {8103#(and (<= main_~z~0 0) (<= 49994 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {8107#(and (<= main_~z~0 0) (<= 49993 main_~y~0))} is VALID [2022-04-28 03:43:40,684 INFO L290 TraceCheckUtils]: 17: Hoare triple {8107#(and (<= main_~z~0 0) (<= 49993 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {8111#(and (<= main_~z~0 0) (<= 49992 main_~y~0))} is VALID [2022-04-28 03:43:40,684 INFO L290 TraceCheckUtils]: 18: Hoare triple {8111#(and (<= main_~z~0 0) (<= 49992 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {8115#(and (<= main_~z~0 0) (<= 49991 main_~y~0))} is VALID [2022-04-28 03:43:40,685 INFO L290 TraceCheckUtils]: 19: Hoare triple {8115#(and (<= main_~z~0 0) (<= 49991 main_~y~0))} assume !(~y~0 > ~z~0); {8031#false} is VALID [2022-04-28 03:43:40,685 INFO L272 TraceCheckUtils]: 20: Hoare triple {8031#false} call __VERIFIER_assert((if ~x~0 == ~z~0 then 1 else 0)); {8031#false} is VALID [2022-04-28 03:43:40,685 INFO L290 TraceCheckUtils]: 21: Hoare triple {8031#false} ~cond := #in~cond; {8031#false} is VALID [2022-04-28 03:43:40,685 INFO L290 TraceCheckUtils]: 22: Hoare triple {8031#false} assume 0 == ~cond; {8031#false} is VALID [2022-04-28 03:43:40,685 INFO L290 TraceCheckUtils]: 23: Hoare triple {8031#false} assume !false; {8031#false} is VALID [2022-04-28 03:43:40,685 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 0 proven. 45 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-04-28 03:43:40,685 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 03:43:41,201 INFO L290 TraceCheckUtils]: 23: Hoare triple {8031#false} assume !false; {8031#false} is VALID [2022-04-28 03:43:41,201 INFO L290 TraceCheckUtils]: 22: Hoare triple {8031#false} assume 0 == ~cond; {8031#false} is VALID [2022-04-28 03:43:41,201 INFO L290 TraceCheckUtils]: 21: Hoare triple {8031#false} ~cond := #in~cond; {8031#false} is VALID [2022-04-28 03:43:41,201 INFO L272 TraceCheckUtils]: 20: Hoare triple {8031#false} call __VERIFIER_assert((if ~x~0 == ~z~0 then 1 else 0)); {8031#false} is VALID [2022-04-28 03:43:41,201 INFO L290 TraceCheckUtils]: 19: Hoare triple {8143#(< main_~z~0 main_~y~0)} assume !(~y~0 > ~z~0); {8031#false} is VALID [2022-04-28 03:43:41,202 INFO L290 TraceCheckUtils]: 18: Hoare triple {8147#(< (+ main_~z~0 1) main_~y~0)} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {8143#(< main_~z~0 main_~y~0)} is VALID [2022-04-28 03:43:41,202 INFO L290 TraceCheckUtils]: 17: Hoare triple {8151#(< (+ main_~z~0 2) main_~y~0)} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {8147#(< (+ main_~z~0 1) main_~y~0)} is VALID [2022-04-28 03:43:41,203 INFO L290 TraceCheckUtils]: 16: Hoare triple {8155#(< (+ main_~z~0 3) main_~y~0)} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {8151#(< (+ main_~z~0 2) main_~y~0)} is VALID [2022-04-28 03:43:41,203 INFO L290 TraceCheckUtils]: 15: Hoare triple {8159#(< (+ main_~z~0 4) main_~y~0)} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {8155#(< (+ main_~z~0 3) main_~y~0)} is VALID [2022-04-28 03:43:41,204 INFO L290 TraceCheckUtils]: 14: Hoare triple {8163#(< (+ 5 main_~z~0) main_~y~0)} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {8159#(< (+ main_~z~0 4) main_~y~0)} is VALID [2022-04-28 03:43:41,204 INFO L290 TraceCheckUtils]: 13: Hoare triple {8167#(< (+ main_~z~0 6) main_~y~0)} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {8163#(< (+ 5 main_~z~0) main_~y~0)} is VALID [2022-04-28 03:43:41,205 INFO L290 TraceCheckUtils]: 12: Hoare triple {8171#(< (+ 7 main_~z~0) main_~y~0)} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {8167#(< (+ main_~z~0 6) main_~y~0)} is VALID [2022-04-28 03:43:41,205 INFO L290 TraceCheckUtils]: 11: Hoare triple {8175#(< (+ main_~z~0 8) main_~y~0)} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {8171#(< (+ 7 main_~z~0) main_~y~0)} is VALID [2022-04-28 03:43:41,205 INFO L290 TraceCheckUtils]: 10: Hoare triple {8179#(< (+ main_~z~0 9) main_~y~0)} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {8175#(< (+ main_~z~0 8) main_~y~0)} is VALID [2022-04-28 03:43:41,206 INFO L290 TraceCheckUtils]: 9: Hoare triple {8179#(< (+ main_~z~0 9) main_~y~0)} [111] L18-1_primed-->L18-1: Formula: (not (< v_main_~x~0_11 1000000)) InVars {main_~x~0=v_main_~x~0_11} OutVars{main_~x~0=v_main_~x~0_11} AuxVars[] AssignedVars[] {8179#(< (+ main_~z~0 9) main_~y~0)} is VALID [2022-04-28 03:43:41,207 INFO L290 TraceCheckUtils]: 8: Hoare triple {8179#(< (+ main_~z~0 9) main_~y~0)} [114] L11-2-->L18-1_primed: Formula: (let ((.cse0 (= |v_main_#t~post5_95| |v_main_#t~post5_94|)) (.cse1 (= |v_main_#t~post6_95| |v_main_#t~post6_94|)) (.cse2 (= v_main_~x~0_431 v_main_~x~0_430)) (.cse3 (<= 50000 v_main_~x~0_431))) (or (and .cse0 .cse1 .cse2 (= v_main_~y~0_370 v_main_~y~0_369)) (and .cse0 (= v_main_~y~0_369 v_main_~y~0_370) (or (not .cse3) (not (< v_main_~x~0_431 1000000))) .cse1 .cse2) (let ((.cse4 (+ v_main_~x~0_431 v_main_~y~0_369))) (and .cse3 (< .cse4 (+ v_main_~y~0_370 1000001)) (= .cse4 (+ v_main_~x~0_430 v_main_~y~0_370)) (< v_main_~y~0_370 v_main_~y~0_369))))) InVars {main_~y~0=v_main_~y~0_370, main_#t~post5=|v_main_#t~post5_95|, main_~x~0=v_main_~x~0_431, main_#t~post6=|v_main_#t~post6_95|} OutVars{main_~y~0=v_main_~y~0_369, main_#t~post5=|v_main_#t~post5_94|, main_~x~0=v_main_~x~0_430, main_#t~post6=|v_main_#t~post6_94|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {8179#(< (+ main_~z~0 9) main_~y~0)} is VALID [2022-04-28 03:43:41,207 INFO L290 TraceCheckUtils]: 7: Hoare triple {8179#(< (+ main_~z~0 9) main_~y~0)} [113] L18-1_primed-->L11-2: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {8179#(< (+ main_~z~0 9) main_~y~0)} is VALID [2022-04-28 03:43:41,207 INFO L290 TraceCheckUtils]: 6: Hoare triple {8179#(< (+ main_~z~0 9) main_~y~0)} [112] L11-2-->L18-1_primed: Formula: (let ((.cse0 (= v_main_~x~0_429 v_main_~x~0_428)) (.cse1 (= |v_main_#t~post4_89| |v_main_#t~post4_88|))) (or (and (< v_main_~x~0_429 v_main_~x~0_428) (< v_main_~x~0_428 50001)) (and .cse0 .cse1) (and (<= 50000 v_main_~x~0_429) .cse0 .cse1))) InVars {main_~x~0=v_main_~x~0_429, main_#t~post4=|v_main_#t~post4_89|} OutVars{main_~x~0=v_main_~x~0_428, main_#t~post4=|v_main_#t~post4_88|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {8179#(< (+ main_~z~0 9) main_~y~0)} is VALID [2022-04-28 03:43:41,208 INFO L290 TraceCheckUtils]: 5: Hoare triple {8030#true} ~x~0 := 0;~y~0 := 50000;~z~0 := 0;~x~0 := 0; {8179#(< (+ main_~z~0 9) main_~y~0)} is VALID [2022-04-28 03:43:41,208 INFO L272 TraceCheckUtils]: 4: Hoare triple {8030#true} call #t~ret9 := main(); {8030#true} is VALID [2022-04-28 03:43:41,208 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {8030#true} {8030#true} #52#return; {8030#true} is VALID [2022-04-28 03:43:41,208 INFO L290 TraceCheckUtils]: 2: Hoare triple {8030#true} assume true; {8030#true} is VALID [2022-04-28 03:43:41,208 INFO L290 TraceCheckUtils]: 1: Hoare triple {8030#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(17, 2);call #Ultimate.allocInit(12, 3); {8030#true} is VALID [2022-04-28 03:43:41,208 INFO L272 TraceCheckUtils]: 0: Hoare triple {8030#true} call ULTIMATE.init(); {8030#true} is VALID [2022-04-28 03:43:41,208 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 0 proven. 45 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-04-28 03:43:41,208 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1983721695] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 03:43:41,208 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 03:43:41,208 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 12, 12] total 36 [2022-04-28 03:43:41,896 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 03:43:41,897 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1787871583] [2022-04-28 03:43:41,897 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1787871583] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 03:43:41,897 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 03:43:41,897 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [34] imperfect sequences [] total 34 [2022-04-28 03:43:41,897 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1599207253] [2022-04-28 03:43:41,897 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 03:43:41,897 INFO L78 Accepts]: Start accepts. Automaton has has 34 states, 34 states have (on average 1.6764705882352942) internal successors, (57), 33 states have internal predecessors, (57), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 61 [2022-04-28 03:43:41,898 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 03:43:41,898 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 34 states, 34 states have (on average 1.6764705882352942) internal successors, (57), 33 states have internal predecessors, (57), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:43:41,945 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 61 edges. 61 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 03:43:41,945 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 34 states [2022-04-28 03:43:41,945 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 03:43:41,945 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2022-04-28 03:43:41,946 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1225, Invalid=1967, Unknown=0, NotChecked=0, Total=3192 [2022-04-28 03:43:41,946 INFO L87 Difference]: Start difference. First operand 62 states and 65 transitions. Second operand has 34 states, 34 states have (on average 1.6764705882352942) internal successors, (57), 33 states have internal predecessors, (57), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:43:44,306 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:43:44,307 INFO L93 Difference]: Finished difference Result 157 states and 168 transitions. [2022-04-28 03:43:44,307 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2022-04-28 03:43:44,307 INFO L78 Accepts]: Start accepts. Automaton has has 34 states, 34 states have (on average 1.6764705882352942) internal successors, (57), 33 states have internal predecessors, (57), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 61 [2022-04-28 03:43:44,307 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 03:43:44,307 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34 states, 34 states have (on average 1.6764705882352942) internal successors, (57), 33 states have internal predecessors, (57), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:43:44,308 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 83 transitions. [2022-04-28 03:43:44,308 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34 states, 34 states have (on average 1.6764705882352942) internal successors, (57), 33 states have internal predecessors, (57), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:43:44,309 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 83 transitions. [2022-04-28 03:43:44,309 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 34 states and 83 transitions. [2022-04-28 03:43:44,387 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 83 edges. 83 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 03:43:44,388 INFO L225 Difference]: With dead ends: 157 [2022-04-28 03:43:44,388 INFO L226 Difference]: Without dead ends: 103 [2022-04-28 03:43:44,390 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 141 GetRequests, 53 SyntacticMatches, 2 SemanticMatches, 86 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2199 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=2465, Invalid=5191, Unknown=0, NotChecked=0, Total=7656 [2022-04-28 03:43:44,391 INFO L413 NwaCegarLoop]: 13 mSDtfsCounter, 97 mSDsluCounter, 27 mSDsCounter, 0 mSdLazyCounter, 990 mSolverCounterSat, 105 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 97 SdHoareTripleChecker+Valid, 40 SdHoareTripleChecker+Invalid, 1095 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 105 IncrementalHoareTripleChecker+Valid, 990 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2022-04-28 03:43:44,391 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [97 Valid, 40 Invalid, 1095 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [105 Valid, 990 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2022-04-28 03:43:44,391 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2022-04-28 03:43:44,588 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 103. [2022-04-28 03:43:44,588 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 03:43:44,588 INFO L82 GeneralOperation]: Start isEquivalent. First operand 103 states. Second operand has 103 states, 98 states have (on average 1.0510204081632653) internal successors, (103), 98 states have internal predecessors, (103), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:43:44,589 INFO L74 IsIncluded]: Start isIncluded. First operand 103 states. Second operand has 103 states, 98 states have (on average 1.0510204081632653) internal successors, (103), 98 states have internal predecessors, (103), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:43:44,589 INFO L87 Difference]: Start difference. First operand 103 states. Second operand has 103 states, 98 states have (on average 1.0510204081632653) internal successors, (103), 98 states have internal predecessors, (103), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:43:44,590 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:43:44,590 INFO L93 Difference]: Finished difference Result 103 states and 107 transitions. [2022-04-28 03:43:44,590 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 107 transitions. [2022-04-28 03:43:44,590 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:43:44,590 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:43:44,591 INFO L74 IsIncluded]: Start isIncluded. First operand has 103 states, 98 states have (on average 1.0510204081632653) internal successors, (103), 98 states have internal predecessors, (103), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 103 states. [2022-04-28 03:43:44,591 INFO L87 Difference]: Start difference. First operand has 103 states, 98 states have (on average 1.0510204081632653) internal successors, (103), 98 states have internal predecessors, (103), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 103 states. [2022-04-28 03:43:44,592 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:43:44,592 INFO L93 Difference]: Finished difference Result 103 states and 107 transitions. [2022-04-28 03:43:44,592 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 107 transitions. [2022-04-28 03:43:44,593 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:43:44,593 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:43:44,593 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 03:43:44,593 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 03:43:44,593 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 103 states, 98 states have (on average 1.0510204081632653) internal successors, (103), 98 states have internal predecessors, (103), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:43:44,595 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 107 transitions. [2022-04-28 03:43:44,595 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 107 transitions. Word has length 61 [2022-04-28 03:43:44,595 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 03:43:44,595 INFO L495 AbstractCegarLoop]: Abstraction has 103 states and 107 transitions. [2022-04-28 03:43:44,595 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 34 states, 34 states have (on average 1.6764705882352942) internal successors, (57), 33 states have internal predecessors, (57), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:43:44,595 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 103 states and 107 transitions. [2022-04-28 03:43:44,707 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 107 edges. 107 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 03:43:44,707 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 107 transitions. [2022-04-28 03:43:44,707 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2022-04-28 03:43:44,707 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 03:43:44,707 INFO L195 NwaCegarLoop]: trace histogram [21, 20, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 03:43:44,724 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Forceful destruction successful, exit code 0 [2022-04-28 03:43:44,911 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16,15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 03:43:44,911 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 03:43:44,912 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 03:43:44,912 INFO L85 PathProgramCache]: Analyzing trace with hash 1450885374, now seen corresponding path program 15 times [2022-04-28 03:43:44,912 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 03:43:44,912 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1170535514] [2022-04-28 03:43:48,976 WARN L977 rdanLoopAcceleration]: Unable to prove correctness of quantifier elimination. [2022-04-28 03:43:49,025 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 1 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 03:43:49,262 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={1=1, 2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 03:43:49,263 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-28 03:43:49,265 INFO L85 PathProgramCache]: Analyzing trace with hash -1471716447, now seen corresponding path program 1 times [2022-04-28 03:43:49,265 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 03:43:49,265 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [330924173] [2022-04-28 03:43:49,265 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:43:49,265 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 03:43:49,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:43:49,513 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 03:43:49,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:43:49,517 INFO L290 TraceCheckUtils]: 0: Hoare triple {9040#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(17, 2);call #Ultimate.allocInit(12, 3); {9021#true} is VALID [2022-04-28 03:43:49,517 INFO L290 TraceCheckUtils]: 1: Hoare triple {9021#true} assume true; {9021#true} is VALID [2022-04-28 03:43:49,517 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {9021#true} {9021#true} #52#return; {9021#true} is VALID [2022-04-28 03:43:49,517 INFO L272 TraceCheckUtils]: 0: Hoare triple {9021#true} call ULTIMATE.init(); {9040#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 03:43:49,517 INFO L290 TraceCheckUtils]: 1: Hoare triple {9040#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(17, 2);call #Ultimate.allocInit(12, 3); {9021#true} is VALID [2022-04-28 03:43:49,517 INFO L290 TraceCheckUtils]: 2: Hoare triple {9021#true} assume true; {9021#true} is VALID [2022-04-28 03:43:49,517 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {9021#true} {9021#true} #52#return; {9021#true} is VALID [2022-04-28 03:43:49,517 INFO L272 TraceCheckUtils]: 4: Hoare triple {9021#true} call #t~ret9 := main(); {9021#true} is VALID [2022-04-28 03:43:49,518 INFO L290 TraceCheckUtils]: 5: Hoare triple {9021#true} ~x~0 := 0;~y~0 := 50000;~z~0 := 0;~x~0 := 0; {9026#(and (= main_~z~0 0) (= main_~x~0 0) (<= 50000 main_~y~0))} is VALID [2022-04-28 03:43:49,518 INFO L290 TraceCheckUtils]: 6: Hoare triple {9026#(and (= main_~z~0 0) (= main_~x~0 0) (<= 50000 main_~y~0))} [116] L11-2-->L18-1_primed: Formula: (let ((.cse0 (= v_main_~x~0_474 v_main_~x~0_473)) (.cse1 (= |v_main_#t~post4_95| |v_main_#t~post4_94|))) (or (and (< v_main_~x~0_473 50001) (< v_main_~x~0_474 v_main_~x~0_473)) (and .cse0 (not (< v_main_~x~0_474 50000)) .cse1) (and .cse0 .cse1))) InVars {main_~x~0=v_main_~x~0_474, main_#t~post4=|v_main_#t~post4_95|} OutVars{main_~x~0=v_main_~x~0_473, main_#t~post4=|v_main_#t~post4_94|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {9027#(and (= main_~z~0 0) (<= main_~x~0 main_~y~0) (<= 50000 main_~y~0))} is VALID [2022-04-28 03:43:49,519 INFO L290 TraceCheckUtils]: 7: Hoare triple {9027#(and (= main_~z~0 0) (<= main_~x~0 main_~y~0) (<= 50000 main_~y~0))} [117] L18-1_primed-->L11-2: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {9027#(and (= main_~z~0 0) (<= main_~x~0 main_~y~0) (<= 50000 main_~y~0))} is VALID [2022-04-28 03:43:49,520 INFO L290 TraceCheckUtils]: 8: Hoare triple {9027#(and (= main_~z~0 0) (<= main_~x~0 main_~y~0) (<= 50000 main_~y~0))} [118] L11-2-->L18-1_primed: Formula: (let ((.cse1 (= v_main_~y~0_416 v_main_~y~0_415)) (.cse2 (= v_main_~x~0_476 v_main_~x~0_475)) (.cse3 (= |v_main_#t~post6_102| |v_main_#t~post6_101|)) (.cse4 (= |v_main_#t~post5_102| |v_main_#t~post5_101|)) (.cse0 (<= 50000 v_main_~x~0_476))) (or (and (or (not (< v_main_~x~0_476 1000000)) (not .cse0)) .cse1 .cse2 .cse3 .cse4) (and .cse1 .cse2 .cse3 .cse4) (and (< v_main_~x~0_476 v_main_~x~0_475) (= (+ v_main_~x~0_476 v_main_~y~0_415) (+ v_main_~x~0_475 v_main_~y~0_416)) .cse0 (< v_main_~x~0_475 1000001)))) InVars {main_~y~0=v_main_~y~0_416, main_#t~post5=|v_main_#t~post5_102|, main_~x~0=v_main_~x~0_476, main_#t~post6=|v_main_#t~post6_102|} OutVars{main_~y~0=v_main_~y~0_415, main_#t~post5=|v_main_#t~post5_101|, main_~x~0=v_main_~x~0_475, main_#t~post6=|v_main_#t~post6_101|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {9028#(and (= main_~z~0 0) (or (<= main_~x~0 main_~y~0) (<= 50000 main_~y~0)))} is VALID [2022-04-28 03:43:49,520 INFO L290 TraceCheckUtils]: 9: Hoare triple {9028#(and (= main_~z~0 0) (or (<= main_~x~0 main_~y~0) (<= 50000 main_~y~0)))} [115] L18-1_primed-->L18-1: Formula: (not (< v_main_~x~0_11 1000000)) InVars {main_~x~0=v_main_~x~0_11} OutVars{main_~x~0=v_main_~x~0_11} AuxVars[] AssignedVars[] {9029#(and (= main_~z~0 0) (<= 50000 main_~y~0))} is VALID [2022-04-28 03:43:49,520 INFO L290 TraceCheckUtils]: 10: Hoare triple {9029#(and (= main_~z~0 0) (<= 50000 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {9030#(and (= main_~z~0 0) (<= 49999 main_~y~0))} is VALID [2022-04-28 03:43:49,521 INFO L290 TraceCheckUtils]: 11: Hoare triple {9030#(and (= main_~z~0 0) (<= 49999 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {9031#(and (<= 49998 main_~y~0) (= main_~z~0 0))} is VALID [2022-04-28 03:43:49,521 INFO L290 TraceCheckUtils]: 12: Hoare triple {9031#(and (<= 49998 main_~y~0) (= main_~z~0 0))} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {9032#(and (= main_~z~0 0) (<= 49997 main_~y~0))} is VALID [2022-04-28 03:43:49,522 INFO L290 TraceCheckUtils]: 13: Hoare triple {9032#(and (= main_~z~0 0) (<= 49997 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {9033#(and (= main_~z~0 0) (<= 49996 main_~y~0))} is VALID [2022-04-28 03:43:49,522 INFO L290 TraceCheckUtils]: 14: Hoare triple {9033#(and (= main_~z~0 0) (<= 49996 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {9034#(and (= main_~z~0 0) (<= 49995 main_~y~0))} is VALID [2022-04-28 03:43:49,523 INFO L290 TraceCheckUtils]: 15: Hoare triple {9034#(and (= main_~z~0 0) (<= 49995 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {9035#(and (= main_~z~0 0) (<= 49994 main_~y~0))} is VALID [2022-04-28 03:43:49,524 INFO L290 TraceCheckUtils]: 16: Hoare triple {9035#(and (= main_~z~0 0) (<= 49994 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {9036#(and (= main_~z~0 0) (<= 49993 main_~y~0))} is VALID [2022-04-28 03:43:49,524 INFO L290 TraceCheckUtils]: 17: Hoare triple {9036#(and (= main_~z~0 0) (<= 49993 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {9037#(and (= main_~z~0 0) (<= 49992 main_~y~0))} is VALID [2022-04-28 03:43:49,525 INFO L290 TraceCheckUtils]: 18: Hoare triple {9037#(and (= main_~z~0 0) (<= 49992 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {9038#(and (= main_~z~0 0) (<= 49991 main_~y~0))} is VALID [2022-04-28 03:43:49,525 INFO L290 TraceCheckUtils]: 19: Hoare triple {9038#(and (= main_~z~0 0) (<= 49991 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {9039#(and (<= 49990 main_~y~0) (= main_~z~0 0))} is VALID [2022-04-28 03:43:49,525 INFO L290 TraceCheckUtils]: 20: Hoare triple {9039#(and (<= 49990 main_~y~0) (= main_~z~0 0))} assume !(~y~0 > ~z~0); {9022#false} is VALID [2022-04-28 03:43:49,525 INFO L272 TraceCheckUtils]: 21: Hoare triple {9022#false} call __VERIFIER_assert((if ~x~0 == ~z~0 then 1 else 0)); {9022#false} is VALID [2022-04-28 03:43:49,526 INFO L290 TraceCheckUtils]: 22: Hoare triple {9022#false} ~cond := #in~cond; {9022#false} is VALID [2022-04-28 03:43:49,526 INFO L290 TraceCheckUtils]: 23: Hoare triple {9022#false} assume 0 == ~cond; {9022#false} is VALID [2022-04-28 03:43:49,526 INFO L290 TraceCheckUtils]: 24: Hoare triple {9022#false} assume !false; {9022#false} is VALID [2022-04-28 03:43:49,526 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 0 proven. 57 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 03:43:49,526 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 03:43:49,526 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [330924173] [2022-04-28 03:43:49,526 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [330924173] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 03:43:49,526 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1655841673] [2022-04-28 03:43:49,526 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:43:49,526 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 03:43:49,526 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 03:43:49,527 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 03:43:49,528 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2022-04-28 03:43:49,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:43:49,561 INFO L263 TraceCheckSpWp]: Trace formula consists of 109 conjuncts, 14 conjunts are in the unsatisfiable core [2022-04-28 03:43:49,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:43:49,573 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 03:43:50,088 INFO L272 TraceCheckUtils]: 0: Hoare triple {9021#true} call ULTIMATE.init(); {9021#true} is VALID [2022-04-28 03:43:50,088 INFO L290 TraceCheckUtils]: 1: Hoare triple {9021#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(17, 2);call #Ultimate.allocInit(12, 3); {9021#true} is VALID [2022-04-28 03:43:50,088 INFO L290 TraceCheckUtils]: 2: Hoare triple {9021#true} assume true; {9021#true} is VALID [2022-04-28 03:43:50,088 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {9021#true} {9021#true} #52#return; {9021#true} is VALID [2022-04-28 03:43:50,088 INFO L272 TraceCheckUtils]: 4: Hoare triple {9021#true} call #t~ret9 := main(); {9021#true} is VALID [2022-04-28 03:43:50,089 INFO L290 TraceCheckUtils]: 5: Hoare triple {9021#true} ~x~0 := 0;~y~0 := 50000;~z~0 := 0;~x~0 := 0; {9059#(and (<= main_~z~0 0) (<= 50000 main_~y~0))} is VALID [2022-04-28 03:43:50,089 INFO L290 TraceCheckUtils]: 6: Hoare triple {9059#(and (<= main_~z~0 0) (<= 50000 main_~y~0))} [116] L11-2-->L18-1_primed: Formula: (let ((.cse0 (= v_main_~x~0_474 v_main_~x~0_473)) (.cse1 (= |v_main_#t~post4_95| |v_main_#t~post4_94|))) (or (and (< v_main_~x~0_473 50001) (< v_main_~x~0_474 v_main_~x~0_473)) (and .cse0 (not (< v_main_~x~0_474 50000)) .cse1) (and .cse0 .cse1))) InVars {main_~x~0=v_main_~x~0_474, main_#t~post4=|v_main_#t~post4_95|} OutVars{main_~x~0=v_main_~x~0_473, main_#t~post4=|v_main_#t~post4_94|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {9059#(and (<= main_~z~0 0) (<= 50000 main_~y~0))} is VALID [2022-04-28 03:43:50,089 INFO L290 TraceCheckUtils]: 7: Hoare triple {9059#(and (<= main_~z~0 0) (<= 50000 main_~y~0))} [117] L18-1_primed-->L11-2: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {9059#(and (<= main_~z~0 0) (<= 50000 main_~y~0))} is VALID [2022-04-28 03:43:50,090 INFO L290 TraceCheckUtils]: 8: Hoare triple {9059#(and (<= main_~z~0 0) (<= 50000 main_~y~0))} [118] L11-2-->L18-1_primed: Formula: (let ((.cse1 (= v_main_~y~0_416 v_main_~y~0_415)) (.cse2 (= v_main_~x~0_476 v_main_~x~0_475)) (.cse3 (= |v_main_#t~post6_102| |v_main_#t~post6_101|)) (.cse4 (= |v_main_#t~post5_102| |v_main_#t~post5_101|)) (.cse0 (<= 50000 v_main_~x~0_476))) (or (and (or (not (< v_main_~x~0_476 1000000)) (not .cse0)) .cse1 .cse2 .cse3 .cse4) (and .cse1 .cse2 .cse3 .cse4) (and (< v_main_~x~0_476 v_main_~x~0_475) (= (+ v_main_~x~0_476 v_main_~y~0_415) (+ v_main_~x~0_475 v_main_~y~0_416)) .cse0 (< v_main_~x~0_475 1000001)))) InVars {main_~y~0=v_main_~y~0_416, main_#t~post5=|v_main_#t~post5_102|, main_~x~0=v_main_~x~0_476, main_#t~post6=|v_main_#t~post6_102|} OutVars{main_~y~0=v_main_~y~0_415, main_#t~post5=|v_main_#t~post5_101|, main_~x~0=v_main_~x~0_475, main_#t~post6=|v_main_#t~post6_101|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {9059#(and (<= main_~z~0 0) (<= 50000 main_~y~0))} is VALID [2022-04-28 03:43:50,090 INFO L290 TraceCheckUtils]: 9: Hoare triple {9059#(and (<= main_~z~0 0) (<= 50000 main_~y~0))} [115] L18-1_primed-->L18-1: Formula: (not (< v_main_~x~0_11 1000000)) InVars {main_~x~0=v_main_~x~0_11} OutVars{main_~x~0=v_main_~x~0_11} AuxVars[] AssignedVars[] {9059#(and (<= main_~z~0 0) (<= 50000 main_~y~0))} is VALID [2022-04-28 03:43:50,091 INFO L290 TraceCheckUtils]: 10: Hoare triple {9059#(and (<= main_~z~0 0) (<= 50000 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {9075#(and (<= main_~z~0 0) (<= 49999 main_~y~0))} is VALID [2022-04-28 03:43:50,091 INFO L290 TraceCheckUtils]: 11: Hoare triple {9075#(and (<= main_~z~0 0) (<= 49999 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {9079#(and (<= main_~z~0 0) (<= 49998 main_~y~0))} is VALID [2022-04-28 03:43:50,092 INFO L290 TraceCheckUtils]: 12: Hoare triple {9079#(and (<= main_~z~0 0) (<= 49998 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {9083#(and (<= main_~z~0 0) (<= 49997 main_~y~0))} is VALID [2022-04-28 03:43:50,092 INFO L290 TraceCheckUtils]: 13: Hoare triple {9083#(and (<= main_~z~0 0) (<= 49997 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {9087#(and (<= main_~z~0 0) (<= 49996 main_~y~0))} is VALID [2022-04-28 03:43:50,093 INFO L290 TraceCheckUtils]: 14: Hoare triple {9087#(and (<= main_~z~0 0) (<= 49996 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {9091#(and (<= main_~z~0 0) (<= 49995 main_~y~0))} is VALID [2022-04-28 03:43:50,093 INFO L290 TraceCheckUtils]: 15: Hoare triple {9091#(and (<= main_~z~0 0) (<= 49995 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {9095#(and (<= main_~z~0 0) (<= 49994 main_~y~0))} is VALID [2022-04-28 03:43:50,094 INFO L290 TraceCheckUtils]: 16: Hoare triple {9095#(and (<= main_~z~0 0) (<= 49994 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {9099#(and (<= main_~z~0 0) (<= 49993 main_~y~0))} is VALID [2022-04-28 03:43:50,095 INFO L290 TraceCheckUtils]: 17: Hoare triple {9099#(and (<= main_~z~0 0) (<= 49993 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {9103#(and (<= main_~z~0 0) (<= 49992 main_~y~0))} is VALID [2022-04-28 03:43:50,095 INFO L290 TraceCheckUtils]: 18: Hoare triple {9103#(and (<= main_~z~0 0) (<= 49992 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {9107#(and (<= main_~z~0 0) (<= 49991 main_~y~0))} is VALID [2022-04-28 03:43:50,096 INFO L290 TraceCheckUtils]: 19: Hoare triple {9107#(and (<= main_~z~0 0) (<= 49991 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {9111#(and (<= main_~z~0 0) (<= 49990 main_~y~0))} is VALID [2022-04-28 03:43:50,096 INFO L290 TraceCheckUtils]: 20: Hoare triple {9111#(and (<= main_~z~0 0) (<= 49990 main_~y~0))} assume !(~y~0 > ~z~0); {9022#false} is VALID [2022-04-28 03:43:50,096 INFO L272 TraceCheckUtils]: 21: Hoare triple {9022#false} call __VERIFIER_assert((if ~x~0 == ~z~0 then 1 else 0)); {9022#false} is VALID [2022-04-28 03:43:50,096 INFO L290 TraceCheckUtils]: 22: Hoare triple {9022#false} ~cond := #in~cond; {9022#false} is VALID [2022-04-28 03:43:50,096 INFO L290 TraceCheckUtils]: 23: Hoare triple {9022#false} assume 0 == ~cond; {9022#false} is VALID [2022-04-28 03:43:50,096 INFO L290 TraceCheckUtils]: 24: Hoare triple {9022#false} assume !false; {9022#false} is VALID [2022-04-28 03:43:50,096 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-04-28 03:43:50,096 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 03:43:50,680 INFO L290 TraceCheckUtils]: 24: Hoare triple {9022#false} assume !false; {9022#false} is VALID [2022-04-28 03:43:50,681 INFO L290 TraceCheckUtils]: 23: Hoare triple {9022#false} assume 0 == ~cond; {9022#false} is VALID [2022-04-28 03:43:50,681 INFO L290 TraceCheckUtils]: 22: Hoare triple {9022#false} ~cond := #in~cond; {9022#false} is VALID [2022-04-28 03:43:50,681 INFO L272 TraceCheckUtils]: 21: Hoare triple {9022#false} call __VERIFIER_assert((if ~x~0 == ~z~0 then 1 else 0)); {9022#false} is VALID [2022-04-28 03:43:50,681 INFO L290 TraceCheckUtils]: 20: Hoare triple {9139#(< main_~z~0 main_~y~0)} assume !(~y~0 > ~z~0); {9022#false} is VALID [2022-04-28 03:43:50,682 INFO L290 TraceCheckUtils]: 19: Hoare triple {9143#(< (+ main_~z~0 1) main_~y~0)} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {9139#(< main_~z~0 main_~y~0)} is VALID [2022-04-28 03:43:50,682 INFO L290 TraceCheckUtils]: 18: Hoare triple {9147#(< (+ main_~z~0 2) main_~y~0)} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {9143#(< (+ main_~z~0 1) main_~y~0)} is VALID [2022-04-28 03:43:50,684 INFO L290 TraceCheckUtils]: 17: Hoare triple {9151#(< (+ main_~z~0 3) main_~y~0)} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {9147#(< (+ main_~z~0 2) main_~y~0)} is VALID [2022-04-28 03:43:50,684 INFO L290 TraceCheckUtils]: 16: Hoare triple {9155#(< (+ main_~z~0 4) main_~y~0)} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {9151#(< (+ main_~z~0 3) main_~y~0)} is VALID [2022-04-28 03:43:50,685 INFO L290 TraceCheckUtils]: 15: Hoare triple {9159#(< (+ 5 main_~z~0) main_~y~0)} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {9155#(< (+ main_~z~0 4) main_~y~0)} is VALID [2022-04-28 03:43:50,685 INFO L290 TraceCheckUtils]: 14: Hoare triple {9163#(< (+ main_~z~0 6) main_~y~0)} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {9159#(< (+ 5 main_~z~0) main_~y~0)} is VALID [2022-04-28 03:43:50,686 INFO L290 TraceCheckUtils]: 13: Hoare triple {9167#(< (+ 7 main_~z~0) main_~y~0)} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {9163#(< (+ main_~z~0 6) main_~y~0)} is VALID [2022-04-28 03:43:50,686 INFO L290 TraceCheckUtils]: 12: Hoare triple {9171#(< (+ main_~z~0 8) main_~y~0)} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {9167#(< (+ 7 main_~z~0) main_~y~0)} is VALID [2022-04-28 03:43:50,687 INFO L290 TraceCheckUtils]: 11: Hoare triple {9175#(< (+ main_~z~0 9) main_~y~0)} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {9171#(< (+ main_~z~0 8) main_~y~0)} is VALID [2022-04-28 03:43:50,687 INFO L290 TraceCheckUtils]: 10: Hoare triple {9179#(< (+ main_~z~0 10) main_~y~0)} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {9175#(< (+ main_~z~0 9) main_~y~0)} is VALID [2022-04-28 03:43:50,687 INFO L290 TraceCheckUtils]: 9: Hoare triple {9179#(< (+ main_~z~0 10) main_~y~0)} [115] L18-1_primed-->L18-1: Formula: (not (< v_main_~x~0_11 1000000)) InVars {main_~x~0=v_main_~x~0_11} OutVars{main_~x~0=v_main_~x~0_11} AuxVars[] AssignedVars[] {9179#(< (+ main_~z~0 10) main_~y~0)} is VALID [2022-04-28 03:43:50,688 INFO L290 TraceCheckUtils]: 8: Hoare triple {9179#(< (+ main_~z~0 10) main_~y~0)} [118] L11-2-->L18-1_primed: Formula: (let ((.cse1 (= v_main_~y~0_416 v_main_~y~0_415)) (.cse2 (= v_main_~x~0_476 v_main_~x~0_475)) (.cse3 (= |v_main_#t~post6_102| |v_main_#t~post6_101|)) (.cse4 (= |v_main_#t~post5_102| |v_main_#t~post5_101|)) (.cse0 (<= 50000 v_main_~x~0_476))) (or (and (or (not (< v_main_~x~0_476 1000000)) (not .cse0)) .cse1 .cse2 .cse3 .cse4) (and .cse1 .cse2 .cse3 .cse4) (and (< v_main_~x~0_476 v_main_~x~0_475) (= (+ v_main_~x~0_476 v_main_~y~0_415) (+ v_main_~x~0_475 v_main_~y~0_416)) .cse0 (< v_main_~x~0_475 1000001)))) InVars {main_~y~0=v_main_~y~0_416, main_#t~post5=|v_main_#t~post5_102|, main_~x~0=v_main_~x~0_476, main_#t~post6=|v_main_#t~post6_102|} OutVars{main_~y~0=v_main_~y~0_415, main_#t~post5=|v_main_#t~post5_101|, main_~x~0=v_main_~x~0_475, main_#t~post6=|v_main_#t~post6_101|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {9179#(< (+ main_~z~0 10) main_~y~0)} is VALID [2022-04-28 03:43:50,689 INFO L290 TraceCheckUtils]: 7: Hoare triple {9179#(< (+ main_~z~0 10) main_~y~0)} [117] L18-1_primed-->L11-2: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {9179#(< (+ main_~z~0 10) main_~y~0)} is VALID [2022-04-28 03:43:50,689 INFO L290 TraceCheckUtils]: 6: Hoare triple {9179#(< (+ main_~z~0 10) main_~y~0)} [116] L11-2-->L18-1_primed: Formula: (let ((.cse0 (= v_main_~x~0_474 v_main_~x~0_473)) (.cse1 (= |v_main_#t~post4_95| |v_main_#t~post4_94|))) (or (and (< v_main_~x~0_473 50001) (< v_main_~x~0_474 v_main_~x~0_473)) (and .cse0 (not (< v_main_~x~0_474 50000)) .cse1) (and .cse0 .cse1))) InVars {main_~x~0=v_main_~x~0_474, main_#t~post4=|v_main_#t~post4_95|} OutVars{main_~x~0=v_main_~x~0_473, main_#t~post4=|v_main_#t~post4_94|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {9179#(< (+ main_~z~0 10) main_~y~0)} is VALID [2022-04-28 03:43:50,689 INFO L290 TraceCheckUtils]: 5: Hoare triple {9021#true} ~x~0 := 0;~y~0 := 50000;~z~0 := 0;~x~0 := 0; {9179#(< (+ main_~z~0 10) main_~y~0)} is VALID [2022-04-28 03:43:50,689 INFO L272 TraceCheckUtils]: 4: Hoare triple {9021#true} call #t~ret9 := main(); {9021#true} is VALID [2022-04-28 03:43:50,689 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {9021#true} {9021#true} #52#return; {9021#true} is VALID [2022-04-28 03:43:50,689 INFO L290 TraceCheckUtils]: 2: Hoare triple {9021#true} assume true; {9021#true} is VALID [2022-04-28 03:43:50,690 INFO L290 TraceCheckUtils]: 1: Hoare triple {9021#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(17, 2);call #Ultimate.allocInit(12, 3); {9021#true} is VALID [2022-04-28 03:43:50,690 INFO L272 TraceCheckUtils]: 0: Hoare triple {9021#true} call ULTIMATE.init(); {9021#true} is VALID [2022-04-28 03:43:50,690 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-04-28 03:43:50,690 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1655841673] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 03:43:50,690 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 03:43:50,690 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 13, 13] total 39 [2022-04-28 03:43:51,404 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 03:43:51,404 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1170535514] [2022-04-28 03:43:51,404 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1170535514] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 03:43:51,404 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 03:43:51,404 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [36] imperfect sequences [] total 36 [2022-04-28 03:43:51,404 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1446274680] [2022-04-28 03:43:51,404 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 03:43:51,405 INFO L78 Accepts]: Start accepts. Automaton has has 36 states, 36 states have (on average 1.6666666666666667) internal successors, (60), 35 states have internal predecessors, (60), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 64 [2022-04-28 03:43:51,405 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 03:43:51,405 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 36 states, 36 states have (on average 1.6666666666666667) internal successors, (60), 35 states have internal predecessors, (60), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:43:51,450 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 64 edges. 64 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 03:43:51,451 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 36 states [2022-04-28 03:43:51,451 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 03:43:51,451 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2022-04-28 03:43:51,452 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1434, Invalid=2226, Unknown=0, NotChecked=0, Total=3660 [2022-04-28 03:43:51,452 INFO L87 Difference]: Start difference. First operand 103 states and 107 transitions. Second operand has 36 states, 36 states have (on average 1.6666666666666667) internal successors, (60), 35 states have internal predecessors, (60), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:43:54,024 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:43:54,024 INFO L93 Difference]: Finished difference Result 161 states and 171 transitions. [2022-04-28 03:43:54,024 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2022-04-28 03:43:54,024 INFO L78 Accepts]: Start accepts. Automaton has has 36 states, 36 states have (on average 1.6666666666666667) internal successors, (60), 35 states have internal predecessors, (60), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 64 [2022-04-28 03:43:54,024 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 03:43:54,024 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 36 states, 36 states have (on average 1.6666666666666667) internal successors, (60), 35 states have internal predecessors, (60), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:43:54,025 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 85 transitions. [2022-04-28 03:43:54,026 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 36 states, 36 states have (on average 1.6666666666666667) internal successors, (60), 35 states have internal predecessors, (60), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:43:54,026 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 85 transitions. [2022-04-28 03:43:54,027 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 36 states and 85 transitions. [2022-04-28 03:43:54,111 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 85 edges. 85 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 03:43:54,112 INFO L225 Difference]: With dead ends: 161 [2022-04-28 03:43:54,112 INFO L226 Difference]: Without dead ends: 106 [2022-04-28 03:43:54,113 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 148 GetRequests, 54 SyntacticMatches, 2 SemanticMatches, 92 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2527 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=2878, Invalid=5864, Unknown=0, NotChecked=0, Total=8742 [2022-04-28 03:43:54,113 INFO L413 NwaCegarLoop]: 12 mSDtfsCounter, 103 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 1010 mSolverCounterSat, 111 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 103 SdHoareTripleChecker+Valid, 19 SdHoareTripleChecker+Invalid, 1121 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 111 IncrementalHoareTripleChecker+Valid, 1010 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2022-04-28 03:43:54,113 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [103 Valid, 19 Invalid, 1121 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [111 Valid, 1010 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2022-04-28 03:43:54,113 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states. [2022-04-28 03:43:54,316 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 106. [2022-04-28 03:43:54,316 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 03:43:54,317 INFO L82 GeneralOperation]: Start isEquivalent. First operand 106 states. Second operand has 106 states, 101 states have (on average 1.0495049504950495) internal successors, (106), 101 states have internal predecessors, (106), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:43:54,317 INFO L74 IsIncluded]: Start isIncluded. First operand 106 states. Second operand has 106 states, 101 states have (on average 1.0495049504950495) internal successors, (106), 101 states have internal predecessors, (106), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:43:54,317 INFO L87 Difference]: Start difference. First operand 106 states. Second operand has 106 states, 101 states have (on average 1.0495049504950495) internal successors, (106), 101 states have internal predecessors, (106), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:43:54,318 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:43:54,318 INFO L93 Difference]: Finished difference Result 106 states and 110 transitions. [2022-04-28 03:43:54,318 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 110 transitions. [2022-04-28 03:43:54,318 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:43:54,319 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:43:54,319 INFO L74 IsIncluded]: Start isIncluded. First operand has 106 states, 101 states have (on average 1.0495049504950495) internal successors, (106), 101 states have internal predecessors, (106), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 106 states. [2022-04-28 03:43:54,319 INFO L87 Difference]: Start difference. First operand has 106 states, 101 states have (on average 1.0495049504950495) internal successors, (106), 101 states have internal predecessors, (106), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 106 states. [2022-04-28 03:43:54,320 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:43:54,320 INFO L93 Difference]: Finished difference Result 106 states and 110 transitions. [2022-04-28 03:43:54,320 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 110 transitions. [2022-04-28 03:43:54,321 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:43:54,321 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:43:54,321 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 03:43:54,321 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 03:43:54,321 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 106 states, 101 states have (on average 1.0495049504950495) internal successors, (106), 101 states have internal predecessors, (106), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:43:54,323 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 110 transitions. [2022-04-28 03:43:54,323 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 110 transitions. Word has length 64 [2022-04-28 03:43:54,323 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 03:43:54,323 INFO L495 AbstractCegarLoop]: Abstraction has 106 states and 110 transitions. [2022-04-28 03:43:54,323 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 36 states, 36 states have (on average 1.6666666666666667) internal successors, (60), 35 states have internal predecessors, (60), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:43:54,323 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 106 states and 110 transitions. [2022-04-28 03:43:54,436 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 110 edges. 110 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 03:43:54,436 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 110 transitions. [2022-04-28 03:43:54,437 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2022-04-28 03:43:54,437 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 03:43:54,437 INFO L195 NwaCegarLoop]: trace histogram [22, 21, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 03:43:54,457 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Forceful destruction successful, exit code 0 [2022-04-28 03:43:54,637 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2022-04-28 03:43:54,638 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 03:43:54,638 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 03:43:54,638 INFO L85 PathProgramCache]: Analyzing trace with hash 1447479616, now seen corresponding path program 16 times [2022-04-28 03:43:54,638 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 03:43:54,638 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [904511148] [2022-04-28 03:43:54,746 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 1 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 03:43:54,955 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={1=1, 2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 03:43:54,956 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-28 03:43:54,958 INFO L85 PathProgramCache]: Analyzing trace with hash -1931266846, now seen corresponding path program 1 times [2022-04-28 03:43:54,959 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 03:43:54,959 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1895805111] [2022-04-28 03:43:54,959 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:43:54,959 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 03:43:54,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:43:55,157 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 03:43:55,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:43:55,162 INFO L290 TraceCheckUtils]: 0: Hoare triple {10063#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(17, 2);call #Ultimate.allocInit(12, 3); {10046#true} is VALID [2022-04-28 03:43:55,162 INFO L290 TraceCheckUtils]: 1: Hoare triple {10046#true} assume true; {10046#true} is VALID [2022-04-28 03:43:55,162 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {10046#true} {10046#true} #52#return; {10046#true} is VALID [2022-04-28 03:43:55,163 INFO L272 TraceCheckUtils]: 0: Hoare triple {10046#true} call ULTIMATE.init(); {10063#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 03:43:55,163 INFO L290 TraceCheckUtils]: 1: Hoare triple {10063#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(17, 2);call #Ultimate.allocInit(12, 3); {10046#true} is VALID [2022-04-28 03:43:55,163 INFO L290 TraceCheckUtils]: 2: Hoare triple {10046#true} assume true; {10046#true} is VALID [2022-04-28 03:43:55,163 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {10046#true} {10046#true} #52#return; {10046#true} is VALID [2022-04-28 03:43:55,163 INFO L272 TraceCheckUtils]: 4: Hoare triple {10046#true} call #t~ret9 := main(); {10046#true} is VALID [2022-04-28 03:43:55,163 INFO L290 TraceCheckUtils]: 5: Hoare triple {10046#true} ~x~0 := 0;~y~0 := 50000;~z~0 := 0;~x~0 := 0; {10051#(and (= main_~z~0 0) (<= 50000 main_~y~0))} is VALID [2022-04-28 03:43:55,164 INFO L290 TraceCheckUtils]: 6: Hoare triple {10051#(and (= main_~z~0 0) (<= 50000 main_~y~0))} [120] L11-2-->L18-1_primed: Formula: (let ((.cse0 (= v_main_~x~0_521 v_main_~x~0_520)) (.cse1 (= |v_main_#t~post4_101| |v_main_#t~post4_100|))) (or (and (not (< v_main_~x~0_521 50000)) .cse0 .cse1) (and (< v_main_~x~0_521 v_main_~x~0_520) (< v_main_~x~0_520 50001)) (and .cse0 .cse1))) InVars {main_~x~0=v_main_~x~0_521, main_#t~post4=|v_main_#t~post4_101|} OutVars{main_~x~0=v_main_~x~0_520, main_#t~post4=|v_main_#t~post4_100|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {10051#(and (= main_~z~0 0) (<= 50000 main_~y~0))} is VALID [2022-04-28 03:43:55,164 INFO L290 TraceCheckUtils]: 7: Hoare triple {10051#(and (= main_~z~0 0) (<= 50000 main_~y~0))} [121] L18-1_primed-->L11-2: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {10051#(and (= main_~z~0 0) (<= 50000 main_~y~0))} is VALID [2022-04-28 03:43:55,165 INFO L290 TraceCheckUtils]: 8: Hoare triple {10051#(and (= main_~z~0 0) (<= 50000 main_~y~0))} [122] L11-2-->L18-1_primed: Formula: (let ((.cse0 (= v_main_~y~0_465 v_main_~y~0_464)) (.cse4 (<= 50000 v_main_~x~0_523)) (.cse1 (= |v_main_#t~post6_109| |v_main_#t~post6_108|)) (.cse2 (= |v_main_#t~post5_109| |v_main_#t~post5_108|))) (or (and .cse0 (= v_main_~x~0_523 v_main_~x~0_522) .cse1 .cse2) (let ((.cse3 (+ v_main_~x~0_523 v_main_~y~0_464))) (and (< .cse3 (+ v_main_~y~0_465 1000001)) (= .cse3 (+ v_main_~x~0_522 v_main_~y~0_465)) (< v_main_~y~0_465 v_main_~y~0_464) .cse4)) (and .cse0 (= v_main_~x~0_522 v_main_~x~0_523) (or (not .cse4) (not (< v_main_~x~0_523 1000000))) .cse1 .cse2))) InVars {main_~y~0=v_main_~y~0_465, main_#t~post5=|v_main_#t~post5_109|, main_~x~0=v_main_~x~0_523, main_#t~post6=|v_main_#t~post6_109|} OutVars{main_~y~0=v_main_~y~0_464, main_#t~post5=|v_main_#t~post5_108|, main_~x~0=v_main_~x~0_522, main_#t~post6=|v_main_#t~post6_108|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {10051#(and (= main_~z~0 0) (<= 50000 main_~y~0))} is VALID [2022-04-28 03:43:55,165 INFO L290 TraceCheckUtils]: 9: Hoare triple {10051#(and (= main_~z~0 0) (<= 50000 main_~y~0))} [119] L18-1_primed-->L18-1: Formula: (not (< v_main_~x~0_11 1000000)) InVars {main_~x~0=v_main_~x~0_11} OutVars{main_~x~0=v_main_~x~0_11} AuxVars[] AssignedVars[] {10051#(and (= main_~z~0 0) (<= 50000 main_~y~0))} is VALID [2022-04-28 03:43:55,166 INFO L290 TraceCheckUtils]: 10: Hoare triple {10051#(and (= main_~z~0 0) (<= 50000 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {10052#(and (= main_~z~0 0) (<= 49999 main_~y~0))} is VALID [2022-04-28 03:43:55,166 INFO L290 TraceCheckUtils]: 11: Hoare triple {10052#(and (= main_~z~0 0) (<= 49999 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {10053#(and (<= 49998 main_~y~0) (= main_~z~0 0))} is VALID [2022-04-28 03:43:55,167 INFO L290 TraceCheckUtils]: 12: Hoare triple {10053#(and (<= 49998 main_~y~0) (= main_~z~0 0))} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {10054#(and (= main_~z~0 0) (<= 49997 main_~y~0))} is VALID [2022-04-28 03:43:55,167 INFO L290 TraceCheckUtils]: 13: Hoare triple {10054#(and (= main_~z~0 0) (<= 49997 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {10055#(and (= main_~z~0 0) (<= 49996 main_~y~0))} is VALID [2022-04-28 03:43:55,168 INFO L290 TraceCheckUtils]: 14: Hoare triple {10055#(and (= main_~z~0 0) (<= 49996 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {10056#(and (= main_~z~0 0) (<= 49995 main_~y~0))} is VALID [2022-04-28 03:43:55,168 INFO L290 TraceCheckUtils]: 15: Hoare triple {10056#(and (= main_~z~0 0) (<= 49995 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {10057#(and (= main_~z~0 0) (<= 49994 main_~y~0))} is VALID [2022-04-28 03:43:55,169 INFO L290 TraceCheckUtils]: 16: Hoare triple {10057#(and (= main_~z~0 0) (<= 49994 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {10058#(and (= main_~z~0 0) (<= 49993 main_~y~0))} is VALID [2022-04-28 03:43:55,169 INFO L290 TraceCheckUtils]: 17: Hoare triple {10058#(and (= main_~z~0 0) (<= 49993 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {10059#(and (= main_~z~0 0) (<= 49992 main_~y~0))} is VALID [2022-04-28 03:43:55,170 INFO L290 TraceCheckUtils]: 18: Hoare triple {10059#(and (= main_~z~0 0) (<= 49992 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {10060#(and (= main_~z~0 0) (<= 49991 main_~y~0))} is VALID [2022-04-28 03:43:55,170 INFO L290 TraceCheckUtils]: 19: Hoare triple {10060#(and (= main_~z~0 0) (<= 49991 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {10061#(and (<= 49990 main_~y~0) (= main_~z~0 0))} is VALID [2022-04-28 03:43:55,171 INFO L290 TraceCheckUtils]: 20: Hoare triple {10061#(and (<= 49990 main_~y~0) (= main_~z~0 0))} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {10062#(and (= main_~z~0 0) (<= 49989 main_~y~0))} is VALID [2022-04-28 03:43:55,171 INFO L290 TraceCheckUtils]: 21: Hoare triple {10062#(and (= main_~z~0 0) (<= 49989 main_~y~0))} assume !(~y~0 > ~z~0); {10047#false} is VALID [2022-04-28 03:43:55,171 INFO L272 TraceCheckUtils]: 22: Hoare triple {10047#false} call __VERIFIER_assert((if ~x~0 == ~z~0 then 1 else 0)); {10047#false} is VALID [2022-04-28 03:43:55,171 INFO L290 TraceCheckUtils]: 23: Hoare triple {10047#false} ~cond := #in~cond; {10047#false} is VALID [2022-04-28 03:43:55,171 INFO L290 TraceCheckUtils]: 24: Hoare triple {10047#false} assume 0 == ~cond; {10047#false} is VALID [2022-04-28 03:43:55,171 INFO L290 TraceCheckUtils]: 25: Hoare triple {10047#false} assume !false; {10047#false} is VALID [2022-04-28 03:43:55,171 INFO L134 CoverageAnalysis]: Checked inductivity of 68 backedges. 0 proven. 66 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-04-28 03:43:55,172 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 03:43:55,172 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1895805111] [2022-04-28 03:43:55,172 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1895805111] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 03:43:55,172 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [123239304] [2022-04-28 03:43:55,172 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:43:55,172 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 03:43:55,172 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 03:43:55,173 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 03:43:55,173 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Waiting until timeout for monitored process [2022-04-28 03:43:55,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:43:55,207 INFO L263 TraceCheckSpWp]: Trace formula consists of 114 conjuncts, 15 conjunts are in the unsatisfiable core [2022-04-28 03:43:55,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:43:55,218 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 03:43:55,728 INFO L272 TraceCheckUtils]: 0: Hoare triple {10046#true} call ULTIMATE.init(); {10046#true} is VALID [2022-04-28 03:43:55,729 INFO L290 TraceCheckUtils]: 1: Hoare triple {10046#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(17, 2);call #Ultimate.allocInit(12, 3); {10046#true} is VALID [2022-04-28 03:43:55,729 INFO L290 TraceCheckUtils]: 2: Hoare triple {10046#true} assume true; {10046#true} is VALID [2022-04-28 03:43:55,729 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {10046#true} {10046#true} #52#return; {10046#true} is VALID [2022-04-28 03:43:55,729 INFO L272 TraceCheckUtils]: 4: Hoare triple {10046#true} call #t~ret9 := main(); {10046#true} is VALID [2022-04-28 03:43:55,729 INFO L290 TraceCheckUtils]: 5: Hoare triple {10046#true} ~x~0 := 0;~y~0 := 50000;~z~0 := 0;~x~0 := 0; {10082#(and (<= main_~z~0 0) (<= 50000 main_~y~0))} is VALID [2022-04-28 03:43:55,730 INFO L290 TraceCheckUtils]: 6: Hoare triple {10082#(and (<= main_~z~0 0) (<= 50000 main_~y~0))} [120] L11-2-->L18-1_primed: Formula: (let ((.cse0 (= v_main_~x~0_521 v_main_~x~0_520)) (.cse1 (= |v_main_#t~post4_101| |v_main_#t~post4_100|))) (or (and (not (< v_main_~x~0_521 50000)) .cse0 .cse1) (and (< v_main_~x~0_521 v_main_~x~0_520) (< v_main_~x~0_520 50001)) (and .cse0 .cse1))) InVars {main_~x~0=v_main_~x~0_521, main_#t~post4=|v_main_#t~post4_101|} OutVars{main_~x~0=v_main_~x~0_520, main_#t~post4=|v_main_#t~post4_100|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {10082#(and (<= main_~z~0 0) (<= 50000 main_~y~0))} is VALID [2022-04-28 03:43:55,730 INFO L290 TraceCheckUtils]: 7: Hoare triple {10082#(and (<= main_~z~0 0) (<= 50000 main_~y~0))} [121] L18-1_primed-->L11-2: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {10082#(and (<= main_~z~0 0) (<= 50000 main_~y~0))} is VALID [2022-04-28 03:43:55,731 INFO L290 TraceCheckUtils]: 8: Hoare triple {10082#(and (<= main_~z~0 0) (<= 50000 main_~y~0))} [122] L11-2-->L18-1_primed: Formula: (let ((.cse0 (= v_main_~y~0_465 v_main_~y~0_464)) (.cse4 (<= 50000 v_main_~x~0_523)) (.cse1 (= |v_main_#t~post6_109| |v_main_#t~post6_108|)) (.cse2 (= |v_main_#t~post5_109| |v_main_#t~post5_108|))) (or (and .cse0 (= v_main_~x~0_523 v_main_~x~0_522) .cse1 .cse2) (let ((.cse3 (+ v_main_~x~0_523 v_main_~y~0_464))) (and (< .cse3 (+ v_main_~y~0_465 1000001)) (= .cse3 (+ v_main_~x~0_522 v_main_~y~0_465)) (< v_main_~y~0_465 v_main_~y~0_464) .cse4)) (and .cse0 (= v_main_~x~0_522 v_main_~x~0_523) (or (not .cse4) (not (< v_main_~x~0_523 1000000))) .cse1 .cse2))) InVars {main_~y~0=v_main_~y~0_465, main_#t~post5=|v_main_#t~post5_109|, main_~x~0=v_main_~x~0_523, main_#t~post6=|v_main_#t~post6_109|} OutVars{main_~y~0=v_main_~y~0_464, main_#t~post5=|v_main_#t~post5_108|, main_~x~0=v_main_~x~0_522, main_#t~post6=|v_main_#t~post6_108|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {10082#(and (<= main_~z~0 0) (<= 50000 main_~y~0))} is VALID [2022-04-28 03:43:55,731 INFO L290 TraceCheckUtils]: 9: Hoare triple {10082#(and (<= main_~z~0 0) (<= 50000 main_~y~0))} [119] L18-1_primed-->L18-1: Formula: (not (< v_main_~x~0_11 1000000)) InVars {main_~x~0=v_main_~x~0_11} OutVars{main_~x~0=v_main_~x~0_11} AuxVars[] AssignedVars[] {10082#(and (<= main_~z~0 0) (<= 50000 main_~y~0))} is VALID [2022-04-28 03:43:55,732 INFO L290 TraceCheckUtils]: 10: Hoare triple {10082#(and (<= main_~z~0 0) (<= 50000 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {10098#(and (<= main_~z~0 0) (<= 49999 main_~y~0))} is VALID [2022-04-28 03:43:55,732 INFO L290 TraceCheckUtils]: 11: Hoare triple {10098#(and (<= main_~z~0 0) (<= 49999 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {10102#(and (<= main_~z~0 0) (<= 49998 main_~y~0))} is VALID [2022-04-28 03:43:55,733 INFO L290 TraceCheckUtils]: 12: Hoare triple {10102#(and (<= main_~z~0 0) (<= 49998 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {10106#(and (<= main_~z~0 0) (<= 49997 main_~y~0))} is VALID [2022-04-28 03:43:55,733 INFO L290 TraceCheckUtils]: 13: Hoare triple {10106#(and (<= main_~z~0 0) (<= 49997 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {10110#(and (<= main_~z~0 0) (<= 49996 main_~y~0))} is VALID [2022-04-28 03:43:55,734 INFO L290 TraceCheckUtils]: 14: Hoare triple {10110#(and (<= main_~z~0 0) (<= 49996 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {10114#(and (<= main_~z~0 0) (<= 49995 main_~y~0))} is VALID [2022-04-28 03:43:55,734 INFO L290 TraceCheckUtils]: 15: Hoare triple {10114#(and (<= main_~z~0 0) (<= 49995 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {10118#(and (<= main_~z~0 0) (<= 49994 main_~y~0))} is VALID [2022-04-28 03:43:55,734 INFO L290 TraceCheckUtils]: 16: Hoare triple {10118#(and (<= main_~z~0 0) (<= 49994 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {10122#(and (<= main_~z~0 0) (<= 49993 main_~y~0))} is VALID [2022-04-28 03:43:55,735 INFO L290 TraceCheckUtils]: 17: Hoare triple {10122#(and (<= main_~z~0 0) (<= 49993 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {10126#(and (<= main_~z~0 0) (<= 49992 main_~y~0))} is VALID [2022-04-28 03:43:55,735 INFO L290 TraceCheckUtils]: 18: Hoare triple {10126#(and (<= main_~z~0 0) (<= 49992 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {10130#(and (<= main_~z~0 0) (<= 49991 main_~y~0))} is VALID [2022-04-28 03:43:55,736 INFO L290 TraceCheckUtils]: 19: Hoare triple {10130#(and (<= main_~z~0 0) (<= 49991 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {10134#(and (<= main_~z~0 0) (<= 49990 main_~y~0))} is VALID [2022-04-28 03:43:55,736 INFO L290 TraceCheckUtils]: 20: Hoare triple {10134#(and (<= main_~z~0 0) (<= 49990 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {10138#(and (<= main_~z~0 0) (<= 49989 main_~y~0))} is VALID [2022-04-28 03:43:55,737 INFO L290 TraceCheckUtils]: 21: Hoare triple {10138#(and (<= main_~z~0 0) (<= 49989 main_~y~0))} assume !(~y~0 > ~z~0); {10047#false} is VALID [2022-04-28 03:43:55,737 INFO L272 TraceCheckUtils]: 22: Hoare triple {10047#false} call __VERIFIER_assert((if ~x~0 == ~z~0 then 1 else 0)); {10047#false} is VALID [2022-04-28 03:43:55,737 INFO L290 TraceCheckUtils]: 23: Hoare triple {10047#false} ~cond := #in~cond; {10047#false} is VALID [2022-04-28 03:43:55,737 INFO L290 TraceCheckUtils]: 24: Hoare triple {10047#false} assume 0 == ~cond; {10047#false} is VALID [2022-04-28 03:43:55,737 INFO L290 TraceCheckUtils]: 25: Hoare triple {10047#false} assume !false; {10047#false} is VALID [2022-04-28 03:43:55,737 INFO L134 CoverageAnalysis]: Checked inductivity of 68 backedges. 0 proven. 66 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-04-28 03:43:55,737 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 03:43:56,347 INFO L290 TraceCheckUtils]: 25: Hoare triple {10047#false} assume !false; {10047#false} is VALID [2022-04-28 03:43:56,347 INFO L290 TraceCheckUtils]: 24: Hoare triple {10047#false} assume 0 == ~cond; {10047#false} is VALID [2022-04-28 03:43:56,347 INFO L290 TraceCheckUtils]: 23: Hoare triple {10047#false} ~cond := #in~cond; {10047#false} is VALID [2022-04-28 03:43:56,347 INFO L272 TraceCheckUtils]: 22: Hoare triple {10047#false} call __VERIFIER_assert((if ~x~0 == ~z~0 then 1 else 0)); {10047#false} is VALID [2022-04-28 03:43:56,348 INFO L290 TraceCheckUtils]: 21: Hoare triple {10166#(< main_~z~0 main_~y~0)} assume !(~y~0 > ~z~0); {10047#false} is VALID [2022-04-28 03:43:56,348 INFO L290 TraceCheckUtils]: 20: Hoare triple {10170#(< (+ main_~z~0 1) main_~y~0)} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {10166#(< main_~z~0 main_~y~0)} is VALID [2022-04-28 03:43:56,349 INFO L290 TraceCheckUtils]: 19: Hoare triple {10174#(< (+ main_~z~0 2) main_~y~0)} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {10170#(< (+ main_~z~0 1) main_~y~0)} is VALID [2022-04-28 03:43:56,349 INFO L290 TraceCheckUtils]: 18: Hoare triple {10178#(< (+ main_~z~0 3) main_~y~0)} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {10174#(< (+ main_~z~0 2) main_~y~0)} is VALID [2022-04-28 03:43:56,350 INFO L290 TraceCheckUtils]: 17: Hoare triple {10182#(< (+ main_~z~0 4) main_~y~0)} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {10178#(< (+ main_~z~0 3) main_~y~0)} is VALID [2022-04-28 03:43:56,350 INFO L290 TraceCheckUtils]: 16: Hoare triple {10186#(< (+ 5 main_~z~0) main_~y~0)} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {10182#(< (+ main_~z~0 4) main_~y~0)} is VALID [2022-04-28 03:43:56,350 INFO L290 TraceCheckUtils]: 15: Hoare triple {10190#(< (+ main_~z~0 6) main_~y~0)} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {10186#(< (+ 5 main_~z~0) main_~y~0)} is VALID [2022-04-28 03:43:56,351 INFO L290 TraceCheckUtils]: 14: Hoare triple {10194#(< (+ 7 main_~z~0) main_~y~0)} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {10190#(< (+ main_~z~0 6) main_~y~0)} is VALID [2022-04-28 03:43:56,351 INFO L290 TraceCheckUtils]: 13: Hoare triple {10198#(< (+ main_~z~0 8) main_~y~0)} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {10194#(< (+ 7 main_~z~0) main_~y~0)} is VALID [2022-04-28 03:43:56,352 INFO L290 TraceCheckUtils]: 12: Hoare triple {10202#(< (+ main_~z~0 9) main_~y~0)} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {10198#(< (+ main_~z~0 8) main_~y~0)} is VALID [2022-04-28 03:43:56,352 INFO L290 TraceCheckUtils]: 11: Hoare triple {10206#(< (+ main_~z~0 10) main_~y~0)} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {10202#(< (+ main_~z~0 9) main_~y~0)} is VALID [2022-04-28 03:43:56,353 INFO L290 TraceCheckUtils]: 10: Hoare triple {10210#(< (+ main_~z~0 11) main_~y~0)} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {10206#(< (+ main_~z~0 10) main_~y~0)} is VALID [2022-04-28 03:43:56,353 INFO L290 TraceCheckUtils]: 9: Hoare triple {10210#(< (+ main_~z~0 11) main_~y~0)} [119] L18-1_primed-->L18-1: Formula: (not (< v_main_~x~0_11 1000000)) InVars {main_~x~0=v_main_~x~0_11} OutVars{main_~x~0=v_main_~x~0_11} AuxVars[] AssignedVars[] {10210#(< (+ main_~z~0 11) main_~y~0)} is VALID [2022-04-28 03:43:56,354 INFO L290 TraceCheckUtils]: 8: Hoare triple {10210#(< (+ main_~z~0 11) main_~y~0)} [122] L11-2-->L18-1_primed: Formula: (let ((.cse0 (= v_main_~y~0_465 v_main_~y~0_464)) (.cse4 (<= 50000 v_main_~x~0_523)) (.cse1 (= |v_main_#t~post6_109| |v_main_#t~post6_108|)) (.cse2 (= |v_main_#t~post5_109| |v_main_#t~post5_108|))) (or (and .cse0 (= v_main_~x~0_523 v_main_~x~0_522) .cse1 .cse2) (let ((.cse3 (+ v_main_~x~0_523 v_main_~y~0_464))) (and (< .cse3 (+ v_main_~y~0_465 1000001)) (= .cse3 (+ v_main_~x~0_522 v_main_~y~0_465)) (< v_main_~y~0_465 v_main_~y~0_464) .cse4)) (and .cse0 (= v_main_~x~0_522 v_main_~x~0_523) (or (not .cse4) (not (< v_main_~x~0_523 1000000))) .cse1 .cse2))) InVars {main_~y~0=v_main_~y~0_465, main_#t~post5=|v_main_#t~post5_109|, main_~x~0=v_main_~x~0_523, main_#t~post6=|v_main_#t~post6_109|} OutVars{main_~y~0=v_main_~y~0_464, main_#t~post5=|v_main_#t~post5_108|, main_~x~0=v_main_~x~0_522, main_#t~post6=|v_main_#t~post6_108|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {10210#(< (+ main_~z~0 11) main_~y~0)} is VALID [2022-04-28 03:43:56,354 INFO L290 TraceCheckUtils]: 7: Hoare triple {10210#(< (+ main_~z~0 11) main_~y~0)} [121] L18-1_primed-->L11-2: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {10210#(< (+ main_~z~0 11) main_~y~0)} is VALID [2022-04-28 03:43:56,355 INFO L290 TraceCheckUtils]: 6: Hoare triple {10210#(< (+ main_~z~0 11) main_~y~0)} [120] L11-2-->L18-1_primed: Formula: (let ((.cse0 (= v_main_~x~0_521 v_main_~x~0_520)) (.cse1 (= |v_main_#t~post4_101| |v_main_#t~post4_100|))) (or (and (not (< v_main_~x~0_521 50000)) .cse0 .cse1) (and (< v_main_~x~0_521 v_main_~x~0_520) (< v_main_~x~0_520 50001)) (and .cse0 .cse1))) InVars {main_~x~0=v_main_~x~0_521, main_#t~post4=|v_main_#t~post4_101|} OutVars{main_~x~0=v_main_~x~0_520, main_#t~post4=|v_main_#t~post4_100|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {10210#(< (+ main_~z~0 11) main_~y~0)} is VALID [2022-04-28 03:43:56,355 INFO L290 TraceCheckUtils]: 5: Hoare triple {10046#true} ~x~0 := 0;~y~0 := 50000;~z~0 := 0;~x~0 := 0; {10210#(< (+ main_~z~0 11) main_~y~0)} is VALID [2022-04-28 03:43:56,355 INFO L272 TraceCheckUtils]: 4: Hoare triple {10046#true} call #t~ret9 := main(); {10046#true} is VALID [2022-04-28 03:43:56,355 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {10046#true} {10046#true} #52#return; {10046#true} is VALID [2022-04-28 03:43:56,355 INFO L290 TraceCheckUtils]: 2: Hoare triple {10046#true} assume true; {10046#true} is VALID [2022-04-28 03:43:56,355 INFO L290 TraceCheckUtils]: 1: Hoare triple {10046#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(17, 2);call #Ultimate.allocInit(12, 3); {10046#true} is VALID [2022-04-28 03:43:56,355 INFO L272 TraceCheckUtils]: 0: Hoare triple {10046#true} call ULTIMATE.init(); {10046#true} is VALID [2022-04-28 03:43:56,355 INFO L134 CoverageAnalysis]: Checked inductivity of 68 backedges. 0 proven. 66 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-04-28 03:43:56,356 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [123239304] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 03:43:56,356 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 03:43:56,356 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 14, 14] total 39 [2022-04-28 03:43:57,136 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 03:43:57,136 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [904511148] [2022-04-28 03:43:57,137 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [904511148] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 03:43:57,137 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 03:43:57,137 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [38] imperfect sequences [] total 38 [2022-04-28 03:43:57,137 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1517594391] [2022-04-28 03:43:57,137 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 03:43:57,137 INFO L78 Accepts]: Start accepts. Automaton has has 38 states, 38 states have (on average 1.6578947368421053) internal successors, (63), 37 states have internal predecessors, (63), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 67 [2022-04-28 03:43:57,137 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 03:43:57,137 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 38 states, 38 states have (on average 1.6578947368421053) internal successors, (63), 37 states have internal predecessors, (63), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:43:57,187 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 67 edges. 67 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 03:43:57,187 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 38 states [2022-04-28 03:43:57,187 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 03:43:57,188 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2022-04-28 03:43:57,188 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1535, Invalid=2247, Unknown=0, NotChecked=0, Total=3782 [2022-04-28 03:43:57,188 INFO L87 Difference]: Start difference. First operand 106 states and 110 transitions. Second operand has 38 states, 38 states have (on average 1.6578947368421053) internal successors, (63), 37 states have internal predecessors, (63), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:43:59,757 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:43:59,758 INFO L93 Difference]: Finished difference Result 171 states and 187 transitions. [2022-04-28 03:43:59,758 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2022-04-28 03:43:59,758 INFO L78 Accepts]: Start accepts. Automaton has has 38 states, 38 states have (on average 1.6578947368421053) internal successors, (63), 37 states have internal predecessors, (63), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 67 [2022-04-28 03:43:59,758 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 03:43:59,758 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 38 states, 38 states have (on average 1.6578947368421053) internal successors, (63), 37 states have internal predecessors, (63), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:43:59,759 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 93 transitions. [2022-04-28 03:43:59,759 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 38 states, 38 states have (on average 1.6578947368421053) internal successors, (63), 37 states have internal predecessors, (63), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:43:59,760 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 93 transitions. [2022-04-28 03:43:59,760 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 38 states and 93 transitions. [2022-04-28 03:43:59,843 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 93 edges. 93 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 03:43:59,847 INFO L225 Difference]: With dead ends: 171 [2022-04-28 03:43:59,848 INFO L226 Difference]: Without dead ends: 115 [2022-04-28 03:43:59,849 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 153 GetRequests, 56 SyntacticMatches, 2 SemanticMatches, 95 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2616 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=3177, Invalid=6135, Unknown=0, NotChecked=0, Total=9312 [2022-04-28 03:43:59,849 INFO L413 NwaCegarLoop]: 12 mSDtfsCounter, 57 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 1052 mSolverCounterSat, 96 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 57 SdHoareTripleChecker+Valid, 34 SdHoareTripleChecker+Invalid, 1148 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 96 IncrementalHoareTripleChecker+Valid, 1052 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2022-04-28 03:43:59,850 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [57 Valid, 34 Invalid, 1148 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [96 Valid, 1052 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2022-04-28 03:43:59,851 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115 states. [2022-04-28 03:44:00,013 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115 to 73. [2022-04-28 03:44:00,013 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 03:44:00,013 INFO L82 GeneralOperation]: Start isEquivalent. First operand 115 states. Second operand has 73 states, 68 states have (on average 1.0588235294117647) internal successors, (72), 68 states have internal predecessors, (72), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:44:00,013 INFO L74 IsIncluded]: Start isIncluded. First operand 115 states. Second operand has 73 states, 68 states have (on average 1.0588235294117647) internal successors, (72), 68 states have internal predecessors, (72), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:44:00,014 INFO L87 Difference]: Start difference. First operand 115 states. Second operand has 73 states, 68 states have (on average 1.0588235294117647) internal successors, (72), 68 states have internal predecessors, (72), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:44:00,015 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:44:00,015 INFO L93 Difference]: Finished difference Result 115 states and 119 transitions. [2022-04-28 03:44:00,015 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 119 transitions. [2022-04-28 03:44:00,016 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:44:00,016 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:44:00,016 INFO L74 IsIncluded]: Start isIncluded. First operand has 73 states, 68 states have (on average 1.0588235294117647) internal successors, (72), 68 states have internal predecessors, (72), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 115 states. [2022-04-28 03:44:00,016 INFO L87 Difference]: Start difference. First operand has 73 states, 68 states have (on average 1.0588235294117647) internal successors, (72), 68 states have internal predecessors, (72), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 115 states. [2022-04-28 03:44:00,021 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:44:00,021 INFO L93 Difference]: Finished difference Result 115 states and 119 transitions. [2022-04-28 03:44:00,021 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 119 transitions. [2022-04-28 03:44:00,021 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:44:00,021 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:44:00,021 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 03:44:00,021 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 03:44:00,021 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 73 states, 68 states have (on average 1.0588235294117647) internal successors, (72), 68 states have internal predecessors, (72), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:44:00,022 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 76 transitions. [2022-04-28 03:44:00,022 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 76 transitions. Word has length 67 [2022-04-28 03:44:00,022 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 03:44:00,023 INFO L495 AbstractCegarLoop]: Abstraction has 73 states and 76 transitions. [2022-04-28 03:44:00,023 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 38 states, 38 states have (on average 1.6578947368421053) internal successors, (63), 37 states have internal predecessors, (63), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:44:00,023 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 73 states and 76 transitions. [2022-04-28 03:44:00,117 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 76 edges. 76 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 03:44:00,117 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 76 transitions. [2022-04-28 03:44:00,118 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2022-04-28 03:44:00,118 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 03:44:00,118 INFO L195 NwaCegarLoop]: trace histogram [24, 23, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 03:44:00,142 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Forceful destruction successful, exit code 0 [2022-04-28 03:44:00,318 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,17 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 03:44:00,318 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 03:44:00,319 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 03:44:00,319 INFO L85 PathProgramCache]: Analyzing trace with hash 435450605, now seen corresponding path program 17 times [2022-04-28 03:44:00,319 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 03:44:00,319 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1025423691] [2022-04-28 03:44:04,378 WARN L977 rdanLoopAcceleration]: Unable to prove correctness of quantifier elimination. [2022-04-28 03:44:04,430 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 1 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 03:44:04,618 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={1=1, 2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 03:44:04,619 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-28 03:44:04,621 INFO L85 PathProgramCache]: Analyzing trace with hash 729672129, now seen corresponding path program 1 times [2022-04-28 03:44:04,622 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 03:44:04,622 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [151242081] [2022-04-28 03:44:04,622 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:44:04,622 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 03:44:04,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:44:04,878 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 03:44:04,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:44:04,881 INFO L290 TraceCheckUtils]: 0: Hoare triple {11075#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(17, 2);call #Ultimate.allocInit(12, 3); {11054#true} is VALID [2022-04-28 03:44:04,881 INFO L290 TraceCheckUtils]: 1: Hoare triple {11054#true} assume true; {11054#true} is VALID [2022-04-28 03:44:04,881 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {11054#true} {11054#true} #52#return; {11054#true} is VALID [2022-04-28 03:44:04,882 INFO L272 TraceCheckUtils]: 0: Hoare triple {11054#true} call ULTIMATE.init(); {11075#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 03:44:04,882 INFO L290 TraceCheckUtils]: 1: Hoare triple {11075#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(17, 2);call #Ultimate.allocInit(12, 3); {11054#true} is VALID [2022-04-28 03:44:04,882 INFO L290 TraceCheckUtils]: 2: Hoare triple {11054#true} assume true; {11054#true} is VALID [2022-04-28 03:44:04,882 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {11054#true} {11054#true} #52#return; {11054#true} is VALID [2022-04-28 03:44:04,882 INFO L272 TraceCheckUtils]: 4: Hoare triple {11054#true} call #t~ret9 := main(); {11054#true} is VALID [2022-04-28 03:44:04,882 INFO L290 TraceCheckUtils]: 5: Hoare triple {11054#true} ~x~0 := 0;~y~0 := 50000;~z~0 := 0;~x~0 := 0; {11059#(and (= main_~z~0 0) (= main_~x~0 0) (<= 50000 main_~y~0))} is VALID [2022-04-28 03:44:04,883 INFO L290 TraceCheckUtils]: 6: Hoare triple {11059#(and (= main_~z~0 0) (= main_~x~0 0) (<= 50000 main_~y~0))} [124] L11-2-->L18-1_primed: Formula: (let ((.cse0 (= |v_main_#t~post4_107| |v_main_#t~post4_106|))) (or (and (< v_main_~x~0_570 v_main_~x~0_569) (< v_main_~x~0_569 50001)) (and (= v_main_~x~0_570 v_main_~x~0_569) .cse0) (and .cse0 (not (< v_main_~x~0_570 50000)) (= v_main_~x~0_569 v_main_~x~0_570)))) InVars {main_~x~0=v_main_~x~0_570, main_#t~post4=|v_main_#t~post4_107|} OutVars{main_~x~0=v_main_~x~0_569, main_#t~post4=|v_main_#t~post4_106|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {11060#(or (<= main_~x~0 0) (and (= main_~z~0 0) (<= main_~x~0 main_~y~0) (<= main_~x~0 50000)))} is VALID [2022-04-28 03:44:04,884 INFO L290 TraceCheckUtils]: 7: Hoare triple {11060#(or (<= main_~x~0 0) (and (= main_~z~0 0) (<= main_~x~0 main_~y~0) (<= main_~x~0 50000)))} [125] L18-1_primed-->L11-2: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {11060#(or (<= main_~x~0 0) (and (= main_~z~0 0) (<= main_~x~0 main_~y~0) (<= main_~x~0 50000)))} is VALID [2022-04-28 03:44:04,884 INFO L290 TraceCheckUtils]: 8: Hoare triple {11060#(or (<= main_~x~0 0) (and (= main_~z~0 0) (<= main_~x~0 main_~y~0) (<= main_~x~0 50000)))} [126] L11-2-->L18-1_primed: Formula: (let ((.cse0 (= v_main_~x~0_572 v_main_~x~0_571)) (.cse1 (= |v_main_#t~post5_116| |v_main_#t~post5_115|)) (.cse2 (= v_main_~y~0_517 v_main_~y~0_516)) (.cse3 (= |v_main_#t~post6_116| |v_main_#t~post6_115|)) (.cse4 (<= 50000 v_main_~x~0_572))) (or (and .cse0 .cse1 .cse2 .cse3) (and (< v_main_~x~0_571 1000001) .cse4 (< v_main_~x~0_572 v_main_~x~0_571) (= (+ v_main_~x~0_571 v_main_~y~0_517) (+ v_main_~x~0_572 v_main_~y~0_516))) (and .cse0 .cse1 .cse2 .cse3 (or (not .cse4) (not (< v_main_~x~0_572 1000000)))))) InVars {main_~y~0=v_main_~y~0_517, main_#t~post5=|v_main_#t~post5_116|, main_~x~0=v_main_~x~0_572, main_#t~post6=|v_main_#t~post6_116|} OutVars{main_~y~0=v_main_~y~0_516, main_#t~post5=|v_main_#t~post5_115|, main_~x~0=v_main_~x~0_571, main_#t~post6=|v_main_#t~post6_115|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {11061#(or (and (= main_~z~0 0) (<= main_~x~0 main_~y~0)) (<= main_~x~0 50000))} is VALID [2022-04-28 03:44:04,885 INFO L290 TraceCheckUtils]: 9: Hoare triple {11061#(or (and (= main_~z~0 0) (<= main_~x~0 main_~y~0)) (<= main_~x~0 50000))} [123] L18-1_primed-->L18-1: Formula: (not (< v_main_~x~0_11 1000000)) InVars {main_~x~0=v_main_~x~0_11} OutVars{main_~x~0=v_main_~x~0_11} AuxVars[] AssignedVars[] {11062#(and (= main_~z~0 0) (<= 1000000 main_~y~0))} is VALID [2022-04-28 03:44:04,885 INFO L290 TraceCheckUtils]: 10: Hoare triple {11062#(and (= main_~z~0 0) (<= 1000000 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {11063#(and (= main_~z~0 0) (<= 999999 main_~y~0))} is VALID [2022-04-28 03:44:04,886 INFO L290 TraceCheckUtils]: 11: Hoare triple {11063#(and (= main_~z~0 0) (<= 999999 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {11064#(and (= main_~z~0 0) (<= 999998 main_~y~0))} is VALID [2022-04-28 03:44:04,886 INFO L290 TraceCheckUtils]: 12: Hoare triple {11064#(and (= main_~z~0 0) (<= 999998 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {11065#(and (= main_~z~0 0) (<= 999997 main_~y~0))} is VALID [2022-04-28 03:44:04,887 INFO L290 TraceCheckUtils]: 13: Hoare triple {11065#(and (= main_~z~0 0) (<= 999997 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {11066#(and (<= 999996 main_~y~0) (= main_~z~0 0))} is VALID [2022-04-28 03:44:04,887 INFO L290 TraceCheckUtils]: 14: Hoare triple {11066#(and (<= 999996 main_~y~0) (= main_~z~0 0))} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {11067#(and (= main_~z~0 0) (<= 999995 main_~y~0))} is VALID [2022-04-28 03:44:04,888 INFO L290 TraceCheckUtils]: 15: Hoare triple {11067#(and (= main_~z~0 0) (<= 999995 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {11068#(and (= main_~z~0 0) (<= 999994 main_~y~0))} is VALID [2022-04-28 03:44:04,888 INFO L290 TraceCheckUtils]: 16: Hoare triple {11068#(and (= main_~z~0 0) (<= 999994 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {11069#(and (= main_~z~0 0) (<= 999993 main_~y~0))} is VALID [2022-04-28 03:44:04,889 INFO L290 TraceCheckUtils]: 17: Hoare triple {11069#(and (= main_~z~0 0) (<= 999993 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {11070#(and (= main_~z~0 0) (<= 999992 main_~y~0))} is VALID [2022-04-28 03:44:04,889 INFO L290 TraceCheckUtils]: 18: Hoare triple {11070#(and (= main_~z~0 0) (<= 999992 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {11071#(and (= main_~z~0 0) (<= 999991 main_~y~0))} is VALID [2022-04-28 03:44:04,890 INFO L290 TraceCheckUtils]: 19: Hoare triple {11071#(and (= main_~z~0 0) (<= 999991 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {11072#(and (= main_~z~0 0) (<= 999990 main_~y~0))} is VALID [2022-04-28 03:44:04,890 INFO L290 TraceCheckUtils]: 20: Hoare triple {11072#(and (= main_~z~0 0) (<= 999990 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {11073#(and (= main_~z~0 0) (<= 999989 main_~y~0))} is VALID [2022-04-28 03:44:04,891 INFO L290 TraceCheckUtils]: 21: Hoare triple {11073#(and (= main_~z~0 0) (<= 999989 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {11074#(and (= main_~z~0 0) (<= 999988 main_~y~0))} is VALID [2022-04-28 03:44:04,891 INFO L290 TraceCheckUtils]: 22: Hoare triple {11074#(and (= main_~z~0 0) (<= 999988 main_~y~0))} assume !(~y~0 > ~z~0); {11055#false} is VALID [2022-04-28 03:44:04,891 INFO L272 TraceCheckUtils]: 23: Hoare triple {11055#false} call __VERIFIER_assert((if ~x~0 == ~z~0 then 1 else 0)); {11055#false} is VALID [2022-04-28 03:44:04,891 INFO L290 TraceCheckUtils]: 24: Hoare triple {11055#false} ~cond := #in~cond; {11055#false} is VALID [2022-04-28 03:44:04,891 INFO L290 TraceCheckUtils]: 25: Hoare triple {11055#false} assume 0 == ~cond; {11055#false} is VALID [2022-04-28 03:44:04,891 INFO L290 TraceCheckUtils]: 26: Hoare triple {11055#false} assume !false; {11055#false} is VALID [2022-04-28 03:44:04,892 INFO L134 CoverageAnalysis]: Checked inductivity of 80 backedges. 0 proven. 80 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 03:44:04,892 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 03:44:04,892 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [151242081] [2022-04-28 03:44:04,892 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [151242081] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 03:44:04,892 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [73560903] [2022-04-28 03:44:04,892 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:44:04,892 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 03:44:04,892 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 03:44:04,893 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 03:44:04,894 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Waiting until timeout for monitored process [2022-04-28 03:44:04,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:44:04,927 INFO L263 TraceCheckSpWp]: Trace formula consists of 119 conjuncts, 16 conjunts are in the unsatisfiable core [2022-04-28 03:44:04,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:44:04,938 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 03:44:05,545 INFO L272 TraceCheckUtils]: 0: Hoare triple {11054#true} call ULTIMATE.init(); {11054#true} is VALID [2022-04-28 03:44:05,545 INFO L290 TraceCheckUtils]: 1: Hoare triple {11054#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(17, 2);call #Ultimate.allocInit(12, 3); {11054#true} is VALID [2022-04-28 03:44:05,545 INFO L290 TraceCheckUtils]: 2: Hoare triple {11054#true} assume true; {11054#true} is VALID [2022-04-28 03:44:05,545 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {11054#true} {11054#true} #52#return; {11054#true} is VALID [2022-04-28 03:44:05,545 INFO L272 TraceCheckUtils]: 4: Hoare triple {11054#true} call #t~ret9 := main(); {11054#true} is VALID [2022-04-28 03:44:05,545 INFO L290 TraceCheckUtils]: 5: Hoare triple {11054#true} ~x~0 := 0;~y~0 := 50000;~z~0 := 0;~x~0 := 0; {11094#(and (<= main_~z~0 0) (<= 50000 main_~y~0))} is VALID [2022-04-28 03:44:05,546 INFO L290 TraceCheckUtils]: 6: Hoare triple {11094#(and (<= main_~z~0 0) (<= 50000 main_~y~0))} [124] L11-2-->L18-1_primed: Formula: (let ((.cse0 (= |v_main_#t~post4_107| |v_main_#t~post4_106|))) (or (and (< v_main_~x~0_570 v_main_~x~0_569) (< v_main_~x~0_569 50001)) (and (= v_main_~x~0_570 v_main_~x~0_569) .cse0) (and .cse0 (not (< v_main_~x~0_570 50000)) (= v_main_~x~0_569 v_main_~x~0_570)))) InVars {main_~x~0=v_main_~x~0_570, main_#t~post4=|v_main_#t~post4_107|} OutVars{main_~x~0=v_main_~x~0_569, main_#t~post4=|v_main_#t~post4_106|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {11094#(and (<= main_~z~0 0) (<= 50000 main_~y~0))} is VALID [2022-04-28 03:44:05,546 INFO L290 TraceCheckUtils]: 7: Hoare triple {11094#(and (<= main_~z~0 0) (<= 50000 main_~y~0))} [125] L18-1_primed-->L11-2: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {11094#(and (<= main_~z~0 0) (<= 50000 main_~y~0))} is VALID [2022-04-28 03:44:05,547 INFO L290 TraceCheckUtils]: 8: Hoare triple {11094#(and (<= main_~z~0 0) (<= 50000 main_~y~0))} [126] L11-2-->L18-1_primed: Formula: (let ((.cse0 (= v_main_~x~0_572 v_main_~x~0_571)) (.cse1 (= |v_main_#t~post5_116| |v_main_#t~post5_115|)) (.cse2 (= v_main_~y~0_517 v_main_~y~0_516)) (.cse3 (= |v_main_#t~post6_116| |v_main_#t~post6_115|)) (.cse4 (<= 50000 v_main_~x~0_572))) (or (and .cse0 .cse1 .cse2 .cse3) (and (< v_main_~x~0_571 1000001) .cse4 (< v_main_~x~0_572 v_main_~x~0_571) (= (+ v_main_~x~0_571 v_main_~y~0_517) (+ v_main_~x~0_572 v_main_~y~0_516))) (and .cse0 .cse1 .cse2 .cse3 (or (not .cse4) (not (< v_main_~x~0_572 1000000)))))) InVars {main_~y~0=v_main_~y~0_517, main_#t~post5=|v_main_#t~post5_116|, main_~x~0=v_main_~x~0_572, main_#t~post6=|v_main_#t~post6_116|} OutVars{main_~y~0=v_main_~y~0_516, main_#t~post5=|v_main_#t~post5_115|, main_~x~0=v_main_~x~0_571, main_#t~post6=|v_main_#t~post6_115|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {11094#(and (<= main_~z~0 0) (<= 50000 main_~y~0))} is VALID [2022-04-28 03:44:05,547 INFO L290 TraceCheckUtils]: 9: Hoare triple {11094#(and (<= main_~z~0 0) (<= 50000 main_~y~0))} [123] L18-1_primed-->L18-1: Formula: (not (< v_main_~x~0_11 1000000)) InVars {main_~x~0=v_main_~x~0_11} OutVars{main_~x~0=v_main_~x~0_11} AuxVars[] AssignedVars[] {11094#(and (<= main_~z~0 0) (<= 50000 main_~y~0))} is VALID [2022-04-28 03:44:05,548 INFO L290 TraceCheckUtils]: 10: Hoare triple {11094#(and (<= main_~z~0 0) (<= 50000 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {11110#(and (<= main_~z~0 0) (<= 49999 main_~y~0))} is VALID [2022-04-28 03:44:05,548 INFO L290 TraceCheckUtils]: 11: Hoare triple {11110#(and (<= main_~z~0 0) (<= 49999 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {11114#(and (<= main_~z~0 0) (<= 49998 main_~y~0))} is VALID [2022-04-28 03:44:05,549 INFO L290 TraceCheckUtils]: 12: Hoare triple {11114#(and (<= main_~z~0 0) (<= 49998 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {11118#(and (<= main_~z~0 0) (<= 49997 main_~y~0))} is VALID [2022-04-28 03:44:05,549 INFO L290 TraceCheckUtils]: 13: Hoare triple {11118#(and (<= main_~z~0 0) (<= 49997 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {11122#(and (<= main_~z~0 0) (<= 49996 main_~y~0))} is VALID [2022-04-28 03:44:05,550 INFO L290 TraceCheckUtils]: 14: Hoare triple {11122#(and (<= main_~z~0 0) (<= 49996 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {11126#(and (<= main_~z~0 0) (<= 49995 main_~y~0))} is VALID [2022-04-28 03:44:05,550 INFO L290 TraceCheckUtils]: 15: Hoare triple {11126#(and (<= main_~z~0 0) (<= 49995 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {11130#(and (<= main_~z~0 0) (<= 49994 main_~y~0))} is VALID [2022-04-28 03:44:05,550 INFO L290 TraceCheckUtils]: 16: Hoare triple {11130#(and (<= main_~z~0 0) (<= 49994 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {11134#(and (<= main_~z~0 0) (<= 49993 main_~y~0))} is VALID [2022-04-28 03:44:05,551 INFO L290 TraceCheckUtils]: 17: Hoare triple {11134#(and (<= main_~z~0 0) (<= 49993 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {11138#(and (<= main_~z~0 0) (<= 49992 main_~y~0))} is VALID [2022-04-28 03:44:05,551 INFO L290 TraceCheckUtils]: 18: Hoare triple {11138#(and (<= main_~z~0 0) (<= 49992 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {11142#(and (<= main_~z~0 0) (<= 49991 main_~y~0))} is VALID [2022-04-28 03:44:05,552 INFO L290 TraceCheckUtils]: 19: Hoare triple {11142#(and (<= main_~z~0 0) (<= 49991 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {11146#(and (<= main_~z~0 0) (<= 49990 main_~y~0))} is VALID [2022-04-28 03:44:05,552 INFO L290 TraceCheckUtils]: 20: Hoare triple {11146#(and (<= main_~z~0 0) (<= 49990 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {11150#(and (<= main_~z~0 0) (<= 49989 main_~y~0))} is VALID [2022-04-28 03:44:05,553 INFO L290 TraceCheckUtils]: 21: Hoare triple {11150#(and (<= main_~z~0 0) (<= 49989 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {11154#(and (<= main_~z~0 0) (<= 49988 main_~y~0))} is VALID [2022-04-28 03:44:05,553 INFO L290 TraceCheckUtils]: 22: Hoare triple {11154#(and (<= main_~z~0 0) (<= 49988 main_~y~0))} assume !(~y~0 > ~z~0); {11055#false} is VALID [2022-04-28 03:44:05,553 INFO L272 TraceCheckUtils]: 23: Hoare triple {11055#false} call __VERIFIER_assert((if ~x~0 == ~z~0 then 1 else 0)); {11055#false} is VALID [2022-04-28 03:44:05,553 INFO L290 TraceCheckUtils]: 24: Hoare triple {11055#false} ~cond := #in~cond; {11055#false} is VALID [2022-04-28 03:44:05,553 INFO L290 TraceCheckUtils]: 25: Hoare triple {11055#false} assume 0 == ~cond; {11055#false} is VALID [2022-04-28 03:44:05,553 INFO L290 TraceCheckUtils]: 26: Hoare triple {11055#false} assume !false; {11055#false} is VALID [2022-04-28 03:44:05,554 INFO L134 CoverageAnalysis]: Checked inductivity of 80 backedges. 0 proven. 78 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-04-28 03:44:05,554 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 03:44:06,246 INFO L290 TraceCheckUtils]: 26: Hoare triple {11055#false} assume !false; {11055#false} is VALID [2022-04-28 03:44:06,246 INFO L290 TraceCheckUtils]: 25: Hoare triple {11055#false} assume 0 == ~cond; {11055#false} is VALID [2022-04-28 03:44:06,246 INFO L290 TraceCheckUtils]: 24: Hoare triple {11055#false} ~cond := #in~cond; {11055#false} is VALID [2022-04-28 03:44:06,246 INFO L272 TraceCheckUtils]: 23: Hoare triple {11055#false} call __VERIFIER_assert((if ~x~0 == ~z~0 then 1 else 0)); {11055#false} is VALID [2022-04-28 03:44:06,247 INFO L290 TraceCheckUtils]: 22: Hoare triple {11182#(< main_~z~0 main_~y~0)} assume !(~y~0 > ~z~0); {11055#false} is VALID [2022-04-28 03:44:06,247 INFO L290 TraceCheckUtils]: 21: Hoare triple {11186#(< (+ main_~z~0 1) main_~y~0)} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {11182#(< main_~z~0 main_~y~0)} is VALID [2022-04-28 03:44:06,248 INFO L290 TraceCheckUtils]: 20: Hoare triple {11190#(< (+ main_~z~0 2) main_~y~0)} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {11186#(< (+ main_~z~0 1) main_~y~0)} is VALID [2022-04-28 03:44:06,248 INFO L290 TraceCheckUtils]: 19: Hoare triple {11194#(< (+ main_~z~0 3) main_~y~0)} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {11190#(< (+ main_~z~0 2) main_~y~0)} is VALID [2022-04-28 03:44:06,249 INFO L290 TraceCheckUtils]: 18: Hoare triple {11198#(< (+ main_~z~0 4) main_~y~0)} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {11194#(< (+ main_~z~0 3) main_~y~0)} is VALID [2022-04-28 03:44:06,249 INFO L290 TraceCheckUtils]: 17: Hoare triple {11202#(< (+ 5 main_~z~0) main_~y~0)} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {11198#(< (+ main_~z~0 4) main_~y~0)} is VALID [2022-04-28 03:44:06,249 INFO L290 TraceCheckUtils]: 16: Hoare triple {11206#(< (+ main_~z~0 6) main_~y~0)} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {11202#(< (+ 5 main_~z~0) main_~y~0)} is VALID [2022-04-28 03:44:06,250 INFO L290 TraceCheckUtils]: 15: Hoare triple {11210#(< (+ 7 main_~z~0) main_~y~0)} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {11206#(< (+ main_~z~0 6) main_~y~0)} is VALID [2022-04-28 03:44:06,250 INFO L290 TraceCheckUtils]: 14: Hoare triple {11214#(< (+ main_~z~0 8) main_~y~0)} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {11210#(< (+ 7 main_~z~0) main_~y~0)} is VALID [2022-04-28 03:44:06,251 INFO L290 TraceCheckUtils]: 13: Hoare triple {11218#(< (+ main_~z~0 9) main_~y~0)} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {11214#(< (+ main_~z~0 8) main_~y~0)} is VALID [2022-04-28 03:44:06,251 INFO L290 TraceCheckUtils]: 12: Hoare triple {11222#(< (+ main_~z~0 10) main_~y~0)} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {11218#(< (+ main_~z~0 9) main_~y~0)} is VALID [2022-04-28 03:44:06,252 INFO L290 TraceCheckUtils]: 11: Hoare triple {11226#(< (+ main_~z~0 11) main_~y~0)} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {11222#(< (+ main_~z~0 10) main_~y~0)} is VALID [2022-04-28 03:44:06,252 INFO L290 TraceCheckUtils]: 10: Hoare triple {11230#(< (+ main_~z~0 12) main_~y~0)} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {11226#(< (+ main_~z~0 11) main_~y~0)} is VALID [2022-04-28 03:44:06,253 INFO L290 TraceCheckUtils]: 9: Hoare triple {11230#(< (+ main_~z~0 12) main_~y~0)} [123] L18-1_primed-->L18-1: Formula: (not (< v_main_~x~0_11 1000000)) InVars {main_~x~0=v_main_~x~0_11} OutVars{main_~x~0=v_main_~x~0_11} AuxVars[] AssignedVars[] {11230#(< (+ main_~z~0 12) main_~y~0)} is VALID [2022-04-28 03:44:06,253 INFO L290 TraceCheckUtils]: 8: Hoare triple {11230#(< (+ main_~z~0 12) main_~y~0)} [126] L11-2-->L18-1_primed: Formula: (let ((.cse0 (= v_main_~x~0_572 v_main_~x~0_571)) (.cse1 (= |v_main_#t~post5_116| |v_main_#t~post5_115|)) (.cse2 (= v_main_~y~0_517 v_main_~y~0_516)) (.cse3 (= |v_main_#t~post6_116| |v_main_#t~post6_115|)) (.cse4 (<= 50000 v_main_~x~0_572))) (or (and .cse0 .cse1 .cse2 .cse3) (and (< v_main_~x~0_571 1000001) .cse4 (< v_main_~x~0_572 v_main_~x~0_571) (= (+ v_main_~x~0_571 v_main_~y~0_517) (+ v_main_~x~0_572 v_main_~y~0_516))) (and .cse0 .cse1 .cse2 .cse3 (or (not .cse4) (not (< v_main_~x~0_572 1000000)))))) InVars {main_~y~0=v_main_~y~0_517, main_#t~post5=|v_main_#t~post5_116|, main_~x~0=v_main_~x~0_572, main_#t~post6=|v_main_#t~post6_116|} OutVars{main_~y~0=v_main_~y~0_516, main_#t~post5=|v_main_#t~post5_115|, main_~x~0=v_main_~x~0_571, main_#t~post6=|v_main_#t~post6_115|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {11230#(< (+ main_~z~0 12) main_~y~0)} is VALID [2022-04-28 03:44:06,254 INFO L290 TraceCheckUtils]: 7: Hoare triple {11230#(< (+ main_~z~0 12) main_~y~0)} [125] L18-1_primed-->L11-2: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {11230#(< (+ main_~z~0 12) main_~y~0)} is VALID [2022-04-28 03:44:06,254 INFO L290 TraceCheckUtils]: 6: Hoare triple {11230#(< (+ main_~z~0 12) main_~y~0)} [124] L11-2-->L18-1_primed: Formula: (let ((.cse0 (= |v_main_#t~post4_107| |v_main_#t~post4_106|))) (or (and (< v_main_~x~0_570 v_main_~x~0_569) (< v_main_~x~0_569 50001)) (and (= v_main_~x~0_570 v_main_~x~0_569) .cse0) (and .cse0 (not (< v_main_~x~0_570 50000)) (= v_main_~x~0_569 v_main_~x~0_570)))) InVars {main_~x~0=v_main_~x~0_570, main_#t~post4=|v_main_#t~post4_107|} OutVars{main_~x~0=v_main_~x~0_569, main_#t~post4=|v_main_#t~post4_106|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {11230#(< (+ main_~z~0 12) main_~y~0)} is VALID [2022-04-28 03:44:06,254 INFO L290 TraceCheckUtils]: 5: Hoare triple {11054#true} ~x~0 := 0;~y~0 := 50000;~z~0 := 0;~x~0 := 0; {11230#(< (+ main_~z~0 12) main_~y~0)} is VALID [2022-04-28 03:44:06,254 INFO L272 TraceCheckUtils]: 4: Hoare triple {11054#true} call #t~ret9 := main(); {11054#true} is VALID [2022-04-28 03:44:06,254 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {11054#true} {11054#true} #52#return; {11054#true} is VALID [2022-04-28 03:44:06,254 INFO L290 TraceCheckUtils]: 2: Hoare triple {11054#true} assume true; {11054#true} is VALID [2022-04-28 03:44:06,255 INFO L290 TraceCheckUtils]: 1: Hoare triple {11054#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(17, 2);call #Ultimate.allocInit(12, 3); {11054#true} is VALID [2022-04-28 03:44:06,255 INFO L272 TraceCheckUtils]: 0: Hoare triple {11054#true} call ULTIMATE.init(); {11054#true} is VALID [2022-04-28 03:44:06,255 INFO L134 CoverageAnalysis]: Checked inductivity of 80 backedges. 0 proven. 78 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-04-28 03:44:06,255 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [73560903] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 03:44:06,255 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 03:44:06,255 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 15, 15] total 45 [2022-04-28 03:44:07,317 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 03:44:07,317 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1025423691] [2022-04-28 03:44:07,317 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1025423691] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 03:44:07,317 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 03:44:07,317 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [41] imperfect sequences [] total 41 [2022-04-28 03:44:07,317 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [434591048] [2022-04-28 03:44:07,318 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 03:44:07,318 INFO L78 Accepts]: Start accepts. Automaton has has 41 states, 41 states have (on average 1.6585365853658536) internal successors, (68), 40 states have internal predecessors, (68), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 72 [2022-04-28 03:44:07,318 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 03:44:07,318 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 41 states, 41 states have (on average 1.6585365853658536) internal successors, (68), 40 states have internal predecessors, (68), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:44:07,370 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 72 edges. 72 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 03:44:07,371 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 41 states [2022-04-28 03:44:07,371 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 03:44:07,371 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2022-04-28 03:44:07,372 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1586, Invalid=3244, Unknown=0, NotChecked=0, Total=4830 [2022-04-28 03:44:07,372 INFO L87 Difference]: Start difference. First operand 73 states and 76 transitions. Second operand has 41 states, 41 states have (on average 1.6585365853658536) internal successors, (68), 40 states have internal predecessors, (68), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:44:10,635 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:44:10,635 INFO L93 Difference]: Finished difference Result 186 states and 196 transitions. [2022-04-28 03:44:10,635 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2022-04-28 03:44:10,635 INFO L78 Accepts]: Start accepts. Automaton has has 41 states, 41 states have (on average 1.6585365853658536) internal successors, (68), 40 states have internal predecessors, (68), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 72 [2022-04-28 03:44:10,635 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 03:44:10,635 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 41 states, 41 states have (on average 1.6585365853658536) internal successors, (68), 40 states have internal predecessors, (68), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:44:10,636 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 80 transitions. [2022-04-28 03:44:10,636 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 41 states, 41 states have (on average 1.6585365853658536) internal successors, (68), 40 states have internal predecessors, (68), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:44:10,637 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 80 transitions. [2022-04-28 03:44:10,637 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 28 states and 80 transitions. [2022-04-28 03:44:10,727 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 80 edges. 80 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 03:44:10,729 INFO L225 Difference]: With dead ends: 186 [2022-04-28 03:44:10,729 INFO L226 Difference]: Without dead ends: 121 [2022-04-28 03:44:10,730 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 152 GetRequests, 57 SyntacticMatches, 2 SemanticMatches, 93 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2172 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=2365, Invalid=6565, Unknown=0, NotChecked=0, Total=8930 [2022-04-28 03:44:10,730 INFO L413 NwaCegarLoop]: 13 mSDtfsCounter, 35 mSDsluCounter, 137 mSDsCounter, 0 mSdLazyCounter, 1593 mSolverCounterSat, 31 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 35 SdHoareTripleChecker+Valid, 150 SdHoareTripleChecker+Invalid, 1624 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 31 IncrementalHoareTripleChecker+Valid, 1593 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2022-04-28 03:44:10,731 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [35 Valid, 150 Invalid, 1624 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [31 Valid, 1593 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2022-04-28 03:44:10,731 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121 states. [2022-04-28 03:44:10,995 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121 to 121. [2022-04-28 03:44:10,995 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 03:44:10,995 INFO L82 GeneralOperation]: Start isEquivalent. First operand 121 states. Second operand has 121 states, 116 states have (on average 1.043103448275862) internal successors, (121), 116 states have internal predecessors, (121), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:44:10,995 INFO L74 IsIncluded]: Start isIncluded. First operand 121 states. Second operand has 121 states, 116 states have (on average 1.043103448275862) internal successors, (121), 116 states have internal predecessors, (121), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:44:10,995 INFO L87 Difference]: Start difference. First operand 121 states. Second operand has 121 states, 116 states have (on average 1.043103448275862) internal successors, (121), 116 states have internal predecessors, (121), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:44:10,997 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:44:10,997 INFO L93 Difference]: Finished difference Result 121 states and 125 transitions. [2022-04-28 03:44:10,997 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states and 125 transitions. [2022-04-28 03:44:10,997 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:44:10,997 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:44:10,998 INFO L74 IsIncluded]: Start isIncluded. First operand has 121 states, 116 states have (on average 1.043103448275862) internal successors, (121), 116 states have internal predecessors, (121), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 121 states. [2022-04-28 03:44:10,998 INFO L87 Difference]: Start difference. First operand has 121 states, 116 states have (on average 1.043103448275862) internal successors, (121), 116 states have internal predecessors, (121), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 121 states. [2022-04-28 03:44:10,999 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:44:10,999 INFO L93 Difference]: Finished difference Result 121 states and 125 transitions. [2022-04-28 03:44:10,999 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states and 125 transitions. [2022-04-28 03:44:11,000 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:44:11,000 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:44:11,000 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 03:44:11,000 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 03:44:11,000 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 121 states, 116 states have (on average 1.043103448275862) internal successors, (121), 116 states have internal predecessors, (121), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:44:11,002 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 121 states to 121 states and 125 transitions. [2022-04-28 03:44:11,002 INFO L78 Accepts]: Start accepts. Automaton has 121 states and 125 transitions. Word has length 72 [2022-04-28 03:44:11,002 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 03:44:11,002 INFO L495 AbstractCegarLoop]: Abstraction has 121 states and 125 transitions. [2022-04-28 03:44:11,002 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 41 states, 41 states have (on average 1.6585365853658536) internal successors, (68), 40 states have internal predecessors, (68), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:44:11,002 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 121 states and 125 transitions. [2022-04-28 03:44:11,145 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 125 edges. 125 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 03:44:11,146 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states and 125 transitions. [2022-04-28 03:44:11,146 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2022-04-28 03:44:11,146 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 03:44:11,146 INFO L195 NwaCegarLoop]: trace histogram [25, 24, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 03:44:11,175 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Forceful destruction successful, exit code 0 [2022-04-28 03:44:11,347 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,18 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 03:44:11,347 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 03:44:11,347 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 03:44:11,347 INFO L85 PathProgramCache]: Analyzing trace with hash 1189029746, now seen corresponding path program 18 times [2022-04-28 03:44:11,347 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 03:44:11,347 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [306041156] [2022-04-28 03:44:11,440 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 1 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 03:44:15,574 WARN L977 rdanLoopAcceleration]: Unable to prove correctness of quantifier elimination. [2022-04-28 03:44:15,737 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={1=1, 2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 03:44:15,738 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-28 03:44:15,741 INFO L85 PathProgramCache]: Analyzing trace with hash 1163536577, now seen corresponding path program 1 times [2022-04-28 03:44:15,741 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 03:44:15,741 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1324164576] [2022-04-28 03:44:15,741 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:44:15,742 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 03:44:15,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:44:16,039 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 03:44:16,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:44:16,051 INFO L290 TraceCheckUtils]: 0: Hoare triple {12215#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(17, 2);call #Ultimate.allocInit(12, 3); {12194#true} is VALID [2022-04-28 03:44:16,051 INFO L290 TraceCheckUtils]: 1: Hoare triple {12194#true} assume true; {12194#true} is VALID [2022-04-28 03:44:16,052 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {12194#true} {12194#true} #52#return; {12194#true} is VALID [2022-04-28 03:44:16,052 INFO L272 TraceCheckUtils]: 0: Hoare triple {12194#true} call ULTIMATE.init(); {12215#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 03:44:16,052 INFO L290 TraceCheckUtils]: 1: Hoare triple {12215#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(17, 2);call #Ultimate.allocInit(12, 3); {12194#true} is VALID [2022-04-28 03:44:16,052 INFO L290 TraceCheckUtils]: 2: Hoare triple {12194#true} assume true; {12194#true} is VALID [2022-04-28 03:44:16,052 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {12194#true} {12194#true} #52#return; {12194#true} is VALID [2022-04-28 03:44:16,052 INFO L272 TraceCheckUtils]: 4: Hoare triple {12194#true} call #t~ret9 := main(); {12194#true} is VALID [2022-04-28 03:44:16,053 INFO L290 TraceCheckUtils]: 5: Hoare triple {12194#true} ~x~0 := 0;~y~0 := 50000;~z~0 := 0;~x~0 := 0; {12199#(and (= main_~z~0 0) (= main_~x~0 0) (<= 50000 main_~y~0))} is VALID [2022-04-28 03:44:16,053 INFO L290 TraceCheckUtils]: 6: Hoare triple {12199#(and (= main_~z~0 0) (= main_~x~0 0) (<= 50000 main_~y~0))} [128] L11-2-->L18-1_primed: Formula: (let ((.cse0 (= |v_main_#t~post4_113| |v_main_#t~post4_112|))) (or (and (= v_main_~x~0_621 v_main_~x~0_622) .cse0 (<= 50000 v_main_~x~0_622)) (and (= v_main_~x~0_622 v_main_~x~0_621) .cse0) (and (< v_main_~x~0_622 v_main_~x~0_621) (< v_main_~x~0_621 50001)))) InVars {main_~x~0=v_main_~x~0_622, main_#t~post4=|v_main_#t~post4_113|} OutVars{main_~x~0=v_main_~x~0_621, main_#t~post4=|v_main_#t~post4_112|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {12200#(and (<= main_~x~0 999999) (= main_~z~0 0) (<= 50000 main_~y~0))} is VALID [2022-04-28 03:44:16,054 INFO L290 TraceCheckUtils]: 7: Hoare triple {12200#(and (<= main_~x~0 999999) (= main_~z~0 0) (<= 50000 main_~y~0))} [129] L18-1_primed-->L11-2: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {12200#(and (<= main_~x~0 999999) (= main_~z~0 0) (<= 50000 main_~y~0))} is VALID [2022-04-28 03:44:16,054 INFO L290 TraceCheckUtils]: 8: Hoare triple {12200#(and (<= main_~x~0 999999) (= main_~z~0 0) (<= 50000 main_~y~0))} [130] L11-2-->L18-1_primed: Formula: (let ((.cse0 (= |v_main_#t~post6_123| |v_main_#t~post6_122|)) (.cse1 (= |v_main_#t~post5_123| |v_main_#t~post5_122|)) (.cse5 (<= 50000 v_main_~x~0_624)) (.cse2 (= v_main_~y~0_573 v_main_~y~0_572)) (.cse3 (= v_main_~x~0_624 v_main_~x~0_623))) (or (and .cse0 .cse1 .cse2 .cse3) (let ((.cse4 (+ v_main_~x~0_624 v_main_~y~0_572))) (and (< .cse4 (+ v_main_~y~0_573 1000001)) (= (+ v_main_~x~0_623 v_main_~y~0_573) .cse4) .cse5 (< v_main_~y~0_573 v_main_~y~0_572))) (and .cse0 .cse1 (or (not (< v_main_~x~0_624 1000000)) (not .cse5)) .cse2 .cse3))) InVars {main_~y~0=v_main_~y~0_573, main_#t~post5=|v_main_#t~post5_123|, main_~x~0=v_main_~x~0_624, main_#t~post6=|v_main_#t~post6_123|} OutVars{main_~y~0=v_main_~y~0_572, main_#t~post5=|v_main_#t~post5_122|, main_~x~0=v_main_~x~0_623, main_#t~post6=|v_main_#t~post6_122|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {12201#(or (<= main_~x~0 999999) (and (= main_~z~0 0) (<= 50001 main_~y~0)))} is VALID [2022-04-28 03:44:16,055 INFO L290 TraceCheckUtils]: 9: Hoare triple {12201#(or (<= main_~x~0 999999) (and (= main_~z~0 0) (<= 50001 main_~y~0)))} [127] L18-1_primed-->L18-1: Formula: (not (< v_main_~x~0_11 1000000)) InVars {main_~x~0=v_main_~x~0_11} OutVars{main_~x~0=v_main_~x~0_11} AuxVars[] AssignedVars[] {12202#(and (= main_~z~0 0) (<= 50001 main_~y~0))} is VALID [2022-04-28 03:44:16,055 INFO L290 TraceCheckUtils]: 10: Hoare triple {12202#(and (= main_~z~0 0) (<= 50001 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {12203#(and (= main_~z~0 0) (<= 50000 main_~y~0))} is VALID [2022-04-28 03:44:16,056 INFO L290 TraceCheckUtils]: 11: Hoare triple {12203#(and (= main_~z~0 0) (<= 50000 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {12204#(and (= main_~z~0 0) (<= 49999 main_~y~0))} is VALID [2022-04-28 03:44:16,056 INFO L290 TraceCheckUtils]: 12: Hoare triple {12204#(and (= main_~z~0 0) (<= 49999 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {12205#(and (<= 49998 main_~y~0) (= main_~z~0 0))} is VALID [2022-04-28 03:44:16,057 INFO L290 TraceCheckUtils]: 13: Hoare triple {12205#(and (<= 49998 main_~y~0) (= main_~z~0 0))} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {12206#(and (= main_~z~0 0) (<= 49997 main_~y~0))} is VALID [2022-04-28 03:44:16,057 INFO L290 TraceCheckUtils]: 14: Hoare triple {12206#(and (= main_~z~0 0) (<= 49997 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {12207#(and (= main_~z~0 0) (<= 49996 main_~y~0))} is VALID [2022-04-28 03:44:16,058 INFO L290 TraceCheckUtils]: 15: Hoare triple {12207#(and (= main_~z~0 0) (<= 49996 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {12208#(and (= main_~z~0 0) (<= 49995 main_~y~0))} is VALID [2022-04-28 03:44:16,058 INFO L290 TraceCheckUtils]: 16: Hoare triple {12208#(and (= main_~z~0 0) (<= 49995 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {12209#(and (= main_~z~0 0) (<= 49994 main_~y~0))} is VALID [2022-04-28 03:44:16,059 INFO L290 TraceCheckUtils]: 17: Hoare triple {12209#(and (= main_~z~0 0) (<= 49994 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {12210#(and (= main_~z~0 0) (<= 49993 main_~y~0))} is VALID [2022-04-28 03:44:16,059 INFO L290 TraceCheckUtils]: 18: Hoare triple {12210#(and (= main_~z~0 0) (<= 49993 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {12211#(and (= main_~z~0 0) (<= 49992 main_~y~0))} is VALID [2022-04-28 03:44:16,060 INFO L290 TraceCheckUtils]: 19: Hoare triple {12211#(and (= main_~z~0 0) (<= 49992 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {12212#(and (= main_~z~0 0) (<= 49991 main_~y~0))} is VALID [2022-04-28 03:44:16,060 INFO L290 TraceCheckUtils]: 20: Hoare triple {12212#(and (= main_~z~0 0) (<= 49991 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {12213#(and (<= 49990 main_~y~0) (= main_~z~0 0))} is VALID [2022-04-28 03:44:16,061 INFO L290 TraceCheckUtils]: 21: Hoare triple {12213#(and (<= 49990 main_~y~0) (= main_~z~0 0))} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {12214#(and (= main_~z~0 0) (<= 49989 main_~y~0))} is VALID [2022-04-28 03:44:16,061 INFO L290 TraceCheckUtils]: 22: Hoare triple {12214#(and (= main_~z~0 0) (<= 49989 main_~y~0))} assume !(~y~0 > ~z~0); {12195#false} is VALID [2022-04-28 03:44:16,061 INFO L272 TraceCheckUtils]: 23: Hoare triple {12195#false} call __VERIFIER_assert((if ~x~0 == ~z~0 then 1 else 0)); {12195#false} is VALID [2022-04-28 03:44:16,061 INFO L290 TraceCheckUtils]: 24: Hoare triple {12195#false} ~cond := #in~cond; {12195#false} is VALID [2022-04-28 03:44:16,061 INFO L290 TraceCheckUtils]: 25: Hoare triple {12195#false} assume 0 == ~cond; {12195#false} is VALID [2022-04-28 03:44:16,061 INFO L290 TraceCheckUtils]: 26: Hoare triple {12195#false} assume !false; {12195#false} is VALID [2022-04-28 03:44:16,062 INFO L134 CoverageAnalysis]: Checked inductivity of 80 backedges. 0 proven. 80 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 03:44:16,062 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 03:44:16,062 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1324164576] [2022-04-28 03:44:16,062 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1324164576] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 03:44:16,062 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1639510247] [2022-04-28 03:44:16,062 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:44:16,062 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 03:44:16,062 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 03:44:16,063 INFO L229 MonitoredProcess]: Starting monitored process 19 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 03:44:16,065 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Waiting until timeout for monitored process [2022-04-28 03:44:16,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:44:16,097 INFO L263 TraceCheckSpWp]: Trace formula consists of 119 conjuncts, 16 conjunts are in the unsatisfiable core [2022-04-28 03:44:16,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:44:16,108 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 03:44:16,736 INFO L272 TraceCheckUtils]: 0: Hoare triple {12194#true} call ULTIMATE.init(); {12194#true} is VALID [2022-04-28 03:44:16,736 INFO L290 TraceCheckUtils]: 1: Hoare triple {12194#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(17, 2);call #Ultimate.allocInit(12, 3); {12194#true} is VALID [2022-04-28 03:44:16,736 INFO L290 TraceCheckUtils]: 2: Hoare triple {12194#true} assume true; {12194#true} is VALID [2022-04-28 03:44:16,736 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {12194#true} {12194#true} #52#return; {12194#true} is VALID [2022-04-28 03:44:16,736 INFO L272 TraceCheckUtils]: 4: Hoare triple {12194#true} call #t~ret9 := main(); {12194#true} is VALID [2022-04-28 03:44:16,736 INFO L290 TraceCheckUtils]: 5: Hoare triple {12194#true} ~x~0 := 0;~y~0 := 50000;~z~0 := 0;~x~0 := 0; {12234#(and (<= main_~z~0 0) (<= 50000 main_~y~0))} is VALID [2022-04-28 03:44:16,737 INFO L290 TraceCheckUtils]: 6: Hoare triple {12234#(and (<= main_~z~0 0) (<= 50000 main_~y~0))} [128] L11-2-->L18-1_primed: Formula: (let ((.cse0 (= |v_main_#t~post4_113| |v_main_#t~post4_112|))) (or (and (= v_main_~x~0_621 v_main_~x~0_622) .cse0 (<= 50000 v_main_~x~0_622)) (and (= v_main_~x~0_622 v_main_~x~0_621) .cse0) (and (< v_main_~x~0_622 v_main_~x~0_621) (< v_main_~x~0_621 50001)))) InVars {main_~x~0=v_main_~x~0_622, main_#t~post4=|v_main_#t~post4_113|} OutVars{main_~x~0=v_main_~x~0_621, main_#t~post4=|v_main_#t~post4_112|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {12234#(and (<= main_~z~0 0) (<= 50000 main_~y~0))} is VALID [2022-04-28 03:44:16,737 INFO L290 TraceCheckUtils]: 7: Hoare triple {12234#(and (<= main_~z~0 0) (<= 50000 main_~y~0))} [129] L18-1_primed-->L11-2: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {12234#(and (<= main_~z~0 0) (<= 50000 main_~y~0))} is VALID [2022-04-28 03:44:16,738 INFO L290 TraceCheckUtils]: 8: Hoare triple {12234#(and (<= main_~z~0 0) (<= 50000 main_~y~0))} [130] L11-2-->L18-1_primed: Formula: (let ((.cse0 (= |v_main_#t~post6_123| |v_main_#t~post6_122|)) (.cse1 (= |v_main_#t~post5_123| |v_main_#t~post5_122|)) (.cse5 (<= 50000 v_main_~x~0_624)) (.cse2 (= v_main_~y~0_573 v_main_~y~0_572)) (.cse3 (= v_main_~x~0_624 v_main_~x~0_623))) (or (and .cse0 .cse1 .cse2 .cse3) (let ((.cse4 (+ v_main_~x~0_624 v_main_~y~0_572))) (and (< .cse4 (+ v_main_~y~0_573 1000001)) (= (+ v_main_~x~0_623 v_main_~y~0_573) .cse4) .cse5 (< v_main_~y~0_573 v_main_~y~0_572))) (and .cse0 .cse1 (or (not (< v_main_~x~0_624 1000000)) (not .cse5)) .cse2 .cse3))) InVars {main_~y~0=v_main_~y~0_573, main_#t~post5=|v_main_#t~post5_123|, main_~x~0=v_main_~x~0_624, main_#t~post6=|v_main_#t~post6_123|} OutVars{main_~y~0=v_main_~y~0_572, main_#t~post5=|v_main_#t~post5_122|, main_~x~0=v_main_~x~0_623, main_#t~post6=|v_main_#t~post6_122|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {12234#(and (<= main_~z~0 0) (<= 50000 main_~y~0))} is VALID [2022-04-28 03:44:16,738 INFO L290 TraceCheckUtils]: 9: Hoare triple {12234#(and (<= main_~z~0 0) (<= 50000 main_~y~0))} [127] L18-1_primed-->L18-1: Formula: (not (< v_main_~x~0_11 1000000)) InVars {main_~x~0=v_main_~x~0_11} OutVars{main_~x~0=v_main_~x~0_11} AuxVars[] AssignedVars[] {12234#(and (<= main_~z~0 0) (<= 50000 main_~y~0))} is VALID [2022-04-28 03:44:16,739 INFO L290 TraceCheckUtils]: 10: Hoare triple {12234#(and (<= main_~z~0 0) (<= 50000 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {12250#(and (<= main_~z~0 0) (<= 49999 main_~y~0))} is VALID [2022-04-28 03:44:16,739 INFO L290 TraceCheckUtils]: 11: Hoare triple {12250#(and (<= main_~z~0 0) (<= 49999 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {12254#(and (<= main_~z~0 0) (<= 49998 main_~y~0))} is VALID [2022-04-28 03:44:16,740 INFO L290 TraceCheckUtils]: 12: Hoare triple {12254#(and (<= main_~z~0 0) (<= 49998 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {12258#(and (<= main_~z~0 0) (<= 49997 main_~y~0))} is VALID [2022-04-28 03:44:16,740 INFO L290 TraceCheckUtils]: 13: Hoare triple {12258#(and (<= main_~z~0 0) (<= 49997 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {12262#(and (<= main_~z~0 0) (<= 49996 main_~y~0))} is VALID [2022-04-28 03:44:16,741 INFO L290 TraceCheckUtils]: 14: Hoare triple {12262#(and (<= main_~z~0 0) (<= 49996 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {12266#(and (<= main_~z~0 0) (<= 49995 main_~y~0))} is VALID [2022-04-28 03:44:16,741 INFO L290 TraceCheckUtils]: 15: Hoare triple {12266#(and (<= main_~z~0 0) (<= 49995 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {12270#(and (<= main_~z~0 0) (<= 49994 main_~y~0))} is VALID [2022-04-28 03:44:16,742 INFO L290 TraceCheckUtils]: 16: Hoare triple {12270#(and (<= main_~z~0 0) (<= 49994 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {12274#(and (<= main_~z~0 0) (<= 49993 main_~y~0))} is VALID [2022-04-28 03:44:16,742 INFO L290 TraceCheckUtils]: 17: Hoare triple {12274#(and (<= main_~z~0 0) (<= 49993 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {12278#(and (<= main_~z~0 0) (<= 49992 main_~y~0))} is VALID [2022-04-28 03:44:16,743 INFO L290 TraceCheckUtils]: 18: Hoare triple {12278#(and (<= main_~z~0 0) (<= 49992 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {12282#(and (<= main_~z~0 0) (<= 49991 main_~y~0))} is VALID [2022-04-28 03:44:16,743 INFO L290 TraceCheckUtils]: 19: Hoare triple {12282#(and (<= main_~z~0 0) (<= 49991 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {12286#(and (<= main_~z~0 0) (<= 49990 main_~y~0))} is VALID [2022-04-28 03:44:16,744 INFO L290 TraceCheckUtils]: 20: Hoare triple {12286#(and (<= main_~z~0 0) (<= 49990 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {12290#(and (<= main_~z~0 0) (<= 49989 main_~y~0))} is VALID [2022-04-28 03:44:16,744 INFO L290 TraceCheckUtils]: 21: Hoare triple {12290#(and (<= main_~z~0 0) (<= 49989 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {12294#(and (<= main_~z~0 0) (<= 49988 main_~y~0))} is VALID [2022-04-28 03:44:16,745 INFO L290 TraceCheckUtils]: 22: Hoare triple {12294#(and (<= main_~z~0 0) (<= 49988 main_~y~0))} assume !(~y~0 > ~z~0); {12195#false} is VALID [2022-04-28 03:44:16,745 INFO L272 TraceCheckUtils]: 23: Hoare triple {12195#false} call __VERIFIER_assert((if ~x~0 == ~z~0 then 1 else 0)); {12195#false} is VALID [2022-04-28 03:44:16,745 INFO L290 TraceCheckUtils]: 24: Hoare triple {12195#false} ~cond := #in~cond; {12195#false} is VALID [2022-04-28 03:44:16,745 INFO L290 TraceCheckUtils]: 25: Hoare triple {12195#false} assume 0 == ~cond; {12195#false} is VALID [2022-04-28 03:44:16,745 INFO L290 TraceCheckUtils]: 26: Hoare triple {12195#false} assume !false; {12195#false} is VALID [2022-04-28 03:44:16,745 INFO L134 CoverageAnalysis]: Checked inductivity of 80 backedges. 0 proven. 78 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-04-28 03:44:16,745 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 03:44:17,403 INFO L290 TraceCheckUtils]: 26: Hoare triple {12195#false} assume !false; {12195#false} is VALID [2022-04-28 03:44:17,403 INFO L290 TraceCheckUtils]: 25: Hoare triple {12195#false} assume 0 == ~cond; {12195#false} is VALID [2022-04-28 03:44:17,403 INFO L290 TraceCheckUtils]: 24: Hoare triple {12195#false} ~cond := #in~cond; {12195#false} is VALID [2022-04-28 03:44:17,403 INFO L272 TraceCheckUtils]: 23: Hoare triple {12195#false} call __VERIFIER_assert((if ~x~0 == ~z~0 then 1 else 0)); {12195#false} is VALID [2022-04-28 03:44:17,403 INFO L290 TraceCheckUtils]: 22: Hoare triple {12322#(< main_~z~0 main_~y~0)} assume !(~y~0 > ~z~0); {12195#false} is VALID [2022-04-28 03:44:17,404 INFO L290 TraceCheckUtils]: 21: Hoare triple {12326#(< (+ main_~z~0 1) main_~y~0)} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {12322#(< main_~z~0 main_~y~0)} is VALID [2022-04-28 03:44:17,404 INFO L290 TraceCheckUtils]: 20: Hoare triple {12330#(< (+ main_~z~0 2) main_~y~0)} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {12326#(< (+ main_~z~0 1) main_~y~0)} is VALID [2022-04-28 03:44:17,405 INFO L290 TraceCheckUtils]: 19: Hoare triple {12334#(< (+ main_~z~0 3) main_~y~0)} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {12330#(< (+ main_~z~0 2) main_~y~0)} is VALID [2022-04-28 03:44:17,405 INFO L290 TraceCheckUtils]: 18: Hoare triple {12338#(< (+ main_~z~0 4) main_~y~0)} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {12334#(< (+ main_~z~0 3) main_~y~0)} is VALID [2022-04-28 03:44:17,406 INFO L290 TraceCheckUtils]: 17: Hoare triple {12342#(< (+ 5 main_~z~0) main_~y~0)} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {12338#(< (+ main_~z~0 4) main_~y~0)} is VALID [2022-04-28 03:44:17,406 INFO L290 TraceCheckUtils]: 16: Hoare triple {12346#(< (+ main_~z~0 6) main_~y~0)} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {12342#(< (+ 5 main_~z~0) main_~y~0)} is VALID [2022-04-28 03:44:17,407 INFO L290 TraceCheckUtils]: 15: Hoare triple {12350#(< (+ 7 main_~z~0) main_~y~0)} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {12346#(< (+ main_~z~0 6) main_~y~0)} is VALID [2022-04-28 03:44:17,407 INFO L290 TraceCheckUtils]: 14: Hoare triple {12354#(< (+ main_~z~0 8) main_~y~0)} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {12350#(< (+ 7 main_~z~0) main_~y~0)} is VALID [2022-04-28 03:44:17,407 INFO L290 TraceCheckUtils]: 13: Hoare triple {12358#(< (+ main_~z~0 9) main_~y~0)} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {12354#(< (+ main_~z~0 8) main_~y~0)} is VALID [2022-04-28 03:44:17,408 INFO L290 TraceCheckUtils]: 12: Hoare triple {12362#(< (+ main_~z~0 10) main_~y~0)} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {12358#(< (+ main_~z~0 9) main_~y~0)} is VALID [2022-04-28 03:44:17,408 INFO L290 TraceCheckUtils]: 11: Hoare triple {12366#(< (+ main_~z~0 11) main_~y~0)} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {12362#(< (+ main_~z~0 10) main_~y~0)} is VALID [2022-04-28 03:44:17,409 INFO L290 TraceCheckUtils]: 10: Hoare triple {12370#(< (+ main_~z~0 12) main_~y~0)} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {12366#(< (+ main_~z~0 11) main_~y~0)} is VALID [2022-04-28 03:44:17,409 INFO L290 TraceCheckUtils]: 9: Hoare triple {12370#(< (+ main_~z~0 12) main_~y~0)} [127] L18-1_primed-->L18-1: Formula: (not (< v_main_~x~0_11 1000000)) InVars {main_~x~0=v_main_~x~0_11} OutVars{main_~x~0=v_main_~x~0_11} AuxVars[] AssignedVars[] {12370#(< (+ main_~z~0 12) main_~y~0)} is VALID [2022-04-28 03:44:17,410 INFO L290 TraceCheckUtils]: 8: Hoare triple {12370#(< (+ main_~z~0 12) main_~y~0)} [130] L11-2-->L18-1_primed: Formula: (let ((.cse0 (= |v_main_#t~post6_123| |v_main_#t~post6_122|)) (.cse1 (= |v_main_#t~post5_123| |v_main_#t~post5_122|)) (.cse5 (<= 50000 v_main_~x~0_624)) (.cse2 (= v_main_~y~0_573 v_main_~y~0_572)) (.cse3 (= v_main_~x~0_624 v_main_~x~0_623))) (or (and .cse0 .cse1 .cse2 .cse3) (let ((.cse4 (+ v_main_~x~0_624 v_main_~y~0_572))) (and (< .cse4 (+ v_main_~y~0_573 1000001)) (= (+ v_main_~x~0_623 v_main_~y~0_573) .cse4) .cse5 (< v_main_~y~0_573 v_main_~y~0_572))) (and .cse0 .cse1 (or (not (< v_main_~x~0_624 1000000)) (not .cse5)) .cse2 .cse3))) InVars {main_~y~0=v_main_~y~0_573, main_#t~post5=|v_main_#t~post5_123|, main_~x~0=v_main_~x~0_624, main_#t~post6=|v_main_#t~post6_123|} OutVars{main_~y~0=v_main_~y~0_572, main_#t~post5=|v_main_#t~post5_122|, main_~x~0=v_main_~x~0_623, main_#t~post6=|v_main_#t~post6_122|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {12370#(< (+ main_~z~0 12) main_~y~0)} is VALID [2022-04-28 03:44:17,410 INFO L290 TraceCheckUtils]: 7: Hoare triple {12370#(< (+ main_~z~0 12) main_~y~0)} [129] L18-1_primed-->L11-2: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {12370#(< (+ main_~z~0 12) main_~y~0)} is VALID [2022-04-28 03:44:17,411 INFO L290 TraceCheckUtils]: 6: Hoare triple {12370#(< (+ main_~z~0 12) main_~y~0)} [128] L11-2-->L18-1_primed: Formula: (let ((.cse0 (= |v_main_#t~post4_113| |v_main_#t~post4_112|))) (or (and (= v_main_~x~0_621 v_main_~x~0_622) .cse0 (<= 50000 v_main_~x~0_622)) (and (= v_main_~x~0_622 v_main_~x~0_621) .cse0) (and (< v_main_~x~0_622 v_main_~x~0_621) (< v_main_~x~0_621 50001)))) InVars {main_~x~0=v_main_~x~0_622, main_#t~post4=|v_main_#t~post4_113|} OutVars{main_~x~0=v_main_~x~0_621, main_#t~post4=|v_main_#t~post4_112|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {12370#(< (+ main_~z~0 12) main_~y~0)} is VALID [2022-04-28 03:44:17,411 INFO L290 TraceCheckUtils]: 5: Hoare triple {12194#true} ~x~0 := 0;~y~0 := 50000;~z~0 := 0;~x~0 := 0; {12370#(< (+ main_~z~0 12) main_~y~0)} is VALID [2022-04-28 03:44:17,411 INFO L272 TraceCheckUtils]: 4: Hoare triple {12194#true} call #t~ret9 := main(); {12194#true} is VALID [2022-04-28 03:44:17,411 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {12194#true} {12194#true} #52#return; {12194#true} is VALID [2022-04-28 03:44:17,411 INFO L290 TraceCheckUtils]: 2: Hoare triple {12194#true} assume true; {12194#true} is VALID [2022-04-28 03:44:17,411 INFO L290 TraceCheckUtils]: 1: Hoare triple {12194#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(17, 2);call #Ultimate.allocInit(12, 3); {12194#true} is VALID [2022-04-28 03:44:17,411 INFO L272 TraceCheckUtils]: 0: Hoare triple {12194#true} call ULTIMATE.init(); {12194#true} is VALID [2022-04-28 03:44:17,412 INFO L134 CoverageAnalysis]: Checked inductivity of 80 backedges. 0 proven. 78 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-04-28 03:44:17,412 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1639510247] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 03:44:17,412 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 03:44:17,412 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 15, 15] total 45 [2022-04-28 03:44:18,298 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 03:44:18,299 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [306041156] [2022-04-28 03:44:18,299 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [306041156] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 03:44:18,299 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 03:44:18,299 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [42] imperfect sequences [] total 42 [2022-04-28 03:44:18,299 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1247112151] [2022-04-28 03:44:18,299 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 03:44:18,300 INFO L78 Accepts]: Start accepts. Automaton has has 42 states, 42 states have (on average 1.6666666666666667) internal successors, (70), 41 states have internal predecessors, (70), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 74 [2022-04-28 03:44:18,300 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 03:44:18,300 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 42 states, 42 states have (on average 1.6666666666666667) internal successors, (70), 41 states have internal predecessors, (70), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:44:18,353 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 74 edges. 74 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 03:44:18,353 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 42 states [2022-04-28 03:44:18,354 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 03:44:18,354 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2022-04-28 03:44:18,354 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1960, Invalid=3010, Unknown=0, NotChecked=0, Total=4970 [2022-04-28 03:44:18,354 INFO L87 Difference]: Start difference. First operand 121 states and 125 transitions. Second operand has 42 states, 42 states have (on average 1.6666666666666667) internal successors, (70), 41 states have internal predecessors, (70), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:44:21,835 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:44:21,836 INFO L93 Difference]: Finished difference Result 189 states and 199 transitions. [2022-04-28 03:44:21,836 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2022-04-28 03:44:21,836 INFO L78 Accepts]: Start accepts. Automaton has has 42 states, 42 states have (on average 1.6666666666666667) internal successors, (70), 41 states have internal predecessors, (70), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 74 [2022-04-28 03:44:21,836 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 03:44:21,836 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 42 states, 42 states have (on average 1.6666666666666667) internal successors, (70), 41 states have internal predecessors, (70), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:44:21,837 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 95 transitions. [2022-04-28 03:44:21,838 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 42 states, 42 states have (on average 1.6666666666666667) internal successors, (70), 41 states have internal predecessors, (70), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:44:21,838 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 95 transitions. [2022-04-28 03:44:21,839 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 42 states and 95 transitions. [2022-04-28 03:44:21,933 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 95 edges. 95 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 03:44:21,935 INFO L225 Difference]: With dead ends: 189 [2022-04-28 03:44:21,935 INFO L226 Difference]: Without dead ends: 124 [2022-04-28 03:44:21,937 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 168 GetRequests, 58 SyntacticMatches, 2 SemanticMatches, 108 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3464 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=3947, Invalid=8043, Unknown=0, NotChecked=0, Total=11990 [2022-04-28 03:44:21,938 INFO L413 NwaCegarLoop]: 13 mSDtfsCounter, 149 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 1413 mSolverCounterSat, 161 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 149 SdHoareTripleChecker+Valid, 35 SdHoareTripleChecker+Invalid, 1574 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 161 IncrementalHoareTripleChecker+Valid, 1413 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2022-04-28 03:44:21,938 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [149 Valid, 35 Invalid, 1574 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [161 Valid, 1413 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2022-04-28 03:44:21,938 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 124 states. [2022-04-28 03:44:22,236 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 124 to 124. [2022-04-28 03:44:22,237 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 03:44:22,237 INFO L82 GeneralOperation]: Start isEquivalent. First operand 124 states. Second operand has 124 states, 119 states have (on average 1.0420168067226891) internal successors, (124), 119 states have internal predecessors, (124), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:44:22,237 INFO L74 IsIncluded]: Start isIncluded. First operand 124 states. Second operand has 124 states, 119 states have (on average 1.0420168067226891) internal successors, (124), 119 states have internal predecessors, (124), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:44:22,237 INFO L87 Difference]: Start difference. First operand 124 states. Second operand has 124 states, 119 states have (on average 1.0420168067226891) internal successors, (124), 119 states have internal predecessors, (124), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:44:22,239 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:44:22,239 INFO L93 Difference]: Finished difference Result 124 states and 128 transitions. [2022-04-28 03:44:22,239 INFO L276 IsEmpty]: Start isEmpty. Operand 124 states and 128 transitions. [2022-04-28 03:44:22,240 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:44:22,240 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:44:22,240 INFO L74 IsIncluded]: Start isIncluded. First operand has 124 states, 119 states have (on average 1.0420168067226891) internal successors, (124), 119 states have internal predecessors, (124), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 124 states. [2022-04-28 03:44:22,240 INFO L87 Difference]: Start difference. First operand has 124 states, 119 states have (on average 1.0420168067226891) internal successors, (124), 119 states have internal predecessors, (124), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 124 states. [2022-04-28 03:44:22,241 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:44:22,242 INFO L93 Difference]: Finished difference Result 124 states and 128 transitions. [2022-04-28 03:44:22,242 INFO L276 IsEmpty]: Start isEmpty. Operand 124 states and 128 transitions. [2022-04-28 03:44:22,242 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:44:22,242 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:44:22,242 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 03:44:22,242 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 03:44:22,242 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 124 states, 119 states have (on average 1.0420168067226891) internal successors, (124), 119 states have internal predecessors, (124), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:44:22,244 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 124 states to 124 states and 128 transitions. [2022-04-28 03:44:22,244 INFO L78 Accepts]: Start accepts. Automaton has 124 states and 128 transitions. Word has length 74 [2022-04-28 03:44:22,244 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 03:44:22,244 INFO L495 AbstractCegarLoop]: Abstraction has 124 states and 128 transitions. [2022-04-28 03:44:22,244 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 42 states, 42 states have (on average 1.6666666666666667) internal successors, (70), 41 states have internal predecessors, (70), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:44:22,245 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 124 states and 128 transitions. [2022-04-28 03:44:22,395 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 128 edges. 128 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 03:44:22,395 INFO L276 IsEmpty]: Start isEmpty. Operand 124 states and 128 transitions. [2022-04-28 03:44:22,396 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2022-04-28 03:44:22,396 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 03:44:22,396 INFO L195 NwaCegarLoop]: trace histogram [26, 25, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 03:44:22,418 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Forceful destruction successful, exit code 0 [2022-04-28 03:44:22,596 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20,19 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 03:44:22,596 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 03:44:22,597 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 03:44:22,597 INFO L85 PathProgramCache]: Analyzing trace with hash -1677112436, now seen corresponding path program 19 times [2022-04-28 03:44:22,597 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 03:44:22,597 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [918227175] [2022-04-28 03:44:22,727 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 1 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 03:44:22,975 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={1=1, 2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 03:44:22,977 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-28 03:44:22,979 INFO L85 PathProgramCache]: Analyzing trace with hash -1984638014, now seen corresponding path program 1 times [2022-04-28 03:44:22,979 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 03:44:22,979 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [867578303] [2022-04-28 03:44:22,979 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:44:22,979 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 03:44:22,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:44:23,267 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 03:44:23,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:44:23,276 INFO L290 TraceCheckUtils]: 0: Hoare triple {13403#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(17, 2);call #Ultimate.allocInit(12, 3); {13381#true} is VALID [2022-04-28 03:44:23,277 INFO L290 TraceCheckUtils]: 1: Hoare triple {13381#true} assume true; {13381#true} is VALID [2022-04-28 03:44:23,277 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {13381#true} {13381#true} #52#return; {13381#true} is VALID [2022-04-28 03:44:23,277 INFO L272 TraceCheckUtils]: 0: Hoare triple {13381#true} call ULTIMATE.init(); {13403#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 03:44:23,277 INFO L290 TraceCheckUtils]: 1: Hoare triple {13403#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(17, 2);call #Ultimate.allocInit(12, 3); {13381#true} is VALID [2022-04-28 03:44:23,277 INFO L290 TraceCheckUtils]: 2: Hoare triple {13381#true} assume true; {13381#true} is VALID [2022-04-28 03:44:23,278 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {13381#true} {13381#true} #52#return; {13381#true} is VALID [2022-04-28 03:44:23,278 INFO L272 TraceCheckUtils]: 4: Hoare triple {13381#true} call #t~ret9 := main(); {13381#true} is VALID [2022-04-28 03:44:23,278 INFO L290 TraceCheckUtils]: 5: Hoare triple {13381#true} ~x~0 := 0;~y~0 := 50000;~z~0 := 0;~x~0 := 0; {13386#(and (= main_~z~0 0) (= main_~x~0 0) (<= 50000 main_~y~0))} is VALID [2022-04-28 03:44:23,279 INFO L290 TraceCheckUtils]: 6: Hoare triple {13386#(and (= main_~z~0 0) (= main_~x~0 0) (<= 50000 main_~y~0))} [132] L11-2-->L18-1_primed: Formula: (let ((.cse0 (= |v_main_#t~post4_119| |v_main_#t~post4_118|)) (.cse1 (= v_main_~x~0_675 v_main_~x~0_674))) (or (and .cse0 (<= 50000 v_main_~x~0_675) .cse1) (and (< v_main_~x~0_675 v_main_~x~0_674) (< v_main_~x~0_674 50001)) (and .cse0 .cse1))) InVars {main_~x~0=v_main_~x~0_675, main_#t~post4=|v_main_#t~post4_119|} OutVars{main_~x~0=v_main_~x~0_674, main_#t~post4=|v_main_#t~post4_118|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {13387#(and (= main_~z~0 0) (<= main_~x~0 50000) (<= 50000 main_~y~0))} is VALID [2022-04-28 03:44:23,280 INFO L290 TraceCheckUtils]: 7: Hoare triple {13387#(and (= main_~z~0 0) (<= main_~x~0 50000) (<= 50000 main_~y~0))} [133] L18-1_primed-->L11-2: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {13387#(and (= main_~z~0 0) (<= main_~x~0 50000) (<= 50000 main_~y~0))} is VALID [2022-04-28 03:44:23,281 INFO L290 TraceCheckUtils]: 8: Hoare triple {13387#(and (= main_~z~0 0) (<= main_~x~0 50000) (<= 50000 main_~y~0))} [134] L11-2-->L18-1_primed: Formula: (let ((.cse0 (<= 50000 v_main_~x~0_677)) (.cse2 (= v_main_~x~0_677 v_main_~x~0_676)) (.cse3 (= |v_main_#t~post5_130| |v_main_#t~post5_129|)) (.cse4 (= |v_main_#t~post6_130| |v_main_#t~post6_129|))) (or (let ((.cse1 (+ v_main_~x~0_677 v_main_~y~0_629))) (and .cse0 (< .cse1 (+ v_main_~y~0_630 1000001)) (< v_main_~y~0_630 v_main_~y~0_629) (= .cse1 (+ v_main_~x~0_676 v_main_~y~0_630)))) (and (= v_main_~y~0_630 v_main_~y~0_629) .cse2 .cse3 .cse4) (and (or (not .cse0) (not (< v_main_~x~0_677 1000000))) (= v_main_~y~0_629 v_main_~y~0_630) .cse2 .cse3 .cse4))) InVars {main_~y~0=v_main_~y~0_630, main_#t~post5=|v_main_#t~post5_130|, main_~x~0=v_main_~x~0_677, main_#t~post6=|v_main_#t~post6_130|} OutVars{main_~y~0=v_main_~y~0_629, main_#t~post5=|v_main_#t~post5_129|, main_~x~0=v_main_~x~0_676, main_#t~post6=|v_main_#t~post6_129|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {13388#(or (<= main_~x~0 50000) (and (= main_~z~0 0) (<= 50001 main_~y~0)))} is VALID [2022-04-28 03:44:23,281 INFO L290 TraceCheckUtils]: 9: Hoare triple {13388#(or (<= main_~x~0 50000) (and (= main_~z~0 0) (<= 50001 main_~y~0)))} [131] L18-1_primed-->L18-1: Formula: (not (< v_main_~x~0_11 1000000)) InVars {main_~x~0=v_main_~x~0_11} OutVars{main_~x~0=v_main_~x~0_11} AuxVars[] AssignedVars[] {13389#(and (= main_~z~0 0) (<= 50001 main_~y~0))} is VALID [2022-04-28 03:44:23,282 INFO L290 TraceCheckUtils]: 10: Hoare triple {13389#(and (= main_~z~0 0) (<= 50001 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {13390#(and (= main_~z~0 0) (<= 50000 main_~y~0))} is VALID [2022-04-28 03:44:23,283 INFO L290 TraceCheckUtils]: 11: Hoare triple {13390#(and (= main_~z~0 0) (<= 50000 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {13391#(and (= main_~z~0 0) (<= 49999 main_~y~0))} is VALID [2022-04-28 03:44:23,283 INFO L290 TraceCheckUtils]: 12: Hoare triple {13391#(and (= main_~z~0 0) (<= 49999 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {13392#(and (<= 49998 main_~y~0) (= main_~z~0 0))} is VALID [2022-04-28 03:44:23,284 INFO L290 TraceCheckUtils]: 13: Hoare triple {13392#(and (<= 49998 main_~y~0) (= main_~z~0 0))} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {13393#(and (= main_~z~0 0) (<= 49997 main_~y~0))} is VALID [2022-04-28 03:44:23,285 INFO L290 TraceCheckUtils]: 14: Hoare triple {13393#(and (= main_~z~0 0) (<= 49997 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {13394#(and (= main_~z~0 0) (<= 49996 main_~y~0))} is VALID [2022-04-28 03:44:23,285 INFO L290 TraceCheckUtils]: 15: Hoare triple {13394#(and (= main_~z~0 0) (<= 49996 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {13395#(and (= main_~z~0 0) (<= 49995 main_~y~0))} is VALID [2022-04-28 03:44:23,286 INFO L290 TraceCheckUtils]: 16: Hoare triple {13395#(and (= main_~z~0 0) (<= 49995 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {13396#(and (= main_~z~0 0) (<= 49994 main_~y~0))} is VALID [2022-04-28 03:44:23,287 INFO L290 TraceCheckUtils]: 17: Hoare triple {13396#(and (= main_~z~0 0) (<= 49994 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {13397#(and (= main_~z~0 0) (<= 49993 main_~y~0))} is VALID [2022-04-28 03:44:23,287 INFO L290 TraceCheckUtils]: 18: Hoare triple {13397#(and (= main_~z~0 0) (<= 49993 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {13398#(and (= main_~z~0 0) (<= 49992 main_~y~0))} is VALID [2022-04-28 03:44:23,288 INFO L290 TraceCheckUtils]: 19: Hoare triple {13398#(and (= main_~z~0 0) (<= 49992 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {13399#(and (= main_~z~0 0) (<= 49991 main_~y~0))} is VALID [2022-04-28 03:44:23,288 INFO L290 TraceCheckUtils]: 20: Hoare triple {13399#(and (= main_~z~0 0) (<= 49991 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {13400#(and (<= 49990 main_~y~0) (= main_~z~0 0))} is VALID [2022-04-28 03:44:23,289 INFO L290 TraceCheckUtils]: 21: Hoare triple {13400#(and (<= 49990 main_~y~0) (= main_~z~0 0))} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {13401#(and (= main_~z~0 0) (<= 49989 main_~y~0))} is VALID [2022-04-28 03:44:23,289 INFO L290 TraceCheckUtils]: 22: Hoare triple {13401#(and (= main_~z~0 0) (<= 49989 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {13402#(and (= main_~z~0 0) (<= 49988 main_~y~0))} is VALID [2022-04-28 03:44:23,289 INFO L290 TraceCheckUtils]: 23: Hoare triple {13402#(and (= main_~z~0 0) (<= 49988 main_~y~0))} assume !(~y~0 > ~z~0); {13382#false} is VALID [2022-04-28 03:44:23,290 INFO L272 TraceCheckUtils]: 24: Hoare triple {13382#false} call __VERIFIER_assert((if ~x~0 == ~z~0 then 1 else 0)); {13382#false} is VALID [2022-04-28 03:44:23,290 INFO L290 TraceCheckUtils]: 25: Hoare triple {13382#false} ~cond := #in~cond; {13382#false} is VALID [2022-04-28 03:44:23,290 INFO L290 TraceCheckUtils]: 26: Hoare triple {13382#false} assume 0 == ~cond; {13382#false} is VALID [2022-04-28 03:44:23,290 INFO L290 TraceCheckUtils]: 27: Hoare triple {13382#false} assume !false; {13382#false} is VALID [2022-04-28 03:44:23,290 INFO L134 CoverageAnalysis]: Checked inductivity of 93 backedges. 0 proven. 93 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 03:44:23,290 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 03:44:23,290 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [867578303] [2022-04-28 03:44:23,290 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [867578303] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 03:44:23,290 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1624092113] [2022-04-28 03:44:23,291 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:44:23,291 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 03:44:23,291 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 03:44:23,292 INFO L229 MonitoredProcess]: Starting monitored process 20 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 03:44:23,294 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Waiting until timeout for monitored process [2022-04-28 03:44:23,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:44:23,338 INFO L263 TraceCheckSpWp]: Trace formula consists of 124 conjuncts, 17 conjunts are in the unsatisfiable core [2022-04-28 03:44:23,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:44:23,354 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 03:44:24,121 INFO L272 TraceCheckUtils]: 0: Hoare triple {13381#true} call ULTIMATE.init(); {13381#true} is VALID [2022-04-28 03:44:24,121 INFO L290 TraceCheckUtils]: 1: Hoare triple {13381#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(17, 2);call #Ultimate.allocInit(12, 3); {13381#true} is VALID [2022-04-28 03:44:24,121 INFO L290 TraceCheckUtils]: 2: Hoare triple {13381#true} assume true; {13381#true} is VALID [2022-04-28 03:44:24,121 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {13381#true} {13381#true} #52#return; {13381#true} is VALID [2022-04-28 03:44:24,121 INFO L272 TraceCheckUtils]: 4: Hoare triple {13381#true} call #t~ret9 := main(); {13381#true} is VALID [2022-04-28 03:44:24,122 INFO L290 TraceCheckUtils]: 5: Hoare triple {13381#true} ~x~0 := 0;~y~0 := 50000;~z~0 := 0;~x~0 := 0; {13422#(and (<= main_~z~0 0) (<= 50000 main_~y~0))} is VALID [2022-04-28 03:44:24,123 INFO L290 TraceCheckUtils]: 6: Hoare triple {13422#(and (<= main_~z~0 0) (<= 50000 main_~y~0))} [132] L11-2-->L18-1_primed: Formula: (let ((.cse0 (= |v_main_#t~post4_119| |v_main_#t~post4_118|)) (.cse1 (= v_main_~x~0_675 v_main_~x~0_674))) (or (and .cse0 (<= 50000 v_main_~x~0_675) .cse1) (and (< v_main_~x~0_675 v_main_~x~0_674) (< v_main_~x~0_674 50001)) (and .cse0 .cse1))) InVars {main_~x~0=v_main_~x~0_675, main_#t~post4=|v_main_#t~post4_119|} OutVars{main_~x~0=v_main_~x~0_674, main_#t~post4=|v_main_#t~post4_118|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {13422#(and (<= main_~z~0 0) (<= 50000 main_~y~0))} is VALID [2022-04-28 03:44:24,124 INFO L290 TraceCheckUtils]: 7: Hoare triple {13422#(and (<= main_~z~0 0) (<= 50000 main_~y~0))} [133] L18-1_primed-->L11-2: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {13422#(and (<= main_~z~0 0) (<= 50000 main_~y~0))} is VALID [2022-04-28 03:44:24,125 INFO L290 TraceCheckUtils]: 8: Hoare triple {13422#(and (<= main_~z~0 0) (<= 50000 main_~y~0))} [134] L11-2-->L18-1_primed: Formula: (let ((.cse0 (<= 50000 v_main_~x~0_677)) (.cse2 (= v_main_~x~0_677 v_main_~x~0_676)) (.cse3 (= |v_main_#t~post5_130| |v_main_#t~post5_129|)) (.cse4 (= |v_main_#t~post6_130| |v_main_#t~post6_129|))) (or (let ((.cse1 (+ v_main_~x~0_677 v_main_~y~0_629))) (and .cse0 (< .cse1 (+ v_main_~y~0_630 1000001)) (< v_main_~y~0_630 v_main_~y~0_629) (= .cse1 (+ v_main_~x~0_676 v_main_~y~0_630)))) (and (= v_main_~y~0_630 v_main_~y~0_629) .cse2 .cse3 .cse4) (and (or (not .cse0) (not (< v_main_~x~0_677 1000000))) (= v_main_~y~0_629 v_main_~y~0_630) .cse2 .cse3 .cse4))) InVars {main_~y~0=v_main_~y~0_630, main_#t~post5=|v_main_#t~post5_130|, main_~x~0=v_main_~x~0_677, main_#t~post6=|v_main_#t~post6_130|} OutVars{main_~y~0=v_main_~y~0_629, main_#t~post5=|v_main_#t~post5_129|, main_~x~0=v_main_~x~0_676, main_#t~post6=|v_main_#t~post6_129|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {13422#(and (<= main_~z~0 0) (<= 50000 main_~y~0))} is VALID [2022-04-28 03:44:24,125 INFO L290 TraceCheckUtils]: 9: Hoare triple {13422#(and (<= main_~z~0 0) (<= 50000 main_~y~0))} [131] L18-1_primed-->L18-1: Formula: (not (< v_main_~x~0_11 1000000)) InVars {main_~x~0=v_main_~x~0_11} OutVars{main_~x~0=v_main_~x~0_11} AuxVars[] AssignedVars[] {13422#(and (<= main_~z~0 0) (<= 50000 main_~y~0))} is VALID [2022-04-28 03:44:24,125 INFO L290 TraceCheckUtils]: 10: Hoare triple {13422#(and (<= main_~z~0 0) (<= 50000 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {13438#(and (<= main_~z~0 0) (<= 49999 main_~y~0))} is VALID [2022-04-28 03:44:24,126 INFO L290 TraceCheckUtils]: 11: Hoare triple {13438#(and (<= main_~z~0 0) (<= 49999 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {13442#(and (<= main_~z~0 0) (<= 49998 main_~y~0))} is VALID [2022-04-28 03:44:24,126 INFO L290 TraceCheckUtils]: 12: Hoare triple {13442#(and (<= main_~z~0 0) (<= 49998 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {13446#(and (<= main_~z~0 0) (<= 49997 main_~y~0))} is VALID [2022-04-28 03:44:24,127 INFO L290 TraceCheckUtils]: 13: Hoare triple {13446#(and (<= main_~z~0 0) (<= 49997 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {13450#(and (<= main_~z~0 0) (<= 49996 main_~y~0))} is VALID [2022-04-28 03:44:24,127 INFO L290 TraceCheckUtils]: 14: Hoare triple {13450#(and (<= main_~z~0 0) (<= 49996 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {13454#(and (<= main_~z~0 0) (<= 49995 main_~y~0))} is VALID [2022-04-28 03:44:24,128 INFO L290 TraceCheckUtils]: 15: Hoare triple {13454#(and (<= main_~z~0 0) (<= 49995 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {13458#(and (<= main_~z~0 0) (<= 49994 main_~y~0))} is VALID [2022-04-28 03:44:24,128 INFO L290 TraceCheckUtils]: 16: Hoare triple {13458#(and (<= main_~z~0 0) (<= 49994 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {13462#(and (<= main_~z~0 0) (<= 49993 main_~y~0))} is VALID [2022-04-28 03:44:24,129 INFO L290 TraceCheckUtils]: 17: Hoare triple {13462#(and (<= main_~z~0 0) (<= 49993 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {13466#(and (<= main_~z~0 0) (<= 49992 main_~y~0))} is VALID [2022-04-28 03:44:24,129 INFO L290 TraceCheckUtils]: 18: Hoare triple {13466#(and (<= main_~z~0 0) (<= 49992 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {13470#(and (<= main_~z~0 0) (<= 49991 main_~y~0))} is VALID [2022-04-28 03:44:24,130 INFO L290 TraceCheckUtils]: 19: Hoare triple {13470#(and (<= main_~z~0 0) (<= 49991 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {13474#(and (<= main_~z~0 0) (<= 49990 main_~y~0))} is VALID [2022-04-28 03:44:24,130 INFO L290 TraceCheckUtils]: 20: Hoare triple {13474#(and (<= main_~z~0 0) (<= 49990 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {13478#(and (<= main_~z~0 0) (<= 49989 main_~y~0))} is VALID [2022-04-28 03:44:24,131 INFO L290 TraceCheckUtils]: 21: Hoare triple {13478#(and (<= main_~z~0 0) (<= 49989 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {13482#(and (<= main_~z~0 0) (<= 49988 main_~y~0))} is VALID [2022-04-28 03:44:24,131 INFO L290 TraceCheckUtils]: 22: Hoare triple {13482#(and (<= main_~z~0 0) (<= 49988 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {13486#(and (<= main_~z~0 0) (<= 49987 main_~y~0))} is VALID [2022-04-28 03:44:24,132 INFO L290 TraceCheckUtils]: 23: Hoare triple {13486#(and (<= main_~z~0 0) (<= 49987 main_~y~0))} assume !(~y~0 > ~z~0); {13382#false} is VALID [2022-04-28 03:44:24,132 INFO L272 TraceCheckUtils]: 24: Hoare triple {13382#false} call __VERIFIER_assert((if ~x~0 == ~z~0 then 1 else 0)); {13382#false} is VALID [2022-04-28 03:44:24,132 INFO L290 TraceCheckUtils]: 25: Hoare triple {13382#false} ~cond := #in~cond; {13382#false} is VALID [2022-04-28 03:44:24,132 INFO L290 TraceCheckUtils]: 26: Hoare triple {13382#false} assume 0 == ~cond; {13382#false} is VALID [2022-04-28 03:44:24,132 INFO L290 TraceCheckUtils]: 27: Hoare triple {13382#false} assume !false; {13382#false} is VALID [2022-04-28 03:44:24,132 INFO L134 CoverageAnalysis]: Checked inductivity of 93 backedges. 0 proven. 91 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-04-28 03:44:24,132 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 03:44:24,897 INFO L290 TraceCheckUtils]: 27: Hoare triple {13382#false} assume !false; {13382#false} is VALID [2022-04-28 03:44:24,897 INFO L290 TraceCheckUtils]: 26: Hoare triple {13382#false} assume 0 == ~cond; {13382#false} is VALID [2022-04-28 03:44:24,897 INFO L290 TraceCheckUtils]: 25: Hoare triple {13382#false} ~cond := #in~cond; {13382#false} is VALID [2022-04-28 03:44:24,897 INFO L272 TraceCheckUtils]: 24: Hoare triple {13382#false} call __VERIFIER_assert((if ~x~0 == ~z~0 then 1 else 0)); {13382#false} is VALID [2022-04-28 03:44:24,897 INFO L290 TraceCheckUtils]: 23: Hoare triple {13514#(< main_~z~0 main_~y~0)} assume !(~y~0 > ~z~0); {13382#false} is VALID [2022-04-28 03:44:24,898 INFO L290 TraceCheckUtils]: 22: Hoare triple {13518#(< (+ main_~z~0 1) main_~y~0)} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {13514#(< main_~z~0 main_~y~0)} is VALID [2022-04-28 03:44:24,898 INFO L290 TraceCheckUtils]: 21: Hoare triple {13522#(< (+ main_~z~0 2) main_~y~0)} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {13518#(< (+ main_~z~0 1) main_~y~0)} is VALID [2022-04-28 03:44:24,899 INFO L290 TraceCheckUtils]: 20: Hoare triple {13526#(< (+ main_~z~0 3) main_~y~0)} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {13522#(< (+ main_~z~0 2) main_~y~0)} is VALID [2022-04-28 03:44:24,899 INFO L290 TraceCheckUtils]: 19: Hoare triple {13530#(< (+ main_~z~0 4) main_~y~0)} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {13526#(< (+ main_~z~0 3) main_~y~0)} is VALID [2022-04-28 03:44:24,900 INFO L290 TraceCheckUtils]: 18: Hoare triple {13534#(< (+ 5 main_~z~0) main_~y~0)} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {13530#(< (+ main_~z~0 4) main_~y~0)} is VALID [2022-04-28 03:44:24,900 INFO L290 TraceCheckUtils]: 17: Hoare triple {13538#(< (+ main_~z~0 6) main_~y~0)} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {13534#(< (+ 5 main_~z~0) main_~y~0)} is VALID [2022-04-28 03:44:24,901 INFO L290 TraceCheckUtils]: 16: Hoare triple {13542#(< (+ 7 main_~z~0) main_~y~0)} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {13538#(< (+ main_~z~0 6) main_~y~0)} is VALID [2022-04-28 03:44:24,901 INFO L290 TraceCheckUtils]: 15: Hoare triple {13546#(< (+ main_~z~0 8) main_~y~0)} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {13542#(< (+ 7 main_~z~0) main_~y~0)} is VALID [2022-04-28 03:44:24,902 INFO L290 TraceCheckUtils]: 14: Hoare triple {13550#(< (+ main_~z~0 9) main_~y~0)} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {13546#(< (+ main_~z~0 8) main_~y~0)} is VALID [2022-04-28 03:44:24,902 INFO L290 TraceCheckUtils]: 13: Hoare triple {13554#(< (+ main_~z~0 10) main_~y~0)} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {13550#(< (+ main_~z~0 9) main_~y~0)} is VALID [2022-04-28 03:44:24,903 INFO L290 TraceCheckUtils]: 12: Hoare triple {13558#(< (+ main_~z~0 11) main_~y~0)} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {13554#(< (+ main_~z~0 10) main_~y~0)} is VALID [2022-04-28 03:44:24,903 INFO L290 TraceCheckUtils]: 11: Hoare triple {13562#(< (+ main_~z~0 12) main_~y~0)} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {13558#(< (+ main_~z~0 11) main_~y~0)} is VALID [2022-04-28 03:44:24,903 INFO L290 TraceCheckUtils]: 10: Hoare triple {13566#(< (+ main_~z~0 13) main_~y~0)} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {13562#(< (+ main_~z~0 12) main_~y~0)} is VALID [2022-04-28 03:44:24,904 INFO L290 TraceCheckUtils]: 9: Hoare triple {13566#(< (+ main_~z~0 13) main_~y~0)} [131] L18-1_primed-->L18-1: Formula: (not (< v_main_~x~0_11 1000000)) InVars {main_~x~0=v_main_~x~0_11} OutVars{main_~x~0=v_main_~x~0_11} AuxVars[] AssignedVars[] {13566#(< (+ main_~z~0 13) main_~y~0)} is VALID [2022-04-28 03:44:24,905 INFO L290 TraceCheckUtils]: 8: Hoare triple {13566#(< (+ main_~z~0 13) main_~y~0)} [134] L11-2-->L18-1_primed: Formula: (let ((.cse0 (<= 50000 v_main_~x~0_677)) (.cse2 (= v_main_~x~0_677 v_main_~x~0_676)) (.cse3 (= |v_main_#t~post5_130| |v_main_#t~post5_129|)) (.cse4 (= |v_main_#t~post6_130| |v_main_#t~post6_129|))) (or (let ((.cse1 (+ v_main_~x~0_677 v_main_~y~0_629))) (and .cse0 (< .cse1 (+ v_main_~y~0_630 1000001)) (< v_main_~y~0_630 v_main_~y~0_629) (= .cse1 (+ v_main_~x~0_676 v_main_~y~0_630)))) (and (= v_main_~y~0_630 v_main_~y~0_629) .cse2 .cse3 .cse4) (and (or (not .cse0) (not (< v_main_~x~0_677 1000000))) (= v_main_~y~0_629 v_main_~y~0_630) .cse2 .cse3 .cse4))) InVars {main_~y~0=v_main_~y~0_630, main_#t~post5=|v_main_#t~post5_130|, main_~x~0=v_main_~x~0_677, main_#t~post6=|v_main_#t~post6_130|} OutVars{main_~y~0=v_main_~y~0_629, main_#t~post5=|v_main_#t~post5_129|, main_~x~0=v_main_~x~0_676, main_#t~post6=|v_main_#t~post6_129|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {13566#(< (+ main_~z~0 13) main_~y~0)} is VALID [2022-04-28 03:44:24,905 INFO L290 TraceCheckUtils]: 7: Hoare triple {13566#(< (+ main_~z~0 13) main_~y~0)} [133] L18-1_primed-->L11-2: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {13566#(< (+ main_~z~0 13) main_~y~0)} is VALID [2022-04-28 03:44:24,905 INFO L290 TraceCheckUtils]: 6: Hoare triple {13566#(< (+ main_~z~0 13) main_~y~0)} [132] L11-2-->L18-1_primed: Formula: (let ((.cse0 (= |v_main_#t~post4_119| |v_main_#t~post4_118|)) (.cse1 (= v_main_~x~0_675 v_main_~x~0_674))) (or (and .cse0 (<= 50000 v_main_~x~0_675) .cse1) (and (< v_main_~x~0_675 v_main_~x~0_674) (< v_main_~x~0_674 50001)) (and .cse0 .cse1))) InVars {main_~x~0=v_main_~x~0_675, main_#t~post4=|v_main_#t~post4_119|} OutVars{main_~x~0=v_main_~x~0_674, main_#t~post4=|v_main_#t~post4_118|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {13566#(< (+ main_~z~0 13) main_~y~0)} is VALID [2022-04-28 03:44:24,906 INFO L290 TraceCheckUtils]: 5: Hoare triple {13381#true} ~x~0 := 0;~y~0 := 50000;~z~0 := 0;~x~0 := 0; {13566#(< (+ main_~z~0 13) main_~y~0)} is VALID [2022-04-28 03:44:24,913 INFO L272 TraceCheckUtils]: 4: Hoare triple {13381#true} call #t~ret9 := main(); {13381#true} is VALID [2022-04-28 03:44:24,913 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {13381#true} {13381#true} #52#return; {13381#true} is VALID [2022-04-28 03:44:24,913 INFO L290 TraceCheckUtils]: 2: Hoare triple {13381#true} assume true; {13381#true} is VALID [2022-04-28 03:44:24,913 INFO L290 TraceCheckUtils]: 1: Hoare triple {13381#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(17, 2);call #Ultimate.allocInit(12, 3); {13381#true} is VALID [2022-04-28 03:44:24,913 INFO L272 TraceCheckUtils]: 0: Hoare triple {13381#true} call ULTIMATE.init(); {13381#true} is VALID [2022-04-28 03:44:24,913 INFO L134 CoverageAnalysis]: Checked inductivity of 93 backedges. 0 proven. 91 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-04-28 03:44:24,913 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1624092113] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 03:44:24,913 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 03:44:24,913 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 16, 16] total 48 [2022-04-28 03:44:25,906 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 03:44:25,906 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [918227175] [2022-04-28 03:44:25,906 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [918227175] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 03:44:25,907 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 03:44:25,907 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [44] imperfect sequences [] total 44 [2022-04-28 03:44:25,907 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1658478981] [2022-04-28 03:44:25,907 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 03:44:25,907 INFO L78 Accepts]: Start accepts. Automaton has has 44 states, 44 states have (on average 1.6590909090909092) internal successors, (73), 43 states have internal predecessors, (73), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 77 [2022-04-28 03:44:25,907 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 03:44:25,907 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 44 states, 44 states have (on average 1.6590909090909092) internal successors, (73), 43 states have internal predecessors, (73), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:44:25,968 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 77 edges. 77 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 03:44:25,968 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 44 states [2022-04-28 03:44:25,969 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 03:44:25,969 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2022-04-28 03:44:25,970 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=2179, Invalid=3371, Unknown=0, NotChecked=0, Total=5550 [2022-04-28 03:44:25,970 INFO L87 Difference]: Start difference. First operand 124 states and 128 transitions. Second operand has 44 states, 44 states have (on average 1.6590909090909092) internal successors, (73), 43 states have internal predecessors, (73), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:44:29,757 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:44:29,757 INFO L93 Difference]: Finished difference Result 193 states and 203 transitions. [2022-04-28 03:44:29,757 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2022-04-28 03:44:29,757 INFO L78 Accepts]: Start accepts. Automaton has has 44 states, 44 states have (on average 1.6590909090909092) internal successors, (73), 43 states have internal predecessors, (73), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 77 [2022-04-28 03:44:29,758 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 03:44:29,758 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 44 states, 44 states have (on average 1.6590909090909092) internal successors, (73), 43 states have internal predecessors, (73), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:44:29,759 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 98 transitions. [2022-04-28 03:44:29,759 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 44 states, 44 states have (on average 1.6590909090909092) internal successors, (73), 43 states have internal predecessors, (73), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:44:29,760 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 98 transitions. [2022-04-28 03:44:29,760 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 44 states and 98 transitions. [2022-04-28 03:44:29,856 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 98 edges. 98 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 03:44:29,858 INFO L225 Difference]: With dead ends: 193 [2022-04-28 03:44:29,858 INFO L226 Difference]: Without dead ends: 127 [2022-04-28 03:44:29,860 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 175 GetRequests, 59 SyntacticMatches, 2 SemanticMatches, 114 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3852 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=4379, Invalid=8961, Unknown=0, NotChecked=0, Total=13340 [2022-04-28 03:44:29,860 INFO L413 NwaCegarLoop]: 13 mSDtfsCounter, 149 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 1523 mSolverCounterSat, 159 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 149 SdHoareTripleChecker+Valid, 35 SdHoareTripleChecker+Invalid, 1682 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 159 IncrementalHoareTripleChecker+Valid, 1523 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2022-04-28 03:44:29,860 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [149 Valid, 35 Invalid, 1682 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [159 Valid, 1523 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2022-04-28 03:44:29,861 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 127 states. [2022-04-28 03:44:30,148 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 127 to 127. [2022-04-28 03:44:30,148 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 03:44:30,149 INFO L82 GeneralOperation]: Start isEquivalent. First operand 127 states. Second operand has 127 states, 122 states have (on average 1.040983606557377) internal successors, (127), 122 states have internal predecessors, (127), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:44:30,149 INFO L74 IsIncluded]: Start isIncluded. First operand 127 states. Second operand has 127 states, 122 states have (on average 1.040983606557377) internal successors, (127), 122 states have internal predecessors, (127), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:44:30,149 INFO L87 Difference]: Start difference. First operand 127 states. Second operand has 127 states, 122 states have (on average 1.040983606557377) internal successors, (127), 122 states have internal predecessors, (127), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:44:30,151 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:44:30,151 INFO L93 Difference]: Finished difference Result 127 states and 131 transitions. [2022-04-28 03:44:30,151 INFO L276 IsEmpty]: Start isEmpty. Operand 127 states and 131 transitions. [2022-04-28 03:44:30,151 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:44:30,151 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:44:30,151 INFO L74 IsIncluded]: Start isIncluded. First operand has 127 states, 122 states have (on average 1.040983606557377) internal successors, (127), 122 states have internal predecessors, (127), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 127 states. [2022-04-28 03:44:30,151 INFO L87 Difference]: Start difference. First operand has 127 states, 122 states have (on average 1.040983606557377) internal successors, (127), 122 states have internal predecessors, (127), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 127 states. [2022-04-28 03:44:30,153 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:44:30,153 INFO L93 Difference]: Finished difference Result 127 states and 131 transitions. [2022-04-28 03:44:30,153 INFO L276 IsEmpty]: Start isEmpty. Operand 127 states and 131 transitions. [2022-04-28 03:44:30,153 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:44:30,153 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:44:30,153 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 03:44:30,153 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 03:44:30,154 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 127 states, 122 states have (on average 1.040983606557377) internal successors, (127), 122 states have internal predecessors, (127), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:44:30,156 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 127 states to 127 states and 131 transitions. [2022-04-28 03:44:30,156 INFO L78 Accepts]: Start accepts. Automaton has 127 states and 131 transitions. Word has length 77 [2022-04-28 03:44:30,156 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 03:44:30,156 INFO L495 AbstractCegarLoop]: Abstraction has 127 states and 131 transitions. [2022-04-28 03:44:30,156 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 44 states, 44 states have (on average 1.6590909090909092) internal successors, (73), 43 states have internal predecessors, (73), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:44:30,156 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 127 states and 131 transitions. [2022-04-28 03:44:30,300 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 131 edges. 131 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 03:44:30,300 INFO L276 IsEmpty]: Start isEmpty. Operand 127 states and 131 transitions. [2022-04-28 03:44:30,300 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2022-04-28 03:44:30,301 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 03:44:30,301 INFO L195 NwaCegarLoop]: trace histogram [27, 26, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 03:44:30,328 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Forceful destruction successful, exit code 0 [2022-04-28 03:44:30,501 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21,20 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 03:44:30,501 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 03:44:30,502 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 03:44:30,502 INFO L85 PathProgramCache]: Analyzing trace with hash -1712396772, now seen corresponding path program 20 times [2022-04-28 03:44:30,502 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 03:44:30,502 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [2083971686] [2022-04-28 03:44:34,575 WARN L977 rdanLoopAcceleration]: Unable to prove correctness of quantifier elimination. [2022-04-28 03:44:34,621 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 1 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 03:44:38,747 WARN L977 rdanLoopAcceleration]: Unable to prove correctness of quantifier elimination. [2022-04-28 03:44:38,854 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={1=1, 2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 03:44:38,856 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-28 03:44:38,858 INFO L85 PathProgramCache]: Analyzing trace with hash -1026791711, now seen corresponding path program 1 times [2022-04-28 03:44:38,858 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 03:44:38,858 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1293747606] [2022-04-28 03:44:38,858 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:44:38,858 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 03:44:38,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:44:39,139 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 03:44:39,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:44:39,142 INFO L290 TraceCheckUtils]: 0: Hoare triple {14625#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(17, 2);call #Ultimate.allocInit(12, 3); {14602#true} is VALID [2022-04-28 03:44:39,142 INFO L290 TraceCheckUtils]: 1: Hoare triple {14602#true} assume true; {14602#true} is VALID [2022-04-28 03:44:39,143 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {14602#true} {14602#true} #52#return; {14602#true} is VALID [2022-04-28 03:44:39,143 INFO L272 TraceCheckUtils]: 0: Hoare triple {14602#true} call ULTIMATE.init(); {14625#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 03:44:39,143 INFO L290 TraceCheckUtils]: 1: Hoare triple {14625#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(17, 2);call #Ultimate.allocInit(12, 3); {14602#true} is VALID [2022-04-28 03:44:39,143 INFO L290 TraceCheckUtils]: 2: Hoare triple {14602#true} assume true; {14602#true} is VALID [2022-04-28 03:44:39,143 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {14602#true} {14602#true} #52#return; {14602#true} is VALID [2022-04-28 03:44:39,144 INFO L272 TraceCheckUtils]: 4: Hoare triple {14602#true} call #t~ret9 := main(); {14602#true} is VALID [2022-04-28 03:44:39,144 INFO L290 TraceCheckUtils]: 5: Hoare triple {14602#true} ~x~0 := 0;~y~0 := 50000;~z~0 := 0;~x~0 := 0; {14607#(and (= main_~z~0 0) (= main_~x~0 0) (<= 50000 main_~y~0))} is VALID [2022-04-28 03:44:39,145 INFO L290 TraceCheckUtils]: 6: Hoare triple {14607#(and (= main_~z~0 0) (= main_~x~0 0) (<= 50000 main_~y~0))} [136] L11-2-->L18-1_primed: Formula: (let ((.cse0 (= |v_main_#t~post4_125| |v_main_#t~post4_124|))) (or (and (< v_main_~x~0_729 50001) (< v_main_~x~0_730 v_main_~x~0_729)) (and (not (< v_main_~x~0_730 50000)) (= v_main_~x~0_729 v_main_~x~0_730) .cse0) (and (= v_main_~x~0_730 v_main_~x~0_729) .cse0))) InVars {main_~x~0=v_main_~x~0_730, main_#t~post4=|v_main_#t~post4_125|} OutVars{main_~x~0=v_main_~x~0_729, main_#t~post4=|v_main_#t~post4_124|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {14608#(and (= main_~z~0 0) (<= main_~x~0 50000) (<= 50000 main_~y~0))} is VALID [2022-04-28 03:44:39,145 INFO L290 TraceCheckUtils]: 7: Hoare triple {14608#(and (= main_~z~0 0) (<= main_~x~0 50000) (<= 50000 main_~y~0))} [137] L18-1_primed-->L11-2: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {14608#(and (= main_~z~0 0) (<= main_~x~0 50000) (<= 50000 main_~y~0))} is VALID [2022-04-28 03:44:39,146 INFO L290 TraceCheckUtils]: 8: Hoare triple {14608#(and (= main_~z~0 0) (<= main_~x~0 50000) (<= 50000 main_~y~0))} [138] L11-2-->L18-1_primed: Formula: (let ((.cse0 (= |v_main_#t~post6_137| |v_main_#t~post6_136|)) (.cse1 (= |v_main_#t~post5_137| |v_main_#t~post5_136|)) (.cse2 (= v_main_~x~0_732 v_main_~x~0_731)) (.cse4 (<= 50000 v_main_~x~0_732))) (or (and .cse0 .cse1 .cse2 (= v_main_~y~0_690 v_main_~y~0_689)) (let ((.cse3 (+ v_main_~x~0_732 v_main_~y~0_689))) (and (< .cse3 (+ v_main_~y~0_690 1000001)) (= (+ v_main_~x~0_731 v_main_~y~0_690) .cse3) .cse4 (< v_main_~y~0_690 v_main_~y~0_689))) (and .cse0 .cse1 .cse2 (= v_main_~y~0_689 v_main_~y~0_690) (or (not .cse4) (not (< v_main_~x~0_732 1000000)))))) InVars {main_~y~0=v_main_~y~0_690, main_#t~post5=|v_main_#t~post5_137|, main_~x~0=v_main_~x~0_732, main_#t~post6=|v_main_#t~post6_137|} OutVars{main_~y~0=v_main_~y~0_689, main_#t~post5=|v_main_#t~post5_136|, main_~x~0=v_main_~x~0_731, main_#t~post6=|v_main_#t~post6_136|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {14609#(or (<= main_~x~0 50000) (and (= main_~z~0 0) (<= 50001 main_~y~0)))} is VALID [2022-04-28 03:44:39,147 INFO L290 TraceCheckUtils]: 9: Hoare triple {14609#(or (<= main_~x~0 50000) (and (= main_~z~0 0) (<= 50001 main_~y~0)))} [135] L18-1_primed-->L18-1: Formula: (not (< v_main_~x~0_11 1000000)) InVars {main_~x~0=v_main_~x~0_11} OutVars{main_~x~0=v_main_~x~0_11} AuxVars[] AssignedVars[] {14610#(and (= main_~z~0 0) (<= 50001 main_~y~0))} is VALID [2022-04-28 03:44:39,148 INFO L290 TraceCheckUtils]: 10: Hoare triple {14610#(and (= main_~z~0 0) (<= 50001 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {14611#(and (= main_~z~0 0) (<= 50000 main_~y~0))} is VALID [2022-04-28 03:44:39,148 INFO L290 TraceCheckUtils]: 11: Hoare triple {14611#(and (= main_~z~0 0) (<= 50000 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {14612#(and (= main_~z~0 0) (<= 49999 main_~y~0))} is VALID [2022-04-28 03:44:39,149 INFO L290 TraceCheckUtils]: 12: Hoare triple {14612#(and (= main_~z~0 0) (<= 49999 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {14613#(and (<= 49998 main_~y~0) (= main_~z~0 0))} is VALID [2022-04-28 03:44:39,150 INFO L290 TraceCheckUtils]: 13: Hoare triple {14613#(and (<= 49998 main_~y~0) (= main_~z~0 0))} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {14614#(and (= main_~z~0 0) (<= 49997 main_~y~0))} is VALID [2022-04-28 03:44:39,150 INFO L290 TraceCheckUtils]: 14: Hoare triple {14614#(and (= main_~z~0 0) (<= 49997 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {14615#(and (= main_~z~0 0) (<= 49996 main_~y~0))} is VALID [2022-04-28 03:44:39,151 INFO L290 TraceCheckUtils]: 15: Hoare triple {14615#(and (= main_~z~0 0) (<= 49996 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {14616#(and (= main_~z~0 0) (<= 49995 main_~y~0))} is VALID [2022-04-28 03:44:39,152 INFO L290 TraceCheckUtils]: 16: Hoare triple {14616#(and (= main_~z~0 0) (<= 49995 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {14617#(and (= main_~z~0 0) (<= 49994 main_~y~0))} is VALID [2022-04-28 03:44:39,152 INFO L290 TraceCheckUtils]: 17: Hoare triple {14617#(and (= main_~z~0 0) (<= 49994 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {14618#(and (= main_~z~0 0) (<= 49993 main_~y~0))} is VALID [2022-04-28 03:44:39,153 INFO L290 TraceCheckUtils]: 18: Hoare triple {14618#(and (= main_~z~0 0) (<= 49993 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {14619#(and (= main_~z~0 0) (<= 49992 main_~y~0))} is VALID [2022-04-28 03:44:39,154 INFO L290 TraceCheckUtils]: 19: Hoare triple {14619#(and (= main_~z~0 0) (<= 49992 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {14620#(and (= main_~z~0 0) (<= 49991 main_~y~0))} is VALID [2022-04-28 03:44:39,154 INFO L290 TraceCheckUtils]: 20: Hoare triple {14620#(and (= main_~z~0 0) (<= 49991 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {14621#(and (<= 49990 main_~y~0) (= main_~z~0 0))} is VALID [2022-04-28 03:44:39,155 INFO L290 TraceCheckUtils]: 21: Hoare triple {14621#(and (<= 49990 main_~y~0) (= main_~z~0 0))} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {14622#(and (= main_~z~0 0) (<= 49989 main_~y~0))} is VALID [2022-04-28 03:44:39,156 INFO L290 TraceCheckUtils]: 22: Hoare triple {14622#(and (= main_~z~0 0) (<= 49989 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {14623#(and (= main_~z~0 0) (<= 49988 main_~y~0))} is VALID [2022-04-28 03:44:39,156 INFO L290 TraceCheckUtils]: 23: Hoare triple {14623#(and (= main_~z~0 0) (<= 49988 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {14624#(and (= main_~z~0 0) (<= 49987 main_~y~0))} is VALID [2022-04-28 03:44:39,157 INFO L290 TraceCheckUtils]: 24: Hoare triple {14624#(and (= main_~z~0 0) (<= 49987 main_~y~0))} assume !(~y~0 > ~z~0); {14603#false} is VALID [2022-04-28 03:44:39,157 INFO L272 TraceCheckUtils]: 25: Hoare triple {14603#false} call __VERIFIER_assert((if ~x~0 == ~z~0 then 1 else 0)); {14603#false} is VALID [2022-04-28 03:44:39,157 INFO L290 TraceCheckUtils]: 26: Hoare triple {14603#false} ~cond := #in~cond; {14603#false} is VALID [2022-04-28 03:44:39,157 INFO L290 TraceCheckUtils]: 27: Hoare triple {14603#false} assume 0 == ~cond; {14603#false} is VALID [2022-04-28 03:44:39,157 INFO L290 TraceCheckUtils]: 28: Hoare triple {14603#false} assume !false; {14603#false} is VALID [2022-04-28 03:44:39,157 INFO L134 CoverageAnalysis]: Checked inductivity of 107 backedges. 0 proven. 107 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 03:44:39,158 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 03:44:39,158 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1293747606] [2022-04-28 03:44:39,158 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1293747606] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 03:44:39,158 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1078967989] [2022-04-28 03:44:39,158 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:44:39,158 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 03:44:39,158 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 03:44:39,160 INFO L229 MonitoredProcess]: Starting monitored process 21 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 03:44:39,177 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Waiting until timeout for monitored process [2022-04-28 03:44:39,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:44:39,225 INFO L263 TraceCheckSpWp]: Trace formula consists of 129 conjuncts, 18 conjunts are in the unsatisfiable core [2022-04-28 03:44:39,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:44:39,241 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 03:44:39,997 INFO L272 TraceCheckUtils]: 0: Hoare triple {14602#true} call ULTIMATE.init(); {14602#true} is VALID [2022-04-28 03:44:39,997 INFO L290 TraceCheckUtils]: 1: Hoare triple {14602#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(17, 2);call #Ultimate.allocInit(12, 3); {14602#true} is VALID [2022-04-28 03:44:39,997 INFO L290 TraceCheckUtils]: 2: Hoare triple {14602#true} assume true; {14602#true} is VALID [2022-04-28 03:44:39,997 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {14602#true} {14602#true} #52#return; {14602#true} is VALID [2022-04-28 03:44:39,997 INFO L272 TraceCheckUtils]: 4: Hoare triple {14602#true} call #t~ret9 := main(); {14602#true} is VALID [2022-04-28 03:44:39,998 INFO L290 TraceCheckUtils]: 5: Hoare triple {14602#true} ~x~0 := 0;~y~0 := 50000;~z~0 := 0;~x~0 := 0; {14644#(and (<= main_~z~0 0) (<= 50000 main_~y~0))} is VALID [2022-04-28 03:44:39,998 INFO L290 TraceCheckUtils]: 6: Hoare triple {14644#(and (<= main_~z~0 0) (<= 50000 main_~y~0))} [136] L11-2-->L18-1_primed: Formula: (let ((.cse0 (= |v_main_#t~post4_125| |v_main_#t~post4_124|))) (or (and (< v_main_~x~0_729 50001) (< v_main_~x~0_730 v_main_~x~0_729)) (and (not (< v_main_~x~0_730 50000)) (= v_main_~x~0_729 v_main_~x~0_730) .cse0) (and (= v_main_~x~0_730 v_main_~x~0_729) .cse0))) InVars {main_~x~0=v_main_~x~0_730, main_#t~post4=|v_main_#t~post4_125|} OutVars{main_~x~0=v_main_~x~0_729, main_#t~post4=|v_main_#t~post4_124|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {14644#(and (<= main_~z~0 0) (<= 50000 main_~y~0))} is VALID [2022-04-28 03:44:39,998 INFO L290 TraceCheckUtils]: 7: Hoare triple {14644#(and (<= main_~z~0 0) (<= 50000 main_~y~0))} [137] L18-1_primed-->L11-2: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {14644#(and (<= main_~z~0 0) (<= 50000 main_~y~0))} is VALID [2022-04-28 03:44:39,999 INFO L290 TraceCheckUtils]: 8: Hoare triple {14644#(and (<= main_~z~0 0) (<= 50000 main_~y~0))} [138] L11-2-->L18-1_primed: Formula: (let ((.cse0 (= |v_main_#t~post6_137| |v_main_#t~post6_136|)) (.cse1 (= |v_main_#t~post5_137| |v_main_#t~post5_136|)) (.cse2 (= v_main_~x~0_732 v_main_~x~0_731)) (.cse4 (<= 50000 v_main_~x~0_732))) (or (and .cse0 .cse1 .cse2 (= v_main_~y~0_690 v_main_~y~0_689)) (let ((.cse3 (+ v_main_~x~0_732 v_main_~y~0_689))) (and (< .cse3 (+ v_main_~y~0_690 1000001)) (= (+ v_main_~x~0_731 v_main_~y~0_690) .cse3) .cse4 (< v_main_~y~0_690 v_main_~y~0_689))) (and .cse0 .cse1 .cse2 (= v_main_~y~0_689 v_main_~y~0_690) (or (not .cse4) (not (< v_main_~x~0_732 1000000)))))) InVars {main_~y~0=v_main_~y~0_690, main_#t~post5=|v_main_#t~post5_137|, main_~x~0=v_main_~x~0_732, main_#t~post6=|v_main_#t~post6_137|} OutVars{main_~y~0=v_main_~y~0_689, main_#t~post5=|v_main_#t~post5_136|, main_~x~0=v_main_~x~0_731, main_#t~post6=|v_main_#t~post6_136|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {14644#(and (<= main_~z~0 0) (<= 50000 main_~y~0))} is VALID [2022-04-28 03:44:40,000 INFO L290 TraceCheckUtils]: 9: Hoare triple {14644#(and (<= main_~z~0 0) (<= 50000 main_~y~0))} [135] L18-1_primed-->L18-1: Formula: (not (< v_main_~x~0_11 1000000)) InVars {main_~x~0=v_main_~x~0_11} OutVars{main_~x~0=v_main_~x~0_11} AuxVars[] AssignedVars[] {14644#(and (<= main_~z~0 0) (<= 50000 main_~y~0))} is VALID [2022-04-28 03:44:40,000 INFO L290 TraceCheckUtils]: 10: Hoare triple {14644#(and (<= main_~z~0 0) (<= 50000 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {14660#(and (<= main_~z~0 0) (<= 49999 main_~y~0))} is VALID [2022-04-28 03:44:40,001 INFO L290 TraceCheckUtils]: 11: Hoare triple {14660#(and (<= main_~z~0 0) (<= 49999 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {14664#(and (<= main_~z~0 0) (<= 49998 main_~y~0))} is VALID [2022-04-28 03:44:40,001 INFO L290 TraceCheckUtils]: 12: Hoare triple {14664#(and (<= main_~z~0 0) (<= 49998 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {14668#(and (<= main_~z~0 0) (<= 49997 main_~y~0))} is VALID [2022-04-28 03:44:40,002 INFO L290 TraceCheckUtils]: 13: Hoare triple {14668#(and (<= main_~z~0 0) (<= 49997 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {14672#(and (<= main_~z~0 0) (<= 49996 main_~y~0))} is VALID [2022-04-28 03:44:40,002 INFO L290 TraceCheckUtils]: 14: Hoare triple {14672#(and (<= main_~z~0 0) (<= 49996 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {14676#(and (<= main_~z~0 0) (<= 49995 main_~y~0))} is VALID [2022-04-28 03:44:40,003 INFO L290 TraceCheckUtils]: 15: Hoare triple {14676#(and (<= main_~z~0 0) (<= 49995 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {14680#(and (<= main_~z~0 0) (<= 49994 main_~y~0))} is VALID [2022-04-28 03:44:40,003 INFO L290 TraceCheckUtils]: 16: Hoare triple {14680#(and (<= main_~z~0 0) (<= 49994 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {14684#(and (<= main_~z~0 0) (<= 49993 main_~y~0))} is VALID [2022-04-28 03:44:40,004 INFO L290 TraceCheckUtils]: 17: Hoare triple {14684#(and (<= main_~z~0 0) (<= 49993 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {14688#(and (<= main_~z~0 0) (<= 49992 main_~y~0))} is VALID [2022-04-28 03:44:40,004 INFO L290 TraceCheckUtils]: 18: Hoare triple {14688#(and (<= main_~z~0 0) (<= 49992 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {14692#(and (<= main_~z~0 0) (<= 49991 main_~y~0))} is VALID [2022-04-28 03:44:40,005 INFO L290 TraceCheckUtils]: 19: Hoare triple {14692#(and (<= main_~z~0 0) (<= 49991 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {14696#(and (<= main_~z~0 0) (<= 49990 main_~y~0))} is VALID [2022-04-28 03:44:40,005 INFO L290 TraceCheckUtils]: 20: Hoare triple {14696#(and (<= main_~z~0 0) (<= 49990 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {14700#(and (<= main_~z~0 0) (<= 49989 main_~y~0))} is VALID [2022-04-28 03:44:40,006 INFO L290 TraceCheckUtils]: 21: Hoare triple {14700#(and (<= main_~z~0 0) (<= 49989 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {14704#(and (<= main_~z~0 0) (<= 49988 main_~y~0))} is VALID [2022-04-28 03:44:40,006 INFO L290 TraceCheckUtils]: 22: Hoare triple {14704#(and (<= main_~z~0 0) (<= 49988 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {14708#(and (<= main_~z~0 0) (<= 49987 main_~y~0))} is VALID [2022-04-28 03:44:40,007 INFO L290 TraceCheckUtils]: 23: Hoare triple {14708#(and (<= main_~z~0 0) (<= 49987 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {14712#(and (<= main_~z~0 0) (<= 49986 main_~y~0))} is VALID [2022-04-28 03:44:40,007 INFO L290 TraceCheckUtils]: 24: Hoare triple {14712#(and (<= main_~z~0 0) (<= 49986 main_~y~0))} assume !(~y~0 > ~z~0); {14603#false} is VALID [2022-04-28 03:44:40,007 INFO L272 TraceCheckUtils]: 25: Hoare triple {14603#false} call __VERIFIER_assert((if ~x~0 == ~z~0 then 1 else 0)); {14603#false} is VALID [2022-04-28 03:44:40,007 INFO L290 TraceCheckUtils]: 26: Hoare triple {14603#false} ~cond := #in~cond; {14603#false} is VALID [2022-04-28 03:44:40,008 INFO L290 TraceCheckUtils]: 27: Hoare triple {14603#false} assume 0 == ~cond; {14603#false} is VALID [2022-04-28 03:44:40,008 INFO L290 TraceCheckUtils]: 28: Hoare triple {14603#false} assume !false; {14603#false} is VALID [2022-04-28 03:44:40,008 INFO L134 CoverageAnalysis]: Checked inductivity of 107 backedges. 0 proven. 105 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-04-28 03:44:40,008 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 03:44:40,812 INFO L290 TraceCheckUtils]: 28: Hoare triple {14603#false} assume !false; {14603#false} is VALID [2022-04-28 03:44:40,812 INFO L290 TraceCheckUtils]: 27: Hoare triple {14603#false} assume 0 == ~cond; {14603#false} is VALID [2022-04-28 03:44:40,812 INFO L290 TraceCheckUtils]: 26: Hoare triple {14603#false} ~cond := #in~cond; {14603#false} is VALID [2022-04-28 03:44:40,812 INFO L272 TraceCheckUtils]: 25: Hoare triple {14603#false} call __VERIFIER_assert((if ~x~0 == ~z~0 then 1 else 0)); {14603#false} is VALID [2022-04-28 03:44:40,812 INFO L290 TraceCheckUtils]: 24: Hoare triple {14740#(< main_~z~0 main_~y~0)} assume !(~y~0 > ~z~0); {14603#false} is VALID [2022-04-28 03:44:40,813 INFO L290 TraceCheckUtils]: 23: Hoare triple {14744#(< (+ main_~z~0 1) main_~y~0)} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {14740#(< main_~z~0 main_~y~0)} is VALID [2022-04-28 03:44:40,813 INFO L290 TraceCheckUtils]: 22: Hoare triple {14748#(< (+ main_~z~0 2) main_~y~0)} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {14744#(< (+ main_~z~0 1) main_~y~0)} is VALID [2022-04-28 03:44:40,814 INFO L290 TraceCheckUtils]: 21: Hoare triple {14752#(< (+ main_~z~0 3) main_~y~0)} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {14748#(< (+ main_~z~0 2) main_~y~0)} is VALID [2022-04-28 03:44:40,814 INFO L290 TraceCheckUtils]: 20: Hoare triple {14756#(< (+ main_~z~0 4) main_~y~0)} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {14752#(< (+ main_~z~0 3) main_~y~0)} is VALID [2022-04-28 03:44:40,815 INFO L290 TraceCheckUtils]: 19: Hoare triple {14760#(< (+ 5 main_~z~0) main_~y~0)} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {14756#(< (+ main_~z~0 4) main_~y~0)} is VALID [2022-04-28 03:44:40,815 INFO L290 TraceCheckUtils]: 18: Hoare triple {14764#(< (+ main_~z~0 6) main_~y~0)} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {14760#(< (+ 5 main_~z~0) main_~y~0)} is VALID [2022-04-28 03:44:40,815 INFO L290 TraceCheckUtils]: 17: Hoare triple {14768#(< (+ 7 main_~z~0) main_~y~0)} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {14764#(< (+ main_~z~0 6) main_~y~0)} is VALID [2022-04-28 03:44:40,816 INFO L290 TraceCheckUtils]: 16: Hoare triple {14772#(< (+ main_~z~0 8) main_~y~0)} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {14768#(< (+ 7 main_~z~0) main_~y~0)} is VALID [2022-04-28 03:44:40,816 INFO L290 TraceCheckUtils]: 15: Hoare triple {14776#(< (+ main_~z~0 9) main_~y~0)} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {14772#(< (+ main_~z~0 8) main_~y~0)} is VALID [2022-04-28 03:44:40,817 INFO L290 TraceCheckUtils]: 14: Hoare triple {14780#(< (+ main_~z~0 10) main_~y~0)} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {14776#(< (+ main_~z~0 9) main_~y~0)} is VALID [2022-04-28 03:44:40,817 INFO L290 TraceCheckUtils]: 13: Hoare triple {14784#(< (+ main_~z~0 11) main_~y~0)} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {14780#(< (+ main_~z~0 10) main_~y~0)} is VALID [2022-04-28 03:44:40,818 INFO L290 TraceCheckUtils]: 12: Hoare triple {14788#(< (+ main_~z~0 12) main_~y~0)} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {14784#(< (+ main_~z~0 11) main_~y~0)} is VALID [2022-04-28 03:44:40,818 INFO L290 TraceCheckUtils]: 11: Hoare triple {14792#(< (+ main_~z~0 13) main_~y~0)} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {14788#(< (+ main_~z~0 12) main_~y~0)} is VALID [2022-04-28 03:44:40,819 INFO L290 TraceCheckUtils]: 10: Hoare triple {14796#(< (+ main_~z~0 14) main_~y~0)} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {14792#(< (+ main_~z~0 13) main_~y~0)} is VALID [2022-04-28 03:44:40,819 INFO L290 TraceCheckUtils]: 9: Hoare triple {14796#(< (+ main_~z~0 14) main_~y~0)} [135] L18-1_primed-->L18-1: Formula: (not (< v_main_~x~0_11 1000000)) InVars {main_~x~0=v_main_~x~0_11} OutVars{main_~x~0=v_main_~x~0_11} AuxVars[] AssignedVars[] {14796#(< (+ main_~z~0 14) main_~y~0)} is VALID [2022-04-28 03:44:40,820 INFO L290 TraceCheckUtils]: 8: Hoare triple {14796#(< (+ main_~z~0 14) main_~y~0)} [138] L11-2-->L18-1_primed: Formula: (let ((.cse0 (= |v_main_#t~post6_137| |v_main_#t~post6_136|)) (.cse1 (= |v_main_#t~post5_137| |v_main_#t~post5_136|)) (.cse2 (= v_main_~x~0_732 v_main_~x~0_731)) (.cse4 (<= 50000 v_main_~x~0_732))) (or (and .cse0 .cse1 .cse2 (= v_main_~y~0_690 v_main_~y~0_689)) (let ((.cse3 (+ v_main_~x~0_732 v_main_~y~0_689))) (and (< .cse3 (+ v_main_~y~0_690 1000001)) (= (+ v_main_~x~0_731 v_main_~y~0_690) .cse3) .cse4 (< v_main_~y~0_690 v_main_~y~0_689))) (and .cse0 .cse1 .cse2 (= v_main_~y~0_689 v_main_~y~0_690) (or (not .cse4) (not (< v_main_~x~0_732 1000000)))))) InVars {main_~y~0=v_main_~y~0_690, main_#t~post5=|v_main_#t~post5_137|, main_~x~0=v_main_~x~0_732, main_#t~post6=|v_main_#t~post6_137|} OutVars{main_~y~0=v_main_~y~0_689, main_#t~post5=|v_main_#t~post5_136|, main_~x~0=v_main_~x~0_731, main_#t~post6=|v_main_#t~post6_136|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {14796#(< (+ main_~z~0 14) main_~y~0)} is VALID [2022-04-28 03:44:40,820 INFO L290 TraceCheckUtils]: 7: Hoare triple {14796#(< (+ main_~z~0 14) main_~y~0)} [137] L18-1_primed-->L11-2: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {14796#(< (+ main_~z~0 14) main_~y~0)} is VALID [2022-04-28 03:44:40,820 INFO L290 TraceCheckUtils]: 6: Hoare triple {14796#(< (+ main_~z~0 14) main_~y~0)} [136] L11-2-->L18-1_primed: Formula: (let ((.cse0 (= |v_main_#t~post4_125| |v_main_#t~post4_124|))) (or (and (< v_main_~x~0_729 50001) (< v_main_~x~0_730 v_main_~x~0_729)) (and (not (< v_main_~x~0_730 50000)) (= v_main_~x~0_729 v_main_~x~0_730) .cse0) (and (= v_main_~x~0_730 v_main_~x~0_729) .cse0))) InVars {main_~x~0=v_main_~x~0_730, main_#t~post4=|v_main_#t~post4_125|} OutVars{main_~x~0=v_main_~x~0_729, main_#t~post4=|v_main_#t~post4_124|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {14796#(< (+ main_~z~0 14) main_~y~0)} is VALID [2022-04-28 03:44:40,821 INFO L290 TraceCheckUtils]: 5: Hoare triple {14602#true} ~x~0 := 0;~y~0 := 50000;~z~0 := 0;~x~0 := 0; {14796#(< (+ main_~z~0 14) main_~y~0)} is VALID [2022-04-28 03:44:40,821 INFO L272 TraceCheckUtils]: 4: Hoare triple {14602#true} call #t~ret9 := main(); {14602#true} is VALID [2022-04-28 03:44:40,821 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {14602#true} {14602#true} #52#return; {14602#true} is VALID [2022-04-28 03:44:40,821 INFO L290 TraceCheckUtils]: 2: Hoare triple {14602#true} assume true; {14602#true} is VALID [2022-04-28 03:44:40,821 INFO L290 TraceCheckUtils]: 1: Hoare triple {14602#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(17, 2);call #Ultimate.allocInit(12, 3); {14602#true} is VALID [2022-04-28 03:44:40,821 INFO L272 TraceCheckUtils]: 0: Hoare triple {14602#true} call ULTIMATE.init(); {14602#true} is VALID [2022-04-28 03:44:40,821 INFO L134 CoverageAnalysis]: Checked inductivity of 107 backedges. 0 proven. 105 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-04-28 03:44:40,821 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1078967989] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 03:44:40,821 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 03:44:40,822 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 17, 17] total 51 [2022-04-28 03:44:41,850 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 03:44:41,850 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [2083971686] [2022-04-28 03:44:41,850 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [2083971686] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 03:44:41,851 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 03:44:41,851 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [46] imperfect sequences [] total 46 [2022-04-28 03:44:41,851 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1803523316] [2022-04-28 03:44:41,851 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 03:44:41,851 INFO L78 Accepts]: Start accepts. Automaton has has 46 states, 46 states have (on average 1.6521739130434783) internal successors, (76), 45 states have internal predecessors, (76), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 80 [2022-04-28 03:44:41,851 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 03:44:41,851 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 46 states, 46 states have (on average 1.6521739130434783) internal successors, (76), 45 states have internal predecessors, (76), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:44:41,910 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 80 edges. 80 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 03:44:41,911 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 46 states [2022-04-28 03:44:41,911 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 03:44:41,911 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2022-04-28 03:44:41,912 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=2436, Invalid=3726, Unknown=0, NotChecked=0, Total=6162 [2022-04-28 03:44:41,913 INFO L87 Difference]: Start difference. First operand 127 states and 131 transitions. Second operand has 46 states, 46 states have (on average 1.6521739130434783) internal successors, (76), 45 states have internal predecessors, (76), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:44:45,918 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:44:45,919 INFO L93 Difference]: Finished difference Result 197 states and 207 transitions. [2022-04-28 03:44:45,919 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2022-04-28 03:44:45,919 INFO L78 Accepts]: Start accepts. Automaton has has 46 states, 46 states have (on average 1.6521739130434783) internal successors, (76), 45 states have internal predecessors, (76), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 80 [2022-04-28 03:44:45,919 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 03:44:45,919 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 46 states, 46 states have (on average 1.6521739130434783) internal successors, (76), 45 states have internal predecessors, (76), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:44:45,921 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 101 transitions. [2022-04-28 03:44:45,921 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 46 states, 46 states have (on average 1.6521739130434783) internal successors, (76), 45 states have internal predecessors, (76), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:44:45,922 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 101 transitions. [2022-04-28 03:44:45,922 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 46 states and 101 transitions. [2022-04-28 03:44:46,030 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 101 edges. 101 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 03:44:46,032 INFO L225 Difference]: With dead ends: 197 [2022-04-28 03:44:46,032 INFO L226 Difference]: Without dead ends: 130 [2022-04-28 03:44:46,033 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 182 GetRequests, 60 SyntacticMatches, 2 SemanticMatches, 120 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4259 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=4886, Invalid=9876, Unknown=0, NotChecked=0, Total=14762 [2022-04-28 03:44:46,034 INFO L413 NwaCegarLoop]: 13 mSDtfsCounter, 154 mSDsluCounter, 32 mSDsCounter, 0 mSdLazyCounter, 1665 mSolverCounterSat, 166 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 154 SdHoareTripleChecker+Valid, 45 SdHoareTripleChecker+Invalid, 1831 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 166 IncrementalHoareTripleChecker+Valid, 1665 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2022-04-28 03:44:46,034 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [154 Valid, 45 Invalid, 1831 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [166 Valid, 1665 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2022-04-28 03:44:46,034 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 130 states. [2022-04-28 03:44:46,344 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 130 to 130. [2022-04-28 03:44:46,344 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 03:44:46,344 INFO L82 GeneralOperation]: Start isEquivalent. First operand 130 states. Second operand has 130 states, 125 states have (on average 1.04) internal successors, (130), 125 states have internal predecessors, (130), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:44:46,344 INFO L74 IsIncluded]: Start isIncluded. First operand 130 states. Second operand has 130 states, 125 states have (on average 1.04) internal successors, (130), 125 states have internal predecessors, (130), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:44:46,345 INFO L87 Difference]: Start difference. First operand 130 states. Second operand has 130 states, 125 states have (on average 1.04) internal successors, (130), 125 states have internal predecessors, (130), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:44:46,347 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:44:46,347 INFO L93 Difference]: Finished difference Result 130 states and 134 transitions. [2022-04-28 03:44:46,347 INFO L276 IsEmpty]: Start isEmpty. Operand 130 states and 134 transitions. [2022-04-28 03:44:46,348 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:44:46,348 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:44:46,348 INFO L74 IsIncluded]: Start isIncluded. First operand has 130 states, 125 states have (on average 1.04) internal successors, (130), 125 states have internal predecessors, (130), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 130 states. [2022-04-28 03:44:46,348 INFO L87 Difference]: Start difference. First operand has 130 states, 125 states have (on average 1.04) internal successors, (130), 125 states have internal predecessors, (130), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 130 states. [2022-04-28 03:44:46,350 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:44:46,350 INFO L93 Difference]: Finished difference Result 130 states and 134 transitions. [2022-04-28 03:44:46,350 INFO L276 IsEmpty]: Start isEmpty. Operand 130 states and 134 transitions. [2022-04-28 03:44:46,351 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:44:46,351 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:44:46,351 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 03:44:46,351 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 03:44:46,351 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 130 states, 125 states have (on average 1.04) internal successors, (130), 125 states have internal predecessors, (130), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:44:46,353 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 130 states to 130 states and 134 transitions. [2022-04-28 03:44:46,353 INFO L78 Accepts]: Start accepts. Automaton has 130 states and 134 transitions. Word has length 80 [2022-04-28 03:44:46,354 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 03:44:46,354 INFO L495 AbstractCegarLoop]: Abstraction has 130 states and 134 transitions. [2022-04-28 03:44:46,354 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 46 states, 46 states have (on average 1.6521739130434783) internal successors, (76), 45 states have internal predecessors, (76), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:44:46,354 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 130 states and 134 transitions. [2022-04-28 03:44:46,500 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 134 edges. 134 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 03:44:46,500 INFO L276 IsEmpty]: Start isEmpty. Operand 130 states and 134 transitions. [2022-04-28 03:44:46,500 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2022-04-28 03:44:46,501 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 03:44:46,501 INFO L195 NwaCegarLoop]: trace histogram [28, 27, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 03:44:46,516 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Forceful destruction successful, exit code 0 [2022-04-28 03:44:46,701 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 21 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable22 [2022-04-28 03:44:46,701 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 03:44:46,702 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 03:44:46,702 INFO L85 PathProgramCache]: Analyzing trace with hash -300699166, now seen corresponding path program 21 times [2022-04-28 03:44:46,702 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 03:44:46,702 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1666028952] [2022-04-28 03:44:50,762 WARN L977 rdanLoopAcceleration]: Unable to prove correctness of quantifier elimination. [2022-04-28 03:44:50,810 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 1 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 03:44:54,942 WARN L977 rdanLoopAcceleration]: Unable to prove correctness of quantifier elimination. [2022-04-28 03:44:55,061 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={1=1, 2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 03:44:55,062 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-28 03:44:55,064 INFO L85 PathProgramCache]: Analyzing trace with hash -31057502, now seen corresponding path program 1 times [2022-04-28 03:44:55,064 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 03:44:55,064 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1903481389] [2022-04-28 03:44:55,064 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:44:55,065 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 03:44:55,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:44:55,352 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 03:44:55,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:44:55,356 INFO L290 TraceCheckUtils]: 0: Hoare triple {15879#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(17, 2);call #Ultimate.allocInit(12, 3); {15857#true} is VALID [2022-04-28 03:44:55,356 INFO L290 TraceCheckUtils]: 1: Hoare triple {15857#true} assume true; {15857#true} is VALID [2022-04-28 03:44:55,356 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {15857#true} {15857#true} #52#return; {15857#true} is VALID [2022-04-28 03:44:55,356 INFO L272 TraceCheckUtils]: 0: Hoare triple {15857#true} call ULTIMATE.init(); {15879#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 03:44:55,357 INFO L290 TraceCheckUtils]: 1: Hoare triple {15879#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(17, 2);call #Ultimate.allocInit(12, 3); {15857#true} is VALID [2022-04-28 03:44:55,357 INFO L290 TraceCheckUtils]: 2: Hoare triple {15857#true} assume true; {15857#true} is VALID [2022-04-28 03:44:55,357 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {15857#true} {15857#true} #52#return; {15857#true} is VALID [2022-04-28 03:44:55,357 INFO L272 TraceCheckUtils]: 4: Hoare triple {15857#true} call #t~ret9 := main(); {15857#true} is VALID [2022-04-28 03:44:55,357 INFO L290 TraceCheckUtils]: 5: Hoare triple {15857#true} ~x~0 := 0;~y~0 := 50000;~z~0 := 0;~x~0 := 0; {15862#(and (= main_~z~0 0) (<= 50000 main_~y~0))} is VALID [2022-04-28 03:44:55,358 INFO L290 TraceCheckUtils]: 6: Hoare triple {15862#(and (= main_~z~0 0) (<= 50000 main_~y~0))} [140] L11-2-->L18-1_primed: Formula: (let ((.cse0 (= |v_main_#t~post4_131| |v_main_#t~post4_130|))) (or (and .cse0 (= v_main_~x~0_787 v_main_~x~0_786)) (and .cse0 (= v_main_~x~0_786 v_main_~x~0_787) (not (< v_main_~x~0_787 50000))) (and (< v_main_~x~0_787 v_main_~x~0_786) (< v_main_~x~0_786 50001)))) InVars {main_~x~0=v_main_~x~0_787, main_#t~post4=|v_main_#t~post4_131|} OutVars{main_~x~0=v_main_~x~0_786, main_#t~post4=|v_main_#t~post4_130|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {15862#(and (= main_~z~0 0) (<= 50000 main_~y~0))} is VALID [2022-04-28 03:44:55,358 INFO L290 TraceCheckUtils]: 7: Hoare triple {15862#(and (= main_~z~0 0) (<= 50000 main_~y~0))} [141] L18-1_primed-->L11-2: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {15862#(and (= main_~z~0 0) (<= 50000 main_~y~0))} is VALID [2022-04-28 03:44:55,359 INFO L290 TraceCheckUtils]: 8: Hoare triple {15862#(and (= main_~z~0 0) (<= 50000 main_~y~0))} [142] L11-2-->L18-1_primed: Formula: (let ((.cse0 (= v_main_~x~0_789 v_main_~x~0_788)) (.cse1 (= v_main_~y~0_753 v_main_~y~0_752)) (.cse3 (= |v_main_#t~post6_144| |v_main_#t~post6_143|)) (.cse4 (= |v_main_#t~post5_144| |v_main_#t~post5_143|)) (.cse2 (<= 50000 v_main_~x~0_789))) (or (and .cse0 .cse1 (or (not .cse2) (not (< v_main_~x~0_789 1000000))) .cse3 .cse4) (and .cse0 .cse1 .cse3 .cse4) (let ((.cse5 (+ v_main_~x~0_789 v_main_~y~0_752))) (and (< .cse5 (+ v_main_~y~0_753 1000001)) (< v_main_~y~0_753 v_main_~y~0_752) .cse2 (= (+ v_main_~x~0_788 v_main_~y~0_753) .cse5))))) InVars {main_~y~0=v_main_~y~0_753, main_#t~post5=|v_main_#t~post5_144|, main_~x~0=v_main_~x~0_789, main_#t~post6=|v_main_#t~post6_144|} OutVars{main_~y~0=v_main_~y~0_752, main_#t~post5=|v_main_#t~post5_143|, main_~x~0=v_main_~x~0_788, main_#t~post6=|v_main_#t~post6_143|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {15863#(and (= main_~z~0 0) (<= 16 main_~y~0))} is VALID [2022-04-28 03:44:55,360 INFO L290 TraceCheckUtils]: 9: Hoare triple {15863#(and (= main_~z~0 0) (<= 16 main_~y~0))} [139] L18-1_primed-->L18-1: Formula: (not (< v_main_~x~0_11 1000000)) InVars {main_~x~0=v_main_~x~0_11} OutVars{main_~x~0=v_main_~x~0_11} AuxVars[] AssignedVars[] {15863#(and (= main_~z~0 0) (<= 16 main_~y~0))} is VALID [2022-04-28 03:44:55,360 INFO L290 TraceCheckUtils]: 10: Hoare triple {15863#(and (= main_~z~0 0) (<= 16 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {15864#(and (= main_~z~0 0) (<= 15 main_~y~0))} is VALID [2022-04-28 03:44:55,361 INFO L290 TraceCheckUtils]: 11: Hoare triple {15864#(and (= main_~z~0 0) (<= 15 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {15865#(and (= main_~z~0 0) (<= 14 main_~y~0))} is VALID [2022-04-28 03:44:55,362 INFO L290 TraceCheckUtils]: 12: Hoare triple {15865#(and (= main_~z~0 0) (<= 14 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {15866#(and (= main_~z~0 0) (<= 13 main_~y~0))} is VALID [2022-04-28 03:44:55,362 INFO L290 TraceCheckUtils]: 13: Hoare triple {15866#(and (= main_~z~0 0) (<= 13 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {15867#(and (= main_~z~0 0) (<= 12 main_~y~0))} is VALID [2022-04-28 03:44:55,363 INFO L290 TraceCheckUtils]: 14: Hoare triple {15867#(and (= main_~z~0 0) (<= 12 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {15868#(and (= main_~z~0 0) (<= 11 main_~y~0))} is VALID [2022-04-28 03:44:55,363 INFO L290 TraceCheckUtils]: 15: Hoare triple {15868#(and (= main_~z~0 0) (<= 11 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {15869#(and (= main_~z~0 0) (<= 10 main_~y~0))} is VALID [2022-04-28 03:44:55,364 INFO L290 TraceCheckUtils]: 16: Hoare triple {15869#(and (= main_~z~0 0) (<= 10 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {15870#(and (= main_~z~0 0) (<= 9 main_~y~0))} is VALID [2022-04-28 03:44:55,365 INFO L290 TraceCheckUtils]: 17: Hoare triple {15870#(and (= main_~z~0 0) (<= 9 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {15871#(and (= main_~z~0 0) (<= 8 main_~y~0))} is VALID [2022-04-28 03:44:55,365 INFO L290 TraceCheckUtils]: 18: Hoare triple {15871#(and (= main_~z~0 0) (<= 8 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {15872#(and (= main_~z~0 0) (<= 7 main_~y~0))} is VALID [2022-04-28 03:44:55,366 INFO L290 TraceCheckUtils]: 19: Hoare triple {15872#(and (= main_~z~0 0) (<= 7 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {15873#(and (= main_~z~0 0) (<= 6 main_~y~0))} is VALID [2022-04-28 03:44:55,366 INFO L290 TraceCheckUtils]: 20: Hoare triple {15873#(and (= main_~z~0 0) (<= 6 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {15874#(and (= main_~z~0 0) (<= 5 main_~y~0))} is VALID [2022-04-28 03:44:55,367 INFO L290 TraceCheckUtils]: 21: Hoare triple {15874#(and (= main_~z~0 0) (<= 5 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {15875#(and (= main_~z~0 0) (<= 4 main_~y~0))} is VALID [2022-04-28 03:44:55,368 INFO L290 TraceCheckUtils]: 22: Hoare triple {15875#(and (= main_~z~0 0) (<= 4 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {15876#(and (= main_~z~0 0) (<= 3 main_~y~0))} is VALID [2022-04-28 03:44:55,368 INFO L290 TraceCheckUtils]: 23: Hoare triple {15876#(and (= main_~z~0 0) (<= 3 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {15877#(and (= main_~z~0 0) (<= 2 main_~y~0))} is VALID [2022-04-28 03:44:55,369 INFO L290 TraceCheckUtils]: 24: Hoare triple {15877#(and (= main_~z~0 0) (<= 2 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {15878#(and (= main_~z~0 0) (<= 1 main_~y~0))} is VALID [2022-04-28 03:44:55,369 INFO L290 TraceCheckUtils]: 25: Hoare triple {15878#(and (= main_~z~0 0) (<= 1 main_~y~0))} assume !(~y~0 > ~z~0); {15858#false} is VALID [2022-04-28 03:44:55,369 INFO L272 TraceCheckUtils]: 26: Hoare triple {15858#false} call __VERIFIER_assert((if ~x~0 == ~z~0 then 1 else 0)); {15858#false} is VALID [2022-04-28 03:44:55,369 INFO L290 TraceCheckUtils]: 27: Hoare triple {15858#false} ~cond := #in~cond; {15858#false} is VALID [2022-04-28 03:44:55,370 INFO L290 TraceCheckUtils]: 28: Hoare triple {15858#false} assume 0 == ~cond; {15858#false} is VALID [2022-04-28 03:44:55,370 INFO L290 TraceCheckUtils]: 29: Hoare triple {15858#false} assume !false; {15858#false} is VALID [2022-04-28 03:44:55,370 INFO L134 CoverageAnalysis]: Checked inductivity of 122 backedges. 0 proven. 121 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-04-28 03:44:55,370 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 03:44:55,370 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1903481389] [2022-04-28 03:44:55,370 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1903481389] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 03:44:55,370 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [481409712] [2022-04-28 03:44:55,371 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:44:55,371 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 03:44:55,371 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 03:44:55,379 INFO L229 MonitoredProcess]: Starting monitored process 22 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 03:44:55,381 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Waiting until timeout for monitored process [2022-04-28 03:44:55,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:44:55,418 INFO L263 TraceCheckSpWp]: Trace formula consists of 134 conjuncts, 19 conjunts are in the unsatisfiable core [2022-04-28 03:44:55,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:44:55,431 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 03:44:56,130 INFO L272 TraceCheckUtils]: 0: Hoare triple {15857#true} call ULTIMATE.init(); {15857#true} is VALID [2022-04-28 03:44:56,131 INFO L290 TraceCheckUtils]: 1: Hoare triple {15857#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(17, 2);call #Ultimate.allocInit(12, 3); {15857#true} is VALID [2022-04-28 03:44:56,131 INFO L290 TraceCheckUtils]: 2: Hoare triple {15857#true} assume true; {15857#true} is VALID [2022-04-28 03:44:56,131 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {15857#true} {15857#true} #52#return; {15857#true} is VALID [2022-04-28 03:44:56,131 INFO L272 TraceCheckUtils]: 4: Hoare triple {15857#true} call #t~ret9 := main(); {15857#true} is VALID [2022-04-28 03:44:56,131 INFO L290 TraceCheckUtils]: 5: Hoare triple {15857#true} ~x~0 := 0;~y~0 := 50000;~z~0 := 0;~x~0 := 0; {15898#(and (<= main_~z~0 0) (<= 50000 main_~y~0))} is VALID [2022-04-28 03:44:56,132 INFO L290 TraceCheckUtils]: 6: Hoare triple {15898#(and (<= main_~z~0 0) (<= 50000 main_~y~0))} [140] L11-2-->L18-1_primed: Formula: (let ((.cse0 (= |v_main_#t~post4_131| |v_main_#t~post4_130|))) (or (and .cse0 (= v_main_~x~0_787 v_main_~x~0_786)) (and .cse0 (= v_main_~x~0_786 v_main_~x~0_787) (not (< v_main_~x~0_787 50000))) (and (< v_main_~x~0_787 v_main_~x~0_786) (< v_main_~x~0_786 50001)))) InVars {main_~x~0=v_main_~x~0_787, main_#t~post4=|v_main_#t~post4_131|} OutVars{main_~x~0=v_main_~x~0_786, main_#t~post4=|v_main_#t~post4_130|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {15898#(and (<= main_~z~0 0) (<= 50000 main_~y~0))} is VALID [2022-04-28 03:44:56,132 INFO L290 TraceCheckUtils]: 7: Hoare triple {15898#(and (<= main_~z~0 0) (<= 50000 main_~y~0))} [141] L18-1_primed-->L11-2: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {15898#(and (<= main_~z~0 0) (<= 50000 main_~y~0))} is VALID [2022-04-28 03:44:56,133 INFO L290 TraceCheckUtils]: 8: Hoare triple {15898#(and (<= main_~z~0 0) (<= 50000 main_~y~0))} [142] L11-2-->L18-1_primed: Formula: (let ((.cse0 (= v_main_~x~0_789 v_main_~x~0_788)) (.cse1 (= v_main_~y~0_753 v_main_~y~0_752)) (.cse3 (= |v_main_#t~post6_144| |v_main_#t~post6_143|)) (.cse4 (= |v_main_#t~post5_144| |v_main_#t~post5_143|)) (.cse2 (<= 50000 v_main_~x~0_789))) (or (and .cse0 .cse1 (or (not .cse2) (not (< v_main_~x~0_789 1000000))) .cse3 .cse4) (and .cse0 .cse1 .cse3 .cse4) (let ((.cse5 (+ v_main_~x~0_789 v_main_~y~0_752))) (and (< .cse5 (+ v_main_~y~0_753 1000001)) (< v_main_~y~0_753 v_main_~y~0_752) .cse2 (= (+ v_main_~x~0_788 v_main_~y~0_753) .cse5))))) InVars {main_~y~0=v_main_~y~0_753, main_#t~post5=|v_main_#t~post5_144|, main_~x~0=v_main_~x~0_789, main_#t~post6=|v_main_#t~post6_144|} OutVars{main_~y~0=v_main_~y~0_752, main_#t~post5=|v_main_#t~post5_143|, main_~x~0=v_main_~x~0_788, main_#t~post6=|v_main_#t~post6_143|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {15898#(and (<= main_~z~0 0) (<= 50000 main_~y~0))} is VALID [2022-04-28 03:44:56,133 INFO L290 TraceCheckUtils]: 9: Hoare triple {15898#(and (<= main_~z~0 0) (<= 50000 main_~y~0))} [139] L18-1_primed-->L18-1: Formula: (not (< v_main_~x~0_11 1000000)) InVars {main_~x~0=v_main_~x~0_11} OutVars{main_~x~0=v_main_~x~0_11} AuxVars[] AssignedVars[] {15898#(and (<= main_~z~0 0) (<= 50000 main_~y~0))} is VALID [2022-04-28 03:44:56,134 INFO L290 TraceCheckUtils]: 10: Hoare triple {15898#(and (<= main_~z~0 0) (<= 50000 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {15914#(and (<= main_~z~0 0) (<= 49999 main_~y~0))} is VALID [2022-04-28 03:44:56,134 INFO L290 TraceCheckUtils]: 11: Hoare triple {15914#(and (<= main_~z~0 0) (<= 49999 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {15918#(and (<= main_~z~0 0) (<= 49998 main_~y~0))} is VALID [2022-04-28 03:44:56,135 INFO L290 TraceCheckUtils]: 12: Hoare triple {15918#(and (<= main_~z~0 0) (<= 49998 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {15922#(and (<= main_~z~0 0) (<= 49997 main_~y~0))} is VALID [2022-04-28 03:44:56,135 INFO L290 TraceCheckUtils]: 13: Hoare triple {15922#(and (<= main_~z~0 0) (<= 49997 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {15926#(and (<= main_~z~0 0) (<= 49996 main_~y~0))} is VALID [2022-04-28 03:44:56,136 INFO L290 TraceCheckUtils]: 14: Hoare triple {15926#(and (<= main_~z~0 0) (<= 49996 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {15930#(and (<= main_~z~0 0) (<= 49995 main_~y~0))} is VALID [2022-04-28 03:44:56,136 INFO L290 TraceCheckUtils]: 15: Hoare triple {15930#(and (<= main_~z~0 0) (<= 49995 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {15934#(and (<= main_~z~0 0) (<= 49994 main_~y~0))} is VALID [2022-04-28 03:44:56,137 INFO L290 TraceCheckUtils]: 16: Hoare triple {15934#(and (<= main_~z~0 0) (<= 49994 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {15938#(and (<= main_~z~0 0) (<= 49993 main_~y~0))} is VALID [2022-04-28 03:44:56,137 INFO L290 TraceCheckUtils]: 17: Hoare triple {15938#(and (<= main_~z~0 0) (<= 49993 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {15942#(and (<= main_~z~0 0) (<= 49992 main_~y~0))} is VALID [2022-04-28 03:44:56,138 INFO L290 TraceCheckUtils]: 18: Hoare triple {15942#(and (<= main_~z~0 0) (<= 49992 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {15946#(and (<= main_~z~0 0) (<= 49991 main_~y~0))} is VALID [2022-04-28 03:44:56,138 INFO L290 TraceCheckUtils]: 19: Hoare triple {15946#(and (<= main_~z~0 0) (<= 49991 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {15950#(and (<= main_~z~0 0) (<= 49990 main_~y~0))} is VALID [2022-04-28 03:44:56,139 INFO L290 TraceCheckUtils]: 20: Hoare triple {15950#(and (<= main_~z~0 0) (<= 49990 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {15954#(and (<= main_~z~0 0) (<= 49989 main_~y~0))} is VALID [2022-04-28 03:44:56,139 INFO L290 TraceCheckUtils]: 21: Hoare triple {15954#(and (<= main_~z~0 0) (<= 49989 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {15958#(and (<= main_~z~0 0) (<= 49988 main_~y~0))} is VALID [2022-04-28 03:44:56,140 INFO L290 TraceCheckUtils]: 22: Hoare triple {15958#(and (<= main_~z~0 0) (<= 49988 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {15962#(and (<= main_~z~0 0) (<= 49987 main_~y~0))} is VALID [2022-04-28 03:44:56,140 INFO L290 TraceCheckUtils]: 23: Hoare triple {15962#(and (<= main_~z~0 0) (<= 49987 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {15966#(and (<= main_~z~0 0) (<= 49986 main_~y~0))} is VALID [2022-04-28 03:44:56,140 INFO L290 TraceCheckUtils]: 24: Hoare triple {15966#(and (<= main_~z~0 0) (<= 49986 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {15970#(and (<= main_~z~0 0) (<= 49985 main_~y~0))} is VALID [2022-04-28 03:44:56,141 INFO L290 TraceCheckUtils]: 25: Hoare triple {15970#(and (<= main_~z~0 0) (<= 49985 main_~y~0))} assume !(~y~0 > ~z~0); {15858#false} is VALID [2022-04-28 03:44:56,141 INFO L272 TraceCheckUtils]: 26: Hoare triple {15858#false} call __VERIFIER_assert((if ~x~0 == ~z~0 then 1 else 0)); {15858#false} is VALID [2022-04-28 03:44:56,141 INFO L290 TraceCheckUtils]: 27: Hoare triple {15858#false} ~cond := #in~cond; {15858#false} is VALID [2022-04-28 03:44:56,141 INFO L290 TraceCheckUtils]: 28: Hoare triple {15858#false} assume 0 == ~cond; {15858#false} is VALID [2022-04-28 03:44:56,141 INFO L290 TraceCheckUtils]: 29: Hoare triple {15858#false} assume !false; {15858#false} is VALID [2022-04-28 03:44:56,141 INFO L134 CoverageAnalysis]: Checked inductivity of 122 backedges. 0 proven. 120 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-04-28 03:44:56,141 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 03:44:56,974 INFO L290 TraceCheckUtils]: 29: Hoare triple {15858#false} assume !false; {15858#false} is VALID [2022-04-28 03:44:56,975 INFO L290 TraceCheckUtils]: 28: Hoare triple {15858#false} assume 0 == ~cond; {15858#false} is VALID [2022-04-28 03:44:56,975 INFO L290 TraceCheckUtils]: 27: Hoare triple {15858#false} ~cond := #in~cond; {15858#false} is VALID [2022-04-28 03:44:56,975 INFO L272 TraceCheckUtils]: 26: Hoare triple {15858#false} call __VERIFIER_assert((if ~x~0 == ~z~0 then 1 else 0)); {15858#false} is VALID [2022-04-28 03:44:56,975 INFO L290 TraceCheckUtils]: 25: Hoare triple {15998#(< main_~z~0 main_~y~0)} assume !(~y~0 > ~z~0); {15858#false} is VALID [2022-04-28 03:44:56,976 INFO L290 TraceCheckUtils]: 24: Hoare triple {16002#(< (+ main_~z~0 1) main_~y~0)} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {15998#(< main_~z~0 main_~y~0)} is VALID [2022-04-28 03:44:56,976 INFO L290 TraceCheckUtils]: 23: Hoare triple {16006#(< (+ main_~z~0 2) main_~y~0)} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {16002#(< (+ main_~z~0 1) main_~y~0)} is VALID [2022-04-28 03:44:56,977 INFO L290 TraceCheckUtils]: 22: Hoare triple {16010#(< (+ main_~z~0 3) main_~y~0)} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {16006#(< (+ main_~z~0 2) main_~y~0)} is VALID [2022-04-28 03:44:56,977 INFO L290 TraceCheckUtils]: 21: Hoare triple {16014#(< (+ main_~z~0 4) main_~y~0)} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {16010#(< (+ main_~z~0 3) main_~y~0)} is VALID [2022-04-28 03:44:56,977 INFO L290 TraceCheckUtils]: 20: Hoare triple {16018#(< (+ 5 main_~z~0) main_~y~0)} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {16014#(< (+ main_~z~0 4) main_~y~0)} is VALID [2022-04-28 03:44:56,978 INFO L290 TraceCheckUtils]: 19: Hoare triple {16022#(< (+ main_~z~0 6) main_~y~0)} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {16018#(< (+ 5 main_~z~0) main_~y~0)} is VALID [2022-04-28 03:44:56,978 INFO L290 TraceCheckUtils]: 18: Hoare triple {16026#(< (+ 7 main_~z~0) main_~y~0)} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {16022#(< (+ main_~z~0 6) main_~y~0)} is VALID [2022-04-28 03:44:56,979 INFO L290 TraceCheckUtils]: 17: Hoare triple {16030#(< (+ main_~z~0 8) main_~y~0)} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {16026#(< (+ 7 main_~z~0) main_~y~0)} is VALID [2022-04-28 03:44:56,979 INFO L290 TraceCheckUtils]: 16: Hoare triple {16034#(< (+ main_~z~0 9) main_~y~0)} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {16030#(< (+ main_~z~0 8) main_~y~0)} is VALID [2022-04-28 03:44:56,980 INFO L290 TraceCheckUtils]: 15: Hoare triple {16038#(< (+ main_~z~0 10) main_~y~0)} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {16034#(< (+ main_~z~0 9) main_~y~0)} is VALID [2022-04-28 03:44:56,980 INFO L290 TraceCheckUtils]: 14: Hoare triple {16042#(< (+ main_~z~0 11) main_~y~0)} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {16038#(< (+ main_~z~0 10) main_~y~0)} is VALID [2022-04-28 03:44:56,981 INFO L290 TraceCheckUtils]: 13: Hoare triple {16046#(< (+ main_~z~0 12) main_~y~0)} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {16042#(< (+ main_~z~0 11) main_~y~0)} is VALID [2022-04-28 03:44:56,981 INFO L290 TraceCheckUtils]: 12: Hoare triple {16050#(< (+ main_~z~0 13) main_~y~0)} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {16046#(< (+ main_~z~0 12) main_~y~0)} is VALID [2022-04-28 03:44:56,982 INFO L290 TraceCheckUtils]: 11: Hoare triple {16054#(< (+ main_~z~0 14) main_~y~0)} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {16050#(< (+ main_~z~0 13) main_~y~0)} is VALID [2022-04-28 03:44:56,982 INFO L290 TraceCheckUtils]: 10: Hoare triple {16058#(< (+ main_~z~0 15) main_~y~0)} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {16054#(< (+ main_~z~0 14) main_~y~0)} is VALID [2022-04-28 03:44:56,982 INFO L290 TraceCheckUtils]: 9: Hoare triple {16058#(< (+ main_~z~0 15) main_~y~0)} [139] L18-1_primed-->L18-1: Formula: (not (< v_main_~x~0_11 1000000)) InVars {main_~x~0=v_main_~x~0_11} OutVars{main_~x~0=v_main_~x~0_11} AuxVars[] AssignedVars[] {16058#(< (+ main_~z~0 15) main_~y~0)} is VALID [2022-04-28 03:44:56,983 INFO L290 TraceCheckUtils]: 8: Hoare triple {16058#(< (+ main_~z~0 15) main_~y~0)} [142] L11-2-->L18-1_primed: Formula: (let ((.cse0 (= v_main_~x~0_789 v_main_~x~0_788)) (.cse1 (= v_main_~y~0_753 v_main_~y~0_752)) (.cse3 (= |v_main_#t~post6_144| |v_main_#t~post6_143|)) (.cse4 (= |v_main_#t~post5_144| |v_main_#t~post5_143|)) (.cse2 (<= 50000 v_main_~x~0_789))) (or (and .cse0 .cse1 (or (not .cse2) (not (< v_main_~x~0_789 1000000))) .cse3 .cse4) (and .cse0 .cse1 .cse3 .cse4) (let ((.cse5 (+ v_main_~x~0_789 v_main_~y~0_752))) (and (< .cse5 (+ v_main_~y~0_753 1000001)) (< v_main_~y~0_753 v_main_~y~0_752) .cse2 (= (+ v_main_~x~0_788 v_main_~y~0_753) .cse5))))) InVars {main_~y~0=v_main_~y~0_753, main_#t~post5=|v_main_#t~post5_144|, main_~x~0=v_main_~x~0_789, main_#t~post6=|v_main_#t~post6_144|} OutVars{main_~y~0=v_main_~y~0_752, main_#t~post5=|v_main_#t~post5_143|, main_~x~0=v_main_~x~0_788, main_#t~post6=|v_main_#t~post6_143|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {16058#(< (+ main_~z~0 15) main_~y~0)} is VALID [2022-04-28 03:44:56,984 INFO L290 TraceCheckUtils]: 7: Hoare triple {16058#(< (+ main_~z~0 15) main_~y~0)} [141] L18-1_primed-->L11-2: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {16058#(< (+ main_~z~0 15) main_~y~0)} is VALID [2022-04-28 03:44:56,984 INFO L290 TraceCheckUtils]: 6: Hoare triple {16058#(< (+ main_~z~0 15) main_~y~0)} [140] L11-2-->L18-1_primed: Formula: (let ((.cse0 (= |v_main_#t~post4_131| |v_main_#t~post4_130|))) (or (and .cse0 (= v_main_~x~0_787 v_main_~x~0_786)) (and .cse0 (= v_main_~x~0_786 v_main_~x~0_787) (not (< v_main_~x~0_787 50000))) (and (< v_main_~x~0_787 v_main_~x~0_786) (< v_main_~x~0_786 50001)))) InVars {main_~x~0=v_main_~x~0_787, main_#t~post4=|v_main_#t~post4_131|} OutVars{main_~x~0=v_main_~x~0_786, main_#t~post4=|v_main_#t~post4_130|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {16058#(< (+ main_~z~0 15) main_~y~0)} is VALID [2022-04-28 03:44:56,984 INFO L290 TraceCheckUtils]: 5: Hoare triple {15857#true} ~x~0 := 0;~y~0 := 50000;~z~0 := 0;~x~0 := 0; {16058#(< (+ main_~z~0 15) main_~y~0)} is VALID [2022-04-28 03:44:56,984 INFO L272 TraceCheckUtils]: 4: Hoare triple {15857#true} call #t~ret9 := main(); {15857#true} is VALID [2022-04-28 03:44:56,984 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {15857#true} {15857#true} #52#return; {15857#true} is VALID [2022-04-28 03:44:56,984 INFO L290 TraceCheckUtils]: 2: Hoare triple {15857#true} assume true; {15857#true} is VALID [2022-04-28 03:44:56,984 INFO L290 TraceCheckUtils]: 1: Hoare triple {15857#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(17, 2);call #Ultimate.allocInit(12, 3); {15857#true} is VALID [2022-04-28 03:44:56,985 INFO L272 TraceCheckUtils]: 0: Hoare triple {15857#true} call ULTIMATE.init(); {15857#true} is VALID [2022-04-28 03:44:56,985 INFO L134 CoverageAnalysis]: Checked inductivity of 122 backedges. 0 proven. 120 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-04-28 03:44:56,985 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [481409712] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 03:44:56,985 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 03:44:56,985 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 18, 18] total 52 [2022-04-28 03:44:58,036 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 03:44:58,037 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1666028952] [2022-04-28 03:44:58,037 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1666028952] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 03:44:58,037 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 03:44:58,037 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [49] imperfect sequences [] total 49 [2022-04-28 03:44:58,037 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [314731829] [2022-04-28 03:44:58,037 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 03:44:58,037 INFO L78 Accepts]: Start accepts. Automaton has has 49 states, 49 states have (on average 1.6122448979591837) internal successors, (79), 48 states have internal predecessors, (79), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 83 [2022-04-28 03:44:58,038 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 03:44:58,038 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 49 states, 49 states have (on average 1.6122448979591837) internal successors, (79), 48 states have internal predecessors, (79), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:44:58,103 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 83 edges. 83 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 03:44:58,103 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 49 states [2022-04-28 03:44:58,103 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 03:44:58,104 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 49 interpolants. [2022-04-28 03:44:58,105 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=2408, Invalid=4072, Unknown=0, NotChecked=0, Total=6480 [2022-04-28 03:44:58,105 INFO L87 Difference]: Start difference. First operand 130 states and 134 transitions. Second operand has 49 states, 49 states have (on average 1.6122448979591837) internal successors, (79), 48 states have internal predecessors, (79), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:45:02,377 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:45:02,378 INFO L93 Difference]: Finished difference Result 212 states and 233 transitions. [2022-04-28 03:45:02,378 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 49 states. [2022-04-28 03:45:02,378 INFO L78 Accepts]: Start accepts. Automaton has has 49 states, 49 states have (on average 1.6122448979591837) internal successors, (79), 48 states have internal predecessors, (79), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 83 [2022-04-28 03:45:02,378 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 03:45:02,378 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 49 states, 49 states have (on average 1.6122448979591837) internal successors, (79), 48 states have internal predecessors, (79), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:45:02,380 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 115 transitions. [2022-04-28 03:45:02,380 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 49 states, 49 states have (on average 1.6122448979591837) internal successors, (79), 48 states have internal predecessors, (79), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:45:02,382 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 115 transitions. [2022-04-28 03:45:02,382 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 49 states and 115 transitions. [2022-04-28 03:45:02,499 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 115 edges. 115 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 03:45:02,501 INFO L225 Difference]: With dead ends: 212 [2022-04-28 03:45:02,501 INFO L226 Difference]: Without dead ends: 144 [2022-04-28 03:45:02,502 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 188 GetRequests, 61 SyntacticMatches, 2 SemanticMatches, 125 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4993 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=5002, Invalid=11000, Unknown=0, NotChecked=0, Total=16002 [2022-04-28 03:45:02,503 INFO L413 NwaCegarLoop]: 12 mSDtfsCounter, 192 mSDsluCounter, 27 mSDsCounter, 0 mSdLazyCounter, 1699 mSolverCounterSat, 216 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 192 SdHoareTripleChecker+Valid, 39 SdHoareTripleChecker+Invalid, 1915 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 216 IncrementalHoareTripleChecker+Valid, 1699 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2022-04-28 03:45:02,503 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [192 Valid, 39 Invalid, 1915 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [216 Valid, 1699 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2022-04-28 03:45:02,503 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 144 states. [2022-04-28 03:45:02,693 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 144 to 90. [2022-04-28 03:45:02,693 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 03:45:02,694 INFO L82 GeneralOperation]: Start isEquivalent. First operand 144 states. Second operand has 90 states, 85 states have (on average 1.0470588235294118) internal successors, (89), 85 states have internal predecessors, (89), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:45:02,694 INFO L74 IsIncluded]: Start isIncluded. First operand 144 states. Second operand has 90 states, 85 states have (on average 1.0470588235294118) internal successors, (89), 85 states have internal predecessors, (89), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:45:02,694 INFO L87 Difference]: Start difference. First operand 144 states. Second operand has 90 states, 85 states have (on average 1.0470588235294118) internal successors, (89), 85 states have internal predecessors, (89), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:45:02,696 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:45:02,696 INFO L93 Difference]: Finished difference Result 144 states and 148 transitions. [2022-04-28 03:45:02,697 INFO L276 IsEmpty]: Start isEmpty. Operand 144 states and 148 transitions. [2022-04-28 03:45:02,697 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:45:02,697 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:45:02,697 INFO L74 IsIncluded]: Start isIncluded. First operand has 90 states, 85 states have (on average 1.0470588235294118) internal successors, (89), 85 states have internal predecessors, (89), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 144 states. [2022-04-28 03:45:02,697 INFO L87 Difference]: Start difference. First operand has 90 states, 85 states have (on average 1.0470588235294118) internal successors, (89), 85 states have internal predecessors, (89), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 144 states. [2022-04-28 03:45:02,700 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:45:02,700 INFO L93 Difference]: Finished difference Result 144 states and 148 transitions. [2022-04-28 03:45:02,700 INFO L276 IsEmpty]: Start isEmpty. Operand 144 states and 148 transitions. [2022-04-28 03:45:02,700 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:45:02,700 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:45:02,700 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 03:45:02,700 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 03:45:02,700 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 90 states, 85 states have (on average 1.0470588235294118) internal successors, (89), 85 states have internal predecessors, (89), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:45:02,702 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 93 transitions. [2022-04-28 03:45:02,702 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 93 transitions. Word has length 83 [2022-04-28 03:45:02,702 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 03:45:02,702 INFO L495 AbstractCegarLoop]: Abstraction has 90 states and 93 transitions. [2022-04-28 03:45:02,702 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 49 states, 49 states have (on average 1.6122448979591837) internal successors, (79), 48 states have internal predecessors, (79), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:45:02,702 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 90 states and 93 transitions. [2022-04-28 03:45:02,811 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 93 edges. 93 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 03:45:02,811 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 93 transitions. [2022-04-28 03:45:02,812 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2022-04-28 03:45:02,812 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 03:45:02,812 INFO L195 NwaCegarLoop]: trace histogram [30, 29, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 03:45:02,835 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Forceful destruction successful, exit code 0 [2022-04-28 03:45:03,012 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 22 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable23 [2022-04-28 03:45:03,013 INFO L420 AbstractCegarLoop]: === Iteration 25 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 03:45:03,013 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 03:45:03,013 INFO L85 PathProgramCache]: Analyzing trace with hash -945173960, now seen corresponding path program 22 times [2022-04-28 03:45:03,013 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 03:45:03,013 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [799816237] [2022-04-28 03:45:03,104 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 1 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 03:45:03,313 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={1=1, 2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 03:45:03,314 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-28 03:45:03,317 INFO L85 PathProgramCache]: Analyzing trace with hash -2118007166, now seen corresponding path program 1 times [2022-04-28 03:45:03,317 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 03:45:03,317 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [937399383] [2022-04-28 03:45:03,317 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:45:03,317 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 03:45:03,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:45:03,628 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 03:45:03,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:45:03,633 INFO L290 TraceCheckUtils]: 0: Hoare triple {17127#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(17, 2);call #Ultimate.allocInit(12, 3); {17104#true} is VALID [2022-04-28 03:45:03,633 INFO L290 TraceCheckUtils]: 1: Hoare triple {17104#true} assume true; {17104#true} is VALID [2022-04-28 03:45:03,633 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {17104#true} {17104#true} #52#return; {17104#true} is VALID [2022-04-28 03:45:03,633 INFO L272 TraceCheckUtils]: 0: Hoare triple {17104#true} call ULTIMATE.init(); {17127#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 03:45:03,633 INFO L290 TraceCheckUtils]: 1: Hoare triple {17127#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(17, 2);call #Ultimate.allocInit(12, 3); {17104#true} is VALID [2022-04-28 03:45:03,633 INFO L290 TraceCheckUtils]: 2: Hoare triple {17104#true} assume true; {17104#true} is VALID [2022-04-28 03:45:03,633 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {17104#true} {17104#true} #52#return; {17104#true} is VALID [2022-04-28 03:45:03,633 INFO L272 TraceCheckUtils]: 4: Hoare triple {17104#true} call #t~ret9 := main(); {17104#true} is VALID [2022-04-28 03:45:03,634 INFO L290 TraceCheckUtils]: 5: Hoare triple {17104#true} ~x~0 := 0;~y~0 := 50000;~z~0 := 0;~x~0 := 0; {17109#(and (= main_~z~0 0) (<= 50000 main_~y~0))} is VALID [2022-04-28 03:45:03,634 INFO L290 TraceCheckUtils]: 6: Hoare triple {17109#(and (= main_~z~0 0) (<= 50000 main_~y~0))} [144] L11-2-->L18-1_primed: Formula: (let ((.cse0 (= v_main_~x~0_846 v_main_~x~0_845)) (.cse1 (= |v_main_#t~post4_137| |v_main_#t~post4_136|))) (or (and .cse0 .cse1) (and (< v_main_~x~0_845 50001) (< v_main_~x~0_846 v_main_~x~0_845)) (and .cse0 .cse1 (<= 50000 v_main_~x~0_846)))) InVars {main_~x~0=v_main_~x~0_846, main_#t~post4=|v_main_#t~post4_137|} OutVars{main_~x~0=v_main_~x~0_845, main_#t~post4=|v_main_#t~post4_136|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {17109#(and (= main_~z~0 0) (<= 50000 main_~y~0))} is VALID [2022-04-28 03:45:03,635 INFO L290 TraceCheckUtils]: 7: Hoare triple {17109#(and (= main_~z~0 0) (<= 50000 main_~y~0))} [145] L18-1_primed-->L11-2: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {17109#(and (= main_~z~0 0) (<= 50000 main_~y~0))} is VALID [2022-04-28 03:45:03,637 INFO L290 TraceCheckUtils]: 8: Hoare triple {17109#(and (= main_~z~0 0) (<= 50000 main_~y~0))} [146] L11-2-->L18-1_primed: Formula: (let ((.cse1 (<= 50000 v_main_~x~0_848)) (.cse2 (= v_main_~x~0_848 v_main_~x~0_847)) (.cse3 (= v_main_~y~0_819 v_main_~y~0_818)) (.cse4 (= |v_main_#t~post6_151| |v_main_#t~post6_150|)) (.cse5 (= |v_main_#t~post5_151| |v_main_#t~post5_150|))) (or (let ((.cse0 (+ v_main_~x~0_848 v_main_~y~0_818))) (and (< v_main_~y~0_819 v_main_~y~0_818) (< .cse0 (+ v_main_~y~0_819 1000001)) (= (+ v_main_~x~0_847 v_main_~y~0_819) .cse0) .cse1)) (and .cse2 .cse3 .cse4 (or (not (< v_main_~x~0_848 1000000)) (not .cse1)) .cse5) (and .cse2 .cse3 .cse4 .cse5))) InVars {main_~y~0=v_main_~y~0_819, main_#t~post5=|v_main_#t~post5_151|, main_~x~0=v_main_~x~0_848, main_#t~post6=|v_main_#t~post6_151|} OutVars{main_~y~0=v_main_~y~0_818, main_#t~post5=|v_main_#t~post5_150|, main_~x~0=v_main_~x~0_847, main_#t~post6=|v_main_#t~post6_150|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {17109#(and (= main_~z~0 0) (<= 50000 main_~y~0))} is VALID [2022-04-28 03:45:03,638 INFO L290 TraceCheckUtils]: 9: Hoare triple {17109#(and (= main_~z~0 0) (<= 50000 main_~y~0))} [143] L18-1_primed-->L18-1: Formula: (not (< v_main_~x~0_11 1000000)) InVars {main_~x~0=v_main_~x~0_11} OutVars{main_~x~0=v_main_~x~0_11} AuxVars[] AssignedVars[] {17109#(and (= main_~z~0 0) (<= 50000 main_~y~0))} is VALID [2022-04-28 03:45:03,638 INFO L290 TraceCheckUtils]: 10: Hoare triple {17109#(and (= main_~z~0 0) (<= 50000 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {17110#(and (= main_~z~0 0) (<= 49999 main_~y~0))} is VALID [2022-04-28 03:45:03,639 INFO L290 TraceCheckUtils]: 11: Hoare triple {17110#(and (= main_~z~0 0) (<= 49999 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {17111#(and (<= 49998 main_~y~0) (= main_~z~0 0))} is VALID [2022-04-28 03:45:03,639 INFO L290 TraceCheckUtils]: 12: Hoare triple {17111#(and (<= 49998 main_~y~0) (= main_~z~0 0))} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {17112#(and (= main_~z~0 0) (<= 49997 main_~y~0))} is VALID [2022-04-28 03:45:03,640 INFO L290 TraceCheckUtils]: 13: Hoare triple {17112#(and (= main_~z~0 0) (<= 49997 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {17113#(and (= main_~z~0 0) (<= 49996 main_~y~0))} is VALID [2022-04-28 03:45:03,640 INFO L290 TraceCheckUtils]: 14: Hoare triple {17113#(and (= main_~z~0 0) (<= 49996 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {17114#(and (= main_~z~0 0) (<= 49995 main_~y~0))} is VALID [2022-04-28 03:45:03,641 INFO L290 TraceCheckUtils]: 15: Hoare triple {17114#(and (= main_~z~0 0) (<= 49995 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {17115#(and (= main_~z~0 0) (<= 49994 main_~y~0))} is VALID [2022-04-28 03:45:03,642 INFO L290 TraceCheckUtils]: 16: Hoare triple {17115#(and (= main_~z~0 0) (<= 49994 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {17116#(and (= main_~z~0 0) (<= 49993 main_~y~0))} is VALID [2022-04-28 03:45:03,642 INFO L290 TraceCheckUtils]: 17: Hoare triple {17116#(and (= main_~z~0 0) (<= 49993 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {17117#(and (= main_~z~0 0) (<= 49992 main_~y~0))} is VALID [2022-04-28 03:45:03,643 INFO L290 TraceCheckUtils]: 18: Hoare triple {17117#(and (= main_~z~0 0) (<= 49992 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {17118#(and (= main_~z~0 0) (<= 49991 main_~y~0))} is VALID [2022-04-28 03:45:03,643 INFO L290 TraceCheckUtils]: 19: Hoare triple {17118#(and (= main_~z~0 0) (<= 49991 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {17119#(and (<= 49990 main_~y~0) (= main_~z~0 0))} is VALID [2022-04-28 03:45:03,644 INFO L290 TraceCheckUtils]: 20: Hoare triple {17119#(and (<= 49990 main_~y~0) (= main_~z~0 0))} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {17120#(and (= main_~z~0 0) (<= 49989 main_~y~0))} is VALID [2022-04-28 03:45:03,644 INFO L290 TraceCheckUtils]: 21: Hoare triple {17120#(and (= main_~z~0 0) (<= 49989 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {17121#(and (= main_~z~0 0) (<= 49988 main_~y~0))} is VALID [2022-04-28 03:45:03,645 INFO L290 TraceCheckUtils]: 22: Hoare triple {17121#(and (= main_~z~0 0) (<= 49988 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {17122#(and (= main_~z~0 0) (<= 49987 main_~y~0))} is VALID [2022-04-28 03:45:03,645 INFO L290 TraceCheckUtils]: 23: Hoare triple {17122#(and (= main_~z~0 0) (<= 49987 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {17123#(and (= main_~z~0 0) (<= 49986 main_~y~0))} is VALID [2022-04-28 03:45:03,646 INFO L290 TraceCheckUtils]: 24: Hoare triple {17123#(and (= main_~z~0 0) (<= 49986 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {17124#(and (= main_~z~0 0) (<= 49985 main_~y~0))} is VALID [2022-04-28 03:45:03,649 INFO L290 TraceCheckUtils]: 25: Hoare triple {17124#(and (= main_~z~0 0) (<= 49985 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {17125#(and (= main_~z~0 0) (<= 49984 main_~y~0))} is VALID [2022-04-28 03:45:03,649 INFO L290 TraceCheckUtils]: 26: Hoare triple {17125#(and (= main_~z~0 0) (<= 49984 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {17126#(and (= main_~z~0 0) (<= 49983 main_~y~0))} is VALID [2022-04-28 03:45:03,650 INFO L290 TraceCheckUtils]: 27: Hoare triple {17126#(and (= main_~z~0 0) (<= 49983 main_~y~0))} assume !(~y~0 > ~z~0); {17105#false} is VALID [2022-04-28 03:45:03,650 INFO L272 TraceCheckUtils]: 28: Hoare triple {17105#false} call __VERIFIER_assert((if ~x~0 == ~z~0 then 1 else 0)); {17105#false} is VALID [2022-04-28 03:45:03,650 INFO L290 TraceCheckUtils]: 29: Hoare triple {17105#false} ~cond := #in~cond; {17105#false} is VALID [2022-04-28 03:45:03,650 INFO L290 TraceCheckUtils]: 30: Hoare triple {17105#false} assume 0 == ~cond; {17105#false} is VALID [2022-04-28 03:45:03,650 INFO L290 TraceCheckUtils]: 31: Hoare triple {17105#false} assume !false; {17105#false} is VALID [2022-04-28 03:45:03,650 INFO L134 CoverageAnalysis]: Checked inductivity of 155 backedges. 0 proven. 153 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-04-28 03:45:03,650 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 03:45:03,650 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [937399383] [2022-04-28 03:45:03,650 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [937399383] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 03:45:03,650 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1271822379] [2022-04-28 03:45:03,651 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:45:03,651 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 03:45:03,651 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 03:45:03,652 INFO L229 MonitoredProcess]: Starting monitored process 23 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 03:45:03,652 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (23)] Waiting until timeout for monitored process [2022-04-28 03:45:03,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:45:03,691 INFO L263 TraceCheckSpWp]: Trace formula consists of 144 conjuncts, 21 conjunts are in the unsatisfiable core [2022-04-28 03:45:03,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:45:03,706 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 03:45:04,532 INFO L272 TraceCheckUtils]: 0: Hoare triple {17104#true} call ULTIMATE.init(); {17104#true} is VALID [2022-04-28 03:45:04,532 INFO L290 TraceCheckUtils]: 1: Hoare triple {17104#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(17, 2);call #Ultimate.allocInit(12, 3); {17104#true} is VALID [2022-04-28 03:45:04,532 INFO L290 TraceCheckUtils]: 2: Hoare triple {17104#true} assume true; {17104#true} is VALID [2022-04-28 03:45:04,532 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {17104#true} {17104#true} #52#return; {17104#true} is VALID [2022-04-28 03:45:04,532 INFO L272 TraceCheckUtils]: 4: Hoare triple {17104#true} call #t~ret9 := main(); {17104#true} is VALID [2022-04-28 03:45:04,533 INFO L290 TraceCheckUtils]: 5: Hoare triple {17104#true} ~x~0 := 0;~y~0 := 50000;~z~0 := 0;~x~0 := 0; {17146#(and (<= main_~z~0 0) (<= 50000 main_~y~0))} is VALID [2022-04-28 03:45:04,533 INFO L290 TraceCheckUtils]: 6: Hoare triple {17146#(and (<= main_~z~0 0) (<= 50000 main_~y~0))} [144] L11-2-->L18-1_primed: Formula: (let ((.cse0 (= v_main_~x~0_846 v_main_~x~0_845)) (.cse1 (= |v_main_#t~post4_137| |v_main_#t~post4_136|))) (or (and .cse0 .cse1) (and (< v_main_~x~0_845 50001) (< v_main_~x~0_846 v_main_~x~0_845)) (and .cse0 .cse1 (<= 50000 v_main_~x~0_846)))) InVars {main_~x~0=v_main_~x~0_846, main_#t~post4=|v_main_#t~post4_137|} OutVars{main_~x~0=v_main_~x~0_845, main_#t~post4=|v_main_#t~post4_136|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {17146#(and (<= main_~z~0 0) (<= 50000 main_~y~0))} is VALID [2022-04-28 03:45:04,534 INFO L290 TraceCheckUtils]: 7: Hoare triple {17146#(and (<= main_~z~0 0) (<= 50000 main_~y~0))} [145] L18-1_primed-->L11-2: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {17146#(and (<= main_~z~0 0) (<= 50000 main_~y~0))} is VALID [2022-04-28 03:45:04,535 INFO L290 TraceCheckUtils]: 8: Hoare triple {17146#(and (<= main_~z~0 0) (<= 50000 main_~y~0))} [146] L11-2-->L18-1_primed: Formula: (let ((.cse1 (<= 50000 v_main_~x~0_848)) (.cse2 (= v_main_~x~0_848 v_main_~x~0_847)) (.cse3 (= v_main_~y~0_819 v_main_~y~0_818)) (.cse4 (= |v_main_#t~post6_151| |v_main_#t~post6_150|)) (.cse5 (= |v_main_#t~post5_151| |v_main_#t~post5_150|))) (or (let ((.cse0 (+ v_main_~x~0_848 v_main_~y~0_818))) (and (< v_main_~y~0_819 v_main_~y~0_818) (< .cse0 (+ v_main_~y~0_819 1000001)) (= (+ v_main_~x~0_847 v_main_~y~0_819) .cse0) .cse1)) (and .cse2 .cse3 .cse4 (or (not (< v_main_~x~0_848 1000000)) (not .cse1)) .cse5) (and .cse2 .cse3 .cse4 .cse5))) InVars {main_~y~0=v_main_~y~0_819, main_#t~post5=|v_main_#t~post5_151|, main_~x~0=v_main_~x~0_848, main_#t~post6=|v_main_#t~post6_151|} OutVars{main_~y~0=v_main_~y~0_818, main_#t~post5=|v_main_#t~post5_150|, main_~x~0=v_main_~x~0_847, main_#t~post6=|v_main_#t~post6_150|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {17146#(and (<= main_~z~0 0) (<= 50000 main_~y~0))} is VALID [2022-04-28 03:45:04,535 INFO L290 TraceCheckUtils]: 9: Hoare triple {17146#(and (<= main_~z~0 0) (<= 50000 main_~y~0))} [143] L18-1_primed-->L18-1: Formula: (not (< v_main_~x~0_11 1000000)) InVars {main_~x~0=v_main_~x~0_11} OutVars{main_~x~0=v_main_~x~0_11} AuxVars[] AssignedVars[] {17146#(and (<= main_~z~0 0) (<= 50000 main_~y~0))} is VALID [2022-04-28 03:45:04,536 INFO L290 TraceCheckUtils]: 10: Hoare triple {17146#(and (<= main_~z~0 0) (<= 50000 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {17162#(and (<= main_~z~0 0) (<= 49999 main_~y~0))} is VALID [2022-04-28 03:45:04,537 INFO L290 TraceCheckUtils]: 11: Hoare triple {17162#(and (<= main_~z~0 0) (<= 49999 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {17166#(and (<= main_~z~0 0) (<= 49998 main_~y~0))} is VALID [2022-04-28 03:45:04,537 INFO L290 TraceCheckUtils]: 12: Hoare triple {17166#(and (<= main_~z~0 0) (<= 49998 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {17170#(and (<= main_~z~0 0) (<= 49997 main_~y~0))} is VALID [2022-04-28 03:45:04,538 INFO L290 TraceCheckUtils]: 13: Hoare triple {17170#(and (<= main_~z~0 0) (<= 49997 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {17174#(and (<= main_~z~0 0) (<= 49996 main_~y~0))} is VALID [2022-04-28 03:45:04,538 INFO L290 TraceCheckUtils]: 14: Hoare triple {17174#(and (<= main_~z~0 0) (<= 49996 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {17178#(and (<= main_~z~0 0) (<= 49995 main_~y~0))} is VALID [2022-04-28 03:45:04,539 INFO L290 TraceCheckUtils]: 15: Hoare triple {17178#(and (<= main_~z~0 0) (<= 49995 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {17182#(and (<= main_~z~0 0) (<= 49994 main_~y~0))} is VALID [2022-04-28 03:45:04,540 INFO L290 TraceCheckUtils]: 16: Hoare triple {17182#(and (<= main_~z~0 0) (<= 49994 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {17186#(and (<= main_~z~0 0) (<= 49993 main_~y~0))} is VALID [2022-04-28 03:45:04,540 INFO L290 TraceCheckUtils]: 17: Hoare triple {17186#(and (<= main_~z~0 0) (<= 49993 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {17190#(and (<= main_~z~0 0) (<= 49992 main_~y~0))} is VALID [2022-04-28 03:45:04,541 INFO L290 TraceCheckUtils]: 18: Hoare triple {17190#(and (<= main_~z~0 0) (<= 49992 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {17194#(and (<= main_~z~0 0) (<= 49991 main_~y~0))} is VALID [2022-04-28 03:45:04,542 INFO L290 TraceCheckUtils]: 19: Hoare triple {17194#(and (<= main_~z~0 0) (<= 49991 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {17198#(and (<= main_~z~0 0) (<= 49990 main_~y~0))} is VALID [2022-04-28 03:45:04,542 INFO L290 TraceCheckUtils]: 20: Hoare triple {17198#(and (<= main_~z~0 0) (<= 49990 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {17202#(and (<= main_~z~0 0) (<= 49989 main_~y~0))} is VALID [2022-04-28 03:45:04,543 INFO L290 TraceCheckUtils]: 21: Hoare triple {17202#(and (<= main_~z~0 0) (<= 49989 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {17206#(and (<= main_~z~0 0) (<= 49988 main_~y~0))} is VALID [2022-04-28 03:45:04,543 INFO L290 TraceCheckUtils]: 22: Hoare triple {17206#(and (<= main_~z~0 0) (<= 49988 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {17210#(and (<= main_~z~0 0) (<= 49987 main_~y~0))} is VALID [2022-04-28 03:45:04,544 INFO L290 TraceCheckUtils]: 23: Hoare triple {17210#(and (<= main_~z~0 0) (<= 49987 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {17214#(and (<= main_~z~0 0) (<= 49986 main_~y~0))} is VALID [2022-04-28 03:45:04,545 INFO L290 TraceCheckUtils]: 24: Hoare triple {17214#(and (<= main_~z~0 0) (<= 49986 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {17218#(and (<= main_~z~0 0) (<= 49985 main_~y~0))} is VALID [2022-04-28 03:45:04,545 INFO L290 TraceCheckUtils]: 25: Hoare triple {17218#(and (<= main_~z~0 0) (<= 49985 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {17222#(and (<= main_~z~0 0) (<= 49984 main_~y~0))} is VALID [2022-04-28 03:45:04,546 INFO L290 TraceCheckUtils]: 26: Hoare triple {17222#(and (<= main_~z~0 0) (<= 49984 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {17226#(and (<= main_~z~0 0) (<= 49983 main_~y~0))} is VALID [2022-04-28 03:45:04,546 INFO L290 TraceCheckUtils]: 27: Hoare triple {17226#(and (<= main_~z~0 0) (<= 49983 main_~y~0))} assume !(~y~0 > ~z~0); {17105#false} is VALID [2022-04-28 03:45:04,546 INFO L272 TraceCheckUtils]: 28: Hoare triple {17105#false} call __VERIFIER_assert((if ~x~0 == ~z~0 then 1 else 0)); {17105#false} is VALID [2022-04-28 03:45:04,547 INFO L290 TraceCheckUtils]: 29: Hoare triple {17105#false} ~cond := #in~cond; {17105#false} is VALID [2022-04-28 03:45:04,547 INFO L290 TraceCheckUtils]: 30: Hoare triple {17105#false} assume 0 == ~cond; {17105#false} is VALID [2022-04-28 03:45:04,547 INFO L290 TraceCheckUtils]: 31: Hoare triple {17105#false} assume !false; {17105#false} is VALID [2022-04-28 03:45:04,547 INFO L134 CoverageAnalysis]: Checked inductivity of 155 backedges. 0 proven. 153 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-04-28 03:45:04,547 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 03:45:05,607 INFO L290 TraceCheckUtils]: 31: Hoare triple {17105#false} assume !false; {17105#false} is VALID [2022-04-28 03:45:05,607 INFO L290 TraceCheckUtils]: 30: Hoare triple {17105#false} assume 0 == ~cond; {17105#false} is VALID [2022-04-28 03:45:05,608 INFO L290 TraceCheckUtils]: 29: Hoare triple {17105#false} ~cond := #in~cond; {17105#false} is VALID [2022-04-28 03:45:05,608 INFO L272 TraceCheckUtils]: 28: Hoare triple {17105#false} call __VERIFIER_assert((if ~x~0 == ~z~0 then 1 else 0)); {17105#false} is VALID [2022-04-28 03:45:05,608 INFO L290 TraceCheckUtils]: 27: Hoare triple {17254#(< main_~z~0 main_~y~0)} assume !(~y~0 > ~z~0); {17105#false} is VALID [2022-04-28 03:45:05,608 INFO L290 TraceCheckUtils]: 26: Hoare triple {17258#(< (+ main_~z~0 1) main_~y~0)} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {17254#(< main_~z~0 main_~y~0)} is VALID [2022-04-28 03:45:05,609 INFO L290 TraceCheckUtils]: 25: Hoare triple {17262#(< (+ main_~z~0 2) main_~y~0)} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {17258#(< (+ main_~z~0 1) main_~y~0)} is VALID [2022-04-28 03:45:05,609 INFO L290 TraceCheckUtils]: 24: Hoare triple {17266#(< (+ main_~z~0 3) main_~y~0)} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {17262#(< (+ main_~z~0 2) main_~y~0)} is VALID [2022-04-28 03:45:05,610 INFO L290 TraceCheckUtils]: 23: Hoare triple {17270#(< (+ main_~z~0 4) main_~y~0)} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {17266#(< (+ main_~z~0 3) main_~y~0)} is VALID [2022-04-28 03:45:05,610 INFO L290 TraceCheckUtils]: 22: Hoare triple {17274#(< (+ 5 main_~z~0) main_~y~0)} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {17270#(< (+ main_~z~0 4) main_~y~0)} is VALID [2022-04-28 03:45:05,611 INFO L290 TraceCheckUtils]: 21: Hoare triple {17278#(< (+ main_~z~0 6) main_~y~0)} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {17274#(< (+ 5 main_~z~0) main_~y~0)} is VALID [2022-04-28 03:45:05,611 INFO L290 TraceCheckUtils]: 20: Hoare triple {17282#(< (+ 7 main_~z~0) main_~y~0)} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {17278#(< (+ main_~z~0 6) main_~y~0)} is VALID [2022-04-28 03:45:05,612 INFO L290 TraceCheckUtils]: 19: Hoare triple {17286#(< (+ main_~z~0 8) main_~y~0)} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {17282#(< (+ 7 main_~z~0) main_~y~0)} is VALID [2022-04-28 03:45:05,612 INFO L290 TraceCheckUtils]: 18: Hoare triple {17290#(< (+ main_~z~0 9) main_~y~0)} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {17286#(< (+ main_~z~0 8) main_~y~0)} is VALID [2022-04-28 03:45:05,613 INFO L290 TraceCheckUtils]: 17: Hoare triple {17294#(< (+ main_~z~0 10) main_~y~0)} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {17290#(< (+ main_~z~0 9) main_~y~0)} is VALID [2022-04-28 03:45:05,613 INFO L290 TraceCheckUtils]: 16: Hoare triple {17298#(< (+ main_~z~0 11) main_~y~0)} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {17294#(< (+ main_~z~0 10) main_~y~0)} is VALID [2022-04-28 03:45:05,613 INFO L290 TraceCheckUtils]: 15: Hoare triple {17302#(< (+ main_~z~0 12) main_~y~0)} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {17298#(< (+ main_~z~0 11) main_~y~0)} is VALID [2022-04-28 03:45:05,614 INFO L290 TraceCheckUtils]: 14: Hoare triple {17306#(< (+ main_~z~0 13) main_~y~0)} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {17302#(< (+ main_~z~0 12) main_~y~0)} is VALID [2022-04-28 03:45:05,614 INFO L290 TraceCheckUtils]: 13: Hoare triple {17310#(< (+ main_~z~0 14) main_~y~0)} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {17306#(< (+ main_~z~0 13) main_~y~0)} is VALID [2022-04-28 03:45:05,615 INFO L290 TraceCheckUtils]: 12: Hoare triple {17314#(< (+ main_~z~0 15) main_~y~0)} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {17310#(< (+ main_~z~0 14) main_~y~0)} is VALID [2022-04-28 03:45:05,615 INFO L290 TraceCheckUtils]: 11: Hoare triple {17318#(< (+ main_~z~0 16) main_~y~0)} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {17314#(< (+ main_~z~0 15) main_~y~0)} is VALID [2022-04-28 03:45:05,616 INFO L290 TraceCheckUtils]: 10: Hoare triple {17322#(< (+ main_~z~0 17) main_~y~0)} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {17318#(< (+ main_~z~0 16) main_~y~0)} is VALID [2022-04-28 03:45:05,616 INFO L290 TraceCheckUtils]: 9: Hoare triple {17322#(< (+ main_~z~0 17) main_~y~0)} [143] L18-1_primed-->L18-1: Formula: (not (< v_main_~x~0_11 1000000)) InVars {main_~x~0=v_main_~x~0_11} OutVars{main_~x~0=v_main_~x~0_11} AuxVars[] AssignedVars[] {17322#(< (+ main_~z~0 17) main_~y~0)} is VALID [2022-04-28 03:45:05,617 INFO L290 TraceCheckUtils]: 8: Hoare triple {17322#(< (+ main_~z~0 17) main_~y~0)} [146] L11-2-->L18-1_primed: Formula: (let ((.cse1 (<= 50000 v_main_~x~0_848)) (.cse2 (= v_main_~x~0_848 v_main_~x~0_847)) (.cse3 (= v_main_~y~0_819 v_main_~y~0_818)) (.cse4 (= |v_main_#t~post6_151| |v_main_#t~post6_150|)) (.cse5 (= |v_main_#t~post5_151| |v_main_#t~post5_150|))) (or (let ((.cse0 (+ v_main_~x~0_848 v_main_~y~0_818))) (and (< v_main_~y~0_819 v_main_~y~0_818) (< .cse0 (+ v_main_~y~0_819 1000001)) (= (+ v_main_~x~0_847 v_main_~y~0_819) .cse0) .cse1)) (and .cse2 .cse3 .cse4 (or (not (< v_main_~x~0_848 1000000)) (not .cse1)) .cse5) (and .cse2 .cse3 .cse4 .cse5))) InVars {main_~y~0=v_main_~y~0_819, main_#t~post5=|v_main_#t~post5_151|, main_~x~0=v_main_~x~0_848, main_#t~post6=|v_main_#t~post6_151|} OutVars{main_~y~0=v_main_~y~0_818, main_#t~post5=|v_main_#t~post5_150|, main_~x~0=v_main_~x~0_847, main_#t~post6=|v_main_#t~post6_150|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {17322#(< (+ main_~z~0 17) main_~y~0)} is VALID [2022-04-28 03:45:05,617 INFO L290 TraceCheckUtils]: 7: Hoare triple {17322#(< (+ main_~z~0 17) main_~y~0)} [145] L18-1_primed-->L11-2: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {17322#(< (+ main_~z~0 17) main_~y~0)} is VALID [2022-04-28 03:45:05,618 INFO L290 TraceCheckUtils]: 6: Hoare triple {17322#(< (+ main_~z~0 17) main_~y~0)} [144] L11-2-->L18-1_primed: Formula: (let ((.cse0 (= v_main_~x~0_846 v_main_~x~0_845)) (.cse1 (= |v_main_#t~post4_137| |v_main_#t~post4_136|))) (or (and .cse0 .cse1) (and (< v_main_~x~0_845 50001) (< v_main_~x~0_846 v_main_~x~0_845)) (and .cse0 .cse1 (<= 50000 v_main_~x~0_846)))) InVars {main_~x~0=v_main_~x~0_846, main_#t~post4=|v_main_#t~post4_137|} OutVars{main_~x~0=v_main_~x~0_845, main_#t~post4=|v_main_#t~post4_136|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {17322#(< (+ main_~z~0 17) main_~y~0)} is VALID [2022-04-28 03:45:05,618 INFO L290 TraceCheckUtils]: 5: Hoare triple {17104#true} ~x~0 := 0;~y~0 := 50000;~z~0 := 0;~x~0 := 0; {17322#(< (+ main_~z~0 17) main_~y~0)} is VALID [2022-04-28 03:45:05,618 INFO L272 TraceCheckUtils]: 4: Hoare triple {17104#true} call #t~ret9 := main(); {17104#true} is VALID [2022-04-28 03:45:05,618 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {17104#true} {17104#true} #52#return; {17104#true} is VALID [2022-04-28 03:45:05,618 INFO L290 TraceCheckUtils]: 2: Hoare triple {17104#true} assume true; {17104#true} is VALID [2022-04-28 03:45:05,618 INFO L290 TraceCheckUtils]: 1: Hoare triple {17104#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(17, 2);call #Ultimate.allocInit(12, 3); {17104#true} is VALID [2022-04-28 03:45:05,618 INFO L272 TraceCheckUtils]: 0: Hoare triple {17104#true} call ULTIMATE.init(); {17104#true} is VALID [2022-04-28 03:45:05,618 INFO L134 CoverageAnalysis]: Checked inductivity of 155 backedges. 0 proven. 153 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-04-28 03:45:05,619 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1271822379] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 03:45:05,619 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 03:45:05,619 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 20, 20] total 57 [2022-04-28 03:45:06,726 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 03:45:06,726 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [799816237] [2022-04-28 03:45:06,726 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [799816237] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 03:45:06,726 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 03:45:06,726 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [52] imperfect sequences [] total 52 [2022-04-28 03:45:06,727 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [88342468] [2022-04-28 03:45:06,727 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 03:45:06,727 INFO L78 Accepts]: Start accepts. Automaton has has 52 states, 52 states have (on average 1.6346153846153846) internal successors, (85), 51 states have internal predecessors, (85), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 89 [2022-04-28 03:45:06,727 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 03:45:06,727 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 52 states, 52 states have (on average 1.6346153846153846) internal successors, (85), 51 states have internal predecessors, (85), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:45:06,798 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 89 edges. 89 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 03:45:06,799 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 52 states [2022-04-28 03:45:06,799 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 03:45:06,799 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 52 interpolants. [2022-04-28 03:45:06,799 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3155, Invalid=4501, Unknown=0, NotChecked=0, Total=7656 [2022-04-28 03:45:06,800 INFO L87 Difference]: Start difference. First operand 90 states and 93 transitions. Second operand has 52 states, 52 states have (on average 1.6346153846153846) internal successors, (85), 51 states have internal predecessors, (85), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:45:11,306 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:45:11,306 INFO L93 Difference]: Finished difference Result 177 states and 188 transitions. [2022-04-28 03:45:11,306 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 52 states. [2022-04-28 03:45:11,307 INFO L78 Accepts]: Start accepts. Automaton has has 52 states, 52 states have (on average 1.6346153846153846) internal successors, (85), 51 states have internal predecessors, (85), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 89 [2022-04-28 03:45:11,307 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 03:45:11,307 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 52 states, 52 states have (on average 1.6346153846153846) internal successors, (85), 51 states have internal predecessors, (85), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:45:11,309 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 111 transitions. [2022-04-28 03:45:11,309 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 52 states, 52 states have (on average 1.6346153846153846) internal successors, (85), 51 states have internal predecessors, (85), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:45:11,310 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 111 transitions. [2022-04-28 03:45:11,311 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 52 states and 111 transitions. [2022-04-28 03:45:11,423 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 111 edges. 111 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 03:45:11,424 INFO L225 Difference]: With dead ends: 177 [2022-04-28 03:45:11,424 INFO L226 Difference]: Without dead ends: 95 [2022-04-28 03:45:11,425 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 201 GetRequests, 64 SyntacticMatches, 2 SemanticMatches, 135 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5278 ImplicationChecksByTransitivity, 3.1s TimeCoverageRelationStatistics Valid=6444, Invalid=12188, Unknown=0, NotChecked=0, Total=18632 [2022-04-28 03:45:11,426 INFO L413 NwaCegarLoop]: 12 mSDtfsCounter, 168 mSDsluCounter, 42 mSDsCounter, 0 mSdLazyCounter, 1967 mSolverCounterSat, 194 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 168 SdHoareTripleChecker+Valid, 54 SdHoareTripleChecker+Invalid, 2161 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 194 IncrementalHoareTripleChecker+Valid, 1967 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2022-04-28 03:45:11,426 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [168 Valid, 54 Invalid, 2161 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [194 Valid, 1967 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2022-04-28 03:45:11,426 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2022-04-28 03:45:11,634 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 95. [2022-04-28 03:45:11,635 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 03:45:11,635 INFO L82 GeneralOperation]: Start isEquivalent. First operand 95 states. Second operand has 95 states, 90 states have (on average 1.0444444444444445) internal successors, (94), 90 states have internal predecessors, (94), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:45:11,635 INFO L74 IsIncluded]: Start isIncluded. First operand 95 states. Second operand has 95 states, 90 states have (on average 1.0444444444444445) internal successors, (94), 90 states have internal predecessors, (94), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:45:11,635 INFO L87 Difference]: Start difference. First operand 95 states. Second operand has 95 states, 90 states have (on average 1.0444444444444445) internal successors, (94), 90 states have internal predecessors, (94), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:45:11,637 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:45:11,637 INFO L93 Difference]: Finished difference Result 95 states and 98 transitions. [2022-04-28 03:45:11,637 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 98 transitions. [2022-04-28 03:45:11,637 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:45:11,637 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:45:11,637 INFO L74 IsIncluded]: Start isIncluded. First operand has 95 states, 90 states have (on average 1.0444444444444445) internal successors, (94), 90 states have internal predecessors, (94), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 95 states. [2022-04-28 03:45:11,638 INFO L87 Difference]: Start difference. First operand has 95 states, 90 states have (on average 1.0444444444444445) internal successors, (94), 90 states have internal predecessors, (94), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 95 states. [2022-04-28 03:45:11,639 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:45:11,639 INFO L93 Difference]: Finished difference Result 95 states and 98 transitions. [2022-04-28 03:45:11,639 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 98 transitions. [2022-04-28 03:45:11,639 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:45:11,640 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:45:11,640 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 03:45:11,640 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 03:45:11,640 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 95 states, 90 states have (on average 1.0444444444444445) internal successors, (94), 90 states have internal predecessors, (94), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:45:11,641 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 98 transitions. [2022-04-28 03:45:11,641 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 98 transitions. Word has length 89 [2022-04-28 03:45:11,641 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 03:45:11,641 INFO L495 AbstractCegarLoop]: Abstraction has 95 states and 98 transitions. [2022-04-28 03:45:11,642 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 52 states, 52 states have (on average 1.6346153846153846) internal successors, (85), 51 states have internal predecessors, (85), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:45:11,642 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 95 states and 98 transitions. [2022-04-28 03:45:11,754 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 98 edges. 98 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 03:45:11,754 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 98 transitions. [2022-04-28 03:45:11,755 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2022-04-28 03:45:11,755 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 03:45:11,755 INFO L195 NwaCegarLoop]: trace histogram [32, 31, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 03:45:11,776 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (23)] Ended with exit code 0 [2022-04-28 03:45:11,955 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24,23 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 03:45:11,955 INFO L420 AbstractCegarLoop]: === Iteration 26 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 03:45:11,956 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 03:45:11,956 INFO L85 PathProgramCache]: Analyzing trace with hash 140017013, now seen corresponding path program 23 times [2022-04-28 03:45:11,956 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 03:45:11,956 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [2053162241] [2022-04-28 03:45:12,046 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 1 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 03:45:16,179 WARN L977 rdanLoopAcceleration]: Unable to prove correctness of quantifier elimination. [2022-04-28 03:45:16,277 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={1=1, 2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 03:45:16,278 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-28 03:45:16,280 INFO L85 PathProgramCache]: Analyzing trace with hash -1509536735, now seen corresponding path program 1 times [2022-04-28 03:45:16,280 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 03:45:16,280 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1535820427] [2022-04-28 03:45:16,280 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:45:16,280 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 03:45:16,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:45:16,656 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 03:45:16,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:45:16,659 INFO L290 TraceCheckUtils]: 0: Hoare triple {18245#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(17, 2);call #Ultimate.allocInit(12, 3); {18218#true} is VALID [2022-04-28 03:45:16,659 INFO L290 TraceCheckUtils]: 1: Hoare triple {18218#true} assume true; {18218#true} is VALID [2022-04-28 03:45:16,659 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {18218#true} {18218#true} #52#return; {18218#true} is VALID [2022-04-28 03:45:16,660 INFO L272 TraceCheckUtils]: 0: Hoare triple {18218#true} call ULTIMATE.init(); {18245#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 03:45:16,660 INFO L290 TraceCheckUtils]: 1: Hoare triple {18245#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(17, 2);call #Ultimate.allocInit(12, 3); {18218#true} is VALID [2022-04-28 03:45:16,660 INFO L290 TraceCheckUtils]: 2: Hoare triple {18218#true} assume true; {18218#true} is VALID [2022-04-28 03:45:16,660 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {18218#true} {18218#true} #52#return; {18218#true} is VALID [2022-04-28 03:45:16,660 INFO L272 TraceCheckUtils]: 4: Hoare triple {18218#true} call #t~ret9 := main(); {18218#true} is VALID [2022-04-28 03:45:16,660 INFO L290 TraceCheckUtils]: 5: Hoare triple {18218#true} ~x~0 := 0;~y~0 := 50000;~z~0 := 0;~x~0 := 0; {18223#(and (= main_~z~0 0) (= main_~x~0 0) (<= 50000 main_~y~0))} is VALID [2022-04-28 03:45:16,661 INFO L290 TraceCheckUtils]: 6: Hoare triple {18223#(and (= main_~z~0 0) (= main_~x~0 0) (<= 50000 main_~y~0))} [148] L11-2-->L18-1_primed: Formula: (let ((.cse0 (= v_main_~x~0_909 v_main_~x~0_908)) (.cse1 (= |v_main_#t~post4_143| |v_main_#t~post4_142|))) (or (and (< v_main_~x~0_908 50001) (< v_main_~x~0_909 v_main_~x~0_908)) (and .cse0 .cse1) (and .cse0 .cse1 (not (< v_main_~x~0_909 50000))))) InVars {main_~x~0=v_main_~x~0_909, main_#t~post4=|v_main_#t~post4_143|} OutVars{main_~x~0=v_main_~x~0_908, main_#t~post4=|v_main_#t~post4_142|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {18224#(or (<= main_~x~0 0) (and (= main_~z~0 0) (<= main_~x~0 main_~y~0) (<= main_~x~0 50000)))} is VALID [2022-04-28 03:45:16,661 INFO L290 TraceCheckUtils]: 7: Hoare triple {18224#(or (<= main_~x~0 0) (and (= main_~z~0 0) (<= main_~x~0 main_~y~0) (<= main_~x~0 50000)))} [149] L18-1_primed-->L11-2: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {18224#(or (<= main_~x~0 0) (and (= main_~z~0 0) (<= main_~x~0 main_~y~0) (<= main_~x~0 50000)))} is VALID [2022-04-28 03:45:16,662 INFO L290 TraceCheckUtils]: 8: Hoare triple {18224#(or (<= main_~x~0 0) (and (= main_~z~0 0) (<= main_~x~0 main_~y~0) (<= main_~x~0 50000)))} [150] L11-2-->L18-1_primed: Formula: (let ((.cse1 (= |v_main_#t~post6_158| |v_main_#t~post6_157|)) (.cse2 (= v_main_~y~0_891 v_main_~y~0_890)) (.cse3 (= v_main_~x~0_911 v_main_~x~0_910)) (.cse4 (= |v_main_#t~post5_158| |v_main_#t~post5_157|)) (.cse0 (<= 50000 v_main_~x~0_911))) (or (and .cse0 (< v_main_~x~0_910 1000001) (= (+ v_main_~x~0_910 v_main_~y~0_891) (+ v_main_~x~0_911 v_main_~y~0_890)) (< v_main_~x~0_911 v_main_~x~0_910)) (and .cse1 .cse2 .cse3 .cse4) (and .cse1 .cse2 .cse3 .cse4 (or (not .cse0) (not (< v_main_~x~0_911 1000000)))))) InVars {main_~y~0=v_main_~y~0_891, main_#t~post5=|v_main_#t~post5_158|, main_~x~0=v_main_~x~0_911, main_#t~post6=|v_main_#t~post6_158|} OutVars{main_~y~0=v_main_~y~0_890, main_#t~post5=|v_main_#t~post5_157|, main_~x~0=v_main_~x~0_910, main_#t~post6=|v_main_#t~post6_157|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {18225#(or (and (= main_~z~0 0) (<= main_~x~0 main_~y~0)) (<= main_~x~0 50000))} is VALID [2022-04-28 03:45:16,662 INFO L290 TraceCheckUtils]: 9: Hoare triple {18225#(or (and (= main_~z~0 0) (<= main_~x~0 main_~y~0)) (<= main_~x~0 50000))} [147] L18-1_primed-->L18-1: Formula: (not (< v_main_~x~0_11 1000000)) InVars {main_~x~0=v_main_~x~0_11} OutVars{main_~x~0=v_main_~x~0_11} AuxVars[] AssignedVars[] {18226#(and (= main_~z~0 0) (<= 1000000 main_~y~0))} is VALID [2022-04-28 03:45:16,663 INFO L290 TraceCheckUtils]: 10: Hoare triple {18226#(and (= main_~z~0 0) (<= 1000000 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {18227#(and (= main_~z~0 0) (<= 999999 main_~y~0))} is VALID [2022-04-28 03:45:16,663 INFO L290 TraceCheckUtils]: 11: Hoare triple {18227#(and (= main_~z~0 0) (<= 999999 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {18228#(and (= main_~z~0 0) (<= 999998 main_~y~0))} is VALID [2022-04-28 03:45:16,664 INFO L290 TraceCheckUtils]: 12: Hoare triple {18228#(and (= main_~z~0 0) (<= 999998 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {18229#(and (= main_~z~0 0) (<= 999997 main_~y~0))} is VALID [2022-04-28 03:45:16,664 INFO L290 TraceCheckUtils]: 13: Hoare triple {18229#(and (= main_~z~0 0) (<= 999997 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {18230#(and (<= 999996 main_~y~0) (= main_~z~0 0))} is VALID [2022-04-28 03:45:16,665 INFO L290 TraceCheckUtils]: 14: Hoare triple {18230#(and (<= 999996 main_~y~0) (= main_~z~0 0))} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {18231#(and (= main_~z~0 0) (<= 999995 main_~y~0))} is VALID [2022-04-28 03:45:16,665 INFO L290 TraceCheckUtils]: 15: Hoare triple {18231#(and (= main_~z~0 0) (<= 999995 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {18232#(and (= main_~z~0 0) (<= 999994 main_~y~0))} is VALID [2022-04-28 03:45:16,666 INFO L290 TraceCheckUtils]: 16: Hoare triple {18232#(and (= main_~z~0 0) (<= 999994 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {18233#(and (= main_~z~0 0) (<= 999993 main_~y~0))} is VALID [2022-04-28 03:45:16,666 INFO L290 TraceCheckUtils]: 17: Hoare triple {18233#(and (= main_~z~0 0) (<= 999993 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {18234#(and (= main_~z~0 0) (<= 999992 main_~y~0))} is VALID [2022-04-28 03:45:16,667 INFO L290 TraceCheckUtils]: 18: Hoare triple {18234#(and (= main_~z~0 0) (<= 999992 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {18235#(and (= main_~z~0 0) (<= 999991 main_~y~0))} is VALID [2022-04-28 03:45:16,667 INFO L290 TraceCheckUtils]: 19: Hoare triple {18235#(and (= main_~z~0 0) (<= 999991 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {18236#(and (= main_~z~0 0) (<= 999990 main_~y~0))} is VALID [2022-04-28 03:45:16,668 INFO L290 TraceCheckUtils]: 20: Hoare triple {18236#(and (= main_~z~0 0) (<= 999990 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {18237#(and (= main_~z~0 0) (<= 999989 main_~y~0))} is VALID [2022-04-28 03:45:16,668 INFO L290 TraceCheckUtils]: 21: Hoare triple {18237#(and (= main_~z~0 0) (<= 999989 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {18238#(and (= main_~z~0 0) (<= 999988 main_~y~0))} is VALID [2022-04-28 03:45:16,669 INFO L290 TraceCheckUtils]: 22: Hoare triple {18238#(and (= main_~z~0 0) (<= 999988 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {18239#(and (= main_~z~0 0) (<= 999987 main_~y~0))} is VALID [2022-04-28 03:45:16,669 INFO L290 TraceCheckUtils]: 23: Hoare triple {18239#(and (= main_~z~0 0) (<= 999987 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {18240#(and (= main_~z~0 0) (<= 999986 main_~y~0))} is VALID [2022-04-28 03:45:16,669 INFO L290 TraceCheckUtils]: 24: Hoare triple {18240#(and (= main_~z~0 0) (<= 999986 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {18241#(and (= main_~z~0 0) (<= 999985 main_~y~0))} is VALID [2022-04-28 03:45:16,670 INFO L290 TraceCheckUtils]: 25: Hoare triple {18241#(and (= main_~z~0 0) (<= 999985 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {18242#(and (= main_~z~0 0) (<= 999984 main_~y~0))} is VALID [2022-04-28 03:45:16,670 INFO L290 TraceCheckUtils]: 26: Hoare triple {18242#(and (= main_~z~0 0) (<= 999984 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {18243#(and (<= 999983 main_~y~0) (= main_~z~0 0))} is VALID [2022-04-28 03:45:16,671 INFO L290 TraceCheckUtils]: 27: Hoare triple {18243#(and (<= 999983 main_~y~0) (= main_~z~0 0))} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {18244#(and (= main_~z~0 0) (<= 999982 main_~y~0))} is VALID [2022-04-28 03:45:16,671 INFO L290 TraceCheckUtils]: 28: Hoare triple {18244#(and (= main_~z~0 0) (<= 999982 main_~y~0))} assume !(~y~0 > ~z~0); {18219#false} is VALID [2022-04-28 03:45:16,671 INFO L272 TraceCheckUtils]: 29: Hoare triple {18219#false} call __VERIFIER_assert((if ~x~0 == ~z~0 then 1 else 0)); {18219#false} is VALID [2022-04-28 03:45:16,671 INFO L290 TraceCheckUtils]: 30: Hoare triple {18219#false} ~cond := #in~cond; {18219#false} is VALID [2022-04-28 03:45:16,671 INFO L290 TraceCheckUtils]: 31: Hoare triple {18219#false} assume 0 == ~cond; {18219#false} is VALID [2022-04-28 03:45:16,672 INFO L290 TraceCheckUtils]: 32: Hoare triple {18219#false} assume !false; {18219#false} is VALID [2022-04-28 03:45:16,672 INFO L134 CoverageAnalysis]: Checked inductivity of 173 backedges. 0 proven. 173 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 03:45:16,672 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 03:45:16,672 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1535820427] [2022-04-28 03:45:16,672 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1535820427] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 03:45:16,672 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1122896598] [2022-04-28 03:45:16,672 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:45:16,672 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 03:45:16,672 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 03:45:16,673 INFO L229 MonitoredProcess]: Starting monitored process 24 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 03:45:16,674 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (24)] Waiting until timeout for monitored process [2022-04-28 03:45:16,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:45:16,713 INFO L263 TraceCheckSpWp]: Trace formula consists of 149 conjuncts, 22 conjunts are in the unsatisfiable core [2022-04-28 03:45:16,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:45:16,728 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 03:45:17,667 INFO L272 TraceCheckUtils]: 0: Hoare triple {18218#true} call ULTIMATE.init(); {18218#true} is VALID [2022-04-28 03:45:17,667 INFO L290 TraceCheckUtils]: 1: Hoare triple {18218#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(17, 2);call #Ultimate.allocInit(12, 3); {18218#true} is VALID [2022-04-28 03:45:17,667 INFO L290 TraceCheckUtils]: 2: Hoare triple {18218#true} assume true; {18218#true} is VALID [2022-04-28 03:45:17,667 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {18218#true} {18218#true} #52#return; {18218#true} is VALID [2022-04-28 03:45:17,667 INFO L272 TraceCheckUtils]: 4: Hoare triple {18218#true} call #t~ret9 := main(); {18218#true} is VALID [2022-04-28 03:45:17,668 INFO L290 TraceCheckUtils]: 5: Hoare triple {18218#true} ~x~0 := 0;~y~0 := 50000;~z~0 := 0;~x~0 := 0; {18264#(and (<= main_~z~0 0) (<= 50000 main_~y~0))} is VALID [2022-04-28 03:45:17,668 INFO L290 TraceCheckUtils]: 6: Hoare triple {18264#(and (<= main_~z~0 0) (<= 50000 main_~y~0))} [148] L11-2-->L18-1_primed: Formula: (let ((.cse0 (= v_main_~x~0_909 v_main_~x~0_908)) (.cse1 (= |v_main_#t~post4_143| |v_main_#t~post4_142|))) (or (and (< v_main_~x~0_908 50001) (< v_main_~x~0_909 v_main_~x~0_908)) (and .cse0 .cse1) (and .cse0 .cse1 (not (< v_main_~x~0_909 50000))))) InVars {main_~x~0=v_main_~x~0_909, main_#t~post4=|v_main_#t~post4_143|} OutVars{main_~x~0=v_main_~x~0_908, main_#t~post4=|v_main_#t~post4_142|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {18264#(and (<= main_~z~0 0) (<= 50000 main_~y~0))} is VALID [2022-04-28 03:45:17,668 INFO L290 TraceCheckUtils]: 7: Hoare triple {18264#(and (<= main_~z~0 0) (<= 50000 main_~y~0))} [149] L18-1_primed-->L11-2: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {18264#(and (<= main_~z~0 0) (<= 50000 main_~y~0))} is VALID [2022-04-28 03:45:17,669 INFO L290 TraceCheckUtils]: 8: Hoare triple {18264#(and (<= main_~z~0 0) (<= 50000 main_~y~0))} [150] L11-2-->L18-1_primed: Formula: (let ((.cse1 (= |v_main_#t~post6_158| |v_main_#t~post6_157|)) (.cse2 (= v_main_~y~0_891 v_main_~y~0_890)) (.cse3 (= v_main_~x~0_911 v_main_~x~0_910)) (.cse4 (= |v_main_#t~post5_158| |v_main_#t~post5_157|)) (.cse0 (<= 50000 v_main_~x~0_911))) (or (and .cse0 (< v_main_~x~0_910 1000001) (= (+ v_main_~x~0_910 v_main_~y~0_891) (+ v_main_~x~0_911 v_main_~y~0_890)) (< v_main_~x~0_911 v_main_~x~0_910)) (and .cse1 .cse2 .cse3 .cse4) (and .cse1 .cse2 .cse3 .cse4 (or (not .cse0) (not (< v_main_~x~0_911 1000000)))))) InVars {main_~y~0=v_main_~y~0_891, main_#t~post5=|v_main_#t~post5_158|, main_~x~0=v_main_~x~0_911, main_#t~post6=|v_main_#t~post6_158|} OutVars{main_~y~0=v_main_~y~0_890, main_#t~post5=|v_main_#t~post5_157|, main_~x~0=v_main_~x~0_910, main_#t~post6=|v_main_#t~post6_157|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {18264#(and (<= main_~z~0 0) (<= 50000 main_~y~0))} is VALID [2022-04-28 03:45:17,670 INFO L290 TraceCheckUtils]: 9: Hoare triple {18264#(and (<= main_~z~0 0) (<= 50000 main_~y~0))} [147] L18-1_primed-->L18-1: Formula: (not (< v_main_~x~0_11 1000000)) InVars {main_~x~0=v_main_~x~0_11} OutVars{main_~x~0=v_main_~x~0_11} AuxVars[] AssignedVars[] {18264#(and (<= main_~z~0 0) (<= 50000 main_~y~0))} is VALID [2022-04-28 03:45:17,670 INFO L290 TraceCheckUtils]: 10: Hoare triple {18264#(and (<= main_~z~0 0) (<= 50000 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {18280#(and (<= main_~z~0 0) (<= 49999 main_~y~0))} is VALID [2022-04-28 03:45:17,671 INFO L290 TraceCheckUtils]: 11: Hoare triple {18280#(and (<= main_~z~0 0) (<= 49999 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {18284#(and (<= main_~z~0 0) (<= 49998 main_~y~0))} is VALID [2022-04-28 03:45:17,671 INFO L290 TraceCheckUtils]: 12: Hoare triple {18284#(and (<= main_~z~0 0) (<= 49998 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {18288#(and (<= main_~z~0 0) (<= 49997 main_~y~0))} is VALID [2022-04-28 03:45:17,671 INFO L290 TraceCheckUtils]: 13: Hoare triple {18288#(and (<= main_~z~0 0) (<= 49997 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {18292#(and (<= main_~z~0 0) (<= 49996 main_~y~0))} is VALID [2022-04-28 03:45:17,672 INFO L290 TraceCheckUtils]: 14: Hoare triple {18292#(and (<= main_~z~0 0) (<= 49996 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {18296#(and (<= main_~z~0 0) (<= 49995 main_~y~0))} is VALID [2022-04-28 03:45:17,672 INFO L290 TraceCheckUtils]: 15: Hoare triple {18296#(and (<= main_~z~0 0) (<= 49995 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {18300#(and (<= main_~z~0 0) (<= 49994 main_~y~0))} is VALID [2022-04-28 03:45:17,673 INFO L290 TraceCheckUtils]: 16: Hoare triple {18300#(and (<= main_~z~0 0) (<= 49994 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {18304#(and (<= main_~z~0 0) (<= 49993 main_~y~0))} is VALID [2022-04-28 03:45:17,673 INFO L290 TraceCheckUtils]: 17: Hoare triple {18304#(and (<= main_~z~0 0) (<= 49993 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {18308#(and (<= main_~z~0 0) (<= 49992 main_~y~0))} is VALID [2022-04-28 03:45:17,674 INFO L290 TraceCheckUtils]: 18: Hoare triple {18308#(and (<= main_~z~0 0) (<= 49992 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {18312#(and (<= main_~z~0 0) (<= 49991 main_~y~0))} is VALID [2022-04-28 03:45:17,674 INFO L290 TraceCheckUtils]: 19: Hoare triple {18312#(and (<= main_~z~0 0) (<= 49991 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {18316#(and (<= main_~z~0 0) (<= 49990 main_~y~0))} is VALID [2022-04-28 03:45:17,675 INFO L290 TraceCheckUtils]: 20: Hoare triple {18316#(and (<= main_~z~0 0) (<= 49990 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {18320#(and (<= main_~z~0 0) (<= 49989 main_~y~0))} is VALID [2022-04-28 03:45:17,675 INFO L290 TraceCheckUtils]: 21: Hoare triple {18320#(and (<= main_~z~0 0) (<= 49989 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {18324#(and (<= main_~z~0 0) (<= 49988 main_~y~0))} is VALID [2022-04-28 03:45:17,676 INFO L290 TraceCheckUtils]: 22: Hoare triple {18324#(and (<= main_~z~0 0) (<= 49988 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {18328#(and (<= main_~z~0 0) (<= 49987 main_~y~0))} is VALID [2022-04-28 03:45:17,676 INFO L290 TraceCheckUtils]: 23: Hoare triple {18328#(and (<= main_~z~0 0) (<= 49987 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {18332#(and (<= main_~z~0 0) (<= 49986 main_~y~0))} is VALID [2022-04-28 03:45:17,677 INFO L290 TraceCheckUtils]: 24: Hoare triple {18332#(and (<= main_~z~0 0) (<= 49986 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {18336#(and (<= main_~z~0 0) (<= 49985 main_~y~0))} is VALID [2022-04-28 03:45:17,677 INFO L290 TraceCheckUtils]: 25: Hoare triple {18336#(and (<= main_~z~0 0) (<= 49985 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {18340#(and (<= main_~z~0 0) (<= 49984 main_~y~0))} is VALID [2022-04-28 03:45:17,678 INFO L290 TraceCheckUtils]: 26: Hoare triple {18340#(and (<= main_~z~0 0) (<= 49984 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {18344#(and (<= main_~z~0 0) (<= 49983 main_~y~0))} is VALID [2022-04-28 03:45:17,678 INFO L290 TraceCheckUtils]: 27: Hoare triple {18344#(and (<= main_~z~0 0) (<= 49983 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {18348#(and (<= main_~z~0 0) (<= 49982 main_~y~0))} is VALID [2022-04-28 03:45:17,679 INFO L290 TraceCheckUtils]: 28: Hoare triple {18348#(and (<= main_~z~0 0) (<= 49982 main_~y~0))} assume !(~y~0 > ~z~0); {18219#false} is VALID [2022-04-28 03:45:17,679 INFO L272 TraceCheckUtils]: 29: Hoare triple {18219#false} call __VERIFIER_assert((if ~x~0 == ~z~0 then 1 else 0)); {18219#false} is VALID [2022-04-28 03:45:17,679 INFO L290 TraceCheckUtils]: 30: Hoare triple {18219#false} ~cond := #in~cond; {18219#false} is VALID [2022-04-28 03:45:17,679 INFO L290 TraceCheckUtils]: 31: Hoare triple {18219#false} assume 0 == ~cond; {18219#false} is VALID [2022-04-28 03:45:17,679 INFO L290 TraceCheckUtils]: 32: Hoare triple {18219#false} assume !false; {18219#false} is VALID [2022-04-28 03:45:17,679 INFO L134 CoverageAnalysis]: Checked inductivity of 173 backedges. 0 proven. 171 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-04-28 03:45:17,679 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 03:45:18,807 INFO L290 TraceCheckUtils]: 32: Hoare triple {18219#false} assume !false; {18219#false} is VALID [2022-04-28 03:45:18,807 INFO L290 TraceCheckUtils]: 31: Hoare triple {18219#false} assume 0 == ~cond; {18219#false} is VALID [2022-04-28 03:45:18,807 INFO L290 TraceCheckUtils]: 30: Hoare triple {18219#false} ~cond := #in~cond; {18219#false} is VALID [2022-04-28 03:45:18,807 INFO L272 TraceCheckUtils]: 29: Hoare triple {18219#false} call __VERIFIER_assert((if ~x~0 == ~z~0 then 1 else 0)); {18219#false} is VALID [2022-04-28 03:45:18,807 INFO L290 TraceCheckUtils]: 28: Hoare triple {18376#(< main_~z~0 main_~y~0)} assume !(~y~0 > ~z~0); {18219#false} is VALID [2022-04-28 03:45:18,808 INFO L290 TraceCheckUtils]: 27: Hoare triple {18380#(< (+ main_~z~0 1) main_~y~0)} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {18376#(< main_~z~0 main_~y~0)} is VALID [2022-04-28 03:45:18,809 INFO L290 TraceCheckUtils]: 26: Hoare triple {18384#(< (+ main_~z~0 2) main_~y~0)} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {18380#(< (+ main_~z~0 1) main_~y~0)} is VALID [2022-04-28 03:45:18,809 INFO L290 TraceCheckUtils]: 25: Hoare triple {18388#(< (+ main_~z~0 3) main_~y~0)} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {18384#(< (+ main_~z~0 2) main_~y~0)} is VALID [2022-04-28 03:45:18,809 INFO L290 TraceCheckUtils]: 24: Hoare triple {18392#(< (+ main_~z~0 4) main_~y~0)} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {18388#(< (+ main_~z~0 3) main_~y~0)} is VALID [2022-04-28 03:45:18,810 INFO L290 TraceCheckUtils]: 23: Hoare triple {18396#(< (+ 5 main_~z~0) main_~y~0)} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {18392#(< (+ main_~z~0 4) main_~y~0)} is VALID [2022-04-28 03:45:18,810 INFO L290 TraceCheckUtils]: 22: Hoare triple {18400#(< (+ main_~z~0 6) main_~y~0)} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {18396#(< (+ 5 main_~z~0) main_~y~0)} is VALID [2022-04-28 03:45:18,811 INFO L290 TraceCheckUtils]: 21: Hoare triple {18404#(< (+ 7 main_~z~0) main_~y~0)} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {18400#(< (+ main_~z~0 6) main_~y~0)} is VALID [2022-04-28 03:45:18,811 INFO L290 TraceCheckUtils]: 20: Hoare triple {18408#(< (+ main_~z~0 8) main_~y~0)} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {18404#(< (+ 7 main_~z~0) main_~y~0)} is VALID [2022-04-28 03:45:18,812 INFO L290 TraceCheckUtils]: 19: Hoare triple {18412#(< (+ main_~z~0 9) main_~y~0)} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {18408#(< (+ main_~z~0 8) main_~y~0)} is VALID [2022-04-28 03:45:18,812 INFO L290 TraceCheckUtils]: 18: Hoare triple {18416#(< (+ main_~z~0 10) main_~y~0)} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {18412#(< (+ main_~z~0 9) main_~y~0)} is VALID [2022-04-28 03:45:18,813 INFO L290 TraceCheckUtils]: 17: Hoare triple {18420#(< (+ main_~z~0 11) main_~y~0)} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {18416#(< (+ main_~z~0 10) main_~y~0)} is VALID [2022-04-28 03:45:18,813 INFO L290 TraceCheckUtils]: 16: Hoare triple {18424#(< (+ main_~z~0 12) main_~y~0)} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {18420#(< (+ main_~z~0 11) main_~y~0)} is VALID [2022-04-28 03:45:18,814 INFO L290 TraceCheckUtils]: 15: Hoare triple {18428#(< (+ main_~z~0 13) main_~y~0)} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {18424#(< (+ main_~z~0 12) main_~y~0)} is VALID [2022-04-28 03:45:18,814 INFO L290 TraceCheckUtils]: 14: Hoare triple {18432#(< (+ main_~z~0 14) main_~y~0)} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {18428#(< (+ main_~z~0 13) main_~y~0)} is VALID [2022-04-28 03:45:18,814 INFO L290 TraceCheckUtils]: 13: Hoare triple {18436#(< (+ main_~z~0 15) main_~y~0)} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {18432#(< (+ main_~z~0 14) main_~y~0)} is VALID [2022-04-28 03:45:18,815 INFO L290 TraceCheckUtils]: 12: Hoare triple {18440#(< (+ main_~z~0 16) main_~y~0)} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {18436#(< (+ main_~z~0 15) main_~y~0)} is VALID [2022-04-28 03:45:18,815 INFO L290 TraceCheckUtils]: 11: Hoare triple {18444#(< (+ main_~z~0 17) main_~y~0)} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {18440#(< (+ main_~z~0 16) main_~y~0)} is VALID [2022-04-28 03:45:18,816 INFO L290 TraceCheckUtils]: 10: Hoare triple {18448#(< (+ main_~z~0 18) main_~y~0)} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {18444#(< (+ main_~z~0 17) main_~y~0)} is VALID [2022-04-28 03:45:18,816 INFO L290 TraceCheckUtils]: 9: Hoare triple {18448#(< (+ main_~z~0 18) main_~y~0)} [147] L18-1_primed-->L18-1: Formula: (not (< v_main_~x~0_11 1000000)) InVars {main_~x~0=v_main_~x~0_11} OutVars{main_~x~0=v_main_~x~0_11} AuxVars[] AssignedVars[] {18448#(< (+ main_~z~0 18) main_~y~0)} is VALID [2022-04-28 03:45:18,817 INFO L290 TraceCheckUtils]: 8: Hoare triple {18448#(< (+ main_~z~0 18) main_~y~0)} [150] L11-2-->L18-1_primed: Formula: (let ((.cse1 (= |v_main_#t~post6_158| |v_main_#t~post6_157|)) (.cse2 (= v_main_~y~0_891 v_main_~y~0_890)) (.cse3 (= v_main_~x~0_911 v_main_~x~0_910)) (.cse4 (= |v_main_#t~post5_158| |v_main_#t~post5_157|)) (.cse0 (<= 50000 v_main_~x~0_911))) (or (and .cse0 (< v_main_~x~0_910 1000001) (= (+ v_main_~x~0_910 v_main_~y~0_891) (+ v_main_~x~0_911 v_main_~y~0_890)) (< v_main_~x~0_911 v_main_~x~0_910)) (and .cse1 .cse2 .cse3 .cse4) (and .cse1 .cse2 .cse3 .cse4 (or (not .cse0) (not (< v_main_~x~0_911 1000000)))))) InVars {main_~y~0=v_main_~y~0_891, main_#t~post5=|v_main_#t~post5_158|, main_~x~0=v_main_~x~0_911, main_#t~post6=|v_main_#t~post6_158|} OutVars{main_~y~0=v_main_~y~0_890, main_#t~post5=|v_main_#t~post5_157|, main_~x~0=v_main_~x~0_910, main_#t~post6=|v_main_#t~post6_157|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {18448#(< (+ main_~z~0 18) main_~y~0)} is VALID [2022-04-28 03:45:18,817 INFO L290 TraceCheckUtils]: 7: Hoare triple {18448#(< (+ main_~z~0 18) main_~y~0)} [149] L18-1_primed-->L11-2: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {18448#(< (+ main_~z~0 18) main_~y~0)} is VALID [2022-04-28 03:45:18,818 INFO L290 TraceCheckUtils]: 6: Hoare triple {18448#(< (+ main_~z~0 18) main_~y~0)} [148] L11-2-->L18-1_primed: Formula: (let ((.cse0 (= v_main_~x~0_909 v_main_~x~0_908)) (.cse1 (= |v_main_#t~post4_143| |v_main_#t~post4_142|))) (or (and (< v_main_~x~0_908 50001) (< v_main_~x~0_909 v_main_~x~0_908)) (and .cse0 .cse1) (and .cse0 .cse1 (not (< v_main_~x~0_909 50000))))) InVars {main_~x~0=v_main_~x~0_909, main_#t~post4=|v_main_#t~post4_143|} OutVars{main_~x~0=v_main_~x~0_908, main_#t~post4=|v_main_#t~post4_142|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {18448#(< (+ main_~z~0 18) main_~y~0)} is VALID [2022-04-28 03:45:18,818 INFO L290 TraceCheckUtils]: 5: Hoare triple {18218#true} ~x~0 := 0;~y~0 := 50000;~z~0 := 0;~x~0 := 0; {18448#(< (+ main_~z~0 18) main_~y~0)} is VALID [2022-04-28 03:45:18,818 INFO L272 TraceCheckUtils]: 4: Hoare triple {18218#true} call #t~ret9 := main(); {18218#true} is VALID [2022-04-28 03:45:18,818 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {18218#true} {18218#true} #52#return; {18218#true} is VALID [2022-04-28 03:45:18,818 INFO L290 TraceCheckUtils]: 2: Hoare triple {18218#true} assume true; {18218#true} is VALID [2022-04-28 03:45:18,818 INFO L290 TraceCheckUtils]: 1: Hoare triple {18218#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(17, 2);call #Ultimate.allocInit(12, 3); {18218#true} is VALID [2022-04-28 03:45:18,818 INFO L272 TraceCheckUtils]: 0: Hoare triple {18218#true} call ULTIMATE.init(); {18218#true} is VALID [2022-04-28 03:45:18,818 INFO L134 CoverageAnalysis]: Checked inductivity of 173 backedges. 0 proven. 171 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-04-28 03:45:18,819 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1122896598] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 03:45:18,819 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 03:45:18,819 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 21, 21] total 63 [2022-04-28 03:45:20,270 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 03:45:20,270 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [2053162241] [2022-04-28 03:45:20,270 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [2053162241] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 03:45:20,270 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 03:45:20,270 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [55] imperfect sequences [] total 55 [2022-04-28 03:45:20,270 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1172244339] [2022-04-28 03:45:20,270 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 03:45:20,271 INFO L78 Accepts]: Start accepts. Automaton has has 55 states, 55 states have (on average 1.6363636363636365) internal successors, (90), 54 states have internal predecessors, (90), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 94 [2022-04-28 03:45:20,271 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 03:45:20,271 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 55 states, 55 states have (on average 1.6363636363636365) internal successors, (90), 54 states have internal predecessors, (90), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:45:20,339 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 94 edges. 94 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 03:45:20,339 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 55 states [2022-04-28 03:45:20,339 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 03:45:20,339 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 55 interpolants. [2022-04-28 03:45:20,340 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3117, Invalid=6003, Unknown=0, NotChecked=0, Total=9120 [2022-04-28 03:45:20,340 INFO L87 Difference]: Start difference. First operand 95 states and 98 transitions. Second operand has 55 states, 55 states have (on average 1.6363636363636365) internal successors, (90), 54 states have internal predecessors, (90), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:45:25,732 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:45:25,732 INFO L93 Difference]: Finished difference Result 246 states and 256 transitions. [2022-04-28 03:45:25,733 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2022-04-28 03:45:25,733 INFO L78 Accepts]: Start accepts. Automaton has has 55 states, 55 states have (on average 1.6363636363636365) internal successors, (90), 54 states have internal predecessors, (90), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 94 [2022-04-28 03:45:25,733 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 03:45:25,733 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 55 states, 55 states have (on average 1.6363636363636365) internal successors, (90), 54 states have internal predecessors, (90), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:45:25,734 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 96 transitions. [2022-04-28 03:45:25,734 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 55 states, 55 states have (on average 1.6363636363636365) internal successors, (90), 54 states have internal predecessors, (90), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:45:25,735 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 96 transitions. [2022-04-28 03:45:25,735 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 36 states and 96 transitions. [2022-04-28 03:45:25,834 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 96 edges. 96 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 03:45:25,836 INFO L225 Difference]: With dead ends: 246 [2022-04-28 03:45:25,836 INFO L226 Difference]: Without dead ends: 159 [2022-04-28 03:45:25,838 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 194 GetRequests, 65 SyntacticMatches, 2 SemanticMatches, 127 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4010 ImplicationChecksByTransitivity, 3.5s TimeCoverageRelationStatistics Valid=4540, Invalid=11972, Unknown=0, NotChecked=0, Total=16512 [2022-04-28 03:45:25,838 INFO L413 NwaCegarLoop]: 13 mSDtfsCounter, 43 mSDsluCounter, 187 mSDsCounter, 0 mSdLazyCounter, 2775 mSolverCounterSat, 39 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 43 SdHoareTripleChecker+Valid, 200 SdHoareTripleChecker+Invalid, 2814 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 39 IncrementalHoareTripleChecker+Valid, 2775 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.1s IncrementalHoareTripleChecker+Time [2022-04-28 03:45:25,838 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [43 Valid, 200 Invalid, 2814 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [39 Valid, 2775 Invalid, 0 Unknown, 0 Unchecked, 2.1s Time] [2022-04-28 03:45:25,839 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 159 states. [2022-04-28 03:45:26,218 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 159 to 159. [2022-04-28 03:45:26,218 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 03:45:26,218 INFO L82 GeneralOperation]: Start isEquivalent. First operand 159 states. Second operand has 159 states, 154 states have (on average 1.0324675324675325) internal successors, (159), 154 states have internal predecessors, (159), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:45:26,219 INFO L74 IsIncluded]: Start isIncluded. First operand 159 states. Second operand has 159 states, 154 states have (on average 1.0324675324675325) internal successors, (159), 154 states have internal predecessors, (159), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:45:26,219 INFO L87 Difference]: Start difference. First operand 159 states. Second operand has 159 states, 154 states have (on average 1.0324675324675325) internal successors, (159), 154 states have internal predecessors, (159), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:45:26,221 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:45:26,221 INFO L93 Difference]: Finished difference Result 159 states and 163 transitions. [2022-04-28 03:45:26,221 INFO L276 IsEmpty]: Start isEmpty. Operand 159 states and 163 transitions. [2022-04-28 03:45:26,221 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:45:26,221 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:45:26,221 INFO L74 IsIncluded]: Start isIncluded. First operand has 159 states, 154 states have (on average 1.0324675324675325) internal successors, (159), 154 states have internal predecessors, (159), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 159 states. [2022-04-28 03:45:26,222 INFO L87 Difference]: Start difference. First operand has 159 states, 154 states have (on average 1.0324675324675325) internal successors, (159), 154 states have internal predecessors, (159), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 159 states. [2022-04-28 03:45:26,223 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:45:26,223 INFO L93 Difference]: Finished difference Result 159 states and 163 transitions. [2022-04-28 03:45:26,224 INFO L276 IsEmpty]: Start isEmpty. Operand 159 states and 163 transitions. [2022-04-28 03:45:26,224 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:45:26,224 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:45:26,224 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 03:45:26,224 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 03:45:26,224 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 159 states, 154 states have (on average 1.0324675324675325) internal successors, (159), 154 states have internal predecessors, (159), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:45:26,226 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 159 states to 159 states and 163 transitions. [2022-04-28 03:45:26,226 INFO L78 Accepts]: Start accepts. Automaton has 159 states and 163 transitions. Word has length 94 [2022-04-28 03:45:26,226 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 03:45:26,227 INFO L495 AbstractCegarLoop]: Abstraction has 159 states and 163 transitions. [2022-04-28 03:45:26,227 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 55 states, 55 states have (on average 1.6363636363636365) internal successors, (90), 54 states have internal predecessors, (90), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:45:26,227 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 159 states and 163 transitions. [2022-04-28 03:45:26,379 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 163 edges. 163 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 03:45:26,380 INFO L276 IsEmpty]: Start isEmpty. Operand 159 states and 163 transitions. [2022-04-28 03:45:26,380 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2022-04-28 03:45:26,380 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 03:45:26,380 INFO L195 NwaCegarLoop]: trace histogram [33, 32, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 03:45:26,403 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (24)] Forceful destruction successful, exit code 0 [2022-04-28 03:45:26,603 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25,24 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 03:45:26,603 INFO L420 AbstractCegarLoop]: === Iteration 27 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 03:45:26,604 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 03:45:26,604 INFO L85 PathProgramCache]: Analyzing trace with hash -1253519302, now seen corresponding path program 24 times [2022-04-28 03:45:26,604 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 03:45:26,604 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1224124279] [2022-04-28 03:45:26,694 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 1 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 03:45:26,912 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={1=1, 2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 03:45:26,914 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-28 03:45:26,916 INFO L85 PathProgramCache]: Analyzing trace with hash -1820898527, now seen corresponding path program 1 times [2022-04-28 03:45:26,916 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 03:45:26,916 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [825641583] [2022-04-28 03:45:26,916 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:45:26,916 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 03:45:26,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:45:27,277 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 03:45:27,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:45:27,284 INFO L290 TraceCheckUtils]: 0: Hoare triple {19732#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(17, 2);call #Ultimate.allocInit(12, 3); {19708#true} is VALID [2022-04-28 03:45:27,284 INFO L290 TraceCheckUtils]: 1: Hoare triple {19708#true} assume true; {19708#true} is VALID [2022-04-28 03:45:27,284 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {19708#true} {19708#true} #52#return; {19708#true} is VALID [2022-04-28 03:45:27,285 INFO L272 TraceCheckUtils]: 0: Hoare triple {19708#true} call ULTIMATE.init(); {19732#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 03:45:27,285 INFO L290 TraceCheckUtils]: 1: Hoare triple {19732#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(17, 2);call #Ultimate.allocInit(12, 3); {19708#true} is VALID [2022-04-28 03:45:27,285 INFO L290 TraceCheckUtils]: 2: Hoare triple {19708#true} assume true; {19708#true} is VALID [2022-04-28 03:45:27,285 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {19708#true} {19708#true} #52#return; {19708#true} is VALID [2022-04-28 03:45:27,285 INFO L272 TraceCheckUtils]: 4: Hoare triple {19708#true} call #t~ret9 := main(); {19708#true} is VALID [2022-04-28 03:45:27,286 INFO L290 TraceCheckUtils]: 5: Hoare triple {19708#true} ~x~0 := 0;~y~0 := 50000;~z~0 := 0;~x~0 := 0; {19713#(and (= main_~z~0 0) (<= 50000 main_~y~0))} is VALID [2022-04-28 03:45:27,286 INFO L290 TraceCheckUtils]: 6: Hoare triple {19713#(and (= main_~z~0 0) (<= 50000 main_~y~0))} [152] L11-2-->L18-1_primed: Formula: (let ((.cse0 (= v_main_~x~0_975 v_main_~x~0_974)) (.cse1 (= |v_main_#t~post4_149| |v_main_#t~post4_148|))) (or (and .cse0 .cse1) (and (< v_main_~x~0_974 50001) (< v_main_~x~0_975 v_main_~x~0_974)) (and .cse0 .cse1 (<= 50000 v_main_~x~0_975)))) InVars {main_~x~0=v_main_~x~0_975, main_#t~post4=|v_main_#t~post4_149|} OutVars{main_~x~0=v_main_~x~0_974, main_#t~post4=|v_main_#t~post4_148|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {19713#(and (= main_~z~0 0) (<= 50000 main_~y~0))} is VALID [2022-04-28 03:45:27,287 INFO L290 TraceCheckUtils]: 7: Hoare triple {19713#(and (= main_~z~0 0) (<= 50000 main_~y~0))} [153] L18-1_primed-->L11-2: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {19713#(and (= main_~z~0 0) (<= 50000 main_~y~0))} is VALID [2022-04-28 03:45:27,288 INFO L290 TraceCheckUtils]: 8: Hoare triple {19713#(and (= main_~z~0 0) (<= 50000 main_~y~0))} [154] L11-2-->L18-1_primed: Formula: (let ((.cse0 (<= 50000 v_main_~x~0_977)) (.cse1 (= |v_main_#t~post6_165| |v_main_#t~post6_164|)) (.cse2 (= v_main_~x~0_977 v_main_~x~0_976)) (.cse3 (= |v_main_#t~post5_165| |v_main_#t~post5_164|)) (.cse4 (= v_main_~y~0_967 v_main_~y~0_966))) (or (and (or (not (< v_main_~x~0_977 1000000)) (not .cse0)) .cse1 .cse2 .cse3 .cse4) (let ((.cse5 (+ v_main_~x~0_977 v_main_~y~0_966))) (and (< v_main_~y~0_967 v_main_~y~0_966) .cse0 (= .cse5 (+ v_main_~x~0_976 v_main_~y~0_967)) (< .cse5 (+ v_main_~y~0_967 1000001)))) (and .cse1 .cse2 .cse3 .cse4))) InVars {main_~y~0=v_main_~y~0_967, main_#t~post5=|v_main_#t~post5_165|, main_~x~0=v_main_~x~0_977, main_#t~post6=|v_main_#t~post6_165|} OutVars{main_~y~0=v_main_~y~0_966, main_#t~post5=|v_main_#t~post5_164|, main_~x~0=v_main_~x~0_976, main_#t~post6=|v_main_#t~post6_164|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {19713#(and (= main_~z~0 0) (<= 50000 main_~y~0))} is VALID [2022-04-28 03:45:27,289 INFO L290 TraceCheckUtils]: 9: Hoare triple {19713#(and (= main_~z~0 0) (<= 50000 main_~y~0))} [151] L18-1_primed-->L18-1: Formula: (not (< v_main_~x~0_11 1000000)) InVars {main_~x~0=v_main_~x~0_11} OutVars{main_~x~0=v_main_~x~0_11} AuxVars[] AssignedVars[] {19713#(and (= main_~z~0 0) (<= 50000 main_~y~0))} is VALID [2022-04-28 03:45:27,289 INFO L290 TraceCheckUtils]: 10: Hoare triple {19713#(and (= main_~z~0 0) (<= 50000 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {19714#(and (= main_~z~0 0) (<= 49999 main_~y~0))} is VALID [2022-04-28 03:45:27,290 INFO L290 TraceCheckUtils]: 11: Hoare triple {19714#(and (= main_~z~0 0) (<= 49999 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {19715#(and (<= 49998 main_~y~0) (= main_~z~0 0))} is VALID [2022-04-28 03:45:27,291 INFO L290 TraceCheckUtils]: 12: Hoare triple {19715#(and (<= 49998 main_~y~0) (= main_~z~0 0))} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {19716#(and (= main_~z~0 0) (<= 49997 main_~y~0))} is VALID [2022-04-28 03:45:27,291 INFO L290 TraceCheckUtils]: 13: Hoare triple {19716#(and (= main_~z~0 0) (<= 49997 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {19717#(and (= main_~z~0 0) (<= 49996 main_~y~0))} is VALID [2022-04-28 03:45:27,292 INFO L290 TraceCheckUtils]: 14: Hoare triple {19717#(and (= main_~z~0 0) (<= 49996 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {19718#(and (= main_~z~0 0) (<= 49995 main_~y~0))} is VALID [2022-04-28 03:45:27,293 INFO L290 TraceCheckUtils]: 15: Hoare triple {19718#(and (= main_~z~0 0) (<= 49995 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {19719#(and (= main_~z~0 0) (<= 49994 main_~y~0))} is VALID [2022-04-28 03:45:27,293 INFO L290 TraceCheckUtils]: 16: Hoare triple {19719#(and (= main_~z~0 0) (<= 49994 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {19720#(and (= main_~z~0 0) (<= 49993 main_~y~0))} is VALID [2022-04-28 03:45:27,294 INFO L290 TraceCheckUtils]: 17: Hoare triple {19720#(and (= main_~z~0 0) (<= 49993 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {19721#(and (= main_~z~0 0) (<= 49992 main_~y~0))} is VALID [2022-04-28 03:45:27,295 INFO L290 TraceCheckUtils]: 18: Hoare triple {19721#(and (= main_~z~0 0) (<= 49992 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {19722#(and (= main_~z~0 0) (<= 49991 main_~y~0))} is VALID [2022-04-28 03:45:27,295 INFO L290 TraceCheckUtils]: 19: Hoare triple {19722#(and (= main_~z~0 0) (<= 49991 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {19723#(and (<= 49990 main_~y~0) (= main_~z~0 0))} is VALID [2022-04-28 03:45:27,296 INFO L290 TraceCheckUtils]: 20: Hoare triple {19723#(and (<= 49990 main_~y~0) (= main_~z~0 0))} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {19724#(and (= main_~z~0 0) (<= 49989 main_~y~0))} is VALID [2022-04-28 03:45:27,297 INFO L290 TraceCheckUtils]: 21: Hoare triple {19724#(and (= main_~z~0 0) (<= 49989 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {19725#(and (= main_~z~0 0) (<= 49988 main_~y~0))} is VALID [2022-04-28 03:45:27,297 INFO L290 TraceCheckUtils]: 22: Hoare triple {19725#(and (= main_~z~0 0) (<= 49988 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {19726#(and (= main_~z~0 0) (<= 49987 main_~y~0))} is VALID [2022-04-28 03:45:27,298 INFO L290 TraceCheckUtils]: 23: Hoare triple {19726#(and (= main_~z~0 0) (<= 49987 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {19727#(and (= main_~z~0 0) (<= 49986 main_~y~0))} is VALID [2022-04-28 03:45:27,298 INFO L290 TraceCheckUtils]: 24: Hoare triple {19727#(and (= main_~z~0 0) (<= 49986 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {19728#(and (= main_~z~0 0) (<= 49985 main_~y~0))} is VALID [2022-04-28 03:45:27,299 INFO L290 TraceCheckUtils]: 25: Hoare triple {19728#(and (= main_~z~0 0) (<= 49985 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {19729#(and (= main_~z~0 0) (<= 49984 main_~y~0))} is VALID [2022-04-28 03:45:27,300 INFO L290 TraceCheckUtils]: 26: Hoare triple {19729#(and (= main_~z~0 0) (<= 49984 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {19730#(and (= main_~z~0 0) (<= 49983 main_~y~0))} is VALID [2022-04-28 03:45:27,300 INFO L290 TraceCheckUtils]: 27: Hoare triple {19730#(and (= main_~z~0 0) (<= 49983 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {19731#(and (= main_~z~0 0) (<= 49982 main_~y~0))} is VALID [2022-04-28 03:45:27,301 INFO L290 TraceCheckUtils]: 28: Hoare triple {19731#(and (= main_~z~0 0) (<= 49982 main_~y~0))} assume !(~y~0 > ~z~0); {19709#false} is VALID [2022-04-28 03:45:27,301 INFO L272 TraceCheckUtils]: 29: Hoare triple {19709#false} call __VERIFIER_assert((if ~x~0 == ~z~0 then 1 else 0)); {19709#false} is VALID [2022-04-28 03:45:27,301 INFO L290 TraceCheckUtils]: 30: Hoare triple {19709#false} ~cond := #in~cond; {19709#false} is VALID [2022-04-28 03:45:27,301 INFO L290 TraceCheckUtils]: 31: Hoare triple {19709#false} assume 0 == ~cond; {19709#false} is VALID [2022-04-28 03:45:27,301 INFO L290 TraceCheckUtils]: 32: Hoare triple {19709#false} assume !false; {19709#false} is VALID [2022-04-28 03:45:27,302 INFO L134 CoverageAnalysis]: Checked inductivity of 173 backedges. 0 proven. 171 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-04-28 03:45:27,302 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 03:45:27,302 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [825641583] [2022-04-28 03:45:27,302 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [825641583] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 03:45:27,302 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [337379451] [2022-04-28 03:45:27,302 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:45:27,302 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 03:45:27,302 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 03:45:27,304 INFO L229 MonitoredProcess]: Starting monitored process 25 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 03:45:27,331 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (25)] Waiting until timeout for monitored process [2022-04-28 03:45:27,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:45:27,361 INFO L263 TraceCheckSpWp]: Trace formula consists of 149 conjuncts, 22 conjunts are in the unsatisfiable core [2022-04-28 03:45:27,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:45:27,381 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 03:45:28,233 INFO L272 TraceCheckUtils]: 0: Hoare triple {19708#true} call ULTIMATE.init(); {19708#true} is VALID [2022-04-28 03:45:28,234 INFO L290 TraceCheckUtils]: 1: Hoare triple {19708#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(17, 2);call #Ultimate.allocInit(12, 3); {19708#true} is VALID [2022-04-28 03:45:28,234 INFO L290 TraceCheckUtils]: 2: Hoare triple {19708#true} assume true; {19708#true} is VALID [2022-04-28 03:45:28,234 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {19708#true} {19708#true} #52#return; {19708#true} is VALID [2022-04-28 03:45:28,234 INFO L272 TraceCheckUtils]: 4: Hoare triple {19708#true} call #t~ret9 := main(); {19708#true} is VALID [2022-04-28 03:45:28,234 INFO L290 TraceCheckUtils]: 5: Hoare triple {19708#true} ~x~0 := 0;~y~0 := 50000;~z~0 := 0;~x~0 := 0; {19751#(and (<= main_~z~0 0) (<= 50000 main_~y~0))} is VALID [2022-04-28 03:45:28,235 INFO L290 TraceCheckUtils]: 6: Hoare triple {19751#(and (<= main_~z~0 0) (<= 50000 main_~y~0))} [152] L11-2-->L18-1_primed: Formula: (let ((.cse0 (= v_main_~x~0_975 v_main_~x~0_974)) (.cse1 (= |v_main_#t~post4_149| |v_main_#t~post4_148|))) (or (and .cse0 .cse1) (and (< v_main_~x~0_974 50001) (< v_main_~x~0_975 v_main_~x~0_974)) (and .cse0 .cse1 (<= 50000 v_main_~x~0_975)))) InVars {main_~x~0=v_main_~x~0_975, main_#t~post4=|v_main_#t~post4_149|} OutVars{main_~x~0=v_main_~x~0_974, main_#t~post4=|v_main_#t~post4_148|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {19751#(and (<= main_~z~0 0) (<= 50000 main_~y~0))} is VALID [2022-04-28 03:45:28,235 INFO L290 TraceCheckUtils]: 7: Hoare triple {19751#(and (<= main_~z~0 0) (<= 50000 main_~y~0))} [153] L18-1_primed-->L11-2: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {19751#(and (<= main_~z~0 0) (<= 50000 main_~y~0))} is VALID [2022-04-28 03:45:28,236 INFO L290 TraceCheckUtils]: 8: Hoare triple {19751#(and (<= main_~z~0 0) (<= 50000 main_~y~0))} [154] L11-2-->L18-1_primed: Formula: (let ((.cse0 (<= 50000 v_main_~x~0_977)) (.cse1 (= |v_main_#t~post6_165| |v_main_#t~post6_164|)) (.cse2 (= v_main_~x~0_977 v_main_~x~0_976)) (.cse3 (= |v_main_#t~post5_165| |v_main_#t~post5_164|)) (.cse4 (= v_main_~y~0_967 v_main_~y~0_966))) (or (and (or (not (< v_main_~x~0_977 1000000)) (not .cse0)) .cse1 .cse2 .cse3 .cse4) (let ((.cse5 (+ v_main_~x~0_977 v_main_~y~0_966))) (and (< v_main_~y~0_967 v_main_~y~0_966) .cse0 (= .cse5 (+ v_main_~x~0_976 v_main_~y~0_967)) (< .cse5 (+ v_main_~y~0_967 1000001)))) (and .cse1 .cse2 .cse3 .cse4))) InVars {main_~y~0=v_main_~y~0_967, main_#t~post5=|v_main_#t~post5_165|, main_~x~0=v_main_~x~0_977, main_#t~post6=|v_main_#t~post6_165|} OutVars{main_~y~0=v_main_~y~0_966, main_#t~post5=|v_main_#t~post5_164|, main_~x~0=v_main_~x~0_976, main_#t~post6=|v_main_#t~post6_164|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {19751#(and (<= main_~z~0 0) (<= 50000 main_~y~0))} is VALID [2022-04-28 03:45:28,236 INFO L290 TraceCheckUtils]: 9: Hoare triple {19751#(and (<= main_~z~0 0) (<= 50000 main_~y~0))} [151] L18-1_primed-->L18-1: Formula: (not (< v_main_~x~0_11 1000000)) InVars {main_~x~0=v_main_~x~0_11} OutVars{main_~x~0=v_main_~x~0_11} AuxVars[] AssignedVars[] {19751#(and (<= main_~z~0 0) (<= 50000 main_~y~0))} is VALID [2022-04-28 03:45:28,237 INFO L290 TraceCheckUtils]: 10: Hoare triple {19751#(and (<= main_~z~0 0) (<= 50000 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {19767#(and (<= main_~z~0 0) (<= 49999 main_~y~0))} is VALID [2022-04-28 03:45:28,237 INFO L290 TraceCheckUtils]: 11: Hoare triple {19767#(and (<= main_~z~0 0) (<= 49999 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {19771#(and (<= main_~z~0 0) (<= 49998 main_~y~0))} is VALID [2022-04-28 03:45:28,238 INFO L290 TraceCheckUtils]: 12: Hoare triple {19771#(and (<= main_~z~0 0) (<= 49998 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {19775#(and (<= main_~z~0 0) (<= 49997 main_~y~0))} is VALID [2022-04-28 03:45:28,238 INFO L290 TraceCheckUtils]: 13: Hoare triple {19775#(and (<= main_~z~0 0) (<= 49997 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {19779#(and (<= main_~z~0 0) (<= 49996 main_~y~0))} is VALID [2022-04-28 03:45:28,239 INFO L290 TraceCheckUtils]: 14: Hoare triple {19779#(and (<= main_~z~0 0) (<= 49996 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {19783#(and (<= main_~z~0 0) (<= 49995 main_~y~0))} is VALID [2022-04-28 03:45:28,239 INFO L290 TraceCheckUtils]: 15: Hoare triple {19783#(and (<= main_~z~0 0) (<= 49995 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {19787#(and (<= main_~z~0 0) (<= 49994 main_~y~0))} is VALID [2022-04-28 03:45:28,239 INFO L290 TraceCheckUtils]: 16: Hoare triple {19787#(and (<= main_~z~0 0) (<= 49994 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {19791#(and (<= main_~z~0 0) (<= 49993 main_~y~0))} is VALID [2022-04-28 03:45:28,240 INFO L290 TraceCheckUtils]: 17: Hoare triple {19791#(and (<= main_~z~0 0) (<= 49993 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {19795#(and (<= main_~z~0 0) (<= 49992 main_~y~0))} is VALID [2022-04-28 03:45:28,240 INFO L290 TraceCheckUtils]: 18: Hoare triple {19795#(and (<= main_~z~0 0) (<= 49992 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {19799#(and (<= main_~z~0 0) (<= 49991 main_~y~0))} is VALID [2022-04-28 03:45:28,241 INFO L290 TraceCheckUtils]: 19: Hoare triple {19799#(and (<= main_~z~0 0) (<= 49991 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {19803#(and (<= main_~z~0 0) (<= 49990 main_~y~0))} is VALID [2022-04-28 03:45:28,241 INFO L290 TraceCheckUtils]: 20: Hoare triple {19803#(and (<= main_~z~0 0) (<= 49990 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {19807#(and (<= main_~z~0 0) (<= 49989 main_~y~0))} is VALID [2022-04-28 03:45:28,242 INFO L290 TraceCheckUtils]: 21: Hoare triple {19807#(and (<= main_~z~0 0) (<= 49989 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {19811#(and (<= main_~z~0 0) (<= 49988 main_~y~0))} is VALID [2022-04-28 03:45:28,243 INFO L290 TraceCheckUtils]: 22: Hoare triple {19811#(and (<= main_~z~0 0) (<= 49988 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {19815#(and (<= main_~z~0 0) (<= 49987 main_~y~0))} is VALID [2022-04-28 03:45:28,244 INFO L290 TraceCheckUtils]: 23: Hoare triple {19815#(and (<= main_~z~0 0) (<= 49987 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {19819#(and (<= main_~z~0 0) (<= 49986 main_~y~0))} is VALID [2022-04-28 03:45:28,245 INFO L290 TraceCheckUtils]: 24: Hoare triple {19819#(and (<= main_~z~0 0) (<= 49986 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {19823#(and (<= main_~z~0 0) (<= 49985 main_~y~0))} is VALID [2022-04-28 03:45:28,245 INFO L290 TraceCheckUtils]: 25: Hoare triple {19823#(and (<= main_~z~0 0) (<= 49985 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {19827#(and (<= main_~z~0 0) (<= 49984 main_~y~0))} is VALID [2022-04-28 03:45:28,246 INFO L290 TraceCheckUtils]: 26: Hoare triple {19827#(and (<= main_~z~0 0) (<= 49984 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {19831#(and (<= main_~z~0 0) (<= 49983 main_~y~0))} is VALID [2022-04-28 03:45:28,246 INFO L290 TraceCheckUtils]: 27: Hoare triple {19831#(and (<= main_~z~0 0) (<= 49983 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {19835#(and (<= main_~z~0 0) (<= 49982 main_~y~0))} is VALID [2022-04-28 03:45:28,247 INFO L290 TraceCheckUtils]: 28: Hoare triple {19835#(and (<= main_~z~0 0) (<= 49982 main_~y~0))} assume !(~y~0 > ~z~0); {19709#false} is VALID [2022-04-28 03:45:28,247 INFO L272 TraceCheckUtils]: 29: Hoare triple {19709#false} call __VERIFIER_assert((if ~x~0 == ~z~0 then 1 else 0)); {19709#false} is VALID [2022-04-28 03:45:28,247 INFO L290 TraceCheckUtils]: 30: Hoare triple {19709#false} ~cond := #in~cond; {19709#false} is VALID [2022-04-28 03:45:28,247 INFO L290 TraceCheckUtils]: 31: Hoare triple {19709#false} assume 0 == ~cond; {19709#false} is VALID [2022-04-28 03:45:28,247 INFO L290 TraceCheckUtils]: 32: Hoare triple {19709#false} assume !false; {19709#false} is VALID [2022-04-28 03:45:28,248 INFO L134 CoverageAnalysis]: Checked inductivity of 173 backedges. 0 proven. 171 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-04-28 03:45:28,248 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 03:45:29,285 INFO L290 TraceCheckUtils]: 32: Hoare triple {19709#false} assume !false; {19709#false} is VALID [2022-04-28 03:45:29,285 INFO L290 TraceCheckUtils]: 31: Hoare triple {19709#false} assume 0 == ~cond; {19709#false} is VALID [2022-04-28 03:45:29,286 INFO L290 TraceCheckUtils]: 30: Hoare triple {19709#false} ~cond := #in~cond; {19709#false} is VALID [2022-04-28 03:45:29,286 INFO L272 TraceCheckUtils]: 29: Hoare triple {19709#false} call __VERIFIER_assert((if ~x~0 == ~z~0 then 1 else 0)); {19709#false} is VALID [2022-04-28 03:45:29,286 INFO L290 TraceCheckUtils]: 28: Hoare triple {19863#(< main_~z~0 main_~y~0)} assume !(~y~0 > ~z~0); {19709#false} is VALID [2022-04-28 03:45:29,286 INFO L290 TraceCheckUtils]: 27: Hoare triple {19867#(< (+ main_~z~0 1) main_~y~0)} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {19863#(< main_~z~0 main_~y~0)} is VALID [2022-04-28 03:45:29,287 INFO L290 TraceCheckUtils]: 26: Hoare triple {19871#(< (+ main_~z~0 2) main_~y~0)} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {19867#(< (+ main_~z~0 1) main_~y~0)} is VALID [2022-04-28 03:45:29,287 INFO L290 TraceCheckUtils]: 25: Hoare triple {19875#(< (+ main_~z~0 3) main_~y~0)} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {19871#(< (+ main_~z~0 2) main_~y~0)} is VALID [2022-04-28 03:45:29,288 INFO L290 TraceCheckUtils]: 24: Hoare triple {19879#(< (+ main_~z~0 4) main_~y~0)} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {19875#(< (+ main_~z~0 3) main_~y~0)} is VALID [2022-04-28 03:45:29,288 INFO L290 TraceCheckUtils]: 23: Hoare triple {19883#(< (+ 5 main_~z~0) main_~y~0)} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {19879#(< (+ main_~z~0 4) main_~y~0)} is VALID [2022-04-28 03:45:29,289 INFO L290 TraceCheckUtils]: 22: Hoare triple {19887#(< (+ main_~z~0 6) main_~y~0)} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {19883#(< (+ 5 main_~z~0) main_~y~0)} is VALID [2022-04-28 03:45:29,289 INFO L290 TraceCheckUtils]: 21: Hoare triple {19891#(< (+ 7 main_~z~0) main_~y~0)} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {19887#(< (+ main_~z~0 6) main_~y~0)} is VALID [2022-04-28 03:45:29,289 INFO L290 TraceCheckUtils]: 20: Hoare triple {19895#(< (+ main_~z~0 8) main_~y~0)} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {19891#(< (+ 7 main_~z~0) main_~y~0)} is VALID [2022-04-28 03:45:29,290 INFO L290 TraceCheckUtils]: 19: Hoare triple {19899#(< (+ main_~z~0 9) main_~y~0)} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {19895#(< (+ main_~z~0 8) main_~y~0)} is VALID [2022-04-28 03:45:29,290 INFO L290 TraceCheckUtils]: 18: Hoare triple {19903#(< (+ main_~z~0 10) main_~y~0)} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {19899#(< (+ main_~z~0 9) main_~y~0)} is VALID [2022-04-28 03:45:29,291 INFO L290 TraceCheckUtils]: 17: Hoare triple {19907#(< (+ main_~z~0 11) main_~y~0)} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {19903#(< (+ main_~z~0 10) main_~y~0)} is VALID [2022-04-28 03:45:29,291 INFO L290 TraceCheckUtils]: 16: Hoare triple {19911#(< (+ main_~z~0 12) main_~y~0)} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {19907#(< (+ main_~z~0 11) main_~y~0)} is VALID [2022-04-28 03:45:29,292 INFO L290 TraceCheckUtils]: 15: Hoare triple {19915#(< (+ main_~z~0 13) main_~y~0)} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {19911#(< (+ main_~z~0 12) main_~y~0)} is VALID [2022-04-28 03:45:29,292 INFO L290 TraceCheckUtils]: 14: Hoare triple {19919#(< (+ main_~z~0 14) main_~y~0)} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {19915#(< (+ main_~z~0 13) main_~y~0)} is VALID [2022-04-28 03:45:29,293 INFO L290 TraceCheckUtils]: 13: Hoare triple {19923#(< (+ main_~z~0 15) main_~y~0)} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {19919#(< (+ main_~z~0 14) main_~y~0)} is VALID [2022-04-28 03:45:29,293 INFO L290 TraceCheckUtils]: 12: Hoare triple {19927#(< (+ main_~z~0 16) main_~y~0)} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {19923#(< (+ main_~z~0 15) main_~y~0)} is VALID [2022-04-28 03:45:29,294 INFO L290 TraceCheckUtils]: 11: Hoare triple {19931#(< (+ main_~z~0 17) main_~y~0)} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {19927#(< (+ main_~z~0 16) main_~y~0)} is VALID [2022-04-28 03:45:29,294 INFO L290 TraceCheckUtils]: 10: Hoare triple {19935#(< (+ main_~z~0 18) main_~y~0)} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {19931#(< (+ main_~z~0 17) main_~y~0)} is VALID [2022-04-28 03:45:29,294 INFO L290 TraceCheckUtils]: 9: Hoare triple {19935#(< (+ main_~z~0 18) main_~y~0)} [151] L18-1_primed-->L18-1: Formula: (not (< v_main_~x~0_11 1000000)) InVars {main_~x~0=v_main_~x~0_11} OutVars{main_~x~0=v_main_~x~0_11} AuxVars[] AssignedVars[] {19935#(< (+ main_~z~0 18) main_~y~0)} is VALID [2022-04-28 03:45:29,295 INFO L290 TraceCheckUtils]: 8: Hoare triple {19935#(< (+ main_~z~0 18) main_~y~0)} [154] L11-2-->L18-1_primed: Formula: (let ((.cse0 (<= 50000 v_main_~x~0_977)) (.cse1 (= |v_main_#t~post6_165| |v_main_#t~post6_164|)) (.cse2 (= v_main_~x~0_977 v_main_~x~0_976)) (.cse3 (= |v_main_#t~post5_165| |v_main_#t~post5_164|)) (.cse4 (= v_main_~y~0_967 v_main_~y~0_966))) (or (and (or (not (< v_main_~x~0_977 1000000)) (not .cse0)) .cse1 .cse2 .cse3 .cse4) (let ((.cse5 (+ v_main_~x~0_977 v_main_~y~0_966))) (and (< v_main_~y~0_967 v_main_~y~0_966) .cse0 (= .cse5 (+ v_main_~x~0_976 v_main_~y~0_967)) (< .cse5 (+ v_main_~y~0_967 1000001)))) (and .cse1 .cse2 .cse3 .cse4))) InVars {main_~y~0=v_main_~y~0_967, main_#t~post5=|v_main_#t~post5_165|, main_~x~0=v_main_~x~0_977, main_#t~post6=|v_main_#t~post6_165|} OutVars{main_~y~0=v_main_~y~0_966, main_#t~post5=|v_main_#t~post5_164|, main_~x~0=v_main_~x~0_976, main_#t~post6=|v_main_#t~post6_164|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {19935#(< (+ main_~z~0 18) main_~y~0)} is VALID [2022-04-28 03:45:29,295 INFO L290 TraceCheckUtils]: 7: Hoare triple {19935#(< (+ main_~z~0 18) main_~y~0)} [153] L18-1_primed-->L11-2: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {19935#(< (+ main_~z~0 18) main_~y~0)} is VALID [2022-04-28 03:45:29,296 INFO L290 TraceCheckUtils]: 6: Hoare triple {19935#(< (+ main_~z~0 18) main_~y~0)} [152] L11-2-->L18-1_primed: Formula: (let ((.cse0 (= v_main_~x~0_975 v_main_~x~0_974)) (.cse1 (= |v_main_#t~post4_149| |v_main_#t~post4_148|))) (or (and .cse0 .cse1) (and (< v_main_~x~0_974 50001) (< v_main_~x~0_975 v_main_~x~0_974)) (and .cse0 .cse1 (<= 50000 v_main_~x~0_975)))) InVars {main_~x~0=v_main_~x~0_975, main_#t~post4=|v_main_#t~post4_149|} OutVars{main_~x~0=v_main_~x~0_974, main_#t~post4=|v_main_#t~post4_148|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {19935#(< (+ main_~z~0 18) main_~y~0)} is VALID [2022-04-28 03:45:29,296 INFO L290 TraceCheckUtils]: 5: Hoare triple {19708#true} ~x~0 := 0;~y~0 := 50000;~z~0 := 0;~x~0 := 0; {19935#(< (+ main_~z~0 18) main_~y~0)} is VALID [2022-04-28 03:45:29,296 INFO L272 TraceCheckUtils]: 4: Hoare triple {19708#true} call #t~ret9 := main(); {19708#true} is VALID [2022-04-28 03:45:29,296 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {19708#true} {19708#true} #52#return; {19708#true} is VALID [2022-04-28 03:45:29,296 INFO L290 TraceCheckUtils]: 2: Hoare triple {19708#true} assume true; {19708#true} is VALID [2022-04-28 03:45:29,296 INFO L290 TraceCheckUtils]: 1: Hoare triple {19708#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(17, 2);call #Ultimate.allocInit(12, 3); {19708#true} is VALID [2022-04-28 03:45:29,296 INFO L272 TraceCheckUtils]: 0: Hoare triple {19708#true} call ULTIMATE.init(); {19708#true} is VALID [2022-04-28 03:45:29,297 INFO L134 CoverageAnalysis]: Checked inductivity of 173 backedges. 0 proven. 171 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-04-28 03:45:29,297 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [337379451] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 03:45:29,297 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 03:45:29,297 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 21, 21] total 60 [2022-04-28 03:45:30,502 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 03:45:30,502 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1224124279] [2022-04-28 03:45:30,503 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1224124279] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 03:45:30,503 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 03:45:30,503 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [56] imperfect sequences [] total 56 [2022-04-28 03:45:30,503 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1294486920] [2022-04-28 03:45:30,503 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 03:45:30,503 INFO L78 Accepts]: Start accepts. Automaton has has 56 states, 56 states have (on average 1.6428571428571428) internal successors, (92), 55 states have internal predecessors, (92), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 96 [2022-04-28 03:45:30,503 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 03:45:30,504 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 56 states, 56 states have (on average 1.6428571428571428) internal successors, (92), 55 states have internal predecessors, (92), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:45:30,577 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 96 edges. 96 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 03:45:30,577 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 56 states [2022-04-28 03:45:30,577 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 03:45:30,577 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 56 interpolants. [2022-04-28 03:45:30,578 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3581, Invalid=5161, Unknown=0, NotChecked=0, Total=8742 [2022-04-28 03:45:30,578 INFO L87 Difference]: Start difference. First operand 159 states and 163 transitions. Second operand has 56 states, 56 states have (on average 1.6428571428571428) internal successors, (92), 55 states have internal predecessors, (92), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:45:35,717 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:45:35,718 INFO L93 Difference]: Finished difference Result 253 states and 267 transitions. [2022-04-28 03:45:35,718 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 56 states. [2022-04-28 03:45:35,718 INFO L78 Accepts]: Start accepts. Automaton has has 56 states, 56 states have (on average 1.6428571428571428) internal successors, (92), 55 states have internal predecessors, (92), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 96 [2022-04-28 03:45:35,718 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 03:45:35,718 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 56 states, 56 states have (on average 1.6428571428571428) internal successors, (92), 55 states have internal predecessors, (92), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:45:35,719 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 120 transitions. [2022-04-28 03:45:35,719 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 56 states, 56 states have (on average 1.6428571428571428) internal successors, (92), 55 states have internal predecessors, (92), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:45:35,720 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 120 transitions. [2022-04-28 03:45:35,720 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 56 states and 120 transitions. [2022-04-28 03:45:35,812 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 120 edges. 120 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 03:45:35,814 INFO L225 Difference]: With dead ends: 253 [2022-04-28 03:45:35,814 INFO L226 Difference]: Without dead ends: 166 [2022-04-28 03:45:35,816 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 214 GetRequests, 67 SyntacticMatches, 2 SemanticMatches, 145 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6114 ImplicationChecksByTransitivity, 3.4s TimeCoverageRelationStatistics Valid=7336, Invalid=14126, Unknown=0, NotChecked=0, Total=21462 [2022-04-28 03:45:35,816 INFO L413 NwaCegarLoop]: 12 mSDtfsCounter, 115 mSDsluCounter, 27 mSDsCounter, 0 mSdLazyCounter, 2301 mSolverCounterSat, 137 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 115 SdHoareTripleChecker+Valid, 39 SdHoareTripleChecker+Invalid, 2438 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 137 IncrementalHoareTripleChecker+Valid, 2301 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2022-04-28 03:45:35,817 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [115 Valid, 39 Invalid, 2438 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [137 Valid, 2301 Invalid, 0 Unknown, 0 Unchecked, 1.8s Time] [2022-04-28 03:45:35,817 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 166 states. [2022-04-28 03:45:36,022 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 166 to 102. [2022-04-28 03:45:36,022 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 03:45:36,023 INFO L82 GeneralOperation]: Start isEquivalent. First operand 166 states. Second operand has 102 states, 97 states have (on average 1.041237113402062) internal successors, (101), 97 states have internal predecessors, (101), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:45:36,023 INFO L74 IsIncluded]: Start isIncluded. First operand 166 states. Second operand has 102 states, 97 states have (on average 1.041237113402062) internal successors, (101), 97 states have internal predecessors, (101), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:45:36,023 INFO L87 Difference]: Start difference. First operand 166 states. Second operand has 102 states, 97 states have (on average 1.041237113402062) internal successors, (101), 97 states have internal predecessors, (101), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:45:36,025 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:45:36,025 INFO L93 Difference]: Finished difference Result 166 states and 170 transitions. [2022-04-28 03:45:36,025 INFO L276 IsEmpty]: Start isEmpty. Operand 166 states and 170 transitions. [2022-04-28 03:45:36,025 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:45:36,025 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:45:36,025 INFO L74 IsIncluded]: Start isIncluded. First operand has 102 states, 97 states have (on average 1.041237113402062) internal successors, (101), 97 states have internal predecessors, (101), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 166 states. [2022-04-28 03:45:36,026 INFO L87 Difference]: Start difference. First operand has 102 states, 97 states have (on average 1.041237113402062) internal successors, (101), 97 states have internal predecessors, (101), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 166 states. [2022-04-28 03:45:36,027 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:45:36,027 INFO L93 Difference]: Finished difference Result 166 states and 170 transitions. [2022-04-28 03:45:36,028 INFO L276 IsEmpty]: Start isEmpty. Operand 166 states and 170 transitions. [2022-04-28 03:45:36,028 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:45:36,028 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:45:36,028 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 03:45:36,028 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 03:45:36,028 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 102 states, 97 states have (on average 1.041237113402062) internal successors, (101), 97 states have internal predecessors, (101), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:45:36,029 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 105 transitions. [2022-04-28 03:45:36,030 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 105 transitions. Word has length 96 [2022-04-28 03:45:36,030 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 03:45:36,030 INFO L495 AbstractCegarLoop]: Abstraction has 102 states and 105 transitions. [2022-04-28 03:45:36,030 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 56 states, 56 states have (on average 1.6428571428571428) internal successors, (92), 55 states have internal predecessors, (92), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:45:36,030 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 102 states and 105 transitions. [2022-04-28 03:45:36,149 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 105 edges. 105 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 03:45:36,149 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 105 transitions. [2022-04-28 03:45:36,150 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2022-04-28 03:45:36,150 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 03:45:36,150 INFO L195 NwaCegarLoop]: trace histogram [35, 34, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 03:45:36,169 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (25)] Forceful destruction successful, exit code 0 [2022-04-28 03:45:36,350 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 25 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable26 [2022-04-28 03:45:36,350 INFO L420 AbstractCegarLoop]: === Iteration 28 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 03:45:36,350 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 03:45:36,351 INFO L85 PathProgramCache]: Analyzing trace with hash 792532447, now seen corresponding path program 25 times [2022-04-28 03:45:36,351 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 03:45:36,351 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [39601900] [2022-04-28 03:45:38,488 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 1 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 03:45:38,684 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={1=1, 2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 03:45:38,685 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-28 03:45:38,687 INFO L85 PathProgramCache]: Analyzing trace with hash -1640022686, now seen corresponding path program 1 times [2022-04-28 03:45:38,687 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 03:45:38,687 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [189320167] [2022-04-28 03:45:38,687 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:45:38,687 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 03:45:38,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:45:39,092 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 03:45:39,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:45:39,097 INFO L290 TraceCheckUtils]: 0: Hoare triple {21175#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(17, 2);call #Ultimate.allocInit(12, 3); {21150#true} is VALID [2022-04-28 03:45:39,097 INFO L290 TraceCheckUtils]: 1: Hoare triple {21150#true} assume true; {21150#true} is VALID [2022-04-28 03:45:39,097 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {21150#true} {21150#true} #52#return; {21150#true} is VALID [2022-04-28 03:45:39,098 INFO L272 TraceCheckUtils]: 0: Hoare triple {21150#true} call ULTIMATE.init(); {21175#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 03:45:39,098 INFO L290 TraceCheckUtils]: 1: Hoare triple {21175#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(17, 2);call #Ultimate.allocInit(12, 3); {21150#true} is VALID [2022-04-28 03:45:39,098 INFO L290 TraceCheckUtils]: 2: Hoare triple {21150#true} assume true; {21150#true} is VALID [2022-04-28 03:45:39,098 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {21150#true} {21150#true} #52#return; {21150#true} is VALID [2022-04-28 03:45:39,098 INFO L272 TraceCheckUtils]: 4: Hoare triple {21150#true} call #t~ret9 := main(); {21150#true} is VALID [2022-04-28 03:45:39,099 INFO L290 TraceCheckUtils]: 5: Hoare triple {21150#true} ~x~0 := 0;~y~0 := 50000;~z~0 := 0;~x~0 := 0; {21155#(and (= main_~z~0 0) (<= 50000 main_~y~0))} is VALID [2022-04-28 03:45:39,099 INFO L290 TraceCheckUtils]: 6: Hoare triple {21155#(and (= main_~z~0 0) (<= 50000 main_~y~0))} [156] L11-2-->L18-1_primed: Formula: (let ((.cse0 (= v_main_~x~0_1042 v_main_~x~0_1041)) (.cse1 (= |v_main_#t~post4_155| |v_main_#t~post4_154|))) (or (and .cse0 .cse1) (and (not (< v_main_~x~0_1042 50000)) .cse0 .cse1) (and (< v_main_~x~0_1041 50001) (< v_main_~x~0_1042 v_main_~x~0_1041)))) InVars {main_~x~0=v_main_~x~0_1042, main_#t~post4=|v_main_#t~post4_155|} OutVars{main_~x~0=v_main_~x~0_1041, main_#t~post4=|v_main_#t~post4_154|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {21155#(and (= main_~z~0 0) (<= 50000 main_~y~0))} is VALID [2022-04-28 03:45:39,100 INFO L290 TraceCheckUtils]: 7: Hoare triple {21155#(and (= main_~z~0 0) (<= 50000 main_~y~0))} [157] L18-1_primed-->L11-2: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {21155#(and (= main_~z~0 0) (<= 50000 main_~y~0))} is VALID [2022-04-28 03:45:39,101 INFO L290 TraceCheckUtils]: 8: Hoare triple {21155#(and (= main_~z~0 0) (<= 50000 main_~y~0))} [158] L11-2-->L18-1_primed: Formula: (let ((.cse1 (<= 50000 v_main_~x~0_1044)) (.cse2 (= v_main_~y~0_1044 v_main_~y~0_1043)) (.cse3 (= v_main_~x~0_1044 v_main_~x~0_1043)) (.cse4 (= |v_main_#t~post5_172| |v_main_#t~post5_171|)) (.cse5 (= |v_main_#t~post6_172| |v_main_#t~post6_171|))) (or (let ((.cse0 (+ v_main_~x~0_1044 v_main_~y~0_1043))) (and (< .cse0 (+ 1000001 v_main_~y~0_1044)) .cse1 (= (+ v_main_~x~0_1043 v_main_~y~0_1044) .cse0) (< v_main_~y~0_1044 v_main_~y~0_1043))) (and .cse2 .cse3 .cse4 (or (not .cse1) (not (< v_main_~x~0_1044 1000000))) .cse5) (and .cse2 .cse3 .cse4 .cse5))) InVars {main_~y~0=v_main_~y~0_1044, main_#t~post5=|v_main_#t~post5_172|, main_~x~0=v_main_~x~0_1044, main_#t~post6=|v_main_#t~post6_172|} OutVars{main_~y~0=v_main_~y~0_1043, main_#t~post5=|v_main_#t~post5_171|, main_~x~0=v_main_~x~0_1043, main_#t~post6=|v_main_#t~post6_171|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {21155#(and (= main_~z~0 0) (<= 50000 main_~y~0))} is VALID [2022-04-28 03:45:39,101 INFO L290 TraceCheckUtils]: 9: Hoare triple {21155#(and (= main_~z~0 0) (<= 50000 main_~y~0))} [155] L18-1_primed-->L18-1: Formula: (not (< v_main_~x~0_11 1000000)) InVars {main_~x~0=v_main_~x~0_11} OutVars{main_~x~0=v_main_~x~0_11} AuxVars[] AssignedVars[] {21155#(and (= main_~z~0 0) (<= 50000 main_~y~0))} is VALID [2022-04-28 03:45:39,102 INFO L290 TraceCheckUtils]: 10: Hoare triple {21155#(and (= main_~z~0 0) (<= 50000 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {21156#(and (= main_~z~0 0) (<= 49999 main_~y~0))} is VALID [2022-04-28 03:45:39,102 INFO L290 TraceCheckUtils]: 11: Hoare triple {21156#(and (= main_~z~0 0) (<= 49999 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {21157#(and (<= 49998 main_~y~0) (= main_~z~0 0))} is VALID [2022-04-28 03:45:39,103 INFO L290 TraceCheckUtils]: 12: Hoare triple {21157#(and (<= 49998 main_~y~0) (= main_~z~0 0))} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {21158#(and (= main_~z~0 0) (<= 49997 main_~y~0))} is VALID [2022-04-28 03:45:39,104 INFO L290 TraceCheckUtils]: 13: Hoare triple {21158#(and (= main_~z~0 0) (<= 49997 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {21159#(and (= main_~z~0 0) (<= 49996 main_~y~0))} is VALID [2022-04-28 03:45:39,104 INFO L290 TraceCheckUtils]: 14: Hoare triple {21159#(and (= main_~z~0 0) (<= 49996 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {21160#(and (= main_~z~0 0) (<= 49995 main_~y~0))} is VALID [2022-04-28 03:45:39,105 INFO L290 TraceCheckUtils]: 15: Hoare triple {21160#(and (= main_~z~0 0) (<= 49995 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {21161#(and (= main_~z~0 0) (<= 49994 main_~y~0))} is VALID [2022-04-28 03:45:39,105 INFO L290 TraceCheckUtils]: 16: Hoare triple {21161#(and (= main_~z~0 0) (<= 49994 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {21162#(and (= main_~z~0 0) (<= 49993 main_~y~0))} is VALID [2022-04-28 03:45:39,106 INFO L290 TraceCheckUtils]: 17: Hoare triple {21162#(and (= main_~z~0 0) (<= 49993 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {21163#(and (= main_~z~0 0) (<= 49992 main_~y~0))} is VALID [2022-04-28 03:45:39,107 INFO L290 TraceCheckUtils]: 18: Hoare triple {21163#(and (= main_~z~0 0) (<= 49992 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {21164#(and (= main_~z~0 0) (<= 49991 main_~y~0))} is VALID [2022-04-28 03:45:39,107 INFO L290 TraceCheckUtils]: 19: Hoare triple {21164#(and (= main_~z~0 0) (<= 49991 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {21165#(and (<= 49990 main_~y~0) (= main_~z~0 0))} is VALID [2022-04-28 03:45:39,108 INFO L290 TraceCheckUtils]: 20: Hoare triple {21165#(and (<= 49990 main_~y~0) (= main_~z~0 0))} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {21166#(and (= main_~z~0 0) (<= 49989 main_~y~0))} is VALID [2022-04-28 03:45:39,109 INFO L290 TraceCheckUtils]: 21: Hoare triple {21166#(and (= main_~z~0 0) (<= 49989 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {21167#(and (= main_~z~0 0) (<= 49988 main_~y~0))} is VALID [2022-04-28 03:45:39,109 INFO L290 TraceCheckUtils]: 22: Hoare triple {21167#(and (= main_~z~0 0) (<= 49988 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {21168#(and (= main_~z~0 0) (<= 49987 main_~y~0))} is VALID [2022-04-28 03:45:39,110 INFO L290 TraceCheckUtils]: 23: Hoare triple {21168#(and (= main_~z~0 0) (<= 49987 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {21169#(and (= main_~z~0 0) (<= 49986 main_~y~0))} is VALID [2022-04-28 03:45:39,110 INFO L290 TraceCheckUtils]: 24: Hoare triple {21169#(and (= main_~z~0 0) (<= 49986 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {21170#(and (= main_~z~0 0) (<= 49985 main_~y~0))} is VALID [2022-04-28 03:45:39,111 INFO L290 TraceCheckUtils]: 25: Hoare triple {21170#(and (= main_~z~0 0) (<= 49985 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {21171#(and (= main_~z~0 0) (<= 49984 main_~y~0))} is VALID [2022-04-28 03:45:39,112 INFO L290 TraceCheckUtils]: 26: Hoare triple {21171#(and (= main_~z~0 0) (<= 49984 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {21172#(and (= main_~z~0 0) (<= 49983 main_~y~0))} is VALID [2022-04-28 03:45:39,112 INFO L290 TraceCheckUtils]: 27: Hoare triple {21172#(and (= main_~z~0 0) (<= 49983 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {21173#(and (= main_~z~0 0) (<= 49982 main_~y~0))} is VALID [2022-04-28 03:45:39,113 INFO L290 TraceCheckUtils]: 28: Hoare triple {21173#(and (= main_~z~0 0) (<= 49982 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {21174#(and (<= 49981 main_~y~0) (= main_~z~0 0))} is VALID [2022-04-28 03:45:39,113 INFO L290 TraceCheckUtils]: 29: Hoare triple {21174#(and (<= 49981 main_~y~0) (= main_~z~0 0))} assume !(~y~0 > ~z~0); {21151#false} is VALID [2022-04-28 03:45:39,113 INFO L272 TraceCheckUtils]: 30: Hoare triple {21151#false} call __VERIFIER_assert((if ~x~0 == ~z~0 then 1 else 0)); {21151#false} is VALID [2022-04-28 03:45:39,113 INFO L290 TraceCheckUtils]: 31: Hoare triple {21151#false} ~cond := #in~cond; {21151#false} is VALID [2022-04-28 03:45:39,113 INFO L290 TraceCheckUtils]: 32: Hoare triple {21151#false} assume 0 == ~cond; {21151#false} is VALID [2022-04-28 03:45:39,114 INFO L290 TraceCheckUtils]: 33: Hoare triple {21151#false} assume !false; {21151#false} is VALID [2022-04-28 03:45:39,114 INFO L134 CoverageAnalysis]: Checked inductivity of 192 backedges. 0 proven. 190 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-04-28 03:45:39,114 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 03:45:39,114 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [189320167] [2022-04-28 03:45:39,114 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [189320167] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 03:45:39,114 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1697041459] [2022-04-28 03:45:39,114 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:45:39,114 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 03:45:39,115 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 03:45:39,116 INFO L229 MonitoredProcess]: Starting monitored process 26 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 03:45:39,120 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (26)] Waiting until timeout for monitored process [2022-04-28 03:45:39,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:45:39,175 INFO L263 TraceCheckSpWp]: Trace formula consists of 154 conjuncts, 23 conjunts are in the unsatisfiable core [2022-04-28 03:45:39,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:45:39,190 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 03:45:40,040 INFO L272 TraceCheckUtils]: 0: Hoare triple {21150#true} call ULTIMATE.init(); {21150#true} is VALID [2022-04-28 03:45:40,040 INFO L290 TraceCheckUtils]: 1: Hoare triple {21150#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(17, 2);call #Ultimate.allocInit(12, 3); {21150#true} is VALID [2022-04-28 03:45:40,040 INFO L290 TraceCheckUtils]: 2: Hoare triple {21150#true} assume true; {21150#true} is VALID [2022-04-28 03:45:40,041 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {21150#true} {21150#true} #52#return; {21150#true} is VALID [2022-04-28 03:45:40,041 INFO L272 TraceCheckUtils]: 4: Hoare triple {21150#true} call #t~ret9 := main(); {21150#true} is VALID [2022-04-28 03:45:40,041 INFO L290 TraceCheckUtils]: 5: Hoare triple {21150#true} ~x~0 := 0;~y~0 := 50000;~z~0 := 0;~x~0 := 0; {21194#(and (<= main_~z~0 0) (<= 50000 main_~y~0))} is VALID [2022-04-28 03:45:40,041 INFO L290 TraceCheckUtils]: 6: Hoare triple {21194#(and (<= main_~z~0 0) (<= 50000 main_~y~0))} [156] L11-2-->L18-1_primed: Formula: (let ((.cse0 (= v_main_~x~0_1042 v_main_~x~0_1041)) (.cse1 (= |v_main_#t~post4_155| |v_main_#t~post4_154|))) (or (and .cse0 .cse1) (and (not (< v_main_~x~0_1042 50000)) .cse0 .cse1) (and (< v_main_~x~0_1041 50001) (< v_main_~x~0_1042 v_main_~x~0_1041)))) InVars {main_~x~0=v_main_~x~0_1042, main_#t~post4=|v_main_#t~post4_155|} OutVars{main_~x~0=v_main_~x~0_1041, main_#t~post4=|v_main_#t~post4_154|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {21194#(and (<= main_~z~0 0) (<= 50000 main_~y~0))} is VALID [2022-04-28 03:45:40,042 INFO L290 TraceCheckUtils]: 7: Hoare triple {21194#(and (<= main_~z~0 0) (<= 50000 main_~y~0))} [157] L18-1_primed-->L11-2: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {21194#(and (<= main_~z~0 0) (<= 50000 main_~y~0))} is VALID [2022-04-28 03:45:40,043 INFO L290 TraceCheckUtils]: 8: Hoare triple {21194#(and (<= main_~z~0 0) (<= 50000 main_~y~0))} [158] L11-2-->L18-1_primed: Formula: (let ((.cse1 (<= 50000 v_main_~x~0_1044)) (.cse2 (= v_main_~y~0_1044 v_main_~y~0_1043)) (.cse3 (= v_main_~x~0_1044 v_main_~x~0_1043)) (.cse4 (= |v_main_#t~post5_172| |v_main_#t~post5_171|)) (.cse5 (= |v_main_#t~post6_172| |v_main_#t~post6_171|))) (or (let ((.cse0 (+ v_main_~x~0_1044 v_main_~y~0_1043))) (and (< .cse0 (+ 1000001 v_main_~y~0_1044)) .cse1 (= (+ v_main_~x~0_1043 v_main_~y~0_1044) .cse0) (< v_main_~y~0_1044 v_main_~y~0_1043))) (and .cse2 .cse3 .cse4 (or (not .cse1) (not (< v_main_~x~0_1044 1000000))) .cse5) (and .cse2 .cse3 .cse4 .cse5))) InVars {main_~y~0=v_main_~y~0_1044, main_#t~post5=|v_main_#t~post5_172|, main_~x~0=v_main_~x~0_1044, main_#t~post6=|v_main_#t~post6_172|} OutVars{main_~y~0=v_main_~y~0_1043, main_#t~post5=|v_main_#t~post5_171|, main_~x~0=v_main_~x~0_1043, main_#t~post6=|v_main_#t~post6_171|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {21194#(and (<= main_~z~0 0) (<= 50000 main_~y~0))} is VALID [2022-04-28 03:45:40,043 INFO L290 TraceCheckUtils]: 9: Hoare triple {21194#(and (<= main_~z~0 0) (<= 50000 main_~y~0))} [155] L18-1_primed-->L18-1: Formula: (not (< v_main_~x~0_11 1000000)) InVars {main_~x~0=v_main_~x~0_11} OutVars{main_~x~0=v_main_~x~0_11} AuxVars[] AssignedVars[] {21194#(and (<= main_~z~0 0) (<= 50000 main_~y~0))} is VALID [2022-04-28 03:45:40,043 INFO L290 TraceCheckUtils]: 10: Hoare triple {21194#(and (<= main_~z~0 0) (<= 50000 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {21210#(and (<= main_~z~0 0) (<= 49999 main_~y~0))} is VALID [2022-04-28 03:45:40,044 INFO L290 TraceCheckUtils]: 11: Hoare triple {21210#(and (<= main_~z~0 0) (<= 49999 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {21214#(and (<= main_~z~0 0) (<= 49998 main_~y~0))} is VALID [2022-04-28 03:45:40,044 INFO L290 TraceCheckUtils]: 12: Hoare triple {21214#(and (<= main_~z~0 0) (<= 49998 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {21218#(and (<= main_~z~0 0) (<= 49997 main_~y~0))} is VALID [2022-04-28 03:45:40,045 INFO L290 TraceCheckUtils]: 13: Hoare triple {21218#(and (<= main_~z~0 0) (<= 49997 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {21222#(and (<= main_~z~0 0) (<= 49996 main_~y~0))} is VALID [2022-04-28 03:45:40,045 INFO L290 TraceCheckUtils]: 14: Hoare triple {21222#(and (<= main_~z~0 0) (<= 49996 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {21226#(and (<= main_~z~0 0) (<= 49995 main_~y~0))} is VALID [2022-04-28 03:45:40,046 INFO L290 TraceCheckUtils]: 15: Hoare triple {21226#(and (<= main_~z~0 0) (<= 49995 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {21230#(and (<= main_~z~0 0) (<= 49994 main_~y~0))} is VALID [2022-04-28 03:45:40,046 INFO L290 TraceCheckUtils]: 16: Hoare triple {21230#(and (<= main_~z~0 0) (<= 49994 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {21234#(and (<= main_~z~0 0) (<= 49993 main_~y~0))} is VALID [2022-04-28 03:45:40,047 INFO L290 TraceCheckUtils]: 17: Hoare triple {21234#(and (<= main_~z~0 0) (<= 49993 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {21238#(and (<= main_~z~0 0) (<= 49992 main_~y~0))} is VALID [2022-04-28 03:45:40,047 INFO L290 TraceCheckUtils]: 18: Hoare triple {21238#(and (<= main_~z~0 0) (<= 49992 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {21242#(and (<= main_~z~0 0) (<= 49991 main_~y~0))} is VALID [2022-04-28 03:45:40,048 INFO L290 TraceCheckUtils]: 19: Hoare triple {21242#(and (<= main_~z~0 0) (<= 49991 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {21246#(and (<= main_~z~0 0) (<= 49990 main_~y~0))} is VALID [2022-04-28 03:45:40,048 INFO L290 TraceCheckUtils]: 20: Hoare triple {21246#(and (<= main_~z~0 0) (<= 49990 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {21250#(and (<= main_~z~0 0) (<= 49989 main_~y~0))} is VALID [2022-04-28 03:45:40,049 INFO L290 TraceCheckUtils]: 21: Hoare triple {21250#(and (<= main_~z~0 0) (<= 49989 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {21254#(and (<= main_~z~0 0) (<= 49988 main_~y~0))} is VALID [2022-04-28 03:45:40,049 INFO L290 TraceCheckUtils]: 22: Hoare triple {21254#(and (<= main_~z~0 0) (<= 49988 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {21258#(and (<= main_~z~0 0) (<= 49987 main_~y~0))} is VALID [2022-04-28 03:45:40,050 INFO L290 TraceCheckUtils]: 23: Hoare triple {21258#(and (<= main_~z~0 0) (<= 49987 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {21262#(and (<= main_~z~0 0) (<= 49986 main_~y~0))} is VALID [2022-04-28 03:45:40,050 INFO L290 TraceCheckUtils]: 24: Hoare triple {21262#(and (<= main_~z~0 0) (<= 49986 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {21266#(and (<= main_~z~0 0) (<= 49985 main_~y~0))} is VALID [2022-04-28 03:45:40,051 INFO L290 TraceCheckUtils]: 25: Hoare triple {21266#(and (<= main_~z~0 0) (<= 49985 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {21270#(and (<= main_~z~0 0) (<= 49984 main_~y~0))} is VALID [2022-04-28 03:45:40,051 INFO L290 TraceCheckUtils]: 26: Hoare triple {21270#(and (<= main_~z~0 0) (<= 49984 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {21274#(and (<= main_~z~0 0) (<= 49983 main_~y~0))} is VALID [2022-04-28 03:45:40,052 INFO L290 TraceCheckUtils]: 27: Hoare triple {21274#(and (<= main_~z~0 0) (<= 49983 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {21278#(and (<= main_~z~0 0) (<= 49982 main_~y~0))} is VALID [2022-04-28 03:45:40,052 INFO L290 TraceCheckUtils]: 28: Hoare triple {21278#(and (<= main_~z~0 0) (<= 49982 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {21282#(and (<= main_~z~0 0) (<= 49981 main_~y~0))} is VALID [2022-04-28 03:45:40,052 INFO L290 TraceCheckUtils]: 29: Hoare triple {21282#(and (<= main_~z~0 0) (<= 49981 main_~y~0))} assume !(~y~0 > ~z~0); {21151#false} is VALID [2022-04-28 03:45:40,052 INFO L272 TraceCheckUtils]: 30: Hoare triple {21151#false} call __VERIFIER_assert((if ~x~0 == ~z~0 then 1 else 0)); {21151#false} is VALID [2022-04-28 03:45:40,053 INFO L290 TraceCheckUtils]: 31: Hoare triple {21151#false} ~cond := #in~cond; {21151#false} is VALID [2022-04-28 03:45:40,053 INFO L290 TraceCheckUtils]: 32: Hoare triple {21151#false} assume 0 == ~cond; {21151#false} is VALID [2022-04-28 03:45:40,053 INFO L290 TraceCheckUtils]: 33: Hoare triple {21151#false} assume !false; {21151#false} is VALID [2022-04-28 03:45:40,053 INFO L134 CoverageAnalysis]: Checked inductivity of 192 backedges. 0 proven. 190 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-04-28 03:45:40,053 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 03:45:41,211 INFO L290 TraceCheckUtils]: 33: Hoare triple {21151#false} assume !false; {21151#false} is VALID [2022-04-28 03:45:41,211 INFO L290 TraceCheckUtils]: 32: Hoare triple {21151#false} assume 0 == ~cond; {21151#false} is VALID [2022-04-28 03:45:41,211 INFO L290 TraceCheckUtils]: 31: Hoare triple {21151#false} ~cond := #in~cond; {21151#false} is VALID [2022-04-28 03:45:41,211 INFO L272 TraceCheckUtils]: 30: Hoare triple {21151#false} call __VERIFIER_assert((if ~x~0 == ~z~0 then 1 else 0)); {21151#false} is VALID [2022-04-28 03:45:41,212 INFO L290 TraceCheckUtils]: 29: Hoare triple {21310#(< main_~z~0 main_~y~0)} assume !(~y~0 > ~z~0); {21151#false} is VALID [2022-04-28 03:45:41,212 INFO L290 TraceCheckUtils]: 28: Hoare triple {21314#(< (+ main_~z~0 1) main_~y~0)} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {21310#(< main_~z~0 main_~y~0)} is VALID [2022-04-28 03:45:41,213 INFO L290 TraceCheckUtils]: 27: Hoare triple {21318#(< (+ main_~z~0 2) main_~y~0)} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {21314#(< (+ main_~z~0 1) main_~y~0)} is VALID [2022-04-28 03:45:41,213 INFO L290 TraceCheckUtils]: 26: Hoare triple {21322#(< (+ main_~z~0 3) main_~y~0)} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {21318#(< (+ main_~z~0 2) main_~y~0)} is VALID [2022-04-28 03:45:41,214 INFO L290 TraceCheckUtils]: 25: Hoare triple {21326#(< (+ main_~z~0 4) main_~y~0)} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {21322#(< (+ main_~z~0 3) main_~y~0)} is VALID [2022-04-28 03:45:41,214 INFO L290 TraceCheckUtils]: 24: Hoare triple {21330#(< (+ 5 main_~z~0) main_~y~0)} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {21326#(< (+ main_~z~0 4) main_~y~0)} is VALID [2022-04-28 03:45:41,214 INFO L290 TraceCheckUtils]: 23: Hoare triple {21334#(< (+ main_~z~0 6) main_~y~0)} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {21330#(< (+ 5 main_~z~0) main_~y~0)} is VALID [2022-04-28 03:45:41,215 INFO L290 TraceCheckUtils]: 22: Hoare triple {21338#(< (+ 7 main_~z~0) main_~y~0)} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {21334#(< (+ main_~z~0 6) main_~y~0)} is VALID [2022-04-28 03:45:41,215 INFO L290 TraceCheckUtils]: 21: Hoare triple {21342#(< (+ main_~z~0 8) main_~y~0)} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {21338#(< (+ 7 main_~z~0) main_~y~0)} is VALID [2022-04-28 03:45:41,216 INFO L290 TraceCheckUtils]: 20: Hoare triple {21346#(< (+ main_~z~0 9) main_~y~0)} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {21342#(< (+ main_~z~0 8) main_~y~0)} is VALID [2022-04-28 03:45:41,216 INFO L290 TraceCheckUtils]: 19: Hoare triple {21350#(< (+ main_~z~0 10) main_~y~0)} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {21346#(< (+ main_~z~0 9) main_~y~0)} is VALID [2022-04-28 03:45:41,217 INFO L290 TraceCheckUtils]: 18: Hoare triple {21354#(< (+ main_~z~0 11) main_~y~0)} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {21350#(< (+ main_~z~0 10) main_~y~0)} is VALID [2022-04-28 03:45:41,217 INFO L290 TraceCheckUtils]: 17: Hoare triple {21358#(< (+ main_~z~0 12) main_~y~0)} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {21354#(< (+ main_~z~0 11) main_~y~0)} is VALID [2022-04-28 03:45:41,218 INFO L290 TraceCheckUtils]: 16: Hoare triple {21362#(< (+ main_~z~0 13) main_~y~0)} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {21358#(< (+ main_~z~0 12) main_~y~0)} is VALID [2022-04-28 03:45:41,218 INFO L290 TraceCheckUtils]: 15: Hoare triple {21366#(< (+ main_~z~0 14) main_~y~0)} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {21362#(< (+ main_~z~0 13) main_~y~0)} is VALID [2022-04-28 03:45:41,219 INFO L290 TraceCheckUtils]: 14: Hoare triple {21370#(< (+ main_~z~0 15) main_~y~0)} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {21366#(< (+ main_~z~0 14) main_~y~0)} is VALID [2022-04-28 03:45:41,219 INFO L290 TraceCheckUtils]: 13: Hoare triple {21374#(< (+ main_~z~0 16) main_~y~0)} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {21370#(< (+ main_~z~0 15) main_~y~0)} is VALID [2022-04-28 03:45:41,219 INFO L290 TraceCheckUtils]: 12: Hoare triple {21378#(< (+ main_~z~0 17) main_~y~0)} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {21374#(< (+ main_~z~0 16) main_~y~0)} is VALID [2022-04-28 03:45:41,220 INFO L290 TraceCheckUtils]: 11: Hoare triple {21382#(< (+ main_~z~0 18) main_~y~0)} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {21378#(< (+ main_~z~0 17) main_~y~0)} is VALID [2022-04-28 03:45:41,220 INFO L290 TraceCheckUtils]: 10: Hoare triple {21386#(< (+ 19 main_~z~0) main_~y~0)} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {21382#(< (+ main_~z~0 18) main_~y~0)} is VALID [2022-04-28 03:45:41,221 INFO L290 TraceCheckUtils]: 9: Hoare triple {21386#(< (+ 19 main_~z~0) main_~y~0)} [155] L18-1_primed-->L18-1: Formula: (not (< v_main_~x~0_11 1000000)) InVars {main_~x~0=v_main_~x~0_11} OutVars{main_~x~0=v_main_~x~0_11} AuxVars[] AssignedVars[] {21386#(< (+ 19 main_~z~0) main_~y~0)} is VALID [2022-04-28 03:45:41,221 INFO L290 TraceCheckUtils]: 8: Hoare triple {21386#(< (+ 19 main_~z~0) main_~y~0)} [158] L11-2-->L18-1_primed: Formula: (let ((.cse1 (<= 50000 v_main_~x~0_1044)) (.cse2 (= v_main_~y~0_1044 v_main_~y~0_1043)) (.cse3 (= v_main_~x~0_1044 v_main_~x~0_1043)) (.cse4 (= |v_main_#t~post5_172| |v_main_#t~post5_171|)) (.cse5 (= |v_main_#t~post6_172| |v_main_#t~post6_171|))) (or (let ((.cse0 (+ v_main_~x~0_1044 v_main_~y~0_1043))) (and (< .cse0 (+ 1000001 v_main_~y~0_1044)) .cse1 (= (+ v_main_~x~0_1043 v_main_~y~0_1044) .cse0) (< v_main_~y~0_1044 v_main_~y~0_1043))) (and .cse2 .cse3 .cse4 (or (not .cse1) (not (< v_main_~x~0_1044 1000000))) .cse5) (and .cse2 .cse3 .cse4 .cse5))) InVars {main_~y~0=v_main_~y~0_1044, main_#t~post5=|v_main_#t~post5_172|, main_~x~0=v_main_~x~0_1044, main_#t~post6=|v_main_#t~post6_172|} OutVars{main_~y~0=v_main_~y~0_1043, main_#t~post5=|v_main_#t~post5_171|, main_~x~0=v_main_~x~0_1043, main_#t~post6=|v_main_#t~post6_171|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {21386#(< (+ 19 main_~z~0) main_~y~0)} is VALID [2022-04-28 03:45:41,222 INFO L290 TraceCheckUtils]: 7: Hoare triple {21386#(< (+ 19 main_~z~0) main_~y~0)} [157] L18-1_primed-->L11-2: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {21386#(< (+ 19 main_~z~0) main_~y~0)} is VALID [2022-04-28 03:45:41,222 INFO L290 TraceCheckUtils]: 6: Hoare triple {21386#(< (+ 19 main_~z~0) main_~y~0)} [156] L11-2-->L18-1_primed: Formula: (let ((.cse0 (= v_main_~x~0_1042 v_main_~x~0_1041)) (.cse1 (= |v_main_#t~post4_155| |v_main_#t~post4_154|))) (or (and .cse0 .cse1) (and (not (< v_main_~x~0_1042 50000)) .cse0 .cse1) (and (< v_main_~x~0_1041 50001) (< v_main_~x~0_1042 v_main_~x~0_1041)))) InVars {main_~x~0=v_main_~x~0_1042, main_#t~post4=|v_main_#t~post4_155|} OutVars{main_~x~0=v_main_~x~0_1041, main_#t~post4=|v_main_#t~post4_154|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {21386#(< (+ 19 main_~z~0) main_~y~0)} is VALID [2022-04-28 03:45:41,222 INFO L290 TraceCheckUtils]: 5: Hoare triple {21150#true} ~x~0 := 0;~y~0 := 50000;~z~0 := 0;~x~0 := 0; {21386#(< (+ 19 main_~z~0) main_~y~0)} is VALID [2022-04-28 03:45:41,222 INFO L272 TraceCheckUtils]: 4: Hoare triple {21150#true} call #t~ret9 := main(); {21150#true} is VALID [2022-04-28 03:45:41,222 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {21150#true} {21150#true} #52#return; {21150#true} is VALID [2022-04-28 03:45:41,223 INFO L290 TraceCheckUtils]: 2: Hoare triple {21150#true} assume true; {21150#true} is VALID [2022-04-28 03:45:41,223 INFO L290 TraceCheckUtils]: 1: Hoare triple {21150#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(17, 2);call #Ultimate.allocInit(12, 3); {21150#true} is VALID [2022-04-28 03:45:41,223 INFO L272 TraceCheckUtils]: 0: Hoare triple {21150#true} call ULTIMATE.init(); {21150#true} is VALID [2022-04-28 03:45:41,223 INFO L134 CoverageAnalysis]: Checked inductivity of 192 backedges. 0 proven. 190 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-04-28 03:45:41,223 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1697041459] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 03:45:41,223 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 03:45:41,223 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 22, 22] total 63 [2022-04-28 03:45:42,555 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 03:45:42,555 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [39601900] [2022-04-28 03:45:42,555 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [39601900] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 03:45:42,555 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 03:45:42,555 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [59] imperfect sequences [] total 59 [2022-04-28 03:45:42,555 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [974622158] [2022-04-28 03:45:42,555 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 03:45:42,556 INFO L78 Accepts]: Start accepts. Automaton has has 59 states, 59 states have (on average 1.6440677966101696) internal successors, (97), 58 states have internal predecessors, (97), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 101 [2022-04-28 03:45:42,556 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 03:45:42,556 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 59 states, 59 states have (on average 1.6440677966101696) internal successors, (97), 58 states have internal predecessors, (97), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:45:42,634 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 101 edges. 101 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 03:45:42,634 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 59 states [2022-04-28 03:45:42,635 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 03:45:42,635 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 59 interpolants. [2022-04-28 03:45:42,636 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3970, Invalid=5732, Unknown=0, NotChecked=0, Total=9702 [2022-04-28 03:45:42,636 INFO L87 Difference]: Start difference. First operand 102 states and 105 transitions. Second operand has 59 states, 59 states have (on average 1.6440677966101696) internal successors, (97), 58 states have internal predecessors, (97), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:45:48,641 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:45:48,642 INFO L93 Difference]: Finished difference Result 201 states and 212 transitions. [2022-04-28 03:45:48,642 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 59 states. [2022-04-28 03:45:48,642 INFO L78 Accepts]: Start accepts. Automaton has has 59 states, 59 states have (on average 1.6440677966101696) internal successors, (97), 58 states have internal predecessors, (97), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 101 [2022-04-28 03:45:48,642 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 03:45:48,642 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 59 states, 59 states have (on average 1.6440677966101696) internal successors, (97), 58 states have internal predecessors, (97), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:45:48,644 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 123 transitions. [2022-04-28 03:45:48,644 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 59 states, 59 states have (on average 1.6440677966101696) internal successors, (97), 58 states have internal predecessors, (97), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:45:48,645 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 123 transitions. [2022-04-28 03:45:48,645 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 59 states and 123 transitions. [2022-04-28 03:45:48,757 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 123 edges. 123 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 03:45:48,758 INFO L225 Difference]: With dead ends: 201 [2022-04-28 03:45:48,758 INFO L226 Difference]: Without dead ends: 107 [2022-04-28 03:45:48,760 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 224 GetRequests, 69 SyntacticMatches, 2 SemanticMatches, 153 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6815 ImplicationChecksByTransitivity, 3.8s TimeCoverageRelationStatistics Valid=8134, Invalid=15736, Unknown=0, NotChecked=0, Total=23870 [2022-04-28 03:45:48,760 INFO L413 NwaCegarLoop]: 12 mSDtfsCounter, 273 mSDsluCounter, 32 mSDsCounter, 0 mSdLazyCounter, 2626 mSolverCounterSat, 335 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 273 SdHoareTripleChecker+Valid, 44 SdHoareTripleChecker+Invalid, 2961 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 335 IncrementalHoareTripleChecker+Valid, 2626 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2022-04-28 03:45:48,760 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [273 Valid, 44 Invalid, 2961 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [335 Valid, 2626 Invalid, 0 Unknown, 0 Unchecked, 2.3s Time] [2022-04-28 03:45:48,760 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states. [2022-04-28 03:45:48,967 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 107. [2022-04-28 03:45:48,967 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 03:45:48,967 INFO L82 GeneralOperation]: Start isEquivalent. First operand 107 states. Second operand has 107 states, 102 states have (on average 1.0392156862745099) internal successors, (106), 102 states have internal predecessors, (106), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:45:48,967 INFO L74 IsIncluded]: Start isIncluded. First operand 107 states. Second operand has 107 states, 102 states have (on average 1.0392156862745099) internal successors, (106), 102 states have internal predecessors, (106), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:45:48,967 INFO L87 Difference]: Start difference. First operand 107 states. Second operand has 107 states, 102 states have (on average 1.0392156862745099) internal successors, (106), 102 states have internal predecessors, (106), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:45:48,968 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:45:48,968 INFO L93 Difference]: Finished difference Result 107 states and 110 transitions. [2022-04-28 03:45:48,968 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 110 transitions. [2022-04-28 03:45:48,969 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:45:48,969 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:45:48,969 INFO L74 IsIncluded]: Start isIncluded. First operand has 107 states, 102 states have (on average 1.0392156862745099) internal successors, (106), 102 states have internal predecessors, (106), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 107 states. [2022-04-28 03:45:48,969 INFO L87 Difference]: Start difference. First operand has 107 states, 102 states have (on average 1.0392156862745099) internal successors, (106), 102 states have internal predecessors, (106), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 107 states. [2022-04-28 03:45:48,970 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:45:48,970 INFO L93 Difference]: Finished difference Result 107 states and 110 transitions. [2022-04-28 03:45:48,970 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 110 transitions. [2022-04-28 03:45:48,971 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:45:48,971 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:45:48,971 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 03:45:48,971 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 03:45:48,971 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 107 states, 102 states have (on average 1.0392156862745099) internal successors, (106), 102 states have internal predecessors, (106), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:45:48,972 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 110 transitions. [2022-04-28 03:45:48,972 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 110 transitions. Word has length 101 [2022-04-28 03:45:48,972 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 03:45:48,972 INFO L495 AbstractCegarLoop]: Abstraction has 107 states and 110 transitions. [2022-04-28 03:45:48,973 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 59 states, 59 states have (on average 1.6440677966101696) internal successors, (97), 58 states have internal predecessors, (97), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:45:48,973 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 107 states and 110 transitions. [2022-04-28 03:45:49,075 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 110 edges. 110 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 03:45:49,075 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 110 transitions. [2022-04-28 03:45:49,075 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2022-04-28 03:45:49,075 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 03:45:49,075 INFO L195 NwaCegarLoop]: trace histogram [37, 36, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 03:45:49,093 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (26)] Forceful destruction successful, exit code 0 [2022-04-28 03:45:49,275 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 26 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable27 [2022-04-28 03:45:49,276 INFO L420 AbstractCegarLoop]: === Iteration 29 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 03:45:49,276 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 03:45:49,276 INFO L85 PathProgramCache]: Analyzing trace with hash -1847916626, now seen corresponding path program 26 times [2022-04-28 03:45:49,276 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 03:45:49,276 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [905220632] [2022-04-28 03:45:49,384 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 1 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 03:45:49,575 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={1=1, 2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 03:45:49,576 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-28 03:45:49,579 INFO L85 PathProgramCache]: Analyzing trace with hash -2131496639, now seen corresponding path program 1 times [2022-04-28 03:45:49,579 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 03:45:49,579 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [890446106] [2022-04-28 03:45:49,579 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:45:49,579 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 03:45:49,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:45:50,076 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 03:45:50,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:45:50,079 INFO L290 TraceCheckUtils]: 0: Hoare triple {22426#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(17, 2);call #Ultimate.allocInit(12, 3); {22397#true} is VALID [2022-04-28 03:45:50,079 INFO L290 TraceCheckUtils]: 1: Hoare triple {22397#true} assume true; {22397#true} is VALID [2022-04-28 03:45:50,079 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {22397#true} {22397#true} #52#return; {22397#true} is VALID [2022-04-28 03:45:50,080 INFO L272 TraceCheckUtils]: 0: Hoare triple {22397#true} call ULTIMATE.init(); {22426#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 03:45:50,080 INFO L290 TraceCheckUtils]: 1: Hoare triple {22426#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(17, 2);call #Ultimate.allocInit(12, 3); {22397#true} is VALID [2022-04-28 03:45:50,080 INFO L290 TraceCheckUtils]: 2: Hoare triple {22397#true} assume true; {22397#true} is VALID [2022-04-28 03:45:50,080 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {22397#true} {22397#true} #52#return; {22397#true} is VALID [2022-04-28 03:45:50,080 INFO L272 TraceCheckUtils]: 4: Hoare triple {22397#true} call #t~ret9 := main(); {22397#true} is VALID [2022-04-28 03:45:50,081 INFO L290 TraceCheckUtils]: 5: Hoare triple {22397#true} ~x~0 := 0;~y~0 := 50000;~z~0 := 0;~x~0 := 0; {22402#(and (= main_~z~0 0) (= main_~x~0 0) (<= 50000 main_~y~0))} is VALID [2022-04-28 03:45:50,081 INFO L290 TraceCheckUtils]: 6: Hoare triple {22402#(and (= main_~z~0 0) (= main_~x~0 0) (<= 50000 main_~y~0))} [160] L11-2-->L18-1_primed: Formula: (let ((.cse0 (= v_main_~x~0_1112 v_main_~x~0_1111)) (.cse1 (= |v_main_#t~post4_161| |v_main_#t~post4_160|))) (or (and (< v_main_~x~0_1111 50001) (< v_main_~x~0_1112 v_main_~x~0_1111)) (and .cse0 (not (< v_main_~x~0_1112 50000)) .cse1) (and .cse0 .cse1))) InVars {main_~x~0=v_main_~x~0_1112, main_#t~post4=|v_main_#t~post4_161|} OutVars{main_~x~0=v_main_~x~0_1111, main_#t~post4=|v_main_#t~post4_160|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {22403#(or (<= main_~x~0 0) (and (= main_~z~0 0) (<= main_~x~0 main_~y~0) (<= main_~x~0 50000)))} is VALID [2022-04-28 03:45:50,082 INFO L290 TraceCheckUtils]: 7: Hoare triple {22403#(or (<= main_~x~0 0) (and (= main_~z~0 0) (<= main_~x~0 main_~y~0) (<= main_~x~0 50000)))} [161] L18-1_primed-->L11-2: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {22403#(or (<= main_~x~0 0) (and (= main_~z~0 0) (<= main_~x~0 main_~y~0) (<= main_~x~0 50000)))} is VALID [2022-04-28 03:45:50,083 INFO L290 TraceCheckUtils]: 8: Hoare triple {22403#(or (<= main_~x~0 0) (and (= main_~z~0 0) (<= main_~x~0 main_~y~0) (<= main_~x~0 50000)))} [162] L11-2-->L18-1_primed: Formula: (let ((.cse0 (= v_main_~x~0_1114 v_main_~x~0_1113)) (.cse2 (= |v_main_#t~post6_179| |v_main_#t~post6_178|)) (.cse3 (= v_main_~y~0_1125 v_main_~y~0_1124)) (.cse4 (= |v_main_#t~post5_179| |v_main_#t~post5_178|)) (.cse1 (<= 50000 v_main_~x~0_1114))) (or (and .cse0 (or (not (< v_main_~x~0_1114 1000000)) (not .cse1)) .cse2 .cse3 .cse4) (and .cse0 .cse2 .cse3 .cse4) (and (= (+ v_main_~x~0_1114 v_main_~y~0_1124) (+ v_main_~x~0_1113 v_main_~y~0_1125)) (< v_main_~x~0_1113 1000001) (< v_main_~x~0_1114 v_main_~x~0_1113) .cse1))) InVars {main_~y~0=v_main_~y~0_1125, main_#t~post5=|v_main_#t~post5_179|, main_~x~0=v_main_~x~0_1114, main_#t~post6=|v_main_#t~post6_179|} OutVars{main_~y~0=v_main_~y~0_1124, main_#t~post5=|v_main_#t~post5_178|, main_~x~0=v_main_~x~0_1113, main_#t~post6=|v_main_#t~post6_178|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {22404#(or (and (= main_~z~0 0) (<= main_~x~0 main_~y~0)) (<= main_~x~0 50000))} is VALID [2022-04-28 03:45:50,083 INFO L290 TraceCheckUtils]: 9: Hoare triple {22404#(or (and (= main_~z~0 0) (<= main_~x~0 main_~y~0)) (<= main_~x~0 50000))} [159] L18-1_primed-->L18-1: Formula: (not (< v_main_~x~0_11 1000000)) InVars {main_~x~0=v_main_~x~0_11} OutVars{main_~x~0=v_main_~x~0_11} AuxVars[] AssignedVars[] {22405#(and (= main_~z~0 0) (<= 1000000 main_~y~0))} is VALID [2022-04-28 03:45:50,084 INFO L290 TraceCheckUtils]: 10: Hoare triple {22405#(and (= main_~z~0 0) (<= 1000000 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {22406#(and (= main_~z~0 0) (<= 999999 main_~y~0))} is VALID [2022-04-28 03:45:50,085 INFO L290 TraceCheckUtils]: 11: Hoare triple {22406#(and (= main_~z~0 0) (<= 999999 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {22407#(and (= main_~z~0 0) (<= 999998 main_~y~0))} is VALID [2022-04-28 03:45:50,085 INFO L290 TraceCheckUtils]: 12: Hoare triple {22407#(and (= main_~z~0 0) (<= 999998 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {22408#(and (= main_~z~0 0) (<= 999997 main_~y~0))} is VALID [2022-04-28 03:45:50,086 INFO L290 TraceCheckUtils]: 13: Hoare triple {22408#(and (= main_~z~0 0) (<= 999997 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {22409#(and (<= 999996 main_~y~0) (= main_~z~0 0))} is VALID [2022-04-28 03:45:50,086 INFO L290 TraceCheckUtils]: 14: Hoare triple {22409#(and (<= 999996 main_~y~0) (= main_~z~0 0))} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {22410#(and (= main_~z~0 0) (<= 999995 main_~y~0))} is VALID [2022-04-28 03:45:50,087 INFO L290 TraceCheckUtils]: 15: Hoare triple {22410#(and (= main_~z~0 0) (<= 999995 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {22411#(and (= main_~z~0 0) (<= 999994 main_~y~0))} is VALID [2022-04-28 03:45:50,088 INFO L290 TraceCheckUtils]: 16: Hoare triple {22411#(and (= main_~z~0 0) (<= 999994 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {22412#(and (= main_~z~0 0) (<= 999993 main_~y~0))} is VALID [2022-04-28 03:45:50,088 INFO L290 TraceCheckUtils]: 17: Hoare triple {22412#(and (= main_~z~0 0) (<= 999993 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {22413#(and (= main_~z~0 0) (<= 999992 main_~y~0))} is VALID [2022-04-28 03:45:50,089 INFO L290 TraceCheckUtils]: 18: Hoare triple {22413#(and (= main_~z~0 0) (<= 999992 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {22414#(and (= main_~z~0 0) (<= 999991 main_~y~0))} is VALID [2022-04-28 03:45:50,089 INFO L290 TraceCheckUtils]: 19: Hoare triple {22414#(and (= main_~z~0 0) (<= 999991 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {22415#(and (= main_~z~0 0) (<= 999990 main_~y~0))} is VALID [2022-04-28 03:45:50,090 INFO L290 TraceCheckUtils]: 20: Hoare triple {22415#(and (= main_~z~0 0) (<= 999990 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {22416#(and (= main_~z~0 0) (<= 999989 main_~y~0))} is VALID [2022-04-28 03:45:50,090 INFO L290 TraceCheckUtils]: 21: Hoare triple {22416#(and (= main_~z~0 0) (<= 999989 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {22417#(and (= main_~z~0 0) (<= 999988 main_~y~0))} is VALID [2022-04-28 03:45:50,091 INFO L290 TraceCheckUtils]: 22: Hoare triple {22417#(and (= main_~z~0 0) (<= 999988 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {22418#(and (= main_~z~0 0) (<= 999987 main_~y~0))} is VALID [2022-04-28 03:45:50,092 INFO L290 TraceCheckUtils]: 23: Hoare triple {22418#(and (= main_~z~0 0) (<= 999987 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {22419#(and (= main_~z~0 0) (<= 999986 main_~y~0))} is VALID [2022-04-28 03:45:50,092 INFO L290 TraceCheckUtils]: 24: Hoare triple {22419#(and (= main_~z~0 0) (<= 999986 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {22420#(and (= main_~z~0 0) (<= 999985 main_~y~0))} is VALID [2022-04-28 03:45:50,093 INFO L290 TraceCheckUtils]: 25: Hoare triple {22420#(and (= main_~z~0 0) (<= 999985 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {22421#(and (= main_~z~0 0) (<= 999984 main_~y~0))} is VALID [2022-04-28 03:45:50,093 INFO L290 TraceCheckUtils]: 26: Hoare triple {22421#(and (= main_~z~0 0) (<= 999984 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {22422#(and (<= 999983 main_~y~0) (= main_~z~0 0))} is VALID [2022-04-28 03:45:50,094 INFO L290 TraceCheckUtils]: 27: Hoare triple {22422#(and (<= 999983 main_~y~0) (= main_~z~0 0))} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {22423#(and (= main_~z~0 0) (<= 999982 main_~y~0))} is VALID [2022-04-28 03:45:50,094 INFO L290 TraceCheckUtils]: 28: Hoare triple {22423#(and (= main_~z~0 0) (<= 999982 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {22424#(and (= main_~z~0 0) (<= 999981 main_~y~0))} is VALID [2022-04-28 03:45:50,095 INFO L290 TraceCheckUtils]: 29: Hoare triple {22424#(and (= main_~z~0 0) (<= 999981 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {22425#(and (= main_~z~0 0) (<= 999980 main_~y~0))} is VALID [2022-04-28 03:45:50,095 INFO L290 TraceCheckUtils]: 30: Hoare triple {22425#(and (= main_~z~0 0) (<= 999980 main_~y~0))} assume !(~y~0 > ~z~0); {22398#false} is VALID [2022-04-28 03:45:50,096 INFO L272 TraceCheckUtils]: 31: Hoare triple {22398#false} call __VERIFIER_assert((if ~x~0 == ~z~0 then 1 else 0)); {22398#false} is VALID [2022-04-28 03:45:50,096 INFO L290 TraceCheckUtils]: 32: Hoare triple {22398#false} ~cond := #in~cond; {22398#false} is VALID [2022-04-28 03:45:50,096 INFO L290 TraceCheckUtils]: 33: Hoare triple {22398#false} assume 0 == ~cond; {22398#false} is VALID [2022-04-28 03:45:50,096 INFO L290 TraceCheckUtils]: 34: Hoare triple {22398#false} assume !false; {22398#false} is VALID [2022-04-28 03:45:50,096 INFO L134 CoverageAnalysis]: Checked inductivity of 212 backedges. 0 proven. 212 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 03:45:50,096 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 03:45:50,096 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [890446106] [2022-04-28 03:45:50,096 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [890446106] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 03:45:50,096 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1486180877] [2022-04-28 03:45:50,097 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:45:50,097 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 03:45:50,097 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 03:45:50,098 INFO L229 MonitoredProcess]: Starting monitored process 27 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 03:45:50,099 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (27)] Waiting until timeout for monitored process [2022-04-28 03:45:50,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:45:50,146 INFO L263 TraceCheckSpWp]: Trace formula consists of 159 conjuncts, 24 conjunts are in the unsatisfiable core [2022-04-28 03:45:50,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:45:50,174 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 03:45:51,309 INFO L272 TraceCheckUtils]: 0: Hoare triple {22397#true} call ULTIMATE.init(); {22397#true} is VALID [2022-04-28 03:45:51,309 INFO L290 TraceCheckUtils]: 1: Hoare triple {22397#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(17, 2);call #Ultimate.allocInit(12, 3); {22397#true} is VALID [2022-04-28 03:45:51,309 INFO L290 TraceCheckUtils]: 2: Hoare triple {22397#true} assume true; {22397#true} is VALID [2022-04-28 03:45:51,309 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {22397#true} {22397#true} #52#return; {22397#true} is VALID [2022-04-28 03:45:51,309 INFO L272 TraceCheckUtils]: 4: Hoare triple {22397#true} call #t~ret9 := main(); {22397#true} is VALID [2022-04-28 03:45:51,309 INFO L290 TraceCheckUtils]: 5: Hoare triple {22397#true} ~x~0 := 0;~y~0 := 50000;~z~0 := 0;~x~0 := 0; {22445#(and (<= main_~z~0 0) (<= 50000 main_~y~0))} is VALID [2022-04-28 03:45:51,310 INFO L290 TraceCheckUtils]: 6: Hoare triple {22445#(and (<= main_~z~0 0) (<= 50000 main_~y~0))} [160] L11-2-->L18-1_primed: Formula: (let ((.cse0 (= v_main_~x~0_1112 v_main_~x~0_1111)) (.cse1 (= |v_main_#t~post4_161| |v_main_#t~post4_160|))) (or (and (< v_main_~x~0_1111 50001) (< v_main_~x~0_1112 v_main_~x~0_1111)) (and .cse0 (not (< v_main_~x~0_1112 50000)) .cse1) (and .cse0 .cse1))) InVars {main_~x~0=v_main_~x~0_1112, main_#t~post4=|v_main_#t~post4_161|} OutVars{main_~x~0=v_main_~x~0_1111, main_#t~post4=|v_main_#t~post4_160|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {22445#(and (<= main_~z~0 0) (<= 50000 main_~y~0))} is VALID [2022-04-28 03:45:51,310 INFO L290 TraceCheckUtils]: 7: Hoare triple {22445#(and (<= main_~z~0 0) (<= 50000 main_~y~0))} [161] L18-1_primed-->L11-2: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {22445#(and (<= main_~z~0 0) (<= 50000 main_~y~0))} is VALID [2022-04-28 03:45:51,311 INFO L290 TraceCheckUtils]: 8: Hoare triple {22445#(and (<= main_~z~0 0) (<= 50000 main_~y~0))} [162] L11-2-->L18-1_primed: Formula: (let ((.cse0 (= v_main_~x~0_1114 v_main_~x~0_1113)) (.cse2 (= |v_main_#t~post6_179| |v_main_#t~post6_178|)) (.cse3 (= v_main_~y~0_1125 v_main_~y~0_1124)) (.cse4 (= |v_main_#t~post5_179| |v_main_#t~post5_178|)) (.cse1 (<= 50000 v_main_~x~0_1114))) (or (and .cse0 (or (not (< v_main_~x~0_1114 1000000)) (not .cse1)) .cse2 .cse3 .cse4) (and .cse0 .cse2 .cse3 .cse4) (and (= (+ v_main_~x~0_1114 v_main_~y~0_1124) (+ v_main_~x~0_1113 v_main_~y~0_1125)) (< v_main_~x~0_1113 1000001) (< v_main_~x~0_1114 v_main_~x~0_1113) .cse1))) InVars {main_~y~0=v_main_~y~0_1125, main_#t~post5=|v_main_#t~post5_179|, main_~x~0=v_main_~x~0_1114, main_#t~post6=|v_main_#t~post6_179|} OutVars{main_~y~0=v_main_~y~0_1124, main_#t~post5=|v_main_#t~post5_178|, main_~x~0=v_main_~x~0_1113, main_#t~post6=|v_main_#t~post6_178|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {22445#(and (<= main_~z~0 0) (<= 50000 main_~y~0))} is VALID [2022-04-28 03:45:51,311 INFO L290 TraceCheckUtils]: 9: Hoare triple {22445#(and (<= main_~z~0 0) (<= 50000 main_~y~0))} [159] L18-1_primed-->L18-1: Formula: (not (< v_main_~x~0_11 1000000)) InVars {main_~x~0=v_main_~x~0_11} OutVars{main_~x~0=v_main_~x~0_11} AuxVars[] AssignedVars[] {22445#(and (<= main_~z~0 0) (<= 50000 main_~y~0))} is VALID [2022-04-28 03:45:51,312 INFO L290 TraceCheckUtils]: 10: Hoare triple {22445#(and (<= main_~z~0 0) (<= 50000 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {22461#(and (<= main_~z~0 0) (<= 49999 main_~y~0))} is VALID [2022-04-28 03:45:51,312 INFO L290 TraceCheckUtils]: 11: Hoare triple {22461#(and (<= main_~z~0 0) (<= 49999 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {22465#(and (<= main_~z~0 0) (<= 49998 main_~y~0))} is VALID [2022-04-28 03:45:51,313 INFO L290 TraceCheckUtils]: 12: Hoare triple {22465#(and (<= main_~z~0 0) (<= 49998 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {22469#(and (<= main_~z~0 0) (<= 49997 main_~y~0))} is VALID [2022-04-28 03:45:51,313 INFO L290 TraceCheckUtils]: 13: Hoare triple {22469#(and (<= main_~z~0 0) (<= 49997 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {22473#(and (<= main_~z~0 0) (<= 49996 main_~y~0))} is VALID [2022-04-28 03:45:51,314 INFO L290 TraceCheckUtils]: 14: Hoare triple {22473#(and (<= main_~z~0 0) (<= 49996 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {22477#(and (<= main_~z~0 0) (<= 49995 main_~y~0))} is VALID [2022-04-28 03:45:51,314 INFO L290 TraceCheckUtils]: 15: Hoare triple {22477#(and (<= main_~z~0 0) (<= 49995 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {22481#(and (<= main_~z~0 0) (<= 49994 main_~y~0))} is VALID [2022-04-28 03:45:51,315 INFO L290 TraceCheckUtils]: 16: Hoare triple {22481#(and (<= main_~z~0 0) (<= 49994 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {22485#(and (<= main_~z~0 0) (<= 49993 main_~y~0))} is VALID [2022-04-28 03:45:51,315 INFO L290 TraceCheckUtils]: 17: Hoare triple {22485#(and (<= main_~z~0 0) (<= 49993 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {22489#(and (<= main_~z~0 0) (<= 49992 main_~y~0))} is VALID [2022-04-28 03:45:51,315 INFO L290 TraceCheckUtils]: 18: Hoare triple {22489#(and (<= main_~z~0 0) (<= 49992 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {22493#(and (<= main_~z~0 0) (<= 49991 main_~y~0))} is VALID [2022-04-28 03:45:51,316 INFO L290 TraceCheckUtils]: 19: Hoare triple {22493#(and (<= main_~z~0 0) (<= 49991 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {22497#(and (<= main_~z~0 0) (<= 49990 main_~y~0))} is VALID [2022-04-28 03:45:51,316 INFO L290 TraceCheckUtils]: 20: Hoare triple {22497#(and (<= main_~z~0 0) (<= 49990 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {22501#(and (<= main_~z~0 0) (<= 49989 main_~y~0))} is VALID [2022-04-28 03:45:51,317 INFO L290 TraceCheckUtils]: 21: Hoare triple {22501#(and (<= main_~z~0 0) (<= 49989 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {22505#(and (<= main_~z~0 0) (<= 49988 main_~y~0))} is VALID [2022-04-28 03:45:51,317 INFO L290 TraceCheckUtils]: 22: Hoare triple {22505#(and (<= main_~z~0 0) (<= 49988 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {22509#(and (<= main_~z~0 0) (<= 49987 main_~y~0))} is VALID [2022-04-28 03:45:51,318 INFO L290 TraceCheckUtils]: 23: Hoare triple {22509#(and (<= main_~z~0 0) (<= 49987 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {22513#(and (<= main_~z~0 0) (<= 49986 main_~y~0))} is VALID [2022-04-28 03:45:51,318 INFO L290 TraceCheckUtils]: 24: Hoare triple {22513#(and (<= main_~z~0 0) (<= 49986 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {22517#(and (<= main_~z~0 0) (<= 49985 main_~y~0))} is VALID [2022-04-28 03:45:51,319 INFO L290 TraceCheckUtils]: 25: Hoare triple {22517#(and (<= main_~z~0 0) (<= 49985 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {22521#(and (<= main_~z~0 0) (<= 49984 main_~y~0))} is VALID [2022-04-28 03:45:51,319 INFO L290 TraceCheckUtils]: 26: Hoare triple {22521#(and (<= main_~z~0 0) (<= 49984 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {22525#(and (<= main_~z~0 0) (<= 49983 main_~y~0))} is VALID [2022-04-28 03:45:51,320 INFO L290 TraceCheckUtils]: 27: Hoare triple {22525#(and (<= main_~z~0 0) (<= 49983 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {22529#(and (<= main_~z~0 0) (<= 49982 main_~y~0))} is VALID [2022-04-28 03:45:51,320 INFO L290 TraceCheckUtils]: 28: Hoare triple {22529#(and (<= main_~z~0 0) (<= 49982 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {22533#(and (<= main_~z~0 0) (<= 49981 main_~y~0))} is VALID [2022-04-28 03:45:51,321 INFO L290 TraceCheckUtils]: 29: Hoare triple {22533#(and (<= main_~z~0 0) (<= 49981 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {22537#(and (<= main_~z~0 0) (<= 49980 main_~y~0))} is VALID [2022-04-28 03:45:51,321 INFO L290 TraceCheckUtils]: 30: Hoare triple {22537#(and (<= main_~z~0 0) (<= 49980 main_~y~0))} assume !(~y~0 > ~z~0); {22398#false} is VALID [2022-04-28 03:45:51,321 INFO L272 TraceCheckUtils]: 31: Hoare triple {22398#false} call __VERIFIER_assert((if ~x~0 == ~z~0 then 1 else 0)); {22398#false} is VALID [2022-04-28 03:45:51,321 INFO L290 TraceCheckUtils]: 32: Hoare triple {22398#false} ~cond := #in~cond; {22398#false} is VALID [2022-04-28 03:45:51,321 INFO L290 TraceCheckUtils]: 33: Hoare triple {22398#false} assume 0 == ~cond; {22398#false} is VALID [2022-04-28 03:45:51,321 INFO L290 TraceCheckUtils]: 34: Hoare triple {22398#false} assume !false; {22398#false} is VALID [2022-04-28 03:45:51,321 INFO L134 CoverageAnalysis]: Checked inductivity of 212 backedges. 0 proven. 210 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-04-28 03:45:51,322 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 03:45:52,603 INFO L290 TraceCheckUtils]: 34: Hoare triple {22398#false} assume !false; {22398#false} is VALID [2022-04-28 03:45:52,604 INFO L290 TraceCheckUtils]: 33: Hoare triple {22398#false} assume 0 == ~cond; {22398#false} is VALID [2022-04-28 03:45:52,604 INFO L290 TraceCheckUtils]: 32: Hoare triple {22398#false} ~cond := #in~cond; {22398#false} is VALID [2022-04-28 03:45:52,604 INFO L272 TraceCheckUtils]: 31: Hoare triple {22398#false} call __VERIFIER_assert((if ~x~0 == ~z~0 then 1 else 0)); {22398#false} is VALID [2022-04-28 03:45:52,604 INFO L290 TraceCheckUtils]: 30: Hoare triple {22565#(< main_~z~0 main_~y~0)} assume !(~y~0 > ~z~0); {22398#false} is VALID [2022-04-28 03:45:52,605 INFO L290 TraceCheckUtils]: 29: Hoare triple {22569#(< (+ main_~z~0 1) main_~y~0)} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {22565#(< main_~z~0 main_~y~0)} is VALID [2022-04-28 03:45:52,605 INFO L290 TraceCheckUtils]: 28: Hoare triple {22573#(< (+ main_~z~0 2) main_~y~0)} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {22569#(< (+ main_~z~0 1) main_~y~0)} is VALID [2022-04-28 03:45:52,606 INFO L290 TraceCheckUtils]: 27: Hoare triple {22577#(< (+ main_~z~0 3) main_~y~0)} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {22573#(< (+ main_~z~0 2) main_~y~0)} is VALID [2022-04-28 03:45:52,606 INFO L290 TraceCheckUtils]: 26: Hoare triple {22581#(< (+ main_~z~0 4) main_~y~0)} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {22577#(< (+ main_~z~0 3) main_~y~0)} is VALID [2022-04-28 03:45:52,607 INFO L290 TraceCheckUtils]: 25: Hoare triple {22585#(< (+ 5 main_~z~0) main_~y~0)} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {22581#(< (+ main_~z~0 4) main_~y~0)} is VALID [2022-04-28 03:45:52,607 INFO L290 TraceCheckUtils]: 24: Hoare triple {22589#(< (+ main_~z~0 6) main_~y~0)} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {22585#(< (+ 5 main_~z~0) main_~y~0)} is VALID [2022-04-28 03:45:52,607 INFO L290 TraceCheckUtils]: 23: Hoare triple {22593#(< (+ 7 main_~z~0) main_~y~0)} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {22589#(< (+ main_~z~0 6) main_~y~0)} is VALID [2022-04-28 03:45:52,608 INFO L290 TraceCheckUtils]: 22: Hoare triple {22597#(< (+ main_~z~0 8) main_~y~0)} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {22593#(< (+ 7 main_~z~0) main_~y~0)} is VALID [2022-04-28 03:45:52,608 INFO L290 TraceCheckUtils]: 21: Hoare triple {22601#(< (+ main_~z~0 9) main_~y~0)} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {22597#(< (+ main_~z~0 8) main_~y~0)} is VALID [2022-04-28 03:45:52,609 INFO L290 TraceCheckUtils]: 20: Hoare triple {22605#(< (+ main_~z~0 10) main_~y~0)} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {22601#(< (+ main_~z~0 9) main_~y~0)} is VALID [2022-04-28 03:45:52,609 INFO L290 TraceCheckUtils]: 19: Hoare triple {22609#(< (+ main_~z~0 11) main_~y~0)} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {22605#(< (+ main_~z~0 10) main_~y~0)} is VALID [2022-04-28 03:45:52,610 INFO L290 TraceCheckUtils]: 18: Hoare triple {22613#(< (+ main_~z~0 12) main_~y~0)} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {22609#(< (+ main_~z~0 11) main_~y~0)} is VALID [2022-04-28 03:45:52,610 INFO L290 TraceCheckUtils]: 17: Hoare triple {22617#(< (+ main_~z~0 13) main_~y~0)} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {22613#(< (+ main_~z~0 12) main_~y~0)} is VALID [2022-04-28 03:45:52,611 INFO L290 TraceCheckUtils]: 16: Hoare triple {22621#(< (+ main_~z~0 14) main_~y~0)} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {22617#(< (+ main_~z~0 13) main_~y~0)} is VALID [2022-04-28 03:45:52,611 INFO L290 TraceCheckUtils]: 15: Hoare triple {22625#(< (+ main_~z~0 15) main_~y~0)} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {22621#(< (+ main_~z~0 14) main_~y~0)} is VALID [2022-04-28 03:45:52,611 INFO L290 TraceCheckUtils]: 14: Hoare triple {22629#(< (+ main_~z~0 16) main_~y~0)} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {22625#(< (+ main_~z~0 15) main_~y~0)} is VALID [2022-04-28 03:45:52,612 INFO L290 TraceCheckUtils]: 13: Hoare triple {22633#(< (+ main_~z~0 17) main_~y~0)} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {22629#(< (+ main_~z~0 16) main_~y~0)} is VALID [2022-04-28 03:45:52,612 INFO L290 TraceCheckUtils]: 12: Hoare triple {22637#(< (+ main_~z~0 18) main_~y~0)} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {22633#(< (+ main_~z~0 17) main_~y~0)} is VALID [2022-04-28 03:45:52,613 INFO L290 TraceCheckUtils]: 11: Hoare triple {22641#(< (+ 19 main_~z~0) main_~y~0)} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {22637#(< (+ main_~z~0 18) main_~y~0)} is VALID [2022-04-28 03:45:52,613 INFO L290 TraceCheckUtils]: 10: Hoare triple {22645#(< (+ main_~z~0 20) main_~y~0)} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {22641#(< (+ 19 main_~z~0) main_~y~0)} is VALID [2022-04-28 03:45:52,614 INFO L290 TraceCheckUtils]: 9: Hoare triple {22645#(< (+ main_~z~0 20) main_~y~0)} [159] L18-1_primed-->L18-1: Formula: (not (< v_main_~x~0_11 1000000)) InVars {main_~x~0=v_main_~x~0_11} OutVars{main_~x~0=v_main_~x~0_11} AuxVars[] AssignedVars[] {22645#(< (+ main_~z~0 20) main_~y~0)} is VALID [2022-04-28 03:45:52,614 INFO L290 TraceCheckUtils]: 8: Hoare triple {22645#(< (+ main_~z~0 20) main_~y~0)} [162] L11-2-->L18-1_primed: Formula: (let ((.cse0 (= v_main_~x~0_1114 v_main_~x~0_1113)) (.cse2 (= |v_main_#t~post6_179| |v_main_#t~post6_178|)) (.cse3 (= v_main_~y~0_1125 v_main_~y~0_1124)) (.cse4 (= |v_main_#t~post5_179| |v_main_#t~post5_178|)) (.cse1 (<= 50000 v_main_~x~0_1114))) (or (and .cse0 (or (not (< v_main_~x~0_1114 1000000)) (not .cse1)) .cse2 .cse3 .cse4) (and .cse0 .cse2 .cse3 .cse4) (and (= (+ v_main_~x~0_1114 v_main_~y~0_1124) (+ v_main_~x~0_1113 v_main_~y~0_1125)) (< v_main_~x~0_1113 1000001) (< v_main_~x~0_1114 v_main_~x~0_1113) .cse1))) InVars {main_~y~0=v_main_~y~0_1125, main_#t~post5=|v_main_#t~post5_179|, main_~x~0=v_main_~x~0_1114, main_#t~post6=|v_main_#t~post6_179|} OutVars{main_~y~0=v_main_~y~0_1124, main_#t~post5=|v_main_#t~post5_178|, main_~x~0=v_main_~x~0_1113, main_#t~post6=|v_main_#t~post6_178|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {22645#(< (+ main_~z~0 20) main_~y~0)} is VALID [2022-04-28 03:45:52,615 INFO L290 TraceCheckUtils]: 7: Hoare triple {22645#(< (+ main_~z~0 20) main_~y~0)} [161] L18-1_primed-->L11-2: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {22645#(< (+ main_~z~0 20) main_~y~0)} is VALID [2022-04-28 03:45:52,615 INFO L290 TraceCheckUtils]: 6: Hoare triple {22645#(< (+ main_~z~0 20) main_~y~0)} [160] L11-2-->L18-1_primed: Formula: (let ((.cse0 (= v_main_~x~0_1112 v_main_~x~0_1111)) (.cse1 (= |v_main_#t~post4_161| |v_main_#t~post4_160|))) (or (and (< v_main_~x~0_1111 50001) (< v_main_~x~0_1112 v_main_~x~0_1111)) (and .cse0 (not (< v_main_~x~0_1112 50000)) .cse1) (and .cse0 .cse1))) InVars {main_~x~0=v_main_~x~0_1112, main_#t~post4=|v_main_#t~post4_161|} OutVars{main_~x~0=v_main_~x~0_1111, main_#t~post4=|v_main_#t~post4_160|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {22645#(< (+ main_~z~0 20) main_~y~0)} is VALID [2022-04-28 03:45:52,615 INFO L290 TraceCheckUtils]: 5: Hoare triple {22397#true} ~x~0 := 0;~y~0 := 50000;~z~0 := 0;~x~0 := 0; {22645#(< (+ main_~z~0 20) main_~y~0)} is VALID [2022-04-28 03:45:52,615 INFO L272 TraceCheckUtils]: 4: Hoare triple {22397#true} call #t~ret9 := main(); {22397#true} is VALID [2022-04-28 03:45:52,615 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {22397#true} {22397#true} #52#return; {22397#true} is VALID [2022-04-28 03:45:52,616 INFO L290 TraceCheckUtils]: 2: Hoare triple {22397#true} assume true; {22397#true} is VALID [2022-04-28 03:45:52,616 INFO L290 TraceCheckUtils]: 1: Hoare triple {22397#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(17, 2);call #Ultimate.allocInit(12, 3); {22397#true} is VALID [2022-04-28 03:45:52,616 INFO L272 TraceCheckUtils]: 0: Hoare triple {22397#true} call ULTIMATE.init(); {22397#true} is VALID [2022-04-28 03:45:52,616 INFO L134 CoverageAnalysis]: Checked inductivity of 212 backedges. 0 proven. 210 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-04-28 03:45:52,616 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1486180877] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 03:45:52,616 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 03:45:52,616 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 23, 23] total 69 [2022-04-28 03:45:54,414 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 03:45:54,414 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [905220632] [2022-04-28 03:45:54,414 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [905220632] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 03:45:54,415 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 03:45:54,415 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [62] imperfect sequences [] total 62 [2022-04-28 03:45:54,415 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [441601281] [2022-04-28 03:45:54,415 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 03:45:54,415 INFO L78 Accepts]: Start accepts. Automaton has has 62 states, 62 states have (on average 1.6451612903225807) internal successors, (102), 61 states have internal predecessors, (102), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 106 [2022-04-28 03:45:54,415 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 03:45:54,415 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 62 states, 62 states have (on average 1.6451612903225807) internal successors, (102), 61 states have internal predecessors, (102), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:45:54,502 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 106 edges. 106 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 03:45:54,502 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 62 states [2022-04-28 03:45:54,502 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 03:45:54,503 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 62 interpolants. [2022-04-28 03:45:54,504 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3847, Invalid=7495, Unknown=0, NotChecked=0, Total=11342 [2022-04-28 03:45:54,504 INFO L87 Difference]: Start difference. First operand 107 states and 110 transitions. Second operand has 62 states, 62 states have (on average 1.6451612903225807) internal successors, (102), 61 states have internal predecessors, (102), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:46:01,221 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:46:01,221 INFO L93 Difference]: Finished difference Result 280 states and 290 transitions. [2022-04-28 03:46:01,221 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2022-04-28 03:46:01,221 INFO L78 Accepts]: Start accepts. Automaton has has 62 states, 62 states have (on average 1.6451612903225807) internal successors, (102), 61 states have internal predecessors, (102), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 106 [2022-04-28 03:46:01,222 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 03:46:01,222 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 62 states, 62 states have (on average 1.6451612903225807) internal successors, (102), 61 states have internal predecessors, (102), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:46:01,222 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 106 transitions. [2022-04-28 03:46:01,222 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 62 states, 62 states have (on average 1.6451612903225807) internal successors, (102), 61 states have internal predecessors, (102), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:46:01,223 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 106 transitions. [2022-04-28 03:46:01,223 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 41 states and 106 transitions. [2022-04-28 03:46:01,308 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 106 edges. 106 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 03:46:01,309 INFO L225 Difference]: With dead ends: 280 [2022-04-28 03:46:01,309 INFO L226 Difference]: Without dead ends: 181 [2022-04-28 03:46:01,311 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 215 GetRequests, 70 SyntacticMatches, 2 SemanticMatches, 143 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5085 ImplicationChecksByTransitivity, 4.5s TimeCoverageRelationStatistics Valid=5637, Invalid=15243, Unknown=0, NotChecked=0, Total=20880 [2022-04-28 03:46:01,311 INFO L413 NwaCegarLoop]: 13 mSDtfsCounter, 48 mSDsluCounter, 207 mSDsCounter, 0 mSdLazyCounter, 3485 mSolverCounterSat, 44 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 48 SdHoareTripleChecker+Valid, 220 SdHoareTripleChecker+Invalid, 3529 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 44 IncrementalHoareTripleChecker+Valid, 3485 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.6s IncrementalHoareTripleChecker+Time [2022-04-28 03:46:01,311 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [48 Valid, 220 Invalid, 3529 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [44 Valid, 3485 Invalid, 0 Unknown, 0 Unchecked, 2.6s Time] [2022-04-28 03:46:01,311 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 181 states. [2022-04-28 03:46:01,751 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 181 to 181. [2022-04-28 03:46:01,751 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 03:46:01,751 INFO L82 GeneralOperation]: Start isEquivalent. First operand 181 states. Second operand has 181 states, 176 states have (on average 1.0284090909090908) internal successors, (181), 176 states have internal predecessors, (181), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:46:01,751 INFO L74 IsIncluded]: Start isIncluded. First operand 181 states. Second operand has 181 states, 176 states have (on average 1.0284090909090908) internal successors, (181), 176 states have internal predecessors, (181), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:46:01,752 INFO L87 Difference]: Start difference. First operand 181 states. Second operand has 181 states, 176 states have (on average 1.0284090909090908) internal successors, (181), 176 states have internal predecessors, (181), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:46:01,753 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:46:01,753 INFO L93 Difference]: Finished difference Result 181 states and 185 transitions. [2022-04-28 03:46:01,753 INFO L276 IsEmpty]: Start isEmpty. Operand 181 states and 185 transitions. [2022-04-28 03:46:01,754 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:46:01,754 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:46:01,754 INFO L74 IsIncluded]: Start isIncluded. First operand has 181 states, 176 states have (on average 1.0284090909090908) internal successors, (181), 176 states have internal predecessors, (181), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 181 states. [2022-04-28 03:46:01,754 INFO L87 Difference]: Start difference. First operand has 181 states, 176 states have (on average 1.0284090909090908) internal successors, (181), 176 states have internal predecessors, (181), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 181 states. [2022-04-28 03:46:01,756 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:46:01,757 INFO L93 Difference]: Finished difference Result 181 states and 185 transitions. [2022-04-28 03:46:01,757 INFO L276 IsEmpty]: Start isEmpty. Operand 181 states and 185 transitions. [2022-04-28 03:46:01,757 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:46:01,757 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:46:01,757 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 03:46:01,757 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 03:46:01,757 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 181 states, 176 states have (on average 1.0284090909090908) internal successors, (181), 176 states have internal predecessors, (181), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:46:01,760 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 181 states to 181 states and 185 transitions. [2022-04-28 03:46:01,760 INFO L78 Accepts]: Start accepts. Automaton has 181 states and 185 transitions. Word has length 106 [2022-04-28 03:46:01,760 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 03:46:01,760 INFO L495 AbstractCegarLoop]: Abstraction has 181 states and 185 transitions. [2022-04-28 03:46:01,760 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 62 states, 62 states have (on average 1.6451612903225807) internal successors, (102), 61 states have internal predecessors, (102), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:46:01,760 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 181 states and 185 transitions. [2022-04-28 03:46:01,967 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 185 edges. 185 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 03:46:01,967 INFO L276 IsEmpty]: Start isEmpty. Operand 181 states and 185 transitions. [2022-04-28 03:46:01,968 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2022-04-28 03:46:01,968 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 03:46:01,968 INFO L195 NwaCegarLoop]: trace histogram [38, 37, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 03:46:01,991 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (27)] Forceful destruction successful, exit code 0 [2022-04-28 03:46:02,168 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 27 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable28 [2022-04-28 03:46:02,169 INFO L420 AbstractCegarLoop]: === Iteration 30 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 03:46:02,169 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 03:46:02,169 INFO L85 PathProgramCache]: Analyzing trace with hash -642491661, now seen corresponding path program 27 times [2022-04-28 03:46:02,169 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 03:46:02,169 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1868889876] [2022-04-28 03:46:02,300 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 1 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 03:46:02,579 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={1=1, 2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 03:46:02,582 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-28 03:46:02,584 INFO L85 PathProgramCache]: Analyzing trace with hash -702468031, now seen corresponding path program 1 times [2022-04-28 03:46:02,584 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 03:46:02,584 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2067673723] [2022-04-28 03:46:02,584 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:46:02,584 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 03:46:02,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:46:03,010 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 03:46:03,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:46:03,021 INFO L290 TraceCheckUtils]: 0: Hoare triple {24103#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(17, 2);call #Ultimate.allocInit(12, 3); {24076#true} is VALID [2022-04-28 03:46:03,021 INFO L290 TraceCheckUtils]: 1: Hoare triple {24076#true} assume true; {24076#true} is VALID [2022-04-28 03:46:03,021 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {24076#true} {24076#true} #52#return; {24076#true} is VALID [2022-04-28 03:46:03,021 INFO L272 TraceCheckUtils]: 0: Hoare triple {24076#true} call ULTIMATE.init(); {24103#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 03:46:03,021 INFO L290 TraceCheckUtils]: 1: Hoare triple {24103#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(17, 2);call #Ultimate.allocInit(12, 3); {24076#true} is VALID [2022-04-28 03:46:03,021 INFO L290 TraceCheckUtils]: 2: Hoare triple {24076#true} assume true; {24076#true} is VALID [2022-04-28 03:46:03,021 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {24076#true} {24076#true} #52#return; {24076#true} is VALID [2022-04-28 03:46:03,021 INFO L272 TraceCheckUtils]: 4: Hoare triple {24076#true} call #t~ret9 := main(); {24076#true} is VALID [2022-04-28 03:46:03,022 INFO L290 TraceCheckUtils]: 5: Hoare triple {24076#true} ~x~0 := 0;~y~0 := 50000;~z~0 := 0;~x~0 := 0; {24081#(and (= main_~z~0 0) (<= 50000 main_~y~0))} is VALID [2022-04-28 03:46:03,022 INFO L290 TraceCheckUtils]: 6: Hoare triple {24081#(and (= main_~z~0 0) (<= 50000 main_~y~0))} [164] L11-2-->L18-1_primed: Formula: (let ((.cse0 (= v_main_~x~0_1185 v_main_~x~0_1184)) (.cse1 (= |v_main_#t~post4_167| |v_main_#t~post4_166|))) (or (and .cse0 .cse1) (and (not (< v_main_~x~0_1185 50000)) .cse0 .cse1) (and (< v_main_~x~0_1185 v_main_~x~0_1184) (< v_main_~x~0_1184 50001)))) InVars {main_~x~0=v_main_~x~0_1185, main_#t~post4=|v_main_#t~post4_167|} OutVars{main_~x~0=v_main_~x~0_1184, main_#t~post4=|v_main_#t~post4_166|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {24081#(and (= main_~z~0 0) (<= 50000 main_~y~0))} is VALID [2022-04-28 03:46:03,023 INFO L290 TraceCheckUtils]: 7: Hoare triple {24081#(and (= main_~z~0 0) (<= 50000 main_~y~0))} [165] L18-1_primed-->L11-2: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {24081#(and (= main_~z~0 0) (<= 50000 main_~y~0))} is VALID [2022-04-28 03:46:03,023 INFO L290 TraceCheckUtils]: 8: Hoare triple {24081#(and (= main_~z~0 0) (<= 50000 main_~y~0))} [166] L11-2-->L18-1_primed: Formula: (let ((.cse1 (<= 50000 v_main_~x~0_1187)) (.cse0 (= |v_main_#t~post5_186| |v_main_#t~post5_185|)) (.cse2 (= v_main_~x~0_1187 v_main_~x~0_1186)) (.cse3 (= |v_main_#t~post6_186| |v_main_#t~post6_185|))) (or (and (= v_main_~y~0_1209 v_main_~y~0_1210) .cse0 (or (not (< v_main_~x~0_1187 1000000)) (not .cse1)) .cse2 .cse3) (let ((.cse4 (+ v_main_~x~0_1187 v_main_~y~0_1209))) (and .cse1 (< .cse4 (+ 1000001 v_main_~y~0_1210)) (= (+ v_main_~x~0_1186 v_main_~y~0_1210) .cse4) (< v_main_~y~0_1210 v_main_~y~0_1209))) (and (= v_main_~y~0_1210 v_main_~y~0_1209) .cse0 .cse2 .cse3))) InVars {main_~y~0=v_main_~y~0_1210, main_#t~post5=|v_main_#t~post5_186|, main_~x~0=v_main_~x~0_1187, main_#t~post6=|v_main_#t~post6_186|} OutVars{main_~y~0=v_main_~y~0_1209, main_#t~post5=|v_main_#t~post5_185|, main_~x~0=v_main_~x~0_1186, main_#t~post6=|v_main_#t~post6_185|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {24082#(and (= main_~z~0 0) (<= 21 main_~y~0))} is VALID [2022-04-28 03:46:03,024 INFO L290 TraceCheckUtils]: 9: Hoare triple {24082#(and (= main_~z~0 0) (<= 21 main_~y~0))} [163] L18-1_primed-->L18-1: Formula: (not (< v_main_~x~0_11 1000000)) InVars {main_~x~0=v_main_~x~0_11} OutVars{main_~x~0=v_main_~x~0_11} AuxVars[] AssignedVars[] {24082#(and (= main_~z~0 0) (<= 21 main_~y~0))} is VALID [2022-04-28 03:46:03,024 INFO L290 TraceCheckUtils]: 10: Hoare triple {24082#(and (= main_~z~0 0) (<= 21 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {24083#(and (= main_~z~0 0) (<= 20 main_~y~0))} is VALID [2022-04-28 03:46:03,025 INFO L290 TraceCheckUtils]: 11: Hoare triple {24083#(and (= main_~z~0 0) (<= 20 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {24084#(and (= main_~z~0 0) (<= 19 main_~y~0))} is VALID [2022-04-28 03:46:03,025 INFO L290 TraceCheckUtils]: 12: Hoare triple {24084#(and (= main_~z~0 0) (<= 19 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {24085#(and (= main_~z~0 0) (<= 18 main_~y~0))} is VALID [2022-04-28 03:46:03,026 INFO L290 TraceCheckUtils]: 13: Hoare triple {24085#(and (= main_~z~0 0) (<= 18 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {24086#(and (= main_~z~0 0) (<= 17 main_~y~0))} is VALID [2022-04-28 03:46:03,026 INFO L290 TraceCheckUtils]: 14: Hoare triple {24086#(and (= main_~z~0 0) (<= 17 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {24087#(and (= main_~z~0 0) (<= 16 main_~y~0))} is VALID [2022-04-28 03:46:03,027 INFO L290 TraceCheckUtils]: 15: Hoare triple {24087#(and (= main_~z~0 0) (<= 16 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {24088#(and (= main_~z~0 0) (<= 15 main_~y~0))} is VALID [2022-04-28 03:46:03,027 INFO L290 TraceCheckUtils]: 16: Hoare triple {24088#(and (= main_~z~0 0) (<= 15 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {24089#(and (= main_~z~0 0) (<= 14 main_~y~0))} is VALID [2022-04-28 03:46:03,028 INFO L290 TraceCheckUtils]: 17: Hoare triple {24089#(and (= main_~z~0 0) (<= 14 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {24090#(and (= main_~z~0 0) (<= 13 main_~y~0))} is VALID [2022-04-28 03:46:03,028 INFO L290 TraceCheckUtils]: 18: Hoare triple {24090#(and (= main_~z~0 0) (<= 13 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {24091#(and (= main_~z~0 0) (<= 12 main_~y~0))} is VALID [2022-04-28 03:46:03,029 INFO L290 TraceCheckUtils]: 19: Hoare triple {24091#(and (= main_~z~0 0) (<= 12 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {24092#(and (= main_~z~0 0) (<= 11 main_~y~0))} is VALID [2022-04-28 03:46:03,029 INFO L290 TraceCheckUtils]: 20: Hoare triple {24092#(and (= main_~z~0 0) (<= 11 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {24093#(and (= main_~z~0 0) (<= 10 main_~y~0))} is VALID [2022-04-28 03:46:03,030 INFO L290 TraceCheckUtils]: 21: Hoare triple {24093#(and (= main_~z~0 0) (<= 10 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {24094#(and (= main_~z~0 0) (<= 9 main_~y~0))} is VALID [2022-04-28 03:46:03,030 INFO L290 TraceCheckUtils]: 22: Hoare triple {24094#(and (= main_~z~0 0) (<= 9 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {24095#(and (= main_~z~0 0) (<= 8 main_~y~0))} is VALID [2022-04-28 03:46:03,031 INFO L290 TraceCheckUtils]: 23: Hoare triple {24095#(and (= main_~z~0 0) (<= 8 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {24096#(and (= main_~z~0 0) (<= 7 main_~y~0))} is VALID [2022-04-28 03:46:03,031 INFO L290 TraceCheckUtils]: 24: Hoare triple {24096#(and (= main_~z~0 0) (<= 7 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {24097#(and (= main_~z~0 0) (<= 6 main_~y~0))} is VALID [2022-04-28 03:46:03,032 INFO L290 TraceCheckUtils]: 25: Hoare triple {24097#(and (= main_~z~0 0) (<= 6 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {24098#(and (= main_~z~0 0) (<= 5 main_~y~0))} is VALID [2022-04-28 03:46:03,033 INFO L290 TraceCheckUtils]: 26: Hoare triple {24098#(and (= main_~z~0 0) (<= 5 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {24099#(and (= main_~z~0 0) (<= 4 main_~y~0))} is VALID [2022-04-28 03:46:03,033 INFO L290 TraceCheckUtils]: 27: Hoare triple {24099#(and (= main_~z~0 0) (<= 4 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {24100#(and (= main_~z~0 0) (<= 3 main_~y~0))} is VALID [2022-04-28 03:46:03,034 INFO L290 TraceCheckUtils]: 28: Hoare triple {24100#(and (= main_~z~0 0) (<= 3 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {24101#(and (= main_~z~0 0) (<= 2 main_~y~0))} is VALID [2022-04-28 03:46:03,034 INFO L290 TraceCheckUtils]: 29: Hoare triple {24101#(and (= main_~z~0 0) (<= 2 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {24102#(and (= main_~z~0 0) (<= 1 main_~y~0))} is VALID [2022-04-28 03:46:03,034 INFO L290 TraceCheckUtils]: 30: Hoare triple {24102#(and (= main_~z~0 0) (<= 1 main_~y~0))} assume !(~y~0 > ~z~0); {24077#false} is VALID [2022-04-28 03:46:03,034 INFO L272 TraceCheckUtils]: 31: Hoare triple {24077#false} call __VERIFIER_assert((if ~x~0 == ~z~0 then 1 else 0)); {24077#false} is VALID [2022-04-28 03:46:03,035 INFO L290 TraceCheckUtils]: 32: Hoare triple {24077#false} ~cond := #in~cond; {24077#false} is VALID [2022-04-28 03:46:03,035 INFO L290 TraceCheckUtils]: 33: Hoare triple {24077#false} assume 0 == ~cond; {24077#false} is VALID [2022-04-28 03:46:03,035 INFO L290 TraceCheckUtils]: 34: Hoare triple {24077#false} assume !false; {24077#false} is VALID [2022-04-28 03:46:03,035 INFO L134 CoverageAnalysis]: Checked inductivity of 212 backedges. 0 proven. 211 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-04-28 03:46:03,035 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 03:46:03,035 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2067673723] [2022-04-28 03:46:03,035 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2067673723] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 03:46:03,035 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [828355224] [2022-04-28 03:46:03,035 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:46:03,035 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 03:46:03,036 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 03:46:03,036 INFO L229 MonitoredProcess]: Starting monitored process 28 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 03:46:03,037 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (28)] Waiting until timeout for monitored process [2022-04-28 03:46:03,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:46:03,079 INFO L263 TraceCheckSpWp]: Trace formula consists of 159 conjuncts, 24 conjunts are in the unsatisfiable core [2022-04-28 03:46:03,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:46:03,094 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 03:46:04,022 INFO L272 TraceCheckUtils]: 0: Hoare triple {24076#true} call ULTIMATE.init(); {24076#true} is VALID [2022-04-28 03:46:04,022 INFO L290 TraceCheckUtils]: 1: Hoare triple {24076#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(17, 2);call #Ultimate.allocInit(12, 3); {24076#true} is VALID [2022-04-28 03:46:04,023 INFO L290 TraceCheckUtils]: 2: Hoare triple {24076#true} assume true; {24076#true} is VALID [2022-04-28 03:46:04,023 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {24076#true} {24076#true} #52#return; {24076#true} is VALID [2022-04-28 03:46:04,023 INFO L272 TraceCheckUtils]: 4: Hoare triple {24076#true} call #t~ret9 := main(); {24076#true} is VALID [2022-04-28 03:46:04,023 INFO L290 TraceCheckUtils]: 5: Hoare triple {24076#true} ~x~0 := 0;~y~0 := 50000;~z~0 := 0;~x~0 := 0; {24122#(and (<= main_~z~0 0) (<= 50000 main_~y~0))} is VALID [2022-04-28 03:46:04,023 INFO L290 TraceCheckUtils]: 6: Hoare triple {24122#(and (<= main_~z~0 0) (<= 50000 main_~y~0))} [164] L11-2-->L18-1_primed: Formula: (let ((.cse0 (= v_main_~x~0_1185 v_main_~x~0_1184)) (.cse1 (= |v_main_#t~post4_167| |v_main_#t~post4_166|))) (or (and .cse0 .cse1) (and (not (< v_main_~x~0_1185 50000)) .cse0 .cse1) (and (< v_main_~x~0_1185 v_main_~x~0_1184) (< v_main_~x~0_1184 50001)))) InVars {main_~x~0=v_main_~x~0_1185, main_#t~post4=|v_main_#t~post4_167|} OutVars{main_~x~0=v_main_~x~0_1184, main_#t~post4=|v_main_#t~post4_166|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {24122#(and (<= main_~z~0 0) (<= 50000 main_~y~0))} is VALID [2022-04-28 03:46:04,024 INFO L290 TraceCheckUtils]: 7: Hoare triple {24122#(and (<= main_~z~0 0) (<= 50000 main_~y~0))} [165] L18-1_primed-->L11-2: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {24122#(and (<= main_~z~0 0) (<= 50000 main_~y~0))} is VALID [2022-04-28 03:46:04,025 INFO L290 TraceCheckUtils]: 8: Hoare triple {24122#(and (<= main_~z~0 0) (<= 50000 main_~y~0))} [166] L11-2-->L18-1_primed: Formula: (let ((.cse1 (<= 50000 v_main_~x~0_1187)) (.cse0 (= |v_main_#t~post5_186| |v_main_#t~post5_185|)) (.cse2 (= v_main_~x~0_1187 v_main_~x~0_1186)) (.cse3 (= |v_main_#t~post6_186| |v_main_#t~post6_185|))) (or (and (= v_main_~y~0_1209 v_main_~y~0_1210) .cse0 (or (not (< v_main_~x~0_1187 1000000)) (not .cse1)) .cse2 .cse3) (let ((.cse4 (+ v_main_~x~0_1187 v_main_~y~0_1209))) (and .cse1 (< .cse4 (+ 1000001 v_main_~y~0_1210)) (= (+ v_main_~x~0_1186 v_main_~y~0_1210) .cse4) (< v_main_~y~0_1210 v_main_~y~0_1209))) (and (= v_main_~y~0_1210 v_main_~y~0_1209) .cse0 .cse2 .cse3))) InVars {main_~y~0=v_main_~y~0_1210, main_#t~post5=|v_main_#t~post5_186|, main_~x~0=v_main_~x~0_1187, main_#t~post6=|v_main_#t~post6_186|} OutVars{main_~y~0=v_main_~y~0_1209, main_#t~post5=|v_main_#t~post5_185|, main_~x~0=v_main_~x~0_1186, main_#t~post6=|v_main_#t~post6_185|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {24122#(and (<= main_~z~0 0) (<= 50000 main_~y~0))} is VALID [2022-04-28 03:46:04,025 INFO L290 TraceCheckUtils]: 9: Hoare triple {24122#(and (<= main_~z~0 0) (<= 50000 main_~y~0))} [163] L18-1_primed-->L18-1: Formula: (not (< v_main_~x~0_11 1000000)) InVars {main_~x~0=v_main_~x~0_11} OutVars{main_~x~0=v_main_~x~0_11} AuxVars[] AssignedVars[] {24122#(and (<= main_~z~0 0) (<= 50000 main_~y~0))} is VALID [2022-04-28 03:46:04,025 INFO L290 TraceCheckUtils]: 10: Hoare triple {24122#(and (<= main_~z~0 0) (<= 50000 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {24138#(and (<= main_~z~0 0) (<= 49999 main_~y~0))} is VALID [2022-04-28 03:46:04,026 INFO L290 TraceCheckUtils]: 11: Hoare triple {24138#(and (<= main_~z~0 0) (<= 49999 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {24142#(and (<= main_~z~0 0) (<= 49998 main_~y~0))} is VALID [2022-04-28 03:46:04,026 INFO L290 TraceCheckUtils]: 12: Hoare triple {24142#(and (<= main_~z~0 0) (<= 49998 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {24146#(and (<= main_~z~0 0) (<= 49997 main_~y~0))} is VALID [2022-04-28 03:46:04,027 INFO L290 TraceCheckUtils]: 13: Hoare triple {24146#(and (<= main_~z~0 0) (<= 49997 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {24150#(and (<= main_~z~0 0) (<= 49996 main_~y~0))} is VALID [2022-04-28 03:46:04,027 INFO L290 TraceCheckUtils]: 14: Hoare triple {24150#(and (<= main_~z~0 0) (<= 49996 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {24154#(and (<= main_~z~0 0) (<= 49995 main_~y~0))} is VALID [2022-04-28 03:46:04,028 INFO L290 TraceCheckUtils]: 15: Hoare triple {24154#(and (<= main_~z~0 0) (<= 49995 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {24158#(and (<= main_~z~0 0) (<= 49994 main_~y~0))} is VALID [2022-04-28 03:46:04,028 INFO L290 TraceCheckUtils]: 16: Hoare triple {24158#(and (<= main_~z~0 0) (<= 49994 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {24162#(and (<= main_~z~0 0) (<= 49993 main_~y~0))} is VALID [2022-04-28 03:46:04,029 INFO L290 TraceCheckUtils]: 17: Hoare triple {24162#(and (<= main_~z~0 0) (<= 49993 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {24166#(and (<= main_~z~0 0) (<= 49992 main_~y~0))} is VALID [2022-04-28 03:46:04,029 INFO L290 TraceCheckUtils]: 18: Hoare triple {24166#(and (<= main_~z~0 0) (<= 49992 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {24170#(and (<= main_~z~0 0) (<= 49991 main_~y~0))} is VALID [2022-04-28 03:46:04,030 INFO L290 TraceCheckUtils]: 19: Hoare triple {24170#(and (<= main_~z~0 0) (<= 49991 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {24174#(and (<= main_~z~0 0) (<= 49990 main_~y~0))} is VALID [2022-04-28 03:46:04,030 INFO L290 TraceCheckUtils]: 20: Hoare triple {24174#(and (<= main_~z~0 0) (<= 49990 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {24178#(and (<= main_~z~0 0) (<= 49989 main_~y~0))} is VALID [2022-04-28 03:46:04,031 INFO L290 TraceCheckUtils]: 21: Hoare triple {24178#(and (<= main_~z~0 0) (<= 49989 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {24182#(and (<= main_~z~0 0) (<= 49988 main_~y~0))} is VALID [2022-04-28 03:46:04,031 INFO L290 TraceCheckUtils]: 22: Hoare triple {24182#(and (<= main_~z~0 0) (<= 49988 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {24186#(and (<= main_~z~0 0) (<= 49987 main_~y~0))} is VALID [2022-04-28 03:46:04,032 INFO L290 TraceCheckUtils]: 23: Hoare triple {24186#(and (<= main_~z~0 0) (<= 49987 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {24190#(and (<= main_~z~0 0) (<= 49986 main_~y~0))} is VALID [2022-04-28 03:46:04,032 INFO L290 TraceCheckUtils]: 24: Hoare triple {24190#(and (<= main_~z~0 0) (<= 49986 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {24194#(and (<= main_~z~0 0) (<= 49985 main_~y~0))} is VALID [2022-04-28 03:46:04,033 INFO L290 TraceCheckUtils]: 25: Hoare triple {24194#(and (<= main_~z~0 0) (<= 49985 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {24198#(and (<= main_~z~0 0) (<= 49984 main_~y~0))} is VALID [2022-04-28 03:46:04,033 INFO L290 TraceCheckUtils]: 26: Hoare triple {24198#(and (<= main_~z~0 0) (<= 49984 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {24202#(and (<= main_~z~0 0) (<= 49983 main_~y~0))} is VALID [2022-04-28 03:46:04,034 INFO L290 TraceCheckUtils]: 27: Hoare triple {24202#(and (<= main_~z~0 0) (<= 49983 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {24206#(and (<= main_~z~0 0) (<= 49982 main_~y~0))} is VALID [2022-04-28 03:46:04,034 INFO L290 TraceCheckUtils]: 28: Hoare triple {24206#(and (<= main_~z~0 0) (<= 49982 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {24210#(and (<= main_~z~0 0) (<= 49981 main_~y~0))} is VALID [2022-04-28 03:46:04,034 INFO L290 TraceCheckUtils]: 29: Hoare triple {24210#(and (<= main_~z~0 0) (<= 49981 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {24214#(and (<= main_~z~0 0) (<= 49980 main_~y~0))} is VALID [2022-04-28 03:46:04,035 INFO L290 TraceCheckUtils]: 30: Hoare triple {24214#(and (<= main_~z~0 0) (<= 49980 main_~y~0))} assume !(~y~0 > ~z~0); {24077#false} is VALID [2022-04-28 03:46:04,035 INFO L272 TraceCheckUtils]: 31: Hoare triple {24077#false} call __VERIFIER_assert((if ~x~0 == ~z~0 then 1 else 0)); {24077#false} is VALID [2022-04-28 03:46:04,035 INFO L290 TraceCheckUtils]: 32: Hoare triple {24077#false} ~cond := #in~cond; {24077#false} is VALID [2022-04-28 03:46:04,035 INFO L290 TraceCheckUtils]: 33: Hoare triple {24077#false} assume 0 == ~cond; {24077#false} is VALID [2022-04-28 03:46:04,035 INFO L290 TraceCheckUtils]: 34: Hoare triple {24077#false} assume !false; {24077#false} is VALID [2022-04-28 03:46:04,035 INFO L134 CoverageAnalysis]: Checked inductivity of 212 backedges. 0 proven. 210 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-04-28 03:46:04,035 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 03:46:05,118 INFO L290 TraceCheckUtils]: 34: Hoare triple {24077#false} assume !false; {24077#false} is VALID [2022-04-28 03:46:05,118 INFO L290 TraceCheckUtils]: 33: Hoare triple {24077#false} assume 0 == ~cond; {24077#false} is VALID [2022-04-28 03:46:05,118 INFO L290 TraceCheckUtils]: 32: Hoare triple {24077#false} ~cond := #in~cond; {24077#false} is VALID [2022-04-28 03:46:05,118 INFO L272 TraceCheckUtils]: 31: Hoare triple {24077#false} call __VERIFIER_assert((if ~x~0 == ~z~0 then 1 else 0)); {24077#false} is VALID [2022-04-28 03:46:05,118 INFO L290 TraceCheckUtils]: 30: Hoare triple {24242#(< main_~z~0 main_~y~0)} assume !(~y~0 > ~z~0); {24077#false} is VALID [2022-04-28 03:46:05,119 INFO L290 TraceCheckUtils]: 29: Hoare triple {24246#(< (+ main_~z~0 1) main_~y~0)} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {24242#(< main_~z~0 main_~y~0)} is VALID [2022-04-28 03:46:05,119 INFO L290 TraceCheckUtils]: 28: Hoare triple {24250#(< (+ main_~z~0 2) main_~y~0)} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {24246#(< (+ main_~z~0 1) main_~y~0)} is VALID [2022-04-28 03:46:05,120 INFO L290 TraceCheckUtils]: 27: Hoare triple {24254#(< (+ main_~z~0 3) main_~y~0)} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {24250#(< (+ main_~z~0 2) main_~y~0)} is VALID [2022-04-28 03:46:05,120 INFO L290 TraceCheckUtils]: 26: Hoare triple {24258#(< (+ main_~z~0 4) main_~y~0)} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {24254#(< (+ main_~z~0 3) main_~y~0)} is VALID [2022-04-28 03:46:05,121 INFO L290 TraceCheckUtils]: 25: Hoare triple {24262#(< (+ 5 main_~z~0) main_~y~0)} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {24258#(< (+ main_~z~0 4) main_~y~0)} is VALID [2022-04-28 03:46:05,121 INFO L290 TraceCheckUtils]: 24: Hoare triple {24266#(< (+ main_~z~0 6) main_~y~0)} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {24262#(< (+ 5 main_~z~0) main_~y~0)} is VALID [2022-04-28 03:46:05,122 INFO L290 TraceCheckUtils]: 23: Hoare triple {24270#(< (+ 7 main_~z~0) main_~y~0)} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {24266#(< (+ main_~z~0 6) main_~y~0)} is VALID [2022-04-28 03:46:05,122 INFO L290 TraceCheckUtils]: 22: Hoare triple {24274#(< (+ main_~z~0 8) main_~y~0)} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {24270#(< (+ 7 main_~z~0) main_~y~0)} is VALID [2022-04-28 03:46:05,123 INFO L290 TraceCheckUtils]: 21: Hoare triple {24278#(< (+ main_~z~0 9) main_~y~0)} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {24274#(< (+ main_~z~0 8) main_~y~0)} is VALID [2022-04-28 03:46:05,123 INFO L290 TraceCheckUtils]: 20: Hoare triple {24282#(< (+ main_~z~0 10) main_~y~0)} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {24278#(< (+ main_~z~0 9) main_~y~0)} is VALID [2022-04-28 03:46:05,123 INFO L290 TraceCheckUtils]: 19: Hoare triple {24286#(< (+ main_~z~0 11) main_~y~0)} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {24282#(< (+ main_~z~0 10) main_~y~0)} is VALID [2022-04-28 03:46:05,124 INFO L290 TraceCheckUtils]: 18: Hoare triple {24290#(< (+ main_~z~0 12) main_~y~0)} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {24286#(< (+ main_~z~0 11) main_~y~0)} is VALID [2022-04-28 03:46:05,124 INFO L290 TraceCheckUtils]: 17: Hoare triple {24294#(< (+ main_~z~0 13) main_~y~0)} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {24290#(< (+ main_~z~0 12) main_~y~0)} is VALID [2022-04-28 03:46:05,125 INFO L290 TraceCheckUtils]: 16: Hoare triple {24298#(< (+ main_~z~0 14) main_~y~0)} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {24294#(< (+ main_~z~0 13) main_~y~0)} is VALID [2022-04-28 03:46:05,125 INFO L290 TraceCheckUtils]: 15: Hoare triple {24302#(< (+ main_~z~0 15) main_~y~0)} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {24298#(< (+ main_~z~0 14) main_~y~0)} is VALID [2022-04-28 03:46:05,126 INFO L290 TraceCheckUtils]: 14: Hoare triple {24306#(< (+ main_~z~0 16) main_~y~0)} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {24302#(< (+ main_~z~0 15) main_~y~0)} is VALID [2022-04-28 03:46:05,126 INFO L290 TraceCheckUtils]: 13: Hoare triple {24310#(< (+ main_~z~0 17) main_~y~0)} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {24306#(< (+ main_~z~0 16) main_~y~0)} is VALID [2022-04-28 03:46:05,127 INFO L290 TraceCheckUtils]: 12: Hoare triple {24314#(< (+ main_~z~0 18) main_~y~0)} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {24310#(< (+ main_~z~0 17) main_~y~0)} is VALID [2022-04-28 03:46:05,127 INFO L290 TraceCheckUtils]: 11: Hoare triple {24318#(< (+ 19 main_~z~0) main_~y~0)} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {24314#(< (+ main_~z~0 18) main_~y~0)} is VALID [2022-04-28 03:46:05,128 INFO L290 TraceCheckUtils]: 10: Hoare triple {24322#(< (+ main_~z~0 20) main_~y~0)} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {24318#(< (+ 19 main_~z~0) main_~y~0)} is VALID [2022-04-28 03:46:05,128 INFO L290 TraceCheckUtils]: 9: Hoare triple {24322#(< (+ main_~z~0 20) main_~y~0)} [163] L18-1_primed-->L18-1: Formula: (not (< v_main_~x~0_11 1000000)) InVars {main_~x~0=v_main_~x~0_11} OutVars{main_~x~0=v_main_~x~0_11} AuxVars[] AssignedVars[] {24322#(< (+ main_~z~0 20) main_~y~0)} is VALID [2022-04-28 03:46:05,129 INFO L290 TraceCheckUtils]: 8: Hoare triple {24322#(< (+ main_~z~0 20) main_~y~0)} [166] L11-2-->L18-1_primed: Formula: (let ((.cse1 (<= 50000 v_main_~x~0_1187)) (.cse0 (= |v_main_#t~post5_186| |v_main_#t~post5_185|)) (.cse2 (= v_main_~x~0_1187 v_main_~x~0_1186)) (.cse3 (= |v_main_#t~post6_186| |v_main_#t~post6_185|))) (or (and (= v_main_~y~0_1209 v_main_~y~0_1210) .cse0 (or (not (< v_main_~x~0_1187 1000000)) (not .cse1)) .cse2 .cse3) (let ((.cse4 (+ v_main_~x~0_1187 v_main_~y~0_1209))) (and .cse1 (< .cse4 (+ 1000001 v_main_~y~0_1210)) (= (+ v_main_~x~0_1186 v_main_~y~0_1210) .cse4) (< v_main_~y~0_1210 v_main_~y~0_1209))) (and (= v_main_~y~0_1210 v_main_~y~0_1209) .cse0 .cse2 .cse3))) InVars {main_~y~0=v_main_~y~0_1210, main_#t~post5=|v_main_#t~post5_186|, main_~x~0=v_main_~x~0_1187, main_#t~post6=|v_main_#t~post6_186|} OutVars{main_~y~0=v_main_~y~0_1209, main_#t~post5=|v_main_#t~post5_185|, main_~x~0=v_main_~x~0_1186, main_#t~post6=|v_main_#t~post6_185|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {24322#(< (+ main_~z~0 20) main_~y~0)} is VALID [2022-04-28 03:46:05,131 INFO L290 TraceCheckUtils]: 7: Hoare triple {24322#(< (+ main_~z~0 20) main_~y~0)} [165] L18-1_primed-->L11-2: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {24322#(< (+ main_~z~0 20) main_~y~0)} is VALID [2022-04-28 03:46:05,132 INFO L290 TraceCheckUtils]: 6: Hoare triple {24322#(< (+ main_~z~0 20) main_~y~0)} [164] L11-2-->L18-1_primed: Formula: (let ((.cse0 (= v_main_~x~0_1185 v_main_~x~0_1184)) (.cse1 (= |v_main_#t~post4_167| |v_main_#t~post4_166|))) (or (and .cse0 .cse1) (and (not (< v_main_~x~0_1185 50000)) .cse0 .cse1) (and (< v_main_~x~0_1185 v_main_~x~0_1184) (< v_main_~x~0_1184 50001)))) InVars {main_~x~0=v_main_~x~0_1185, main_#t~post4=|v_main_#t~post4_167|} OutVars{main_~x~0=v_main_~x~0_1184, main_#t~post4=|v_main_#t~post4_166|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {24322#(< (+ main_~z~0 20) main_~y~0)} is VALID [2022-04-28 03:46:05,132 INFO L290 TraceCheckUtils]: 5: Hoare triple {24076#true} ~x~0 := 0;~y~0 := 50000;~z~0 := 0;~x~0 := 0; {24322#(< (+ main_~z~0 20) main_~y~0)} is VALID [2022-04-28 03:46:05,132 INFO L272 TraceCheckUtils]: 4: Hoare triple {24076#true} call #t~ret9 := main(); {24076#true} is VALID [2022-04-28 03:46:05,132 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {24076#true} {24076#true} #52#return; {24076#true} is VALID [2022-04-28 03:46:05,132 INFO L290 TraceCheckUtils]: 2: Hoare triple {24076#true} assume true; {24076#true} is VALID [2022-04-28 03:46:05,132 INFO L290 TraceCheckUtils]: 1: Hoare triple {24076#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(17, 2);call #Ultimate.allocInit(12, 3); {24076#true} is VALID [2022-04-28 03:46:05,133 INFO L272 TraceCheckUtils]: 0: Hoare triple {24076#true} call ULTIMATE.init(); {24076#true} is VALID [2022-04-28 03:46:05,133 INFO L134 CoverageAnalysis]: Checked inductivity of 212 backedges. 0 proven. 210 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-04-28 03:46:05,133 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [828355224] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 03:46:05,133 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 03:46:05,133 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 23, 23] total 67 [2022-04-28 03:46:06,643 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 03:46:06,644 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1868889876] [2022-04-28 03:46:06,644 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1868889876] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 03:46:06,644 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 03:46:06,644 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [64] imperfect sequences [] total 64 [2022-04-28 03:46:06,644 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1064931632] [2022-04-28 03:46:06,644 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 03:46:06,644 INFO L78 Accepts]: Start accepts. Automaton has has 64 states, 64 states have (on average 1.625) internal successors, (104), 63 states have internal predecessors, (104), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 108 [2022-04-28 03:46:06,645 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 03:46:06,645 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 64 states, 64 states have (on average 1.625) internal successors, (104), 63 states have internal predecessors, (104), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:46:06,735 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 108 edges. 108 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 03:46:06,736 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 64 states [2022-04-28 03:46:06,736 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 03:46:06,736 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 64 interpolants. [2022-04-28 03:46:06,737 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=4108, Invalid=7022, Unknown=0, NotChecked=0, Total=11130 [2022-04-28 03:46:06,738 INFO L87 Difference]: Start difference. First operand 181 states and 185 transitions. Second operand has 64 states, 64 states have (on average 1.625) internal successors, (104), 63 states have internal predecessors, (104), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:46:13,669 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:46:13,670 INFO L93 Difference]: Finished difference Result 288 states and 303 transitions. [2022-04-28 03:46:13,670 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 64 states. [2022-04-28 03:46:13,670 INFO L78 Accepts]: Start accepts. Automaton has has 64 states, 64 states have (on average 1.625) internal successors, (104), 63 states have internal predecessors, (104), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 108 [2022-04-28 03:46:13,670 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 03:46:13,671 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 64 states, 64 states have (on average 1.625) internal successors, (104), 63 states have internal predecessors, (104), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:46:13,672 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 134 transitions. [2022-04-28 03:46:13,672 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 64 states, 64 states have (on average 1.625) internal successors, (104), 63 states have internal predecessors, (104), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:46:13,673 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 134 transitions. [2022-04-28 03:46:13,673 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 64 states and 134 transitions. [2022-04-28 03:46:13,802 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 134 edges. 134 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 03:46:13,804 INFO L225 Difference]: With dead ends: 288 [2022-04-28 03:46:13,805 INFO L226 Difference]: Without dead ends: 189 [2022-04-28 03:46:13,807 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 238 GetRequests, 71 SyntacticMatches, 2 SemanticMatches, 165 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8758 ImplicationChecksByTransitivity, 4.2s TimeCoverageRelationStatistics Valid=8517, Invalid=19205, Unknown=0, NotChecked=0, Total=27722 [2022-04-28 03:46:13,807 INFO L413 NwaCegarLoop]: 12 mSDtfsCounter, 212 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 3051 mSolverCounterSat, 277 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 212 SdHoareTripleChecker+Valid, 34 SdHoareTripleChecker+Invalid, 3328 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 277 IncrementalHoareTripleChecker+Valid, 3051 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.5s IncrementalHoareTripleChecker+Time [2022-04-28 03:46:13,808 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [212 Valid, 34 Invalid, 3328 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [277 Valid, 3051 Invalid, 0 Unknown, 0 Unchecked, 2.5s Time] [2022-04-28 03:46:13,809 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 189 states. [2022-04-28 03:46:14,045 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 189 to 115. [2022-04-28 03:46:14,045 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 03:46:14,045 INFO L82 GeneralOperation]: Start isEquivalent. First operand 189 states. Second operand has 115 states, 110 states have (on average 1.0363636363636364) internal successors, (114), 110 states have internal predecessors, (114), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:46:14,046 INFO L74 IsIncluded]: Start isIncluded. First operand 189 states. Second operand has 115 states, 110 states have (on average 1.0363636363636364) internal successors, (114), 110 states have internal predecessors, (114), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:46:14,046 INFO L87 Difference]: Start difference. First operand 189 states. Second operand has 115 states, 110 states have (on average 1.0363636363636364) internal successors, (114), 110 states have internal predecessors, (114), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:46:14,047 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:46:14,047 INFO L93 Difference]: Finished difference Result 189 states and 193 transitions. [2022-04-28 03:46:14,047 INFO L276 IsEmpty]: Start isEmpty. Operand 189 states and 193 transitions. [2022-04-28 03:46:14,048 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:46:14,048 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:46:14,048 INFO L74 IsIncluded]: Start isIncluded. First operand has 115 states, 110 states have (on average 1.0363636363636364) internal successors, (114), 110 states have internal predecessors, (114), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 189 states. [2022-04-28 03:46:14,048 INFO L87 Difference]: Start difference. First operand has 115 states, 110 states have (on average 1.0363636363636364) internal successors, (114), 110 states have internal predecessors, (114), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 189 states. [2022-04-28 03:46:14,050 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:46:14,050 INFO L93 Difference]: Finished difference Result 189 states and 193 transitions. [2022-04-28 03:46:14,050 INFO L276 IsEmpty]: Start isEmpty. Operand 189 states and 193 transitions. [2022-04-28 03:46:14,050 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:46:14,050 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:46:14,051 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 03:46:14,051 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 03:46:14,051 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 115 states, 110 states have (on average 1.0363636363636364) internal successors, (114), 110 states have internal predecessors, (114), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:46:14,052 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 115 states and 118 transitions. [2022-04-28 03:46:14,052 INFO L78 Accepts]: Start accepts. Automaton has 115 states and 118 transitions. Word has length 108 [2022-04-28 03:46:14,052 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 03:46:14,052 INFO L495 AbstractCegarLoop]: Abstraction has 115 states and 118 transitions. [2022-04-28 03:46:14,053 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 64 states, 64 states have (on average 1.625) internal successors, (104), 63 states have internal predecessors, (104), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:46:14,053 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 115 states and 118 transitions. [2022-04-28 03:46:14,168 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 118 edges. 118 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 03:46:14,168 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 118 transitions. [2022-04-28 03:46:14,168 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2022-04-28 03:46:14,168 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 03:46:14,168 INFO L195 NwaCegarLoop]: trace histogram [40, 39, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 03:46:14,184 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (28)] Forceful destruction successful, exit code 0 [2022-04-28 03:46:14,369 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29,28 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 03:46:14,369 INFO L420 AbstractCegarLoop]: === Iteration 31 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 03:46:14,369 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 03:46:14,369 INFO L85 PathProgramCache]: Analyzing trace with hash -218952995, now seen corresponding path program 28 times [2022-04-28 03:46:14,369 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 03:46:14,369 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1355375966] [2022-04-28 03:46:14,476 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 1 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 03:46:18,642 WARN L977 rdanLoopAcceleration]: Unable to prove correctness of quantifier elimination. [2022-04-28 03:46:18,760 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={1=1, 2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 03:46:18,761 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-28 03:46:18,763 INFO L85 PathProgramCache]: Analyzing trace with hash -717746335, now seen corresponding path program 1 times [2022-04-28 03:46:18,763 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 03:46:18,763 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1373920054] [2022-04-28 03:46:18,764 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:46:18,764 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 03:46:18,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:46:19,222 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 03:46:19,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:46:19,225 INFO L290 TraceCheckUtils]: 0: Hoare triple {25731#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(17, 2);call #Ultimate.allocInit(12, 3); {25700#true} is VALID [2022-04-28 03:46:19,225 INFO L290 TraceCheckUtils]: 1: Hoare triple {25700#true} assume true; {25700#true} is VALID [2022-04-28 03:46:19,225 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {25700#true} {25700#true} #52#return; {25700#true} is VALID [2022-04-28 03:46:19,226 INFO L272 TraceCheckUtils]: 0: Hoare triple {25700#true} call ULTIMATE.init(); {25731#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 03:46:19,226 INFO L290 TraceCheckUtils]: 1: Hoare triple {25731#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(17, 2);call #Ultimate.allocInit(12, 3); {25700#true} is VALID [2022-04-28 03:46:19,226 INFO L290 TraceCheckUtils]: 2: Hoare triple {25700#true} assume true; {25700#true} is VALID [2022-04-28 03:46:19,226 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {25700#true} {25700#true} #52#return; {25700#true} is VALID [2022-04-28 03:46:19,226 INFO L272 TraceCheckUtils]: 4: Hoare triple {25700#true} call #t~ret9 := main(); {25700#true} is VALID [2022-04-28 03:46:19,227 INFO L290 TraceCheckUtils]: 5: Hoare triple {25700#true} ~x~0 := 0;~y~0 := 50000;~z~0 := 0;~x~0 := 0; {25705#(and (= main_~z~0 0) (= main_~x~0 0) (<= 50000 main_~y~0))} is VALID [2022-04-28 03:46:19,227 INFO L290 TraceCheckUtils]: 6: Hoare triple {25705#(and (= main_~z~0 0) (= main_~x~0 0) (<= 50000 main_~y~0))} [168] L11-2-->L18-1_primed: Formula: (let ((.cse0 (= |v_main_#t~post4_173| |v_main_#t~post4_172|)) (.cse1 (= v_main_~x~0_1259 v_main_~x~0_1258))) (or (and (< v_main_~x~0_1259 v_main_~x~0_1258) (< v_main_~x~0_1258 50001)) (and .cse0 .cse1 (not (< v_main_~x~0_1259 50000))) (and .cse0 .cse1))) InVars {main_~x~0=v_main_~x~0_1259, main_#t~post4=|v_main_#t~post4_173|} OutVars{main_~x~0=v_main_~x~0_1258, main_#t~post4=|v_main_#t~post4_172|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {25706#(and (= main_~z~0 0) (<= main_~x~0 50000) (<= 50000 main_~y~0))} is VALID [2022-04-28 03:46:19,228 INFO L290 TraceCheckUtils]: 7: Hoare triple {25706#(and (= main_~z~0 0) (<= main_~x~0 50000) (<= 50000 main_~y~0))} [169] L18-1_primed-->L11-2: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {25706#(and (= main_~z~0 0) (<= main_~x~0 50000) (<= 50000 main_~y~0))} is VALID [2022-04-28 03:46:19,229 INFO L290 TraceCheckUtils]: 8: Hoare triple {25706#(and (= main_~z~0 0) (<= main_~x~0 50000) (<= 50000 main_~y~0))} [170] L11-2-->L18-1_primed: Formula: (let ((.cse3 (<= 50000 v_main_~x~0_1261)) (.cse0 (= |v_main_#t~post5_193| |v_main_#t~post5_192|)) (.cse1 (= |v_main_#t~post6_193| |v_main_#t~post6_192|)) (.cse2 (= v_main_~x~0_1261 v_main_~x~0_1260)) (.cse4 (= v_main_~y~0_1296 v_main_~y~0_1295))) (or (and .cse0 .cse1 .cse2 (or (not (< v_main_~x~0_1261 1000000)) (not .cse3)) .cse4) (let ((.cse5 (+ v_main_~x~0_1261 v_main_~y~0_1295))) (and (< .cse5 (+ 1000001 v_main_~y~0_1296)) .cse3 (< v_main_~y~0_1296 v_main_~y~0_1295) (= (+ v_main_~x~0_1260 v_main_~y~0_1296) .cse5))) (and .cse0 .cse1 .cse2 .cse4))) InVars {main_~y~0=v_main_~y~0_1296, main_#t~post5=|v_main_#t~post5_193|, main_~x~0=v_main_~x~0_1261, main_#t~post6=|v_main_#t~post6_193|} OutVars{main_~y~0=v_main_~y~0_1295, main_#t~post5=|v_main_#t~post5_192|, main_~x~0=v_main_~x~0_1260, main_#t~post6=|v_main_#t~post6_192|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {25707#(or (<= main_~x~0 50000) (and (= main_~z~0 0) (<= 50001 main_~y~0)))} is VALID [2022-04-28 03:46:19,230 INFO L290 TraceCheckUtils]: 9: Hoare triple {25707#(or (<= main_~x~0 50000) (and (= main_~z~0 0) (<= 50001 main_~y~0)))} [167] L18-1_primed-->L18-1: Formula: (not (< v_main_~x~0_11 1000000)) InVars {main_~x~0=v_main_~x~0_11} OutVars{main_~x~0=v_main_~x~0_11} AuxVars[] AssignedVars[] {25708#(and (= main_~z~0 0) (<= 50001 main_~y~0))} is VALID [2022-04-28 03:46:19,230 INFO L290 TraceCheckUtils]: 10: Hoare triple {25708#(and (= main_~z~0 0) (<= 50001 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {25709#(and (= main_~z~0 0) (<= 50000 main_~y~0))} is VALID [2022-04-28 03:46:19,231 INFO L290 TraceCheckUtils]: 11: Hoare triple {25709#(and (= main_~z~0 0) (<= 50000 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {25710#(and (= main_~z~0 0) (<= 49999 main_~y~0))} is VALID [2022-04-28 03:46:19,231 INFO L290 TraceCheckUtils]: 12: Hoare triple {25710#(and (= main_~z~0 0) (<= 49999 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {25711#(and (<= 49998 main_~y~0) (= main_~z~0 0))} is VALID [2022-04-28 03:46:19,232 INFO L290 TraceCheckUtils]: 13: Hoare triple {25711#(and (<= 49998 main_~y~0) (= main_~z~0 0))} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {25712#(and (= main_~z~0 0) (<= 49997 main_~y~0))} is VALID [2022-04-28 03:46:19,232 INFO L290 TraceCheckUtils]: 14: Hoare triple {25712#(and (= main_~z~0 0) (<= 49997 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {25713#(and (= main_~z~0 0) (<= 49996 main_~y~0))} is VALID [2022-04-28 03:46:19,233 INFO L290 TraceCheckUtils]: 15: Hoare triple {25713#(and (= main_~z~0 0) (<= 49996 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {25714#(and (= main_~z~0 0) (<= 49995 main_~y~0))} is VALID [2022-04-28 03:46:19,233 INFO L290 TraceCheckUtils]: 16: Hoare triple {25714#(and (= main_~z~0 0) (<= 49995 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {25715#(and (= main_~z~0 0) (<= 49994 main_~y~0))} is VALID [2022-04-28 03:46:19,234 INFO L290 TraceCheckUtils]: 17: Hoare triple {25715#(and (= main_~z~0 0) (<= 49994 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {25716#(and (= main_~z~0 0) (<= 49993 main_~y~0))} is VALID [2022-04-28 03:46:19,234 INFO L290 TraceCheckUtils]: 18: Hoare triple {25716#(and (= main_~z~0 0) (<= 49993 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {25717#(and (= main_~z~0 0) (<= 49992 main_~y~0))} is VALID [2022-04-28 03:46:19,235 INFO L290 TraceCheckUtils]: 19: Hoare triple {25717#(and (= main_~z~0 0) (<= 49992 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {25718#(and (= main_~z~0 0) (<= 49991 main_~y~0))} is VALID [2022-04-28 03:46:19,235 INFO L290 TraceCheckUtils]: 20: Hoare triple {25718#(and (= main_~z~0 0) (<= 49991 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {25719#(and (<= 49990 main_~y~0) (= main_~z~0 0))} is VALID [2022-04-28 03:46:19,236 INFO L290 TraceCheckUtils]: 21: Hoare triple {25719#(and (<= 49990 main_~y~0) (= main_~z~0 0))} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {25720#(and (= main_~z~0 0) (<= 49989 main_~y~0))} is VALID [2022-04-28 03:46:19,236 INFO L290 TraceCheckUtils]: 22: Hoare triple {25720#(and (= main_~z~0 0) (<= 49989 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {25721#(and (= main_~z~0 0) (<= 49988 main_~y~0))} is VALID [2022-04-28 03:46:19,237 INFO L290 TraceCheckUtils]: 23: Hoare triple {25721#(and (= main_~z~0 0) (<= 49988 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {25722#(and (= main_~z~0 0) (<= 49987 main_~y~0))} is VALID [2022-04-28 03:46:19,237 INFO L290 TraceCheckUtils]: 24: Hoare triple {25722#(and (= main_~z~0 0) (<= 49987 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {25723#(and (= main_~z~0 0) (<= 49986 main_~y~0))} is VALID [2022-04-28 03:46:19,238 INFO L290 TraceCheckUtils]: 25: Hoare triple {25723#(and (= main_~z~0 0) (<= 49986 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {25724#(and (= main_~z~0 0) (<= 49985 main_~y~0))} is VALID [2022-04-28 03:46:19,238 INFO L290 TraceCheckUtils]: 26: Hoare triple {25724#(and (= main_~z~0 0) (<= 49985 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {25725#(and (= main_~z~0 0) (<= 49984 main_~y~0))} is VALID [2022-04-28 03:46:19,239 INFO L290 TraceCheckUtils]: 27: Hoare triple {25725#(and (= main_~z~0 0) (<= 49984 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {25726#(and (= main_~z~0 0) (<= 49983 main_~y~0))} is VALID [2022-04-28 03:46:19,239 INFO L290 TraceCheckUtils]: 28: Hoare triple {25726#(and (= main_~z~0 0) (<= 49983 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {25727#(and (= main_~z~0 0) (<= 49982 main_~y~0))} is VALID [2022-04-28 03:46:19,240 INFO L290 TraceCheckUtils]: 29: Hoare triple {25727#(and (= main_~z~0 0) (<= 49982 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {25728#(and (<= 49981 main_~y~0) (= main_~z~0 0))} is VALID [2022-04-28 03:46:19,240 INFO L290 TraceCheckUtils]: 30: Hoare triple {25728#(and (<= 49981 main_~y~0) (= main_~z~0 0))} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {25729#(and (= main_~z~0 0) (<= 49980 main_~y~0))} is VALID [2022-04-28 03:46:19,241 INFO L290 TraceCheckUtils]: 31: Hoare triple {25729#(and (= main_~z~0 0) (<= 49980 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {25730#(and (= main_~z~0 0) (<= 49979 main_~y~0))} is VALID [2022-04-28 03:46:19,241 INFO L290 TraceCheckUtils]: 32: Hoare triple {25730#(and (= main_~z~0 0) (<= 49979 main_~y~0))} assume !(~y~0 > ~z~0); {25701#false} is VALID [2022-04-28 03:46:19,241 INFO L272 TraceCheckUtils]: 33: Hoare triple {25701#false} call __VERIFIER_assert((if ~x~0 == ~z~0 then 1 else 0)); {25701#false} is VALID [2022-04-28 03:46:19,241 INFO L290 TraceCheckUtils]: 34: Hoare triple {25701#false} ~cond := #in~cond; {25701#false} is VALID [2022-04-28 03:46:19,241 INFO L290 TraceCheckUtils]: 35: Hoare triple {25701#false} assume 0 == ~cond; {25701#false} is VALID [2022-04-28 03:46:19,241 INFO L290 TraceCheckUtils]: 36: Hoare triple {25701#false} assume !false; {25701#false} is VALID [2022-04-28 03:46:19,242 INFO L134 CoverageAnalysis]: Checked inductivity of 255 backedges. 0 proven. 255 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 03:46:19,242 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 03:46:19,242 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1373920054] [2022-04-28 03:46:19,242 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1373920054] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 03:46:19,242 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [999181290] [2022-04-28 03:46:19,242 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:46:19,242 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 03:46:19,242 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 03:46:19,243 INFO L229 MonitoredProcess]: Starting monitored process 29 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 03:46:19,244 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (29)] Waiting until timeout for monitored process [2022-04-28 03:46:19,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:46:19,291 INFO L263 TraceCheckSpWp]: Trace formula consists of 169 conjuncts, 26 conjunts are in the unsatisfiable core [2022-04-28 03:46:19,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:46:19,308 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 03:46:20,473 INFO L272 TraceCheckUtils]: 0: Hoare triple {25700#true} call ULTIMATE.init(); {25700#true} is VALID [2022-04-28 03:46:20,473 INFO L290 TraceCheckUtils]: 1: Hoare triple {25700#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(17, 2);call #Ultimate.allocInit(12, 3); {25700#true} is VALID [2022-04-28 03:46:20,473 INFO L290 TraceCheckUtils]: 2: Hoare triple {25700#true} assume true; {25700#true} is VALID [2022-04-28 03:46:20,473 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {25700#true} {25700#true} #52#return; {25700#true} is VALID [2022-04-28 03:46:20,473 INFO L272 TraceCheckUtils]: 4: Hoare triple {25700#true} call #t~ret9 := main(); {25700#true} is VALID [2022-04-28 03:46:20,474 INFO L290 TraceCheckUtils]: 5: Hoare triple {25700#true} ~x~0 := 0;~y~0 := 50000;~z~0 := 0;~x~0 := 0; {25750#(and (<= main_~z~0 0) (<= 50000 main_~y~0))} is VALID [2022-04-28 03:46:20,474 INFO L290 TraceCheckUtils]: 6: Hoare triple {25750#(and (<= main_~z~0 0) (<= 50000 main_~y~0))} [168] L11-2-->L18-1_primed: Formula: (let ((.cse0 (= |v_main_#t~post4_173| |v_main_#t~post4_172|)) (.cse1 (= v_main_~x~0_1259 v_main_~x~0_1258))) (or (and (< v_main_~x~0_1259 v_main_~x~0_1258) (< v_main_~x~0_1258 50001)) (and .cse0 .cse1 (not (< v_main_~x~0_1259 50000))) (and .cse0 .cse1))) InVars {main_~x~0=v_main_~x~0_1259, main_#t~post4=|v_main_#t~post4_173|} OutVars{main_~x~0=v_main_~x~0_1258, main_#t~post4=|v_main_#t~post4_172|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {25750#(and (<= main_~z~0 0) (<= 50000 main_~y~0))} is VALID [2022-04-28 03:46:20,474 INFO L290 TraceCheckUtils]: 7: Hoare triple {25750#(and (<= main_~z~0 0) (<= 50000 main_~y~0))} [169] L18-1_primed-->L11-2: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {25750#(and (<= main_~z~0 0) (<= 50000 main_~y~0))} is VALID [2022-04-28 03:46:20,475 INFO L290 TraceCheckUtils]: 8: Hoare triple {25750#(and (<= main_~z~0 0) (<= 50000 main_~y~0))} [170] L11-2-->L18-1_primed: Formula: (let ((.cse3 (<= 50000 v_main_~x~0_1261)) (.cse0 (= |v_main_#t~post5_193| |v_main_#t~post5_192|)) (.cse1 (= |v_main_#t~post6_193| |v_main_#t~post6_192|)) (.cse2 (= v_main_~x~0_1261 v_main_~x~0_1260)) (.cse4 (= v_main_~y~0_1296 v_main_~y~0_1295))) (or (and .cse0 .cse1 .cse2 (or (not (< v_main_~x~0_1261 1000000)) (not .cse3)) .cse4) (let ((.cse5 (+ v_main_~x~0_1261 v_main_~y~0_1295))) (and (< .cse5 (+ 1000001 v_main_~y~0_1296)) .cse3 (< v_main_~y~0_1296 v_main_~y~0_1295) (= (+ v_main_~x~0_1260 v_main_~y~0_1296) .cse5))) (and .cse0 .cse1 .cse2 .cse4))) InVars {main_~y~0=v_main_~y~0_1296, main_#t~post5=|v_main_#t~post5_193|, main_~x~0=v_main_~x~0_1261, main_#t~post6=|v_main_#t~post6_193|} OutVars{main_~y~0=v_main_~y~0_1295, main_#t~post5=|v_main_#t~post5_192|, main_~x~0=v_main_~x~0_1260, main_#t~post6=|v_main_#t~post6_192|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {25750#(and (<= main_~z~0 0) (<= 50000 main_~y~0))} is VALID [2022-04-28 03:46:20,476 INFO L290 TraceCheckUtils]: 9: Hoare triple {25750#(and (<= main_~z~0 0) (<= 50000 main_~y~0))} [167] L18-1_primed-->L18-1: Formula: (not (< v_main_~x~0_11 1000000)) InVars {main_~x~0=v_main_~x~0_11} OutVars{main_~x~0=v_main_~x~0_11} AuxVars[] AssignedVars[] {25750#(and (<= main_~z~0 0) (<= 50000 main_~y~0))} is VALID [2022-04-28 03:46:20,476 INFO L290 TraceCheckUtils]: 10: Hoare triple {25750#(and (<= main_~z~0 0) (<= 50000 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {25766#(and (<= main_~z~0 0) (<= 49999 main_~y~0))} is VALID [2022-04-28 03:46:20,476 INFO L290 TraceCheckUtils]: 11: Hoare triple {25766#(and (<= main_~z~0 0) (<= 49999 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {25770#(and (<= main_~z~0 0) (<= 49998 main_~y~0))} is VALID [2022-04-28 03:46:20,477 INFO L290 TraceCheckUtils]: 12: Hoare triple {25770#(and (<= main_~z~0 0) (<= 49998 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {25774#(and (<= main_~z~0 0) (<= 49997 main_~y~0))} is VALID [2022-04-28 03:46:20,477 INFO L290 TraceCheckUtils]: 13: Hoare triple {25774#(and (<= main_~z~0 0) (<= 49997 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {25778#(and (<= main_~z~0 0) (<= 49996 main_~y~0))} is VALID [2022-04-28 03:46:20,478 INFO L290 TraceCheckUtils]: 14: Hoare triple {25778#(and (<= main_~z~0 0) (<= 49996 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {25782#(and (<= main_~z~0 0) (<= 49995 main_~y~0))} is VALID [2022-04-28 03:46:20,478 INFO L290 TraceCheckUtils]: 15: Hoare triple {25782#(and (<= main_~z~0 0) (<= 49995 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {25786#(and (<= main_~z~0 0) (<= 49994 main_~y~0))} is VALID [2022-04-28 03:46:20,479 INFO L290 TraceCheckUtils]: 16: Hoare triple {25786#(and (<= main_~z~0 0) (<= 49994 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {25790#(and (<= main_~z~0 0) (<= 49993 main_~y~0))} is VALID [2022-04-28 03:46:20,479 INFO L290 TraceCheckUtils]: 17: Hoare triple {25790#(and (<= main_~z~0 0) (<= 49993 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {25794#(and (<= main_~z~0 0) (<= 49992 main_~y~0))} is VALID [2022-04-28 03:46:20,480 INFO L290 TraceCheckUtils]: 18: Hoare triple {25794#(and (<= main_~z~0 0) (<= 49992 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {25798#(and (<= main_~z~0 0) (<= 49991 main_~y~0))} is VALID [2022-04-28 03:46:20,480 INFO L290 TraceCheckUtils]: 19: Hoare triple {25798#(and (<= main_~z~0 0) (<= 49991 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {25802#(and (<= main_~z~0 0) (<= 49990 main_~y~0))} is VALID [2022-04-28 03:46:20,481 INFO L290 TraceCheckUtils]: 20: Hoare triple {25802#(and (<= main_~z~0 0) (<= 49990 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {25806#(and (<= main_~z~0 0) (<= 49989 main_~y~0))} is VALID [2022-04-28 03:46:20,481 INFO L290 TraceCheckUtils]: 21: Hoare triple {25806#(and (<= main_~z~0 0) (<= 49989 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {25810#(and (<= main_~z~0 0) (<= 49988 main_~y~0))} is VALID [2022-04-28 03:46:20,482 INFO L290 TraceCheckUtils]: 22: Hoare triple {25810#(and (<= main_~z~0 0) (<= 49988 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {25814#(and (<= main_~z~0 0) (<= 49987 main_~y~0))} is VALID [2022-04-28 03:46:20,482 INFO L290 TraceCheckUtils]: 23: Hoare triple {25814#(and (<= main_~z~0 0) (<= 49987 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {25818#(and (<= main_~z~0 0) (<= 49986 main_~y~0))} is VALID [2022-04-28 03:46:20,483 INFO L290 TraceCheckUtils]: 24: Hoare triple {25818#(and (<= main_~z~0 0) (<= 49986 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {25822#(and (<= main_~z~0 0) (<= 49985 main_~y~0))} is VALID [2022-04-28 03:46:20,483 INFO L290 TraceCheckUtils]: 25: Hoare triple {25822#(and (<= main_~z~0 0) (<= 49985 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {25826#(and (<= main_~z~0 0) (<= 49984 main_~y~0))} is VALID [2022-04-28 03:46:20,484 INFO L290 TraceCheckUtils]: 26: Hoare triple {25826#(and (<= main_~z~0 0) (<= 49984 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {25830#(and (<= main_~z~0 0) (<= 49983 main_~y~0))} is VALID [2022-04-28 03:46:20,484 INFO L290 TraceCheckUtils]: 27: Hoare triple {25830#(and (<= main_~z~0 0) (<= 49983 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {25834#(and (<= main_~z~0 0) (<= 49982 main_~y~0))} is VALID [2022-04-28 03:46:20,485 INFO L290 TraceCheckUtils]: 28: Hoare triple {25834#(and (<= main_~z~0 0) (<= 49982 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {25838#(and (<= main_~z~0 0) (<= 49981 main_~y~0))} is VALID [2022-04-28 03:46:20,485 INFO L290 TraceCheckUtils]: 29: Hoare triple {25838#(and (<= main_~z~0 0) (<= 49981 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {25842#(and (<= main_~z~0 0) (<= 49980 main_~y~0))} is VALID [2022-04-28 03:46:20,486 INFO L290 TraceCheckUtils]: 30: Hoare triple {25842#(and (<= main_~z~0 0) (<= 49980 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {25846#(and (<= main_~z~0 0) (<= 49979 main_~y~0))} is VALID [2022-04-28 03:46:20,486 INFO L290 TraceCheckUtils]: 31: Hoare triple {25846#(and (<= main_~z~0 0) (<= 49979 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {25850#(and (<= main_~z~0 0) (<= 49978 main_~y~0))} is VALID [2022-04-28 03:46:20,486 INFO L290 TraceCheckUtils]: 32: Hoare triple {25850#(and (<= main_~z~0 0) (<= 49978 main_~y~0))} assume !(~y~0 > ~z~0); {25701#false} is VALID [2022-04-28 03:46:20,486 INFO L272 TraceCheckUtils]: 33: Hoare triple {25701#false} call __VERIFIER_assert((if ~x~0 == ~z~0 then 1 else 0)); {25701#false} is VALID [2022-04-28 03:46:20,486 INFO L290 TraceCheckUtils]: 34: Hoare triple {25701#false} ~cond := #in~cond; {25701#false} is VALID [2022-04-28 03:46:20,487 INFO L290 TraceCheckUtils]: 35: Hoare triple {25701#false} assume 0 == ~cond; {25701#false} is VALID [2022-04-28 03:46:20,487 INFO L290 TraceCheckUtils]: 36: Hoare triple {25701#false} assume !false; {25701#false} is VALID [2022-04-28 03:46:20,487 INFO L134 CoverageAnalysis]: Checked inductivity of 255 backedges. 0 proven. 253 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-04-28 03:46:20,487 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 03:46:21,929 INFO L290 TraceCheckUtils]: 36: Hoare triple {25701#false} assume !false; {25701#false} is VALID [2022-04-28 03:46:21,929 INFO L290 TraceCheckUtils]: 35: Hoare triple {25701#false} assume 0 == ~cond; {25701#false} is VALID [2022-04-28 03:46:21,929 INFO L290 TraceCheckUtils]: 34: Hoare triple {25701#false} ~cond := #in~cond; {25701#false} is VALID [2022-04-28 03:46:21,929 INFO L272 TraceCheckUtils]: 33: Hoare triple {25701#false} call __VERIFIER_assert((if ~x~0 == ~z~0 then 1 else 0)); {25701#false} is VALID [2022-04-28 03:46:21,929 INFO L290 TraceCheckUtils]: 32: Hoare triple {25878#(< main_~z~0 main_~y~0)} assume !(~y~0 > ~z~0); {25701#false} is VALID [2022-04-28 03:46:21,930 INFO L290 TraceCheckUtils]: 31: Hoare triple {25882#(< (+ main_~z~0 1) main_~y~0)} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {25878#(< main_~z~0 main_~y~0)} is VALID [2022-04-28 03:46:21,930 INFO L290 TraceCheckUtils]: 30: Hoare triple {25886#(< (+ main_~z~0 2) main_~y~0)} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {25882#(< (+ main_~z~0 1) main_~y~0)} is VALID [2022-04-28 03:46:21,931 INFO L290 TraceCheckUtils]: 29: Hoare triple {25890#(< (+ main_~z~0 3) main_~y~0)} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {25886#(< (+ main_~z~0 2) main_~y~0)} is VALID [2022-04-28 03:46:21,931 INFO L290 TraceCheckUtils]: 28: Hoare triple {25894#(< (+ main_~z~0 4) main_~y~0)} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {25890#(< (+ main_~z~0 3) main_~y~0)} is VALID [2022-04-28 03:46:21,932 INFO L290 TraceCheckUtils]: 27: Hoare triple {25898#(< (+ 5 main_~z~0) main_~y~0)} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {25894#(< (+ main_~z~0 4) main_~y~0)} is VALID [2022-04-28 03:46:21,932 INFO L290 TraceCheckUtils]: 26: Hoare triple {25902#(< (+ main_~z~0 6) main_~y~0)} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {25898#(< (+ 5 main_~z~0) main_~y~0)} is VALID [2022-04-28 03:46:21,932 INFO L290 TraceCheckUtils]: 25: Hoare triple {25906#(< (+ 7 main_~z~0) main_~y~0)} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {25902#(< (+ main_~z~0 6) main_~y~0)} is VALID [2022-04-28 03:46:21,933 INFO L290 TraceCheckUtils]: 24: Hoare triple {25910#(< (+ main_~z~0 8) main_~y~0)} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {25906#(< (+ 7 main_~z~0) main_~y~0)} is VALID [2022-04-28 03:46:21,933 INFO L290 TraceCheckUtils]: 23: Hoare triple {25914#(< (+ main_~z~0 9) main_~y~0)} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {25910#(< (+ main_~z~0 8) main_~y~0)} is VALID [2022-04-28 03:46:21,934 INFO L290 TraceCheckUtils]: 22: Hoare triple {25918#(< (+ main_~z~0 10) main_~y~0)} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {25914#(< (+ main_~z~0 9) main_~y~0)} is VALID [2022-04-28 03:46:21,934 INFO L290 TraceCheckUtils]: 21: Hoare triple {25922#(< (+ main_~z~0 11) main_~y~0)} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {25918#(< (+ main_~z~0 10) main_~y~0)} is VALID [2022-04-28 03:46:21,935 INFO L290 TraceCheckUtils]: 20: Hoare triple {25926#(< (+ main_~z~0 12) main_~y~0)} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {25922#(< (+ main_~z~0 11) main_~y~0)} is VALID [2022-04-28 03:46:21,935 INFO L290 TraceCheckUtils]: 19: Hoare triple {25930#(< (+ main_~z~0 13) main_~y~0)} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {25926#(< (+ main_~z~0 12) main_~y~0)} is VALID [2022-04-28 03:46:21,936 INFO L290 TraceCheckUtils]: 18: Hoare triple {25934#(< (+ main_~z~0 14) main_~y~0)} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {25930#(< (+ main_~z~0 13) main_~y~0)} is VALID [2022-04-28 03:46:21,936 INFO L290 TraceCheckUtils]: 17: Hoare triple {25938#(< (+ main_~z~0 15) main_~y~0)} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {25934#(< (+ main_~z~0 14) main_~y~0)} is VALID [2022-04-28 03:46:21,937 INFO L290 TraceCheckUtils]: 16: Hoare triple {25942#(< (+ main_~z~0 16) main_~y~0)} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {25938#(< (+ main_~z~0 15) main_~y~0)} is VALID [2022-04-28 03:46:21,937 INFO L290 TraceCheckUtils]: 15: Hoare triple {25946#(< (+ main_~z~0 17) main_~y~0)} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {25942#(< (+ main_~z~0 16) main_~y~0)} is VALID [2022-04-28 03:46:21,938 INFO L290 TraceCheckUtils]: 14: Hoare triple {25950#(< (+ main_~z~0 18) main_~y~0)} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {25946#(< (+ main_~z~0 17) main_~y~0)} is VALID [2022-04-28 03:46:21,938 INFO L290 TraceCheckUtils]: 13: Hoare triple {25954#(< (+ 19 main_~z~0) main_~y~0)} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {25950#(< (+ main_~z~0 18) main_~y~0)} is VALID [2022-04-28 03:46:21,938 INFO L290 TraceCheckUtils]: 12: Hoare triple {25958#(< (+ main_~z~0 20) main_~y~0)} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {25954#(< (+ 19 main_~z~0) main_~y~0)} is VALID [2022-04-28 03:46:21,939 INFO L290 TraceCheckUtils]: 11: Hoare triple {25962#(< (+ main_~z~0 21) main_~y~0)} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {25958#(< (+ main_~z~0 20) main_~y~0)} is VALID [2022-04-28 03:46:21,939 INFO L290 TraceCheckUtils]: 10: Hoare triple {25966#(< (+ main_~z~0 22) main_~y~0)} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {25962#(< (+ main_~z~0 21) main_~y~0)} is VALID [2022-04-28 03:46:21,940 INFO L290 TraceCheckUtils]: 9: Hoare triple {25966#(< (+ main_~z~0 22) main_~y~0)} [167] L18-1_primed-->L18-1: Formula: (not (< v_main_~x~0_11 1000000)) InVars {main_~x~0=v_main_~x~0_11} OutVars{main_~x~0=v_main_~x~0_11} AuxVars[] AssignedVars[] {25966#(< (+ main_~z~0 22) main_~y~0)} is VALID [2022-04-28 03:46:21,940 INFO L290 TraceCheckUtils]: 8: Hoare triple {25966#(< (+ main_~z~0 22) main_~y~0)} [170] L11-2-->L18-1_primed: Formula: (let ((.cse3 (<= 50000 v_main_~x~0_1261)) (.cse0 (= |v_main_#t~post5_193| |v_main_#t~post5_192|)) (.cse1 (= |v_main_#t~post6_193| |v_main_#t~post6_192|)) (.cse2 (= v_main_~x~0_1261 v_main_~x~0_1260)) (.cse4 (= v_main_~y~0_1296 v_main_~y~0_1295))) (or (and .cse0 .cse1 .cse2 (or (not (< v_main_~x~0_1261 1000000)) (not .cse3)) .cse4) (let ((.cse5 (+ v_main_~x~0_1261 v_main_~y~0_1295))) (and (< .cse5 (+ 1000001 v_main_~y~0_1296)) .cse3 (< v_main_~y~0_1296 v_main_~y~0_1295) (= (+ v_main_~x~0_1260 v_main_~y~0_1296) .cse5))) (and .cse0 .cse1 .cse2 .cse4))) InVars {main_~y~0=v_main_~y~0_1296, main_#t~post5=|v_main_#t~post5_193|, main_~x~0=v_main_~x~0_1261, main_#t~post6=|v_main_#t~post6_193|} OutVars{main_~y~0=v_main_~y~0_1295, main_#t~post5=|v_main_#t~post5_192|, main_~x~0=v_main_~x~0_1260, main_#t~post6=|v_main_#t~post6_192|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {25966#(< (+ main_~z~0 22) main_~y~0)} is VALID [2022-04-28 03:46:21,941 INFO L290 TraceCheckUtils]: 7: Hoare triple {25966#(< (+ main_~z~0 22) main_~y~0)} [169] L18-1_primed-->L11-2: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {25966#(< (+ main_~z~0 22) main_~y~0)} is VALID [2022-04-28 03:46:21,941 INFO L290 TraceCheckUtils]: 6: Hoare triple {25966#(< (+ main_~z~0 22) main_~y~0)} [168] L11-2-->L18-1_primed: Formula: (let ((.cse0 (= |v_main_#t~post4_173| |v_main_#t~post4_172|)) (.cse1 (= v_main_~x~0_1259 v_main_~x~0_1258))) (or (and (< v_main_~x~0_1259 v_main_~x~0_1258) (< v_main_~x~0_1258 50001)) (and .cse0 .cse1 (not (< v_main_~x~0_1259 50000))) (and .cse0 .cse1))) InVars {main_~x~0=v_main_~x~0_1259, main_#t~post4=|v_main_#t~post4_173|} OutVars{main_~x~0=v_main_~x~0_1258, main_#t~post4=|v_main_#t~post4_172|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {25966#(< (+ main_~z~0 22) main_~y~0)} is VALID [2022-04-28 03:46:21,941 INFO L290 TraceCheckUtils]: 5: Hoare triple {25700#true} ~x~0 := 0;~y~0 := 50000;~z~0 := 0;~x~0 := 0; {25966#(< (+ main_~z~0 22) main_~y~0)} is VALID [2022-04-28 03:46:21,942 INFO L272 TraceCheckUtils]: 4: Hoare triple {25700#true} call #t~ret9 := main(); {25700#true} is VALID [2022-04-28 03:46:21,942 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {25700#true} {25700#true} #52#return; {25700#true} is VALID [2022-04-28 03:46:21,942 INFO L290 TraceCheckUtils]: 2: Hoare triple {25700#true} assume true; {25700#true} is VALID [2022-04-28 03:46:21,942 INFO L290 TraceCheckUtils]: 1: Hoare triple {25700#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(17, 2);call #Ultimate.allocInit(12, 3); {25700#true} is VALID [2022-04-28 03:46:21,942 INFO L272 TraceCheckUtils]: 0: Hoare triple {25700#true} call ULTIMATE.init(); {25700#true} is VALID [2022-04-28 03:46:21,942 INFO L134 CoverageAnalysis]: Checked inductivity of 255 backedges. 0 proven. 253 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-04-28 03:46:21,942 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [999181290] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 03:46:21,942 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 03:46:21,942 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [29, 25, 25] total 75 [2022-04-28 03:46:23,591 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 03:46:23,591 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1355375966] [2022-04-28 03:46:23,591 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1355375966] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 03:46:23,591 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 03:46:23,591 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [67] imperfect sequences [] total 67 [2022-04-28 03:46:23,591 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [602229115] [2022-04-28 03:46:23,591 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 03:46:23,592 INFO L78 Accepts]: Start accepts. Automaton has has 67 states, 67 states have (on average 1.6417910447761195) internal successors, (110), 66 states have internal predecessors, (110), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 114 [2022-04-28 03:46:23,592 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 03:46:23,592 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 67 states, 67 states have (on average 1.6417910447761195) internal successors, (110), 66 states have internal predecessors, (110), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:46:23,675 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 114 edges. 114 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 03:46:23,675 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 67 states [2022-04-28 03:46:23,676 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 03:46:23,676 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 67 interpolants. [2022-04-28 03:46:23,677 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5356, Invalid=7984, Unknown=0, NotChecked=0, Total=13340 [2022-04-28 03:46:23,677 INFO L87 Difference]: Start difference. First operand 115 states and 118 transitions. Second operand has 67 states, 67 states have (on average 1.6417910447761195) internal successors, (110), 66 states have internal predecessors, (110), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:46:31,273 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:46:31,273 INFO L93 Difference]: Finished difference Result 303 states and 314 transitions. [2022-04-28 03:46:31,273 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 67 states. [2022-04-28 03:46:31,273 INFO L78 Accepts]: Start accepts. Automaton has has 67 states, 67 states have (on average 1.6417910447761195) internal successors, (110), 66 states have internal predecessors, (110), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 114 [2022-04-28 03:46:31,273 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 03:46:31,273 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 67 states, 67 states have (on average 1.6417910447761195) internal successors, (110), 66 states have internal predecessors, (110), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:46:31,275 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 136 transitions. [2022-04-28 03:46:31,275 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 67 states, 67 states have (on average 1.6417910447761195) internal successors, (110), 66 states have internal predecessors, (110), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:46:31,276 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 136 transitions. [2022-04-28 03:46:31,276 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 67 states and 136 transitions. [2022-04-28 03:46:31,385 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 136 edges. 136 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 03:46:31,388 INFO L225 Difference]: With dead ends: 303 [2022-04-28 03:46:31,388 INFO L226 Difference]: Without dead ends: 196 [2022-04-28 03:46:31,390 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 253 GetRequests, 73 SyntacticMatches, 2 SemanticMatches, 178 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9339 ImplicationChecksByTransitivity, 5.0s TimeCoverageRelationStatistics Valid=10759, Invalid=21461, Unknown=0, NotChecked=0, Total=32220 [2022-04-28 03:46:31,390 INFO L413 NwaCegarLoop]: 13 mSDtfsCounter, 180 mSDsluCounter, 27 mSDsCounter, 0 mSdLazyCounter, 3439 mSolverCounterSat, 203 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 180 SdHoareTripleChecker+Valid, 40 SdHoareTripleChecker+Invalid, 3642 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 203 IncrementalHoareTripleChecker+Valid, 3439 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.8s IncrementalHoareTripleChecker+Time [2022-04-28 03:46:31,391 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [180 Valid, 40 Invalid, 3642 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [203 Valid, 3439 Invalid, 0 Unknown, 0 Unchecked, 2.8s Time] [2022-04-28 03:46:31,391 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 196 states. [2022-04-28 03:46:31,811 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 196 to 196. [2022-04-28 03:46:31,811 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 03:46:31,811 INFO L82 GeneralOperation]: Start isEquivalent. First operand 196 states. Second operand has 196 states, 191 states have (on average 1.0261780104712042) internal successors, (196), 191 states have internal predecessors, (196), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:46:31,811 INFO L74 IsIncluded]: Start isIncluded. First operand 196 states. Second operand has 196 states, 191 states have (on average 1.0261780104712042) internal successors, (196), 191 states have internal predecessors, (196), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:46:31,812 INFO L87 Difference]: Start difference. First operand 196 states. Second operand has 196 states, 191 states have (on average 1.0261780104712042) internal successors, (196), 191 states have internal predecessors, (196), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:46:31,814 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:46:31,814 INFO L93 Difference]: Finished difference Result 196 states and 200 transitions. [2022-04-28 03:46:31,814 INFO L276 IsEmpty]: Start isEmpty. Operand 196 states and 200 transitions. [2022-04-28 03:46:31,814 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:46:31,815 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:46:31,815 INFO L74 IsIncluded]: Start isIncluded. First operand has 196 states, 191 states have (on average 1.0261780104712042) internal successors, (196), 191 states have internal predecessors, (196), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 196 states. [2022-04-28 03:46:31,815 INFO L87 Difference]: Start difference. First operand has 196 states, 191 states have (on average 1.0261780104712042) internal successors, (196), 191 states have internal predecessors, (196), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 196 states. [2022-04-28 03:46:31,817 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:46:31,818 INFO L93 Difference]: Finished difference Result 196 states and 200 transitions. [2022-04-28 03:46:31,818 INFO L276 IsEmpty]: Start isEmpty. Operand 196 states and 200 transitions. [2022-04-28 03:46:31,818 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:46:31,818 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:46:31,818 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 03:46:31,818 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 03:46:31,818 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 196 states, 191 states have (on average 1.0261780104712042) internal successors, (196), 191 states have internal predecessors, (196), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:46:31,821 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 196 states to 196 states and 200 transitions. [2022-04-28 03:46:31,821 INFO L78 Accepts]: Start accepts. Automaton has 196 states and 200 transitions. Word has length 114 [2022-04-28 03:46:31,821 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 03:46:31,822 INFO L495 AbstractCegarLoop]: Abstraction has 196 states and 200 transitions. [2022-04-28 03:46:31,822 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 67 states, 67 states have (on average 1.6417910447761195) internal successors, (110), 66 states have internal predecessors, (110), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:46:31,822 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 196 states and 200 transitions. [2022-04-28 03:46:32,012 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 200 edges. 200 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 03:46:32,012 INFO L276 IsEmpty]: Start isEmpty. Operand 196 states and 200 transitions. [2022-04-28 03:46:32,013 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2022-04-28 03:46:32,013 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 03:46:32,013 INFO L195 NwaCegarLoop]: trace histogram [41, 40, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 03:46:32,028 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (29)] Forceful destruction successful, exit code 0 [2022-04-28 03:46:32,215 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30,29 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 03:46:32,215 INFO L420 AbstractCegarLoop]: === Iteration 32 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 03:46:32,216 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 03:46:32,216 INFO L85 PathProgramCache]: Analyzing trace with hash -1857282431, now seen corresponding path program 29 times [2022-04-28 03:46:32,216 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 03:46:32,216 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1740842437] [2022-04-28 03:46:34,295 WARN L977 rdanLoopAcceleration]: Unable to prove correctness of quantifier elimination. [2022-04-28 03:46:34,340 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 1 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 03:46:34,566 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={1=1, 2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 03:46:34,567 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-28 03:46:34,569 INFO L85 PathProgramCache]: Analyzing trace with hash -264339166, now seen corresponding path program 1 times [2022-04-28 03:46:34,569 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 03:46:34,569 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [619236895] [2022-04-28 03:46:34,569 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:46:34,570 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 03:46:34,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:46:34,997 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 03:46:34,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:46:35,000 INFO L290 TraceCheckUtils]: 0: Hoare triple {27587#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(17, 2);call #Ultimate.allocInit(12, 3); {27558#true} is VALID [2022-04-28 03:46:35,000 INFO L290 TraceCheckUtils]: 1: Hoare triple {27558#true} assume true; {27558#true} is VALID [2022-04-28 03:46:35,000 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {27558#true} {27558#true} #52#return; {27558#true} is VALID [2022-04-28 03:46:35,001 INFO L272 TraceCheckUtils]: 0: Hoare triple {27558#true} call ULTIMATE.init(); {27587#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 03:46:35,001 INFO L290 TraceCheckUtils]: 1: Hoare triple {27587#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(17, 2);call #Ultimate.allocInit(12, 3); {27558#true} is VALID [2022-04-28 03:46:35,001 INFO L290 TraceCheckUtils]: 2: Hoare triple {27558#true} assume true; {27558#true} is VALID [2022-04-28 03:46:35,001 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {27558#true} {27558#true} #52#return; {27558#true} is VALID [2022-04-28 03:46:35,001 INFO L272 TraceCheckUtils]: 4: Hoare triple {27558#true} call #t~ret9 := main(); {27558#true} is VALID [2022-04-28 03:46:35,001 INFO L290 TraceCheckUtils]: 5: Hoare triple {27558#true} ~x~0 := 0;~y~0 := 50000;~z~0 := 0;~x~0 := 0; {27563#(and (= main_~z~0 0) (<= 50000 main_~y~0))} is VALID [2022-04-28 03:46:35,002 INFO L290 TraceCheckUtils]: 6: Hoare triple {27563#(and (= main_~z~0 0) (<= 50000 main_~y~0))} [172] L11-2-->L18-1_primed: Formula: (let ((.cse0 (= v_main_~x~0_1337 v_main_~x~0_1336)) (.cse1 (= |v_main_#t~post4_179| |v_main_#t~post4_178|))) (or (and (<= 50000 v_main_~x~0_1337) .cse0 .cse1) (and (< v_main_~x~0_1336 50001) (< v_main_~x~0_1337 v_main_~x~0_1336)) (and .cse0 .cse1))) InVars {main_~x~0=v_main_~x~0_1337, main_#t~post4=|v_main_#t~post4_179|} OutVars{main_~x~0=v_main_~x~0_1336, main_#t~post4=|v_main_#t~post4_178|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {27563#(and (= main_~z~0 0) (<= 50000 main_~y~0))} is VALID [2022-04-28 03:46:35,002 INFO L290 TraceCheckUtils]: 7: Hoare triple {27563#(and (= main_~z~0 0) (<= 50000 main_~y~0))} [173] L18-1_primed-->L11-2: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {27563#(and (= main_~z~0 0) (<= 50000 main_~y~0))} is VALID [2022-04-28 03:46:35,003 INFO L290 TraceCheckUtils]: 8: Hoare triple {27563#(and (= main_~z~0 0) (<= 50000 main_~y~0))} [174] L11-2-->L18-1_primed: Formula: (let ((.cse0 (= v_main_~y~0_1388 v_main_~y~0_1387)) (.cse1 (= |v_main_#t~post6_200| |v_main_#t~post6_199|)) (.cse2 (= v_main_~x~0_1339 v_main_~x~0_1338)) (.cse3 (= |v_main_#t~post5_200| |v_main_#t~post5_199|)) (.cse4 (<= 50000 v_main_~x~0_1339))) (or (and .cse0 .cse1 .cse2 .cse3) (and .cse0 .cse1 (or (not (< v_main_~x~0_1339 1000000)) (not .cse4)) .cse2 .cse3) (let ((.cse5 (+ v_main_~x~0_1339 v_main_~y~0_1387))) (and .cse4 (< v_main_~y~0_1388 v_main_~y~0_1387) (= .cse5 (+ v_main_~x~0_1338 v_main_~y~0_1388)) (< .cse5 (+ 1000001 v_main_~y~0_1388)))))) InVars {main_~y~0=v_main_~y~0_1388, main_#t~post5=|v_main_#t~post5_200|, main_~x~0=v_main_~x~0_1339, main_#t~post6=|v_main_#t~post6_200|} OutVars{main_~y~0=v_main_~y~0_1387, main_#t~post5=|v_main_#t~post5_199|, main_~x~0=v_main_~x~0_1338, main_#t~post6=|v_main_#t~post6_199|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {27563#(and (= main_~z~0 0) (<= 50000 main_~y~0))} is VALID [2022-04-28 03:46:35,004 INFO L290 TraceCheckUtils]: 9: Hoare triple {27563#(and (= main_~z~0 0) (<= 50000 main_~y~0))} [171] L18-1_primed-->L18-1: Formula: (not (< v_main_~x~0_11 1000000)) InVars {main_~x~0=v_main_~x~0_11} OutVars{main_~x~0=v_main_~x~0_11} AuxVars[] AssignedVars[] {27563#(and (= main_~z~0 0) (<= 50000 main_~y~0))} is VALID [2022-04-28 03:46:35,004 INFO L290 TraceCheckUtils]: 10: Hoare triple {27563#(and (= main_~z~0 0) (<= 50000 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {27564#(and (= main_~z~0 0) (<= 49999 main_~y~0))} is VALID [2022-04-28 03:46:35,005 INFO L290 TraceCheckUtils]: 11: Hoare triple {27564#(and (= main_~z~0 0) (<= 49999 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {27565#(and (<= 49998 main_~y~0) (= main_~z~0 0))} is VALID [2022-04-28 03:46:35,005 INFO L290 TraceCheckUtils]: 12: Hoare triple {27565#(and (<= 49998 main_~y~0) (= main_~z~0 0))} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {27566#(and (= main_~z~0 0) (<= 49997 main_~y~0))} is VALID [2022-04-28 03:46:35,006 INFO L290 TraceCheckUtils]: 13: Hoare triple {27566#(and (= main_~z~0 0) (<= 49997 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {27567#(and (= main_~z~0 0) (<= 49996 main_~y~0))} is VALID [2022-04-28 03:46:35,006 INFO L290 TraceCheckUtils]: 14: Hoare triple {27567#(and (= main_~z~0 0) (<= 49996 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {27568#(and (= main_~z~0 0) (<= 49995 main_~y~0))} is VALID [2022-04-28 03:46:35,007 INFO L290 TraceCheckUtils]: 15: Hoare triple {27568#(and (= main_~z~0 0) (<= 49995 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {27569#(and (= main_~z~0 0) (<= 49994 main_~y~0))} is VALID [2022-04-28 03:46:35,007 INFO L290 TraceCheckUtils]: 16: Hoare triple {27569#(and (= main_~z~0 0) (<= 49994 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {27570#(and (= main_~z~0 0) (<= 49993 main_~y~0))} is VALID [2022-04-28 03:46:35,008 INFO L290 TraceCheckUtils]: 17: Hoare triple {27570#(and (= main_~z~0 0) (<= 49993 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {27571#(and (= main_~z~0 0) (<= 49992 main_~y~0))} is VALID [2022-04-28 03:46:35,008 INFO L290 TraceCheckUtils]: 18: Hoare triple {27571#(and (= main_~z~0 0) (<= 49992 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {27572#(and (= main_~z~0 0) (<= 49991 main_~y~0))} is VALID [2022-04-28 03:46:35,009 INFO L290 TraceCheckUtils]: 19: Hoare triple {27572#(and (= main_~z~0 0) (<= 49991 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {27573#(and (<= 49990 main_~y~0) (= main_~z~0 0))} is VALID [2022-04-28 03:46:35,009 INFO L290 TraceCheckUtils]: 20: Hoare triple {27573#(and (<= 49990 main_~y~0) (= main_~z~0 0))} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {27574#(and (= main_~z~0 0) (<= 49989 main_~y~0))} is VALID [2022-04-28 03:46:35,010 INFO L290 TraceCheckUtils]: 21: Hoare triple {27574#(and (= main_~z~0 0) (<= 49989 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {27575#(and (= main_~z~0 0) (<= 49988 main_~y~0))} is VALID [2022-04-28 03:46:35,010 INFO L290 TraceCheckUtils]: 22: Hoare triple {27575#(and (= main_~z~0 0) (<= 49988 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {27576#(and (= main_~z~0 0) (<= 49987 main_~y~0))} is VALID [2022-04-28 03:46:35,010 INFO L290 TraceCheckUtils]: 23: Hoare triple {27576#(and (= main_~z~0 0) (<= 49987 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {27577#(and (= main_~z~0 0) (<= 49986 main_~y~0))} is VALID [2022-04-28 03:46:35,011 INFO L290 TraceCheckUtils]: 24: Hoare triple {27577#(and (= main_~z~0 0) (<= 49986 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {27578#(and (= main_~z~0 0) (<= 49985 main_~y~0))} is VALID [2022-04-28 03:46:35,011 INFO L290 TraceCheckUtils]: 25: Hoare triple {27578#(and (= main_~z~0 0) (<= 49985 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {27579#(and (= main_~z~0 0) (<= 49984 main_~y~0))} is VALID [2022-04-28 03:46:35,012 INFO L290 TraceCheckUtils]: 26: Hoare triple {27579#(and (= main_~z~0 0) (<= 49984 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {27580#(and (= main_~z~0 0) (<= 49983 main_~y~0))} is VALID [2022-04-28 03:46:35,012 INFO L290 TraceCheckUtils]: 27: Hoare triple {27580#(and (= main_~z~0 0) (<= 49983 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {27581#(and (= main_~z~0 0) (<= 49982 main_~y~0))} is VALID [2022-04-28 03:46:35,013 INFO L290 TraceCheckUtils]: 28: Hoare triple {27581#(and (= main_~z~0 0) (<= 49982 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {27582#(and (<= 49981 main_~y~0) (= main_~z~0 0))} is VALID [2022-04-28 03:46:35,013 INFO L290 TraceCheckUtils]: 29: Hoare triple {27582#(and (<= 49981 main_~y~0) (= main_~z~0 0))} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {27583#(and (= main_~z~0 0) (<= 49980 main_~y~0))} is VALID [2022-04-28 03:46:35,014 INFO L290 TraceCheckUtils]: 30: Hoare triple {27583#(and (= main_~z~0 0) (<= 49980 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {27584#(and (= main_~z~0 0) (<= 49979 main_~y~0))} is VALID [2022-04-28 03:46:35,014 INFO L290 TraceCheckUtils]: 31: Hoare triple {27584#(and (= main_~z~0 0) (<= 49979 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {27585#(and (= main_~z~0 0) (<= 49978 main_~y~0))} is VALID [2022-04-28 03:46:35,015 INFO L290 TraceCheckUtils]: 32: Hoare triple {27585#(and (= main_~z~0 0) (<= 49978 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {27586#(and (= main_~z~0 0) (<= 49977 main_~y~0))} is VALID [2022-04-28 03:46:35,015 INFO L290 TraceCheckUtils]: 33: Hoare triple {27586#(and (= main_~z~0 0) (<= 49977 main_~y~0))} assume !(~y~0 > ~z~0); {27559#false} is VALID [2022-04-28 03:46:35,015 INFO L272 TraceCheckUtils]: 34: Hoare triple {27559#false} call __VERIFIER_assert((if ~x~0 == ~z~0 then 1 else 0)); {27559#false} is VALID [2022-04-28 03:46:35,015 INFO L290 TraceCheckUtils]: 35: Hoare triple {27559#false} ~cond := #in~cond; {27559#false} is VALID [2022-04-28 03:46:35,015 INFO L290 TraceCheckUtils]: 36: Hoare triple {27559#false} assume 0 == ~cond; {27559#false} is VALID [2022-04-28 03:46:35,015 INFO L290 TraceCheckUtils]: 37: Hoare triple {27559#false} assume !false; {27559#false} is VALID [2022-04-28 03:46:35,016 INFO L134 CoverageAnalysis]: Checked inductivity of 278 backedges. 0 proven. 276 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-04-28 03:46:35,016 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 03:46:35,016 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [619236895] [2022-04-28 03:46:35,016 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [619236895] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 03:46:35,016 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [125201391] [2022-04-28 03:46:35,016 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:46:35,016 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 03:46:35,016 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 03:46:35,017 INFO L229 MonitoredProcess]: Starting monitored process 30 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 03:46:35,018 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (30)] Waiting until timeout for monitored process [2022-04-28 03:46:35,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:46:35,062 INFO L263 TraceCheckSpWp]: Trace formula consists of 174 conjuncts, 27 conjunts are in the unsatisfiable core [2022-04-28 03:46:35,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:46:35,078 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 03:46:36,159 INFO L272 TraceCheckUtils]: 0: Hoare triple {27558#true} call ULTIMATE.init(); {27558#true} is VALID [2022-04-28 03:46:36,160 INFO L290 TraceCheckUtils]: 1: Hoare triple {27558#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(17, 2);call #Ultimate.allocInit(12, 3); {27558#true} is VALID [2022-04-28 03:46:36,160 INFO L290 TraceCheckUtils]: 2: Hoare triple {27558#true} assume true; {27558#true} is VALID [2022-04-28 03:46:36,160 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {27558#true} {27558#true} #52#return; {27558#true} is VALID [2022-04-28 03:46:36,160 INFO L272 TraceCheckUtils]: 4: Hoare triple {27558#true} call #t~ret9 := main(); {27558#true} is VALID [2022-04-28 03:46:36,160 INFO L290 TraceCheckUtils]: 5: Hoare triple {27558#true} ~x~0 := 0;~y~0 := 50000;~z~0 := 0;~x~0 := 0; {27606#(and (<= main_~z~0 0) (<= 50000 main_~y~0))} is VALID [2022-04-28 03:46:36,161 INFO L290 TraceCheckUtils]: 6: Hoare triple {27606#(and (<= main_~z~0 0) (<= 50000 main_~y~0))} [172] L11-2-->L18-1_primed: Formula: (let ((.cse0 (= v_main_~x~0_1337 v_main_~x~0_1336)) (.cse1 (= |v_main_#t~post4_179| |v_main_#t~post4_178|))) (or (and (<= 50000 v_main_~x~0_1337) .cse0 .cse1) (and (< v_main_~x~0_1336 50001) (< v_main_~x~0_1337 v_main_~x~0_1336)) (and .cse0 .cse1))) InVars {main_~x~0=v_main_~x~0_1337, main_#t~post4=|v_main_#t~post4_179|} OutVars{main_~x~0=v_main_~x~0_1336, main_#t~post4=|v_main_#t~post4_178|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {27606#(and (<= main_~z~0 0) (<= 50000 main_~y~0))} is VALID [2022-04-28 03:46:36,161 INFO L290 TraceCheckUtils]: 7: Hoare triple {27606#(and (<= main_~z~0 0) (<= 50000 main_~y~0))} [173] L18-1_primed-->L11-2: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {27606#(and (<= main_~z~0 0) (<= 50000 main_~y~0))} is VALID [2022-04-28 03:46:36,162 INFO L290 TraceCheckUtils]: 8: Hoare triple {27606#(and (<= main_~z~0 0) (<= 50000 main_~y~0))} [174] L11-2-->L18-1_primed: Formula: (let ((.cse0 (= v_main_~y~0_1388 v_main_~y~0_1387)) (.cse1 (= |v_main_#t~post6_200| |v_main_#t~post6_199|)) (.cse2 (= v_main_~x~0_1339 v_main_~x~0_1338)) (.cse3 (= |v_main_#t~post5_200| |v_main_#t~post5_199|)) (.cse4 (<= 50000 v_main_~x~0_1339))) (or (and .cse0 .cse1 .cse2 .cse3) (and .cse0 .cse1 (or (not (< v_main_~x~0_1339 1000000)) (not .cse4)) .cse2 .cse3) (let ((.cse5 (+ v_main_~x~0_1339 v_main_~y~0_1387))) (and .cse4 (< v_main_~y~0_1388 v_main_~y~0_1387) (= .cse5 (+ v_main_~x~0_1338 v_main_~y~0_1388)) (< .cse5 (+ 1000001 v_main_~y~0_1388)))))) InVars {main_~y~0=v_main_~y~0_1388, main_#t~post5=|v_main_#t~post5_200|, main_~x~0=v_main_~x~0_1339, main_#t~post6=|v_main_#t~post6_200|} OutVars{main_~y~0=v_main_~y~0_1387, main_#t~post5=|v_main_#t~post5_199|, main_~x~0=v_main_~x~0_1338, main_#t~post6=|v_main_#t~post6_199|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {27606#(and (<= main_~z~0 0) (<= 50000 main_~y~0))} is VALID [2022-04-28 03:46:36,162 INFO L290 TraceCheckUtils]: 9: Hoare triple {27606#(and (<= main_~z~0 0) (<= 50000 main_~y~0))} [171] L18-1_primed-->L18-1: Formula: (not (< v_main_~x~0_11 1000000)) InVars {main_~x~0=v_main_~x~0_11} OutVars{main_~x~0=v_main_~x~0_11} AuxVars[] AssignedVars[] {27606#(and (<= main_~z~0 0) (<= 50000 main_~y~0))} is VALID [2022-04-28 03:46:36,167 INFO L290 TraceCheckUtils]: 10: Hoare triple {27606#(and (<= main_~z~0 0) (<= 50000 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {27622#(and (<= main_~z~0 0) (<= 49999 main_~y~0))} is VALID [2022-04-28 03:46:36,168 INFO L290 TraceCheckUtils]: 11: Hoare triple {27622#(and (<= main_~z~0 0) (<= 49999 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {27626#(and (<= main_~z~0 0) (<= 49998 main_~y~0))} is VALID [2022-04-28 03:46:36,169 INFO L290 TraceCheckUtils]: 12: Hoare triple {27626#(and (<= main_~z~0 0) (<= 49998 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {27630#(and (<= main_~z~0 0) (<= 49997 main_~y~0))} is VALID [2022-04-28 03:46:36,169 INFO L290 TraceCheckUtils]: 13: Hoare triple {27630#(and (<= main_~z~0 0) (<= 49997 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {27634#(and (<= main_~z~0 0) (<= 49996 main_~y~0))} is VALID [2022-04-28 03:46:36,170 INFO L290 TraceCheckUtils]: 14: Hoare triple {27634#(and (<= main_~z~0 0) (<= 49996 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {27638#(and (<= main_~z~0 0) (<= 49995 main_~y~0))} is VALID [2022-04-28 03:46:36,170 INFO L290 TraceCheckUtils]: 15: Hoare triple {27638#(and (<= main_~z~0 0) (<= 49995 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {27642#(and (<= main_~z~0 0) (<= 49994 main_~y~0))} is VALID [2022-04-28 03:46:36,171 INFO L290 TraceCheckUtils]: 16: Hoare triple {27642#(and (<= main_~z~0 0) (<= 49994 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {27646#(and (<= main_~z~0 0) (<= 49993 main_~y~0))} is VALID [2022-04-28 03:46:36,172 INFO L290 TraceCheckUtils]: 17: Hoare triple {27646#(and (<= main_~z~0 0) (<= 49993 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {27650#(and (<= main_~z~0 0) (<= 49992 main_~y~0))} is VALID [2022-04-28 03:46:36,172 INFO L290 TraceCheckUtils]: 18: Hoare triple {27650#(and (<= main_~z~0 0) (<= 49992 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {27654#(and (<= main_~z~0 0) (<= 49991 main_~y~0))} is VALID [2022-04-28 03:46:36,173 INFO L290 TraceCheckUtils]: 19: Hoare triple {27654#(and (<= main_~z~0 0) (<= 49991 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {27658#(and (<= main_~z~0 0) (<= 49990 main_~y~0))} is VALID [2022-04-28 03:46:36,173 INFO L290 TraceCheckUtils]: 20: Hoare triple {27658#(and (<= main_~z~0 0) (<= 49990 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {27662#(and (<= main_~z~0 0) (<= 49989 main_~y~0))} is VALID [2022-04-28 03:46:36,174 INFO L290 TraceCheckUtils]: 21: Hoare triple {27662#(and (<= main_~z~0 0) (<= 49989 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {27666#(and (<= main_~z~0 0) (<= 49988 main_~y~0))} is VALID [2022-04-28 03:46:36,175 INFO L290 TraceCheckUtils]: 22: Hoare triple {27666#(and (<= main_~z~0 0) (<= 49988 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {27670#(and (<= main_~z~0 0) (<= 49987 main_~y~0))} is VALID [2022-04-28 03:46:36,175 INFO L290 TraceCheckUtils]: 23: Hoare triple {27670#(and (<= main_~z~0 0) (<= 49987 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {27674#(and (<= main_~z~0 0) (<= 49986 main_~y~0))} is VALID [2022-04-28 03:46:36,176 INFO L290 TraceCheckUtils]: 24: Hoare triple {27674#(and (<= main_~z~0 0) (<= 49986 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {27678#(and (<= main_~z~0 0) (<= 49985 main_~y~0))} is VALID [2022-04-28 03:46:36,177 INFO L290 TraceCheckUtils]: 25: Hoare triple {27678#(and (<= main_~z~0 0) (<= 49985 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {27682#(and (<= main_~z~0 0) (<= 49984 main_~y~0))} is VALID [2022-04-28 03:46:36,177 INFO L290 TraceCheckUtils]: 26: Hoare triple {27682#(and (<= main_~z~0 0) (<= 49984 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {27686#(and (<= main_~z~0 0) (<= 49983 main_~y~0))} is VALID [2022-04-28 03:46:36,178 INFO L290 TraceCheckUtils]: 27: Hoare triple {27686#(and (<= main_~z~0 0) (<= 49983 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {27690#(and (<= main_~z~0 0) (<= 49982 main_~y~0))} is VALID [2022-04-28 03:46:36,178 INFO L290 TraceCheckUtils]: 28: Hoare triple {27690#(and (<= main_~z~0 0) (<= 49982 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {27694#(and (<= main_~z~0 0) (<= 49981 main_~y~0))} is VALID [2022-04-28 03:46:36,179 INFO L290 TraceCheckUtils]: 29: Hoare triple {27694#(and (<= main_~z~0 0) (<= 49981 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {27698#(and (<= main_~z~0 0) (<= 49980 main_~y~0))} is VALID [2022-04-28 03:46:36,180 INFO L290 TraceCheckUtils]: 30: Hoare triple {27698#(and (<= main_~z~0 0) (<= 49980 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {27702#(and (<= main_~z~0 0) (<= 49979 main_~y~0))} is VALID [2022-04-28 03:46:36,180 INFO L290 TraceCheckUtils]: 31: Hoare triple {27702#(and (<= main_~z~0 0) (<= 49979 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {27706#(and (<= main_~z~0 0) (<= 49978 main_~y~0))} is VALID [2022-04-28 03:46:36,181 INFO L290 TraceCheckUtils]: 32: Hoare triple {27706#(and (<= main_~z~0 0) (<= 49978 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {27710#(and (<= main_~z~0 0) (<= 49977 main_~y~0))} is VALID [2022-04-28 03:46:36,181 INFO L290 TraceCheckUtils]: 33: Hoare triple {27710#(and (<= main_~z~0 0) (<= 49977 main_~y~0))} assume !(~y~0 > ~z~0); {27559#false} is VALID [2022-04-28 03:46:36,181 INFO L272 TraceCheckUtils]: 34: Hoare triple {27559#false} call __VERIFIER_assert((if ~x~0 == ~z~0 then 1 else 0)); {27559#false} is VALID [2022-04-28 03:46:36,181 INFO L290 TraceCheckUtils]: 35: Hoare triple {27559#false} ~cond := #in~cond; {27559#false} is VALID [2022-04-28 03:46:36,182 INFO L290 TraceCheckUtils]: 36: Hoare triple {27559#false} assume 0 == ~cond; {27559#false} is VALID [2022-04-28 03:46:36,182 INFO L290 TraceCheckUtils]: 37: Hoare triple {27559#false} assume !false; {27559#false} is VALID [2022-04-28 03:46:36,182 INFO L134 CoverageAnalysis]: Checked inductivity of 278 backedges. 0 proven. 276 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-04-28 03:46:36,182 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 03:46:37,657 INFO L290 TraceCheckUtils]: 37: Hoare triple {27559#false} assume !false; {27559#false} is VALID [2022-04-28 03:46:37,658 INFO L290 TraceCheckUtils]: 36: Hoare triple {27559#false} assume 0 == ~cond; {27559#false} is VALID [2022-04-28 03:46:37,658 INFO L290 TraceCheckUtils]: 35: Hoare triple {27559#false} ~cond := #in~cond; {27559#false} is VALID [2022-04-28 03:46:37,658 INFO L272 TraceCheckUtils]: 34: Hoare triple {27559#false} call __VERIFIER_assert((if ~x~0 == ~z~0 then 1 else 0)); {27559#false} is VALID [2022-04-28 03:46:37,658 INFO L290 TraceCheckUtils]: 33: Hoare triple {27738#(< main_~z~0 main_~y~0)} assume !(~y~0 > ~z~0); {27559#false} is VALID [2022-04-28 03:46:37,659 INFO L290 TraceCheckUtils]: 32: Hoare triple {27742#(< (+ main_~z~0 1) main_~y~0)} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {27738#(< main_~z~0 main_~y~0)} is VALID [2022-04-28 03:46:37,659 INFO L290 TraceCheckUtils]: 31: Hoare triple {27746#(< (+ main_~z~0 2) main_~y~0)} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {27742#(< (+ main_~z~0 1) main_~y~0)} is VALID [2022-04-28 03:46:37,659 INFO L290 TraceCheckUtils]: 30: Hoare triple {27750#(< (+ main_~z~0 3) main_~y~0)} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {27746#(< (+ main_~z~0 2) main_~y~0)} is VALID [2022-04-28 03:46:37,660 INFO L290 TraceCheckUtils]: 29: Hoare triple {27754#(< (+ main_~z~0 4) main_~y~0)} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {27750#(< (+ main_~z~0 3) main_~y~0)} is VALID [2022-04-28 03:46:37,660 INFO L290 TraceCheckUtils]: 28: Hoare triple {27758#(< (+ 5 main_~z~0) main_~y~0)} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {27754#(< (+ main_~z~0 4) main_~y~0)} is VALID [2022-04-28 03:46:37,661 INFO L290 TraceCheckUtils]: 27: Hoare triple {27762#(< (+ main_~z~0 6) main_~y~0)} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {27758#(< (+ 5 main_~z~0) main_~y~0)} is VALID [2022-04-28 03:46:37,661 INFO L290 TraceCheckUtils]: 26: Hoare triple {27766#(< (+ 7 main_~z~0) main_~y~0)} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {27762#(< (+ main_~z~0 6) main_~y~0)} is VALID [2022-04-28 03:46:37,662 INFO L290 TraceCheckUtils]: 25: Hoare triple {27770#(< (+ main_~z~0 8) main_~y~0)} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {27766#(< (+ 7 main_~z~0) main_~y~0)} is VALID [2022-04-28 03:46:37,662 INFO L290 TraceCheckUtils]: 24: Hoare triple {27774#(< (+ main_~z~0 9) main_~y~0)} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {27770#(< (+ main_~z~0 8) main_~y~0)} is VALID [2022-04-28 03:46:37,663 INFO L290 TraceCheckUtils]: 23: Hoare triple {27778#(< (+ main_~z~0 10) main_~y~0)} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {27774#(< (+ main_~z~0 9) main_~y~0)} is VALID [2022-04-28 03:46:37,663 INFO L290 TraceCheckUtils]: 22: Hoare triple {27782#(< (+ main_~z~0 11) main_~y~0)} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {27778#(< (+ main_~z~0 10) main_~y~0)} is VALID [2022-04-28 03:46:37,664 INFO L290 TraceCheckUtils]: 21: Hoare triple {27786#(< (+ main_~z~0 12) main_~y~0)} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {27782#(< (+ main_~z~0 11) main_~y~0)} is VALID [2022-04-28 03:46:37,664 INFO L290 TraceCheckUtils]: 20: Hoare triple {27790#(< (+ main_~z~0 13) main_~y~0)} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {27786#(< (+ main_~z~0 12) main_~y~0)} is VALID [2022-04-28 03:46:37,664 INFO L290 TraceCheckUtils]: 19: Hoare triple {27794#(< (+ main_~z~0 14) main_~y~0)} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {27790#(< (+ main_~z~0 13) main_~y~0)} is VALID [2022-04-28 03:46:37,665 INFO L290 TraceCheckUtils]: 18: Hoare triple {27798#(< (+ main_~z~0 15) main_~y~0)} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {27794#(< (+ main_~z~0 14) main_~y~0)} is VALID [2022-04-28 03:46:37,665 INFO L290 TraceCheckUtils]: 17: Hoare triple {27802#(< (+ main_~z~0 16) main_~y~0)} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {27798#(< (+ main_~z~0 15) main_~y~0)} is VALID [2022-04-28 03:46:37,666 INFO L290 TraceCheckUtils]: 16: Hoare triple {27806#(< (+ main_~z~0 17) main_~y~0)} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {27802#(< (+ main_~z~0 16) main_~y~0)} is VALID [2022-04-28 03:46:37,666 INFO L290 TraceCheckUtils]: 15: Hoare triple {27810#(< (+ main_~z~0 18) main_~y~0)} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {27806#(< (+ main_~z~0 17) main_~y~0)} is VALID [2022-04-28 03:46:37,667 INFO L290 TraceCheckUtils]: 14: Hoare triple {27814#(< (+ 19 main_~z~0) main_~y~0)} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {27810#(< (+ main_~z~0 18) main_~y~0)} is VALID [2022-04-28 03:46:37,667 INFO L290 TraceCheckUtils]: 13: Hoare triple {27818#(< (+ main_~z~0 20) main_~y~0)} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {27814#(< (+ 19 main_~z~0) main_~y~0)} is VALID [2022-04-28 03:46:37,668 INFO L290 TraceCheckUtils]: 12: Hoare triple {27822#(< (+ main_~z~0 21) main_~y~0)} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {27818#(< (+ main_~z~0 20) main_~y~0)} is VALID [2022-04-28 03:46:37,668 INFO L290 TraceCheckUtils]: 11: Hoare triple {27826#(< (+ main_~z~0 22) main_~y~0)} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {27822#(< (+ main_~z~0 21) main_~y~0)} is VALID [2022-04-28 03:46:37,669 INFO L290 TraceCheckUtils]: 10: Hoare triple {27830#(< (+ 23 main_~z~0) main_~y~0)} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {27826#(< (+ main_~z~0 22) main_~y~0)} is VALID [2022-04-28 03:46:37,669 INFO L290 TraceCheckUtils]: 9: Hoare triple {27830#(< (+ 23 main_~z~0) main_~y~0)} [171] L18-1_primed-->L18-1: Formula: (not (< v_main_~x~0_11 1000000)) InVars {main_~x~0=v_main_~x~0_11} OutVars{main_~x~0=v_main_~x~0_11} AuxVars[] AssignedVars[] {27830#(< (+ 23 main_~z~0) main_~y~0)} is VALID [2022-04-28 03:46:37,670 INFO L290 TraceCheckUtils]: 8: Hoare triple {27830#(< (+ 23 main_~z~0) main_~y~0)} [174] L11-2-->L18-1_primed: Formula: (let ((.cse0 (= v_main_~y~0_1388 v_main_~y~0_1387)) (.cse1 (= |v_main_#t~post6_200| |v_main_#t~post6_199|)) (.cse2 (= v_main_~x~0_1339 v_main_~x~0_1338)) (.cse3 (= |v_main_#t~post5_200| |v_main_#t~post5_199|)) (.cse4 (<= 50000 v_main_~x~0_1339))) (or (and .cse0 .cse1 .cse2 .cse3) (and .cse0 .cse1 (or (not (< v_main_~x~0_1339 1000000)) (not .cse4)) .cse2 .cse3) (let ((.cse5 (+ v_main_~x~0_1339 v_main_~y~0_1387))) (and .cse4 (< v_main_~y~0_1388 v_main_~y~0_1387) (= .cse5 (+ v_main_~x~0_1338 v_main_~y~0_1388)) (< .cse5 (+ 1000001 v_main_~y~0_1388)))))) InVars {main_~y~0=v_main_~y~0_1388, main_#t~post5=|v_main_#t~post5_200|, main_~x~0=v_main_~x~0_1339, main_#t~post6=|v_main_#t~post6_200|} OutVars{main_~y~0=v_main_~y~0_1387, main_#t~post5=|v_main_#t~post5_199|, main_~x~0=v_main_~x~0_1338, main_#t~post6=|v_main_#t~post6_199|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {27830#(< (+ 23 main_~z~0) main_~y~0)} is VALID [2022-04-28 03:46:37,670 INFO L290 TraceCheckUtils]: 7: Hoare triple {27830#(< (+ 23 main_~z~0) main_~y~0)} [173] L18-1_primed-->L11-2: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {27830#(< (+ 23 main_~z~0) main_~y~0)} is VALID [2022-04-28 03:46:37,670 INFO L290 TraceCheckUtils]: 6: Hoare triple {27830#(< (+ 23 main_~z~0) main_~y~0)} [172] L11-2-->L18-1_primed: Formula: (let ((.cse0 (= v_main_~x~0_1337 v_main_~x~0_1336)) (.cse1 (= |v_main_#t~post4_179| |v_main_#t~post4_178|))) (or (and (<= 50000 v_main_~x~0_1337) .cse0 .cse1) (and (< v_main_~x~0_1336 50001) (< v_main_~x~0_1337 v_main_~x~0_1336)) (and .cse0 .cse1))) InVars {main_~x~0=v_main_~x~0_1337, main_#t~post4=|v_main_#t~post4_179|} OutVars{main_~x~0=v_main_~x~0_1336, main_#t~post4=|v_main_#t~post4_178|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {27830#(< (+ 23 main_~z~0) main_~y~0)} is VALID [2022-04-28 03:46:37,671 INFO L290 TraceCheckUtils]: 5: Hoare triple {27558#true} ~x~0 := 0;~y~0 := 50000;~z~0 := 0;~x~0 := 0; {27830#(< (+ 23 main_~z~0) main_~y~0)} is VALID [2022-04-28 03:46:37,671 INFO L272 TraceCheckUtils]: 4: Hoare triple {27558#true} call #t~ret9 := main(); {27558#true} is VALID [2022-04-28 03:46:37,671 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {27558#true} {27558#true} #52#return; {27558#true} is VALID [2022-04-28 03:46:37,671 INFO L290 TraceCheckUtils]: 2: Hoare triple {27558#true} assume true; {27558#true} is VALID [2022-04-28 03:46:37,671 INFO L290 TraceCheckUtils]: 1: Hoare triple {27558#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(17, 2);call #Ultimate.allocInit(12, 3); {27558#true} is VALID [2022-04-28 03:46:37,671 INFO L272 TraceCheckUtils]: 0: Hoare triple {27558#true} call ULTIMATE.init(); {27558#true} is VALID [2022-04-28 03:46:37,671 INFO L134 CoverageAnalysis]: Checked inductivity of 278 backedges. 0 proven. 276 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-04-28 03:46:37,671 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [125201391] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 03:46:37,671 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 03:46:37,671 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 26, 26] total 75 [2022-04-28 03:46:39,386 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 03:46:39,386 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1740842437] [2022-04-28 03:46:39,386 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1740842437] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 03:46:39,387 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 03:46:39,387 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [69] imperfect sequences [] total 69 [2022-04-28 03:46:39,387 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2079189439] [2022-04-28 03:46:39,387 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 03:46:39,387 INFO L78 Accepts]: Start accepts. Automaton has has 69 states, 69 states have (on average 1.6376811594202898) internal successors, (113), 68 states have internal predecessors, (113), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 117 [2022-04-28 03:46:39,387 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 03:46:39,388 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 69 states, 69 states have (on average 1.6376811594202898) internal successors, (113), 68 states have internal predecessors, (113), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:46:39,470 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 117 edges. 117 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 03:46:39,470 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 69 states [2022-04-28 03:46:39,471 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 03:46:39,471 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 69 interpolants. [2022-04-28 03:46:39,472 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5576, Invalid=7996, Unknown=0, NotChecked=0, Total=13572 [2022-04-28 03:46:39,473 INFO L87 Difference]: Start difference. First operand 196 states and 200 transitions. Second operand has 69 states, 69 states have (on average 1.6376811594202898) internal successors, (113), 68 states have internal predecessors, (113), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:46:47,070 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:46:47,070 INFO L93 Difference]: Finished difference Result 311 states and 325 transitions. [2022-04-28 03:46:47,070 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 69 states. [2022-04-28 03:46:47,070 INFO L78 Accepts]: Start accepts. Automaton has has 69 states, 69 states have (on average 1.6376811594202898) internal successors, (113), 68 states have internal predecessors, (113), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 117 [2022-04-28 03:46:47,070 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 03:46:47,070 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 69 states, 69 states have (on average 1.6376811594202898) internal successors, (113), 68 states have internal predecessors, (113), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:46:47,077 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 141 transitions. [2022-04-28 03:46:47,077 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 69 states, 69 states have (on average 1.6376811594202898) internal successors, (113), 68 states have internal predecessors, (113), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:46:47,078 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 141 transitions. [2022-04-28 03:46:47,078 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 69 states and 141 transitions. [2022-04-28 03:46:47,187 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 141 edges. 141 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 03:46:47,189 INFO L225 Difference]: With dead ends: 311 [2022-04-28 03:46:47,189 INFO L226 Difference]: Without dead ends: 203 [2022-04-28 03:46:47,191 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 258 GetRequests, 75 SyntacticMatches, 2 SemanticMatches, 181 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9534 ImplicationChecksByTransitivity, 5.1s TimeCoverageRelationStatistics Valid=11382, Invalid=21924, Unknown=0, NotChecked=0, Total=33306 [2022-04-28 03:46:47,191 INFO L413 NwaCegarLoop]: 12 mSDtfsCounter, 227 mSDsluCounter, 27 mSDsCounter, 0 mSdLazyCounter, 3502 mSolverCounterSat, 124 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 227 SdHoareTripleChecker+Valid, 39 SdHoareTripleChecker+Invalid, 3626 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 124 IncrementalHoareTripleChecker+Valid, 3502 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.8s IncrementalHoareTripleChecker+Time [2022-04-28 03:46:47,191 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [227 Valid, 39 Invalid, 3626 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [124 Valid, 3502 Invalid, 0 Unknown, 0 Unchecked, 2.8s Time] [2022-04-28 03:46:47,191 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 203 states. [2022-04-28 03:46:47,430 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 203 to 123. [2022-04-28 03:46:47,430 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 03:46:47,430 INFO L82 GeneralOperation]: Start isEquivalent. First operand 203 states. Second operand has 123 states, 118 states have (on average 1.0338983050847457) internal successors, (122), 118 states have internal predecessors, (122), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:46:47,430 INFO L74 IsIncluded]: Start isIncluded. First operand 203 states. Second operand has 123 states, 118 states have (on average 1.0338983050847457) internal successors, (122), 118 states have internal predecessors, (122), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:46:47,431 INFO L87 Difference]: Start difference. First operand 203 states. Second operand has 123 states, 118 states have (on average 1.0338983050847457) internal successors, (122), 118 states have internal predecessors, (122), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:46:47,433 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:46:47,433 INFO L93 Difference]: Finished difference Result 203 states and 207 transitions. [2022-04-28 03:46:47,433 INFO L276 IsEmpty]: Start isEmpty. Operand 203 states and 207 transitions. [2022-04-28 03:46:47,434 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:46:47,434 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:46:47,434 INFO L74 IsIncluded]: Start isIncluded. First operand has 123 states, 118 states have (on average 1.0338983050847457) internal successors, (122), 118 states have internal predecessors, (122), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 203 states. [2022-04-28 03:46:47,434 INFO L87 Difference]: Start difference. First operand has 123 states, 118 states have (on average 1.0338983050847457) internal successors, (122), 118 states have internal predecessors, (122), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 203 states. [2022-04-28 03:46:47,437 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:46:47,437 INFO L93 Difference]: Finished difference Result 203 states and 207 transitions. [2022-04-28 03:46:47,437 INFO L276 IsEmpty]: Start isEmpty. Operand 203 states and 207 transitions. [2022-04-28 03:46:47,437 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:46:47,437 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:46:47,437 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 03:46:47,437 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 03:46:47,438 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 123 states, 118 states have (on average 1.0338983050847457) internal successors, (122), 118 states have internal predecessors, (122), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:46:47,439 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 123 states to 123 states and 126 transitions. [2022-04-28 03:46:47,439 INFO L78 Accepts]: Start accepts. Automaton has 123 states and 126 transitions. Word has length 117 [2022-04-28 03:46:47,439 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 03:46:47,439 INFO L495 AbstractCegarLoop]: Abstraction has 123 states and 126 transitions. [2022-04-28 03:46:47,440 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 69 states, 69 states have (on average 1.6376811594202898) internal successors, (113), 68 states have internal predecessors, (113), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:46:47,440 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 123 states and 126 transitions. [2022-04-28 03:46:47,587 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 126 edges. 126 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 03:46:47,588 INFO L276 IsEmpty]: Start isEmpty. Operand 123 states and 126 transitions. [2022-04-28 03:46:47,588 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2022-04-28 03:46:47,588 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 03:46:47,588 INFO L195 NwaCegarLoop]: trace histogram [43, 42, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 03:46:47,613 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (30)] Forceful destruction successful, exit code 0 [2022-04-28 03:46:47,789 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31,30 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 03:46:47,789 INFO L420 AbstractCegarLoop]: === Iteration 33 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 03:46:47,789 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 03:46:47,789 INFO L85 PathProgramCache]: Analyzing trace with hash 483082060, now seen corresponding path program 30 times [2022-04-28 03:46:47,789 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 03:46:47,789 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [200553529] [2022-04-28 03:46:47,925 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 1 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 03:46:48,121 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={1=1, 2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 03:46:48,122 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-28 03:46:48,124 INFO L85 PathProgramCache]: Analyzing trace with hash -2010798719, now seen corresponding path program 1 times [2022-04-28 03:46:48,124 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 03:46:48,124 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1152586252] [2022-04-28 03:46:48,124 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:46:48,124 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 03:46:48,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:46:48,646 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 03:46:48,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:46:48,649 INFO L290 TraceCheckUtils]: 0: Hoare triple {29344#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(17, 2);call #Ultimate.allocInit(12, 3); {29311#true} is VALID [2022-04-28 03:46:48,649 INFO L290 TraceCheckUtils]: 1: Hoare triple {29311#true} assume true; {29311#true} is VALID [2022-04-28 03:46:48,649 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {29311#true} {29311#true} #52#return; {29311#true} is VALID [2022-04-28 03:46:48,649 INFO L272 TraceCheckUtils]: 0: Hoare triple {29311#true} call ULTIMATE.init(); {29344#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 03:46:48,649 INFO L290 TraceCheckUtils]: 1: Hoare triple {29344#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(17, 2);call #Ultimate.allocInit(12, 3); {29311#true} is VALID [2022-04-28 03:46:48,649 INFO L290 TraceCheckUtils]: 2: Hoare triple {29311#true} assume true; {29311#true} is VALID [2022-04-28 03:46:48,650 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {29311#true} {29311#true} #52#return; {29311#true} is VALID [2022-04-28 03:46:48,650 INFO L272 TraceCheckUtils]: 4: Hoare triple {29311#true} call #t~ret9 := main(); {29311#true} is VALID [2022-04-28 03:46:48,650 INFO L290 TraceCheckUtils]: 5: Hoare triple {29311#true} ~x~0 := 0;~y~0 := 50000;~z~0 := 0;~x~0 := 0; {29316#(and (= main_~z~0 0) (= main_~x~0 0) (<= 50000 main_~y~0))} is VALID [2022-04-28 03:46:48,651 INFO L290 TraceCheckUtils]: 6: Hoare triple {29316#(and (= main_~z~0 0) (= main_~x~0 0) (<= 50000 main_~y~0))} [176] L11-2-->L18-1_primed: Formula: (let ((.cse0 (= |v_main_#t~post4_185| |v_main_#t~post4_184|)) (.cse1 (= v_main_~x~0_1417 v_main_~x~0_1416))) (or (and (< v_main_~x~0_1416 50001) (< v_main_~x~0_1417 v_main_~x~0_1416)) (and .cse0 .cse1) (and .cse0 .cse1 (not (< v_main_~x~0_1417 50000))))) InVars {main_~x~0=v_main_~x~0_1417, main_#t~post4=|v_main_#t~post4_185|} OutVars{main_~x~0=v_main_~x~0_1416, main_#t~post4=|v_main_#t~post4_184|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {29317#(and (= main_~z~0 0) (<= main_~x~0 50000) (<= 50000 main_~y~0))} is VALID [2022-04-28 03:46:48,651 INFO L290 TraceCheckUtils]: 7: Hoare triple {29317#(and (= main_~z~0 0) (<= main_~x~0 50000) (<= 50000 main_~y~0))} [177] L18-1_primed-->L11-2: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {29317#(and (= main_~z~0 0) (<= main_~x~0 50000) (<= 50000 main_~y~0))} is VALID [2022-04-28 03:46:48,652 INFO L290 TraceCheckUtils]: 8: Hoare triple {29317#(and (= main_~z~0 0) (<= main_~x~0 50000) (<= 50000 main_~y~0))} [178] L11-2-->L18-1_primed: Formula: (let ((.cse2 (= v_main_~x~0_1419 v_main_~x~0_1418)) (.cse3 (= v_main_~y~0_1483 v_main_~y~0_1482)) (.cse4 (= |v_main_#t~post5_207| |v_main_#t~post5_206|)) (.cse5 (= |v_main_#t~post6_207| |v_main_#t~post6_206|)) (.cse0 (<= 50000 v_main_~x~0_1419))) (or (let ((.cse1 (+ v_main_~x~0_1419 v_main_~y~0_1482))) (and .cse0 (< v_main_~y~0_1483 v_main_~y~0_1482) (= .cse1 (+ v_main_~x~0_1418 v_main_~y~0_1483)) (< .cse1 (+ 1000001 v_main_~y~0_1483)))) (and .cse2 .cse3 .cse4 .cse5) (and .cse2 .cse3 .cse4 .cse5 (or (not (< v_main_~x~0_1419 1000000)) (not .cse0))))) InVars {main_~y~0=v_main_~y~0_1483, main_#t~post5=|v_main_#t~post5_207|, main_~x~0=v_main_~x~0_1419, main_#t~post6=|v_main_#t~post6_207|} OutVars{main_~y~0=v_main_~y~0_1482, main_#t~post5=|v_main_#t~post5_206|, main_~x~0=v_main_~x~0_1418, main_#t~post6=|v_main_#t~post6_206|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {29318#(or (<= main_~x~0 50000) (and (= main_~z~0 0) (<= 50001 main_~y~0)))} is VALID [2022-04-28 03:46:48,652 INFO L290 TraceCheckUtils]: 9: Hoare triple {29318#(or (<= main_~x~0 50000) (and (= main_~z~0 0) (<= 50001 main_~y~0)))} [175] L18-1_primed-->L18-1: Formula: (not (< v_main_~x~0_11 1000000)) InVars {main_~x~0=v_main_~x~0_11} OutVars{main_~x~0=v_main_~x~0_11} AuxVars[] AssignedVars[] {29319#(and (= main_~z~0 0) (<= 50001 main_~y~0))} is VALID [2022-04-28 03:46:48,653 INFO L290 TraceCheckUtils]: 10: Hoare triple {29319#(and (= main_~z~0 0) (<= 50001 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {29320#(and (= main_~z~0 0) (<= 50000 main_~y~0))} is VALID [2022-04-28 03:46:48,653 INFO L290 TraceCheckUtils]: 11: Hoare triple {29320#(and (= main_~z~0 0) (<= 50000 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {29321#(and (= main_~z~0 0) (<= 49999 main_~y~0))} is VALID [2022-04-28 03:46:48,654 INFO L290 TraceCheckUtils]: 12: Hoare triple {29321#(and (= main_~z~0 0) (<= 49999 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {29322#(and (<= 49998 main_~y~0) (= main_~z~0 0))} is VALID [2022-04-28 03:46:48,654 INFO L290 TraceCheckUtils]: 13: Hoare triple {29322#(and (<= 49998 main_~y~0) (= main_~z~0 0))} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {29323#(and (= main_~z~0 0) (<= 49997 main_~y~0))} is VALID [2022-04-28 03:46:48,654 INFO L290 TraceCheckUtils]: 14: Hoare triple {29323#(and (= main_~z~0 0) (<= 49997 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {29324#(and (= main_~z~0 0) (<= 49996 main_~y~0))} is VALID [2022-04-28 03:46:48,655 INFO L290 TraceCheckUtils]: 15: Hoare triple {29324#(and (= main_~z~0 0) (<= 49996 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {29325#(and (= main_~z~0 0) (<= 49995 main_~y~0))} is VALID [2022-04-28 03:46:48,655 INFO L290 TraceCheckUtils]: 16: Hoare triple {29325#(and (= main_~z~0 0) (<= 49995 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {29326#(and (= main_~z~0 0) (<= 49994 main_~y~0))} is VALID [2022-04-28 03:46:48,656 INFO L290 TraceCheckUtils]: 17: Hoare triple {29326#(and (= main_~z~0 0) (<= 49994 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {29327#(and (= main_~z~0 0) (<= 49993 main_~y~0))} is VALID [2022-04-28 03:46:48,656 INFO L290 TraceCheckUtils]: 18: Hoare triple {29327#(and (= main_~z~0 0) (<= 49993 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {29328#(and (= main_~z~0 0) (<= 49992 main_~y~0))} is VALID [2022-04-28 03:46:48,657 INFO L290 TraceCheckUtils]: 19: Hoare triple {29328#(and (= main_~z~0 0) (<= 49992 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {29329#(and (= main_~z~0 0) (<= 49991 main_~y~0))} is VALID [2022-04-28 03:46:48,657 INFO L290 TraceCheckUtils]: 20: Hoare triple {29329#(and (= main_~z~0 0) (<= 49991 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {29330#(and (<= 49990 main_~y~0) (= main_~z~0 0))} is VALID [2022-04-28 03:46:48,658 INFO L290 TraceCheckUtils]: 21: Hoare triple {29330#(and (<= 49990 main_~y~0) (= main_~z~0 0))} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {29331#(and (= main_~z~0 0) (<= 49989 main_~y~0))} is VALID [2022-04-28 03:46:48,658 INFO L290 TraceCheckUtils]: 22: Hoare triple {29331#(and (= main_~z~0 0) (<= 49989 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {29332#(and (= main_~z~0 0) (<= 49988 main_~y~0))} is VALID [2022-04-28 03:46:48,659 INFO L290 TraceCheckUtils]: 23: Hoare triple {29332#(and (= main_~z~0 0) (<= 49988 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {29333#(and (= main_~z~0 0) (<= 49987 main_~y~0))} is VALID [2022-04-28 03:46:48,659 INFO L290 TraceCheckUtils]: 24: Hoare triple {29333#(and (= main_~z~0 0) (<= 49987 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {29334#(and (= main_~z~0 0) (<= 49986 main_~y~0))} is VALID [2022-04-28 03:46:48,660 INFO L290 TraceCheckUtils]: 25: Hoare triple {29334#(and (= main_~z~0 0) (<= 49986 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {29335#(and (= main_~z~0 0) (<= 49985 main_~y~0))} is VALID [2022-04-28 03:46:48,660 INFO L290 TraceCheckUtils]: 26: Hoare triple {29335#(and (= main_~z~0 0) (<= 49985 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {29336#(and (= main_~z~0 0) (<= 49984 main_~y~0))} is VALID [2022-04-28 03:46:48,661 INFO L290 TraceCheckUtils]: 27: Hoare triple {29336#(and (= main_~z~0 0) (<= 49984 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {29337#(and (= main_~z~0 0) (<= 49983 main_~y~0))} is VALID [2022-04-28 03:46:48,661 INFO L290 TraceCheckUtils]: 28: Hoare triple {29337#(and (= main_~z~0 0) (<= 49983 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {29338#(and (= main_~z~0 0) (<= 49982 main_~y~0))} is VALID [2022-04-28 03:46:48,662 INFO L290 TraceCheckUtils]: 29: Hoare triple {29338#(and (= main_~z~0 0) (<= 49982 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {29339#(and (<= 49981 main_~y~0) (= main_~z~0 0))} is VALID [2022-04-28 03:46:48,662 INFO L290 TraceCheckUtils]: 30: Hoare triple {29339#(and (<= 49981 main_~y~0) (= main_~z~0 0))} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {29340#(and (= main_~z~0 0) (<= 49980 main_~y~0))} is VALID [2022-04-28 03:46:48,663 INFO L290 TraceCheckUtils]: 31: Hoare triple {29340#(and (= main_~z~0 0) (<= 49980 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {29341#(and (= main_~z~0 0) (<= 49979 main_~y~0))} is VALID [2022-04-28 03:46:48,663 INFO L290 TraceCheckUtils]: 32: Hoare triple {29341#(and (= main_~z~0 0) (<= 49979 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {29342#(and (= main_~z~0 0) (<= 49978 main_~y~0))} is VALID [2022-04-28 03:46:48,664 INFO L290 TraceCheckUtils]: 33: Hoare triple {29342#(and (= main_~z~0 0) (<= 49978 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {29343#(and (= main_~z~0 0) (<= 49977 main_~y~0))} is VALID [2022-04-28 03:46:48,664 INFO L290 TraceCheckUtils]: 34: Hoare triple {29343#(and (= main_~z~0 0) (<= 49977 main_~y~0))} assume !(~y~0 > ~z~0); {29312#false} is VALID [2022-04-28 03:46:48,664 INFO L272 TraceCheckUtils]: 35: Hoare triple {29312#false} call __VERIFIER_assert((if ~x~0 == ~z~0 then 1 else 0)); {29312#false} is VALID [2022-04-28 03:46:48,664 INFO L290 TraceCheckUtils]: 36: Hoare triple {29312#false} ~cond := #in~cond; {29312#false} is VALID [2022-04-28 03:46:48,664 INFO L290 TraceCheckUtils]: 37: Hoare triple {29312#false} assume 0 == ~cond; {29312#false} is VALID [2022-04-28 03:46:48,664 INFO L290 TraceCheckUtils]: 38: Hoare triple {29312#false} assume !false; {29312#false} is VALID [2022-04-28 03:46:48,664 INFO L134 CoverageAnalysis]: Checked inductivity of 302 backedges. 0 proven. 302 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 03:46:48,665 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 03:46:48,665 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1152586252] [2022-04-28 03:46:48,665 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1152586252] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 03:46:48,665 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [47873857] [2022-04-28 03:46:48,665 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:46:48,665 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 03:46:48,665 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 03:46:48,666 INFO L229 MonitoredProcess]: Starting monitored process 31 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 03:46:48,667 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (31)] Waiting until timeout for monitored process [2022-04-28 03:46:48,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:46:48,721 INFO L263 TraceCheckSpWp]: Trace formula consists of 179 conjuncts, 28 conjunts are in the unsatisfiable core [2022-04-28 03:46:48,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:46:48,738 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 03:46:49,909 INFO L272 TraceCheckUtils]: 0: Hoare triple {29311#true} call ULTIMATE.init(); {29311#true} is VALID [2022-04-28 03:46:49,910 INFO L290 TraceCheckUtils]: 1: Hoare triple {29311#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(17, 2);call #Ultimate.allocInit(12, 3); {29311#true} is VALID [2022-04-28 03:46:49,910 INFO L290 TraceCheckUtils]: 2: Hoare triple {29311#true} assume true; {29311#true} is VALID [2022-04-28 03:46:49,910 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {29311#true} {29311#true} #52#return; {29311#true} is VALID [2022-04-28 03:46:49,910 INFO L272 TraceCheckUtils]: 4: Hoare triple {29311#true} call #t~ret9 := main(); {29311#true} is VALID [2022-04-28 03:46:49,910 INFO L290 TraceCheckUtils]: 5: Hoare triple {29311#true} ~x~0 := 0;~y~0 := 50000;~z~0 := 0;~x~0 := 0; {29363#(and (<= main_~z~0 0) (<= 50000 main_~y~0))} is VALID [2022-04-28 03:46:49,910 INFO L290 TraceCheckUtils]: 6: Hoare triple {29363#(and (<= main_~z~0 0) (<= 50000 main_~y~0))} [176] L11-2-->L18-1_primed: Formula: (let ((.cse0 (= |v_main_#t~post4_185| |v_main_#t~post4_184|)) (.cse1 (= v_main_~x~0_1417 v_main_~x~0_1416))) (or (and (< v_main_~x~0_1416 50001) (< v_main_~x~0_1417 v_main_~x~0_1416)) (and .cse0 .cse1) (and .cse0 .cse1 (not (< v_main_~x~0_1417 50000))))) InVars {main_~x~0=v_main_~x~0_1417, main_#t~post4=|v_main_#t~post4_185|} OutVars{main_~x~0=v_main_~x~0_1416, main_#t~post4=|v_main_#t~post4_184|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {29363#(and (<= main_~z~0 0) (<= 50000 main_~y~0))} is VALID [2022-04-28 03:46:49,911 INFO L290 TraceCheckUtils]: 7: Hoare triple {29363#(and (<= main_~z~0 0) (<= 50000 main_~y~0))} [177] L18-1_primed-->L11-2: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {29363#(and (<= main_~z~0 0) (<= 50000 main_~y~0))} is VALID [2022-04-28 03:46:49,912 INFO L290 TraceCheckUtils]: 8: Hoare triple {29363#(and (<= main_~z~0 0) (<= 50000 main_~y~0))} [178] L11-2-->L18-1_primed: Formula: (let ((.cse2 (= v_main_~x~0_1419 v_main_~x~0_1418)) (.cse3 (= v_main_~y~0_1483 v_main_~y~0_1482)) (.cse4 (= |v_main_#t~post5_207| |v_main_#t~post5_206|)) (.cse5 (= |v_main_#t~post6_207| |v_main_#t~post6_206|)) (.cse0 (<= 50000 v_main_~x~0_1419))) (or (let ((.cse1 (+ v_main_~x~0_1419 v_main_~y~0_1482))) (and .cse0 (< v_main_~y~0_1483 v_main_~y~0_1482) (= .cse1 (+ v_main_~x~0_1418 v_main_~y~0_1483)) (< .cse1 (+ 1000001 v_main_~y~0_1483)))) (and .cse2 .cse3 .cse4 .cse5) (and .cse2 .cse3 .cse4 .cse5 (or (not (< v_main_~x~0_1419 1000000)) (not .cse0))))) InVars {main_~y~0=v_main_~y~0_1483, main_#t~post5=|v_main_#t~post5_207|, main_~x~0=v_main_~x~0_1419, main_#t~post6=|v_main_#t~post6_207|} OutVars{main_~y~0=v_main_~y~0_1482, main_#t~post5=|v_main_#t~post5_206|, main_~x~0=v_main_~x~0_1418, main_#t~post6=|v_main_#t~post6_206|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {29363#(and (<= main_~z~0 0) (<= 50000 main_~y~0))} is VALID [2022-04-28 03:46:49,912 INFO L290 TraceCheckUtils]: 9: Hoare triple {29363#(and (<= main_~z~0 0) (<= 50000 main_~y~0))} [175] L18-1_primed-->L18-1: Formula: (not (< v_main_~x~0_11 1000000)) InVars {main_~x~0=v_main_~x~0_11} OutVars{main_~x~0=v_main_~x~0_11} AuxVars[] AssignedVars[] {29363#(and (<= main_~z~0 0) (<= 50000 main_~y~0))} is VALID [2022-04-28 03:46:49,912 INFO L290 TraceCheckUtils]: 10: Hoare triple {29363#(and (<= main_~z~0 0) (<= 50000 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {29379#(and (<= main_~z~0 0) (<= 49999 main_~y~0))} is VALID [2022-04-28 03:46:49,913 INFO L290 TraceCheckUtils]: 11: Hoare triple {29379#(and (<= main_~z~0 0) (<= 49999 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {29383#(and (<= main_~z~0 0) (<= 49998 main_~y~0))} is VALID [2022-04-28 03:46:49,913 INFO L290 TraceCheckUtils]: 12: Hoare triple {29383#(and (<= main_~z~0 0) (<= 49998 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {29387#(and (<= main_~z~0 0) (<= 49997 main_~y~0))} is VALID [2022-04-28 03:46:49,914 INFO L290 TraceCheckUtils]: 13: Hoare triple {29387#(and (<= main_~z~0 0) (<= 49997 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {29391#(and (<= main_~z~0 0) (<= 49996 main_~y~0))} is VALID [2022-04-28 03:46:49,914 INFO L290 TraceCheckUtils]: 14: Hoare triple {29391#(and (<= main_~z~0 0) (<= 49996 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {29395#(and (<= main_~z~0 0) (<= 49995 main_~y~0))} is VALID [2022-04-28 03:46:49,915 INFO L290 TraceCheckUtils]: 15: Hoare triple {29395#(and (<= main_~z~0 0) (<= 49995 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {29399#(and (<= main_~z~0 0) (<= 49994 main_~y~0))} is VALID [2022-04-28 03:46:49,915 INFO L290 TraceCheckUtils]: 16: Hoare triple {29399#(and (<= main_~z~0 0) (<= 49994 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {29403#(and (<= main_~z~0 0) (<= 49993 main_~y~0))} is VALID [2022-04-28 03:46:49,916 INFO L290 TraceCheckUtils]: 17: Hoare triple {29403#(and (<= main_~z~0 0) (<= 49993 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {29407#(and (<= main_~z~0 0) (<= 49992 main_~y~0))} is VALID [2022-04-28 03:46:49,916 INFO L290 TraceCheckUtils]: 18: Hoare triple {29407#(and (<= main_~z~0 0) (<= 49992 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {29411#(and (<= main_~z~0 0) (<= 49991 main_~y~0))} is VALID [2022-04-28 03:46:49,917 INFO L290 TraceCheckUtils]: 19: Hoare triple {29411#(and (<= main_~z~0 0) (<= 49991 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {29415#(and (<= main_~z~0 0) (<= 49990 main_~y~0))} is VALID [2022-04-28 03:46:49,917 INFO L290 TraceCheckUtils]: 20: Hoare triple {29415#(and (<= main_~z~0 0) (<= 49990 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {29419#(and (<= main_~z~0 0) (<= 49989 main_~y~0))} is VALID [2022-04-28 03:46:49,918 INFO L290 TraceCheckUtils]: 21: Hoare triple {29419#(and (<= main_~z~0 0) (<= 49989 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {29423#(and (<= main_~z~0 0) (<= 49988 main_~y~0))} is VALID [2022-04-28 03:46:49,918 INFO L290 TraceCheckUtils]: 22: Hoare triple {29423#(and (<= main_~z~0 0) (<= 49988 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {29427#(and (<= main_~z~0 0) (<= 49987 main_~y~0))} is VALID [2022-04-28 03:46:49,919 INFO L290 TraceCheckUtils]: 23: Hoare triple {29427#(and (<= main_~z~0 0) (<= 49987 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {29431#(and (<= main_~z~0 0) (<= 49986 main_~y~0))} is VALID [2022-04-28 03:46:49,919 INFO L290 TraceCheckUtils]: 24: Hoare triple {29431#(and (<= main_~z~0 0) (<= 49986 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {29435#(and (<= main_~z~0 0) (<= 49985 main_~y~0))} is VALID [2022-04-28 03:46:49,920 INFO L290 TraceCheckUtils]: 25: Hoare triple {29435#(and (<= main_~z~0 0) (<= 49985 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {29439#(and (<= main_~z~0 0) (<= 49984 main_~y~0))} is VALID [2022-04-28 03:46:49,920 INFO L290 TraceCheckUtils]: 26: Hoare triple {29439#(and (<= main_~z~0 0) (<= 49984 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {29443#(and (<= main_~z~0 0) (<= 49983 main_~y~0))} is VALID [2022-04-28 03:46:49,920 INFO L290 TraceCheckUtils]: 27: Hoare triple {29443#(and (<= main_~z~0 0) (<= 49983 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {29447#(and (<= main_~z~0 0) (<= 49982 main_~y~0))} is VALID [2022-04-28 03:46:49,921 INFO L290 TraceCheckUtils]: 28: Hoare triple {29447#(and (<= main_~z~0 0) (<= 49982 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {29451#(and (<= main_~z~0 0) (<= 49981 main_~y~0))} is VALID [2022-04-28 03:46:49,921 INFO L290 TraceCheckUtils]: 29: Hoare triple {29451#(and (<= main_~z~0 0) (<= 49981 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {29455#(and (<= main_~z~0 0) (<= 49980 main_~y~0))} is VALID [2022-04-28 03:46:49,922 INFO L290 TraceCheckUtils]: 30: Hoare triple {29455#(and (<= main_~z~0 0) (<= 49980 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {29459#(and (<= main_~z~0 0) (<= 49979 main_~y~0))} is VALID [2022-04-28 03:46:49,922 INFO L290 TraceCheckUtils]: 31: Hoare triple {29459#(and (<= main_~z~0 0) (<= 49979 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {29463#(and (<= main_~z~0 0) (<= 49978 main_~y~0))} is VALID [2022-04-28 03:46:49,923 INFO L290 TraceCheckUtils]: 32: Hoare triple {29463#(and (<= main_~z~0 0) (<= 49978 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {29467#(and (<= main_~z~0 0) (<= 49977 main_~y~0))} is VALID [2022-04-28 03:46:49,923 INFO L290 TraceCheckUtils]: 33: Hoare triple {29467#(and (<= main_~z~0 0) (<= 49977 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {29471#(and (<= main_~z~0 0) (<= 49976 main_~y~0))} is VALID [2022-04-28 03:46:49,924 INFO L290 TraceCheckUtils]: 34: Hoare triple {29471#(and (<= main_~z~0 0) (<= 49976 main_~y~0))} assume !(~y~0 > ~z~0); {29312#false} is VALID [2022-04-28 03:46:49,924 INFO L272 TraceCheckUtils]: 35: Hoare triple {29312#false} call __VERIFIER_assert((if ~x~0 == ~z~0 then 1 else 0)); {29312#false} is VALID [2022-04-28 03:46:49,924 INFO L290 TraceCheckUtils]: 36: Hoare triple {29312#false} ~cond := #in~cond; {29312#false} is VALID [2022-04-28 03:46:49,924 INFO L290 TraceCheckUtils]: 37: Hoare triple {29312#false} assume 0 == ~cond; {29312#false} is VALID [2022-04-28 03:46:49,924 INFO L290 TraceCheckUtils]: 38: Hoare triple {29312#false} assume !false; {29312#false} is VALID [2022-04-28 03:46:49,924 INFO L134 CoverageAnalysis]: Checked inductivity of 302 backedges. 0 proven. 300 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-04-28 03:46:49,924 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 03:46:51,575 INFO L290 TraceCheckUtils]: 38: Hoare triple {29312#false} assume !false; {29312#false} is VALID [2022-04-28 03:46:51,576 INFO L290 TraceCheckUtils]: 37: Hoare triple {29312#false} assume 0 == ~cond; {29312#false} is VALID [2022-04-28 03:46:51,576 INFO L290 TraceCheckUtils]: 36: Hoare triple {29312#false} ~cond := #in~cond; {29312#false} is VALID [2022-04-28 03:46:51,576 INFO L272 TraceCheckUtils]: 35: Hoare triple {29312#false} call __VERIFIER_assert((if ~x~0 == ~z~0 then 1 else 0)); {29312#false} is VALID [2022-04-28 03:46:51,576 INFO L290 TraceCheckUtils]: 34: Hoare triple {29499#(< main_~z~0 main_~y~0)} assume !(~y~0 > ~z~0); {29312#false} is VALID [2022-04-28 03:46:51,576 INFO L290 TraceCheckUtils]: 33: Hoare triple {29503#(< (+ main_~z~0 1) main_~y~0)} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {29499#(< main_~z~0 main_~y~0)} is VALID [2022-04-28 03:46:51,577 INFO L290 TraceCheckUtils]: 32: Hoare triple {29507#(< (+ main_~z~0 2) main_~y~0)} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {29503#(< (+ main_~z~0 1) main_~y~0)} is VALID [2022-04-28 03:46:51,577 INFO L290 TraceCheckUtils]: 31: Hoare triple {29511#(< (+ main_~z~0 3) main_~y~0)} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {29507#(< (+ main_~z~0 2) main_~y~0)} is VALID [2022-04-28 03:46:51,578 INFO L290 TraceCheckUtils]: 30: Hoare triple {29515#(< (+ main_~z~0 4) main_~y~0)} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {29511#(< (+ main_~z~0 3) main_~y~0)} is VALID [2022-04-28 03:46:51,578 INFO L290 TraceCheckUtils]: 29: Hoare triple {29519#(< (+ 5 main_~z~0) main_~y~0)} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {29515#(< (+ main_~z~0 4) main_~y~0)} is VALID [2022-04-28 03:46:51,579 INFO L290 TraceCheckUtils]: 28: Hoare triple {29523#(< (+ main_~z~0 6) main_~y~0)} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {29519#(< (+ 5 main_~z~0) main_~y~0)} is VALID [2022-04-28 03:46:51,579 INFO L290 TraceCheckUtils]: 27: Hoare triple {29527#(< (+ 7 main_~z~0) main_~y~0)} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {29523#(< (+ main_~z~0 6) main_~y~0)} is VALID [2022-04-28 03:46:51,580 INFO L290 TraceCheckUtils]: 26: Hoare triple {29531#(< (+ main_~z~0 8) main_~y~0)} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {29527#(< (+ 7 main_~z~0) main_~y~0)} is VALID [2022-04-28 03:46:51,580 INFO L290 TraceCheckUtils]: 25: Hoare triple {29535#(< (+ main_~z~0 9) main_~y~0)} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {29531#(< (+ main_~z~0 8) main_~y~0)} is VALID [2022-04-28 03:46:51,581 INFO L290 TraceCheckUtils]: 24: Hoare triple {29539#(< (+ main_~z~0 10) main_~y~0)} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {29535#(< (+ main_~z~0 9) main_~y~0)} is VALID [2022-04-28 03:46:51,581 INFO L290 TraceCheckUtils]: 23: Hoare triple {29543#(< (+ main_~z~0 11) main_~y~0)} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {29539#(< (+ main_~z~0 10) main_~y~0)} is VALID [2022-04-28 03:46:51,581 INFO L290 TraceCheckUtils]: 22: Hoare triple {29547#(< (+ main_~z~0 12) main_~y~0)} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {29543#(< (+ main_~z~0 11) main_~y~0)} is VALID [2022-04-28 03:46:51,582 INFO L290 TraceCheckUtils]: 21: Hoare triple {29551#(< (+ main_~z~0 13) main_~y~0)} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {29547#(< (+ main_~z~0 12) main_~y~0)} is VALID [2022-04-28 03:46:51,582 INFO L290 TraceCheckUtils]: 20: Hoare triple {29555#(< (+ main_~z~0 14) main_~y~0)} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {29551#(< (+ main_~z~0 13) main_~y~0)} is VALID [2022-04-28 03:46:51,583 INFO L290 TraceCheckUtils]: 19: Hoare triple {29559#(< (+ main_~z~0 15) main_~y~0)} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {29555#(< (+ main_~z~0 14) main_~y~0)} is VALID [2022-04-28 03:46:51,583 INFO L290 TraceCheckUtils]: 18: Hoare triple {29563#(< (+ main_~z~0 16) main_~y~0)} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {29559#(< (+ main_~z~0 15) main_~y~0)} is VALID [2022-04-28 03:46:51,584 INFO L290 TraceCheckUtils]: 17: Hoare triple {29567#(< (+ main_~z~0 17) main_~y~0)} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {29563#(< (+ main_~z~0 16) main_~y~0)} is VALID [2022-04-28 03:46:51,585 INFO L290 TraceCheckUtils]: 16: Hoare triple {29571#(< (+ main_~z~0 18) main_~y~0)} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {29567#(< (+ main_~z~0 17) main_~y~0)} is VALID [2022-04-28 03:46:51,585 INFO L290 TraceCheckUtils]: 15: Hoare triple {29575#(< (+ 19 main_~z~0) main_~y~0)} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {29571#(< (+ main_~z~0 18) main_~y~0)} is VALID [2022-04-28 03:46:51,585 INFO L290 TraceCheckUtils]: 14: Hoare triple {29579#(< (+ main_~z~0 20) main_~y~0)} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {29575#(< (+ 19 main_~z~0) main_~y~0)} is VALID [2022-04-28 03:46:51,586 INFO L290 TraceCheckUtils]: 13: Hoare triple {29583#(< (+ main_~z~0 21) main_~y~0)} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {29579#(< (+ main_~z~0 20) main_~y~0)} is VALID [2022-04-28 03:46:51,586 INFO L290 TraceCheckUtils]: 12: Hoare triple {29587#(< (+ main_~z~0 22) main_~y~0)} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {29583#(< (+ main_~z~0 21) main_~y~0)} is VALID [2022-04-28 03:46:51,587 INFO L290 TraceCheckUtils]: 11: Hoare triple {29591#(< (+ 23 main_~z~0) main_~y~0)} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {29587#(< (+ main_~z~0 22) main_~y~0)} is VALID [2022-04-28 03:46:51,587 INFO L290 TraceCheckUtils]: 10: Hoare triple {29595#(< (+ main_~z~0 24) main_~y~0)} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {29591#(< (+ 23 main_~z~0) main_~y~0)} is VALID [2022-04-28 03:46:51,588 INFO L290 TraceCheckUtils]: 9: Hoare triple {29595#(< (+ main_~z~0 24) main_~y~0)} [175] L18-1_primed-->L18-1: Formula: (not (< v_main_~x~0_11 1000000)) InVars {main_~x~0=v_main_~x~0_11} OutVars{main_~x~0=v_main_~x~0_11} AuxVars[] AssignedVars[] {29595#(< (+ main_~z~0 24) main_~y~0)} is VALID [2022-04-28 03:46:51,588 INFO L290 TraceCheckUtils]: 8: Hoare triple {29595#(< (+ main_~z~0 24) main_~y~0)} [178] L11-2-->L18-1_primed: Formula: (let ((.cse2 (= v_main_~x~0_1419 v_main_~x~0_1418)) (.cse3 (= v_main_~y~0_1483 v_main_~y~0_1482)) (.cse4 (= |v_main_#t~post5_207| |v_main_#t~post5_206|)) (.cse5 (= |v_main_#t~post6_207| |v_main_#t~post6_206|)) (.cse0 (<= 50000 v_main_~x~0_1419))) (or (let ((.cse1 (+ v_main_~x~0_1419 v_main_~y~0_1482))) (and .cse0 (< v_main_~y~0_1483 v_main_~y~0_1482) (= .cse1 (+ v_main_~x~0_1418 v_main_~y~0_1483)) (< .cse1 (+ 1000001 v_main_~y~0_1483)))) (and .cse2 .cse3 .cse4 .cse5) (and .cse2 .cse3 .cse4 .cse5 (or (not (< v_main_~x~0_1419 1000000)) (not .cse0))))) InVars {main_~y~0=v_main_~y~0_1483, main_#t~post5=|v_main_#t~post5_207|, main_~x~0=v_main_~x~0_1419, main_#t~post6=|v_main_#t~post6_207|} OutVars{main_~y~0=v_main_~y~0_1482, main_#t~post5=|v_main_#t~post5_206|, main_~x~0=v_main_~x~0_1418, main_#t~post6=|v_main_#t~post6_206|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {29595#(< (+ main_~z~0 24) main_~y~0)} is VALID [2022-04-28 03:46:51,589 INFO L290 TraceCheckUtils]: 7: Hoare triple {29595#(< (+ main_~z~0 24) main_~y~0)} [177] L18-1_primed-->L11-2: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {29595#(< (+ main_~z~0 24) main_~y~0)} is VALID [2022-04-28 03:46:51,589 INFO L290 TraceCheckUtils]: 6: Hoare triple {29595#(< (+ main_~z~0 24) main_~y~0)} [176] L11-2-->L18-1_primed: Formula: (let ((.cse0 (= |v_main_#t~post4_185| |v_main_#t~post4_184|)) (.cse1 (= v_main_~x~0_1417 v_main_~x~0_1416))) (or (and (< v_main_~x~0_1416 50001) (< v_main_~x~0_1417 v_main_~x~0_1416)) (and .cse0 .cse1) (and .cse0 .cse1 (not (< v_main_~x~0_1417 50000))))) InVars {main_~x~0=v_main_~x~0_1417, main_#t~post4=|v_main_#t~post4_185|} OutVars{main_~x~0=v_main_~x~0_1416, main_#t~post4=|v_main_#t~post4_184|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {29595#(< (+ main_~z~0 24) main_~y~0)} is VALID [2022-04-28 03:46:51,589 INFO L290 TraceCheckUtils]: 5: Hoare triple {29311#true} ~x~0 := 0;~y~0 := 50000;~z~0 := 0;~x~0 := 0; {29595#(< (+ main_~z~0 24) main_~y~0)} is VALID [2022-04-28 03:46:51,589 INFO L272 TraceCheckUtils]: 4: Hoare triple {29311#true} call #t~ret9 := main(); {29311#true} is VALID [2022-04-28 03:46:51,589 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {29311#true} {29311#true} #52#return; {29311#true} is VALID [2022-04-28 03:46:51,590 INFO L290 TraceCheckUtils]: 2: Hoare triple {29311#true} assume true; {29311#true} is VALID [2022-04-28 03:46:51,590 INFO L290 TraceCheckUtils]: 1: Hoare triple {29311#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(17, 2);call #Ultimate.allocInit(12, 3); {29311#true} is VALID [2022-04-28 03:46:51,590 INFO L272 TraceCheckUtils]: 0: Hoare triple {29311#true} call ULTIMATE.init(); {29311#true} is VALID [2022-04-28 03:46:51,590 INFO L134 CoverageAnalysis]: Checked inductivity of 302 backedges. 0 proven. 300 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-04-28 03:46:51,590 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [47873857] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 03:46:51,590 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 03:46:51,590 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [31, 27, 27] total 81 [2022-04-28 03:46:53,419 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 03:46:53,419 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [200553529] [2022-04-28 03:46:53,419 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [200553529] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 03:46:53,419 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 03:46:53,419 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [72] imperfect sequences [] total 72 [2022-04-28 03:46:53,419 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2023258991] [2022-04-28 03:46:53,420 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 03:46:53,420 INFO L78 Accepts]: Start accepts. Automaton has has 72 states, 72 states have (on average 1.6388888888888888) internal successors, (118), 71 states have internal predecessors, (118), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 122 [2022-04-28 03:46:53,420 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 03:46:53,420 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 72 states, 72 states have (on average 1.6388888888888888) internal successors, (118), 71 states have internal predecessors, (118), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:46:53,526 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 122 edges. 122 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 03:46:53,526 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 72 states [2022-04-28 03:46:53,526 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 03:46:53,527 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 72 interpolants. [2022-04-28 03:46:53,528 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6244, Invalid=9256, Unknown=0, NotChecked=0, Total=15500 [2022-04-28 03:46:53,528 INFO L87 Difference]: Start difference. First operand 123 states and 126 transitions. Second operand has 72 states, 72 states have (on average 1.6388888888888888) internal successors, (118), 71 states have internal predecessors, (118), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:47:02,462 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:47:02,462 INFO L93 Difference]: Finished difference Result 325 states and 336 transitions. [2022-04-28 03:47:02,462 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 72 states. [2022-04-28 03:47:02,463 INFO L78 Accepts]: Start accepts. Automaton has has 72 states, 72 states have (on average 1.6388888888888888) internal successors, (118), 71 states have internal predecessors, (118), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 122 [2022-04-28 03:47:02,463 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 03:47:02,463 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 72 states, 72 states have (on average 1.6388888888888888) internal successors, (118), 71 states have internal predecessors, (118), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:47:02,464 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 144 transitions. [2022-04-28 03:47:02,464 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 72 states, 72 states have (on average 1.6388888888888888) internal successors, (118), 71 states have internal predecessors, (118), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:47:02,465 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 144 transitions. [2022-04-28 03:47:02,465 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 72 states and 144 transitions. [2022-04-28 03:47:02,578 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 144 edges. 144 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 03:47:02,581 INFO L225 Difference]: With dead ends: 325 [2022-04-28 03:47:02,581 INFO L226 Difference]: Without dead ends: 210 [2022-04-28 03:47:02,584 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 270 GetRequests, 76 SyntacticMatches, 2 SemanticMatches, 192 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10853 ImplicationChecksByTransitivity, 5.7s TimeCoverageRelationStatistics Valid=12539, Invalid=24903, Unknown=0, NotChecked=0, Total=37442 [2022-04-28 03:47:02,585 INFO L413 NwaCegarLoop]: 13 mSDtfsCounter, 326 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 4033 mSolverCounterSat, 350 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 326 SdHoareTripleChecker+Valid, 35 SdHoareTripleChecker+Invalid, 4383 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 350 IncrementalHoareTripleChecker+Valid, 4033 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.3s IncrementalHoareTripleChecker+Time [2022-04-28 03:47:02,585 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [326 Valid, 35 Invalid, 4383 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [350 Valid, 4033 Invalid, 0 Unknown, 0 Unchecked, 3.3s Time] [2022-04-28 03:47:02,585 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 210 states. [2022-04-28 03:47:03,032 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 210 to 210. [2022-04-28 03:47:03,032 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 03:47:03,032 INFO L82 GeneralOperation]: Start isEquivalent. First operand 210 states. Second operand has 210 states, 205 states have (on average 1.024390243902439) internal successors, (210), 205 states have internal predecessors, (210), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:47:03,032 INFO L74 IsIncluded]: Start isIncluded. First operand 210 states. Second operand has 210 states, 205 states have (on average 1.024390243902439) internal successors, (210), 205 states have internal predecessors, (210), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:47:03,032 INFO L87 Difference]: Start difference. First operand 210 states. Second operand has 210 states, 205 states have (on average 1.024390243902439) internal successors, (210), 205 states have internal predecessors, (210), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:47:03,034 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:47:03,034 INFO L93 Difference]: Finished difference Result 210 states and 214 transitions. [2022-04-28 03:47:03,035 INFO L276 IsEmpty]: Start isEmpty. Operand 210 states and 214 transitions. [2022-04-28 03:47:03,035 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:47:03,035 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:47:03,035 INFO L74 IsIncluded]: Start isIncluded. First operand has 210 states, 205 states have (on average 1.024390243902439) internal successors, (210), 205 states have internal predecessors, (210), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 210 states. [2022-04-28 03:47:03,035 INFO L87 Difference]: Start difference. First operand has 210 states, 205 states have (on average 1.024390243902439) internal successors, (210), 205 states have internal predecessors, (210), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 210 states. [2022-04-28 03:47:03,038 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:47:03,038 INFO L93 Difference]: Finished difference Result 210 states and 214 transitions. [2022-04-28 03:47:03,038 INFO L276 IsEmpty]: Start isEmpty. Operand 210 states and 214 transitions. [2022-04-28 03:47:03,038 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:47:03,039 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:47:03,039 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 03:47:03,039 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 03:47:03,039 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 210 states, 205 states have (on average 1.024390243902439) internal successors, (210), 205 states have internal predecessors, (210), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:47:03,042 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 210 states to 210 states and 214 transitions. [2022-04-28 03:47:03,042 INFO L78 Accepts]: Start accepts. Automaton has 210 states and 214 transitions. Word has length 122 [2022-04-28 03:47:03,042 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 03:47:03,042 INFO L495 AbstractCegarLoop]: Abstraction has 210 states and 214 transitions. [2022-04-28 03:47:03,043 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 72 states, 72 states have (on average 1.6388888888888888) internal successors, (118), 71 states have internal predecessors, (118), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:47:03,043 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 210 states and 214 transitions. [2022-04-28 03:47:03,272 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 214 edges. 214 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 03:47:03,272 INFO L276 IsEmpty]: Start isEmpty. Operand 210 states and 214 transitions. [2022-04-28 03:47:03,273 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2022-04-28 03:47:03,273 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 03:47:03,273 INFO L195 NwaCegarLoop]: trace histogram [44, 43, 25, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 03:47:03,289 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (31)] Forceful destruction successful, exit code 0 [2022-04-28 03:47:03,479 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 31 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable32 [2022-04-28 03:47:03,479 INFO L420 AbstractCegarLoop]: === Iteration 34 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 03:47:03,480 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 03:47:03,480 INFO L85 PathProgramCache]: Analyzing trace with hash 195292402, now seen corresponding path program 31 times [2022-04-28 03:47:03,480 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 03:47:03,480 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1694431304] [2022-04-28 03:47:07,542 WARN L977 rdanLoopAcceleration]: Unable to prove correctness of quantifier elimination. [2022-04-28 03:47:07,587 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 1 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 03:47:07,807 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={1=1, 2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 03:47:07,808 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-28 03:47:07,810 INFO L85 PathProgramCache]: Analyzing trace with hash -554733822, now seen corresponding path program 1 times [2022-04-28 03:47:07,810 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 03:47:07,810 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1020067294] [2022-04-28 03:47:07,810 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:47:07,811 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 03:47:07,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:47:08,336 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 03:47:08,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:47:08,340 INFO L290 TraceCheckUtils]: 0: Hoare triple {31334#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(17, 2);call #Ultimate.allocInit(12, 3); {31300#true} is VALID [2022-04-28 03:47:08,340 INFO L290 TraceCheckUtils]: 1: Hoare triple {31300#true} assume true; {31300#true} is VALID [2022-04-28 03:47:08,340 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {31300#true} {31300#true} #52#return; {31300#true} is VALID [2022-04-28 03:47:08,341 INFO L272 TraceCheckUtils]: 0: Hoare triple {31300#true} call ULTIMATE.init(); {31334#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 03:47:08,341 INFO L290 TraceCheckUtils]: 1: Hoare triple {31334#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(17, 2);call #Ultimate.allocInit(12, 3); {31300#true} is VALID [2022-04-28 03:47:08,341 INFO L290 TraceCheckUtils]: 2: Hoare triple {31300#true} assume true; {31300#true} is VALID [2022-04-28 03:47:08,341 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {31300#true} {31300#true} #52#return; {31300#true} is VALID [2022-04-28 03:47:08,341 INFO L272 TraceCheckUtils]: 4: Hoare triple {31300#true} call #t~ret9 := main(); {31300#true} is VALID [2022-04-28 03:47:08,341 INFO L290 TraceCheckUtils]: 5: Hoare triple {31300#true} ~x~0 := 0;~y~0 := 50000;~z~0 := 0;~x~0 := 0; {31305#(and (= main_~z~0 0) (= main_~x~0 0) (<= 50000 main_~y~0))} is VALID [2022-04-28 03:47:08,342 INFO L290 TraceCheckUtils]: 6: Hoare triple {31305#(and (= main_~z~0 0) (= main_~x~0 0) (<= 50000 main_~y~0))} [180] L11-2-->L18-1_primed: Formula: (let ((.cse0 (= |v_main_#t~post4_191| |v_main_#t~post4_190|)) (.cse1 (= v_main_~x~0_1500 v_main_~x~0_1499))) (or (and (< v_main_~x~0_1500 v_main_~x~0_1499) (< v_main_~x~0_1499 50001)) (and .cse0 .cse1) (and (<= 50000 v_main_~x~0_1500) .cse0 .cse1))) InVars {main_~x~0=v_main_~x~0_1500, main_#t~post4=|v_main_#t~post4_191|} OutVars{main_~x~0=v_main_~x~0_1499, main_#t~post4=|v_main_#t~post4_190|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {31306#(or (<= main_~x~0 0) (and (= main_~z~0 0) (<= main_~x~0 main_~y~0) (<= main_~x~0 50000)))} is VALID [2022-04-28 03:47:08,342 INFO L290 TraceCheckUtils]: 7: Hoare triple {31306#(or (<= main_~x~0 0) (and (= main_~z~0 0) (<= main_~x~0 main_~y~0) (<= main_~x~0 50000)))} [181] L18-1_primed-->L11-2: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {31306#(or (<= main_~x~0 0) (and (= main_~z~0 0) (<= main_~x~0 main_~y~0) (<= main_~x~0 50000)))} is VALID [2022-04-28 03:47:08,343 INFO L290 TraceCheckUtils]: 8: Hoare triple {31306#(or (<= main_~x~0 0) (and (= main_~z~0 0) (<= main_~x~0 main_~y~0) (<= main_~x~0 50000)))} [182] L11-2-->L18-1_primed: Formula: (let ((.cse0 (= |v_main_#t~post5_214| |v_main_#t~post5_213|)) (.cse1 (= |v_main_#t~post6_214| |v_main_#t~post6_213|)) (.cse2 (= v_main_~y~0_1582 v_main_~y~0_1581)) (.cse3 (= v_main_~x~0_1502 v_main_~x~0_1501)) (.cse4 (<= 50000 v_main_~x~0_1502))) (or (and .cse0 .cse1 .cse2 .cse3) (and (< v_main_~x~0_1501 1000001) (= (+ v_main_~x~0_1502 v_main_~y~0_1581) (+ v_main_~x~0_1501 v_main_~y~0_1582)) .cse4 (< v_main_~x~0_1502 v_main_~x~0_1501)) (and .cse0 .cse1 .cse2 .cse3 (or (not .cse4) (not (< v_main_~x~0_1502 1000000)))))) InVars {main_~y~0=v_main_~y~0_1582, main_#t~post5=|v_main_#t~post5_214|, main_~x~0=v_main_~x~0_1502, main_#t~post6=|v_main_#t~post6_214|} OutVars{main_~y~0=v_main_~y~0_1581, main_#t~post5=|v_main_#t~post5_213|, main_~x~0=v_main_~x~0_1501, main_#t~post6=|v_main_#t~post6_213|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {31307#(or (and (= main_~z~0 0) (<= main_~x~0 main_~y~0)) (<= main_~x~0 50000))} is VALID [2022-04-28 03:47:08,344 INFO L290 TraceCheckUtils]: 9: Hoare triple {31307#(or (and (= main_~z~0 0) (<= main_~x~0 main_~y~0)) (<= main_~x~0 50000))} [179] L18-1_primed-->L18-1: Formula: (not (< v_main_~x~0_11 1000000)) InVars {main_~x~0=v_main_~x~0_11} OutVars{main_~x~0=v_main_~x~0_11} AuxVars[] AssignedVars[] {31308#(and (= main_~z~0 0) (<= 1000000 main_~y~0))} is VALID [2022-04-28 03:47:08,344 INFO L290 TraceCheckUtils]: 10: Hoare triple {31308#(and (= main_~z~0 0) (<= 1000000 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {31309#(and (= main_~z~0 0) (<= 999999 main_~y~0))} is VALID [2022-04-28 03:47:08,345 INFO L290 TraceCheckUtils]: 11: Hoare triple {31309#(and (= main_~z~0 0) (<= 999999 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {31310#(and (= main_~z~0 0) (<= 999998 main_~y~0))} is VALID [2022-04-28 03:47:08,345 INFO L290 TraceCheckUtils]: 12: Hoare triple {31310#(and (= main_~z~0 0) (<= 999998 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {31311#(and (= main_~z~0 0) (<= 999997 main_~y~0))} is VALID [2022-04-28 03:47:08,345 INFO L290 TraceCheckUtils]: 13: Hoare triple {31311#(and (= main_~z~0 0) (<= 999997 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {31312#(and (<= 999996 main_~y~0) (= main_~z~0 0))} is VALID [2022-04-28 03:47:08,346 INFO L290 TraceCheckUtils]: 14: Hoare triple {31312#(and (<= 999996 main_~y~0) (= main_~z~0 0))} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {31313#(and (= main_~z~0 0) (<= 999995 main_~y~0))} is VALID [2022-04-28 03:47:08,346 INFO L290 TraceCheckUtils]: 15: Hoare triple {31313#(and (= main_~z~0 0) (<= 999995 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {31314#(and (= main_~z~0 0) (<= 999994 main_~y~0))} is VALID [2022-04-28 03:47:08,347 INFO L290 TraceCheckUtils]: 16: Hoare triple {31314#(and (= main_~z~0 0) (<= 999994 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {31315#(and (= main_~z~0 0) (<= 999993 main_~y~0))} is VALID [2022-04-28 03:47:08,347 INFO L290 TraceCheckUtils]: 17: Hoare triple {31315#(and (= main_~z~0 0) (<= 999993 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {31316#(and (= main_~z~0 0) (<= 999992 main_~y~0))} is VALID [2022-04-28 03:47:08,348 INFO L290 TraceCheckUtils]: 18: Hoare triple {31316#(and (= main_~z~0 0) (<= 999992 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {31317#(and (= main_~z~0 0) (<= 999991 main_~y~0))} is VALID [2022-04-28 03:47:08,348 INFO L290 TraceCheckUtils]: 19: Hoare triple {31317#(and (= main_~z~0 0) (<= 999991 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {31318#(and (= main_~z~0 0) (<= 999990 main_~y~0))} is VALID [2022-04-28 03:47:08,349 INFO L290 TraceCheckUtils]: 20: Hoare triple {31318#(and (= main_~z~0 0) (<= 999990 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {31319#(and (= main_~z~0 0) (<= 999989 main_~y~0))} is VALID [2022-04-28 03:47:08,349 INFO L290 TraceCheckUtils]: 21: Hoare triple {31319#(and (= main_~z~0 0) (<= 999989 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {31320#(and (= main_~z~0 0) (<= 999988 main_~y~0))} is VALID [2022-04-28 03:47:08,350 INFO L290 TraceCheckUtils]: 22: Hoare triple {31320#(and (= main_~z~0 0) (<= 999988 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {31321#(and (= main_~z~0 0) (<= 999987 main_~y~0))} is VALID [2022-04-28 03:47:08,350 INFO L290 TraceCheckUtils]: 23: Hoare triple {31321#(and (= main_~z~0 0) (<= 999987 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {31322#(and (= main_~z~0 0) (<= 999986 main_~y~0))} is VALID [2022-04-28 03:47:08,351 INFO L290 TraceCheckUtils]: 24: Hoare triple {31322#(and (= main_~z~0 0) (<= 999986 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {31323#(and (= main_~z~0 0) (<= 999985 main_~y~0))} is VALID [2022-04-28 03:47:08,351 INFO L290 TraceCheckUtils]: 25: Hoare triple {31323#(and (= main_~z~0 0) (<= 999985 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {31324#(and (= main_~z~0 0) (<= 999984 main_~y~0))} is VALID [2022-04-28 03:47:08,352 INFO L290 TraceCheckUtils]: 26: Hoare triple {31324#(and (= main_~z~0 0) (<= 999984 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {31325#(and (<= 999983 main_~y~0) (= main_~z~0 0))} is VALID [2022-04-28 03:47:08,352 INFO L290 TraceCheckUtils]: 27: Hoare triple {31325#(and (<= 999983 main_~y~0) (= main_~z~0 0))} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {31326#(and (= main_~z~0 0) (<= 999982 main_~y~0))} is VALID [2022-04-28 03:47:08,352 INFO L290 TraceCheckUtils]: 28: Hoare triple {31326#(and (= main_~z~0 0) (<= 999982 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {31327#(and (= main_~z~0 0) (<= 999981 main_~y~0))} is VALID [2022-04-28 03:47:08,353 INFO L290 TraceCheckUtils]: 29: Hoare triple {31327#(and (= main_~z~0 0) (<= 999981 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {31328#(and (= main_~z~0 0) (<= 999980 main_~y~0))} is VALID [2022-04-28 03:47:08,353 INFO L290 TraceCheckUtils]: 30: Hoare triple {31328#(and (= main_~z~0 0) (<= 999980 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {31329#(and (= main_~z~0 0) (<= 999979 main_~y~0))} is VALID [2022-04-28 03:47:08,354 INFO L290 TraceCheckUtils]: 31: Hoare triple {31329#(and (= main_~z~0 0) (<= 999979 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {31330#(and (= main_~z~0 0) (<= 999978 main_~y~0))} is VALID [2022-04-28 03:47:08,354 INFO L290 TraceCheckUtils]: 32: Hoare triple {31330#(and (= main_~z~0 0) (<= 999978 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {31331#(and (= main_~z~0 0) (<= 999977 main_~y~0))} is VALID [2022-04-28 03:47:08,355 INFO L290 TraceCheckUtils]: 33: Hoare triple {31331#(and (= main_~z~0 0) (<= 999977 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {31332#(and (<= 999976 main_~y~0) (= main_~z~0 0))} is VALID [2022-04-28 03:47:08,355 INFO L290 TraceCheckUtils]: 34: Hoare triple {31332#(and (<= 999976 main_~y~0) (= main_~z~0 0))} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {31333#(and (= main_~z~0 0) (<= 999975 main_~y~0))} is VALID [2022-04-28 03:47:08,356 INFO L290 TraceCheckUtils]: 35: Hoare triple {31333#(and (= main_~z~0 0) (<= 999975 main_~y~0))} assume !(~y~0 > ~z~0); {31301#false} is VALID [2022-04-28 03:47:08,356 INFO L272 TraceCheckUtils]: 36: Hoare triple {31301#false} call __VERIFIER_assert((if ~x~0 == ~z~0 then 1 else 0)); {31301#false} is VALID [2022-04-28 03:47:08,356 INFO L290 TraceCheckUtils]: 37: Hoare triple {31301#false} ~cond := #in~cond; {31301#false} is VALID [2022-04-28 03:47:08,356 INFO L290 TraceCheckUtils]: 38: Hoare triple {31301#false} assume 0 == ~cond; {31301#false} is VALID [2022-04-28 03:47:08,356 INFO L290 TraceCheckUtils]: 39: Hoare triple {31301#false} assume !false; {31301#false} is VALID [2022-04-28 03:47:08,356 INFO L134 CoverageAnalysis]: Checked inductivity of 327 backedges. 0 proven. 327 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 03:47:08,356 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 03:47:08,356 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1020067294] [2022-04-28 03:47:08,356 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1020067294] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 03:47:08,356 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1746192515] [2022-04-28 03:47:08,356 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:47:08,357 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 03:47:08,357 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 03:47:08,357 INFO L229 MonitoredProcess]: Starting monitored process 32 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 03:47:08,358 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (32)] Waiting until timeout for monitored process [2022-04-28 03:47:08,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:47:08,404 INFO L263 TraceCheckSpWp]: Trace formula consists of 184 conjuncts, 32 conjunts are in the unsatisfiable core [2022-04-28 03:47:08,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:47:08,433 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 03:47:09,843 INFO L272 TraceCheckUtils]: 0: Hoare triple {31300#true} call ULTIMATE.init(); {31300#true} is VALID [2022-04-28 03:47:09,844 INFO L290 TraceCheckUtils]: 1: Hoare triple {31300#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(17, 2);call #Ultimate.allocInit(12, 3); {31300#true} is VALID [2022-04-28 03:47:09,844 INFO L290 TraceCheckUtils]: 2: Hoare triple {31300#true} assume true; {31300#true} is VALID [2022-04-28 03:47:09,844 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {31300#true} {31300#true} #52#return; {31300#true} is VALID [2022-04-28 03:47:09,844 INFO L272 TraceCheckUtils]: 4: Hoare triple {31300#true} call #t~ret9 := main(); {31300#true} is VALID [2022-04-28 03:47:09,844 INFO L290 TraceCheckUtils]: 5: Hoare triple {31300#true} ~x~0 := 0;~y~0 := 50000;~z~0 := 0;~x~0 := 0; {31353#(and (<= main_~z~0 0) (<= main_~x~0 0) (<= 50000 main_~y~0))} is VALID [2022-04-28 03:47:09,845 INFO L290 TraceCheckUtils]: 6: Hoare triple {31353#(and (<= main_~z~0 0) (<= main_~x~0 0) (<= 50000 main_~y~0))} [180] L11-2-->L18-1_primed: Formula: (let ((.cse0 (= |v_main_#t~post4_191| |v_main_#t~post4_190|)) (.cse1 (= v_main_~x~0_1500 v_main_~x~0_1499))) (or (and (< v_main_~x~0_1500 v_main_~x~0_1499) (< v_main_~x~0_1499 50001)) (and .cse0 .cse1) (and (<= 50000 v_main_~x~0_1500) .cse0 .cse1))) InVars {main_~x~0=v_main_~x~0_1500, main_#t~post4=|v_main_#t~post4_191|} OutVars{main_~x~0=v_main_~x~0_1499, main_#t~post4=|v_main_#t~post4_190|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {31357#(and (<= main_~z~0 0) (< main_~x~0 50001) (<= 50000 main_~y~0))} is VALID [2022-04-28 03:47:09,845 INFO L290 TraceCheckUtils]: 7: Hoare triple {31357#(and (<= main_~z~0 0) (< main_~x~0 50001) (<= 50000 main_~y~0))} [181] L18-1_primed-->L11-2: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {31357#(and (<= main_~z~0 0) (< main_~x~0 50001) (<= 50000 main_~y~0))} is VALID [2022-04-28 03:47:09,846 INFO L290 TraceCheckUtils]: 8: Hoare triple {31357#(and (<= main_~z~0 0) (< main_~x~0 50001) (<= 50000 main_~y~0))} [182] L11-2-->L18-1_primed: Formula: (let ((.cse0 (= |v_main_#t~post5_214| |v_main_#t~post5_213|)) (.cse1 (= |v_main_#t~post6_214| |v_main_#t~post6_213|)) (.cse2 (= v_main_~y~0_1582 v_main_~y~0_1581)) (.cse3 (= v_main_~x~0_1502 v_main_~x~0_1501)) (.cse4 (<= 50000 v_main_~x~0_1502))) (or (and .cse0 .cse1 .cse2 .cse3) (and (< v_main_~x~0_1501 1000001) (= (+ v_main_~x~0_1502 v_main_~y~0_1581) (+ v_main_~x~0_1501 v_main_~y~0_1582)) .cse4 (< v_main_~x~0_1502 v_main_~x~0_1501)) (and .cse0 .cse1 .cse2 .cse3 (or (not .cse4) (not (< v_main_~x~0_1502 1000000)))))) InVars {main_~y~0=v_main_~y~0_1582, main_#t~post5=|v_main_#t~post5_214|, main_~x~0=v_main_~x~0_1502, main_#t~post6=|v_main_#t~post6_214|} OutVars{main_~y~0=v_main_~y~0_1581, main_#t~post5=|v_main_#t~post5_213|, main_~x~0=v_main_~x~0_1501, main_#t~post6=|v_main_#t~post6_213|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {31364#(and (<= main_~z~0 0) (or (and (< main_~x~0 50001) (<= 50000 main_~y~0)) (and (< main_~x~0 (+ main_~y~0 1)) (< main_~x~0 1000001) (< 50000 main_~x~0))))} is VALID [2022-04-28 03:47:09,846 INFO L290 TraceCheckUtils]: 9: Hoare triple {31364#(and (<= main_~z~0 0) (or (and (< main_~x~0 50001) (<= 50000 main_~y~0)) (and (< main_~x~0 (+ main_~y~0 1)) (< main_~x~0 1000001) (< 50000 main_~x~0))))} [179] L18-1_primed-->L18-1: Formula: (not (< v_main_~x~0_11 1000000)) InVars {main_~x~0=v_main_~x~0_11} OutVars{main_~x~0=v_main_~x~0_11} AuxVars[] AssignedVars[] {31368#(and (<= main_~z~0 0) (< 999999 main_~y~0))} is VALID [2022-04-28 03:47:09,847 INFO L290 TraceCheckUtils]: 10: Hoare triple {31368#(and (<= main_~z~0 0) (< 999999 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {31372#(and (<= main_~z~0 0) (< 999998 main_~y~0))} is VALID [2022-04-28 03:47:09,847 INFO L290 TraceCheckUtils]: 11: Hoare triple {31372#(and (<= main_~z~0 0) (< 999998 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {31376#(and (<= main_~z~0 0) (< 999997 main_~y~0))} is VALID [2022-04-28 03:47:09,848 INFO L290 TraceCheckUtils]: 12: Hoare triple {31376#(and (<= main_~z~0 0) (< 999997 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {31380#(and (<= main_~z~0 0) (< 999996 main_~y~0))} is VALID [2022-04-28 03:47:09,848 INFO L290 TraceCheckUtils]: 13: Hoare triple {31380#(and (<= main_~z~0 0) (< 999996 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {31384#(and (<= main_~z~0 0) (< 999995 main_~y~0))} is VALID [2022-04-28 03:47:09,849 INFO L290 TraceCheckUtils]: 14: Hoare triple {31384#(and (<= main_~z~0 0) (< 999995 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {31388#(and (<= main_~z~0 0) (< 999994 main_~y~0))} is VALID [2022-04-28 03:47:09,849 INFO L290 TraceCheckUtils]: 15: Hoare triple {31388#(and (<= main_~z~0 0) (< 999994 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {31392#(and (<= main_~z~0 0) (< 999993 main_~y~0))} is VALID [2022-04-28 03:47:09,850 INFO L290 TraceCheckUtils]: 16: Hoare triple {31392#(and (<= main_~z~0 0) (< 999993 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {31396#(and (<= main_~z~0 0) (< 999992 main_~y~0))} is VALID [2022-04-28 03:47:09,850 INFO L290 TraceCheckUtils]: 17: Hoare triple {31396#(and (<= main_~z~0 0) (< 999992 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {31400#(and (<= main_~z~0 0) (< 999991 main_~y~0))} is VALID [2022-04-28 03:47:09,851 INFO L290 TraceCheckUtils]: 18: Hoare triple {31400#(and (<= main_~z~0 0) (< 999991 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {31404#(and (<= main_~z~0 0) (< 999990 main_~y~0))} is VALID [2022-04-28 03:47:09,851 INFO L290 TraceCheckUtils]: 19: Hoare triple {31404#(and (<= main_~z~0 0) (< 999990 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {31408#(and (<= main_~z~0 0) (< 999989 main_~y~0))} is VALID [2022-04-28 03:47:09,852 INFO L290 TraceCheckUtils]: 20: Hoare triple {31408#(and (<= main_~z~0 0) (< 999989 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {31412#(and (<= main_~z~0 0) (< 999988 main_~y~0))} is VALID [2022-04-28 03:47:09,852 INFO L290 TraceCheckUtils]: 21: Hoare triple {31412#(and (<= main_~z~0 0) (< 999988 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {31416#(and (<= main_~z~0 0) (< 999987 main_~y~0))} is VALID [2022-04-28 03:47:09,853 INFO L290 TraceCheckUtils]: 22: Hoare triple {31416#(and (<= main_~z~0 0) (< 999987 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {31420#(and (<= main_~z~0 0) (< 999986 main_~y~0))} is VALID [2022-04-28 03:47:09,853 INFO L290 TraceCheckUtils]: 23: Hoare triple {31420#(and (<= main_~z~0 0) (< 999986 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {31424#(and (<= main_~z~0 0) (< 999985 main_~y~0))} is VALID [2022-04-28 03:47:09,854 INFO L290 TraceCheckUtils]: 24: Hoare triple {31424#(and (<= main_~z~0 0) (< 999985 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {31428#(and (<= main_~z~0 0) (< 999984 main_~y~0))} is VALID [2022-04-28 03:47:09,854 INFO L290 TraceCheckUtils]: 25: Hoare triple {31428#(and (<= main_~z~0 0) (< 999984 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {31432#(and (<= main_~z~0 0) (< 999983 main_~y~0))} is VALID [2022-04-28 03:47:09,855 INFO L290 TraceCheckUtils]: 26: Hoare triple {31432#(and (<= main_~z~0 0) (< 999983 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {31436#(and (<= main_~z~0 0) (< 999982 main_~y~0))} is VALID [2022-04-28 03:47:09,855 INFO L290 TraceCheckUtils]: 27: Hoare triple {31436#(and (<= main_~z~0 0) (< 999982 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {31440#(and (<= main_~z~0 0) (< 999981 main_~y~0))} is VALID [2022-04-28 03:47:09,856 INFO L290 TraceCheckUtils]: 28: Hoare triple {31440#(and (<= main_~z~0 0) (< 999981 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {31444#(and (<= main_~z~0 0) (< 999980 main_~y~0))} is VALID [2022-04-28 03:47:09,856 INFO L290 TraceCheckUtils]: 29: Hoare triple {31444#(and (<= main_~z~0 0) (< 999980 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {31448#(and (<= main_~z~0 0) (< 999979 main_~y~0))} is VALID [2022-04-28 03:47:09,856 INFO L290 TraceCheckUtils]: 30: Hoare triple {31448#(and (<= main_~z~0 0) (< 999979 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {31452#(and (<= main_~z~0 0) (< 999978 main_~y~0))} is VALID [2022-04-28 03:47:09,857 INFO L290 TraceCheckUtils]: 31: Hoare triple {31452#(and (<= main_~z~0 0) (< 999978 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {31456#(and (<= main_~z~0 0) (< 999977 main_~y~0))} is VALID [2022-04-28 03:47:09,857 INFO L290 TraceCheckUtils]: 32: Hoare triple {31456#(and (<= main_~z~0 0) (< 999977 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {31460#(and (<= main_~z~0 0) (< 999976 main_~y~0))} is VALID [2022-04-28 03:47:09,858 INFO L290 TraceCheckUtils]: 33: Hoare triple {31460#(and (<= main_~z~0 0) (< 999976 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {31464#(and (<= main_~z~0 0) (< 999975 main_~y~0))} is VALID [2022-04-28 03:47:09,858 INFO L290 TraceCheckUtils]: 34: Hoare triple {31464#(and (<= main_~z~0 0) (< 999975 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {31468#(and (<= main_~z~0 0) (< 999974 main_~y~0))} is VALID [2022-04-28 03:47:09,859 INFO L290 TraceCheckUtils]: 35: Hoare triple {31468#(and (<= main_~z~0 0) (< 999974 main_~y~0))} assume !(~y~0 > ~z~0); {31301#false} is VALID [2022-04-28 03:47:09,859 INFO L272 TraceCheckUtils]: 36: Hoare triple {31301#false} call __VERIFIER_assert((if ~x~0 == ~z~0 then 1 else 0)); {31301#false} is VALID [2022-04-28 03:47:09,859 INFO L290 TraceCheckUtils]: 37: Hoare triple {31301#false} ~cond := #in~cond; {31301#false} is VALID [2022-04-28 03:47:09,859 INFO L290 TraceCheckUtils]: 38: Hoare triple {31301#false} assume 0 == ~cond; {31301#false} is VALID [2022-04-28 03:47:09,859 INFO L290 TraceCheckUtils]: 39: Hoare triple {31301#false} assume !false; {31301#false} is VALID [2022-04-28 03:47:09,859 INFO L134 CoverageAnalysis]: Checked inductivity of 327 backedges. 0 proven. 327 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 03:47:09,859 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 03:47:12,063 INFO L290 TraceCheckUtils]: 39: Hoare triple {31301#false} assume !false; {31301#false} is VALID [2022-04-28 03:47:12,063 INFO L290 TraceCheckUtils]: 38: Hoare triple {31301#false} assume 0 == ~cond; {31301#false} is VALID [2022-04-28 03:47:12,063 INFO L290 TraceCheckUtils]: 37: Hoare triple {31301#false} ~cond := #in~cond; {31301#false} is VALID [2022-04-28 03:47:12,063 INFO L272 TraceCheckUtils]: 36: Hoare triple {31301#false} call __VERIFIER_assert((if ~x~0 == ~z~0 then 1 else 0)); {31301#false} is VALID [2022-04-28 03:47:12,063 INFO L290 TraceCheckUtils]: 35: Hoare triple {31496#(< main_~z~0 main_~y~0)} assume !(~y~0 > ~z~0); {31301#false} is VALID [2022-04-28 03:47:12,064 INFO L290 TraceCheckUtils]: 34: Hoare triple {31500#(< (+ main_~z~0 1) main_~y~0)} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {31496#(< main_~z~0 main_~y~0)} is VALID [2022-04-28 03:47:12,064 INFO L290 TraceCheckUtils]: 33: Hoare triple {31504#(< (+ main_~z~0 2) main_~y~0)} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {31500#(< (+ main_~z~0 1) main_~y~0)} is VALID [2022-04-28 03:47:12,065 INFO L290 TraceCheckUtils]: 32: Hoare triple {31508#(< (+ main_~z~0 3) main_~y~0)} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {31504#(< (+ main_~z~0 2) main_~y~0)} is VALID [2022-04-28 03:47:12,065 INFO L290 TraceCheckUtils]: 31: Hoare triple {31512#(< (+ main_~z~0 4) main_~y~0)} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {31508#(< (+ main_~z~0 3) main_~y~0)} is VALID [2022-04-28 03:47:12,066 INFO L290 TraceCheckUtils]: 30: Hoare triple {31516#(< (+ 5 main_~z~0) main_~y~0)} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {31512#(< (+ main_~z~0 4) main_~y~0)} is VALID [2022-04-28 03:47:12,066 INFO L290 TraceCheckUtils]: 29: Hoare triple {31520#(< (+ main_~z~0 6) main_~y~0)} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {31516#(< (+ 5 main_~z~0) main_~y~0)} is VALID [2022-04-28 03:47:12,066 INFO L290 TraceCheckUtils]: 28: Hoare triple {31524#(< (+ 7 main_~z~0) main_~y~0)} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {31520#(< (+ main_~z~0 6) main_~y~0)} is VALID [2022-04-28 03:47:12,067 INFO L290 TraceCheckUtils]: 27: Hoare triple {31528#(< (+ main_~z~0 8) main_~y~0)} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {31524#(< (+ 7 main_~z~0) main_~y~0)} is VALID [2022-04-28 03:47:12,067 INFO L290 TraceCheckUtils]: 26: Hoare triple {31532#(< (+ main_~z~0 9) main_~y~0)} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {31528#(< (+ main_~z~0 8) main_~y~0)} is VALID [2022-04-28 03:47:12,068 INFO L290 TraceCheckUtils]: 25: Hoare triple {31536#(< (+ main_~z~0 10) main_~y~0)} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {31532#(< (+ main_~z~0 9) main_~y~0)} is VALID [2022-04-28 03:47:12,068 INFO L290 TraceCheckUtils]: 24: Hoare triple {31540#(< (+ main_~z~0 11) main_~y~0)} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {31536#(< (+ main_~z~0 10) main_~y~0)} is VALID [2022-04-28 03:47:12,069 INFO L290 TraceCheckUtils]: 23: Hoare triple {31544#(< (+ main_~z~0 12) main_~y~0)} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {31540#(< (+ main_~z~0 11) main_~y~0)} is VALID [2022-04-28 03:47:12,069 INFO L290 TraceCheckUtils]: 22: Hoare triple {31548#(< (+ main_~z~0 13) main_~y~0)} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {31544#(< (+ main_~z~0 12) main_~y~0)} is VALID [2022-04-28 03:47:12,070 INFO L290 TraceCheckUtils]: 21: Hoare triple {31552#(< (+ main_~z~0 14) main_~y~0)} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {31548#(< (+ main_~z~0 13) main_~y~0)} is VALID [2022-04-28 03:47:12,070 INFO L290 TraceCheckUtils]: 20: Hoare triple {31556#(< (+ main_~z~0 15) main_~y~0)} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {31552#(< (+ main_~z~0 14) main_~y~0)} is VALID [2022-04-28 03:47:12,071 INFO L290 TraceCheckUtils]: 19: Hoare triple {31560#(< (+ main_~z~0 16) main_~y~0)} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {31556#(< (+ main_~z~0 15) main_~y~0)} is VALID [2022-04-28 03:47:12,071 INFO L290 TraceCheckUtils]: 18: Hoare triple {31564#(< (+ main_~z~0 17) main_~y~0)} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {31560#(< (+ main_~z~0 16) main_~y~0)} is VALID [2022-04-28 03:47:12,072 INFO L290 TraceCheckUtils]: 17: Hoare triple {31568#(< (+ main_~z~0 18) main_~y~0)} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {31564#(< (+ main_~z~0 17) main_~y~0)} is VALID [2022-04-28 03:47:12,072 INFO L290 TraceCheckUtils]: 16: Hoare triple {31572#(< (+ 19 main_~z~0) main_~y~0)} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {31568#(< (+ main_~z~0 18) main_~y~0)} is VALID [2022-04-28 03:47:12,073 INFO L290 TraceCheckUtils]: 15: Hoare triple {31576#(< (+ main_~z~0 20) main_~y~0)} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {31572#(< (+ 19 main_~z~0) main_~y~0)} is VALID [2022-04-28 03:47:12,073 INFO L290 TraceCheckUtils]: 14: Hoare triple {31580#(< (+ main_~z~0 21) main_~y~0)} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {31576#(< (+ main_~z~0 20) main_~y~0)} is VALID [2022-04-28 03:47:12,073 INFO L290 TraceCheckUtils]: 13: Hoare triple {31584#(< (+ main_~z~0 22) main_~y~0)} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {31580#(< (+ main_~z~0 21) main_~y~0)} is VALID [2022-04-28 03:47:12,074 INFO L290 TraceCheckUtils]: 12: Hoare triple {31588#(< (+ 23 main_~z~0) main_~y~0)} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {31584#(< (+ main_~z~0 22) main_~y~0)} is VALID [2022-04-28 03:47:12,074 INFO L290 TraceCheckUtils]: 11: Hoare triple {31592#(< (+ main_~z~0 24) main_~y~0)} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {31588#(< (+ 23 main_~z~0) main_~y~0)} is VALID [2022-04-28 03:47:12,075 INFO L290 TraceCheckUtils]: 10: Hoare triple {31596#(< (+ main_~z~0 25) main_~y~0)} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {31592#(< (+ main_~z~0 24) main_~y~0)} is VALID [2022-04-28 03:47:12,075 INFO L290 TraceCheckUtils]: 9: Hoare triple {31600#(or (< main_~x~0 1000000) (< (+ main_~z~0 25) main_~y~0))} [179] L18-1_primed-->L18-1: Formula: (not (< v_main_~x~0_11 1000000)) InVars {main_~x~0=v_main_~x~0_11} OutVars{main_~x~0=v_main_~x~0_11} AuxVars[] AssignedVars[] {31596#(< (+ main_~z~0 25) main_~y~0)} is VALID [2022-04-28 03:47:12,076 INFO L290 TraceCheckUtils]: 8: Hoare triple {31604#(and (or (< main_~x~0 1000000) (< (+ main_~z~0 25) main_~y~0)) (or (<= 1000000 main_~x~0) (not (<= 50000 main_~x~0)) (< (+ main_~z~0 main_~x~0) (+ main_~y~0 999975))))} [182] L11-2-->L18-1_primed: Formula: (let ((.cse0 (= |v_main_#t~post5_214| |v_main_#t~post5_213|)) (.cse1 (= |v_main_#t~post6_214| |v_main_#t~post6_213|)) (.cse2 (= v_main_~y~0_1582 v_main_~y~0_1581)) (.cse3 (= v_main_~x~0_1502 v_main_~x~0_1501)) (.cse4 (<= 50000 v_main_~x~0_1502))) (or (and .cse0 .cse1 .cse2 .cse3) (and (< v_main_~x~0_1501 1000001) (= (+ v_main_~x~0_1502 v_main_~y~0_1581) (+ v_main_~x~0_1501 v_main_~y~0_1582)) .cse4 (< v_main_~x~0_1502 v_main_~x~0_1501)) (and .cse0 .cse1 .cse2 .cse3 (or (not .cse4) (not (< v_main_~x~0_1502 1000000)))))) InVars {main_~y~0=v_main_~y~0_1582, main_#t~post5=|v_main_#t~post5_214|, main_~x~0=v_main_~x~0_1502, main_#t~post6=|v_main_#t~post6_214|} OutVars{main_~y~0=v_main_~y~0_1581, main_#t~post5=|v_main_#t~post5_213|, main_~x~0=v_main_~x~0_1501, main_#t~post6=|v_main_#t~post6_213|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {31600#(or (< main_~x~0 1000000) (< (+ main_~z~0 25) main_~y~0))} is VALID [2022-04-28 03:47:12,076 INFO L290 TraceCheckUtils]: 7: Hoare triple {31604#(and (or (< main_~x~0 1000000) (< (+ main_~z~0 25) main_~y~0)) (or (<= 1000000 main_~x~0) (not (<= 50000 main_~x~0)) (< (+ main_~z~0 main_~x~0) (+ main_~y~0 999975))))} [181] L18-1_primed-->L11-2: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {31604#(and (or (< main_~x~0 1000000) (< (+ main_~z~0 25) main_~y~0)) (or (<= 1000000 main_~x~0) (not (<= 50000 main_~x~0)) (< (+ main_~z~0 main_~x~0) (+ main_~y~0 999975))))} is VALID [2022-04-28 03:47:12,077 INFO L290 TraceCheckUtils]: 6: Hoare triple {31611#(and (<= main_~z~0 (+ main_~y~0 949974)) (or (< main_~x~0 1000000) (< (+ main_~z~0 25) main_~y~0)) (or (<= 1000000 main_~x~0) (< (+ main_~z~0 main_~x~0) (+ main_~y~0 999975))))} [180] L11-2-->L18-1_primed: Formula: (let ((.cse0 (= |v_main_#t~post4_191| |v_main_#t~post4_190|)) (.cse1 (= v_main_~x~0_1500 v_main_~x~0_1499))) (or (and (< v_main_~x~0_1500 v_main_~x~0_1499) (< v_main_~x~0_1499 50001)) (and .cse0 .cse1) (and (<= 50000 v_main_~x~0_1500) .cse0 .cse1))) InVars {main_~x~0=v_main_~x~0_1500, main_#t~post4=|v_main_#t~post4_191|} OutVars{main_~x~0=v_main_~x~0_1499, main_#t~post4=|v_main_#t~post4_190|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {31604#(and (or (< main_~x~0 1000000) (< (+ main_~z~0 25) main_~y~0)) (or (<= 1000000 main_~x~0) (not (<= 50000 main_~x~0)) (< (+ main_~z~0 main_~x~0) (+ main_~y~0 999975))))} is VALID [2022-04-28 03:47:12,078 INFO L290 TraceCheckUtils]: 5: Hoare triple {31300#true} ~x~0 := 0;~y~0 := 50000;~z~0 := 0;~x~0 := 0; {31611#(and (<= main_~z~0 (+ main_~y~0 949974)) (or (< main_~x~0 1000000) (< (+ main_~z~0 25) main_~y~0)) (or (<= 1000000 main_~x~0) (< (+ main_~z~0 main_~x~0) (+ main_~y~0 999975))))} is VALID [2022-04-28 03:47:12,078 INFO L272 TraceCheckUtils]: 4: Hoare triple {31300#true} call #t~ret9 := main(); {31300#true} is VALID [2022-04-28 03:47:12,078 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {31300#true} {31300#true} #52#return; {31300#true} is VALID [2022-04-28 03:47:12,078 INFO L290 TraceCheckUtils]: 2: Hoare triple {31300#true} assume true; {31300#true} is VALID [2022-04-28 03:47:12,078 INFO L290 TraceCheckUtils]: 1: Hoare triple {31300#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(17, 2);call #Ultimate.allocInit(12, 3); {31300#true} is VALID [2022-04-28 03:47:12,078 INFO L272 TraceCheckUtils]: 0: Hoare triple {31300#true} call ULTIMATE.init(); {31300#true} is VALID [2022-04-28 03:47:12,078 INFO L134 CoverageAnalysis]: Checked inductivity of 327 backedges. 0 proven. 327 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 03:47:12,078 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1746192515] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 03:47:12,078 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 03:47:12,078 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [32, 31, 31] total 90 [2022-04-28 03:47:14,926 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 03:47:14,927 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1694431304] [2022-04-28 03:47:14,927 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1694431304] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 03:47:14,927 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 03:47:14,927 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [74] imperfect sequences [] total 74 [2022-04-28 03:47:14,927 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1320768253] [2022-04-28 03:47:14,927 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 03:47:14,927 INFO L78 Accepts]: Start accepts. Automaton has has 74 states, 74 states have (on average 1.635135135135135) internal successors, (121), 73 states have internal predecessors, (121), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 125 [2022-04-28 03:47:14,927 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 03:47:14,928 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 74 states, 74 states have (on average 1.635135135135135) internal successors, (121), 73 states have internal predecessors, (121), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:47:15,022 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 125 edges. 125 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 03:47:15,022 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 74 states [2022-04-28 03:47:15,022 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 03:47:15,023 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 74 interpolants. [2022-04-28 03:47:15,024 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=4639, Invalid=13451, Unknown=0, NotChecked=0, Total=18090 [2022-04-28 03:47:15,024 INFO L87 Difference]: Start difference. First operand 210 states and 214 transitions. Second operand has 74 states, 74 states have (on average 1.635135135135135) internal successors, (121), 73 states have internal predecessors, (121), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:47:24,704 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:47:24,704 INFO L93 Difference]: Finished difference Result 328 states and 337 transitions. [2022-04-28 03:47:24,704 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2022-04-28 03:47:24,704 INFO L78 Accepts]: Start accepts. Automaton has has 74 states, 74 states have (on average 1.635135135135135) internal successors, (121), 73 states have internal predecessors, (121), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 125 [2022-04-28 03:47:24,704 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 03:47:24,704 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 74 states, 74 states have (on average 1.635135135135135) internal successors, (121), 73 states have internal predecessors, (121), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:47:24,705 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 119 transitions. [2022-04-28 03:47:24,705 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 74 states, 74 states have (on average 1.635135135135135) internal successors, (121), 73 states have internal predecessors, (121), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:47:24,706 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 119 transitions. [2022-04-28 03:47:24,706 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 48 states and 119 transitions. [2022-04-28 03:47:24,801 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 119 edges. 119 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 03:47:24,803 INFO L225 Difference]: With dead ends: 328 [2022-04-28 03:47:24,803 INFO L226 Difference]: Without dead ends: 212 [2022-04-28 03:47:24,805 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 251 GetRequests, 71 SyntacticMatches, 2 SemanticMatches, 178 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7346 ImplicationChecksByTransitivity, 7.3s TimeCoverageRelationStatistics Valid=6220, Invalid=26000, Unknown=0, NotChecked=0, Total=32220 [2022-04-28 03:47:24,805 INFO L413 NwaCegarLoop]: 13 mSDtfsCounter, 55 mSDsluCounter, 242 mSDsCounter, 0 mSdLazyCounter, 4752 mSolverCounterSat, 50 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 55 SdHoareTripleChecker+Valid, 255 SdHoareTripleChecker+Invalid, 4802 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 50 IncrementalHoareTripleChecker+Valid, 4752 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.7s IncrementalHoareTripleChecker+Time [2022-04-28 03:47:24,805 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [55 Valid, 255 Invalid, 4802 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [50 Valid, 4752 Invalid, 0 Unknown, 0 Unchecked, 3.7s Time] [2022-04-28 03:47:24,806 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 212 states. [2022-04-28 03:47:25,253 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 212 to 212. [2022-04-28 03:47:25,253 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 03:47:25,254 INFO L82 GeneralOperation]: Start isEquivalent. First operand 212 states. Second operand has 212 states, 207 states have (on average 1.0241545893719808) internal successors, (212), 207 states have internal predecessors, (212), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:47:25,254 INFO L74 IsIncluded]: Start isIncluded. First operand 212 states. Second operand has 212 states, 207 states have (on average 1.0241545893719808) internal successors, (212), 207 states have internal predecessors, (212), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:47:25,254 INFO L87 Difference]: Start difference. First operand 212 states. Second operand has 212 states, 207 states have (on average 1.0241545893719808) internal successors, (212), 207 states have internal predecessors, (212), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:47:25,265 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:47:25,265 INFO L93 Difference]: Finished difference Result 212 states and 216 transitions. [2022-04-28 03:47:25,265 INFO L276 IsEmpty]: Start isEmpty. Operand 212 states and 216 transitions. [2022-04-28 03:47:25,266 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:47:25,266 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:47:25,266 INFO L74 IsIncluded]: Start isIncluded. First operand has 212 states, 207 states have (on average 1.0241545893719808) internal successors, (212), 207 states have internal predecessors, (212), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 212 states. [2022-04-28 03:47:25,266 INFO L87 Difference]: Start difference. First operand has 212 states, 207 states have (on average 1.0241545893719808) internal successors, (212), 207 states have internal predecessors, (212), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 212 states. [2022-04-28 03:47:25,268 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:47:25,269 INFO L93 Difference]: Finished difference Result 212 states and 216 transitions. [2022-04-28 03:47:25,269 INFO L276 IsEmpty]: Start isEmpty. Operand 212 states and 216 transitions. [2022-04-28 03:47:25,269 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:47:25,269 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:47:25,269 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 03:47:25,269 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 03:47:25,269 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 212 states, 207 states have (on average 1.0241545893719808) internal successors, (212), 207 states have internal predecessors, (212), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:47:25,272 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 212 states to 212 states and 216 transitions. [2022-04-28 03:47:25,272 INFO L78 Accepts]: Start accepts. Automaton has 212 states and 216 transitions. Word has length 125 [2022-04-28 03:47:25,273 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 03:47:25,273 INFO L495 AbstractCegarLoop]: Abstraction has 212 states and 216 transitions. [2022-04-28 03:47:25,273 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 74 states, 74 states have (on average 1.635135135135135) internal successors, (121), 73 states have internal predecessors, (121), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:47:25,273 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 212 states and 216 transitions. [2022-04-28 03:47:25,473 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 216 edges. 216 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 03:47:25,473 INFO L276 IsEmpty]: Start isEmpty. Operand 212 states and 216 transitions. [2022-04-28 03:47:25,474 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2022-04-28 03:47:25,474 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 03:47:25,474 INFO L195 NwaCegarLoop]: trace histogram [45, 44, 25, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 03:47:25,489 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (32)] Forceful destruction successful, exit code 0 [2022-04-28 03:47:25,675 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33,32 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 03:47:25,675 INFO L420 AbstractCegarLoop]: === Iteration 35 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 03:47:25,675 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 03:47:25,676 INFO L85 PathProgramCache]: Analyzing trace with hash 38437261, now seen corresponding path program 32 times [2022-04-28 03:47:25,676 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 03:47:25,676 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [164691489] [2022-04-28 03:47:25,784 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 1 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 03:47:26,043 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={1=1, 2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 03:47:26,044 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-28 03:47:26,048 INFO L85 PathProgramCache]: Analyzing trace with hash 1060212738, now seen corresponding path program 1 times [2022-04-28 03:47:26,048 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 03:47:26,048 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2064709355] [2022-04-28 03:47:26,048 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:47:26,048 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 03:47:26,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:47:26,627 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 03:47:26,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:47:26,633 INFO L290 TraceCheckUtils]: 0: Hoare triple {33305#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(17, 2);call #Ultimate.allocInit(12, 3); {33271#true} is VALID [2022-04-28 03:47:26,633 INFO L290 TraceCheckUtils]: 1: Hoare triple {33271#true} assume true; {33271#true} is VALID [2022-04-28 03:47:26,633 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {33271#true} {33271#true} #52#return; {33271#true} is VALID [2022-04-28 03:47:26,634 INFO L272 TraceCheckUtils]: 0: Hoare triple {33271#true} call ULTIMATE.init(); {33305#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 03:47:26,634 INFO L290 TraceCheckUtils]: 1: Hoare triple {33305#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(17, 2);call #Ultimate.allocInit(12, 3); {33271#true} is VALID [2022-04-28 03:47:26,634 INFO L290 TraceCheckUtils]: 2: Hoare triple {33271#true} assume true; {33271#true} is VALID [2022-04-28 03:47:26,634 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {33271#true} {33271#true} #52#return; {33271#true} is VALID [2022-04-28 03:47:26,634 INFO L272 TraceCheckUtils]: 4: Hoare triple {33271#true} call #t~ret9 := main(); {33271#true} is VALID [2022-04-28 03:47:26,634 INFO L290 TraceCheckUtils]: 5: Hoare triple {33271#true} ~x~0 := 0;~y~0 := 50000;~z~0 := 0;~x~0 := 0; {33276#(and (= main_~z~0 0) (= main_~x~0 0) (<= 50000 main_~y~0))} is VALID [2022-04-28 03:47:26,635 INFO L290 TraceCheckUtils]: 6: Hoare triple {33276#(and (= main_~z~0 0) (= main_~x~0 0) (<= 50000 main_~y~0))} [184] L11-2-->L18-1_primed: Formula: (let ((.cse0 (= v_main_~x~0_1586 v_main_~x~0_1585)) (.cse1 (= |v_main_#t~post4_198| |v_main_#t~post4_197|))) (or (and (< v_main_~x~0_1585 50001) (< v_main_~x~0_1586 v_main_~x~0_1585)) (and .cse0 .cse1) (and .cse0 .cse1 (not (< v_main_~x~0_1586 50000))))) InVars {main_~x~0=v_main_~x~0_1586, main_#t~post4=|v_main_#t~post4_198|} OutVars{main_~x~0=v_main_~x~0_1585, main_#t~post4=|v_main_#t~post4_197|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {33277#(and (= main_~z~0 0) (<= main_~x~0 50000) (<= 50000 main_~y~0))} is VALID [2022-04-28 03:47:26,635 INFO L290 TraceCheckUtils]: 7: Hoare triple {33277#(and (= main_~z~0 0) (<= main_~x~0 50000) (<= 50000 main_~y~0))} [185] L18-1_primed-->L11-2: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {33277#(and (= main_~z~0 0) (<= main_~x~0 50000) (<= 50000 main_~y~0))} is VALID [2022-04-28 03:47:26,636 INFO L290 TraceCheckUtils]: 8: Hoare triple {33277#(and (= main_~z~0 0) (<= main_~x~0 50000) (<= 50000 main_~y~0))} [186] L11-2-->L18-1_primed: Formula: (let ((.cse2 (= |v_main_#t~post6_221| |v_main_#t~post6_220|)) (.cse3 (= |v_main_#t~post5_221| |v_main_#t~post5_220|)) (.cse1 (<= 50000 v_main_~x~0_1588)) (.cse4 (= v_main_~y~0_1684 v_main_~y~0_1683)) (.cse5 (= v_main_~x~0_1588 v_main_~x~0_1587))) (or (let ((.cse0 (+ v_main_~x~0_1588 v_main_~y~0_1683))) (and (< .cse0 (+ 1000001 v_main_~y~0_1684)) (= (+ v_main_~x~0_1587 v_main_~y~0_1684) .cse0) (< v_main_~y~0_1684 v_main_~y~0_1683) .cse1)) (and .cse2 .cse3 .cse4 .cse5) (and .cse2 .cse3 (or (not (< v_main_~x~0_1588 1000000)) (not .cse1)) .cse4 .cse5))) InVars {main_~y~0=v_main_~y~0_1684, main_#t~post5=|v_main_#t~post5_221|, main_~x~0=v_main_~x~0_1588, main_#t~post6=|v_main_#t~post6_221|} OutVars{main_~y~0=v_main_~y~0_1683, main_#t~post5=|v_main_#t~post5_220|, main_~x~0=v_main_~x~0_1587, main_#t~post6=|v_main_#t~post6_220|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {33278#(or (<= main_~x~0 50000) (and (= main_~z~0 0) (<= 50001 main_~y~0)))} is VALID [2022-04-28 03:47:26,636 INFO L290 TraceCheckUtils]: 9: Hoare triple {33278#(or (<= main_~x~0 50000) (and (= main_~z~0 0) (<= 50001 main_~y~0)))} [183] L18-1_primed-->L18-1: Formula: (not (< v_main_~x~0_11 1000000)) InVars {main_~x~0=v_main_~x~0_11} OutVars{main_~x~0=v_main_~x~0_11} AuxVars[] AssignedVars[] {33279#(and (= main_~z~0 0) (<= 50001 main_~y~0))} is VALID [2022-04-28 03:47:26,637 INFO L290 TraceCheckUtils]: 10: Hoare triple {33279#(and (= main_~z~0 0) (<= 50001 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {33280#(and (= main_~z~0 0) (<= 50000 main_~y~0))} is VALID [2022-04-28 03:47:26,637 INFO L290 TraceCheckUtils]: 11: Hoare triple {33280#(and (= main_~z~0 0) (<= 50000 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {33281#(and (= main_~z~0 0) (<= 49999 main_~y~0))} is VALID [2022-04-28 03:47:26,638 INFO L290 TraceCheckUtils]: 12: Hoare triple {33281#(and (= main_~z~0 0) (<= 49999 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {33282#(and (<= 49998 main_~y~0) (= main_~z~0 0))} is VALID [2022-04-28 03:47:26,638 INFO L290 TraceCheckUtils]: 13: Hoare triple {33282#(and (<= 49998 main_~y~0) (= main_~z~0 0))} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {33283#(and (= main_~z~0 0) (<= 49997 main_~y~0))} is VALID [2022-04-28 03:47:26,639 INFO L290 TraceCheckUtils]: 14: Hoare triple {33283#(and (= main_~z~0 0) (<= 49997 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {33284#(and (= main_~z~0 0) (<= 49996 main_~y~0))} is VALID [2022-04-28 03:47:26,639 INFO L290 TraceCheckUtils]: 15: Hoare triple {33284#(and (= main_~z~0 0) (<= 49996 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {33285#(and (= main_~z~0 0) (<= 49995 main_~y~0))} is VALID [2022-04-28 03:47:26,640 INFO L290 TraceCheckUtils]: 16: Hoare triple {33285#(and (= main_~z~0 0) (<= 49995 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {33286#(and (= main_~z~0 0) (<= 49994 main_~y~0))} is VALID [2022-04-28 03:47:26,640 INFO L290 TraceCheckUtils]: 17: Hoare triple {33286#(and (= main_~z~0 0) (<= 49994 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {33287#(and (= main_~z~0 0) (<= 49993 main_~y~0))} is VALID [2022-04-28 03:47:26,641 INFO L290 TraceCheckUtils]: 18: Hoare triple {33287#(and (= main_~z~0 0) (<= 49993 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {33288#(and (= main_~z~0 0) (<= 49992 main_~y~0))} is VALID [2022-04-28 03:47:26,641 INFO L290 TraceCheckUtils]: 19: Hoare triple {33288#(and (= main_~z~0 0) (<= 49992 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {33289#(and (= main_~z~0 0) (<= 49991 main_~y~0))} is VALID [2022-04-28 03:47:26,642 INFO L290 TraceCheckUtils]: 20: Hoare triple {33289#(and (= main_~z~0 0) (<= 49991 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {33290#(and (<= 49990 main_~y~0) (= main_~z~0 0))} is VALID [2022-04-28 03:47:26,642 INFO L290 TraceCheckUtils]: 21: Hoare triple {33290#(and (<= 49990 main_~y~0) (= main_~z~0 0))} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {33291#(and (= main_~z~0 0) (<= 49989 main_~y~0))} is VALID [2022-04-28 03:47:26,643 INFO L290 TraceCheckUtils]: 22: Hoare triple {33291#(and (= main_~z~0 0) (<= 49989 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {33292#(and (= main_~z~0 0) (<= 49988 main_~y~0))} is VALID [2022-04-28 03:47:26,643 INFO L290 TraceCheckUtils]: 23: Hoare triple {33292#(and (= main_~z~0 0) (<= 49988 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {33293#(and (= main_~z~0 0) (<= 49987 main_~y~0))} is VALID [2022-04-28 03:47:26,644 INFO L290 TraceCheckUtils]: 24: Hoare triple {33293#(and (= main_~z~0 0) (<= 49987 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {33294#(and (= main_~z~0 0) (<= 49986 main_~y~0))} is VALID [2022-04-28 03:47:26,644 INFO L290 TraceCheckUtils]: 25: Hoare triple {33294#(and (= main_~z~0 0) (<= 49986 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {33295#(and (= main_~z~0 0) (<= 49985 main_~y~0))} is VALID [2022-04-28 03:47:26,645 INFO L290 TraceCheckUtils]: 26: Hoare triple {33295#(and (= main_~z~0 0) (<= 49985 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {33296#(and (= main_~z~0 0) (<= 49984 main_~y~0))} is VALID [2022-04-28 03:47:26,645 INFO L290 TraceCheckUtils]: 27: Hoare triple {33296#(and (= main_~z~0 0) (<= 49984 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {33297#(and (= main_~z~0 0) (<= 49983 main_~y~0))} is VALID [2022-04-28 03:47:26,645 INFO L290 TraceCheckUtils]: 28: Hoare triple {33297#(and (= main_~z~0 0) (<= 49983 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {33298#(and (= main_~z~0 0) (<= 49982 main_~y~0))} is VALID [2022-04-28 03:47:26,646 INFO L290 TraceCheckUtils]: 29: Hoare triple {33298#(and (= main_~z~0 0) (<= 49982 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {33299#(and (<= 49981 main_~y~0) (= main_~z~0 0))} is VALID [2022-04-28 03:47:26,646 INFO L290 TraceCheckUtils]: 30: Hoare triple {33299#(and (<= 49981 main_~y~0) (= main_~z~0 0))} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {33300#(and (= main_~z~0 0) (<= 49980 main_~y~0))} is VALID [2022-04-28 03:47:26,647 INFO L290 TraceCheckUtils]: 31: Hoare triple {33300#(and (= main_~z~0 0) (<= 49980 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {33301#(and (= main_~z~0 0) (<= 49979 main_~y~0))} is VALID [2022-04-28 03:47:26,647 INFO L290 TraceCheckUtils]: 32: Hoare triple {33301#(and (= main_~z~0 0) (<= 49979 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {33302#(and (= main_~z~0 0) (<= 49978 main_~y~0))} is VALID [2022-04-28 03:47:26,648 INFO L290 TraceCheckUtils]: 33: Hoare triple {33302#(and (= main_~z~0 0) (<= 49978 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {33303#(and (= main_~z~0 0) (<= 49977 main_~y~0))} is VALID [2022-04-28 03:47:26,648 INFO L290 TraceCheckUtils]: 34: Hoare triple {33303#(and (= main_~z~0 0) (<= 49977 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {33304#(and (= main_~z~0 0) (<= 49976 main_~y~0))} is VALID [2022-04-28 03:47:26,649 INFO L290 TraceCheckUtils]: 35: Hoare triple {33304#(and (= main_~z~0 0) (<= 49976 main_~y~0))} assume !(~y~0 > ~z~0); {33272#false} is VALID [2022-04-28 03:47:26,649 INFO L272 TraceCheckUtils]: 36: Hoare triple {33272#false} call __VERIFIER_assert((if ~x~0 == ~z~0 then 1 else 0)); {33272#false} is VALID [2022-04-28 03:47:26,649 INFO L290 TraceCheckUtils]: 37: Hoare triple {33272#false} ~cond := #in~cond; {33272#false} is VALID [2022-04-28 03:47:26,649 INFO L290 TraceCheckUtils]: 38: Hoare triple {33272#false} assume 0 == ~cond; {33272#false} is VALID [2022-04-28 03:47:26,649 INFO L290 TraceCheckUtils]: 39: Hoare triple {33272#false} assume !false; {33272#false} is VALID [2022-04-28 03:47:26,649 INFO L134 CoverageAnalysis]: Checked inductivity of 327 backedges. 0 proven. 327 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 03:47:26,649 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 03:47:26,649 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2064709355] [2022-04-28 03:47:26,649 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2064709355] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 03:47:26,649 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1722353358] [2022-04-28 03:47:26,649 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:47:26,650 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 03:47:26,650 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 03:47:26,650 INFO L229 MonitoredProcess]: Starting monitored process 33 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 03:47:26,651 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (33)] Waiting until timeout for monitored process [2022-04-28 03:47:26,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:47:26,696 INFO L263 TraceCheckSpWp]: Trace formula consists of 184 conjuncts, 29 conjunts are in the unsatisfiable core [2022-04-28 03:47:26,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:47:26,714 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 03:47:28,030 INFO L272 TraceCheckUtils]: 0: Hoare triple {33271#true} call ULTIMATE.init(); {33271#true} is VALID [2022-04-28 03:47:28,030 INFO L290 TraceCheckUtils]: 1: Hoare triple {33271#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(17, 2);call #Ultimate.allocInit(12, 3); {33271#true} is VALID [2022-04-28 03:47:28,030 INFO L290 TraceCheckUtils]: 2: Hoare triple {33271#true} assume true; {33271#true} is VALID [2022-04-28 03:47:28,030 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {33271#true} {33271#true} #52#return; {33271#true} is VALID [2022-04-28 03:47:28,030 INFO L272 TraceCheckUtils]: 4: Hoare triple {33271#true} call #t~ret9 := main(); {33271#true} is VALID [2022-04-28 03:47:28,030 INFO L290 TraceCheckUtils]: 5: Hoare triple {33271#true} ~x~0 := 0;~y~0 := 50000;~z~0 := 0;~x~0 := 0; {33324#(and (<= main_~z~0 0) (<= 50000 main_~y~0))} is VALID [2022-04-28 03:47:28,031 INFO L290 TraceCheckUtils]: 6: Hoare triple {33324#(and (<= main_~z~0 0) (<= 50000 main_~y~0))} [184] L11-2-->L18-1_primed: Formula: (let ((.cse0 (= v_main_~x~0_1586 v_main_~x~0_1585)) (.cse1 (= |v_main_#t~post4_198| |v_main_#t~post4_197|))) (or (and (< v_main_~x~0_1585 50001) (< v_main_~x~0_1586 v_main_~x~0_1585)) (and .cse0 .cse1) (and .cse0 .cse1 (not (< v_main_~x~0_1586 50000))))) InVars {main_~x~0=v_main_~x~0_1586, main_#t~post4=|v_main_#t~post4_198|} OutVars{main_~x~0=v_main_~x~0_1585, main_#t~post4=|v_main_#t~post4_197|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {33324#(and (<= main_~z~0 0) (<= 50000 main_~y~0))} is VALID [2022-04-28 03:47:28,031 INFO L290 TraceCheckUtils]: 7: Hoare triple {33324#(and (<= main_~z~0 0) (<= 50000 main_~y~0))} [185] L18-1_primed-->L11-2: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {33324#(and (<= main_~z~0 0) (<= 50000 main_~y~0))} is VALID [2022-04-28 03:47:28,032 INFO L290 TraceCheckUtils]: 8: Hoare triple {33324#(and (<= main_~z~0 0) (<= 50000 main_~y~0))} [186] L11-2-->L18-1_primed: Formula: (let ((.cse2 (= |v_main_#t~post6_221| |v_main_#t~post6_220|)) (.cse3 (= |v_main_#t~post5_221| |v_main_#t~post5_220|)) (.cse1 (<= 50000 v_main_~x~0_1588)) (.cse4 (= v_main_~y~0_1684 v_main_~y~0_1683)) (.cse5 (= v_main_~x~0_1588 v_main_~x~0_1587))) (or (let ((.cse0 (+ v_main_~x~0_1588 v_main_~y~0_1683))) (and (< .cse0 (+ 1000001 v_main_~y~0_1684)) (= (+ v_main_~x~0_1587 v_main_~y~0_1684) .cse0) (< v_main_~y~0_1684 v_main_~y~0_1683) .cse1)) (and .cse2 .cse3 .cse4 .cse5) (and .cse2 .cse3 (or (not (< v_main_~x~0_1588 1000000)) (not .cse1)) .cse4 .cse5))) InVars {main_~y~0=v_main_~y~0_1684, main_#t~post5=|v_main_#t~post5_221|, main_~x~0=v_main_~x~0_1588, main_#t~post6=|v_main_#t~post6_221|} OutVars{main_~y~0=v_main_~y~0_1683, main_#t~post5=|v_main_#t~post5_220|, main_~x~0=v_main_~x~0_1587, main_#t~post6=|v_main_#t~post6_220|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {33324#(and (<= main_~z~0 0) (<= 50000 main_~y~0))} is VALID [2022-04-28 03:47:28,032 INFO L290 TraceCheckUtils]: 9: Hoare triple {33324#(and (<= main_~z~0 0) (<= 50000 main_~y~0))} [183] L18-1_primed-->L18-1: Formula: (not (< v_main_~x~0_11 1000000)) InVars {main_~x~0=v_main_~x~0_11} OutVars{main_~x~0=v_main_~x~0_11} AuxVars[] AssignedVars[] {33324#(and (<= main_~z~0 0) (<= 50000 main_~y~0))} is VALID [2022-04-28 03:47:28,033 INFO L290 TraceCheckUtils]: 10: Hoare triple {33324#(and (<= main_~z~0 0) (<= 50000 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {33340#(and (<= main_~z~0 0) (<= 49999 main_~y~0))} is VALID [2022-04-28 03:47:28,033 INFO L290 TraceCheckUtils]: 11: Hoare triple {33340#(and (<= main_~z~0 0) (<= 49999 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {33344#(and (<= main_~z~0 0) (<= 49998 main_~y~0))} is VALID [2022-04-28 03:47:28,034 INFO L290 TraceCheckUtils]: 12: Hoare triple {33344#(and (<= main_~z~0 0) (<= 49998 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {33348#(and (<= main_~z~0 0) (<= 49997 main_~y~0))} is VALID [2022-04-28 03:47:28,035 INFO L290 TraceCheckUtils]: 13: Hoare triple {33348#(and (<= main_~z~0 0) (<= 49997 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {33352#(and (<= main_~z~0 0) (<= 49996 main_~y~0))} is VALID [2022-04-28 03:47:28,036 INFO L290 TraceCheckUtils]: 14: Hoare triple {33352#(and (<= main_~z~0 0) (<= 49996 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {33356#(and (<= main_~z~0 0) (<= 49995 main_~y~0))} is VALID [2022-04-28 03:47:28,037 INFO L290 TraceCheckUtils]: 15: Hoare triple {33356#(and (<= main_~z~0 0) (<= 49995 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {33360#(and (<= main_~z~0 0) (<= 49994 main_~y~0))} is VALID [2022-04-28 03:47:28,037 INFO L290 TraceCheckUtils]: 16: Hoare triple {33360#(and (<= main_~z~0 0) (<= 49994 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {33364#(and (<= main_~z~0 0) (<= 49993 main_~y~0))} is VALID [2022-04-28 03:47:28,038 INFO L290 TraceCheckUtils]: 17: Hoare triple {33364#(and (<= main_~z~0 0) (<= 49993 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {33368#(and (<= main_~z~0 0) (<= 49992 main_~y~0))} is VALID [2022-04-28 03:47:28,039 INFO L290 TraceCheckUtils]: 18: Hoare triple {33368#(and (<= main_~z~0 0) (<= 49992 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {33372#(and (<= main_~z~0 0) (<= 49991 main_~y~0))} is VALID [2022-04-28 03:47:28,039 INFO L290 TraceCheckUtils]: 19: Hoare triple {33372#(and (<= main_~z~0 0) (<= 49991 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {33376#(and (<= main_~z~0 0) (<= 49990 main_~y~0))} is VALID [2022-04-28 03:47:28,040 INFO L290 TraceCheckUtils]: 20: Hoare triple {33376#(and (<= main_~z~0 0) (<= 49990 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {33380#(and (<= main_~z~0 0) (<= 49989 main_~y~0))} is VALID [2022-04-28 03:47:28,040 INFO L290 TraceCheckUtils]: 21: Hoare triple {33380#(and (<= main_~z~0 0) (<= 49989 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {33384#(and (<= main_~z~0 0) (<= 49988 main_~y~0))} is VALID [2022-04-28 03:47:28,041 INFO L290 TraceCheckUtils]: 22: Hoare triple {33384#(and (<= main_~z~0 0) (<= 49988 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {33388#(and (<= main_~z~0 0) (<= 49987 main_~y~0))} is VALID [2022-04-28 03:47:28,041 INFO L290 TraceCheckUtils]: 23: Hoare triple {33388#(and (<= main_~z~0 0) (<= 49987 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {33392#(and (<= main_~z~0 0) (<= 49986 main_~y~0))} is VALID [2022-04-28 03:47:28,042 INFO L290 TraceCheckUtils]: 24: Hoare triple {33392#(and (<= main_~z~0 0) (<= 49986 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {33396#(and (<= main_~z~0 0) (<= 49985 main_~y~0))} is VALID [2022-04-28 03:47:28,043 INFO L290 TraceCheckUtils]: 25: Hoare triple {33396#(and (<= main_~z~0 0) (<= 49985 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {33400#(and (<= main_~z~0 0) (<= 49984 main_~y~0))} is VALID [2022-04-28 03:47:28,043 INFO L290 TraceCheckUtils]: 26: Hoare triple {33400#(and (<= main_~z~0 0) (<= 49984 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {33404#(and (<= main_~z~0 0) (<= 49983 main_~y~0))} is VALID [2022-04-28 03:47:28,044 INFO L290 TraceCheckUtils]: 27: Hoare triple {33404#(and (<= main_~z~0 0) (<= 49983 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {33408#(and (<= main_~z~0 0) (<= 49982 main_~y~0))} is VALID [2022-04-28 03:47:28,044 INFO L290 TraceCheckUtils]: 28: Hoare triple {33408#(and (<= main_~z~0 0) (<= 49982 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {33412#(and (<= main_~z~0 0) (<= 49981 main_~y~0))} is VALID [2022-04-28 03:47:28,045 INFO L290 TraceCheckUtils]: 29: Hoare triple {33412#(and (<= main_~z~0 0) (<= 49981 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {33416#(and (<= main_~z~0 0) (<= 49980 main_~y~0))} is VALID [2022-04-28 03:47:28,046 INFO L290 TraceCheckUtils]: 30: Hoare triple {33416#(and (<= main_~z~0 0) (<= 49980 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {33420#(and (<= main_~z~0 0) (<= 49979 main_~y~0))} is VALID [2022-04-28 03:47:28,046 INFO L290 TraceCheckUtils]: 31: Hoare triple {33420#(and (<= main_~z~0 0) (<= 49979 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {33424#(and (<= main_~z~0 0) (<= 49978 main_~y~0))} is VALID [2022-04-28 03:47:28,047 INFO L290 TraceCheckUtils]: 32: Hoare triple {33424#(and (<= main_~z~0 0) (<= 49978 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {33428#(and (<= main_~z~0 0) (<= 49977 main_~y~0))} is VALID [2022-04-28 03:47:28,048 INFO L290 TraceCheckUtils]: 33: Hoare triple {33428#(and (<= main_~z~0 0) (<= 49977 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {33432#(and (<= main_~z~0 0) (<= 49976 main_~y~0))} is VALID [2022-04-28 03:47:28,048 INFO L290 TraceCheckUtils]: 34: Hoare triple {33432#(and (<= main_~z~0 0) (<= 49976 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {33436#(and (<= main_~z~0 0) (<= 49975 main_~y~0))} is VALID [2022-04-28 03:47:28,049 INFO L290 TraceCheckUtils]: 35: Hoare triple {33436#(and (<= main_~z~0 0) (<= 49975 main_~y~0))} assume !(~y~0 > ~z~0); {33272#false} is VALID [2022-04-28 03:47:28,049 INFO L272 TraceCheckUtils]: 36: Hoare triple {33272#false} call __VERIFIER_assert((if ~x~0 == ~z~0 then 1 else 0)); {33272#false} is VALID [2022-04-28 03:47:28,049 INFO L290 TraceCheckUtils]: 37: Hoare triple {33272#false} ~cond := #in~cond; {33272#false} is VALID [2022-04-28 03:47:28,049 INFO L290 TraceCheckUtils]: 38: Hoare triple {33272#false} assume 0 == ~cond; {33272#false} is VALID [2022-04-28 03:47:28,049 INFO L290 TraceCheckUtils]: 39: Hoare triple {33272#false} assume !false; {33272#false} is VALID [2022-04-28 03:47:28,050 INFO L134 CoverageAnalysis]: Checked inductivity of 327 backedges. 0 proven. 325 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-04-28 03:47:28,050 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 03:47:29,812 INFO L290 TraceCheckUtils]: 39: Hoare triple {33272#false} assume !false; {33272#false} is VALID [2022-04-28 03:47:29,812 INFO L290 TraceCheckUtils]: 38: Hoare triple {33272#false} assume 0 == ~cond; {33272#false} is VALID [2022-04-28 03:47:29,812 INFO L290 TraceCheckUtils]: 37: Hoare triple {33272#false} ~cond := #in~cond; {33272#false} is VALID [2022-04-28 03:47:29,812 INFO L272 TraceCheckUtils]: 36: Hoare triple {33272#false} call __VERIFIER_assert((if ~x~0 == ~z~0 then 1 else 0)); {33272#false} is VALID [2022-04-28 03:47:29,812 INFO L290 TraceCheckUtils]: 35: Hoare triple {33464#(< main_~z~0 main_~y~0)} assume !(~y~0 > ~z~0); {33272#false} is VALID [2022-04-28 03:47:29,813 INFO L290 TraceCheckUtils]: 34: Hoare triple {33468#(< (+ main_~z~0 1) main_~y~0)} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {33464#(< main_~z~0 main_~y~0)} is VALID [2022-04-28 03:47:29,813 INFO L290 TraceCheckUtils]: 33: Hoare triple {33472#(< (+ main_~z~0 2) main_~y~0)} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {33468#(< (+ main_~z~0 1) main_~y~0)} is VALID [2022-04-28 03:47:29,814 INFO L290 TraceCheckUtils]: 32: Hoare triple {33476#(< (+ main_~z~0 3) main_~y~0)} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {33472#(< (+ main_~z~0 2) main_~y~0)} is VALID [2022-04-28 03:47:29,814 INFO L290 TraceCheckUtils]: 31: Hoare triple {33480#(< (+ main_~z~0 4) main_~y~0)} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {33476#(< (+ main_~z~0 3) main_~y~0)} is VALID [2022-04-28 03:47:29,815 INFO L290 TraceCheckUtils]: 30: Hoare triple {33484#(< (+ 5 main_~z~0) main_~y~0)} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {33480#(< (+ main_~z~0 4) main_~y~0)} is VALID [2022-04-28 03:47:29,815 INFO L290 TraceCheckUtils]: 29: Hoare triple {33488#(< (+ main_~z~0 6) main_~y~0)} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {33484#(< (+ 5 main_~z~0) main_~y~0)} is VALID [2022-04-28 03:47:29,815 INFO L290 TraceCheckUtils]: 28: Hoare triple {33492#(< (+ 7 main_~z~0) main_~y~0)} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {33488#(< (+ main_~z~0 6) main_~y~0)} is VALID [2022-04-28 03:47:29,816 INFO L290 TraceCheckUtils]: 27: Hoare triple {33496#(< (+ main_~z~0 8) main_~y~0)} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {33492#(< (+ 7 main_~z~0) main_~y~0)} is VALID [2022-04-28 03:47:29,816 INFO L290 TraceCheckUtils]: 26: Hoare triple {33500#(< (+ main_~z~0 9) main_~y~0)} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {33496#(< (+ main_~z~0 8) main_~y~0)} is VALID [2022-04-28 03:47:29,817 INFO L290 TraceCheckUtils]: 25: Hoare triple {33504#(< (+ main_~z~0 10) main_~y~0)} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {33500#(< (+ main_~z~0 9) main_~y~0)} is VALID [2022-04-28 03:47:29,817 INFO L290 TraceCheckUtils]: 24: Hoare triple {33508#(< (+ main_~z~0 11) main_~y~0)} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {33504#(< (+ main_~z~0 10) main_~y~0)} is VALID [2022-04-28 03:47:29,818 INFO L290 TraceCheckUtils]: 23: Hoare triple {33512#(< (+ main_~z~0 12) main_~y~0)} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {33508#(< (+ main_~z~0 11) main_~y~0)} is VALID [2022-04-28 03:47:29,818 INFO L290 TraceCheckUtils]: 22: Hoare triple {33516#(< (+ main_~z~0 13) main_~y~0)} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {33512#(< (+ main_~z~0 12) main_~y~0)} is VALID [2022-04-28 03:47:29,819 INFO L290 TraceCheckUtils]: 21: Hoare triple {33520#(< (+ main_~z~0 14) main_~y~0)} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {33516#(< (+ main_~z~0 13) main_~y~0)} is VALID [2022-04-28 03:47:29,819 INFO L290 TraceCheckUtils]: 20: Hoare triple {33524#(< (+ main_~z~0 15) main_~y~0)} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {33520#(< (+ main_~z~0 14) main_~y~0)} is VALID [2022-04-28 03:47:29,820 INFO L290 TraceCheckUtils]: 19: Hoare triple {33528#(< (+ main_~z~0 16) main_~y~0)} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {33524#(< (+ main_~z~0 15) main_~y~0)} is VALID [2022-04-28 03:47:29,820 INFO L290 TraceCheckUtils]: 18: Hoare triple {33532#(< (+ main_~z~0 17) main_~y~0)} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {33528#(< (+ main_~z~0 16) main_~y~0)} is VALID [2022-04-28 03:47:29,820 INFO L290 TraceCheckUtils]: 17: Hoare triple {33536#(< (+ main_~z~0 18) main_~y~0)} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {33532#(< (+ main_~z~0 17) main_~y~0)} is VALID [2022-04-28 03:47:29,821 INFO L290 TraceCheckUtils]: 16: Hoare triple {33540#(< (+ 19 main_~z~0) main_~y~0)} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {33536#(< (+ main_~z~0 18) main_~y~0)} is VALID [2022-04-28 03:47:29,821 INFO L290 TraceCheckUtils]: 15: Hoare triple {33544#(< (+ main_~z~0 20) main_~y~0)} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {33540#(< (+ 19 main_~z~0) main_~y~0)} is VALID [2022-04-28 03:47:29,822 INFO L290 TraceCheckUtils]: 14: Hoare triple {33548#(< (+ main_~z~0 21) main_~y~0)} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {33544#(< (+ main_~z~0 20) main_~y~0)} is VALID [2022-04-28 03:47:29,822 INFO L290 TraceCheckUtils]: 13: Hoare triple {33552#(< (+ main_~z~0 22) main_~y~0)} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {33548#(< (+ main_~z~0 21) main_~y~0)} is VALID [2022-04-28 03:47:29,823 INFO L290 TraceCheckUtils]: 12: Hoare triple {33556#(< (+ 23 main_~z~0) main_~y~0)} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {33552#(< (+ main_~z~0 22) main_~y~0)} is VALID [2022-04-28 03:47:29,823 INFO L290 TraceCheckUtils]: 11: Hoare triple {33560#(< (+ main_~z~0 24) main_~y~0)} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {33556#(< (+ 23 main_~z~0) main_~y~0)} is VALID [2022-04-28 03:47:29,824 INFO L290 TraceCheckUtils]: 10: Hoare triple {33564#(< (+ main_~z~0 25) main_~y~0)} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {33560#(< (+ main_~z~0 24) main_~y~0)} is VALID [2022-04-28 03:47:29,824 INFO L290 TraceCheckUtils]: 9: Hoare triple {33564#(< (+ main_~z~0 25) main_~y~0)} [183] L18-1_primed-->L18-1: Formula: (not (< v_main_~x~0_11 1000000)) InVars {main_~x~0=v_main_~x~0_11} OutVars{main_~x~0=v_main_~x~0_11} AuxVars[] AssignedVars[] {33564#(< (+ main_~z~0 25) main_~y~0)} is VALID [2022-04-28 03:47:29,825 INFO L290 TraceCheckUtils]: 8: Hoare triple {33564#(< (+ main_~z~0 25) main_~y~0)} [186] L11-2-->L18-1_primed: Formula: (let ((.cse2 (= |v_main_#t~post6_221| |v_main_#t~post6_220|)) (.cse3 (= |v_main_#t~post5_221| |v_main_#t~post5_220|)) (.cse1 (<= 50000 v_main_~x~0_1588)) (.cse4 (= v_main_~y~0_1684 v_main_~y~0_1683)) (.cse5 (= v_main_~x~0_1588 v_main_~x~0_1587))) (or (let ((.cse0 (+ v_main_~x~0_1588 v_main_~y~0_1683))) (and (< .cse0 (+ 1000001 v_main_~y~0_1684)) (= (+ v_main_~x~0_1587 v_main_~y~0_1684) .cse0) (< v_main_~y~0_1684 v_main_~y~0_1683) .cse1)) (and .cse2 .cse3 .cse4 .cse5) (and .cse2 .cse3 (or (not (< v_main_~x~0_1588 1000000)) (not .cse1)) .cse4 .cse5))) InVars {main_~y~0=v_main_~y~0_1684, main_#t~post5=|v_main_#t~post5_221|, main_~x~0=v_main_~x~0_1588, main_#t~post6=|v_main_#t~post6_221|} OutVars{main_~y~0=v_main_~y~0_1683, main_#t~post5=|v_main_#t~post5_220|, main_~x~0=v_main_~x~0_1587, main_#t~post6=|v_main_#t~post6_220|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {33564#(< (+ main_~z~0 25) main_~y~0)} is VALID [2022-04-28 03:47:29,826 INFO L290 TraceCheckUtils]: 7: Hoare triple {33564#(< (+ main_~z~0 25) main_~y~0)} [185] L18-1_primed-->L11-2: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {33564#(< (+ main_~z~0 25) main_~y~0)} is VALID [2022-04-28 03:47:29,826 INFO L290 TraceCheckUtils]: 6: Hoare triple {33564#(< (+ main_~z~0 25) main_~y~0)} [184] L11-2-->L18-1_primed: Formula: (let ((.cse0 (= v_main_~x~0_1586 v_main_~x~0_1585)) (.cse1 (= |v_main_#t~post4_198| |v_main_#t~post4_197|))) (or (and (< v_main_~x~0_1585 50001) (< v_main_~x~0_1586 v_main_~x~0_1585)) (and .cse0 .cse1) (and .cse0 .cse1 (not (< v_main_~x~0_1586 50000))))) InVars {main_~x~0=v_main_~x~0_1586, main_#t~post4=|v_main_#t~post4_198|} OutVars{main_~x~0=v_main_~x~0_1585, main_#t~post4=|v_main_#t~post4_197|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {33564#(< (+ main_~z~0 25) main_~y~0)} is VALID [2022-04-28 03:47:29,826 INFO L290 TraceCheckUtils]: 5: Hoare triple {33271#true} ~x~0 := 0;~y~0 := 50000;~z~0 := 0;~x~0 := 0; {33564#(< (+ main_~z~0 25) main_~y~0)} is VALID [2022-04-28 03:47:29,827 INFO L272 TraceCheckUtils]: 4: Hoare triple {33271#true} call #t~ret9 := main(); {33271#true} is VALID [2022-04-28 03:47:29,827 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {33271#true} {33271#true} #52#return; {33271#true} is VALID [2022-04-28 03:47:29,827 INFO L290 TraceCheckUtils]: 2: Hoare triple {33271#true} assume true; {33271#true} is VALID [2022-04-28 03:47:29,827 INFO L290 TraceCheckUtils]: 1: Hoare triple {33271#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(17, 2);call #Ultimate.allocInit(12, 3); {33271#true} is VALID [2022-04-28 03:47:29,827 INFO L272 TraceCheckUtils]: 0: Hoare triple {33271#true} call ULTIMATE.init(); {33271#true} is VALID [2022-04-28 03:47:29,827 INFO L134 CoverageAnalysis]: Checked inductivity of 327 backedges. 0 proven. 325 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-04-28 03:47:29,827 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1722353358] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 03:47:29,827 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 03:47:29,827 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [32, 28, 28] total 84 [2022-04-28 03:47:31,764 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 03:47:31,765 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [164691489] [2022-04-28 03:47:31,765 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [164691489] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 03:47:31,765 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 03:47:31,765 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [75] imperfect sequences [] total 75 [2022-04-28 03:47:31,765 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2061981240] [2022-04-28 03:47:31,765 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 03:47:31,765 INFO L78 Accepts]: Start accepts. Automaton has has 75 states, 75 states have (on average 1.64) internal successors, (123), 74 states have internal predecessors, (123), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 127 [2022-04-28 03:47:31,766 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 03:47:31,766 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 75 states, 75 states have (on average 1.64) internal successors, (123), 74 states have internal predecessors, (123), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:47:31,858 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 127 edges. 127 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 03:47:31,858 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 75 states [2022-04-28 03:47:31,858 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 03:47:31,858 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 75 interpolants. [2022-04-28 03:47:31,859 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6754, Invalid=10016, Unknown=0, NotChecked=0, Total=16770 [2022-04-28 03:47:31,859 INFO L87 Difference]: Start difference. First operand 212 states and 216 transitions. Second operand has 75 states, 75 states have (on average 1.64) internal successors, (123), 74 states have internal predecessors, (123), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:47:41,621 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:47:41,621 INFO L93 Difference]: Finished difference Result 331 states and 341 transitions. [2022-04-28 03:47:41,622 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 75 states. [2022-04-28 03:47:41,622 INFO L78 Accepts]: Start accepts. Automaton has has 75 states, 75 states have (on average 1.64) internal successors, (123), 74 states have internal predecessors, (123), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 127 [2022-04-28 03:47:41,622 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 03:47:41,622 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 75 states, 75 states have (on average 1.64) internal successors, (123), 74 states have internal predecessors, (123), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:47:41,623 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 148 transitions. [2022-04-28 03:47:41,623 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 75 states, 75 states have (on average 1.64) internal successors, (123), 74 states have internal predecessors, (123), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:47:41,624 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 148 transitions. [2022-04-28 03:47:41,625 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 75 states and 148 transitions. [2022-04-28 03:47:41,748 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 148 edges. 148 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 03:47:41,750 INFO L225 Difference]: With dead ends: 331 [2022-04-28 03:47:41,750 INFO L226 Difference]: Without dead ends: 215 [2022-04-28 03:47:41,753 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 280 GetRequests, 78 SyntacticMatches, 2 SemanticMatches, 200 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11782 ImplicationChecksByTransitivity, 6.2s TimeCoverageRelationStatistics Valid=13575, Invalid=27027, Unknown=0, NotChecked=0, Total=40602 [2022-04-28 03:47:41,753 INFO L413 NwaCegarLoop]: 13 mSDtfsCounter, 390 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 4470 mSolverCounterSat, 412 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 390 SdHoareTripleChecker+Valid, 35 SdHoareTripleChecker+Invalid, 4882 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 412 IncrementalHoareTripleChecker+Valid, 4470 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.7s IncrementalHoareTripleChecker+Time [2022-04-28 03:47:41,753 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [390 Valid, 35 Invalid, 4882 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [412 Valid, 4470 Invalid, 0 Unknown, 0 Unchecked, 3.7s Time] [2022-04-28 03:47:41,753 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 215 states. [2022-04-28 03:47:42,236 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 215 to 215. [2022-04-28 03:47:42,237 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 03:47:42,237 INFO L82 GeneralOperation]: Start isEquivalent. First operand 215 states. Second operand has 215 states, 210 states have (on average 1.0238095238095237) internal successors, (215), 210 states have internal predecessors, (215), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:47:42,237 INFO L74 IsIncluded]: Start isIncluded. First operand 215 states. Second operand has 215 states, 210 states have (on average 1.0238095238095237) internal successors, (215), 210 states have internal predecessors, (215), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:47:42,237 INFO L87 Difference]: Start difference. First operand 215 states. Second operand has 215 states, 210 states have (on average 1.0238095238095237) internal successors, (215), 210 states have internal predecessors, (215), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:47:42,239 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:47:42,239 INFO L93 Difference]: Finished difference Result 215 states and 219 transitions. [2022-04-28 03:47:42,239 INFO L276 IsEmpty]: Start isEmpty. Operand 215 states and 219 transitions. [2022-04-28 03:47:42,240 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:47:42,240 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:47:42,240 INFO L74 IsIncluded]: Start isIncluded. First operand has 215 states, 210 states have (on average 1.0238095238095237) internal successors, (215), 210 states have internal predecessors, (215), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 215 states. [2022-04-28 03:47:42,240 INFO L87 Difference]: Start difference. First operand has 215 states, 210 states have (on average 1.0238095238095237) internal successors, (215), 210 states have internal predecessors, (215), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 215 states. [2022-04-28 03:47:42,242 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:47:42,242 INFO L93 Difference]: Finished difference Result 215 states and 219 transitions. [2022-04-28 03:47:42,242 INFO L276 IsEmpty]: Start isEmpty. Operand 215 states and 219 transitions. [2022-04-28 03:47:42,242 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:47:42,242 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:47:42,242 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 03:47:42,242 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 03:47:42,242 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 215 states, 210 states have (on average 1.0238095238095237) internal successors, (215), 210 states have internal predecessors, (215), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:47:42,244 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 215 states to 215 states and 219 transitions. [2022-04-28 03:47:42,244 INFO L78 Accepts]: Start accepts. Automaton has 215 states and 219 transitions. Word has length 127 [2022-04-28 03:47:42,245 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 03:47:42,245 INFO L495 AbstractCegarLoop]: Abstraction has 215 states and 219 transitions. [2022-04-28 03:47:42,245 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 75 states, 75 states have (on average 1.64) internal successors, (123), 74 states have internal predecessors, (123), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:47:42,245 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 215 states and 219 transitions. [2022-04-28 03:47:42,438 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 219 edges. 219 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 03:47:42,439 INFO L276 IsEmpty]: Start isEmpty. Operand 215 states and 219 transitions. [2022-04-28 03:47:42,447 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2022-04-28 03:47:42,447 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 03:47:42,448 INFO L195 NwaCegarLoop]: trace histogram [46, 45, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 03:47:42,463 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (33)] Ended with exit code 0 [2022-04-28 03:47:42,648 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34,33 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 03:47:42,648 INFO L420 AbstractCegarLoop]: === Iteration 36 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 03:47:42,648 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 03:47:42,649 INFO L85 PathProgramCache]: Analyzing trace with hash 1280005371, now seen corresponding path program 33 times [2022-04-28 03:47:42,649 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 03:47:42,649 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [2114657540] [2022-04-28 03:47:46,716 WARN L977 rdanLoopAcceleration]: Unable to prove correctness of quantifier elimination. [2022-04-28 03:47:46,769 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 1 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 03:47:46,967 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={1=1, 2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 03:47:46,968 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-28 03:47:46,970 INFO L85 PathProgramCache]: Analyzing trace with hash 1361097377, now seen corresponding path program 1 times [2022-04-28 03:47:46,970 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 03:47:46,970 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [88735265] [2022-04-28 03:47:46,970 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:47:46,970 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 03:47:46,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:47:47,618 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 03:47:47,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:47:47,621 INFO L290 TraceCheckUtils]: 0: Hoare triple {35344#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(17, 2);call #Ultimate.allocInit(12, 3); {35309#true} is VALID [2022-04-28 03:47:47,621 INFO L290 TraceCheckUtils]: 1: Hoare triple {35309#true} assume true; {35309#true} is VALID [2022-04-28 03:47:47,621 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {35309#true} {35309#true} #52#return; {35309#true} is VALID [2022-04-28 03:47:47,623 INFO L272 TraceCheckUtils]: 0: Hoare triple {35309#true} call ULTIMATE.init(); {35344#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 03:47:47,623 INFO L290 TraceCheckUtils]: 1: Hoare triple {35344#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(17, 2);call #Ultimate.allocInit(12, 3); {35309#true} is VALID [2022-04-28 03:47:47,623 INFO L290 TraceCheckUtils]: 2: Hoare triple {35309#true} assume true; {35309#true} is VALID [2022-04-28 03:47:47,623 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {35309#true} {35309#true} #52#return; {35309#true} is VALID [2022-04-28 03:47:47,623 INFO L272 TraceCheckUtils]: 4: Hoare triple {35309#true} call #t~ret9 := main(); {35309#true} is VALID [2022-04-28 03:47:47,624 INFO L290 TraceCheckUtils]: 5: Hoare triple {35309#true} ~x~0 := 0;~y~0 := 50000;~z~0 := 0;~x~0 := 0; {35314#(and (= main_~z~0 0) (= main_~x~0 0) (<= 50000 main_~y~0))} is VALID [2022-04-28 03:47:47,624 INFO L290 TraceCheckUtils]: 6: Hoare triple {35314#(and (= main_~z~0 0) (= main_~x~0 0) (<= 50000 main_~y~0))} [188] L11-2-->L18-1_primed: Formula: (let ((.cse0 (= |v_main_#t~post4_204| |v_main_#t~post4_203|)) (.cse1 (= v_main_~x~0_1672 v_main_~x~0_1671))) (or (and (< v_main_~x~0_1671 50001) (< v_main_~x~0_1672 v_main_~x~0_1671)) (and .cse0 (not (< v_main_~x~0_1672 50000)) .cse1) (and .cse0 .cse1))) InVars {main_~x~0=v_main_~x~0_1672, main_#t~post4=|v_main_#t~post4_204|} OutVars{main_~x~0=v_main_~x~0_1671, main_#t~post4=|v_main_#t~post4_203|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {35315#(and (= main_~z~0 0) (<= main_~x~0 50000) (<= 50000 main_~y~0))} is VALID [2022-04-28 03:47:47,625 INFO L290 TraceCheckUtils]: 7: Hoare triple {35315#(and (= main_~z~0 0) (<= main_~x~0 50000) (<= 50000 main_~y~0))} [189] L18-1_primed-->L11-2: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {35315#(and (= main_~z~0 0) (<= main_~x~0 50000) (<= 50000 main_~y~0))} is VALID [2022-04-28 03:47:47,626 INFO L290 TraceCheckUtils]: 8: Hoare triple {35315#(and (= main_~z~0 0) (<= main_~x~0 50000) (<= 50000 main_~y~0))} [190] L11-2-->L18-1_primed: Formula: (let ((.cse0 (= |v_main_#t~post6_228| |v_main_#t~post6_227|)) (.cse1 (= v_main_~x~0_1674 v_main_~x~0_1673)) (.cse3 (= v_main_~y~0_1787 v_main_~y~0_1786)) (.cse4 (= |v_main_#t~post5_228| |v_main_#t~post5_227|)) (.cse2 (<= 50000 v_main_~x~0_1674))) (or (and .cse0 .cse1 (or (not (< v_main_~x~0_1674 1000000)) (not .cse2)) .cse3 .cse4) (and .cse0 .cse1 .cse3 .cse4) (let ((.cse5 (+ v_main_~x~0_1674 v_main_~y~0_1786))) (and (= .cse5 (+ v_main_~x~0_1673 v_main_~y~0_1787)) (< .cse5 (+ 1000001 v_main_~y~0_1787)) (< v_main_~y~0_1787 v_main_~y~0_1786) .cse2)))) InVars {main_~y~0=v_main_~y~0_1787, main_#t~post5=|v_main_#t~post5_228|, main_~x~0=v_main_~x~0_1674, main_#t~post6=|v_main_#t~post6_228|} OutVars{main_~y~0=v_main_~y~0_1786, main_#t~post5=|v_main_#t~post5_227|, main_~x~0=v_main_~x~0_1673, main_#t~post6=|v_main_#t~post6_227|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {35316#(or (<= main_~x~0 50000) (and (= main_~z~0 0) (<= 50001 main_~y~0)))} is VALID [2022-04-28 03:47:47,626 INFO L290 TraceCheckUtils]: 9: Hoare triple {35316#(or (<= main_~x~0 50000) (and (= main_~z~0 0) (<= 50001 main_~y~0)))} [187] L18-1_primed-->L18-1: Formula: (not (< v_main_~x~0_11 1000000)) InVars {main_~x~0=v_main_~x~0_11} OutVars{main_~x~0=v_main_~x~0_11} AuxVars[] AssignedVars[] {35317#(and (= main_~z~0 0) (<= 50001 main_~y~0))} is VALID [2022-04-28 03:47:47,627 INFO L290 TraceCheckUtils]: 10: Hoare triple {35317#(and (= main_~z~0 0) (<= 50001 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {35318#(and (= main_~z~0 0) (<= 50000 main_~y~0))} is VALID [2022-04-28 03:47:47,627 INFO L290 TraceCheckUtils]: 11: Hoare triple {35318#(and (= main_~z~0 0) (<= 50000 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {35319#(and (= main_~z~0 0) (<= 49999 main_~y~0))} is VALID [2022-04-28 03:47:47,628 INFO L290 TraceCheckUtils]: 12: Hoare triple {35319#(and (= main_~z~0 0) (<= 49999 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {35320#(and (<= 49998 main_~y~0) (= main_~z~0 0))} is VALID [2022-04-28 03:47:47,628 INFO L290 TraceCheckUtils]: 13: Hoare triple {35320#(and (<= 49998 main_~y~0) (= main_~z~0 0))} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {35321#(and (= main_~z~0 0) (<= 49997 main_~y~0))} is VALID [2022-04-28 03:47:47,629 INFO L290 TraceCheckUtils]: 14: Hoare triple {35321#(and (= main_~z~0 0) (<= 49997 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {35322#(and (= main_~z~0 0) (<= 49996 main_~y~0))} is VALID [2022-04-28 03:47:47,629 INFO L290 TraceCheckUtils]: 15: Hoare triple {35322#(and (= main_~z~0 0) (<= 49996 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {35323#(and (= main_~z~0 0) (<= 49995 main_~y~0))} is VALID [2022-04-28 03:47:47,629 INFO L290 TraceCheckUtils]: 16: Hoare triple {35323#(and (= main_~z~0 0) (<= 49995 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {35324#(and (= main_~z~0 0) (<= 49994 main_~y~0))} is VALID [2022-04-28 03:47:47,630 INFO L290 TraceCheckUtils]: 17: Hoare triple {35324#(and (= main_~z~0 0) (<= 49994 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {35325#(and (= main_~z~0 0) (<= 49993 main_~y~0))} is VALID [2022-04-28 03:47:47,630 INFO L290 TraceCheckUtils]: 18: Hoare triple {35325#(and (= main_~z~0 0) (<= 49993 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {35326#(and (= main_~z~0 0) (<= 49992 main_~y~0))} is VALID [2022-04-28 03:47:47,631 INFO L290 TraceCheckUtils]: 19: Hoare triple {35326#(and (= main_~z~0 0) (<= 49992 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {35327#(and (= main_~z~0 0) (<= 49991 main_~y~0))} is VALID [2022-04-28 03:47:47,631 INFO L290 TraceCheckUtils]: 20: Hoare triple {35327#(and (= main_~z~0 0) (<= 49991 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {35328#(and (<= 49990 main_~y~0) (= main_~z~0 0))} is VALID [2022-04-28 03:47:47,632 INFO L290 TraceCheckUtils]: 21: Hoare triple {35328#(and (<= 49990 main_~y~0) (= main_~z~0 0))} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {35329#(and (= main_~z~0 0) (<= 49989 main_~y~0))} is VALID [2022-04-28 03:47:47,632 INFO L290 TraceCheckUtils]: 22: Hoare triple {35329#(and (= main_~z~0 0) (<= 49989 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {35330#(and (= main_~z~0 0) (<= 49988 main_~y~0))} is VALID [2022-04-28 03:47:47,633 INFO L290 TraceCheckUtils]: 23: Hoare triple {35330#(and (= main_~z~0 0) (<= 49988 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {35331#(and (= main_~z~0 0) (<= 49987 main_~y~0))} is VALID [2022-04-28 03:47:47,633 INFO L290 TraceCheckUtils]: 24: Hoare triple {35331#(and (= main_~z~0 0) (<= 49987 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {35332#(and (= main_~z~0 0) (<= 49986 main_~y~0))} is VALID [2022-04-28 03:47:47,634 INFO L290 TraceCheckUtils]: 25: Hoare triple {35332#(and (= main_~z~0 0) (<= 49986 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {35333#(and (= main_~z~0 0) (<= 49985 main_~y~0))} is VALID [2022-04-28 03:47:47,634 INFO L290 TraceCheckUtils]: 26: Hoare triple {35333#(and (= main_~z~0 0) (<= 49985 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {35334#(and (= main_~z~0 0) (<= 49984 main_~y~0))} is VALID [2022-04-28 03:47:47,635 INFO L290 TraceCheckUtils]: 27: Hoare triple {35334#(and (= main_~z~0 0) (<= 49984 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {35335#(and (= main_~z~0 0) (<= 49983 main_~y~0))} is VALID [2022-04-28 03:47:47,635 INFO L290 TraceCheckUtils]: 28: Hoare triple {35335#(and (= main_~z~0 0) (<= 49983 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {35336#(and (= main_~z~0 0) (<= 49982 main_~y~0))} is VALID [2022-04-28 03:47:47,636 INFO L290 TraceCheckUtils]: 29: Hoare triple {35336#(and (= main_~z~0 0) (<= 49982 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {35337#(and (<= 49981 main_~y~0) (= main_~z~0 0))} is VALID [2022-04-28 03:47:47,636 INFO L290 TraceCheckUtils]: 30: Hoare triple {35337#(and (<= 49981 main_~y~0) (= main_~z~0 0))} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {35338#(and (= main_~z~0 0) (<= 49980 main_~y~0))} is VALID [2022-04-28 03:47:47,636 INFO L290 TraceCheckUtils]: 31: Hoare triple {35338#(and (= main_~z~0 0) (<= 49980 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {35339#(and (= main_~z~0 0) (<= 49979 main_~y~0))} is VALID [2022-04-28 03:47:47,637 INFO L290 TraceCheckUtils]: 32: Hoare triple {35339#(and (= main_~z~0 0) (<= 49979 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {35340#(and (= main_~z~0 0) (<= 49978 main_~y~0))} is VALID [2022-04-28 03:47:47,637 INFO L290 TraceCheckUtils]: 33: Hoare triple {35340#(and (= main_~z~0 0) (<= 49978 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {35341#(and (= main_~z~0 0) (<= 49977 main_~y~0))} is VALID [2022-04-28 03:47:47,638 INFO L290 TraceCheckUtils]: 34: Hoare triple {35341#(and (= main_~z~0 0) (<= 49977 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {35342#(and (= main_~z~0 0) (<= 49976 main_~y~0))} is VALID [2022-04-28 03:47:47,638 INFO L290 TraceCheckUtils]: 35: Hoare triple {35342#(and (= main_~z~0 0) (<= 49976 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {35343#(and (= main_~z~0 0) (<= 49975 main_~y~0))} is VALID [2022-04-28 03:47:47,639 INFO L290 TraceCheckUtils]: 36: Hoare triple {35343#(and (= main_~z~0 0) (<= 49975 main_~y~0))} assume !(~y~0 > ~z~0); {35310#false} is VALID [2022-04-28 03:47:47,639 INFO L272 TraceCheckUtils]: 37: Hoare triple {35310#false} call __VERIFIER_assert((if ~x~0 == ~z~0 then 1 else 0)); {35310#false} is VALID [2022-04-28 03:47:47,639 INFO L290 TraceCheckUtils]: 38: Hoare triple {35310#false} ~cond := #in~cond; {35310#false} is VALID [2022-04-28 03:47:47,639 INFO L290 TraceCheckUtils]: 39: Hoare triple {35310#false} assume 0 == ~cond; {35310#false} is VALID [2022-04-28 03:47:47,639 INFO L290 TraceCheckUtils]: 40: Hoare triple {35310#false} assume !false; {35310#false} is VALID [2022-04-28 03:47:47,639 INFO L134 CoverageAnalysis]: Checked inductivity of 353 backedges. 0 proven. 353 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 03:47:47,639 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 03:47:47,640 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [88735265] [2022-04-28 03:47:47,640 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [88735265] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 03:47:47,640 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [483585677] [2022-04-28 03:47:47,640 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:47:47,640 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 03:47:47,640 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 03:47:47,642 INFO L229 MonitoredProcess]: Starting monitored process 34 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 03:47:47,642 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (34)] Waiting until timeout for monitored process [2022-04-28 03:47:47,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:47:47,694 INFO L263 TraceCheckSpWp]: Trace formula consists of 189 conjuncts, 30 conjunts are in the unsatisfiable core [2022-04-28 03:47:47,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:47:47,712 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 03:47:49,058 INFO L272 TraceCheckUtils]: 0: Hoare triple {35309#true} call ULTIMATE.init(); {35309#true} is VALID [2022-04-28 03:47:49,058 INFO L290 TraceCheckUtils]: 1: Hoare triple {35309#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(17, 2);call #Ultimate.allocInit(12, 3); {35309#true} is VALID [2022-04-28 03:47:49,058 INFO L290 TraceCheckUtils]: 2: Hoare triple {35309#true} assume true; {35309#true} is VALID [2022-04-28 03:47:49,058 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {35309#true} {35309#true} #52#return; {35309#true} is VALID [2022-04-28 03:47:49,058 INFO L272 TraceCheckUtils]: 4: Hoare triple {35309#true} call #t~ret9 := main(); {35309#true} is VALID [2022-04-28 03:47:49,059 INFO L290 TraceCheckUtils]: 5: Hoare triple {35309#true} ~x~0 := 0;~y~0 := 50000;~z~0 := 0;~x~0 := 0; {35363#(and (<= main_~z~0 0) (<= 50000 main_~y~0))} is VALID [2022-04-28 03:47:49,059 INFO L290 TraceCheckUtils]: 6: Hoare triple {35363#(and (<= main_~z~0 0) (<= 50000 main_~y~0))} [188] L11-2-->L18-1_primed: Formula: (let ((.cse0 (= |v_main_#t~post4_204| |v_main_#t~post4_203|)) (.cse1 (= v_main_~x~0_1672 v_main_~x~0_1671))) (or (and (< v_main_~x~0_1671 50001) (< v_main_~x~0_1672 v_main_~x~0_1671)) (and .cse0 (not (< v_main_~x~0_1672 50000)) .cse1) (and .cse0 .cse1))) InVars {main_~x~0=v_main_~x~0_1672, main_#t~post4=|v_main_#t~post4_204|} OutVars{main_~x~0=v_main_~x~0_1671, main_#t~post4=|v_main_#t~post4_203|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {35363#(and (<= main_~z~0 0) (<= 50000 main_~y~0))} is VALID [2022-04-28 03:47:49,059 INFO L290 TraceCheckUtils]: 7: Hoare triple {35363#(and (<= main_~z~0 0) (<= 50000 main_~y~0))} [189] L18-1_primed-->L11-2: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {35363#(and (<= main_~z~0 0) (<= 50000 main_~y~0))} is VALID [2022-04-28 03:47:49,060 INFO L290 TraceCheckUtils]: 8: Hoare triple {35363#(and (<= main_~z~0 0) (<= 50000 main_~y~0))} [190] L11-2-->L18-1_primed: Formula: (let ((.cse0 (= |v_main_#t~post6_228| |v_main_#t~post6_227|)) (.cse1 (= v_main_~x~0_1674 v_main_~x~0_1673)) (.cse3 (= v_main_~y~0_1787 v_main_~y~0_1786)) (.cse4 (= |v_main_#t~post5_228| |v_main_#t~post5_227|)) (.cse2 (<= 50000 v_main_~x~0_1674))) (or (and .cse0 .cse1 (or (not (< v_main_~x~0_1674 1000000)) (not .cse2)) .cse3 .cse4) (and .cse0 .cse1 .cse3 .cse4) (let ((.cse5 (+ v_main_~x~0_1674 v_main_~y~0_1786))) (and (= .cse5 (+ v_main_~x~0_1673 v_main_~y~0_1787)) (< .cse5 (+ 1000001 v_main_~y~0_1787)) (< v_main_~y~0_1787 v_main_~y~0_1786) .cse2)))) InVars {main_~y~0=v_main_~y~0_1787, main_#t~post5=|v_main_#t~post5_228|, main_~x~0=v_main_~x~0_1674, main_#t~post6=|v_main_#t~post6_228|} OutVars{main_~y~0=v_main_~y~0_1786, main_#t~post5=|v_main_#t~post5_227|, main_~x~0=v_main_~x~0_1673, main_#t~post6=|v_main_#t~post6_227|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {35363#(and (<= main_~z~0 0) (<= 50000 main_~y~0))} is VALID [2022-04-28 03:47:49,060 INFO L290 TraceCheckUtils]: 9: Hoare triple {35363#(and (<= main_~z~0 0) (<= 50000 main_~y~0))} [187] L18-1_primed-->L18-1: Formula: (not (< v_main_~x~0_11 1000000)) InVars {main_~x~0=v_main_~x~0_11} OutVars{main_~x~0=v_main_~x~0_11} AuxVars[] AssignedVars[] {35363#(and (<= main_~z~0 0) (<= 50000 main_~y~0))} is VALID [2022-04-28 03:47:49,063 INFO L290 TraceCheckUtils]: 10: Hoare triple {35363#(and (<= main_~z~0 0) (<= 50000 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {35379#(and (<= main_~z~0 0) (<= 49999 main_~y~0))} is VALID [2022-04-28 03:47:49,064 INFO L290 TraceCheckUtils]: 11: Hoare triple {35379#(and (<= main_~z~0 0) (<= 49999 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {35383#(and (<= main_~z~0 0) (<= 49998 main_~y~0))} is VALID [2022-04-28 03:47:49,065 INFO L290 TraceCheckUtils]: 12: Hoare triple {35383#(and (<= main_~z~0 0) (<= 49998 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {35387#(and (<= main_~z~0 0) (<= 49997 main_~y~0))} is VALID [2022-04-28 03:47:49,065 INFO L290 TraceCheckUtils]: 13: Hoare triple {35387#(and (<= main_~z~0 0) (<= 49997 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {35391#(and (<= main_~z~0 0) (<= 49996 main_~y~0))} is VALID [2022-04-28 03:47:49,066 INFO L290 TraceCheckUtils]: 14: Hoare triple {35391#(and (<= main_~z~0 0) (<= 49996 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {35395#(and (<= main_~z~0 0) (<= 49995 main_~y~0))} is VALID [2022-04-28 03:47:49,067 INFO L290 TraceCheckUtils]: 15: Hoare triple {35395#(and (<= main_~z~0 0) (<= 49995 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {35399#(and (<= main_~z~0 0) (<= 49994 main_~y~0))} is VALID [2022-04-28 03:47:49,067 INFO L290 TraceCheckUtils]: 16: Hoare triple {35399#(and (<= main_~z~0 0) (<= 49994 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {35403#(and (<= main_~z~0 0) (<= 49993 main_~y~0))} is VALID [2022-04-28 03:47:49,068 INFO L290 TraceCheckUtils]: 17: Hoare triple {35403#(and (<= main_~z~0 0) (<= 49993 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {35407#(and (<= main_~z~0 0) (<= 49992 main_~y~0))} is VALID [2022-04-28 03:47:49,068 INFO L290 TraceCheckUtils]: 18: Hoare triple {35407#(and (<= main_~z~0 0) (<= 49992 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {35411#(and (<= main_~z~0 0) (<= 49991 main_~y~0))} is VALID [2022-04-28 03:47:49,069 INFO L290 TraceCheckUtils]: 19: Hoare triple {35411#(and (<= main_~z~0 0) (<= 49991 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {35415#(and (<= main_~z~0 0) (<= 49990 main_~y~0))} is VALID [2022-04-28 03:47:49,070 INFO L290 TraceCheckUtils]: 20: Hoare triple {35415#(and (<= main_~z~0 0) (<= 49990 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {35419#(and (<= main_~z~0 0) (<= 49989 main_~y~0))} is VALID [2022-04-28 03:47:49,070 INFO L290 TraceCheckUtils]: 21: Hoare triple {35419#(and (<= main_~z~0 0) (<= 49989 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {35423#(and (<= main_~z~0 0) (<= 49988 main_~y~0))} is VALID [2022-04-28 03:47:49,071 INFO L290 TraceCheckUtils]: 22: Hoare triple {35423#(and (<= main_~z~0 0) (<= 49988 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {35427#(and (<= main_~z~0 0) (<= 49987 main_~y~0))} is VALID [2022-04-28 03:47:49,072 INFO L290 TraceCheckUtils]: 23: Hoare triple {35427#(and (<= main_~z~0 0) (<= 49987 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {35431#(and (<= main_~z~0 0) (<= 49986 main_~y~0))} is VALID [2022-04-28 03:47:49,072 INFO L290 TraceCheckUtils]: 24: Hoare triple {35431#(and (<= main_~z~0 0) (<= 49986 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {35435#(and (<= main_~z~0 0) (<= 49985 main_~y~0))} is VALID [2022-04-28 03:47:49,073 INFO L290 TraceCheckUtils]: 25: Hoare triple {35435#(and (<= main_~z~0 0) (<= 49985 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {35439#(and (<= main_~z~0 0) (<= 49984 main_~y~0))} is VALID [2022-04-28 03:47:49,073 INFO L290 TraceCheckUtils]: 26: Hoare triple {35439#(and (<= main_~z~0 0) (<= 49984 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {35443#(and (<= main_~z~0 0) (<= 49983 main_~y~0))} is VALID [2022-04-28 03:47:49,074 INFO L290 TraceCheckUtils]: 27: Hoare triple {35443#(and (<= main_~z~0 0) (<= 49983 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {35447#(and (<= main_~z~0 0) (<= 49982 main_~y~0))} is VALID [2022-04-28 03:47:49,075 INFO L290 TraceCheckUtils]: 28: Hoare triple {35447#(and (<= main_~z~0 0) (<= 49982 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {35451#(and (<= main_~z~0 0) (<= 49981 main_~y~0))} is VALID [2022-04-28 03:47:49,075 INFO L290 TraceCheckUtils]: 29: Hoare triple {35451#(and (<= main_~z~0 0) (<= 49981 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {35455#(and (<= main_~z~0 0) (<= 49980 main_~y~0))} is VALID [2022-04-28 03:47:49,076 INFO L290 TraceCheckUtils]: 30: Hoare triple {35455#(and (<= main_~z~0 0) (<= 49980 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {35459#(and (<= main_~z~0 0) (<= 49979 main_~y~0))} is VALID [2022-04-28 03:47:49,076 INFO L290 TraceCheckUtils]: 31: Hoare triple {35459#(and (<= main_~z~0 0) (<= 49979 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {35463#(and (<= main_~z~0 0) (<= 49978 main_~y~0))} is VALID [2022-04-28 03:47:49,077 INFO L290 TraceCheckUtils]: 32: Hoare triple {35463#(and (<= main_~z~0 0) (<= 49978 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {35467#(and (<= main_~z~0 0) (<= 49977 main_~y~0))} is VALID [2022-04-28 03:47:49,078 INFO L290 TraceCheckUtils]: 33: Hoare triple {35467#(and (<= main_~z~0 0) (<= 49977 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {35471#(and (<= main_~z~0 0) (<= 49976 main_~y~0))} is VALID [2022-04-28 03:47:49,078 INFO L290 TraceCheckUtils]: 34: Hoare triple {35471#(and (<= main_~z~0 0) (<= 49976 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {35475#(and (<= main_~z~0 0) (<= 49975 main_~y~0))} is VALID [2022-04-28 03:47:49,079 INFO L290 TraceCheckUtils]: 35: Hoare triple {35475#(and (<= main_~z~0 0) (<= 49975 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {35479#(and (<= main_~z~0 0) (<= 49974 main_~y~0))} is VALID [2022-04-28 03:47:49,079 INFO L290 TraceCheckUtils]: 36: Hoare triple {35479#(and (<= main_~z~0 0) (<= 49974 main_~y~0))} assume !(~y~0 > ~z~0); {35310#false} is VALID [2022-04-28 03:47:49,080 INFO L272 TraceCheckUtils]: 37: Hoare triple {35310#false} call __VERIFIER_assert((if ~x~0 == ~z~0 then 1 else 0)); {35310#false} is VALID [2022-04-28 03:47:49,080 INFO L290 TraceCheckUtils]: 38: Hoare triple {35310#false} ~cond := #in~cond; {35310#false} is VALID [2022-04-28 03:47:49,080 INFO L290 TraceCheckUtils]: 39: Hoare triple {35310#false} assume 0 == ~cond; {35310#false} is VALID [2022-04-28 03:47:49,080 INFO L290 TraceCheckUtils]: 40: Hoare triple {35310#false} assume !false; {35310#false} is VALID [2022-04-28 03:47:49,080 INFO L134 CoverageAnalysis]: Checked inductivity of 353 backedges. 0 proven. 351 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-04-28 03:47:49,080 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 03:47:50,983 INFO L290 TraceCheckUtils]: 40: Hoare triple {35310#false} assume !false; {35310#false} is VALID [2022-04-28 03:47:50,984 INFO L290 TraceCheckUtils]: 39: Hoare triple {35310#false} assume 0 == ~cond; {35310#false} is VALID [2022-04-28 03:47:50,984 INFO L290 TraceCheckUtils]: 38: Hoare triple {35310#false} ~cond := #in~cond; {35310#false} is VALID [2022-04-28 03:47:50,984 INFO L272 TraceCheckUtils]: 37: Hoare triple {35310#false} call __VERIFIER_assert((if ~x~0 == ~z~0 then 1 else 0)); {35310#false} is VALID [2022-04-28 03:47:50,984 INFO L290 TraceCheckUtils]: 36: Hoare triple {35507#(< main_~z~0 main_~y~0)} assume !(~y~0 > ~z~0); {35310#false} is VALID [2022-04-28 03:47:50,984 INFO L290 TraceCheckUtils]: 35: Hoare triple {35511#(< (+ main_~z~0 1) main_~y~0)} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {35507#(< main_~z~0 main_~y~0)} is VALID [2022-04-28 03:47:50,985 INFO L290 TraceCheckUtils]: 34: Hoare triple {35515#(< (+ main_~z~0 2) main_~y~0)} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {35511#(< (+ main_~z~0 1) main_~y~0)} is VALID [2022-04-28 03:47:50,985 INFO L290 TraceCheckUtils]: 33: Hoare triple {35519#(< (+ main_~z~0 3) main_~y~0)} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {35515#(< (+ main_~z~0 2) main_~y~0)} is VALID [2022-04-28 03:47:50,986 INFO L290 TraceCheckUtils]: 32: Hoare triple {35523#(< (+ main_~z~0 4) main_~y~0)} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {35519#(< (+ main_~z~0 3) main_~y~0)} is VALID [2022-04-28 03:47:50,986 INFO L290 TraceCheckUtils]: 31: Hoare triple {35527#(< (+ 5 main_~z~0) main_~y~0)} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {35523#(< (+ main_~z~0 4) main_~y~0)} is VALID [2022-04-28 03:47:50,987 INFO L290 TraceCheckUtils]: 30: Hoare triple {35531#(< (+ main_~z~0 6) main_~y~0)} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {35527#(< (+ 5 main_~z~0) main_~y~0)} is VALID [2022-04-28 03:47:50,987 INFO L290 TraceCheckUtils]: 29: Hoare triple {35535#(< (+ 7 main_~z~0) main_~y~0)} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {35531#(< (+ main_~z~0 6) main_~y~0)} is VALID [2022-04-28 03:47:50,988 INFO L290 TraceCheckUtils]: 28: Hoare triple {35539#(< (+ main_~z~0 8) main_~y~0)} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {35535#(< (+ 7 main_~z~0) main_~y~0)} is VALID [2022-04-28 03:47:50,988 INFO L290 TraceCheckUtils]: 27: Hoare triple {35543#(< (+ main_~z~0 9) main_~y~0)} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {35539#(< (+ main_~z~0 8) main_~y~0)} is VALID [2022-04-28 03:47:50,988 INFO L290 TraceCheckUtils]: 26: Hoare triple {35547#(< (+ main_~z~0 10) main_~y~0)} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {35543#(< (+ main_~z~0 9) main_~y~0)} is VALID [2022-04-28 03:47:50,989 INFO L290 TraceCheckUtils]: 25: Hoare triple {35551#(< (+ main_~z~0 11) main_~y~0)} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {35547#(< (+ main_~z~0 10) main_~y~0)} is VALID [2022-04-28 03:47:50,989 INFO L290 TraceCheckUtils]: 24: Hoare triple {35555#(< (+ main_~z~0 12) main_~y~0)} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {35551#(< (+ main_~z~0 11) main_~y~0)} is VALID [2022-04-28 03:47:50,990 INFO L290 TraceCheckUtils]: 23: Hoare triple {35559#(< (+ main_~z~0 13) main_~y~0)} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {35555#(< (+ main_~z~0 12) main_~y~0)} is VALID [2022-04-28 03:47:50,990 INFO L290 TraceCheckUtils]: 22: Hoare triple {35563#(< (+ main_~z~0 14) main_~y~0)} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {35559#(< (+ main_~z~0 13) main_~y~0)} is VALID [2022-04-28 03:47:50,991 INFO L290 TraceCheckUtils]: 21: Hoare triple {35567#(< (+ main_~z~0 15) main_~y~0)} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {35563#(< (+ main_~z~0 14) main_~y~0)} is VALID [2022-04-28 03:47:50,991 INFO L290 TraceCheckUtils]: 20: Hoare triple {35571#(< (+ main_~z~0 16) main_~y~0)} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {35567#(< (+ main_~z~0 15) main_~y~0)} is VALID [2022-04-28 03:47:50,992 INFO L290 TraceCheckUtils]: 19: Hoare triple {35575#(< (+ main_~z~0 17) main_~y~0)} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {35571#(< (+ main_~z~0 16) main_~y~0)} is VALID [2022-04-28 03:47:50,992 INFO L290 TraceCheckUtils]: 18: Hoare triple {35579#(< (+ main_~z~0 18) main_~y~0)} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {35575#(< (+ main_~z~0 17) main_~y~0)} is VALID [2022-04-28 03:47:50,993 INFO L290 TraceCheckUtils]: 17: Hoare triple {35583#(< (+ 19 main_~z~0) main_~y~0)} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {35579#(< (+ main_~z~0 18) main_~y~0)} is VALID [2022-04-28 03:47:50,993 INFO L290 TraceCheckUtils]: 16: Hoare triple {35587#(< (+ main_~z~0 20) main_~y~0)} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {35583#(< (+ 19 main_~z~0) main_~y~0)} is VALID [2022-04-28 03:47:50,994 INFO L290 TraceCheckUtils]: 15: Hoare triple {35591#(< (+ main_~z~0 21) main_~y~0)} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {35587#(< (+ main_~z~0 20) main_~y~0)} is VALID [2022-04-28 03:47:50,994 INFO L290 TraceCheckUtils]: 14: Hoare triple {35595#(< (+ main_~z~0 22) main_~y~0)} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {35591#(< (+ main_~z~0 21) main_~y~0)} is VALID [2022-04-28 03:47:50,994 INFO L290 TraceCheckUtils]: 13: Hoare triple {35599#(< (+ 23 main_~z~0) main_~y~0)} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {35595#(< (+ main_~z~0 22) main_~y~0)} is VALID [2022-04-28 03:47:50,995 INFO L290 TraceCheckUtils]: 12: Hoare triple {35603#(< (+ main_~z~0 24) main_~y~0)} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {35599#(< (+ 23 main_~z~0) main_~y~0)} is VALID [2022-04-28 03:47:50,995 INFO L290 TraceCheckUtils]: 11: Hoare triple {35607#(< (+ main_~z~0 25) main_~y~0)} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {35603#(< (+ main_~z~0 24) main_~y~0)} is VALID [2022-04-28 03:47:50,996 INFO L290 TraceCheckUtils]: 10: Hoare triple {35611#(< (+ main_~z~0 26) main_~y~0)} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {35607#(< (+ main_~z~0 25) main_~y~0)} is VALID [2022-04-28 03:47:50,996 INFO L290 TraceCheckUtils]: 9: Hoare triple {35611#(< (+ main_~z~0 26) main_~y~0)} [187] L18-1_primed-->L18-1: Formula: (not (< v_main_~x~0_11 1000000)) InVars {main_~x~0=v_main_~x~0_11} OutVars{main_~x~0=v_main_~x~0_11} AuxVars[] AssignedVars[] {35611#(< (+ main_~z~0 26) main_~y~0)} is VALID [2022-04-28 03:47:50,997 INFO L290 TraceCheckUtils]: 8: Hoare triple {35611#(< (+ main_~z~0 26) main_~y~0)} [190] L11-2-->L18-1_primed: Formula: (let ((.cse0 (= |v_main_#t~post6_228| |v_main_#t~post6_227|)) (.cse1 (= v_main_~x~0_1674 v_main_~x~0_1673)) (.cse3 (= v_main_~y~0_1787 v_main_~y~0_1786)) (.cse4 (= |v_main_#t~post5_228| |v_main_#t~post5_227|)) (.cse2 (<= 50000 v_main_~x~0_1674))) (or (and .cse0 .cse1 (or (not (< v_main_~x~0_1674 1000000)) (not .cse2)) .cse3 .cse4) (and .cse0 .cse1 .cse3 .cse4) (let ((.cse5 (+ v_main_~x~0_1674 v_main_~y~0_1786))) (and (= .cse5 (+ v_main_~x~0_1673 v_main_~y~0_1787)) (< .cse5 (+ 1000001 v_main_~y~0_1787)) (< v_main_~y~0_1787 v_main_~y~0_1786) .cse2)))) InVars {main_~y~0=v_main_~y~0_1787, main_#t~post5=|v_main_#t~post5_228|, main_~x~0=v_main_~x~0_1674, main_#t~post6=|v_main_#t~post6_228|} OutVars{main_~y~0=v_main_~y~0_1786, main_#t~post5=|v_main_#t~post5_227|, main_~x~0=v_main_~x~0_1673, main_#t~post6=|v_main_#t~post6_227|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {35611#(< (+ main_~z~0 26) main_~y~0)} is VALID [2022-04-28 03:47:50,997 INFO L290 TraceCheckUtils]: 7: Hoare triple {35611#(< (+ main_~z~0 26) main_~y~0)} [189] L18-1_primed-->L11-2: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {35611#(< (+ main_~z~0 26) main_~y~0)} is VALID [2022-04-28 03:47:50,998 INFO L290 TraceCheckUtils]: 6: Hoare triple {35611#(< (+ main_~z~0 26) main_~y~0)} [188] L11-2-->L18-1_primed: Formula: (let ((.cse0 (= |v_main_#t~post4_204| |v_main_#t~post4_203|)) (.cse1 (= v_main_~x~0_1672 v_main_~x~0_1671))) (or (and (< v_main_~x~0_1671 50001) (< v_main_~x~0_1672 v_main_~x~0_1671)) (and .cse0 (not (< v_main_~x~0_1672 50000)) .cse1) (and .cse0 .cse1))) InVars {main_~x~0=v_main_~x~0_1672, main_#t~post4=|v_main_#t~post4_204|} OutVars{main_~x~0=v_main_~x~0_1671, main_#t~post4=|v_main_#t~post4_203|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {35611#(< (+ main_~z~0 26) main_~y~0)} is VALID [2022-04-28 03:47:50,998 INFO L290 TraceCheckUtils]: 5: Hoare triple {35309#true} ~x~0 := 0;~y~0 := 50000;~z~0 := 0;~x~0 := 0; {35611#(< (+ main_~z~0 26) main_~y~0)} is VALID [2022-04-28 03:47:50,998 INFO L272 TraceCheckUtils]: 4: Hoare triple {35309#true} call #t~ret9 := main(); {35309#true} is VALID [2022-04-28 03:47:50,998 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {35309#true} {35309#true} #52#return; {35309#true} is VALID [2022-04-28 03:47:50,998 INFO L290 TraceCheckUtils]: 2: Hoare triple {35309#true} assume true; {35309#true} is VALID [2022-04-28 03:47:50,998 INFO L290 TraceCheckUtils]: 1: Hoare triple {35309#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(17, 2);call #Ultimate.allocInit(12, 3); {35309#true} is VALID [2022-04-28 03:47:50,998 INFO L272 TraceCheckUtils]: 0: Hoare triple {35309#true} call ULTIMATE.init(); {35309#true} is VALID [2022-04-28 03:47:50,999 INFO L134 CoverageAnalysis]: Checked inductivity of 353 backedges. 0 proven. 351 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-04-28 03:47:50,999 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [483585677] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 03:47:50,999 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 03:47:50,999 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [33, 29, 29] total 87 [2022-04-28 03:47:53,033 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 03:47:53,033 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [2114657540] [2022-04-28 03:47:53,034 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [2114657540] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 03:47:53,034 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 03:47:53,034 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [77] imperfect sequences [] total 77 [2022-04-28 03:47:53,034 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [35329254] [2022-04-28 03:47:53,034 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 03:47:53,034 INFO L78 Accepts]: Start accepts. Automaton has has 77 states, 77 states have (on average 1.6363636363636365) internal successors, (126), 76 states have internal predecessors, (126), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 130 [2022-04-28 03:47:53,034 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 03:47:53,034 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 77 states, 77 states have (on average 1.6363636363636365) internal successors, (126), 76 states have internal predecessors, (126), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:47:53,132 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 130 edges. 130 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 03:47:53,133 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 77 states [2022-04-28 03:47:53,133 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 03:47:53,133 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 77 interpolants. [2022-04-28 03:47:53,134 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7200, Invalid=10622, Unknown=0, NotChecked=0, Total=17822 [2022-04-28 03:47:53,134 INFO L87 Difference]: Start difference. First operand 215 states and 219 transitions. Second operand has 77 states, 77 states have (on average 1.6363636363636365) internal successors, (126), 76 states have internal predecessors, (126), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:48:03,089 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:48:03,090 INFO L93 Difference]: Finished difference Result 335 states and 345 transitions. [2022-04-28 03:48:03,090 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 77 states. [2022-04-28 03:48:03,090 INFO L78 Accepts]: Start accepts. Automaton has has 77 states, 77 states have (on average 1.6363636363636365) internal successors, (126), 76 states have internal predecessors, (126), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 130 [2022-04-28 03:48:03,090 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 03:48:03,090 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 77 states, 77 states have (on average 1.6363636363636365) internal successors, (126), 76 states have internal predecessors, (126), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:48:03,091 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 151 transitions. [2022-04-28 03:48:03,091 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 77 states, 77 states have (on average 1.6363636363636365) internal successors, (126), 76 states have internal predecessors, (126), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:48:03,092 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 151 transitions. [2022-04-28 03:48:03,092 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 77 states and 151 transitions. [2022-04-28 03:48:03,213 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 151 edges. 151 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 03:48:03,216 INFO L225 Difference]: With dead ends: 335 [2022-04-28 03:48:03,216 INFO L226 Difference]: Without dead ends: 218 [2022-04-28 03:48:03,219 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 287 GetRequests, 79 SyntacticMatches, 2 SemanticMatches, 206 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12480 ImplicationChecksByTransitivity, 6.6s TimeCoverageRelationStatistics Valid=14455, Invalid=28601, Unknown=0, NotChecked=0, Total=43056 [2022-04-28 03:48:03,219 INFO L413 NwaCegarLoop]: 13 mSDtfsCounter, 200 mSDsluCounter, 42 mSDsCounter, 0 mSdLazyCounter, 4606 mSolverCounterSat, 226 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 200 SdHoareTripleChecker+Valid, 55 SdHoareTripleChecker+Invalid, 4832 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 226 IncrementalHoareTripleChecker+Valid, 4606 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.7s IncrementalHoareTripleChecker+Time [2022-04-28 03:48:03,219 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [200 Valid, 55 Invalid, 4832 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [226 Valid, 4606 Invalid, 0 Unknown, 0 Unchecked, 3.7s Time] [2022-04-28 03:48:03,219 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 218 states. [2022-04-28 03:48:03,681 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 218 to 218. [2022-04-28 03:48:03,681 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 03:48:03,682 INFO L82 GeneralOperation]: Start isEquivalent. First operand 218 states. Second operand has 218 states, 213 states have (on average 1.0234741784037558) internal successors, (218), 213 states have internal predecessors, (218), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:48:03,682 INFO L74 IsIncluded]: Start isIncluded. First operand 218 states. Second operand has 218 states, 213 states have (on average 1.0234741784037558) internal successors, (218), 213 states have internal predecessors, (218), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:48:03,682 INFO L87 Difference]: Start difference. First operand 218 states. Second operand has 218 states, 213 states have (on average 1.0234741784037558) internal successors, (218), 213 states have internal predecessors, (218), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:48:03,684 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:48:03,684 INFO L93 Difference]: Finished difference Result 218 states and 222 transitions. [2022-04-28 03:48:03,684 INFO L276 IsEmpty]: Start isEmpty. Operand 218 states and 222 transitions. [2022-04-28 03:48:03,684 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:48:03,684 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:48:03,684 INFO L74 IsIncluded]: Start isIncluded. First operand has 218 states, 213 states have (on average 1.0234741784037558) internal successors, (218), 213 states have internal predecessors, (218), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 218 states. [2022-04-28 03:48:03,684 INFO L87 Difference]: Start difference. First operand has 218 states, 213 states have (on average 1.0234741784037558) internal successors, (218), 213 states have internal predecessors, (218), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 218 states. [2022-04-28 03:48:03,686 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:48:03,686 INFO L93 Difference]: Finished difference Result 218 states and 222 transitions. [2022-04-28 03:48:03,687 INFO L276 IsEmpty]: Start isEmpty. Operand 218 states and 222 transitions. [2022-04-28 03:48:03,687 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:48:03,687 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:48:03,687 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 03:48:03,687 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 03:48:03,687 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 218 states, 213 states have (on average 1.0234741784037558) internal successors, (218), 213 states have internal predecessors, (218), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:48:03,689 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 218 states to 218 states and 222 transitions. [2022-04-28 03:48:03,689 INFO L78 Accepts]: Start accepts. Automaton has 218 states and 222 transitions. Word has length 130 [2022-04-28 03:48:03,689 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 03:48:03,689 INFO L495 AbstractCegarLoop]: Abstraction has 218 states and 222 transitions. [2022-04-28 03:48:03,690 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 77 states, 77 states have (on average 1.6363636363636365) internal successors, (126), 76 states have internal predecessors, (126), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:48:03,690 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 218 states and 222 transitions. [2022-04-28 03:48:03,897 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 222 edges. 222 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 03:48:03,897 INFO L276 IsEmpty]: Start isEmpty. Operand 218 states and 222 transitions. [2022-04-28 03:48:03,898 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2022-04-28 03:48:03,898 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 03:48:03,898 INFO L195 NwaCegarLoop]: trace histogram [47, 46, 27, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 03:48:03,914 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (34)] Forceful destruction successful, exit code 0 [2022-04-28 03:48:04,098 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 34 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable35 [2022-04-28 03:48:04,098 INFO L420 AbstractCegarLoop]: === Iteration 37 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 03:48:04,099 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 03:48:04,099 INFO L85 PathProgramCache]: Analyzing trace with hash 1124794915, now seen corresponding path program 34 times [2022-04-28 03:48:04,099 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 03:48:04,099 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [691118820] [2022-04-28 03:48:04,204 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 1 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 03:48:08,320 WARN L977 rdanLoopAcceleration]: Unable to prove correctness of quantifier elimination. [2022-04-28 03:48:08,420 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={1=1, 2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 03:48:08,421 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-28 03:48:08,423 INFO L85 PathProgramCache]: Analyzing trace with hash 760333794, now seen corresponding path program 1 times [2022-04-28 03:48:08,424 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 03:48:08,424 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [51370312] [2022-04-28 03:48:08,424 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:48:08,424 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 03:48:08,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:48:08,948 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 03:48:08,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:48:08,951 INFO L290 TraceCheckUtils]: 0: Hoare triple {37414#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(17, 2);call #Ultimate.allocInit(12, 3); {37381#true} is VALID [2022-04-28 03:48:08,951 INFO L290 TraceCheckUtils]: 1: Hoare triple {37381#true} assume true; {37381#true} is VALID [2022-04-28 03:48:08,951 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {37381#true} {37381#true} #52#return; {37381#true} is VALID [2022-04-28 03:48:08,951 INFO L272 TraceCheckUtils]: 0: Hoare triple {37381#true} call ULTIMATE.init(); {37414#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 03:48:08,951 INFO L290 TraceCheckUtils]: 1: Hoare triple {37414#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(17, 2);call #Ultimate.allocInit(12, 3); {37381#true} is VALID [2022-04-28 03:48:08,951 INFO L290 TraceCheckUtils]: 2: Hoare triple {37381#true} assume true; {37381#true} is VALID [2022-04-28 03:48:08,951 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {37381#true} {37381#true} #52#return; {37381#true} is VALID [2022-04-28 03:48:08,952 INFO L272 TraceCheckUtils]: 4: Hoare triple {37381#true} call #t~ret9 := main(); {37381#true} is VALID [2022-04-28 03:48:08,952 INFO L290 TraceCheckUtils]: 5: Hoare triple {37381#true} ~x~0 := 0;~y~0 := 50000;~z~0 := 0;~x~0 := 0; {37386#(and (= main_~z~0 0) (<= 50000 main_~y~0))} is VALID [2022-04-28 03:48:08,952 INFO L290 TraceCheckUtils]: 6: Hoare triple {37386#(and (= main_~z~0 0) (<= 50000 main_~y~0))} [192] L11-2-->L18-1_primed: Formula: (or (and (= |v_main_#t~post4_209| |v_main_#t~post4_210|) (<= 50000 v_main_~x~0_1760) (= v_main_~x~0_1759 v_main_~x~0_1760)) (and (< v_main_~x~0_1760 v_main_~x~0_1759) (< v_main_~x~0_1759 50001)) (and (= |v_main_#t~post4_210| |v_main_#t~post4_209|) (= v_main_~x~0_1760 v_main_~x~0_1759))) InVars {main_~x~0=v_main_~x~0_1760, main_#t~post4=|v_main_#t~post4_210|} OutVars{main_~x~0=v_main_~x~0_1759, main_#t~post4=|v_main_#t~post4_209|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {37386#(and (= main_~z~0 0) (<= 50000 main_~y~0))} is VALID [2022-04-28 03:48:08,953 INFO L290 TraceCheckUtils]: 7: Hoare triple {37386#(and (= main_~z~0 0) (<= 50000 main_~y~0))} [193] L18-1_primed-->L11-2: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {37386#(and (= main_~z~0 0) (<= 50000 main_~y~0))} is VALID [2022-04-28 03:48:08,953 INFO L290 TraceCheckUtils]: 8: Hoare triple {37386#(and (= main_~z~0 0) (<= 50000 main_~y~0))} [194] L11-2-->L18-1_primed: Formula: (let ((.cse3 (<= 50000 v_main_~x~0_1762)) (.cse0 (= v_main_~x~0_1762 v_main_~x~0_1761)) (.cse1 (= |v_main_#t~post5_235| |v_main_#t~post5_234|)) (.cse2 (= v_main_~y~0_1893 v_main_~y~0_1892)) (.cse4 (= |v_main_#t~post6_235| |v_main_#t~post6_234|))) (or (and .cse0 .cse1 .cse2 (or (not .cse3) (not (< v_main_~x~0_1762 1000000))) .cse4) (let ((.cse5 (+ v_main_~x~0_1762 v_main_~y~0_1892))) (and (< .cse5 (+ 1000001 v_main_~y~0_1893)) .cse3 (< v_main_~y~0_1893 v_main_~y~0_1892) (= .cse5 (+ v_main_~x~0_1761 v_main_~y~0_1893)))) (and .cse0 .cse1 .cse2 .cse4))) InVars {main_~y~0=v_main_~y~0_1893, main_#t~post5=|v_main_#t~post5_235|, main_~x~0=v_main_~x~0_1762, main_#t~post6=|v_main_#t~post6_235|} OutVars{main_~y~0=v_main_~y~0_1892, main_#t~post5=|v_main_#t~post5_234|, main_~x~0=v_main_~x~0_1761, main_#t~post6=|v_main_#t~post6_234|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {37386#(and (= main_~z~0 0) (<= 50000 main_~y~0))} is VALID [2022-04-28 03:48:08,954 INFO L290 TraceCheckUtils]: 9: Hoare triple {37386#(and (= main_~z~0 0) (<= 50000 main_~y~0))} [191] L18-1_primed-->L18-1: Formula: (not (< v_main_~x~0_11 1000000)) InVars {main_~x~0=v_main_~x~0_11} OutVars{main_~x~0=v_main_~x~0_11} AuxVars[] AssignedVars[] {37386#(and (= main_~z~0 0) (<= 50000 main_~y~0))} is VALID [2022-04-28 03:48:08,954 INFO L290 TraceCheckUtils]: 10: Hoare triple {37386#(and (= main_~z~0 0) (<= 50000 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {37387#(and (= main_~z~0 0) (<= 49999 main_~y~0))} is VALID [2022-04-28 03:48:08,955 INFO L290 TraceCheckUtils]: 11: Hoare triple {37387#(and (= main_~z~0 0) (<= 49999 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {37388#(and (<= 49998 main_~y~0) (= main_~z~0 0))} is VALID [2022-04-28 03:48:08,955 INFO L290 TraceCheckUtils]: 12: Hoare triple {37388#(and (<= 49998 main_~y~0) (= main_~z~0 0))} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {37389#(and (= main_~z~0 0) (<= 49997 main_~y~0))} is VALID [2022-04-28 03:48:08,956 INFO L290 TraceCheckUtils]: 13: Hoare triple {37389#(and (= main_~z~0 0) (<= 49997 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {37390#(and (= main_~z~0 0) (<= 49996 main_~y~0))} is VALID [2022-04-28 03:48:08,956 INFO L290 TraceCheckUtils]: 14: Hoare triple {37390#(and (= main_~z~0 0) (<= 49996 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {37391#(and (= main_~z~0 0) (<= 49995 main_~y~0))} is VALID [2022-04-28 03:48:08,957 INFO L290 TraceCheckUtils]: 15: Hoare triple {37391#(and (= main_~z~0 0) (<= 49995 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {37392#(and (= main_~z~0 0) (<= 49994 main_~y~0))} is VALID [2022-04-28 03:48:08,957 INFO L290 TraceCheckUtils]: 16: Hoare triple {37392#(and (= main_~z~0 0) (<= 49994 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {37393#(and (= main_~z~0 0) (<= 49993 main_~y~0))} is VALID [2022-04-28 03:48:08,958 INFO L290 TraceCheckUtils]: 17: Hoare triple {37393#(and (= main_~z~0 0) (<= 49993 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {37394#(and (= main_~z~0 0) (<= 49992 main_~y~0))} is VALID [2022-04-28 03:48:08,958 INFO L290 TraceCheckUtils]: 18: Hoare triple {37394#(and (= main_~z~0 0) (<= 49992 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {37395#(and (= main_~z~0 0) (<= 49991 main_~y~0))} is VALID [2022-04-28 03:48:08,958 INFO L290 TraceCheckUtils]: 19: Hoare triple {37395#(and (= main_~z~0 0) (<= 49991 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {37396#(and (<= 49990 main_~y~0) (= main_~z~0 0))} is VALID [2022-04-28 03:48:08,959 INFO L290 TraceCheckUtils]: 20: Hoare triple {37396#(and (<= 49990 main_~y~0) (= main_~z~0 0))} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {37397#(and (= main_~z~0 0) (<= 49989 main_~y~0))} is VALID [2022-04-28 03:48:08,959 INFO L290 TraceCheckUtils]: 21: Hoare triple {37397#(and (= main_~z~0 0) (<= 49989 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {37398#(and (= main_~z~0 0) (<= 49988 main_~y~0))} is VALID [2022-04-28 03:48:08,960 INFO L290 TraceCheckUtils]: 22: Hoare triple {37398#(and (= main_~z~0 0) (<= 49988 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {37399#(and (= main_~z~0 0) (<= 49987 main_~y~0))} is VALID [2022-04-28 03:48:08,960 INFO L290 TraceCheckUtils]: 23: Hoare triple {37399#(and (= main_~z~0 0) (<= 49987 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {37400#(and (= main_~z~0 0) (<= 49986 main_~y~0))} is VALID [2022-04-28 03:48:08,961 INFO L290 TraceCheckUtils]: 24: Hoare triple {37400#(and (= main_~z~0 0) (<= 49986 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {37401#(and (= main_~z~0 0) (<= 49985 main_~y~0))} is VALID [2022-04-28 03:48:08,961 INFO L290 TraceCheckUtils]: 25: Hoare triple {37401#(and (= main_~z~0 0) (<= 49985 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {37402#(and (= main_~z~0 0) (<= 49984 main_~y~0))} is VALID [2022-04-28 03:48:08,962 INFO L290 TraceCheckUtils]: 26: Hoare triple {37402#(and (= main_~z~0 0) (<= 49984 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {37403#(and (= main_~z~0 0) (<= 49983 main_~y~0))} is VALID [2022-04-28 03:48:08,962 INFO L290 TraceCheckUtils]: 27: Hoare triple {37403#(and (= main_~z~0 0) (<= 49983 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {37404#(and (= main_~z~0 0) (<= 49982 main_~y~0))} is VALID [2022-04-28 03:48:08,963 INFO L290 TraceCheckUtils]: 28: Hoare triple {37404#(and (= main_~z~0 0) (<= 49982 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {37405#(and (<= 49981 main_~y~0) (= main_~z~0 0))} is VALID [2022-04-28 03:48:08,963 INFO L290 TraceCheckUtils]: 29: Hoare triple {37405#(and (<= 49981 main_~y~0) (= main_~z~0 0))} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {37406#(and (= main_~z~0 0) (<= 49980 main_~y~0))} is VALID [2022-04-28 03:48:08,964 INFO L290 TraceCheckUtils]: 30: Hoare triple {37406#(and (= main_~z~0 0) (<= 49980 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {37407#(and (= main_~z~0 0) (<= 49979 main_~y~0))} is VALID [2022-04-28 03:48:08,964 INFO L290 TraceCheckUtils]: 31: Hoare triple {37407#(and (= main_~z~0 0) (<= 49979 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {37408#(and (= main_~z~0 0) (<= 49978 main_~y~0))} is VALID [2022-04-28 03:48:08,964 INFO L290 TraceCheckUtils]: 32: Hoare triple {37408#(and (= main_~z~0 0) (<= 49978 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {37409#(and (= main_~z~0 0) (<= 49977 main_~y~0))} is VALID [2022-04-28 03:48:08,965 INFO L290 TraceCheckUtils]: 33: Hoare triple {37409#(and (= main_~z~0 0) (<= 49977 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {37410#(and (= main_~z~0 0) (<= 49976 main_~y~0))} is VALID [2022-04-28 03:48:08,965 INFO L290 TraceCheckUtils]: 34: Hoare triple {37410#(and (= main_~z~0 0) (<= 49976 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {37411#(and (= main_~z~0 0) (<= 49975 main_~y~0))} is VALID [2022-04-28 03:48:08,966 INFO L290 TraceCheckUtils]: 35: Hoare triple {37411#(and (= main_~z~0 0) (<= 49975 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {37412#(and (= main_~z~0 0) (<= 49974 main_~y~0))} is VALID [2022-04-28 03:48:08,966 INFO L290 TraceCheckUtils]: 36: Hoare triple {37412#(and (= main_~z~0 0) (<= 49974 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {37413#(and (= main_~z~0 0) (<= 49973 main_~y~0))} is VALID [2022-04-28 03:48:08,967 INFO L290 TraceCheckUtils]: 37: Hoare triple {37413#(and (= main_~z~0 0) (<= 49973 main_~y~0))} assume !(~y~0 > ~z~0); {37382#false} is VALID [2022-04-28 03:48:08,967 INFO L272 TraceCheckUtils]: 38: Hoare triple {37382#false} call __VERIFIER_assert((if ~x~0 == ~z~0 then 1 else 0)); {37382#false} is VALID [2022-04-28 03:48:08,967 INFO L290 TraceCheckUtils]: 39: Hoare triple {37382#false} ~cond := #in~cond; {37382#false} is VALID [2022-04-28 03:48:08,967 INFO L290 TraceCheckUtils]: 40: Hoare triple {37382#false} assume 0 == ~cond; {37382#false} is VALID [2022-04-28 03:48:08,967 INFO L290 TraceCheckUtils]: 41: Hoare triple {37382#false} assume !false; {37382#false} is VALID [2022-04-28 03:48:08,967 INFO L134 CoverageAnalysis]: Checked inductivity of 380 backedges. 0 proven. 378 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-04-28 03:48:08,967 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 03:48:08,967 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [51370312] [2022-04-28 03:48:08,967 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [51370312] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 03:48:08,967 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1854432542] [2022-04-28 03:48:08,967 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:48:08,968 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 03:48:08,968 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 03:48:08,968 INFO L229 MonitoredProcess]: Starting monitored process 35 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 03:48:08,969 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (35)] Waiting until timeout for monitored process [2022-04-28 03:48:09,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:48:09,018 INFO L263 TraceCheckSpWp]: Trace formula consists of 194 conjuncts, 31 conjunts are in the unsatisfiable core [2022-04-28 03:48:09,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:48:09,037 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 03:48:10,406 INFO L272 TraceCheckUtils]: 0: Hoare triple {37381#true} call ULTIMATE.init(); {37381#true} is VALID [2022-04-28 03:48:10,406 INFO L290 TraceCheckUtils]: 1: Hoare triple {37381#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(17, 2);call #Ultimate.allocInit(12, 3); {37381#true} is VALID [2022-04-28 03:48:10,406 INFO L290 TraceCheckUtils]: 2: Hoare triple {37381#true} assume true; {37381#true} is VALID [2022-04-28 03:48:10,406 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {37381#true} {37381#true} #52#return; {37381#true} is VALID [2022-04-28 03:48:10,406 INFO L272 TraceCheckUtils]: 4: Hoare triple {37381#true} call #t~ret9 := main(); {37381#true} is VALID [2022-04-28 03:48:10,407 INFO L290 TraceCheckUtils]: 5: Hoare triple {37381#true} ~x~0 := 0;~y~0 := 50000;~z~0 := 0;~x~0 := 0; {37433#(and (<= main_~z~0 0) (<= 50000 main_~y~0))} is VALID [2022-04-28 03:48:10,407 INFO L290 TraceCheckUtils]: 6: Hoare triple {37433#(and (<= main_~z~0 0) (<= 50000 main_~y~0))} [192] L11-2-->L18-1_primed: Formula: (or (and (= |v_main_#t~post4_209| |v_main_#t~post4_210|) (<= 50000 v_main_~x~0_1760) (= v_main_~x~0_1759 v_main_~x~0_1760)) (and (< v_main_~x~0_1760 v_main_~x~0_1759) (< v_main_~x~0_1759 50001)) (and (= |v_main_#t~post4_210| |v_main_#t~post4_209|) (= v_main_~x~0_1760 v_main_~x~0_1759))) InVars {main_~x~0=v_main_~x~0_1760, main_#t~post4=|v_main_#t~post4_210|} OutVars{main_~x~0=v_main_~x~0_1759, main_#t~post4=|v_main_#t~post4_209|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {37433#(and (<= main_~z~0 0) (<= 50000 main_~y~0))} is VALID [2022-04-28 03:48:10,407 INFO L290 TraceCheckUtils]: 7: Hoare triple {37433#(and (<= main_~z~0 0) (<= 50000 main_~y~0))} [193] L18-1_primed-->L11-2: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {37433#(and (<= main_~z~0 0) (<= 50000 main_~y~0))} is VALID [2022-04-28 03:48:10,408 INFO L290 TraceCheckUtils]: 8: Hoare triple {37433#(and (<= main_~z~0 0) (<= 50000 main_~y~0))} [194] L11-2-->L18-1_primed: Formula: (let ((.cse3 (<= 50000 v_main_~x~0_1762)) (.cse0 (= v_main_~x~0_1762 v_main_~x~0_1761)) (.cse1 (= |v_main_#t~post5_235| |v_main_#t~post5_234|)) (.cse2 (= v_main_~y~0_1893 v_main_~y~0_1892)) (.cse4 (= |v_main_#t~post6_235| |v_main_#t~post6_234|))) (or (and .cse0 .cse1 .cse2 (or (not .cse3) (not (< v_main_~x~0_1762 1000000))) .cse4) (let ((.cse5 (+ v_main_~x~0_1762 v_main_~y~0_1892))) (and (< .cse5 (+ 1000001 v_main_~y~0_1893)) .cse3 (< v_main_~y~0_1893 v_main_~y~0_1892) (= .cse5 (+ v_main_~x~0_1761 v_main_~y~0_1893)))) (and .cse0 .cse1 .cse2 .cse4))) InVars {main_~y~0=v_main_~y~0_1893, main_#t~post5=|v_main_#t~post5_235|, main_~x~0=v_main_~x~0_1762, main_#t~post6=|v_main_#t~post6_235|} OutVars{main_~y~0=v_main_~y~0_1892, main_#t~post5=|v_main_#t~post5_234|, main_~x~0=v_main_~x~0_1761, main_#t~post6=|v_main_#t~post6_234|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {37433#(and (<= main_~z~0 0) (<= 50000 main_~y~0))} is VALID [2022-04-28 03:48:10,409 INFO L290 TraceCheckUtils]: 9: Hoare triple {37433#(and (<= main_~z~0 0) (<= 50000 main_~y~0))} [191] L18-1_primed-->L18-1: Formula: (not (< v_main_~x~0_11 1000000)) InVars {main_~x~0=v_main_~x~0_11} OutVars{main_~x~0=v_main_~x~0_11} AuxVars[] AssignedVars[] {37433#(and (<= main_~z~0 0) (<= 50000 main_~y~0))} is VALID [2022-04-28 03:48:10,409 INFO L290 TraceCheckUtils]: 10: Hoare triple {37433#(and (<= main_~z~0 0) (<= 50000 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {37449#(and (<= main_~z~0 0) (<= 49999 main_~y~0))} is VALID [2022-04-28 03:48:10,410 INFO L290 TraceCheckUtils]: 11: Hoare triple {37449#(and (<= main_~z~0 0) (<= 49999 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {37453#(and (<= main_~z~0 0) (<= 49998 main_~y~0))} is VALID [2022-04-28 03:48:10,410 INFO L290 TraceCheckUtils]: 12: Hoare triple {37453#(and (<= main_~z~0 0) (<= 49998 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {37457#(and (<= main_~z~0 0) (<= 49997 main_~y~0))} is VALID [2022-04-28 03:48:10,410 INFO L290 TraceCheckUtils]: 13: Hoare triple {37457#(and (<= main_~z~0 0) (<= 49997 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {37461#(and (<= main_~z~0 0) (<= 49996 main_~y~0))} is VALID [2022-04-28 03:48:10,411 INFO L290 TraceCheckUtils]: 14: Hoare triple {37461#(and (<= main_~z~0 0) (<= 49996 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {37465#(and (<= main_~z~0 0) (<= 49995 main_~y~0))} is VALID [2022-04-28 03:48:10,411 INFO L290 TraceCheckUtils]: 15: Hoare triple {37465#(and (<= main_~z~0 0) (<= 49995 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {37469#(and (<= main_~z~0 0) (<= 49994 main_~y~0))} is VALID [2022-04-28 03:48:10,412 INFO L290 TraceCheckUtils]: 16: Hoare triple {37469#(and (<= main_~z~0 0) (<= 49994 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {37473#(and (<= main_~z~0 0) (<= 49993 main_~y~0))} is VALID [2022-04-28 03:48:10,412 INFO L290 TraceCheckUtils]: 17: Hoare triple {37473#(and (<= main_~z~0 0) (<= 49993 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {37477#(and (<= main_~z~0 0) (<= 49992 main_~y~0))} is VALID [2022-04-28 03:48:10,413 INFO L290 TraceCheckUtils]: 18: Hoare triple {37477#(and (<= main_~z~0 0) (<= 49992 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {37481#(and (<= main_~z~0 0) (<= 49991 main_~y~0))} is VALID [2022-04-28 03:48:10,413 INFO L290 TraceCheckUtils]: 19: Hoare triple {37481#(and (<= main_~z~0 0) (<= 49991 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {37485#(and (<= main_~z~0 0) (<= 49990 main_~y~0))} is VALID [2022-04-28 03:48:10,414 INFO L290 TraceCheckUtils]: 20: Hoare triple {37485#(and (<= main_~z~0 0) (<= 49990 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {37489#(and (<= main_~z~0 0) (<= 49989 main_~y~0))} is VALID [2022-04-28 03:48:10,414 INFO L290 TraceCheckUtils]: 21: Hoare triple {37489#(and (<= main_~z~0 0) (<= 49989 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {37493#(and (<= main_~z~0 0) (<= 49988 main_~y~0))} is VALID [2022-04-28 03:48:10,415 INFO L290 TraceCheckUtils]: 22: Hoare triple {37493#(and (<= main_~z~0 0) (<= 49988 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {37497#(and (<= main_~z~0 0) (<= 49987 main_~y~0))} is VALID [2022-04-28 03:48:10,415 INFO L290 TraceCheckUtils]: 23: Hoare triple {37497#(and (<= main_~z~0 0) (<= 49987 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {37501#(and (<= main_~z~0 0) (<= 49986 main_~y~0))} is VALID [2022-04-28 03:48:10,416 INFO L290 TraceCheckUtils]: 24: Hoare triple {37501#(and (<= main_~z~0 0) (<= 49986 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {37505#(and (<= main_~z~0 0) (<= 49985 main_~y~0))} is VALID [2022-04-28 03:48:10,416 INFO L290 TraceCheckUtils]: 25: Hoare triple {37505#(and (<= main_~z~0 0) (<= 49985 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {37509#(and (<= main_~z~0 0) (<= 49984 main_~y~0))} is VALID [2022-04-28 03:48:10,417 INFO L290 TraceCheckUtils]: 26: Hoare triple {37509#(and (<= main_~z~0 0) (<= 49984 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {37513#(and (<= main_~z~0 0) (<= 49983 main_~y~0))} is VALID [2022-04-28 03:48:10,417 INFO L290 TraceCheckUtils]: 27: Hoare triple {37513#(and (<= main_~z~0 0) (<= 49983 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {37517#(and (<= main_~z~0 0) (<= 49982 main_~y~0))} is VALID [2022-04-28 03:48:10,418 INFO L290 TraceCheckUtils]: 28: Hoare triple {37517#(and (<= main_~z~0 0) (<= 49982 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {37521#(and (<= main_~z~0 0) (<= 49981 main_~y~0))} is VALID [2022-04-28 03:48:10,418 INFO L290 TraceCheckUtils]: 29: Hoare triple {37521#(and (<= main_~z~0 0) (<= 49981 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {37525#(and (<= main_~z~0 0) (<= 49980 main_~y~0))} is VALID [2022-04-28 03:48:10,419 INFO L290 TraceCheckUtils]: 30: Hoare triple {37525#(and (<= main_~z~0 0) (<= 49980 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {37529#(and (<= main_~z~0 0) (<= 49979 main_~y~0))} is VALID [2022-04-28 03:48:10,419 INFO L290 TraceCheckUtils]: 31: Hoare triple {37529#(and (<= main_~z~0 0) (<= 49979 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {37533#(and (<= main_~z~0 0) (<= 49978 main_~y~0))} is VALID [2022-04-28 03:48:10,419 INFO L290 TraceCheckUtils]: 32: Hoare triple {37533#(and (<= main_~z~0 0) (<= 49978 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {37537#(and (<= main_~z~0 0) (<= 49977 main_~y~0))} is VALID [2022-04-28 03:48:10,420 INFO L290 TraceCheckUtils]: 33: Hoare triple {37537#(and (<= main_~z~0 0) (<= 49977 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {37541#(and (<= main_~z~0 0) (<= 49976 main_~y~0))} is VALID [2022-04-28 03:48:10,420 INFO L290 TraceCheckUtils]: 34: Hoare triple {37541#(and (<= main_~z~0 0) (<= 49976 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {37545#(and (<= main_~z~0 0) (<= 49975 main_~y~0))} is VALID [2022-04-28 03:48:10,421 INFO L290 TraceCheckUtils]: 35: Hoare triple {37545#(and (<= main_~z~0 0) (<= 49975 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {37549#(and (<= main_~z~0 0) (<= 49974 main_~y~0))} is VALID [2022-04-28 03:48:10,421 INFO L290 TraceCheckUtils]: 36: Hoare triple {37549#(and (<= main_~z~0 0) (<= 49974 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {37553#(and (<= main_~z~0 0) (<= 49973 main_~y~0))} is VALID [2022-04-28 03:48:10,422 INFO L290 TraceCheckUtils]: 37: Hoare triple {37553#(and (<= main_~z~0 0) (<= 49973 main_~y~0))} assume !(~y~0 > ~z~0); {37382#false} is VALID [2022-04-28 03:48:10,422 INFO L272 TraceCheckUtils]: 38: Hoare triple {37382#false} call __VERIFIER_assert((if ~x~0 == ~z~0 then 1 else 0)); {37382#false} is VALID [2022-04-28 03:48:10,422 INFO L290 TraceCheckUtils]: 39: Hoare triple {37382#false} ~cond := #in~cond; {37382#false} is VALID [2022-04-28 03:48:10,422 INFO L290 TraceCheckUtils]: 40: Hoare triple {37382#false} assume 0 == ~cond; {37382#false} is VALID [2022-04-28 03:48:10,422 INFO L290 TraceCheckUtils]: 41: Hoare triple {37382#false} assume !false; {37382#false} is VALID [2022-04-28 03:48:10,422 INFO L134 CoverageAnalysis]: Checked inductivity of 380 backedges. 0 proven. 378 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-04-28 03:48:10,422 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 03:48:12,338 INFO L290 TraceCheckUtils]: 41: Hoare triple {37382#false} assume !false; {37382#false} is VALID [2022-04-28 03:48:12,338 INFO L290 TraceCheckUtils]: 40: Hoare triple {37382#false} assume 0 == ~cond; {37382#false} is VALID [2022-04-28 03:48:12,338 INFO L290 TraceCheckUtils]: 39: Hoare triple {37382#false} ~cond := #in~cond; {37382#false} is VALID [2022-04-28 03:48:12,338 INFO L272 TraceCheckUtils]: 38: Hoare triple {37382#false} call __VERIFIER_assert((if ~x~0 == ~z~0 then 1 else 0)); {37382#false} is VALID [2022-04-28 03:48:12,339 INFO L290 TraceCheckUtils]: 37: Hoare triple {37581#(< main_~z~0 main_~y~0)} assume !(~y~0 > ~z~0); {37382#false} is VALID [2022-04-28 03:48:12,339 INFO L290 TraceCheckUtils]: 36: Hoare triple {37585#(< (+ main_~z~0 1) main_~y~0)} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {37581#(< main_~z~0 main_~y~0)} is VALID [2022-04-28 03:48:12,340 INFO L290 TraceCheckUtils]: 35: Hoare triple {37589#(< (+ main_~z~0 2) main_~y~0)} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {37585#(< (+ main_~z~0 1) main_~y~0)} is VALID [2022-04-28 03:48:12,340 INFO L290 TraceCheckUtils]: 34: Hoare triple {37593#(< (+ main_~z~0 3) main_~y~0)} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {37589#(< (+ main_~z~0 2) main_~y~0)} is VALID [2022-04-28 03:48:12,340 INFO L290 TraceCheckUtils]: 33: Hoare triple {37597#(< (+ main_~z~0 4) main_~y~0)} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {37593#(< (+ main_~z~0 3) main_~y~0)} is VALID [2022-04-28 03:48:12,341 INFO L290 TraceCheckUtils]: 32: Hoare triple {37601#(< (+ 5 main_~z~0) main_~y~0)} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {37597#(< (+ main_~z~0 4) main_~y~0)} is VALID [2022-04-28 03:48:12,341 INFO L290 TraceCheckUtils]: 31: Hoare triple {37605#(< (+ main_~z~0 6) main_~y~0)} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {37601#(< (+ 5 main_~z~0) main_~y~0)} is VALID [2022-04-28 03:48:12,342 INFO L290 TraceCheckUtils]: 30: Hoare triple {37609#(< (+ 7 main_~z~0) main_~y~0)} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {37605#(< (+ main_~z~0 6) main_~y~0)} is VALID [2022-04-28 03:48:12,342 INFO L290 TraceCheckUtils]: 29: Hoare triple {37613#(< (+ main_~z~0 8) main_~y~0)} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {37609#(< (+ 7 main_~z~0) main_~y~0)} is VALID [2022-04-28 03:48:12,343 INFO L290 TraceCheckUtils]: 28: Hoare triple {37617#(< (+ main_~z~0 9) main_~y~0)} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {37613#(< (+ main_~z~0 8) main_~y~0)} is VALID [2022-04-28 03:48:12,343 INFO L290 TraceCheckUtils]: 27: Hoare triple {37621#(< (+ main_~z~0 10) main_~y~0)} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {37617#(< (+ main_~z~0 9) main_~y~0)} is VALID [2022-04-28 03:48:12,344 INFO L290 TraceCheckUtils]: 26: Hoare triple {37625#(< (+ main_~z~0 11) main_~y~0)} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {37621#(< (+ main_~z~0 10) main_~y~0)} is VALID [2022-04-28 03:48:12,344 INFO L290 TraceCheckUtils]: 25: Hoare triple {37629#(< (+ main_~z~0 12) main_~y~0)} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {37625#(< (+ main_~z~0 11) main_~y~0)} is VALID [2022-04-28 03:48:12,345 INFO L290 TraceCheckUtils]: 24: Hoare triple {37633#(< (+ main_~z~0 13) main_~y~0)} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {37629#(< (+ main_~z~0 12) main_~y~0)} is VALID [2022-04-28 03:48:12,345 INFO L290 TraceCheckUtils]: 23: Hoare triple {37637#(< (+ main_~z~0 14) main_~y~0)} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {37633#(< (+ main_~z~0 13) main_~y~0)} is VALID [2022-04-28 03:48:12,345 INFO L290 TraceCheckUtils]: 22: Hoare triple {37641#(< (+ main_~z~0 15) main_~y~0)} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {37637#(< (+ main_~z~0 14) main_~y~0)} is VALID [2022-04-28 03:48:12,346 INFO L290 TraceCheckUtils]: 21: Hoare triple {37645#(< (+ main_~z~0 16) main_~y~0)} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {37641#(< (+ main_~z~0 15) main_~y~0)} is VALID [2022-04-28 03:48:12,346 INFO L290 TraceCheckUtils]: 20: Hoare triple {37649#(< (+ main_~z~0 17) main_~y~0)} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {37645#(< (+ main_~z~0 16) main_~y~0)} is VALID [2022-04-28 03:48:12,347 INFO L290 TraceCheckUtils]: 19: Hoare triple {37653#(< (+ main_~z~0 18) main_~y~0)} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {37649#(< (+ main_~z~0 17) main_~y~0)} is VALID [2022-04-28 03:48:12,347 INFO L290 TraceCheckUtils]: 18: Hoare triple {37657#(< (+ 19 main_~z~0) main_~y~0)} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {37653#(< (+ main_~z~0 18) main_~y~0)} is VALID [2022-04-28 03:48:12,348 INFO L290 TraceCheckUtils]: 17: Hoare triple {37661#(< (+ main_~z~0 20) main_~y~0)} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {37657#(< (+ 19 main_~z~0) main_~y~0)} is VALID [2022-04-28 03:48:12,348 INFO L290 TraceCheckUtils]: 16: Hoare triple {37665#(< (+ main_~z~0 21) main_~y~0)} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {37661#(< (+ main_~z~0 20) main_~y~0)} is VALID [2022-04-28 03:48:12,349 INFO L290 TraceCheckUtils]: 15: Hoare triple {37669#(< (+ main_~z~0 22) main_~y~0)} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {37665#(< (+ main_~z~0 21) main_~y~0)} is VALID [2022-04-28 03:48:12,349 INFO L290 TraceCheckUtils]: 14: Hoare triple {37673#(< (+ 23 main_~z~0) main_~y~0)} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {37669#(< (+ main_~z~0 22) main_~y~0)} is VALID [2022-04-28 03:48:12,349 INFO L290 TraceCheckUtils]: 13: Hoare triple {37677#(< (+ main_~z~0 24) main_~y~0)} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {37673#(< (+ 23 main_~z~0) main_~y~0)} is VALID [2022-04-28 03:48:12,350 INFO L290 TraceCheckUtils]: 12: Hoare triple {37681#(< (+ main_~z~0 25) main_~y~0)} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {37677#(< (+ main_~z~0 24) main_~y~0)} is VALID [2022-04-28 03:48:12,350 INFO L290 TraceCheckUtils]: 11: Hoare triple {37685#(< (+ main_~z~0 26) main_~y~0)} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {37681#(< (+ main_~z~0 25) main_~y~0)} is VALID [2022-04-28 03:48:12,351 INFO L290 TraceCheckUtils]: 10: Hoare triple {37689#(< (+ main_~z~0 27) main_~y~0)} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {37685#(< (+ main_~z~0 26) main_~y~0)} is VALID [2022-04-28 03:48:12,351 INFO L290 TraceCheckUtils]: 9: Hoare triple {37689#(< (+ main_~z~0 27) main_~y~0)} [191] L18-1_primed-->L18-1: Formula: (not (< v_main_~x~0_11 1000000)) InVars {main_~x~0=v_main_~x~0_11} OutVars{main_~x~0=v_main_~x~0_11} AuxVars[] AssignedVars[] {37689#(< (+ main_~z~0 27) main_~y~0)} is VALID [2022-04-28 03:48:12,352 INFO L290 TraceCheckUtils]: 8: Hoare triple {37689#(< (+ main_~z~0 27) main_~y~0)} [194] L11-2-->L18-1_primed: Formula: (let ((.cse3 (<= 50000 v_main_~x~0_1762)) (.cse0 (= v_main_~x~0_1762 v_main_~x~0_1761)) (.cse1 (= |v_main_#t~post5_235| |v_main_#t~post5_234|)) (.cse2 (= v_main_~y~0_1893 v_main_~y~0_1892)) (.cse4 (= |v_main_#t~post6_235| |v_main_#t~post6_234|))) (or (and .cse0 .cse1 .cse2 (or (not .cse3) (not (< v_main_~x~0_1762 1000000))) .cse4) (let ((.cse5 (+ v_main_~x~0_1762 v_main_~y~0_1892))) (and (< .cse5 (+ 1000001 v_main_~y~0_1893)) .cse3 (< v_main_~y~0_1893 v_main_~y~0_1892) (= .cse5 (+ v_main_~x~0_1761 v_main_~y~0_1893)))) (and .cse0 .cse1 .cse2 .cse4))) InVars {main_~y~0=v_main_~y~0_1893, main_#t~post5=|v_main_#t~post5_235|, main_~x~0=v_main_~x~0_1762, main_#t~post6=|v_main_#t~post6_235|} OutVars{main_~y~0=v_main_~y~0_1892, main_#t~post5=|v_main_#t~post5_234|, main_~x~0=v_main_~x~0_1761, main_#t~post6=|v_main_#t~post6_234|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {37689#(< (+ main_~z~0 27) main_~y~0)} is VALID [2022-04-28 03:48:12,352 INFO L290 TraceCheckUtils]: 7: Hoare triple {37689#(< (+ main_~z~0 27) main_~y~0)} [193] L18-1_primed-->L11-2: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {37689#(< (+ main_~z~0 27) main_~y~0)} is VALID [2022-04-28 03:48:12,352 INFO L290 TraceCheckUtils]: 6: Hoare triple {37689#(< (+ main_~z~0 27) main_~y~0)} [192] L11-2-->L18-1_primed: Formula: (or (and (= |v_main_#t~post4_209| |v_main_#t~post4_210|) (<= 50000 v_main_~x~0_1760) (= v_main_~x~0_1759 v_main_~x~0_1760)) (and (< v_main_~x~0_1760 v_main_~x~0_1759) (< v_main_~x~0_1759 50001)) (and (= |v_main_#t~post4_210| |v_main_#t~post4_209|) (= v_main_~x~0_1760 v_main_~x~0_1759))) InVars {main_~x~0=v_main_~x~0_1760, main_#t~post4=|v_main_#t~post4_210|} OutVars{main_~x~0=v_main_~x~0_1759, main_#t~post4=|v_main_#t~post4_209|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {37689#(< (+ main_~z~0 27) main_~y~0)} is VALID [2022-04-28 03:48:12,353 INFO L290 TraceCheckUtils]: 5: Hoare triple {37381#true} ~x~0 := 0;~y~0 := 50000;~z~0 := 0;~x~0 := 0; {37689#(< (+ main_~z~0 27) main_~y~0)} is VALID [2022-04-28 03:48:12,353 INFO L272 TraceCheckUtils]: 4: Hoare triple {37381#true} call #t~ret9 := main(); {37381#true} is VALID [2022-04-28 03:48:12,353 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {37381#true} {37381#true} #52#return; {37381#true} is VALID [2022-04-28 03:48:12,353 INFO L290 TraceCheckUtils]: 2: Hoare triple {37381#true} assume true; {37381#true} is VALID [2022-04-28 03:48:12,353 INFO L290 TraceCheckUtils]: 1: Hoare triple {37381#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(17, 2);call #Ultimate.allocInit(12, 3); {37381#true} is VALID [2022-04-28 03:48:12,353 INFO L272 TraceCheckUtils]: 0: Hoare triple {37381#true} call ULTIMATE.init(); {37381#true} is VALID [2022-04-28 03:48:12,353 INFO L134 CoverageAnalysis]: Checked inductivity of 380 backedges. 0 proven. 378 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-04-28 03:48:12,353 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1854432542] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 03:48:12,353 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 03:48:12,354 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [31, 30, 30] total 87 [2022-04-28 03:48:14,389 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 03:48:14,390 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [691118820] [2022-04-28 03:48:14,390 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [691118820] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 03:48:14,390 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 03:48:14,390 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [79] imperfect sequences [] total 79 [2022-04-28 03:48:14,390 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1280944551] [2022-04-28 03:48:14,390 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 03:48:14,390 INFO L78 Accepts]: Start accepts. Automaton has has 79 states, 79 states have (on average 1.6329113924050633) internal successors, (129), 78 states have internal predecessors, (129), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 133 [2022-04-28 03:48:14,390 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 03:48:14,391 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 79 states, 79 states have (on average 1.6329113924050633) internal successors, (129), 78 states have internal predecessors, (129), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:48:14,486 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 133 edges. 133 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 03:48:14,487 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 79 states [2022-04-28 03:48:14,487 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 03:48:14,487 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 79 interpolants. [2022-04-28 03:48:14,488 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7454, Invalid=10636, Unknown=0, NotChecked=0, Total=18090 [2022-04-28 03:48:14,489 INFO L87 Difference]: Start difference. First operand 218 states and 222 transitions. Second operand has 79 states, 79 states have (on average 1.6329113924050633) internal successors, (129), 78 states have internal predecessors, (129), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:48:24,403 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:48:24,403 INFO L93 Difference]: Finished difference Result 349 states and 369 transitions. [2022-04-28 03:48:24,403 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 79 states. [2022-04-28 03:48:24,403 INFO L78 Accepts]: Start accepts. Automaton has has 79 states, 79 states have (on average 1.6329113924050633) internal successors, (129), 78 states have internal predecessors, (129), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 133 [2022-04-28 03:48:24,403 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 03:48:24,403 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 79 states, 79 states have (on average 1.6329113924050633) internal successors, (129), 78 states have internal predecessors, (129), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:48:24,405 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 163 transitions. [2022-04-28 03:48:24,405 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 79 states, 79 states have (on average 1.6329113924050633) internal successors, (129), 78 states have internal predecessors, (129), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:48:24,405 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 163 transitions. [2022-04-28 03:48:24,406 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 79 states and 163 transitions. [2022-04-28 03:48:24,533 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 163 edges. 163 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 03:48:24,536 INFO L225 Difference]: With dead ends: 349 [2022-04-28 03:48:24,536 INFO L226 Difference]: Without dead ends: 231 [2022-04-28 03:48:24,539 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 292 GetRequests, 81 SyntacticMatches, 2 SemanticMatches, 209 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12705 ImplicationChecksByTransitivity, 6.7s TimeCoverageRelationStatistics Valid=15174, Invalid=29136, Unknown=0, NotChecked=0, Total=44310 [2022-04-28 03:48:24,540 INFO L413 NwaCegarLoop]: 12 mSDtfsCounter, 107 mSDsluCounter, 27 mSDsCounter, 0 mSdLazyCounter, 4591 mSolverCounterSat, 192 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 107 SdHoareTripleChecker+Valid, 39 SdHoareTripleChecker+Invalid, 4783 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 192 IncrementalHoareTripleChecker+Valid, 4591 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.7s IncrementalHoareTripleChecker+Time [2022-04-28 03:48:24,540 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [107 Valid, 39 Invalid, 4783 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [192 Valid, 4591 Invalid, 0 Unknown, 0 Unchecked, 3.7s Time] [2022-04-28 03:48:24,540 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 231 states. [2022-04-28 03:48:24,805 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 231 to 139. [2022-04-28 03:48:24,805 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 03:48:24,805 INFO L82 GeneralOperation]: Start isEquivalent. First operand 231 states. Second operand has 139 states, 134 states have (on average 1.0298507462686568) internal successors, (138), 134 states have internal predecessors, (138), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:48:24,805 INFO L74 IsIncluded]: Start isIncluded. First operand 231 states. Second operand has 139 states, 134 states have (on average 1.0298507462686568) internal successors, (138), 134 states have internal predecessors, (138), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:48:24,805 INFO L87 Difference]: Start difference. First operand 231 states. Second operand has 139 states, 134 states have (on average 1.0298507462686568) internal successors, (138), 134 states have internal predecessors, (138), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:48:24,808 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:48:24,808 INFO L93 Difference]: Finished difference Result 231 states and 235 transitions. [2022-04-28 03:48:24,808 INFO L276 IsEmpty]: Start isEmpty. Operand 231 states and 235 transitions. [2022-04-28 03:48:24,808 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:48:24,808 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:48:24,808 INFO L74 IsIncluded]: Start isIncluded. First operand has 139 states, 134 states have (on average 1.0298507462686568) internal successors, (138), 134 states have internal predecessors, (138), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 231 states. [2022-04-28 03:48:24,808 INFO L87 Difference]: Start difference. First operand has 139 states, 134 states have (on average 1.0298507462686568) internal successors, (138), 134 states have internal predecessors, (138), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 231 states. [2022-04-28 03:48:24,820 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:48:24,821 INFO L93 Difference]: Finished difference Result 231 states and 235 transitions. [2022-04-28 03:48:24,821 INFO L276 IsEmpty]: Start isEmpty. Operand 231 states and 235 transitions. [2022-04-28 03:48:24,821 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:48:24,821 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:48:24,821 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 03:48:24,821 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 03:48:24,821 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 139 states, 134 states have (on average 1.0298507462686568) internal successors, (138), 134 states have internal predecessors, (138), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:48:24,822 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 139 states to 139 states and 142 transitions. [2022-04-28 03:48:24,822 INFO L78 Accepts]: Start accepts. Automaton has 139 states and 142 transitions. Word has length 133 [2022-04-28 03:48:24,822 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 03:48:24,823 INFO L495 AbstractCegarLoop]: Abstraction has 139 states and 142 transitions. [2022-04-28 03:48:24,823 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 79 states, 79 states have (on average 1.6329113924050633) internal successors, (129), 78 states have internal predecessors, (129), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:48:24,823 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 139 states and 142 transitions. [2022-04-28 03:48:24,958 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 142 edges. 142 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 03:48:24,959 INFO L276 IsEmpty]: Start isEmpty. Operand 139 states and 142 transitions. [2022-04-28 03:48:24,959 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2022-04-28 03:48:24,959 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 03:48:24,959 INFO L195 NwaCegarLoop]: trace histogram [49, 48, 28, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 03:48:24,974 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (35)] Ended with exit code 0 [2022-04-28 03:48:25,159 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 35 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable36 [2022-04-28 03:48:25,160 INFO L420 AbstractCegarLoop]: === Iteration 38 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 03:48:25,160 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 03:48:25,161 INFO L85 PathProgramCache]: Analyzing trace with hash -2077295638, now seen corresponding path program 35 times [2022-04-28 03:48:25,161 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 03:48:25,161 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [496255580] [2022-04-28 03:48:29,226 WARN L977 rdanLoopAcceleration]: Unable to prove correctness of quantifier elimination. [2022-04-28 03:48:29,271 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 1 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 03:48:29,454 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={1=1, 2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 03:48:29,455 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-28 03:48:29,457 INFO L85 PathProgramCache]: Analyzing trace with hash 780368065, now seen corresponding path program 1 times [2022-04-28 03:48:29,457 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 03:48:29,457 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1257394669] [2022-04-28 03:48:29,458 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:48:29,458 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 03:48:29,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:48:30,113 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 03:48:30,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:48:30,120 INFO L290 TraceCheckUtils]: 0: Hoare triple {39397#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(17, 2);call #Ultimate.allocInit(12, 3); {39360#true} is VALID [2022-04-28 03:48:30,120 INFO L290 TraceCheckUtils]: 1: Hoare triple {39360#true} assume true; {39360#true} is VALID [2022-04-28 03:48:30,120 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {39360#true} {39360#true} #52#return; {39360#true} is VALID [2022-04-28 03:48:30,121 INFO L272 TraceCheckUtils]: 0: Hoare triple {39360#true} call ULTIMATE.init(); {39397#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 03:48:30,121 INFO L290 TraceCheckUtils]: 1: Hoare triple {39397#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(17, 2);call #Ultimate.allocInit(12, 3); {39360#true} is VALID [2022-04-28 03:48:30,121 INFO L290 TraceCheckUtils]: 2: Hoare triple {39360#true} assume true; {39360#true} is VALID [2022-04-28 03:48:30,121 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {39360#true} {39360#true} #52#return; {39360#true} is VALID [2022-04-28 03:48:30,121 INFO L272 TraceCheckUtils]: 4: Hoare triple {39360#true} call #t~ret9 := main(); {39360#true} is VALID [2022-04-28 03:48:30,122 INFO L290 TraceCheckUtils]: 5: Hoare triple {39360#true} ~x~0 := 0;~y~0 := 50000;~z~0 := 0;~x~0 := 0; {39365#(and (= main_~z~0 0) (= main_~x~0 0) (<= 50000 main_~y~0))} is VALID [2022-04-28 03:48:30,123 INFO L290 TraceCheckUtils]: 6: Hoare triple {39365#(and (= main_~z~0 0) (= main_~x~0 0) (<= 50000 main_~y~0))} [196] L11-2-->L18-1_primed: Formula: (let ((.cse0 (= |v_main_#t~post4_216| |v_main_#t~post4_215|))) (or (and .cse0 (= v_main_~x~0_1850 v_main_~x~0_1849)) (and .cse0 (not (< v_main_~x~0_1850 50000)) (= v_main_~x~0_1849 v_main_~x~0_1850)) (and (< v_main_~x~0_1850 v_main_~x~0_1849) (< v_main_~x~0_1849 50001)))) InVars {main_~x~0=v_main_~x~0_1850, main_#t~post4=|v_main_#t~post4_216|} OutVars{main_~x~0=v_main_~x~0_1849, main_#t~post4=|v_main_#t~post4_215|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {39366#(and (= main_~z~0 0) (<= main_~x~0 main_~y~0) (<= 50000 main_~y~0))} is VALID [2022-04-28 03:48:30,123 INFO L290 TraceCheckUtils]: 7: Hoare triple {39366#(and (= main_~z~0 0) (<= main_~x~0 main_~y~0) (<= 50000 main_~y~0))} [197] L18-1_primed-->L11-2: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {39366#(and (= main_~z~0 0) (<= main_~x~0 main_~y~0) (<= 50000 main_~y~0))} is VALID [2022-04-28 03:48:30,124 INFO L290 TraceCheckUtils]: 8: Hoare triple {39366#(and (= main_~z~0 0) (<= main_~x~0 main_~y~0) (<= 50000 main_~y~0))} [198] L11-2-->L18-1_primed: Formula: (let ((.cse0 (= |v_main_#t~post6_242| |v_main_#t~post6_241|)) (.cse1 (= v_main_~x~0_1852 v_main_~x~0_1851)) (.cse3 (= v_main_~y~0_2002 v_main_~y~0_2001)) (.cse4 (= |v_main_#t~post5_242| |v_main_#t~post5_241|)) (.cse2 (<= 50000 v_main_~x~0_1852))) (or (and .cse0 .cse1 (or (not (< v_main_~x~0_1852 1000000)) (not .cse2)) .cse3 .cse4) (and .cse0 .cse1 .cse3 .cse4) (and (< v_main_~x~0_1851 1000001) (< v_main_~x~0_1852 v_main_~x~0_1851) (= (+ v_main_~x~0_1852 v_main_~y~0_2001) (+ v_main_~x~0_1851 v_main_~y~0_2002)) .cse2))) InVars {main_~y~0=v_main_~y~0_2002, main_#t~post5=|v_main_#t~post5_242|, main_~x~0=v_main_~x~0_1852, main_#t~post6=|v_main_#t~post6_242|} OutVars{main_~y~0=v_main_~y~0_2001, main_#t~post5=|v_main_#t~post5_241|, main_~x~0=v_main_~x~0_1851, main_#t~post6=|v_main_#t~post6_241|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {39367#(and (or (<= 29 main_~y~0) (<= main_~x~0 main_~y~0)) (= main_~z~0 0))} is VALID [2022-04-28 03:48:30,125 INFO L290 TraceCheckUtils]: 9: Hoare triple {39367#(and (or (<= 29 main_~y~0) (<= main_~x~0 main_~y~0)) (= main_~z~0 0))} [195] L18-1_primed-->L18-1: Formula: (not (< v_main_~x~0_11 1000000)) InVars {main_~x~0=v_main_~x~0_11} OutVars{main_~x~0=v_main_~x~0_11} AuxVars[] AssignedVars[] {39368#(and (<= 29 main_~y~0) (= main_~z~0 0))} is VALID [2022-04-28 03:48:30,125 INFO L290 TraceCheckUtils]: 10: Hoare triple {39368#(and (<= 29 main_~y~0) (= main_~z~0 0))} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {39369#(and (= main_~z~0 0) (<= 28 main_~y~0))} is VALID [2022-04-28 03:48:30,126 INFO L290 TraceCheckUtils]: 11: Hoare triple {39369#(and (= main_~z~0 0) (<= 28 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {39370#(and (= main_~z~0 0) (<= 27 main_~y~0))} is VALID [2022-04-28 03:48:30,127 INFO L290 TraceCheckUtils]: 12: Hoare triple {39370#(and (= main_~z~0 0) (<= 27 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {39371#(and (= main_~z~0 0) (<= 26 main_~y~0))} is VALID [2022-04-28 03:48:30,127 INFO L290 TraceCheckUtils]: 13: Hoare triple {39371#(and (= main_~z~0 0) (<= 26 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {39372#(and (= main_~z~0 0) (<= 25 main_~y~0))} is VALID [2022-04-28 03:48:30,128 INFO L290 TraceCheckUtils]: 14: Hoare triple {39372#(and (= main_~z~0 0) (<= 25 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {39373#(and (= main_~z~0 0) (<= 24 main_~y~0))} is VALID [2022-04-28 03:48:30,129 INFO L290 TraceCheckUtils]: 15: Hoare triple {39373#(and (= main_~z~0 0) (<= 24 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {39374#(and (= main_~z~0 0) (<= 23 main_~y~0))} is VALID [2022-04-28 03:48:30,129 INFO L290 TraceCheckUtils]: 16: Hoare triple {39374#(and (= main_~z~0 0) (<= 23 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {39375#(and (= main_~z~0 0) (<= 22 main_~y~0))} is VALID [2022-04-28 03:48:30,130 INFO L290 TraceCheckUtils]: 17: Hoare triple {39375#(and (= main_~z~0 0) (<= 22 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {39376#(and (= main_~z~0 0) (<= 21 main_~y~0))} is VALID [2022-04-28 03:48:30,131 INFO L290 TraceCheckUtils]: 18: Hoare triple {39376#(and (= main_~z~0 0) (<= 21 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {39377#(and (= main_~z~0 0) (<= 20 main_~y~0))} is VALID [2022-04-28 03:48:30,131 INFO L290 TraceCheckUtils]: 19: Hoare triple {39377#(and (= main_~z~0 0) (<= 20 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {39378#(and (= main_~z~0 0) (<= 19 main_~y~0))} is VALID [2022-04-28 03:48:30,132 INFO L290 TraceCheckUtils]: 20: Hoare triple {39378#(and (= main_~z~0 0) (<= 19 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {39379#(and (= main_~z~0 0) (<= 18 main_~y~0))} is VALID [2022-04-28 03:48:30,132 INFO L290 TraceCheckUtils]: 21: Hoare triple {39379#(and (= main_~z~0 0) (<= 18 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {39380#(and (= main_~z~0 0) (<= 17 main_~y~0))} is VALID [2022-04-28 03:48:30,133 INFO L290 TraceCheckUtils]: 22: Hoare triple {39380#(and (= main_~z~0 0) (<= 17 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {39381#(and (= main_~z~0 0) (<= 16 main_~y~0))} is VALID [2022-04-28 03:48:30,134 INFO L290 TraceCheckUtils]: 23: Hoare triple {39381#(and (= main_~z~0 0) (<= 16 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {39382#(and (= main_~z~0 0) (<= 15 main_~y~0))} is VALID [2022-04-28 03:48:30,134 INFO L290 TraceCheckUtils]: 24: Hoare triple {39382#(and (= main_~z~0 0) (<= 15 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {39383#(and (= main_~z~0 0) (<= 14 main_~y~0))} is VALID [2022-04-28 03:48:30,135 INFO L290 TraceCheckUtils]: 25: Hoare triple {39383#(and (= main_~z~0 0) (<= 14 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {39384#(and (= main_~z~0 0) (<= 13 main_~y~0))} is VALID [2022-04-28 03:48:30,135 INFO L290 TraceCheckUtils]: 26: Hoare triple {39384#(and (= main_~z~0 0) (<= 13 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {39385#(and (= main_~z~0 0) (<= 12 main_~y~0))} is VALID [2022-04-28 03:48:30,136 INFO L290 TraceCheckUtils]: 27: Hoare triple {39385#(and (= main_~z~0 0) (<= 12 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {39386#(and (= main_~z~0 0) (<= 11 main_~y~0))} is VALID [2022-04-28 03:48:30,136 INFO L290 TraceCheckUtils]: 28: Hoare triple {39386#(and (= main_~z~0 0) (<= 11 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {39387#(and (= main_~z~0 0) (<= 10 main_~y~0))} is VALID [2022-04-28 03:48:30,137 INFO L290 TraceCheckUtils]: 29: Hoare triple {39387#(and (= main_~z~0 0) (<= 10 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {39388#(and (= main_~z~0 0) (<= 9 main_~y~0))} is VALID [2022-04-28 03:48:30,137 INFO L290 TraceCheckUtils]: 30: Hoare triple {39388#(and (= main_~z~0 0) (<= 9 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {39389#(and (= main_~z~0 0) (<= 8 main_~y~0))} is VALID [2022-04-28 03:48:30,137 INFO L290 TraceCheckUtils]: 31: Hoare triple {39389#(and (= main_~z~0 0) (<= 8 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {39390#(and (= main_~z~0 0) (<= 7 main_~y~0))} is VALID [2022-04-28 03:48:30,138 INFO L290 TraceCheckUtils]: 32: Hoare triple {39390#(and (= main_~z~0 0) (<= 7 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {39391#(and (= main_~z~0 0) (<= 6 main_~y~0))} is VALID [2022-04-28 03:48:30,138 INFO L290 TraceCheckUtils]: 33: Hoare triple {39391#(and (= main_~z~0 0) (<= 6 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {39392#(and (= main_~z~0 0) (<= 5 main_~y~0))} is VALID [2022-04-28 03:48:30,139 INFO L290 TraceCheckUtils]: 34: Hoare triple {39392#(and (= main_~z~0 0) (<= 5 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {39393#(and (= main_~z~0 0) (<= 4 main_~y~0))} is VALID [2022-04-28 03:48:30,139 INFO L290 TraceCheckUtils]: 35: Hoare triple {39393#(and (= main_~z~0 0) (<= 4 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {39394#(and (= main_~z~0 0) (<= 3 main_~y~0))} is VALID [2022-04-28 03:48:30,140 INFO L290 TraceCheckUtils]: 36: Hoare triple {39394#(and (= main_~z~0 0) (<= 3 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {39395#(and (= main_~z~0 0) (<= 2 main_~y~0))} is VALID [2022-04-28 03:48:30,140 INFO L290 TraceCheckUtils]: 37: Hoare triple {39395#(and (= main_~z~0 0) (<= 2 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {39396#(and (= main_~z~0 0) (<= 1 main_~y~0))} is VALID [2022-04-28 03:48:30,141 INFO L290 TraceCheckUtils]: 38: Hoare triple {39396#(and (= main_~z~0 0) (<= 1 main_~y~0))} assume !(~y~0 > ~z~0); {39361#false} is VALID [2022-04-28 03:48:30,141 INFO L272 TraceCheckUtils]: 39: Hoare triple {39361#false} call __VERIFIER_assert((if ~x~0 == ~z~0 then 1 else 0)); {39361#false} is VALID [2022-04-28 03:48:30,141 INFO L290 TraceCheckUtils]: 40: Hoare triple {39361#false} ~cond := #in~cond; {39361#false} is VALID [2022-04-28 03:48:30,141 INFO L290 TraceCheckUtils]: 41: Hoare triple {39361#false} assume 0 == ~cond; {39361#false} is VALID [2022-04-28 03:48:30,141 INFO L290 TraceCheckUtils]: 42: Hoare triple {39361#false} assume !false; {39361#false} is VALID [2022-04-28 03:48:30,141 INFO L134 CoverageAnalysis]: Checked inductivity of 408 backedges. 0 proven. 408 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 03:48:30,141 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 03:48:30,141 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1257394669] [2022-04-28 03:48:30,141 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1257394669] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 03:48:30,141 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2015194681] [2022-04-28 03:48:30,141 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:48:30,142 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 03:48:30,142 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 03:48:30,142 INFO L229 MonitoredProcess]: Starting monitored process 36 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 03:48:30,143 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (36)] Waiting until timeout for monitored process [2022-04-28 03:48:30,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:48:30,192 INFO L263 TraceCheckSpWp]: Trace formula consists of 199 conjuncts, 35 conjunts are in the unsatisfiable core [2022-04-28 03:48:30,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:48:30,226 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 03:48:31,749 INFO L272 TraceCheckUtils]: 0: Hoare triple {39360#true} call ULTIMATE.init(); {39360#true} is VALID [2022-04-28 03:48:31,749 INFO L290 TraceCheckUtils]: 1: Hoare triple {39360#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(17, 2);call #Ultimate.allocInit(12, 3); {39360#true} is VALID [2022-04-28 03:48:31,749 INFO L290 TraceCheckUtils]: 2: Hoare triple {39360#true} assume true; {39360#true} is VALID [2022-04-28 03:48:31,749 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {39360#true} {39360#true} #52#return; {39360#true} is VALID [2022-04-28 03:48:31,749 INFO L272 TraceCheckUtils]: 4: Hoare triple {39360#true} call #t~ret9 := main(); {39360#true} is VALID [2022-04-28 03:48:31,750 INFO L290 TraceCheckUtils]: 5: Hoare triple {39360#true} ~x~0 := 0;~y~0 := 50000;~z~0 := 0;~x~0 := 0; {39416#(and (<= main_~z~0 0) (<= main_~x~0 0) (<= 50000 main_~y~0))} is VALID [2022-04-28 03:48:31,750 INFO L290 TraceCheckUtils]: 6: Hoare triple {39416#(and (<= main_~z~0 0) (<= main_~x~0 0) (<= 50000 main_~y~0))} [196] L11-2-->L18-1_primed: Formula: (let ((.cse0 (= |v_main_#t~post4_216| |v_main_#t~post4_215|))) (or (and .cse0 (= v_main_~x~0_1850 v_main_~x~0_1849)) (and .cse0 (not (< v_main_~x~0_1850 50000)) (= v_main_~x~0_1849 v_main_~x~0_1850)) (and (< v_main_~x~0_1850 v_main_~x~0_1849) (< v_main_~x~0_1849 50001)))) InVars {main_~x~0=v_main_~x~0_1850, main_#t~post4=|v_main_#t~post4_216|} OutVars{main_~x~0=v_main_~x~0_1849, main_#t~post4=|v_main_#t~post4_215|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {39420#(and (<= main_~z~0 0) (< main_~x~0 50001) (<= 50000 main_~y~0))} is VALID [2022-04-28 03:48:31,751 INFO L290 TraceCheckUtils]: 7: Hoare triple {39420#(and (<= main_~z~0 0) (< main_~x~0 50001) (<= 50000 main_~y~0))} [197] L18-1_primed-->L11-2: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {39420#(and (<= main_~z~0 0) (< main_~x~0 50001) (<= 50000 main_~y~0))} is VALID [2022-04-28 03:48:31,752 INFO L290 TraceCheckUtils]: 8: Hoare triple {39420#(and (<= main_~z~0 0) (< main_~x~0 50001) (<= 50000 main_~y~0))} [198] L11-2-->L18-1_primed: Formula: (let ((.cse0 (= |v_main_#t~post6_242| |v_main_#t~post6_241|)) (.cse1 (= v_main_~x~0_1852 v_main_~x~0_1851)) (.cse3 (= v_main_~y~0_2002 v_main_~y~0_2001)) (.cse4 (= |v_main_#t~post5_242| |v_main_#t~post5_241|)) (.cse2 (<= 50000 v_main_~x~0_1852))) (or (and .cse0 .cse1 (or (not (< v_main_~x~0_1852 1000000)) (not .cse2)) .cse3 .cse4) (and .cse0 .cse1 .cse3 .cse4) (and (< v_main_~x~0_1851 1000001) (< v_main_~x~0_1852 v_main_~x~0_1851) (= (+ v_main_~x~0_1852 v_main_~y~0_2001) (+ v_main_~x~0_1851 v_main_~y~0_2002)) .cse2))) InVars {main_~y~0=v_main_~y~0_2002, main_#t~post5=|v_main_#t~post5_242|, main_~x~0=v_main_~x~0_1852, main_#t~post6=|v_main_#t~post6_242|} OutVars{main_~y~0=v_main_~y~0_2001, main_#t~post5=|v_main_#t~post5_241|, main_~x~0=v_main_~x~0_1851, main_#t~post6=|v_main_#t~post6_241|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {39427#(and (<= main_~z~0 0) (or (and (< main_~x~0 50001) (<= 50000 main_~y~0)) (and (< main_~x~0 (+ main_~y~0 1)) (< main_~x~0 1000001) (< 50000 main_~x~0))))} is VALID [2022-04-28 03:48:31,752 INFO L290 TraceCheckUtils]: 9: Hoare triple {39427#(and (<= main_~z~0 0) (or (and (< main_~x~0 50001) (<= 50000 main_~y~0)) (and (< main_~x~0 (+ main_~y~0 1)) (< main_~x~0 1000001) (< 50000 main_~x~0))))} [195] L18-1_primed-->L18-1: Formula: (not (< v_main_~x~0_11 1000000)) InVars {main_~x~0=v_main_~x~0_11} OutVars{main_~x~0=v_main_~x~0_11} AuxVars[] AssignedVars[] {39431#(and (<= main_~z~0 0) (< 999999 main_~y~0))} is VALID [2022-04-28 03:48:31,753 INFO L290 TraceCheckUtils]: 10: Hoare triple {39431#(and (<= main_~z~0 0) (< 999999 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {39435#(and (<= main_~z~0 0) (< 999998 main_~y~0))} is VALID [2022-04-28 03:48:31,753 INFO L290 TraceCheckUtils]: 11: Hoare triple {39435#(and (<= main_~z~0 0) (< 999998 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {39439#(and (<= main_~z~0 0) (< 999997 main_~y~0))} is VALID [2022-04-28 03:48:31,754 INFO L290 TraceCheckUtils]: 12: Hoare triple {39439#(and (<= main_~z~0 0) (< 999997 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {39443#(and (<= main_~z~0 0) (< 999996 main_~y~0))} is VALID [2022-04-28 03:48:31,754 INFO L290 TraceCheckUtils]: 13: Hoare triple {39443#(and (<= main_~z~0 0) (< 999996 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {39447#(and (<= main_~z~0 0) (< 999995 main_~y~0))} is VALID [2022-04-28 03:48:31,755 INFO L290 TraceCheckUtils]: 14: Hoare triple {39447#(and (<= main_~z~0 0) (< 999995 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {39451#(and (<= main_~z~0 0) (< 999994 main_~y~0))} is VALID [2022-04-28 03:48:31,755 INFO L290 TraceCheckUtils]: 15: Hoare triple {39451#(and (<= main_~z~0 0) (< 999994 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {39455#(and (<= main_~z~0 0) (< 999993 main_~y~0))} is VALID [2022-04-28 03:48:31,755 INFO L290 TraceCheckUtils]: 16: Hoare triple {39455#(and (<= main_~z~0 0) (< 999993 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {39459#(and (<= main_~z~0 0) (< 999992 main_~y~0))} is VALID [2022-04-28 03:48:31,756 INFO L290 TraceCheckUtils]: 17: Hoare triple {39459#(and (<= main_~z~0 0) (< 999992 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {39463#(and (<= main_~z~0 0) (< 999991 main_~y~0))} is VALID [2022-04-28 03:48:31,756 INFO L290 TraceCheckUtils]: 18: Hoare triple {39463#(and (<= main_~z~0 0) (< 999991 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {39467#(and (<= main_~z~0 0) (< 999990 main_~y~0))} is VALID [2022-04-28 03:48:31,757 INFO L290 TraceCheckUtils]: 19: Hoare triple {39467#(and (<= main_~z~0 0) (< 999990 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {39471#(and (<= main_~z~0 0) (< 999989 main_~y~0))} is VALID [2022-04-28 03:48:31,757 INFO L290 TraceCheckUtils]: 20: Hoare triple {39471#(and (<= main_~z~0 0) (< 999989 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {39475#(and (<= main_~z~0 0) (< 999988 main_~y~0))} is VALID [2022-04-28 03:48:31,758 INFO L290 TraceCheckUtils]: 21: Hoare triple {39475#(and (<= main_~z~0 0) (< 999988 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {39479#(and (<= main_~z~0 0) (< 999987 main_~y~0))} is VALID [2022-04-28 03:48:31,758 INFO L290 TraceCheckUtils]: 22: Hoare triple {39479#(and (<= main_~z~0 0) (< 999987 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {39483#(and (<= main_~z~0 0) (< 999986 main_~y~0))} is VALID [2022-04-28 03:48:31,759 INFO L290 TraceCheckUtils]: 23: Hoare triple {39483#(and (<= main_~z~0 0) (< 999986 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {39487#(and (<= main_~z~0 0) (< 999985 main_~y~0))} is VALID [2022-04-28 03:48:31,759 INFO L290 TraceCheckUtils]: 24: Hoare triple {39487#(and (<= main_~z~0 0) (< 999985 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {39491#(and (<= main_~z~0 0) (< 999984 main_~y~0))} is VALID [2022-04-28 03:48:31,760 INFO L290 TraceCheckUtils]: 25: Hoare triple {39491#(and (<= main_~z~0 0) (< 999984 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {39495#(and (<= main_~z~0 0) (< 999983 main_~y~0))} is VALID [2022-04-28 03:48:31,760 INFO L290 TraceCheckUtils]: 26: Hoare triple {39495#(and (<= main_~z~0 0) (< 999983 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {39499#(and (<= main_~z~0 0) (< 999982 main_~y~0))} is VALID [2022-04-28 03:48:31,761 INFO L290 TraceCheckUtils]: 27: Hoare triple {39499#(and (<= main_~z~0 0) (< 999982 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {39503#(and (<= main_~z~0 0) (< 999981 main_~y~0))} is VALID [2022-04-28 03:48:31,761 INFO L290 TraceCheckUtils]: 28: Hoare triple {39503#(and (<= main_~z~0 0) (< 999981 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {39507#(and (<= main_~z~0 0) (< 999980 main_~y~0))} is VALID [2022-04-28 03:48:31,762 INFO L290 TraceCheckUtils]: 29: Hoare triple {39507#(and (<= main_~z~0 0) (< 999980 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {39511#(and (<= main_~z~0 0) (< 999979 main_~y~0))} is VALID [2022-04-28 03:48:31,762 INFO L290 TraceCheckUtils]: 30: Hoare triple {39511#(and (<= main_~z~0 0) (< 999979 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {39515#(and (<= main_~z~0 0) (< 999978 main_~y~0))} is VALID [2022-04-28 03:48:31,763 INFO L290 TraceCheckUtils]: 31: Hoare triple {39515#(and (<= main_~z~0 0) (< 999978 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {39519#(and (<= main_~z~0 0) (< 999977 main_~y~0))} is VALID [2022-04-28 03:48:31,763 INFO L290 TraceCheckUtils]: 32: Hoare triple {39519#(and (<= main_~z~0 0) (< 999977 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {39523#(and (<= main_~z~0 0) (< 999976 main_~y~0))} is VALID [2022-04-28 03:48:31,764 INFO L290 TraceCheckUtils]: 33: Hoare triple {39523#(and (<= main_~z~0 0) (< 999976 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {39527#(and (<= main_~z~0 0) (< 999975 main_~y~0))} is VALID [2022-04-28 03:48:31,764 INFO L290 TraceCheckUtils]: 34: Hoare triple {39527#(and (<= main_~z~0 0) (< 999975 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {39531#(and (<= main_~z~0 0) (< 999974 main_~y~0))} is VALID [2022-04-28 03:48:31,765 INFO L290 TraceCheckUtils]: 35: Hoare triple {39531#(and (<= main_~z~0 0) (< 999974 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {39535#(and (<= main_~z~0 0) (< 999973 main_~y~0))} is VALID [2022-04-28 03:48:31,765 INFO L290 TraceCheckUtils]: 36: Hoare triple {39535#(and (<= main_~z~0 0) (< 999973 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {39539#(and (<= main_~z~0 0) (< 999972 main_~y~0))} is VALID [2022-04-28 03:48:31,765 INFO L290 TraceCheckUtils]: 37: Hoare triple {39539#(and (<= main_~z~0 0) (< 999972 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {39543#(and (<= main_~z~0 0) (< 999971 main_~y~0))} is VALID [2022-04-28 03:48:31,766 INFO L290 TraceCheckUtils]: 38: Hoare triple {39543#(and (<= main_~z~0 0) (< 999971 main_~y~0))} assume !(~y~0 > ~z~0); {39361#false} is VALID [2022-04-28 03:48:31,766 INFO L272 TraceCheckUtils]: 39: Hoare triple {39361#false} call __VERIFIER_assert((if ~x~0 == ~z~0 then 1 else 0)); {39361#false} is VALID [2022-04-28 03:48:31,766 INFO L290 TraceCheckUtils]: 40: Hoare triple {39361#false} ~cond := #in~cond; {39361#false} is VALID [2022-04-28 03:48:31,766 INFO L290 TraceCheckUtils]: 41: Hoare triple {39361#false} assume 0 == ~cond; {39361#false} is VALID [2022-04-28 03:48:31,766 INFO L290 TraceCheckUtils]: 42: Hoare triple {39361#false} assume !false; {39361#false} is VALID [2022-04-28 03:48:31,766 INFO L134 CoverageAnalysis]: Checked inductivity of 408 backedges. 0 proven. 408 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 03:48:31,766 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 03:48:33,992 INFO L290 TraceCheckUtils]: 42: Hoare triple {39361#false} assume !false; {39361#false} is VALID [2022-04-28 03:48:33,992 INFO L290 TraceCheckUtils]: 41: Hoare triple {39361#false} assume 0 == ~cond; {39361#false} is VALID [2022-04-28 03:48:33,992 INFO L290 TraceCheckUtils]: 40: Hoare triple {39361#false} ~cond := #in~cond; {39361#false} is VALID [2022-04-28 03:48:33,992 INFO L272 TraceCheckUtils]: 39: Hoare triple {39361#false} call __VERIFIER_assert((if ~x~0 == ~z~0 then 1 else 0)); {39361#false} is VALID [2022-04-28 03:48:33,993 INFO L290 TraceCheckUtils]: 38: Hoare triple {39571#(< main_~z~0 main_~y~0)} assume !(~y~0 > ~z~0); {39361#false} is VALID [2022-04-28 03:48:33,993 INFO L290 TraceCheckUtils]: 37: Hoare triple {39575#(< (+ main_~z~0 1) main_~y~0)} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {39571#(< main_~z~0 main_~y~0)} is VALID [2022-04-28 03:48:33,994 INFO L290 TraceCheckUtils]: 36: Hoare triple {39579#(< (+ main_~z~0 2) main_~y~0)} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {39575#(< (+ main_~z~0 1) main_~y~0)} is VALID [2022-04-28 03:48:33,994 INFO L290 TraceCheckUtils]: 35: Hoare triple {39583#(< (+ main_~z~0 3) main_~y~0)} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {39579#(< (+ main_~z~0 2) main_~y~0)} is VALID [2022-04-28 03:48:33,994 INFO L290 TraceCheckUtils]: 34: Hoare triple {39587#(< (+ main_~z~0 4) main_~y~0)} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {39583#(< (+ main_~z~0 3) main_~y~0)} is VALID [2022-04-28 03:48:33,995 INFO L290 TraceCheckUtils]: 33: Hoare triple {39591#(< (+ 5 main_~z~0) main_~y~0)} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {39587#(< (+ main_~z~0 4) main_~y~0)} is VALID [2022-04-28 03:48:33,995 INFO L290 TraceCheckUtils]: 32: Hoare triple {39595#(< (+ main_~z~0 6) main_~y~0)} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {39591#(< (+ 5 main_~z~0) main_~y~0)} is VALID [2022-04-28 03:48:33,996 INFO L290 TraceCheckUtils]: 31: Hoare triple {39599#(< (+ 7 main_~z~0) main_~y~0)} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {39595#(< (+ main_~z~0 6) main_~y~0)} is VALID [2022-04-28 03:48:33,996 INFO L290 TraceCheckUtils]: 30: Hoare triple {39603#(< (+ main_~z~0 8) main_~y~0)} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {39599#(< (+ 7 main_~z~0) main_~y~0)} is VALID [2022-04-28 03:48:33,997 INFO L290 TraceCheckUtils]: 29: Hoare triple {39607#(< (+ main_~z~0 9) main_~y~0)} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {39603#(< (+ main_~z~0 8) main_~y~0)} is VALID [2022-04-28 03:48:33,997 INFO L290 TraceCheckUtils]: 28: Hoare triple {39611#(< (+ main_~z~0 10) main_~y~0)} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {39607#(< (+ main_~z~0 9) main_~y~0)} is VALID [2022-04-28 03:48:33,998 INFO L290 TraceCheckUtils]: 27: Hoare triple {39615#(< (+ main_~z~0 11) main_~y~0)} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {39611#(< (+ main_~z~0 10) main_~y~0)} is VALID [2022-04-28 03:48:33,998 INFO L290 TraceCheckUtils]: 26: Hoare triple {39619#(< (+ main_~z~0 12) main_~y~0)} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {39615#(< (+ main_~z~0 11) main_~y~0)} is VALID [2022-04-28 03:48:33,999 INFO L290 TraceCheckUtils]: 25: Hoare triple {39623#(< (+ main_~z~0 13) main_~y~0)} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {39619#(< (+ main_~z~0 12) main_~y~0)} is VALID [2022-04-28 03:48:33,999 INFO L290 TraceCheckUtils]: 24: Hoare triple {39627#(< (+ main_~z~0 14) main_~y~0)} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {39623#(< (+ main_~z~0 13) main_~y~0)} is VALID [2022-04-28 03:48:34,000 INFO L290 TraceCheckUtils]: 23: Hoare triple {39631#(< (+ main_~z~0 15) main_~y~0)} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {39627#(< (+ main_~z~0 14) main_~y~0)} is VALID [2022-04-28 03:48:34,000 INFO L290 TraceCheckUtils]: 22: Hoare triple {39635#(< (+ main_~z~0 16) main_~y~0)} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {39631#(< (+ main_~z~0 15) main_~y~0)} is VALID [2022-04-28 03:48:34,001 INFO L290 TraceCheckUtils]: 21: Hoare triple {39639#(< (+ main_~z~0 17) main_~y~0)} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {39635#(< (+ main_~z~0 16) main_~y~0)} is VALID [2022-04-28 03:48:34,001 INFO L290 TraceCheckUtils]: 20: Hoare triple {39643#(< (+ main_~z~0 18) main_~y~0)} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {39639#(< (+ main_~z~0 17) main_~y~0)} is VALID [2022-04-28 03:48:34,001 INFO L290 TraceCheckUtils]: 19: Hoare triple {39647#(< (+ 19 main_~z~0) main_~y~0)} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {39643#(< (+ main_~z~0 18) main_~y~0)} is VALID [2022-04-28 03:48:34,002 INFO L290 TraceCheckUtils]: 18: Hoare triple {39651#(< (+ main_~z~0 20) main_~y~0)} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {39647#(< (+ 19 main_~z~0) main_~y~0)} is VALID [2022-04-28 03:48:34,002 INFO L290 TraceCheckUtils]: 17: Hoare triple {39655#(< (+ main_~z~0 21) main_~y~0)} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {39651#(< (+ main_~z~0 20) main_~y~0)} is VALID [2022-04-28 03:48:34,003 INFO L290 TraceCheckUtils]: 16: Hoare triple {39659#(< (+ main_~z~0 22) main_~y~0)} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {39655#(< (+ main_~z~0 21) main_~y~0)} is VALID [2022-04-28 03:48:34,003 INFO L290 TraceCheckUtils]: 15: Hoare triple {39663#(< (+ 23 main_~z~0) main_~y~0)} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {39659#(< (+ main_~z~0 22) main_~y~0)} is VALID [2022-04-28 03:48:34,004 INFO L290 TraceCheckUtils]: 14: Hoare triple {39667#(< (+ main_~z~0 24) main_~y~0)} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {39663#(< (+ 23 main_~z~0) main_~y~0)} is VALID [2022-04-28 03:48:34,004 INFO L290 TraceCheckUtils]: 13: Hoare triple {39671#(< (+ main_~z~0 25) main_~y~0)} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {39667#(< (+ main_~z~0 24) main_~y~0)} is VALID [2022-04-28 03:48:34,005 INFO L290 TraceCheckUtils]: 12: Hoare triple {39675#(< (+ main_~z~0 26) main_~y~0)} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {39671#(< (+ main_~z~0 25) main_~y~0)} is VALID [2022-04-28 03:48:34,005 INFO L290 TraceCheckUtils]: 11: Hoare triple {39679#(< (+ main_~z~0 27) main_~y~0)} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {39675#(< (+ main_~z~0 26) main_~y~0)} is VALID [2022-04-28 03:48:34,006 INFO L290 TraceCheckUtils]: 10: Hoare triple {39683#(< (+ main_~z~0 28) main_~y~0)} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {39679#(< (+ main_~z~0 27) main_~y~0)} is VALID [2022-04-28 03:48:34,006 INFO L290 TraceCheckUtils]: 9: Hoare triple {39687#(or (< main_~x~0 1000000) (< (+ main_~z~0 28) main_~y~0))} [195] L18-1_primed-->L18-1: Formula: (not (< v_main_~x~0_11 1000000)) InVars {main_~x~0=v_main_~x~0_11} OutVars{main_~x~0=v_main_~x~0_11} AuxVars[] AssignedVars[] {39683#(< (+ main_~z~0 28) main_~y~0)} is VALID [2022-04-28 03:48:34,007 INFO L290 TraceCheckUtils]: 8: Hoare triple {39691#(and (or (< main_~x~0 1000000) (< (+ main_~z~0 28) main_~y~0)) (or (< (+ main_~z~0 main_~x~0) (+ 999972 main_~y~0)) (<= (+ main_~z~0 28) main_~y~0) (not (<= 50000 main_~x~0))))} [198] L11-2-->L18-1_primed: Formula: (let ((.cse0 (= |v_main_#t~post6_242| |v_main_#t~post6_241|)) (.cse1 (= v_main_~x~0_1852 v_main_~x~0_1851)) (.cse3 (= v_main_~y~0_2002 v_main_~y~0_2001)) (.cse4 (= |v_main_#t~post5_242| |v_main_#t~post5_241|)) (.cse2 (<= 50000 v_main_~x~0_1852))) (or (and .cse0 .cse1 (or (not (< v_main_~x~0_1852 1000000)) (not .cse2)) .cse3 .cse4) (and .cse0 .cse1 .cse3 .cse4) (and (< v_main_~x~0_1851 1000001) (< v_main_~x~0_1852 v_main_~x~0_1851) (= (+ v_main_~x~0_1852 v_main_~y~0_2001) (+ v_main_~x~0_1851 v_main_~y~0_2002)) .cse2))) InVars {main_~y~0=v_main_~y~0_2002, main_#t~post5=|v_main_#t~post5_242|, main_~x~0=v_main_~x~0_1852, main_#t~post6=|v_main_#t~post6_242|} OutVars{main_~y~0=v_main_~y~0_2001, main_#t~post5=|v_main_#t~post5_241|, main_~x~0=v_main_~x~0_1851, main_#t~post6=|v_main_#t~post6_241|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {39687#(or (< main_~x~0 1000000) (< (+ main_~z~0 28) main_~y~0))} is VALID [2022-04-28 03:48:34,007 INFO L290 TraceCheckUtils]: 7: Hoare triple {39691#(and (or (< main_~x~0 1000000) (< (+ main_~z~0 28) main_~y~0)) (or (< (+ main_~z~0 main_~x~0) (+ 999972 main_~y~0)) (<= (+ main_~z~0 28) main_~y~0) (not (<= 50000 main_~x~0))))} [197] L18-1_primed-->L11-2: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {39691#(and (or (< main_~x~0 1000000) (< (+ main_~z~0 28) main_~y~0)) (or (< (+ main_~z~0 main_~x~0) (+ 999972 main_~y~0)) (<= (+ main_~z~0 28) main_~y~0) (not (<= 50000 main_~x~0))))} is VALID [2022-04-28 03:48:34,008 INFO L290 TraceCheckUtils]: 6: Hoare triple {39698#(and (or (< (+ main_~z~0 main_~x~0) (+ 999972 main_~y~0)) (<= (+ main_~z~0 28) main_~y~0)) (or (< main_~x~0 1000000) (< (+ main_~z~0 28) main_~y~0)) (<= main_~z~0 (+ main_~y~0 949971)))} [196] L11-2-->L18-1_primed: Formula: (let ((.cse0 (= |v_main_#t~post4_216| |v_main_#t~post4_215|))) (or (and .cse0 (= v_main_~x~0_1850 v_main_~x~0_1849)) (and .cse0 (not (< v_main_~x~0_1850 50000)) (= v_main_~x~0_1849 v_main_~x~0_1850)) (and (< v_main_~x~0_1850 v_main_~x~0_1849) (< v_main_~x~0_1849 50001)))) InVars {main_~x~0=v_main_~x~0_1850, main_#t~post4=|v_main_#t~post4_216|} OutVars{main_~x~0=v_main_~x~0_1849, main_#t~post4=|v_main_#t~post4_215|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {39691#(and (or (< main_~x~0 1000000) (< (+ main_~z~0 28) main_~y~0)) (or (< (+ main_~z~0 main_~x~0) (+ 999972 main_~y~0)) (<= (+ main_~z~0 28) main_~y~0) (not (<= 50000 main_~x~0))))} is VALID [2022-04-28 03:48:34,009 INFO L290 TraceCheckUtils]: 5: Hoare triple {39360#true} ~x~0 := 0;~y~0 := 50000;~z~0 := 0;~x~0 := 0; {39698#(and (or (< (+ main_~z~0 main_~x~0) (+ 999972 main_~y~0)) (<= (+ main_~z~0 28) main_~y~0)) (or (< main_~x~0 1000000) (< (+ main_~z~0 28) main_~y~0)) (<= main_~z~0 (+ main_~y~0 949971)))} is VALID [2022-04-28 03:48:34,009 INFO L272 TraceCheckUtils]: 4: Hoare triple {39360#true} call #t~ret9 := main(); {39360#true} is VALID [2022-04-28 03:48:34,009 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {39360#true} {39360#true} #52#return; {39360#true} is VALID [2022-04-28 03:48:34,009 INFO L290 TraceCheckUtils]: 2: Hoare triple {39360#true} assume true; {39360#true} is VALID [2022-04-28 03:48:34,009 INFO L290 TraceCheckUtils]: 1: Hoare triple {39360#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(17, 2);call #Ultimate.allocInit(12, 3); {39360#true} is VALID [2022-04-28 03:48:34,009 INFO L272 TraceCheckUtils]: 0: Hoare triple {39360#true} call ULTIMATE.init(); {39360#true} is VALID [2022-04-28 03:48:34,009 INFO L134 CoverageAnalysis]: Checked inductivity of 408 backedges. 0 proven. 408 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 03:48:34,009 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2015194681] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 03:48:34,009 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 03:48:34,010 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [35, 34, 34] total 99 [2022-04-28 03:48:36,937 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 03:48:36,938 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [496255580] [2022-04-28 03:48:36,938 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [496255580] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 03:48:36,938 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 03:48:36,938 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [82] imperfect sequences [] total 82 [2022-04-28 03:48:36,938 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1540747804] [2022-04-28 03:48:36,938 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 03:48:36,938 INFO L78 Accepts]: Start accepts. Automaton has has 82 states, 82 states have (on average 1.6341463414634145) internal successors, (134), 81 states have internal predecessors, (134), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 138 [2022-04-28 03:48:36,939 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 03:48:36,939 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 82 states, 82 states have (on average 1.6341463414634145) internal successors, (134), 81 states have internal predecessors, (134), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:48:37,040 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 138 edges. 138 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 03:48:37,040 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 82 states [2022-04-28 03:48:37,041 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 03:48:37,041 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 82 interpolants. [2022-04-28 03:48:37,043 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6319, Invalid=15733, Unknown=0, NotChecked=0, Total=22052 [2022-04-28 03:48:37,043 INFO L87 Difference]: Start difference. First operand 139 states and 142 transitions. Second operand has 82 states, 82 states have (on average 1.6341463414634145) internal successors, (134), 81 states have internal predecessors, (134), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:48:49,295 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:48:49,295 INFO L93 Difference]: Finished difference Result 369 states and 380 transitions. [2022-04-28 03:48:49,295 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 82 states. [2022-04-28 03:48:49,295 INFO L78 Accepts]: Start accepts. Automaton has has 82 states, 82 states have (on average 1.6341463414634145) internal successors, (134), 81 states have internal predecessors, (134), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 138 [2022-04-28 03:48:49,295 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 03:48:49,296 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 82 states, 82 states have (on average 1.6341463414634145) internal successors, (134), 81 states have internal predecessors, (134), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:48:49,297 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 160 transitions. [2022-04-28 03:48:49,297 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 82 states, 82 states have (on average 1.6341463414634145) internal successors, (134), 81 states have internal predecessors, (134), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:48:49,298 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 160 transitions. [2022-04-28 03:48:49,298 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 82 states and 160 transitions. [2022-04-28 03:48:49,425 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 160 edges. 160 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 03:48:49,428 INFO L225 Difference]: With dead ends: 369 [2022-04-28 03:48:49,428 INFO L226 Difference]: Without dead ends: 238 [2022-04-28 03:48:49,431 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 304 GetRequests, 76 SyntacticMatches, 2 SemanticMatches, 226 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15454 ImplicationChecksByTransitivity, 8.9s TimeCoverageRelationStatistics Valid=12540, Invalid=39216, Unknown=0, NotChecked=0, Total=51756 [2022-04-28 03:48:49,431 INFO L413 NwaCegarLoop]: 12 mSDtfsCounter, 367 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 5124 mSolverCounterSat, 394 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 367 SdHoareTripleChecker+Valid, 24 SdHoareTripleChecker+Invalid, 5518 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 394 IncrementalHoareTripleChecker+Valid, 5124 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.2s IncrementalHoareTripleChecker+Time [2022-04-28 03:48:49,431 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [367 Valid, 24 Invalid, 5518 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [394 Valid, 5124 Invalid, 0 Unknown, 0 Unchecked, 4.2s Time] [2022-04-28 03:48:49,432 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 238 states. [2022-04-28 03:48:49,976 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 238 to 238. [2022-04-28 03:48:49,977 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 03:48:49,977 INFO L82 GeneralOperation]: Start isEquivalent. First operand 238 states. Second operand has 238 states, 233 states have (on average 1.0214592274678111) internal successors, (238), 233 states have internal predecessors, (238), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:48:49,977 INFO L74 IsIncluded]: Start isIncluded. First operand 238 states. Second operand has 238 states, 233 states have (on average 1.0214592274678111) internal successors, (238), 233 states have internal predecessors, (238), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:48:49,977 INFO L87 Difference]: Start difference. First operand 238 states. Second operand has 238 states, 233 states have (on average 1.0214592274678111) internal successors, (238), 233 states have internal predecessors, (238), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:48:49,980 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:48:49,980 INFO L93 Difference]: Finished difference Result 238 states and 242 transitions. [2022-04-28 03:48:49,980 INFO L276 IsEmpty]: Start isEmpty. Operand 238 states and 242 transitions. [2022-04-28 03:48:49,980 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:48:49,980 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:48:49,980 INFO L74 IsIncluded]: Start isIncluded. First operand has 238 states, 233 states have (on average 1.0214592274678111) internal successors, (238), 233 states have internal predecessors, (238), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 238 states. [2022-04-28 03:48:49,980 INFO L87 Difference]: Start difference. First operand has 238 states, 233 states have (on average 1.0214592274678111) internal successors, (238), 233 states have internal predecessors, (238), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 238 states. [2022-04-28 03:48:49,983 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:48:49,983 INFO L93 Difference]: Finished difference Result 238 states and 242 transitions. [2022-04-28 03:48:49,983 INFO L276 IsEmpty]: Start isEmpty. Operand 238 states and 242 transitions. [2022-04-28 03:48:49,983 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:48:49,983 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:48:49,983 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 03:48:49,983 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 03:48:49,983 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 238 states, 233 states have (on average 1.0214592274678111) internal successors, (238), 233 states have internal predecessors, (238), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:48:49,986 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 238 states to 238 states and 242 transitions. [2022-04-28 03:48:49,986 INFO L78 Accepts]: Start accepts. Automaton has 238 states and 242 transitions. Word has length 138 [2022-04-28 03:48:49,986 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 03:48:49,986 INFO L495 AbstractCegarLoop]: Abstraction has 238 states and 242 transitions. [2022-04-28 03:48:49,986 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 82 states, 82 states have (on average 1.6341463414634145) internal successors, (134), 81 states have internal predecessors, (134), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:48:49,986 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 238 states and 242 transitions. [2022-04-28 03:48:50,219 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 242 edges. 242 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 03:48:50,219 INFO L276 IsEmpty]: Start isEmpty. Operand 238 states and 242 transitions. [2022-04-28 03:48:50,219 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2022-04-28 03:48:50,219 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 03:48:50,220 INFO L195 NwaCegarLoop]: trace histogram [50, 49, 29, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 03:48:50,235 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (36)] Forceful destruction successful, exit code 0 [2022-04-28 03:48:50,420 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 36 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable37 [2022-04-28 03:48:50,420 INFO L420 AbstractCegarLoop]: === Iteration 39 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 03:48:50,420 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 03:48:50,420 INFO L85 PathProgramCache]: Analyzing trace with hash -1589924332, now seen corresponding path program 36 times [2022-04-28 03:48:50,420 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 03:48:50,420 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [189769459] [2022-04-28 03:48:54,485 WARN L977 rdanLoopAcceleration]: Unable to prove correctness of quantifier elimination. [2022-04-28 03:48:54,533 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 1 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 03:48:54,727 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={1=1, 2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 03:48:54,728 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-28 03:48:54,730 INFO L85 PathProgramCache]: Analyzing trace with hash -464288830, now seen corresponding path program 1 times [2022-04-28 03:48:54,731 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 03:48:54,731 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [144688443] [2022-04-28 03:48:54,731 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:48:54,731 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 03:48:54,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:48:55,385 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 03:48:55,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:48:55,393 INFO L290 TraceCheckUtils]: 0: Hoare triple {41655#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(17, 2);call #Ultimate.allocInit(12, 3); {41617#true} is VALID [2022-04-28 03:48:55,393 INFO L290 TraceCheckUtils]: 1: Hoare triple {41617#true} assume true; {41617#true} is VALID [2022-04-28 03:48:55,393 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {41617#true} {41617#true} #52#return; {41617#true} is VALID [2022-04-28 03:48:55,394 INFO L272 TraceCheckUtils]: 0: Hoare triple {41617#true} call ULTIMATE.init(); {41655#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 03:48:55,394 INFO L290 TraceCheckUtils]: 1: Hoare triple {41655#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(17, 2);call #Ultimate.allocInit(12, 3); {41617#true} is VALID [2022-04-28 03:48:55,394 INFO L290 TraceCheckUtils]: 2: Hoare triple {41617#true} assume true; {41617#true} is VALID [2022-04-28 03:48:55,394 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {41617#true} {41617#true} #52#return; {41617#true} is VALID [2022-04-28 03:48:55,394 INFO L272 TraceCheckUtils]: 4: Hoare triple {41617#true} call #t~ret9 := main(); {41617#true} is VALID [2022-04-28 03:48:55,394 INFO L290 TraceCheckUtils]: 5: Hoare triple {41617#true} ~x~0 := 0;~y~0 := 50000;~z~0 := 0;~x~0 := 0; {41622#(and (= main_~z~0 0) (= main_~x~0 0) (<= 50000 main_~y~0))} is VALID [2022-04-28 03:48:55,395 INFO L290 TraceCheckUtils]: 6: Hoare triple {41622#(and (= main_~z~0 0) (= main_~x~0 0) (<= 50000 main_~y~0))} [200] L11-2-->L18-1_primed: Formula: (let ((.cse0 (= |v_main_#t~post4_223| |v_main_#t~post4_222|)) (.cse1 (= v_main_~x~0_1944 v_main_~x~0_1943))) (or (and .cse0 .cse1) (and .cse0 (<= 50000 v_main_~x~0_1944) .cse1) (and (< v_main_~x~0_1943 50001) (< v_main_~x~0_1944 v_main_~x~0_1943)))) InVars {main_~x~0=v_main_~x~0_1944, main_#t~post4=|v_main_#t~post4_223|} OutVars{main_~x~0=v_main_~x~0_1943, main_#t~post4=|v_main_#t~post4_222|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {41623#(and (= main_~z~0 0) (<= main_~x~0 main_~y~0) (<= main_~x~0 50000))} is VALID [2022-04-28 03:48:55,396 INFO L290 TraceCheckUtils]: 7: Hoare triple {41623#(and (= main_~z~0 0) (<= main_~x~0 main_~y~0) (<= main_~x~0 50000))} [201] L18-1_primed-->L11-2: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {41623#(and (= main_~z~0 0) (<= main_~x~0 main_~y~0) (<= main_~x~0 50000))} is VALID [2022-04-28 03:48:55,397 INFO L290 TraceCheckUtils]: 8: Hoare triple {41623#(and (= main_~z~0 0) (<= main_~x~0 main_~y~0) (<= main_~x~0 50000))} [202] L11-2-->L18-1_primed: Formula: (let ((.cse1 (= v_main_~x~0_1946 v_main_~x~0_1945)) (.cse0 (<= 50000 v_main_~x~0_1946)) (.cse2 (= |v_main_#t~post6_249| |v_main_#t~post6_248|)) (.cse3 (= v_main_~y~0_2115 v_main_~y~0_2114)) (.cse4 (= |v_main_#t~post5_249| |v_main_#t~post5_248|))) (or (and (= (+ v_main_~x~0_1945 v_main_~y~0_2115) (+ v_main_~x~0_1946 v_main_~y~0_2114)) .cse0 (< v_main_~x~0_1946 v_main_~x~0_1945) (< v_main_~x~0_1945 1000001)) (and .cse1 .cse2 .cse3 .cse4) (and .cse1 (or (not .cse0) (not (< v_main_~x~0_1946 1000000))) .cse2 .cse3 .cse4))) InVars {main_~y~0=v_main_~y~0_2115, main_#t~post5=|v_main_#t~post5_249|, main_~x~0=v_main_~x~0_1946, main_#t~post6=|v_main_#t~post6_249|} OutVars{main_~y~0=v_main_~y~0_2114, main_#t~post5=|v_main_#t~post5_248|, main_~x~0=v_main_~x~0_1945, main_#t~post6=|v_main_#t~post6_248|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {41624#(and (= main_~z~0 0) (or (<= main_~x~0 main_~y~0) (<= main_~x~0 50000)))} is VALID [2022-04-28 03:48:55,397 INFO L290 TraceCheckUtils]: 9: Hoare triple {41624#(and (= main_~z~0 0) (or (<= main_~x~0 main_~y~0) (<= main_~x~0 50000)))} [199] L18-1_primed-->L18-1: Formula: (not (< v_main_~x~0_11 1000000)) InVars {main_~x~0=v_main_~x~0_11} OutVars{main_~x~0=v_main_~x~0_11} AuxVars[] AssignedVars[] {41625#(and (= main_~z~0 0) (<= 1000000 main_~y~0))} is VALID [2022-04-28 03:48:55,398 INFO L290 TraceCheckUtils]: 10: Hoare triple {41625#(and (= main_~z~0 0) (<= 1000000 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {41626#(and (= main_~z~0 0) (<= 999999 main_~y~0))} is VALID [2022-04-28 03:48:55,399 INFO L290 TraceCheckUtils]: 11: Hoare triple {41626#(and (= main_~z~0 0) (<= 999999 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {41627#(and (= main_~z~0 0) (<= 999998 main_~y~0))} is VALID [2022-04-28 03:48:55,399 INFO L290 TraceCheckUtils]: 12: Hoare triple {41627#(and (= main_~z~0 0) (<= 999998 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {41628#(and (= main_~z~0 0) (<= 999997 main_~y~0))} is VALID [2022-04-28 03:48:55,400 INFO L290 TraceCheckUtils]: 13: Hoare triple {41628#(and (= main_~z~0 0) (<= 999997 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {41629#(and (<= 999996 main_~y~0) (= main_~z~0 0))} is VALID [2022-04-28 03:48:55,400 INFO L290 TraceCheckUtils]: 14: Hoare triple {41629#(and (<= 999996 main_~y~0) (= main_~z~0 0))} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {41630#(and (= main_~z~0 0) (<= 999995 main_~y~0))} is VALID [2022-04-28 03:48:55,401 INFO L290 TraceCheckUtils]: 15: Hoare triple {41630#(and (= main_~z~0 0) (<= 999995 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {41631#(and (= main_~z~0 0) (<= 999994 main_~y~0))} is VALID [2022-04-28 03:48:55,402 INFO L290 TraceCheckUtils]: 16: Hoare triple {41631#(and (= main_~z~0 0) (<= 999994 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {41632#(and (= main_~z~0 0) (<= 999993 main_~y~0))} is VALID [2022-04-28 03:48:55,402 INFO L290 TraceCheckUtils]: 17: Hoare triple {41632#(and (= main_~z~0 0) (<= 999993 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {41633#(and (= main_~z~0 0) (<= 999992 main_~y~0))} is VALID [2022-04-28 03:48:55,403 INFO L290 TraceCheckUtils]: 18: Hoare triple {41633#(and (= main_~z~0 0) (<= 999992 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {41634#(and (= main_~z~0 0) (<= 999991 main_~y~0))} is VALID [2022-04-28 03:48:55,404 INFO L290 TraceCheckUtils]: 19: Hoare triple {41634#(and (= main_~z~0 0) (<= 999991 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {41635#(and (= main_~z~0 0) (<= 999990 main_~y~0))} is VALID [2022-04-28 03:48:55,404 INFO L290 TraceCheckUtils]: 20: Hoare triple {41635#(and (= main_~z~0 0) (<= 999990 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {41636#(and (= main_~z~0 0) (<= 999989 main_~y~0))} is VALID [2022-04-28 03:48:55,405 INFO L290 TraceCheckUtils]: 21: Hoare triple {41636#(and (= main_~z~0 0) (<= 999989 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {41637#(and (= main_~z~0 0) (<= 999988 main_~y~0))} is VALID [2022-04-28 03:48:55,405 INFO L290 TraceCheckUtils]: 22: Hoare triple {41637#(and (= main_~z~0 0) (<= 999988 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {41638#(and (= main_~z~0 0) (<= 999987 main_~y~0))} is VALID [2022-04-28 03:48:55,406 INFO L290 TraceCheckUtils]: 23: Hoare triple {41638#(and (= main_~z~0 0) (<= 999987 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {41639#(and (= main_~z~0 0) (<= 999986 main_~y~0))} is VALID [2022-04-28 03:48:55,407 INFO L290 TraceCheckUtils]: 24: Hoare triple {41639#(and (= main_~z~0 0) (<= 999986 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {41640#(and (= main_~z~0 0) (<= 999985 main_~y~0))} is VALID [2022-04-28 03:48:55,407 INFO L290 TraceCheckUtils]: 25: Hoare triple {41640#(and (= main_~z~0 0) (<= 999985 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {41641#(and (= main_~z~0 0) (<= 999984 main_~y~0))} is VALID [2022-04-28 03:48:55,408 INFO L290 TraceCheckUtils]: 26: Hoare triple {41641#(and (= main_~z~0 0) (<= 999984 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {41642#(and (<= 999983 main_~y~0) (= main_~z~0 0))} is VALID [2022-04-28 03:48:55,409 INFO L290 TraceCheckUtils]: 27: Hoare triple {41642#(and (<= 999983 main_~y~0) (= main_~z~0 0))} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {41643#(and (= main_~z~0 0) (<= 999982 main_~y~0))} is VALID [2022-04-28 03:48:55,409 INFO L290 TraceCheckUtils]: 28: Hoare triple {41643#(and (= main_~z~0 0) (<= 999982 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {41644#(and (= main_~z~0 0) (<= 999981 main_~y~0))} is VALID [2022-04-28 03:48:55,410 INFO L290 TraceCheckUtils]: 29: Hoare triple {41644#(and (= main_~z~0 0) (<= 999981 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {41645#(and (= main_~z~0 0) (<= 999980 main_~y~0))} is VALID [2022-04-28 03:48:55,410 INFO L290 TraceCheckUtils]: 30: Hoare triple {41645#(and (= main_~z~0 0) (<= 999980 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {41646#(and (= main_~z~0 0) (<= 999979 main_~y~0))} is VALID [2022-04-28 03:48:55,411 INFO L290 TraceCheckUtils]: 31: Hoare triple {41646#(and (= main_~z~0 0) (<= 999979 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {41647#(and (= main_~z~0 0) (<= 999978 main_~y~0))} is VALID [2022-04-28 03:48:55,411 INFO L290 TraceCheckUtils]: 32: Hoare triple {41647#(and (= main_~z~0 0) (<= 999978 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {41648#(and (= main_~z~0 0) (<= 999977 main_~y~0))} is VALID [2022-04-28 03:48:55,412 INFO L290 TraceCheckUtils]: 33: Hoare triple {41648#(and (= main_~z~0 0) (<= 999977 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {41649#(and (<= 999976 main_~y~0) (= main_~z~0 0))} is VALID [2022-04-28 03:48:55,412 INFO L290 TraceCheckUtils]: 34: Hoare triple {41649#(and (<= 999976 main_~y~0) (= main_~z~0 0))} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {41650#(and (= main_~z~0 0) (<= 999975 main_~y~0))} is VALID [2022-04-28 03:48:55,413 INFO L290 TraceCheckUtils]: 35: Hoare triple {41650#(and (= main_~z~0 0) (<= 999975 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {41651#(and (= main_~z~0 0) (<= 999974 main_~y~0))} is VALID [2022-04-28 03:48:55,413 INFO L290 TraceCheckUtils]: 36: Hoare triple {41651#(and (= main_~z~0 0) (<= 999974 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {41652#(and (= main_~z~0 0) (<= 999973 main_~y~0))} is VALID [2022-04-28 03:48:55,414 INFO L290 TraceCheckUtils]: 37: Hoare triple {41652#(and (= main_~z~0 0) (<= 999973 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {41653#(and (= main_~z~0 0) (<= 999972 main_~y~0))} is VALID [2022-04-28 03:48:55,414 INFO L290 TraceCheckUtils]: 38: Hoare triple {41653#(and (= main_~z~0 0) (<= 999972 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {41654#(and (= main_~z~0 0) (<= 999971 main_~y~0))} is VALID [2022-04-28 03:48:55,414 INFO L290 TraceCheckUtils]: 39: Hoare triple {41654#(and (= main_~z~0 0) (<= 999971 main_~y~0))} assume !(~y~0 > ~z~0); {41618#false} is VALID [2022-04-28 03:48:55,415 INFO L272 TraceCheckUtils]: 40: Hoare triple {41618#false} call __VERIFIER_assert((if ~x~0 == ~z~0 then 1 else 0)); {41618#false} is VALID [2022-04-28 03:48:55,415 INFO L290 TraceCheckUtils]: 41: Hoare triple {41618#false} ~cond := #in~cond; {41618#false} is VALID [2022-04-28 03:48:55,415 INFO L290 TraceCheckUtils]: 42: Hoare triple {41618#false} assume 0 == ~cond; {41618#false} is VALID [2022-04-28 03:48:55,415 INFO L290 TraceCheckUtils]: 43: Hoare triple {41618#false} assume !false; {41618#false} is VALID [2022-04-28 03:48:55,415 INFO L134 CoverageAnalysis]: Checked inductivity of 437 backedges. 0 proven. 437 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 03:48:55,415 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 03:48:55,415 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [144688443] [2022-04-28 03:48:55,415 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [144688443] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 03:48:55,415 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1021343641] [2022-04-28 03:48:55,415 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:48:55,415 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 03:48:55,415 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 03:48:55,416 INFO L229 MonitoredProcess]: Starting monitored process 37 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 03:48:55,417 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (37)] Waiting until timeout for monitored process [2022-04-28 03:48:55,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:48:55,469 INFO L263 TraceCheckSpWp]: Trace formula consists of 204 conjuncts, 36 conjunts are in the unsatisfiable core [2022-04-28 03:48:55,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:48:55,491 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 03:48:57,222 INFO L272 TraceCheckUtils]: 0: Hoare triple {41617#true} call ULTIMATE.init(); {41617#true} is VALID [2022-04-28 03:48:57,222 INFO L290 TraceCheckUtils]: 1: Hoare triple {41617#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(17, 2);call #Ultimate.allocInit(12, 3); {41617#true} is VALID [2022-04-28 03:48:57,222 INFO L290 TraceCheckUtils]: 2: Hoare triple {41617#true} assume true; {41617#true} is VALID [2022-04-28 03:48:57,222 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {41617#true} {41617#true} #52#return; {41617#true} is VALID [2022-04-28 03:48:57,222 INFO L272 TraceCheckUtils]: 4: Hoare triple {41617#true} call #t~ret9 := main(); {41617#true} is VALID [2022-04-28 03:48:57,223 INFO L290 TraceCheckUtils]: 5: Hoare triple {41617#true} ~x~0 := 0;~y~0 := 50000;~z~0 := 0;~x~0 := 0; {41674#(and (<= main_~z~0 0) (<= main_~x~0 0) (<= 50000 main_~y~0))} is VALID [2022-04-28 03:48:57,223 INFO L290 TraceCheckUtils]: 6: Hoare triple {41674#(and (<= main_~z~0 0) (<= main_~x~0 0) (<= 50000 main_~y~0))} [200] L11-2-->L18-1_primed: Formula: (let ((.cse0 (= |v_main_#t~post4_223| |v_main_#t~post4_222|)) (.cse1 (= v_main_~x~0_1944 v_main_~x~0_1943))) (or (and .cse0 .cse1) (and .cse0 (<= 50000 v_main_~x~0_1944) .cse1) (and (< v_main_~x~0_1943 50001) (< v_main_~x~0_1944 v_main_~x~0_1943)))) InVars {main_~x~0=v_main_~x~0_1944, main_#t~post4=|v_main_#t~post4_223|} OutVars{main_~x~0=v_main_~x~0_1943, main_#t~post4=|v_main_#t~post4_222|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {41678#(and (<= main_~z~0 0) (< main_~x~0 50001) (<= 50000 main_~y~0))} is VALID [2022-04-28 03:48:57,224 INFO L290 TraceCheckUtils]: 7: Hoare triple {41678#(and (<= main_~z~0 0) (< main_~x~0 50001) (<= 50000 main_~y~0))} [201] L18-1_primed-->L11-2: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {41678#(and (<= main_~z~0 0) (< main_~x~0 50001) (<= 50000 main_~y~0))} is VALID [2022-04-28 03:48:57,224 INFO L290 TraceCheckUtils]: 8: Hoare triple {41678#(and (<= main_~z~0 0) (< main_~x~0 50001) (<= 50000 main_~y~0))} [202] L11-2-->L18-1_primed: Formula: (let ((.cse1 (= v_main_~x~0_1946 v_main_~x~0_1945)) (.cse0 (<= 50000 v_main_~x~0_1946)) (.cse2 (= |v_main_#t~post6_249| |v_main_#t~post6_248|)) (.cse3 (= v_main_~y~0_2115 v_main_~y~0_2114)) (.cse4 (= |v_main_#t~post5_249| |v_main_#t~post5_248|))) (or (and (= (+ v_main_~x~0_1945 v_main_~y~0_2115) (+ v_main_~x~0_1946 v_main_~y~0_2114)) .cse0 (< v_main_~x~0_1946 v_main_~x~0_1945) (< v_main_~x~0_1945 1000001)) (and .cse1 .cse2 .cse3 .cse4) (and .cse1 (or (not .cse0) (not (< v_main_~x~0_1946 1000000))) .cse2 .cse3 .cse4))) InVars {main_~y~0=v_main_~y~0_2115, main_#t~post5=|v_main_#t~post5_249|, main_~x~0=v_main_~x~0_1946, main_#t~post6=|v_main_#t~post6_249|} OutVars{main_~y~0=v_main_~y~0_2114, main_#t~post5=|v_main_#t~post5_248|, main_~x~0=v_main_~x~0_1945, main_#t~post6=|v_main_#t~post6_248|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {41685#(and (<= main_~z~0 0) (or (and (< main_~x~0 50001) (<= 50000 main_~y~0)) (and (< main_~x~0 (+ main_~y~0 1)) (< main_~x~0 1000001) (< 50000 main_~x~0))))} is VALID [2022-04-28 03:48:57,225 INFO L290 TraceCheckUtils]: 9: Hoare triple {41685#(and (<= main_~z~0 0) (or (and (< main_~x~0 50001) (<= 50000 main_~y~0)) (and (< main_~x~0 (+ main_~y~0 1)) (< main_~x~0 1000001) (< 50000 main_~x~0))))} [199] L18-1_primed-->L18-1: Formula: (not (< v_main_~x~0_11 1000000)) InVars {main_~x~0=v_main_~x~0_11} OutVars{main_~x~0=v_main_~x~0_11} AuxVars[] AssignedVars[] {41689#(and (<= main_~z~0 0) (< 999999 main_~y~0))} is VALID [2022-04-28 03:48:57,225 INFO L290 TraceCheckUtils]: 10: Hoare triple {41689#(and (<= main_~z~0 0) (< 999999 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {41693#(and (<= main_~z~0 0) (< 999998 main_~y~0))} is VALID [2022-04-28 03:48:57,226 INFO L290 TraceCheckUtils]: 11: Hoare triple {41693#(and (<= main_~z~0 0) (< 999998 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {41697#(and (<= main_~z~0 0) (< 999997 main_~y~0))} is VALID [2022-04-28 03:48:57,226 INFO L290 TraceCheckUtils]: 12: Hoare triple {41697#(and (<= main_~z~0 0) (< 999997 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {41701#(and (<= main_~z~0 0) (< 999996 main_~y~0))} is VALID [2022-04-28 03:48:57,227 INFO L290 TraceCheckUtils]: 13: Hoare triple {41701#(and (<= main_~z~0 0) (< 999996 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {41705#(and (<= main_~z~0 0) (< 999995 main_~y~0))} is VALID [2022-04-28 03:48:57,227 INFO L290 TraceCheckUtils]: 14: Hoare triple {41705#(and (<= main_~z~0 0) (< 999995 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {41709#(and (<= main_~z~0 0) (< 999994 main_~y~0))} is VALID [2022-04-28 03:48:57,228 INFO L290 TraceCheckUtils]: 15: Hoare triple {41709#(and (<= main_~z~0 0) (< 999994 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {41713#(and (<= main_~z~0 0) (< 999993 main_~y~0))} is VALID [2022-04-28 03:48:57,228 INFO L290 TraceCheckUtils]: 16: Hoare triple {41713#(and (<= main_~z~0 0) (< 999993 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {41717#(and (<= main_~z~0 0) (< 999992 main_~y~0))} is VALID [2022-04-28 03:48:57,229 INFO L290 TraceCheckUtils]: 17: Hoare triple {41717#(and (<= main_~z~0 0) (< 999992 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {41721#(and (<= main_~z~0 0) (< 999991 main_~y~0))} is VALID [2022-04-28 03:48:57,229 INFO L290 TraceCheckUtils]: 18: Hoare triple {41721#(and (<= main_~z~0 0) (< 999991 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {41725#(and (<= main_~z~0 0) (< 999990 main_~y~0))} is VALID [2022-04-28 03:48:57,230 INFO L290 TraceCheckUtils]: 19: Hoare triple {41725#(and (<= main_~z~0 0) (< 999990 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {41729#(and (<= main_~z~0 0) (< 999989 main_~y~0))} is VALID [2022-04-28 03:48:57,230 INFO L290 TraceCheckUtils]: 20: Hoare triple {41729#(and (<= main_~z~0 0) (< 999989 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {41733#(and (<= main_~z~0 0) (< 999988 main_~y~0))} is VALID [2022-04-28 03:48:57,231 INFO L290 TraceCheckUtils]: 21: Hoare triple {41733#(and (<= main_~z~0 0) (< 999988 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {41737#(and (<= main_~z~0 0) (< 999987 main_~y~0))} is VALID [2022-04-28 03:48:57,231 INFO L290 TraceCheckUtils]: 22: Hoare triple {41737#(and (<= main_~z~0 0) (< 999987 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {41741#(and (<= main_~z~0 0) (< 999986 main_~y~0))} is VALID [2022-04-28 03:48:57,232 INFO L290 TraceCheckUtils]: 23: Hoare triple {41741#(and (<= main_~z~0 0) (< 999986 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {41745#(and (<= main_~z~0 0) (< 999985 main_~y~0))} is VALID [2022-04-28 03:48:57,232 INFO L290 TraceCheckUtils]: 24: Hoare triple {41745#(and (<= main_~z~0 0) (< 999985 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {41749#(and (<= main_~z~0 0) (< 999984 main_~y~0))} is VALID [2022-04-28 03:48:57,232 INFO L290 TraceCheckUtils]: 25: Hoare triple {41749#(and (<= main_~z~0 0) (< 999984 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {41753#(and (<= main_~z~0 0) (< 999983 main_~y~0))} is VALID [2022-04-28 03:48:57,233 INFO L290 TraceCheckUtils]: 26: Hoare triple {41753#(and (<= main_~z~0 0) (< 999983 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {41757#(and (<= main_~z~0 0) (< 999982 main_~y~0))} is VALID [2022-04-28 03:48:57,233 INFO L290 TraceCheckUtils]: 27: Hoare triple {41757#(and (<= main_~z~0 0) (< 999982 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {41761#(and (<= main_~z~0 0) (< 999981 main_~y~0))} is VALID [2022-04-28 03:48:57,234 INFO L290 TraceCheckUtils]: 28: Hoare triple {41761#(and (<= main_~z~0 0) (< 999981 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {41765#(and (<= main_~z~0 0) (< 999980 main_~y~0))} is VALID [2022-04-28 03:48:57,234 INFO L290 TraceCheckUtils]: 29: Hoare triple {41765#(and (<= main_~z~0 0) (< 999980 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {41769#(and (<= main_~z~0 0) (< 999979 main_~y~0))} is VALID [2022-04-28 03:48:57,235 INFO L290 TraceCheckUtils]: 30: Hoare triple {41769#(and (<= main_~z~0 0) (< 999979 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {41773#(and (<= main_~z~0 0) (< 999978 main_~y~0))} is VALID [2022-04-28 03:48:57,235 INFO L290 TraceCheckUtils]: 31: Hoare triple {41773#(and (<= main_~z~0 0) (< 999978 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {41777#(and (<= main_~z~0 0) (< 999977 main_~y~0))} is VALID [2022-04-28 03:48:57,236 INFO L290 TraceCheckUtils]: 32: Hoare triple {41777#(and (<= main_~z~0 0) (< 999977 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {41781#(and (<= main_~z~0 0) (< 999976 main_~y~0))} is VALID [2022-04-28 03:48:57,236 INFO L290 TraceCheckUtils]: 33: Hoare triple {41781#(and (<= main_~z~0 0) (< 999976 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {41785#(and (<= main_~z~0 0) (< 999975 main_~y~0))} is VALID [2022-04-28 03:48:57,237 INFO L290 TraceCheckUtils]: 34: Hoare triple {41785#(and (<= main_~z~0 0) (< 999975 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {41789#(and (<= main_~z~0 0) (< 999974 main_~y~0))} is VALID [2022-04-28 03:48:57,237 INFO L290 TraceCheckUtils]: 35: Hoare triple {41789#(and (<= main_~z~0 0) (< 999974 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {41793#(and (<= main_~z~0 0) (< 999973 main_~y~0))} is VALID [2022-04-28 03:48:57,238 INFO L290 TraceCheckUtils]: 36: Hoare triple {41793#(and (<= main_~z~0 0) (< 999973 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {41797#(and (<= main_~z~0 0) (< 999972 main_~y~0))} is VALID [2022-04-28 03:48:57,238 INFO L290 TraceCheckUtils]: 37: Hoare triple {41797#(and (<= main_~z~0 0) (< 999972 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {41801#(and (<= main_~z~0 0) (< 999971 main_~y~0))} is VALID [2022-04-28 03:48:57,238 INFO L290 TraceCheckUtils]: 38: Hoare triple {41801#(and (<= main_~z~0 0) (< 999971 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {41805#(and (<= main_~z~0 0) (< 999970 main_~y~0))} is VALID [2022-04-28 03:48:57,239 INFO L290 TraceCheckUtils]: 39: Hoare triple {41805#(and (<= main_~z~0 0) (< 999970 main_~y~0))} assume !(~y~0 > ~z~0); {41618#false} is VALID [2022-04-28 03:48:57,239 INFO L272 TraceCheckUtils]: 40: Hoare triple {41618#false} call __VERIFIER_assert((if ~x~0 == ~z~0 then 1 else 0)); {41618#false} is VALID [2022-04-28 03:48:57,239 INFO L290 TraceCheckUtils]: 41: Hoare triple {41618#false} ~cond := #in~cond; {41618#false} is VALID [2022-04-28 03:48:57,239 INFO L290 TraceCheckUtils]: 42: Hoare triple {41618#false} assume 0 == ~cond; {41618#false} is VALID [2022-04-28 03:48:57,239 INFO L290 TraceCheckUtils]: 43: Hoare triple {41618#false} assume !false; {41618#false} is VALID [2022-04-28 03:48:57,239 INFO L134 CoverageAnalysis]: Checked inductivity of 437 backedges. 0 proven. 437 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 03:48:57,239 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 03:48:59,930 INFO L290 TraceCheckUtils]: 43: Hoare triple {41618#false} assume !false; {41618#false} is VALID [2022-04-28 03:48:59,930 INFO L290 TraceCheckUtils]: 42: Hoare triple {41618#false} assume 0 == ~cond; {41618#false} is VALID [2022-04-28 03:48:59,930 INFO L290 TraceCheckUtils]: 41: Hoare triple {41618#false} ~cond := #in~cond; {41618#false} is VALID [2022-04-28 03:48:59,930 INFO L272 TraceCheckUtils]: 40: Hoare triple {41618#false} call __VERIFIER_assert((if ~x~0 == ~z~0 then 1 else 0)); {41618#false} is VALID [2022-04-28 03:48:59,930 INFO L290 TraceCheckUtils]: 39: Hoare triple {41833#(< main_~z~0 main_~y~0)} assume !(~y~0 > ~z~0); {41618#false} is VALID [2022-04-28 03:48:59,931 INFO L290 TraceCheckUtils]: 38: Hoare triple {41837#(< (+ main_~z~0 1) main_~y~0)} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {41833#(< main_~z~0 main_~y~0)} is VALID [2022-04-28 03:48:59,931 INFO L290 TraceCheckUtils]: 37: Hoare triple {41841#(< (+ main_~z~0 2) main_~y~0)} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {41837#(< (+ main_~z~0 1) main_~y~0)} is VALID [2022-04-28 03:48:59,932 INFO L290 TraceCheckUtils]: 36: Hoare triple {41845#(< (+ main_~z~0 3) main_~y~0)} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {41841#(< (+ main_~z~0 2) main_~y~0)} is VALID [2022-04-28 03:48:59,932 INFO L290 TraceCheckUtils]: 35: Hoare triple {41849#(< (+ main_~z~0 4) main_~y~0)} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {41845#(< (+ main_~z~0 3) main_~y~0)} is VALID [2022-04-28 03:48:59,933 INFO L290 TraceCheckUtils]: 34: Hoare triple {41853#(< (+ 5 main_~z~0) main_~y~0)} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {41849#(< (+ main_~z~0 4) main_~y~0)} is VALID [2022-04-28 03:48:59,933 INFO L290 TraceCheckUtils]: 33: Hoare triple {41857#(< (+ main_~z~0 6) main_~y~0)} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {41853#(< (+ 5 main_~z~0) main_~y~0)} is VALID [2022-04-28 03:48:59,934 INFO L290 TraceCheckUtils]: 32: Hoare triple {41861#(< (+ 7 main_~z~0) main_~y~0)} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {41857#(< (+ main_~z~0 6) main_~y~0)} is VALID [2022-04-28 03:48:59,934 INFO L290 TraceCheckUtils]: 31: Hoare triple {41865#(< (+ main_~z~0 8) main_~y~0)} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {41861#(< (+ 7 main_~z~0) main_~y~0)} is VALID [2022-04-28 03:48:59,935 INFO L290 TraceCheckUtils]: 30: Hoare triple {41869#(< (+ main_~z~0 9) main_~y~0)} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {41865#(< (+ main_~z~0 8) main_~y~0)} is VALID [2022-04-28 03:48:59,935 INFO L290 TraceCheckUtils]: 29: Hoare triple {41873#(< (+ main_~z~0 10) main_~y~0)} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {41869#(< (+ main_~z~0 9) main_~y~0)} is VALID [2022-04-28 03:48:59,935 INFO L290 TraceCheckUtils]: 28: Hoare triple {41877#(< (+ main_~z~0 11) main_~y~0)} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {41873#(< (+ main_~z~0 10) main_~y~0)} is VALID [2022-04-28 03:48:59,936 INFO L290 TraceCheckUtils]: 27: Hoare triple {41881#(< (+ main_~z~0 12) main_~y~0)} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {41877#(< (+ main_~z~0 11) main_~y~0)} is VALID [2022-04-28 03:48:59,936 INFO L290 TraceCheckUtils]: 26: Hoare triple {41885#(< (+ main_~z~0 13) main_~y~0)} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {41881#(< (+ main_~z~0 12) main_~y~0)} is VALID [2022-04-28 03:48:59,937 INFO L290 TraceCheckUtils]: 25: Hoare triple {41889#(< (+ main_~z~0 14) main_~y~0)} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {41885#(< (+ main_~z~0 13) main_~y~0)} is VALID [2022-04-28 03:48:59,937 INFO L290 TraceCheckUtils]: 24: Hoare triple {41893#(< (+ main_~z~0 15) main_~y~0)} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {41889#(< (+ main_~z~0 14) main_~y~0)} is VALID [2022-04-28 03:48:59,938 INFO L290 TraceCheckUtils]: 23: Hoare triple {41897#(< (+ main_~z~0 16) main_~y~0)} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {41893#(< (+ main_~z~0 15) main_~y~0)} is VALID [2022-04-28 03:48:59,938 INFO L290 TraceCheckUtils]: 22: Hoare triple {41901#(< (+ main_~z~0 17) main_~y~0)} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {41897#(< (+ main_~z~0 16) main_~y~0)} is VALID [2022-04-28 03:48:59,939 INFO L290 TraceCheckUtils]: 21: Hoare triple {41905#(< (+ main_~z~0 18) main_~y~0)} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {41901#(< (+ main_~z~0 17) main_~y~0)} is VALID [2022-04-28 03:48:59,939 INFO L290 TraceCheckUtils]: 20: Hoare triple {41909#(< (+ 19 main_~z~0) main_~y~0)} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {41905#(< (+ main_~z~0 18) main_~y~0)} is VALID [2022-04-28 03:48:59,940 INFO L290 TraceCheckUtils]: 19: Hoare triple {41913#(< (+ main_~z~0 20) main_~y~0)} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {41909#(< (+ 19 main_~z~0) main_~y~0)} is VALID [2022-04-28 03:48:59,940 INFO L290 TraceCheckUtils]: 18: Hoare triple {41917#(< (+ main_~z~0 21) main_~y~0)} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {41913#(< (+ main_~z~0 20) main_~y~0)} is VALID [2022-04-28 03:48:59,941 INFO L290 TraceCheckUtils]: 17: Hoare triple {41921#(< (+ main_~z~0 22) main_~y~0)} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {41917#(< (+ main_~z~0 21) main_~y~0)} is VALID [2022-04-28 03:48:59,941 INFO L290 TraceCheckUtils]: 16: Hoare triple {41925#(< (+ 23 main_~z~0) main_~y~0)} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {41921#(< (+ main_~z~0 22) main_~y~0)} is VALID [2022-04-28 03:48:59,941 INFO L290 TraceCheckUtils]: 15: Hoare triple {41929#(< (+ main_~z~0 24) main_~y~0)} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {41925#(< (+ 23 main_~z~0) main_~y~0)} is VALID [2022-04-28 03:48:59,942 INFO L290 TraceCheckUtils]: 14: Hoare triple {41933#(< (+ main_~z~0 25) main_~y~0)} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {41929#(< (+ main_~z~0 24) main_~y~0)} is VALID [2022-04-28 03:48:59,942 INFO L290 TraceCheckUtils]: 13: Hoare triple {41937#(< (+ main_~z~0 26) main_~y~0)} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {41933#(< (+ main_~z~0 25) main_~y~0)} is VALID [2022-04-28 03:48:59,943 INFO L290 TraceCheckUtils]: 12: Hoare triple {41941#(< (+ main_~z~0 27) main_~y~0)} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {41937#(< (+ main_~z~0 26) main_~y~0)} is VALID [2022-04-28 03:48:59,943 INFO L290 TraceCheckUtils]: 11: Hoare triple {41945#(< (+ main_~z~0 28) main_~y~0)} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {41941#(< (+ main_~z~0 27) main_~y~0)} is VALID [2022-04-28 03:48:59,944 INFO L290 TraceCheckUtils]: 10: Hoare triple {41949#(< (+ 29 main_~z~0) main_~y~0)} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {41945#(< (+ main_~z~0 28) main_~y~0)} is VALID [2022-04-28 03:48:59,944 INFO L290 TraceCheckUtils]: 9: Hoare triple {41953#(or (< main_~x~0 1000000) (< (+ 29 main_~z~0) main_~y~0))} [199] L18-1_primed-->L18-1: Formula: (not (< v_main_~x~0_11 1000000)) InVars {main_~x~0=v_main_~x~0_11} OutVars{main_~x~0=v_main_~x~0_11} AuxVars[] AssignedVars[] {41949#(< (+ 29 main_~z~0) main_~y~0)} is VALID [2022-04-28 03:48:59,945 INFO L290 TraceCheckUtils]: 8: Hoare triple {41957#(and (or (<= 1000000 main_~x~0) (< (+ main_~z~0 main_~x~0) (+ main_~y~0 999971)) (not (<= 50000 main_~x~0))) (or (< main_~x~0 1000000) (< (+ 29 main_~z~0) main_~y~0)))} [202] L11-2-->L18-1_primed: Formula: (let ((.cse1 (= v_main_~x~0_1946 v_main_~x~0_1945)) (.cse0 (<= 50000 v_main_~x~0_1946)) (.cse2 (= |v_main_#t~post6_249| |v_main_#t~post6_248|)) (.cse3 (= v_main_~y~0_2115 v_main_~y~0_2114)) (.cse4 (= |v_main_#t~post5_249| |v_main_#t~post5_248|))) (or (and (= (+ v_main_~x~0_1945 v_main_~y~0_2115) (+ v_main_~x~0_1946 v_main_~y~0_2114)) .cse0 (< v_main_~x~0_1946 v_main_~x~0_1945) (< v_main_~x~0_1945 1000001)) (and .cse1 .cse2 .cse3 .cse4) (and .cse1 (or (not .cse0) (not (< v_main_~x~0_1946 1000000))) .cse2 .cse3 .cse4))) InVars {main_~y~0=v_main_~y~0_2115, main_#t~post5=|v_main_#t~post5_249|, main_~x~0=v_main_~x~0_1946, main_#t~post6=|v_main_#t~post6_249|} OutVars{main_~y~0=v_main_~y~0_2114, main_#t~post5=|v_main_#t~post5_248|, main_~x~0=v_main_~x~0_1945, main_#t~post6=|v_main_#t~post6_248|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {41953#(or (< main_~x~0 1000000) (< (+ 29 main_~z~0) main_~y~0))} is VALID [2022-04-28 03:48:59,945 INFO L290 TraceCheckUtils]: 7: Hoare triple {41957#(and (or (<= 1000000 main_~x~0) (< (+ main_~z~0 main_~x~0) (+ main_~y~0 999971)) (not (<= 50000 main_~x~0))) (or (< main_~x~0 1000000) (< (+ 29 main_~z~0) main_~y~0)))} [201] L18-1_primed-->L11-2: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {41957#(and (or (<= 1000000 main_~x~0) (< (+ main_~z~0 main_~x~0) (+ main_~y~0 999971)) (not (<= 50000 main_~x~0))) (or (< main_~x~0 1000000) (< (+ 29 main_~z~0) main_~y~0)))} is VALID [2022-04-28 03:48:59,946 INFO L290 TraceCheckUtils]: 6: Hoare triple {41964#(and (or (<= 1000000 main_~x~0) (< (+ main_~z~0 main_~x~0) (+ main_~y~0 999971))) (<= main_~z~0 (+ main_~y~0 949970)) (or (< main_~x~0 1000000) (< (+ 29 main_~z~0) main_~y~0)))} [200] L11-2-->L18-1_primed: Formula: (let ((.cse0 (= |v_main_#t~post4_223| |v_main_#t~post4_222|)) (.cse1 (= v_main_~x~0_1944 v_main_~x~0_1943))) (or (and .cse0 .cse1) (and .cse0 (<= 50000 v_main_~x~0_1944) .cse1) (and (< v_main_~x~0_1943 50001) (< v_main_~x~0_1944 v_main_~x~0_1943)))) InVars {main_~x~0=v_main_~x~0_1944, main_#t~post4=|v_main_#t~post4_223|} OutVars{main_~x~0=v_main_~x~0_1943, main_#t~post4=|v_main_#t~post4_222|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {41957#(and (or (<= 1000000 main_~x~0) (< (+ main_~z~0 main_~x~0) (+ main_~y~0 999971)) (not (<= 50000 main_~x~0))) (or (< main_~x~0 1000000) (< (+ 29 main_~z~0) main_~y~0)))} is VALID [2022-04-28 03:48:59,946 INFO L290 TraceCheckUtils]: 5: Hoare triple {41617#true} ~x~0 := 0;~y~0 := 50000;~z~0 := 0;~x~0 := 0; {41964#(and (or (<= 1000000 main_~x~0) (< (+ main_~z~0 main_~x~0) (+ main_~y~0 999971))) (<= main_~z~0 (+ main_~y~0 949970)) (or (< main_~x~0 1000000) (< (+ 29 main_~z~0) main_~y~0)))} is VALID [2022-04-28 03:48:59,947 INFO L272 TraceCheckUtils]: 4: Hoare triple {41617#true} call #t~ret9 := main(); {41617#true} is VALID [2022-04-28 03:48:59,947 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {41617#true} {41617#true} #52#return; {41617#true} is VALID [2022-04-28 03:48:59,947 INFO L290 TraceCheckUtils]: 2: Hoare triple {41617#true} assume true; {41617#true} is VALID [2022-04-28 03:48:59,947 INFO L290 TraceCheckUtils]: 1: Hoare triple {41617#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(17, 2);call #Ultimate.allocInit(12, 3); {41617#true} is VALID [2022-04-28 03:48:59,947 INFO L272 TraceCheckUtils]: 0: Hoare triple {41617#true} call ULTIMATE.init(); {41617#true} is VALID [2022-04-28 03:48:59,947 INFO L134 CoverageAnalysis]: Checked inductivity of 437 backedges. 0 proven. 437 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 03:48:59,947 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1021343641] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 03:48:59,947 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 03:48:59,948 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [36, 35, 35] total 102 [2022-04-28 03:49:03,509 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 03:49:03,509 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [189769459] [2022-04-28 03:49:03,509 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [189769459] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 03:49:03,509 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 03:49:03,509 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [84] imperfect sequences [] total 84 [2022-04-28 03:49:03,509 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1691392000] [2022-04-28 03:49:03,509 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 03:49:03,510 INFO L78 Accepts]: Start accepts. Automaton has has 84 states, 84 states have (on average 1.630952380952381) internal successors, (137), 83 states have internal predecessors, (137), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 141 [2022-04-28 03:49:03,510 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 03:49:03,510 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 84 states, 84 states have (on average 1.630952380952381) internal successors, (137), 83 states have internal predecessors, (137), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:49:03,613 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 141 edges. 141 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 03:49:03,614 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 84 states [2022-04-28 03:49:03,614 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 03:49:03,614 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 84 interpolants. [2022-04-28 03:49:03,615 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5994, Invalid=17262, Unknown=0, NotChecked=0, Total=23256 [2022-04-28 03:49:03,615 INFO L87 Difference]: Start difference. First operand 238 states and 242 transitions. Second operand has 84 states, 84 states have (on average 1.630952380952381) internal successors, (137), 83 states have internal predecessors, (137), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:49:15,878 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:49:15,878 INFO L93 Difference]: Finished difference Result 372 states and 381 transitions. [2022-04-28 03:49:15,878 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 54 states. [2022-04-28 03:49:15,879 INFO L78 Accepts]: Start accepts. Automaton has has 84 states, 84 states have (on average 1.630952380952381) internal successors, (137), 83 states have internal predecessors, (137), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 141 [2022-04-28 03:49:15,879 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 03:49:15,879 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 84 states, 84 states have (on average 1.630952380952381) internal successors, (137), 83 states have internal predecessors, (137), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:49:15,879 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 131 transitions. [2022-04-28 03:49:15,880 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 84 states, 84 states have (on average 1.630952380952381) internal successors, (137), 83 states have internal predecessors, (137), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:49:15,880 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 131 transitions. [2022-04-28 03:49:15,880 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 54 states and 131 transitions. [2022-04-28 03:49:15,985 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 131 edges. 131 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 03:49:15,988 INFO L225 Difference]: With dead ends: 372 [2022-04-28 03:49:15,988 INFO L226 Difference]: Without dead ends: 240 [2022-04-28 03:49:15,990 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 281 GetRequests, 77 SyntacticMatches, 2 SemanticMatches, 202 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9140 ImplicationChecksByTransitivity, 9.5s TimeCoverageRelationStatistics Valid=7989, Invalid=33423, Unknown=0, NotChecked=0, Total=41412 [2022-04-28 03:49:15,991 INFO L413 NwaCegarLoop]: 13 mSDtfsCounter, 61 mSDsluCounter, 272 mSDsCounter, 0 mSdLazyCounter, 5998 mSolverCounterSat, 56 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 61 SdHoareTripleChecker+Valid, 285 SdHoareTripleChecker+Invalid, 6054 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 56 IncrementalHoareTripleChecker+Valid, 5998 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.6s IncrementalHoareTripleChecker+Time [2022-04-28 03:49:15,992 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [61 Valid, 285 Invalid, 6054 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [56 Valid, 5998 Invalid, 0 Unknown, 0 Unchecked, 4.6s Time] [2022-04-28 03:49:15,992 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 240 states. [2022-04-28 03:49:16,537 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 240 to 240. [2022-04-28 03:49:16,538 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 03:49:16,538 INFO L82 GeneralOperation]: Start isEquivalent. First operand 240 states. Second operand has 240 states, 235 states have (on average 1.0212765957446808) internal successors, (240), 235 states have internal predecessors, (240), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:49:16,538 INFO L74 IsIncluded]: Start isIncluded. First operand 240 states. Second operand has 240 states, 235 states have (on average 1.0212765957446808) internal successors, (240), 235 states have internal predecessors, (240), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:49:16,538 INFO L87 Difference]: Start difference. First operand 240 states. Second operand has 240 states, 235 states have (on average 1.0212765957446808) internal successors, (240), 235 states have internal predecessors, (240), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:49:16,541 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:49:16,541 INFO L93 Difference]: Finished difference Result 240 states and 244 transitions. [2022-04-28 03:49:16,541 INFO L276 IsEmpty]: Start isEmpty. Operand 240 states and 244 transitions. [2022-04-28 03:49:16,541 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:49:16,541 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:49:16,541 INFO L74 IsIncluded]: Start isIncluded. First operand has 240 states, 235 states have (on average 1.0212765957446808) internal successors, (240), 235 states have internal predecessors, (240), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 240 states. [2022-04-28 03:49:16,541 INFO L87 Difference]: Start difference. First operand has 240 states, 235 states have (on average 1.0212765957446808) internal successors, (240), 235 states have internal predecessors, (240), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 240 states. [2022-04-28 03:49:16,543 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:49:16,543 INFO L93 Difference]: Finished difference Result 240 states and 244 transitions. [2022-04-28 03:49:16,544 INFO L276 IsEmpty]: Start isEmpty. Operand 240 states and 244 transitions. [2022-04-28 03:49:16,544 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:49:16,544 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:49:16,544 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 03:49:16,544 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 03:49:16,544 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 240 states, 235 states have (on average 1.0212765957446808) internal successors, (240), 235 states have internal predecessors, (240), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:49:16,548 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 240 states to 240 states and 244 transitions. [2022-04-28 03:49:16,548 INFO L78 Accepts]: Start accepts. Automaton has 240 states and 244 transitions. Word has length 141 [2022-04-28 03:49:16,548 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 03:49:16,548 INFO L495 AbstractCegarLoop]: Abstraction has 240 states and 244 transitions. [2022-04-28 03:49:16,549 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 84 states, 84 states have (on average 1.630952380952381) internal successors, (137), 83 states have internal predecessors, (137), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:49:16,549 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 240 states and 244 transitions. [2022-04-28 03:49:16,779 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 244 edges. 244 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 03:49:16,780 INFO L276 IsEmpty]: Start isEmpty. Operand 240 states and 244 transitions. [2022-04-28 03:49:16,780 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2022-04-28 03:49:16,780 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 03:49:16,780 INFO L195 NwaCegarLoop]: trace histogram [51, 50, 29, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 03:49:16,796 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (37)] Forceful destruction successful, exit code 0 [2022-04-28 03:49:16,980 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 37 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable38 [2022-04-28 03:49:16,981 INFO L420 AbstractCegarLoop]: === Iteration 40 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 03:49:16,981 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 03:49:16,981 INFO L85 PathProgramCache]: Analyzing trace with hash -1760318289, now seen corresponding path program 37 times [2022-04-28 03:49:16,981 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 03:49:16,981 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1631928213] [2022-04-28 03:49:21,041 WARN L977 rdanLoopAcceleration]: Unable to prove correctness of quantifier elimination. [2022-04-28 03:49:21,109 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 1 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 03:49:25,263 WARN L977 rdanLoopAcceleration]: Unable to prove correctness of quantifier elimination. [2022-04-28 03:49:25,372 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={1=1, 2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 03:49:25,373 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-28 03:49:25,375 INFO L85 PathProgramCache]: Analyzing trace with hash 614278338, now seen corresponding path program 1 times [2022-04-28 03:49:25,375 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 03:49:25,375 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1960686919] [2022-04-28 03:49:25,375 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:49:25,375 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 03:49:25,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:49:26,114 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 03:49:26,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:49:26,117 INFO L290 TraceCheckUtils]: 0: Hoare triple {43880#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(17, 2);call #Ultimate.allocInit(12, 3); {43842#true} is VALID [2022-04-28 03:49:26,117 INFO L290 TraceCheckUtils]: 1: Hoare triple {43842#true} assume true; {43842#true} is VALID [2022-04-28 03:49:26,117 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {43842#true} {43842#true} #52#return; {43842#true} is VALID [2022-04-28 03:49:26,117 INFO L272 TraceCheckUtils]: 0: Hoare triple {43842#true} call ULTIMATE.init(); {43880#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 03:49:26,117 INFO L290 TraceCheckUtils]: 1: Hoare triple {43880#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(17, 2);call #Ultimate.allocInit(12, 3); {43842#true} is VALID [2022-04-28 03:49:26,117 INFO L290 TraceCheckUtils]: 2: Hoare triple {43842#true} assume true; {43842#true} is VALID [2022-04-28 03:49:26,117 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {43842#true} {43842#true} #52#return; {43842#true} is VALID [2022-04-28 03:49:26,117 INFO L272 TraceCheckUtils]: 4: Hoare triple {43842#true} call #t~ret9 := main(); {43842#true} is VALID [2022-04-28 03:49:26,118 INFO L290 TraceCheckUtils]: 5: Hoare triple {43842#true} ~x~0 := 0;~y~0 := 50000;~z~0 := 0;~x~0 := 0; {43847#(and (= main_~z~0 0) (= main_~x~0 0) (<= 50000 main_~y~0))} is VALID [2022-04-28 03:49:26,120 INFO L290 TraceCheckUtils]: 6: Hoare triple {43847#(and (= main_~z~0 0) (= main_~x~0 0) (<= 50000 main_~y~0))} [204] L11-2-->L18-1_primed: Formula: (let ((.cse0 (= v_main_~x~0_2040 v_main_~x~0_2039)) (.cse1 (= |v_main_#t~post4_230| |v_main_#t~post4_229|))) (or (and (< v_main_~x~0_2040 v_main_~x~0_2039) (< v_main_~x~0_2039 50001)) (and .cse0 .cse1 (not (< v_main_~x~0_2040 50000))) (and .cse0 .cse1))) InVars {main_~x~0=v_main_~x~0_2040, main_#t~post4=|v_main_#t~post4_230|} OutVars{main_~x~0=v_main_~x~0_2039, main_#t~post4=|v_main_#t~post4_229|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {43848#(or (<= main_~x~0 0) (and (= main_~z~0 0) (<= main_~x~0 main_~y~0) (<= main_~x~0 50000)))} is VALID [2022-04-28 03:49:26,120 INFO L290 TraceCheckUtils]: 7: Hoare triple {43848#(or (<= main_~x~0 0) (and (= main_~z~0 0) (<= main_~x~0 main_~y~0) (<= main_~x~0 50000)))} [205] L18-1_primed-->L11-2: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {43848#(or (<= main_~x~0 0) (and (= main_~z~0 0) (<= main_~x~0 main_~y~0) (<= main_~x~0 50000)))} is VALID [2022-04-28 03:49:26,121 INFO L290 TraceCheckUtils]: 8: Hoare triple {43848#(or (<= main_~x~0 0) (and (= main_~z~0 0) (<= main_~x~0 main_~y~0) (<= main_~x~0 50000)))} [206] L11-2-->L18-1_primed: Formula: (let ((.cse0 (= v_main_~x~0_2042 v_main_~x~0_2041)) (.cse1 (= |v_main_#t~post6_256| |v_main_#t~post6_255|)) (.cse2 (= |v_main_#t~post5_256| |v_main_#t~post5_255|)) (.cse3 (= v_main_~y~0_2231 v_main_~y~0_2230)) (.cse4 (<= 50000 v_main_~x~0_2042))) (or (and .cse0 .cse1 .cse2 .cse3) (and .cse0 .cse1 (or (not (< v_main_~x~0_2042 1000000)) (not .cse4)) .cse2 .cse3) (and (= (+ v_main_~x~0_2041 v_main_~y~0_2231) (+ v_main_~x~0_2042 v_main_~y~0_2230)) .cse4 (< v_main_~x~0_2041 1000001) (< v_main_~x~0_2042 v_main_~x~0_2041)))) InVars {main_~y~0=v_main_~y~0_2231, main_#t~post5=|v_main_#t~post5_256|, main_~x~0=v_main_~x~0_2042, main_#t~post6=|v_main_#t~post6_256|} OutVars{main_~y~0=v_main_~y~0_2230, main_#t~post5=|v_main_#t~post5_255|, main_~x~0=v_main_~x~0_2041, main_#t~post6=|v_main_#t~post6_255|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {43849#(or (and (= main_~z~0 0) (<= main_~x~0 main_~y~0)) (<= main_~x~0 50000))} is VALID [2022-04-28 03:49:26,122 INFO L290 TraceCheckUtils]: 9: Hoare triple {43849#(or (and (= main_~z~0 0) (<= main_~x~0 main_~y~0)) (<= main_~x~0 50000))} [203] L18-1_primed-->L18-1: Formula: (not (< v_main_~x~0_11 1000000)) InVars {main_~x~0=v_main_~x~0_11} OutVars{main_~x~0=v_main_~x~0_11} AuxVars[] AssignedVars[] {43850#(and (= main_~z~0 0) (<= 1000000 main_~y~0))} is VALID [2022-04-28 03:49:26,122 INFO L290 TraceCheckUtils]: 10: Hoare triple {43850#(and (= main_~z~0 0) (<= 1000000 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {43851#(and (= main_~z~0 0) (<= 999999 main_~y~0))} is VALID [2022-04-28 03:49:26,123 INFO L290 TraceCheckUtils]: 11: Hoare triple {43851#(and (= main_~z~0 0) (<= 999999 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {43852#(and (= main_~z~0 0) (<= 999998 main_~y~0))} is VALID [2022-04-28 03:49:26,124 INFO L290 TraceCheckUtils]: 12: Hoare triple {43852#(and (= main_~z~0 0) (<= 999998 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {43853#(and (= main_~z~0 0) (<= 999997 main_~y~0))} is VALID [2022-04-28 03:49:26,124 INFO L290 TraceCheckUtils]: 13: Hoare triple {43853#(and (= main_~z~0 0) (<= 999997 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {43854#(and (<= 999996 main_~y~0) (= main_~z~0 0))} is VALID [2022-04-28 03:49:26,125 INFO L290 TraceCheckUtils]: 14: Hoare triple {43854#(and (<= 999996 main_~y~0) (= main_~z~0 0))} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {43855#(and (= main_~z~0 0) (<= 999995 main_~y~0))} is VALID [2022-04-28 03:49:26,125 INFO L290 TraceCheckUtils]: 15: Hoare triple {43855#(and (= main_~z~0 0) (<= 999995 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {43856#(and (= main_~z~0 0) (<= 999994 main_~y~0))} is VALID [2022-04-28 03:49:26,126 INFO L290 TraceCheckUtils]: 16: Hoare triple {43856#(and (= main_~z~0 0) (<= 999994 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {43857#(and (= main_~z~0 0) (<= 999993 main_~y~0))} is VALID [2022-04-28 03:49:26,127 INFO L290 TraceCheckUtils]: 17: Hoare triple {43857#(and (= main_~z~0 0) (<= 999993 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {43858#(and (= main_~z~0 0) (<= 999992 main_~y~0))} is VALID [2022-04-28 03:49:26,127 INFO L290 TraceCheckUtils]: 18: Hoare triple {43858#(and (= main_~z~0 0) (<= 999992 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {43859#(and (= main_~z~0 0) (<= 999991 main_~y~0))} is VALID [2022-04-28 03:49:26,128 INFO L290 TraceCheckUtils]: 19: Hoare triple {43859#(and (= main_~z~0 0) (<= 999991 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {43860#(and (= main_~z~0 0) (<= 999990 main_~y~0))} is VALID [2022-04-28 03:49:26,129 INFO L290 TraceCheckUtils]: 20: Hoare triple {43860#(and (= main_~z~0 0) (<= 999990 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {43861#(and (= main_~z~0 0) (<= 999989 main_~y~0))} is VALID [2022-04-28 03:49:26,129 INFO L290 TraceCheckUtils]: 21: Hoare triple {43861#(and (= main_~z~0 0) (<= 999989 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {43862#(and (= main_~z~0 0) (<= 999988 main_~y~0))} is VALID [2022-04-28 03:49:26,130 INFO L290 TraceCheckUtils]: 22: Hoare triple {43862#(and (= main_~z~0 0) (<= 999988 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {43863#(and (= main_~z~0 0) (<= 999987 main_~y~0))} is VALID [2022-04-28 03:49:26,130 INFO L290 TraceCheckUtils]: 23: Hoare triple {43863#(and (= main_~z~0 0) (<= 999987 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {43864#(and (= main_~z~0 0) (<= 999986 main_~y~0))} is VALID [2022-04-28 03:49:26,131 INFO L290 TraceCheckUtils]: 24: Hoare triple {43864#(and (= main_~z~0 0) (<= 999986 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {43865#(and (= main_~z~0 0) (<= 999985 main_~y~0))} is VALID [2022-04-28 03:49:26,132 INFO L290 TraceCheckUtils]: 25: Hoare triple {43865#(and (= main_~z~0 0) (<= 999985 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {43866#(and (= main_~z~0 0) (<= 999984 main_~y~0))} is VALID [2022-04-28 03:49:26,132 INFO L290 TraceCheckUtils]: 26: Hoare triple {43866#(and (= main_~z~0 0) (<= 999984 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {43867#(and (<= 999983 main_~y~0) (= main_~z~0 0))} is VALID [2022-04-28 03:49:26,133 INFO L290 TraceCheckUtils]: 27: Hoare triple {43867#(and (<= 999983 main_~y~0) (= main_~z~0 0))} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {43868#(and (= main_~z~0 0) (<= 999982 main_~y~0))} is VALID [2022-04-28 03:49:26,133 INFO L290 TraceCheckUtils]: 28: Hoare triple {43868#(and (= main_~z~0 0) (<= 999982 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {43869#(and (= main_~z~0 0) (<= 999981 main_~y~0))} is VALID [2022-04-28 03:49:26,134 INFO L290 TraceCheckUtils]: 29: Hoare triple {43869#(and (= main_~z~0 0) (<= 999981 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {43870#(and (= main_~z~0 0) (<= 999980 main_~y~0))} is VALID [2022-04-28 03:49:26,135 INFO L290 TraceCheckUtils]: 30: Hoare triple {43870#(and (= main_~z~0 0) (<= 999980 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {43871#(and (= main_~z~0 0) (<= 999979 main_~y~0))} is VALID [2022-04-28 03:49:26,135 INFO L290 TraceCheckUtils]: 31: Hoare triple {43871#(and (= main_~z~0 0) (<= 999979 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {43872#(and (= main_~z~0 0) (<= 999978 main_~y~0))} is VALID [2022-04-28 03:49:26,136 INFO L290 TraceCheckUtils]: 32: Hoare triple {43872#(and (= main_~z~0 0) (<= 999978 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {43873#(and (= main_~z~0 0) (<= 999977 main_~y~0))} is VALID [2022-04-28 03:49:26,136 INFO L290 TraceCheckUtils]: 33: Hoare triple {43873#(and (= main_~z~0 0) (<= 999977 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {43874#(and (<= 999976 main_~y~0) (= main_~z~0 0))} is VALID [2022-04-28 03:49:26,137 INFO L290 TraceCheckUtils]: 34: Hoare triple {43874#(and (<= 999976 main_~y~0) (= main_~z~0 0))} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {43875#(and (= main_~z~0 0) (<= 999975 main_~y~0))} is VALID [2022-04-28 03:49:26,138 INFO L290 TraceCheckUtils]: 35: Hoare triple {43875#(and (= main_~z~0 0) (<= 999975 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {43876#(and (= main_~z~0 0) (<= 999974 main_~y~0))} is VALID [2022-04-28 03:49:26,138 INFO L290 TraceCheckUtils]: 36: Hoare triple {43876#(and (= main_~z~0 0) (<= 999974 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {43877#(and (= main_~z~0 0) (<= 999973 main_~y~0))} is VALID [2022-04-28 03:49:26,139 INFO L290 TraceCheckUtils]: 37: Hoare triple {43877#(and (= main_~z~0 0) (<= 999973 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {43878#(and (= main_~z~0 0) (<= 999972 main_~y~0))} is VALID [2022-04-28 03:49:26,139 INFO L290 TraceCheckUtils]: 38: Hoare triple {43878#(and (= main_~z~0 0) (<= 999972 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {43879#(and (= main_~z~0 0) (<= 999971 main_~y~0))} is VALID [2022-04-28 03:49:26,140 INFO L290 TraceCheckUtils]: 39: Hoare triple {43879#(and (= main_~z~0 0) (<= 999971 main_~y~0))} assume !(~y~0 > ~z~0); {43843#false} is VALID [2022-04-28 03:49:26,140 INFO L272 TraceCheckUtils]: 40: Hoare triple {43843#false} call __VERIFIER_assert((if ~x~0 == ~z~0 then 1 else 0)); {43843#false} is VALID [2022-04-28 03:49:26,140 INFO L290 TraceCheckUtils]: 41: Hoare triple {43843#false} ~cond := #in~cond; {43843#false} is VALID [2022-04-28 03:49:26,140 INFO L290 TraceCheckUtils]: 42: Hoare triple {43843#false} assume 0 == ~cond; {43843#false} is VALID [2022-04-28 03:49:26,140 INFO L290 TraceCheckUtils]: 43: Hoare triple {43843#false} assume !false; {43843#false} is VALID [2022-04-28 03:49:26,141 INFO L134 CoverageAnalysis]: Checked inductivity of 437 backedges. 0 proven. 437 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 03:49:26,141 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 03:49:26,141 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1960686919] [2022-04-28 03:49:26,141 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1960686919] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 03:49:26,141 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1407451266] [2022-04-28 03:49:26,141 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:49:26,141 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 03:49:26,141 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 03:49:26,143 INFO L229 MonitoredProcess]: Starting monitored process 38 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 03:49:26,166 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (38)] Waiting until timeout for monitored process [2022-04-28 03:49:26,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:49:26,207 INFO L263 TraceCheckSpWp]: Trace formula consists of 204 conjuncts, 33 conjunts are in the unsatisfiable core [2022-04-28 03:49:26,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:49:26,229 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 03:49:27,918 INFO L272 TraceCheckUtils]: 0: Hoare triple {43842#true} call ULTIMATE.init(); {43842#true} is VALID [2022-04-28 03:49:27,918 INFO L290 TraceCheckUtils]: 1: Hoare triple {43842#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(17, 2);call #Ultimate.allocInit(12, 3); {43842#true} is VALID [2022-04-28 03:49:27,918 INFO L290 TraceCheckUtils]: 2: Hoare triple {43842#true} assume true; {43842#true} is VALID [2022-04-28 03:49:27,918 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {43842#true} {43842#true} #52#return; {43842#true} is VALID [2022-04-28 03:49:27,918 INFO L272 TraceCheckUtils]: 4: Hoare triple {43842#true} call #t~ret9 := main(); {43842#true} is VALID [2022-04-28 03:49:27,918 INFO L290 TraceCheckUtils]: 5: Hoare triple {43842#true} ~x~0 := 0;~y~0 := 50000;~z~0 := 0;~x~0 := 0; {43899#(and (<= main_~z~0 0) (<= 50000 main_~y~0))} is VALID [2022-04-28 03:49:27,919 INFO L290 TraceCheckUtils]: 6: Hoare triple {43899#(and (<= main_~z~0 0) (<= 50000 main_~y~0))} [204] L11-2-->L18-1_primed: Formula: (let ((.cse0 (= v_main_~x~0_2040 v_main_~x~0_2039)) (.cse1 (= |v_main_#t~post4_230| |v_main_#t~post4_229|))) (or (and (< v_main_~x~0_2040 v_main_~x~0_2039) (< v_main_~x~0_2039 50001)) (and .cse0 .cse1 (not (< v_main_~x~0_2040 50000))) (and .cse0 .cse1))) InVars {main_~x~0=v_main_~x~0_2040, main_#t~post4=|v_main_#t~post4_230|} OutVars{main_~x~0=v_main_~x~0_2039, main_#t~post4=|v_main_#t~post4_229|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {43899#(and (<= main_~z~0 0) (<= 50000 main_~y~0))} is VALID [2022-04-28 03:49:27,919 INFO L290 TraceCheckUtils]: 7: Hoare triple {43899#(and (<= main_~z~0 0) (<= 50000 main_~y~0))} [205] L18-1_primed-->L11-2: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {43899#(and (<= main_~z~0 0) (<= 50000 main_~y~0))} is VALID [2022-04-28 03:49:27,920 INFO L290 TraceCheckUtils]: 8: Hoare triple {43899#(and (<= main_~z~0 0) (<= 50000 main_~y~0))} [206] L11-2-->L18-1_primed: Formula: (let ((.cse0 (= v_main_~x~0_2042 v_main_~x~0_2041)) (.cse1 (= |v_main_#t~post6_256| |v_main_#t~post6_255|)) (.cse2 (= |v_main_#t~post5_256| |v_main_#t~post5_255|)) (.cse3 (= v_main_~y~0_2231 v_main_~y~0_2230)) (.cse4 (<= 50000 v_main_~x~0_2042))) (or (and .cse0 .cse1 .cse2 .cse3) (and .cse0 .cse1 (or (not (< v_main_~x~0_2042 1000000)) (not .cse4)) .cse2 .cse3) (and (= (+ v_main_~x~0_2041 v_main_~y~0_2231) (+ v_main_~x~0_2042 v_main_~y~0_2230)) .cse4 (< v_main_~x~0_2041 1000001) (< v_main_~x~0_2042 v_main_~x~0_2041)))) InVars {main_~y~0=v_main_~y~0_2231, main_#t~post5=|v_main_#t~post5_256|, main_~x~0=v_main_~x~0_2042, main_#t~post6=|v_main_#t~post6_256|} OutVars{main_~y~0=v_main_~y~0_2230, main_#t~post5=|v_main_#t~post5_255|, main_~x~0=v_main_~x~0_2041, main_#t~post6=|v_main_#t~post6_255|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {43899#(and (<= main_~z~0 0) (<= 50000 main_~y~0))} is VALID [2022-04-28 03:49:27,920 INFO L290 TraceCheckUtils]: 9: Hoare triple {43899#(and (<= main_~z~0 0) (<= 50000 main_~y~0))} [203] L18-1_primed-->L18-1: Formula: (not (< v_main_~x~0_11 1000000)) InVars {main_~x~0=v_main_~x~0_11} OutVars{main_~x~0=v_main_~x~0_11} AuxVars[] AssignedVars[] {43899#(and (<= main_~z~0 0) (<= 50000 main_~y~0))} is VALID [2022-04-28 03:49:27,921 INFO L290 TraceCheckUtils]: 10: Hoare triple {43899#(and (<= main_~z~0 0) (<= 50000 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {43915#(and (<= main_~z~0 0) (<= 49999 main_~y~0))} is VALID [2022-04-28 03:49:27,921 INFO L290 TraceCheckUtils]: 11: Hoare triple {43915#(and (<= main_~z~0 0) (<= 49999 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {43919#(and (<= main_~z~0 0) (<= 49998 main_~y~0))} is VALID [2022-04-28 03:49:27,922 INFO L290 TraceCheckUtils]: 12: Hoare triple {43919#(and (<= main_~z~0 0) (<= 49998 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {43923#(and (<= main_~z~0 0) (<= 49997 main_~y~0))} is VALID [2022-04-28 03:49:27,922 INFO L290 TraceCheckUtils]: 13: Hoare triple {43923#(and (<= main_~z~0 0) (<= 49997 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {43927#(and (<= main_~z~0 0) (<= 49996 main_~y~0))} is VALID [2022-04-28 03:49:27,923 INFO L290 TraceCheckUtils]: 14: Hoare triple {43927#(and (<= main_~z~0 0) (<= 49996 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {43931#(and (<= main_~z~0 0) (<= 49995 main_~y~0))} is VALID [2022-04-28 03:49:27,923 INFO L290 TraceCheckUtils]: 15: Hoare triple {43931#(and (<= main_~z~0 0) (<= 49995 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {43935#(and (<= main_~z~0 0) (<= 49994 main_~y~0))} is VALID [2022-04-28 03:49:27,924 INFO L290 TraceCheckUtils]: 16: Hoare triple {43935#(and (<= main_~z~0 0) (<= 49994 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {43939#(and (<= main_~z~0 0) (<= 49993 main_~y~0))} is VALID [2022-04-28 03:49:27,924 INFO L290 TraceCheckUtils]: 17: Hoare triple {43939#(and (<= main_~z~0 0) (<= 49993 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {43943#(and (<= main_~z~0 0) (<= 49992 main_~y~0))} is VALID [2022-04-28 03:49:27,925 INFO L290 TraceCheckUtils]: 18: Hoare triple {43943#(and (<= main_~z~0 0) (<= 49992 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {43947#(and (<= main_~z~0 0) (<= 49991 main_~y~0))} is VALID [2022-04-28 03:49:27,925 INFO L290 TraceCheckUtils]: 19: Hoare triple {43947#(and (<= main_~z~0 0) (<= 49991 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {43951#(and (<= main_~z~0 0) (<= 49990 main_~y~0))} is VALID [2022-04-28 03:49:27,926 INFO L290 TraceCheckUtils]: 20: Hoare triple {43951#(and (<= main_~z~0 0) (<= 49990 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {43955#(and (<= main_~z~0 0) (<= 49989 main_~y~0))} is VALID [2022-04-28 03:49:27,926 INFO L290 TraceCheckUtils]: 21: Hoare triple {43955#(and (<= main_~z~0 0) (<= 49989 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {43959#(and (<= main_~z~0 0) (<= 49988 main_~y~0))} is VALID [2022-04-28 03:49:27,926 INFO L290 TraceCheckUtils]: 22: Hoare triple {43959#(and (<= main_~z~0 0) (<= 49988 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {43963#(and (<= main_~z~0 0) (<= 49987 main_~y~0))} is VALID [2022-04-28 03:49:27,927 INFO L290 TraceCheckUtils]: 23: Hoare triple {43963#(and (<= main_~z~0 0) (<= 49987 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {43967#(and (<= main_~z~0 0) (<= 49986 main_~y~0))} is VALID [2022-04-28 03:49:27,927 INFO L290 TraceCheckUtils]: 24: Hoare triple {43967#(and (<= main_~z~0 0) (<= 49986 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {43971#(and (<= main_~z~0 0) (<= 49985 main_~y~0))} is VALID [2022-04-28 03:49:27,928 INFO L290 TraceCheckUtils]: 25: Hoare triple {43971#(and (<= main_~z~0 0) (<= 49985 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {43975#(and (<= main_~z~0 0) (<= 49984 main_~y~0))} is VALID [2022-04-28 03:49:27,928 INFO L290 TraceCheckUtils]: 26: Hoare triple {43975#(and (<= main_~z~0 0) (<= 49984 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {43979#(and (<= main_~z~0 0) (<= 49983 main_~y~0))} is VALID [2022-04-28 03:49:27,929 INFO L290 TraceCheckUtils]: 27: Hoare triple {43979#(and (<= main_~z~0 0) (<= 49983 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {43983#(and (<= main_~z~0 0) (<= 49982 main_~y~0))} is VALID [2022-04-28 03:49:27,929 INFO L290 TraceCheckUtils]: 28: Hoare triple {43983#(and (<= main_~z~0 0) (<= 49982 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {43987#(and (<= main_~z~0 0) (<= 49981 main_~y~0))} is VALID [2022-04-28 03:49:27,930 INFO L290 TraceCheckUtils]: 29: Hoare triple {43987#(and (<= main_~z~0 0) (<= 49981 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {43991#(and (<= main_~z~0 0) (<= 49980 main_~y~0))} is VALID [2022-04-28 03:49:27,930 INFO L290 TraceCheckUtils]: 30: Hoare triple {43991#(and (<= main_~z~0 0) (<= 49980 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {43995#(and (<= main_~z~0 0) (<= 49979 main_~y~0))} is VALID [2022-04-28 03:49:27,931 INFO L290 TraceCheckUtils]: 31: Hoare triple {43995#(and (<= main_~z~0 0) (<= 49979 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {43999#(and (<= main_~z~0 0) (<= 49978 main_~y~0))} is VALID [2022-04-28 03:49:27,931 INFO L290 TraceCheckUtils]: 32: Hoare triple {43999#(and (<= main_~z~0 0) (<= 49978 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {44003#(and (<= main_~z~0 0) (<= 49977 main_~y~0))} is VALID [2022-04-28 03:49:27,932 INFO L290 TraceCheckUtils]: 33: Hoare triple {44003#(and (<= main_~z~0 0) (<= 49977 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {44007#(and (<= main_~z~0 0) (<= 49976 main_~y~0))} is VALID [2022-04-28 03:49:27,932 INFO L290 TraceCheckUtils]: 34: Hoare triple {44007#(and (<= main_~z~0 0) (<= 49976 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {44011#(and (<= main_~z~0 0) (<= 49975 main_~y~0))} is VALID [2022-04-28 03:49:27,933 INFO L290 TraceCheckUtils]: 35: Hoare triple {44011#(and (<= main_~z~0 0) (<= 49975 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {44015#(and (<= main_~z~0 0) (<= 49974 main_~y~0))} is VALID [2022-04-28 03:49:27,933 INFO L290 TraceCheckUtils]: 36: Hoare triple {44015#(and (<= main_~z~0 0) (<= 49974 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {44019#(and (<= main_~z~0 0) (<= 49973 main_~y~0))} is VALID [2022-04-28 03:49:27,933 INFO L290 TraceCheckUtils]: 37: Hoare triple {44019#(and (<= main_~z~0 0) (<= 49973 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {44023#(and (<= main_~z~0 0) (<= 49972 main_~y~0))} is VALID [2022-04-28 03:49:27,934 INFO L290 TraceCheckUtils]: 38: Hoare triple {44023#(and (<= main_~z~0 0) (<= 49972 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {44027#(and (<= main_~z~0 0) (<= 49971 main_~y~0))} is VALID [2022-04-28 03:49:27,934 INFO L290 TraceCheckUtils]: 39: Hoare triple {44027#(and (<= main_~z~0 0) (<= 49971 main_~y~0))} assume !(~y~0 > ~z~0); {43843#false} is VALID [2022-04-28 03:49:27,934 INFO L272 TraceCheckUtils]: 40: Hoare triple {43843#false} call __VERIFIER_assert((if ~x~0 == ~z~0 then 1 else 0)); {43843#false} is VALID [2022-04-28 03:49:27,934 INFO L290 TraceCheckUtils]: 41: Hoare triple {43843#false} ~cond := #in~cond; {43843#false} is VALID [2022-04-28 03:49:27,934 INFO L290 TraceCheckUtils]: 42: Hoare triple {43843#false} assume 0 == ~cond; {43843#false} is VALID [2022-04-28 03:49:27,935 INFO L290 TraceCheckUtils]: 43: Hoare triple {43843#false} assume !false; {43843#false} is VALID [2022-04-28 03:49:27,935 INFO L134 CoverageAnalysis]: Checked inductivity of 437 backedges. 0 proven. 435 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-04-28 03:49:27,935 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 03:49:30,139 INFO L290 TraceCheckUtils]: 43: Hoare triple {43843#false} assume !false; {43843#false} is VALID [2022-04-28 03:49:30,139 INFO L290 TraceCheckUtils]: 42: Hoare triple {43843#false} assume 0 == ~cond; {43843#false} is VALID [2022-04-28 03:49:30,139 INFO L290 TraceCheckUtils]: 41: Hoare triple {43843#false} ~cond := #in~cond; {43843#false} is VALID [2022-04-28 03:49:30,139 INFO L272 TraceCheckUtils]: 40: Hoare triple {43843#false} call __VERIFIER_assert((if ~x~0 == ~z~0 then 1 else 0)); {43843#false} is VALID [2022-04-28 03:49:30,139 INFO L290 TraceCheckUtils]: 39: Hoare triple {44055#(< main_~z~0 main_~y~0)} assume !(~y~0 > ~z~0); {43843#false} is VALID [2022-04-28 03:49:30,140 INFO L290 TraceCheckUtils]: 38: Hoare triple {44059#(< (+ main_~z~0 1) main_~y~0)} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {44055#(< main_~z~0 main_~y~0)} is VALID [2022-04-28 03:49:30,140 INFO L290 TraceCheckUtils]: 37: Hoare triple {44063#(< (+ main_~z~0 2) main_~y~0)} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {44059#(< (+ main_~z~0 1) main_~y~0)} is VALID [2022-04-28 03:49:30,141 INFO L290 TraceCheckUtils]: 36: Hoare triple {44067#(< (+ main_~z~0 3) main_~y~0)} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {44063#(< (+ main_~z~0 2) main_~y~0)} is VALID [2022-04-28 03:49:30,141 INFO L290 TraceCheckUtils]: 35: Hoare triple {44071#(< (+ main_~z~0 4) main_~y~0)} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {44067#(< (+ main_~z~0 3) main_~y~0)} is VALID [2022-04-28 03:49:30,141 INFO L290 TraceCheckUtils]: 34: Hoare triple {44075#(< (+ 5 main_~z~0) main_~y~0)} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {44071#(< (+ main_~z~0 4) main_~y~0)} is VALID [2022-04-28 03:49:30,142 INFO L290 TraceCheckUtils]: 33: Hoare triple {44079#(< (+ main_~z~0 6) main_~y~0)} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {44075#(< (+ 5 main_~z~0) main_~y~0)} is VALID [2022-04-28 03:49:30,142 INFO L290 TraceCheckUtils]: 32: Hoare triple {44083#(< (+ 7 main_~z~0) main_~y~0)} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {44079#(< (+ main_~z~0 6) main_~y~0)} is VALID [2022-04-28 03:49:30,143 INFO L290 TraceCheckUtils]: 31: Hoare triple {44087#(< (+ main_~z~0 8) main_~y~0)} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {44083#(< (+ 7 main_~z~0) main_~y~0)} is VALID [2022-04-28 03:49:30,143 INFO L290 TraceCheckUtils]: 30: Hoare triple {44091#(< (+ main_~z~0 9) main_~y~0)} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {44087#(< (+ main_~z~0 8) main_~y~0)} is VALID [2022-04-28 03:49:30,144 INFO L290 TraceCheckUtils]: 29: Hoare triple {44095#(< (+ main_~z~0 10) main_~y~0)} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {44091#(< (+ main_~z~0 9) main_~y~0)} is VALID [2022-04-28 03:49:30,144 INFO L290 TraceCheckUtils]: 28: Hoare triple {44099#(< (+ main_~z~0 11) main_~y~0)} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {44095#(< (+ main_~z~0 10) main_~y~0)} is VALID [2022-04-28 03:49:30,145 INFO L290 TraceCheckUtils]: 27: Hoare triple {44103#(< (+ main_~z~0 12) main_~y~0)} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {44099#(< (+ main_~z~0 11) main_~y~0)} is VALID [2022-04-28 03:49:30,145 INFO L290 TraceCheckUtils]: 26: Hoare triple {44107#(< (+ main_~z~0 13) main_~y~0)} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {44103#(< (+ main_~z~0 12) main_~y~0)} is VALID [2022-04-28 03:49:30,146 INFO L290 TraceCheckUtils]: 25: Hoare triple {44111#(< (+ main_~z~0 14) main_~y~0)} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {44107#(< (+ main_~z~0 13) main_~y~0)} is VALID [2022-04-28 03:49:30,146 INFO L290 TraceCheckUtils]: 24: Hoare triple {44115#(< (+ main_~z~0 15) main_~y~0)} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {44111#(< (+ main_~z~0 14) main_~y~0)} is VALID [2022-04-28 03:49:30,146 INFO L290 TraceCheckUtils]: 23: Hoare triple {44119#(< (+ main_~z~0 16) main_~y~0)} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {44115#(< (+ main_~z~0 15) main_~y~0)} is VALID [2022-04-28 03:49:30,147 INFO L290 TraceCheckUtils]: 22: Hoare triple {44123#(< (+ main_~z~0 17) main_~y~0)} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {44119#(< (+ main_~z~0 16) main_~y~0)} is VALID [2022-04-28 03:49:30,147 INFO L290 TraceCheckUtils]: 21: Hoare triple {44127#(< (+ main_~z~0 18) main_~y~0)} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {44123#(< (+ main_~z~0 17) main_~y~0)} is VALID [2022-04-28 03:49:30,148 INFO L290 TraceCheckUtils]: 20: Hoare triple {44131#(< (+ 19 main_~z~0) main_~y~0)} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {44127#(< (+ main_~z~0 18) main_~y~0)} is VALID [2022-04-28 03:49:30,148 INFO L290 TraceCheckUtils]: 19: Hoare triple {44135#(< (+ main_~z~0 20) main_~y~0)} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {44131#(< (+ 19 main_~z~0) main_~y~0)} is VALID [2022-04-28 03:49:30,149 INFO L290 TraceCheckUtils]: 18: Hoare triple {44139#(< (+ main_~z~0 21) main_~y~0)} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {44135#(< (+ main_~z~0 20) main_~y~0)} is VALID [2022-04-28 03:49:30,149 INFO L290 TraceCheckUtils]: 17: Hoare triple {44143#(< (+ main_~z~0 22) main_~y~0)} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {44139#(< (+ main_~z~0 21) main_~y~0)} is VALID [2022-04-28 03:49:30,150 INFO L290 TraceCheckUtils]: 16: Hoare triple {44147#(< (+ 23 main_~z~0) main_~y~0)} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {44143#(< (+ main_~z~0 22) main_~y~0)} is VALID [2022-04-28 03:49:30,150 INFO L290 TraceCheckUtils]: 15: Hoare triple {44151#(< (+ main_~z~0 24) main_~y~0)} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {44147#(< (+ 23 main_~z~0) main_~y~0)} is VALID [2022-04-28 03:49:30,151 INFO L290 TraceCheckUtils]: 14: Hoare triple {44155#(< (+ main_~z~0 25) main_~y~0)} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {44151#(< (+ main_~z~0 24) main_~y~0)} is VALID [2022-04-28 03:49:30,151 INFO L290 TraceCheckUtils]: 13: Hoare triple {44159#(< (+ main_~z~0 26) main_~y~0)} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {44155#(< (+ main_~z~0 25) main_~y~0)} is VALID [2022-04-28 03:49:30,151 INFO L290 TraceCheckUtils]: 12: Hoare triple {44163#(< (+ main_~z~0 27) main_~y~0)} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {44159#(< (+ main_~z~0 26) main_~y~0)} is VALID [2022-04-28 03:49:30,152 INFO L290 TraceCheckUtils]: 11: Hoare triple {44167#(< (+ main_~z~0 28) main_~y~0)} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {44163#(< (+ main_~z~0 27) main_~y~0)} is VALID [2022-04-28 03:49:30,152 INFO L290 TraceCheckUtils]: 10: Hoare triple {44171#(< (+ 29 main_~z~0) main_~y~0)} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {44167#(< (+ main_~z~0 28) main_~y~0)} is VALID [2022-04-28 03:49:30,153 INFO L290 TraceCheckUtils]: 9: Hoare triple {44171#(< (+ 29 main_~z~0) main_~y~0)} [203] L18-1_primed-->L18-1: Formula: (not (< v_main_~x~0_11 1000000)) InVars {main_~x~0=v_main_~x~0_11} OutVars{main_~x~0=v_main_~x~0_11} AuxVars[] AssignedVars[] {44171#(< (+ 29 main_~z~0) main_~y~0)} is VALID [2022-04-28 03:49:30,153 INFO L290 TraceCheckUtils]: 8: Hoare triple {44171#(< (+ 29 main_~z~0) main_~y~0)} [206] L11-2-->L18-1_primed: Formula: (let ((.cse0 (= v_main_~x~0_2042 v_main_~x~0_2041)) (.cse1 (= |v_main_#t~post6_256| |v_main_#t~post6_255|)) (.cse2 (= |v_main_#t~post5_256| |v_main_#t~post5_255|)) (.cse3 (= v_main_~y~0_2231 v_main_~y~0_2230)) (.cse4 (<= 50000 v_main_~x~0_2042))) (or (and .cse0 .cse1 .cse2 .cse3) (and .cse0 .cse1 (or (not (< v_main_~x~0_2042 1000000)) (not .cse4)) .cse2 .cse3) (and (= (+ v_main_~x~0_2041 v_main_~y~0_2231) (+ v_main_~x~0_2042 v_main_~y~0_2230)) .cse4 (< v_main_~x~0_2041 1000001) (< v_main_~x~0_2042 v_main_~x~0_2041)))) InVars {main_~y~0=v_main_~y~0_2231, main_#t~post5=|v_main_#t~post5_256|, main_~x~0=v_main_~x~0_2042, main_#t~post6=|v_main_#t~post6_256|} OutVars{main_~y~0=v_main_~y~0_2230, main_#t~post5=|v_main_#t~post5_255|, main_~x~0=v_main_~x~0_2041, main_#t~post6=|v_main_#t~post6_255|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {44171#(< (+ 29 main_~z~0) main_~y~0)} is VALID [2022-04-28 03:49:30,154 INFO L290 TraceCheckUtils]: 7: Hoare triple {44171#(< (+ 29 main_~z~0) main_~y~0)} [205] L18-1_primed-->L11-2: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {44171#(< (+ 29 main_~z~0) main_~y~0)} is VALID [2022-04-28 03:49:30,154 INFO L290 TraceCheckUtils]: 6: Hoare triple {44171#(< (+ 29 main_~z~0) main_~y~0)} [204] L11-2-->L18-1_primed: Formula: (let ((.cse0 (= v_main_~x~0_2040 v_main_~x~0_2039)) (.cse1 (= |v_main_#t~post4_230| |v_main_#t~post4_229|))) (or (and (< v_main_~x~0_2040 v_main_~x~0_2039) (< v_main_~x~0_2039 50001)) (and .cse0 .cse1 (not (< v_main_~x~0_2040 50000))) (and .cse0 .cse1))) InVars {main_~x~0=v_main_~x~0_2040, main_#t~post4=|v_main_#t~post4_230|} OutVars{main_~x~0=v_main_~x~0_2039, main_#t~post4=|v_main_#t~post4_229|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {44171#(< (+ 29 main_~z~0) main_~y~0)} is VALID [2022-04-28 03:49:30,154 INFO L290 TraceCheckUtils]: 5: Hoare triple {43842#true} ~x~0 := 0;~y~0 := 50000;~z~0 := 0;~x~0 := 0; {44171#(< (+ 29 main_~z~0) main_~y~0)} is VALID [2022-04-28 03:49:30,154 INFO L272 TraceCheckUtils]: 4: Hoare triple {43842#true} call #t~ret9 := main(); {43842#true} is VALID [2022-04-28 03:49:30,154 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {43842#true} {43842#true} #52#return; {43842#true} is VALID [2022-04-28 03:49:30,154 INFO L290 TraceCheckUtils]: 2: Hoare triple {43842#true} assume true; {43842#true} is VALID [2022-04-28 03:49:30,154 INFO L290 TraceCheckUtils]: 1: Hoare triple {43842#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(17, 2);call #Ultimate.allocInit(12, 3); {43842#true} is VALID [2022-04-28 03:49:30,155 INFO L272 TraceCheckUtils]: 0: Hoare triple {43842#true} call ULTIMATE.init(); {43842#true} is VALID [2022-04-28 03:49:30,155 INFO L134 CoverageAnalysis]: Checked inductivity of 437 backedges. 0 proven. 435 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-04-28 03:49:30,155 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1407451266] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 03:49:30,155 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 03:49:30,155 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [36, 32, 32] total 96 [2022-04-28 03:49:33,091 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 03:49:33,092 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1631928213] [2022-04-28 03:49:33,092 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1631928213] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 03:49:33,092 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 03:49:33,092 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [85] imperfect sequences [] total 85 [2022-04-28 03:49:33,092 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [975776187] [2022-04-28 03:49:33,092 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 03:49:33,092 INFO L78 Accepts]: Start accepts. Automaton has has 85 states, 85 states have (on average 1.6352941176470588) internal successors, (139), 84 states have internal predecessors, (139), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 143 [2022-04-28 03:49:33,092 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 03:49:33,092 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 85 states, 85 states have (on average 1.6352941176470588) internal successors, (139), 84 states have internal predecessors, (139), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:49:33,194 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 143 edges. 143 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 03:49:33,194 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 85 states [2022-04-28 03:49:33,194 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 03:49:33,195 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 85 interpolants. [2022-04-28 03:49:33,196 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7537, Invalid=14219, Unknown=0, NotChecked=0, Total=21756 [2022-04-28 03:49:33,196 INFO L87 Difference]: Start difference. First operand 240 states and 244 transitions. Second operand has 85 states, 85 states have (on average 1.6352941176470588) internal successors, (139), 84 states have internal predecessors, (139), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:49:45,431 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:49:45,431 INFO L93 Difference]: Finished difference Result 374 states and 383 transitions. [2022-04-28 03:49:45,431 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 55 states. [2022-04-28 03:49:45,432 INFO L78 Accepts]: Start accepts. Automaton has has 85 states, 85 states have (on average 1.6352941176470588) internal successors, (139), 84 states have internal predecessors, (139), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 143 [2022-04-28 03:49:45,432 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 03:49:45,432 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 85 states, 85 states have (on average 1.6352941176470588) internal successors, (139), 84 states have internal predecessors, (139), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:49:45,432 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 133 transitions. [2022-04-28 03:49:45,433 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 85 states, 85 states have (on average 1.6352941176470588) internal successors, (139), 84 states have internal predecessors, (139), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:49:45,433 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 133 transitions. [2022-04-28 03:49:45,433 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 55 states and 133 transitions. [2022-04-28 03:49:45,541 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 133 edges. 133 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 03:49:45,544 INFO L225 Difference]: With dead ends: 374 [2022-04-28 03:49:45,544 INFO L226 Difference]: Without dead ends: 242 [2022-04-28 03:49:45,546 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 284 GetRequests, 84 SyntacticMatches, 2 SemanticMatches, 198 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9678 ImplicationChecksByTransitivity, 8.0s TimeCoverageRelationStatistics Valid=10921, Invalid=28879, Unknown=0, NotChecked=0, Total=39800 [2022-04-28 03:49:45,546 INFO L413 NwaCegarLoop]: 13 mSDtfsCounter, 62 mSDsluCounter, 282 mSDsCounter, 0 mSdLazyCounter, 6328 mSolverCounterSat, 57 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 62 SdHoareTripleChecker+Valid, 295 SdHoareTripleChecker+Invalid, 6385 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 57 IncrementalHoareTripleChecker+Valid, 6328 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.9s IncrementalHoareTripleChecker+Time [2022-04-28 03:49:45,546 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [62 Valid, 295 Invalid, 6385 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [57 Valid, 6328 Invalid, 0 Unknown, 0 Unchecked, 4.9s Time] [2022-04-28 03:49:45,547 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 242 states. [2022-04-28 03:49:46,133 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 242 to 242. [2022-04-28 03:49:46,133 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 03:49:46,134 INFO L82 GeneralOperation]: Start isEquivalent. First operand 242 states. Second operand has 242 states, 237 states have (on average 1.021097046413502) internal successors, (242), 237 states have internal predecessors, (242), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:49:46,134 INFO L74 IsIncluded]: Start isIncluded. First operand 242 states. Second operand has 242 states, 237 states have (on average 1.021097046413502) internal successors, (242), 237 states have internal predecessors, (242), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:49:46,134 INFO L87 Difference]: Start difference. First operand 242 states. Second operand has 242 states, 237 states have (on average 1.021097046413502) internal successors, (242), 237 states have internal predecessors, (242), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:49:46,136 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:49:46,136 INFO L93 Difference]: Finished difference Result 242 states and 246 transitions. [2022-04-28 03:49:46,136 INFO L276 IsEmpty]: Start isEmpty. Operand 242 states and 246 transitions. [2022-04-28 03:49:46,137 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:49:46,137 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:49:46,137 INFO L74 IsIncluded]: Start isIncluded. First operand has 242 states, 237 states have (on average 1.021097046413502) internal successors, (242), 237 states have internal predecessors, (242), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 242 states. [2022-04-28 03:49:46,137 INFO L87 Difference]: Start difference. First operand has 242 states, 237 states have (on average 1.021097046413502) internal successors, (242), 237 states have internal predecessors, (242), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 242 states. [2022-04-28 03:49:46,139 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:49:46,139 INFO L93 Difference]: Finished difference Result 242 states and 246 transitions. [2022-04-28 03:49:46,139 INFO L276 IsEmpty]: Start isEmpty. Operand 242 states and 246 transitions. [2022-04-28 03:49:46,139 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:49:46,139 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:49:46,139 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 03:49:46,139 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 03:49:46,140 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 242 states, 237 states have (on average 1.021097046413502) internal successors, (242), 237 states have internal predecessors, (242), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:49:46,142 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 242 states to 242 states and 246 transitions. [2022-04-28 03:49:46,142 INFO L78 Accepts]: Start accepts. Automaton has 242 states and 246 transitions. Word has length 143 [2022-04-28 03:49:46,142 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 03:49:46,142 INFO L495 AbstractCegarLoop]: Abstraction has 242 states and 246 transitions. [2022-04-28 03:49:46,142 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 85 states, 85 states have (on average 1.6352941176470588) internal successors, (139), 84 states have internal predecessors, (139), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:49:46,143 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 242 states and 246 transitions. [2022-04-28 03:49:46,369 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 246 edges. 246 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 03:49:46,369 INFO L276 IsEmpty]: Start isEmpty. Operand 242 states and 246 transitions. [2022-04-28 03:49:46,370 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2022-04-28 03:49:46,370 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 03:49:46,370 INFO L195 NwaCegarLoop]: trace histogram [52, 51, 29, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 03:49:46,386 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (38)] Forceful destruction successful, exit code 0 [2022-04-28 03:49:46,570 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 38 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable39 [2022-04-28 03:49:46,570 INFO L420 AbstractCegarLoop]: === Iteration 41 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 03:49:46,571 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 03:49:46,571 INFO L85 PathProgramCache]: Analyzing trace with hash 1994813578, now seen corresponding path program 38 times [2022-04-28 03:49:46,571 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 03:49:46,571 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [719376082] [2022-04-28 03:49:46,665 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 1 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 03:49:50,780 WARN L977 rdanLoopAcceleration]: Unable to prove correctness of quantifier elimination. [2022-04-28 03:49:50,896 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={1=1, 2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 03:49:50,897 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-28 03:49:50,899 INFO L85 PathProgramCache]: Analyzing trace with hash 1692845506, now seen corresponding path program 1 times [2022-04-28 03:49:50,899 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 03:49:50,899 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [516607163] [2022-04-28 03:49:50,899 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:49:50,899 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 03:49:50,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:49:51,681 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 03:49:51,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:49:51,685 INFO L290 TraceCheckUtils]: 0: Hoare triple {46114#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(17, 2);call #Ultimate.allocInit(12, 3); {46076#true} is VALID [2022-04-28 03:49:51,685 INFO L290 TraceCheckUtils]: 1: Hoare triple {46076#true} assume true; {46076#true} is VALID [2022-04-28 03:49:51,685 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {46076#true} {46076#true} #52#return; {46076#true} is VALID [2022-04-28 03:49:51,686 INFO L272 TraceCheckUtils]: 0: Hoare triple {46076#true} call ULTIMATE.init(); {46114#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 03:49:51,686 INFO L290 TraceCheckUtils]: 1: Hoare triple {46114#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(17, 2);call #Ultimate.allocInit(12, 3); {46076#true} is VALID [2022-04-28 03:49:51,686 INFO L290 TraceCheckUtils]: 2: Hoare triple {46076#true} assume true; {46076#true} is VALID [2022-04-28 03:49:51,686 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {46076#true} {46076#true} #52#return; {46076#true} is VALID [2022-04-28 03:49:51,686 INFO L272 TraceCheckUtils]: 4: Hoare triple {46076#true} call #t~ret9 := main(); {46076#true} is VALID [2022-04-28 03:49:51,686 INFO L290 TraceCheckUtils]: 5: Hoare triple {46076#true} ~x~0 := 0;~y~0 := 50000;~z~0 := 0;~x~0 := 0; {46081#(and (= main_~z~0 0) (= main_~x~0 0) (<= 50000 main_~y~0))} is VALID [2022-04-28 03:49:51,687 INFO L290 TraceCheckUtils]: 6: Hoare triple {46081#(and (= main_~z~0 0) (= main_~x~0 0) (<= 50000 main_~y~0))} [208] L11-2-->L18-1_primed: Formula: (let ((.cse0 (= v_main_~x~0_2136 v_main_~x~0_2135)) (.cse1 (= |v_main_#t~post4_236| |v_main_#t~post4_235|))) (or (and .cse0 (not (< v_main_~x~0_2136 50000)) .cse1) (and (< v_main_~x~0_2136 v_main_~x~0_2135) (< v_main_~x~0_2135 50001)) (and .cse0 .cse1))) InVars {main_~x~0=v_main_~x~0_2136, main_#t~post4=|v_main_#t~post4_236|} OutVars{main_~x~0=v_main_~x~0_2135, main_#t~post4=|v_main_#t~post4_235|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {46082#(or (= main_~x~0 0) (and (= main_~z~0 0) (<= main_~x~0 main_~y~0) (<= main_~x~0 50000)))} is VALID [2022-04-28 03:49:51,687 INFO L290 TraceCheckUtils]: 7: Hoare triple {46082#(or (= main_~x~0 0) (and (= main_~z~0 0) (<= main_~x~0 main_~y~0) (<= main_~x~0 50000)))} [209] L18-1_primed-->L11-2: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {46082#(or (= main_~x~0 0) (and (= main_~z~0 0) (<= main_~x~0 main_~y~0) (<= main_~x~0 50000)))} is VALID [2022-04-28 03:49:51,688 INFO L290 TraceCheckUtils]: 8: Hoare triple {46082#(or (= main_~x~0 0) (and (= main_~z~0 0) (<= main_~x~0 main_~y~0) (<= main_~x~0 50000)))} [210] L11-2-->L18-1_primed: Formula: (let ((.cse1 (= |v_main_#t~post6_263| |v_main_#t~post6_262|)) (.cse2 (= v_main_~x~0_2138 v_main_~x~0_2137)) (.cse3 (= v_main_~y~0_2348 v_main_~y~0_2347)) (.cse4 (= |v_main_#t~post5_263| |v_main_#t~post5_262|)) (.cse0 (<= 50000 v_main_~x~0_2138))) (or (and .cse0 (< v_main_~x~0_2137 1000001) (= (+ v_main_~x~0_2137 v_main_~y~0_2348) (+ v_main_~x~0_2138 v_main_~y~0_2347)) (< v_main_~x~0_2138 v_main_~x~0_2137)) (and .cse1 .cse2 .cse3 .cse4) (and .cse1 .cse2 .cse3 .cse4 (or (not .cse0) (not (< v_main_~x~0_2138 1000000)))))) InVars {main_~y~0=v_main_~y~0_2348, main_#t~post5=|v_main_#t~post5_263|, main_~x~0=v_main_~x~0_2138, main_#t~post6=|v_main_#t~post6_263|} OutVars{main_~y~0=v_main_~y~0_2347, main_#t~post5=|v_main_#t~post5_262|, main_~x~0=v_main_~x~0_2137, main_#t~post6=|v_main_#t~post6_262|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {46083#(or (and (= main_~z~0 0) (<= main_~x~0 main_~y~0)) (<= main_~x~0 50000))} is VALID [2022-04-28 03:49:51,689 INFO L290 TraceCheckUtils]: 9: Hoare triple {46083#(or (and (= main_~z~0 0) (<= main_~x~0 main_~y~0)) (<= main_~x~0 50000))} [207] L18-1_primed-->L18-1: Formula: (not (< v_main_~x~0_11 1000000)) InVars {main_~x~0=v_main_~x~0_11} OutVars{main_~x~0=v_main_~x~0_11} AuxVars[] AssignedVars[] {46084#(and (= main_~z~0 0) (<= 1000000 main_~y~0))} is VALID [2022-04-28 03:49:51,689 INFO L290 TraceCheckUtils]: 10: Hoare triple {46084#(and (= main_~z~0 0) (<= 1000000 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {46085#(and (= main_~z~0 0) (<= 999999 main_~y~0))} is VALID [2022-04-28 03:49:51,690 INFO L290 TraceCheckUtils]: 11: Hoare triple {46085#(and (= main_~z~0 0) (<= 999999 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {46086#(and (= main_~z~0 0) (<= 999998 main_~y~0))} is VALID [2022-04-28 03:49:51,690 INFO L290 TraceCheckUtils]: 12: Hoare triple {46086#(and (= main_~z~0 0) (<= 999998 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {46087#(and (= main_~z~0 0) (<= 999997 main_~y~0))} is VALID [2022-04-28 03:49:51,690 INFO L290 TraceCheckUtils]: 13: Hoare triple {46087#(and (= main_~z~0 0) (<= 999997 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {46088#(and (<= 999996 main_~y~0) (= main_~z~0 0))} is VALID [2022-04-28 03:49:51,691 INFO L290 TraceCheckUtils]: 14: Hoare triple {46088#(and (<= 999996 main_~y~0) (= main_~z~0 0))} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {46089#(and (= main_~z~0 0) (<= 999995 main_~y~0))} is VALID [2022-04-28 03:49:51,691 INFO L290 TraceCheckUtils]: 15: Hoare triple {46089#(and (= main_~z~0 0) (<= 999995 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {46090#(and (= main_~z~0 0) (<= 999994 main_~y~0))} is VALID [2022-04-28 03:49:51,692 INFO L290 TraceCheckUtils]: 16: Hoare triple {46090#(and (= main_~z~0 0) (<= 999994 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {46091#(and (= main_~z~0 0) (<= 999993 main_~y~0))} is VALID [2022-04-28 03:49:51,692 INFO L290 TraceCheckUtils]: 17: Hoare triple {46091#(and (= main_~z~0 0) (<= 999993 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {46092#(and (= main_~z~0 0) (<= 999992 main_~y~0))} is VALID [2022-04-28 03:49:51,693 INFO L290 TraceCheckUtils]: 18: Hoare triple {46092#(and (= main_~z~0 0) (<= 999992 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {46093#(and (= main_~z~0 0) (<= 999991 main_~y~0))} is VALID [2022-04-28 03:49:51,693 INFO L290 TraceCheckUtils]: 19: Hoare triple {46093#(and (= main_~z~0 0) (<= 999991 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {46094#(and (= main_~z~0 0) (<= 999990 main_~y~0))} is VALID [2022-04-28 03:49:51,694 INFO L290 TraceCheckUtils]: 20: Hoare triple {46094#(and (= main_~z~0 0) (<= 999990 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {46095#(and (= main_~z~0 0) (<= 999989 main_~y~0))} is VALID [2022-04-28 03:49:51,694 INFO L290 TraceCheckUtils]: 21: Hoare triple {46095#(and (= main_~z~0 0) (<= 999989 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {46096#(and (= main_~z~0 0) (<= 999988 main_~y~0))} is VALID [2022-04-28 03:49:51,695 INFO L290 TraceCheckUtils]: 22: Hoare triple {46096#(and (= main_~z~0 0) (<= 999988 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {46097#(and (= main_~z~0 0) (<= 999987 main_~y~0))} is VALID [2022-04-28 03:49:51,695 INFO L290 TraceCheckUtils]: 23: Hoare triple {46097#(and (= main_~z~0 0) (<= 999987 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {46098#(and (= main_~z~0 0) (<= 999986 main_~y~0))} is VALID [2022-04-28 03:49:51,696 INFO L290 TraceCheckUtils]: 24: Hoare triple {46098#(and (= main_~z~0 0) (<= 999986 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {46099#(and (= main_~z~0 0) (<= 999985 main_~y~0))} is VALID [2022-04-28 03:49:51,696 INFO L290 TraceCheckUtils]: 25: Hoare triple {46099#(and (= main_~z~0 0) (<= 999985 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {46100#(and (= main_~z~0 0) (<= 999984 main_~y~0))} is VALID [2022-04-28 03:49:51,697 INFO L290 TraceCheckUtils]: 26: Hoare triple {46100#(and (= main_~z~0 0) (<= 999984 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {46101#(and (<= 999983 main_~y~0) (= main_~z~0 0))} is VALID [2022-04-28 03:49:51,697 INFO L290 TraceCheckUtils]: 27: Hoare triple {46101#(and (<= 999983 main_~y~0) (= main_~z~0 0))} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {46102#(and (= main_~z~0 0) (<= 999982 main_~y~0))} is VALID [2022-04-28 03:49:51,697 INFO L290 TraceCheckUtils]: 28: Hoare triple {46102#(and (= main_~z~0 0) (<= 999982 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {46103#(and (= main_~z~0 0) (<= 999981 main_~y~0))} is VALID [2022-04-28 03:49:51,698 INFO L290 TraceCheckUtils]: 29: Hoare triple {46103#(and (= main_~z~0 0) (<= 999981 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {46104#(and (= main_~z~0 0) (<= 999980 main_~y~0))} is VALID [2022-04-28 03:49:51,698 INFO L290 TraceCheckUtils]: 30: Hoare triple {46104#(and (= main_~z~0 0) (<= 999980 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {46105#(and (= main_~z~0 0) (<= 999979 main_~y~0))} is VALID [2022-04-28 03:49:51,699 INFO L290 TraceCheckUtils]: 31: Hoare triple {46105#(and (= main_~z~0 0) (<= 999979 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {46106#(and (= main_~z~0 0) (<= 999978 main_~y~0))} is VALID [2022-04-28 03:49:51,699 INFO L290 TraceCheckUtils]: 32: Hoare triple {46106#(and (= main_~z~0 0) (<= 999978 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {46107#(and (= main_~z~0 0) (<= 999977 main_~y~0))} is VALID [2022-04-28 03:49:51,700 INFO L290 TraceCheckUtils]: 33: Hoare triple {46107#(and (= main_~z~0 0) (<= 999977 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {46108#(and (<= 999976 main_~y~0) (= main_~z~0 0))} is VALID [2022-04-28 03:49:51,700 INFO L290 TraceCheckUtils]: 34: Hoare triple {46108#(and (<= 999976 main_~y~0) (= main_~z~0 0))} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {46109#(and (= main_~z~0 0) (<= 999975 main_~y~0))} is VALID [2022-04-28 03:49:51,701 INFO L290 TraceCheckUtils]: 35: Hoare triple {46109#(and (= main_~z~0 0) (<= 999975 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {46110#(and (= main_~z~0 0) (<= 999974 main_~y~0))} is VALID [2022-04-28 03:49:51,701 INFO L290 TraceCheckUtils]: 36: Hoare triple {46110#(and (= main_~z~0 0) (<= 999974 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {46111#(and (= main_~z~0 0) (<= 999973 main_~y~0))} is VALID [2022-04-28 03:49:51,702 INFO L290 TraceCheckUtils]: 37: Hoare triple {46111#(and (= main_~z~0 0) (<= 999973 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {46112#(and (= main_~z~0 0) (<= 999972 main_~y~0))} is VALID [2022-04-28 03:49:51,702 INFO L290 TraceCheckUtils]: 38: Hoare triple {46112#(and (= main_~z~0 0) (<= 999972 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {46113#(and (= main_~z~0 0) (<= 999971 main_~y~0))} is VALID [2022-04-28 03:49:51,703 INFO L290 TraceCheckUtils]: 39: Hoare triple {46113#(and (= main_~z~0 0) (<= 999971 main_~y~0))} assume !(~y~0 > ~z~0); {46077#false} is VALID [2022-04-28 03:49:51,703 INFO L272 TraceCheckUtils]: 40: Hoare triple {46077#false} call __VERIFIER_assert((if ~x~0 == ~z~0 then 1 else 0)); {46077#false} is VALID [2022-04-28 03:49:51,703 INFO L290 TraceCheckUtils]: 41: Hoare triple {46077#false} ~cond := #in~cond; {46077#false} is VALID [2022-04-28 03:49:51,703 INFO L290 TraceCheckUtils]: 42: Hoare triple {46077#false} assume 0 == ~cond; {46077#false} is VALID [2022-04-28 03:49:51,703 INFO L290 TraceCheckUtils]: 43: Hoare triple {46077#false} assume !false; {46077#false} is VALID [2022-04-28 03:49:51,703 INFO L134 CoverageAnalysis]: Checked inductivity of 437 backedges. 0 proven. 437 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 03:49:51,703 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 03:49:51,703 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [516607163] [2022-04-28 03:49:51,703 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [516607163] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 03:49:51,703 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1315541909] [2022-04-28 03:49:51,703 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:49:51,703 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 03:49:51,703 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 03:49:51,704 INFO L229 MonitoredProcess]: Starting monitored process 39 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 03:49:51,705 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (39)] Waiting until timeout for monitored process [2022-04-28 03:49:51,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:49:51,775 INFO L263 TraceCheckSpWp]: Trace formula consists of 204 conjuncts, 36 conjunts are in the unsatisfiable core [2022-04-28 03:49:51,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:49:51,803 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 03:49:53,516 INFO L272 TraceCheckUtils]: 0: Hoare triple {46076#true} call ULTIMATE.init(); {46076#true} is VALID [2022-04-28 03:49:53,517 INFO L290 TraceCheckUtils]: 1: Hoare triple {46076#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(17, 2);call #Ultimate.allocInit(12, 3); {46076#true} is VALID [2022-04-28 03:49:53,517 INFO L290 TraceCheckUtils]: 2: Hoare triple {46076#true} assume true; {46076#true} is VALID [2022-04-28 03:49:53,517 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {46076#true} {46076#true} #52#return; {46076#true} is VALID [2022-04-28 03:49:53,517 INFO L272 TraceCheckUtils]: 4: Hoare triple {46076#true} call #t~ret9 := main(); {46076#true} is VALID [2022-04-28 03:49:53,517 INFO L290 TraceCheckUtils]: 5: Hoare triple {46076#true} ~x~0 := 0;~y~0 := 50000;~z~0 := 0;~x~0 := 0; {46133#(and (<= main_~z~0 0) (<= main_~x~0 0) (<= 50000 main_~y~0))} is VALID [2022-04-28 03:49:53,518 INFO L290 TraceCheckUtils]: 6: Hoare triple {46133#(and (<= main_~z~0 0) (<= main_~x~0 0) (<= 50000 main_~y~0))} [208] L11-2-->L18-1_primed: Formula: (let ((.cse0 (= v_main_~x~0_2136 v_main_~x~0_2135)) (.cse1 (= |v_main_#t~post4_236| |v_main_#t~post4_235|))) (or (and .cse0 (not (< v_main_~x~0_2136 50000)) .cse1) (and (< v_main_~x~0_2136 v_main_~x~0_2135) (< v_main_~x~0_2135 50001)) (and .cse0 .cse1))) InVars {main_~x~0=v_main_~x~0_2136, main_#t~post4=|v_main_#t~post4_236|} OutVars{main_~x~0=v_main_~x~0_2135, main_#t~post4=|v_main_#t~post4_235|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {46137#(and (<= main_~z~0 0) (< main_~x~0 50001) (<= 50000 main_~y~0))} is VALID [2022-04-28 03:49:53,518 INFO L290 TraceCheckUtils]: 7: Hoare triple {46137#(and (<= main_~z~0 0) (< main_~x~0 50001) (<= 50000 main_~y~0))} [209] L18-1_primed-->L11-2: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {46137#(and (<= main_~z~0 0) (< main_~x~0 50001) (<= 50000 main_~y~0))} is VALID [2022-04-28 03:49:53,519 INFO L290 TraceCheckUtils]: 8: Hoare triple {46137#(and (<= main_~z~0 0) (< main_~x~0 50001) (<= 50000 main_~y~0))} [210] L11-2-->L18-1_primed: Formula: (let ((.cse1 (= |v_main_#t~post6_263| |v_main_#t~post6_262|)) (.cse2 (= v_main_~x~0_2138 v_main_~x~0_2137)) (.cse3 (= v_main_~y~0_2348 v_main_~y~0_2347)) (.cse4 (= |v_main_#t~post5_263| |v_main_#t~post5_262|)) (.cse0 (<= 50000 v_main_~x~0_2138))) (or (and .cse0 (< v_main_~x~0_2137 1000001) (= (+ v_main_~x~0_2137 v_main_~y~0_2348) (+ v_main_~x~0_2138 v_main_~y~0_2347)) (< v_main_~x~0_2138 v_main_~x~0_2137)) (and .cse1 .cse2 .cse3 .cse4) (and .cse1 .cse2 .cse3 .cse4 (or (not .cse0) (not (< v_main_~x~0_2138 1000000)))))) InVars {main_~y~0=v_main_~y~0_2348, main_#t~post5=|v_main_#t~post5_263|, main_~x~0=v_main_~x~0_2138, main_#t~post6=|v_main_#t~post6_263|} OutVars{main_~y~0=v_main_~y~0_2347, main_#t~post5=|v_main_#t~post5_262|, main_~x~0=v_main_~x~0_2137, main_#t~post6=|v_main_#t~post6_262|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {46144#(and (<= main_~z~0 0) (or (and (< main_~x~0 50001) (<= 50000 main_~y~0)) (and (< main_~x~0 (+ main_~y~0 1)) (< main_~x~0 1000001) (< 50000 main_~x~0))))} is VALID [2022-04-28 03:49:53,519 INFO L290 TraceCheckUtils]: 9: Hoare triple {46144#(and (<= main_~z~0 0) (or (and (< main_~x~0 50001) (<= 50000 main_~y~0)) (and (< main_~x~0 (+ main_~y~0 1)) (< main_~x~0 1000001) (< 50000 main_~x~0))))} [207] L18-1_primed-->L18-1: Formula: (not (< v_main_~x~0_11 1000000)) InVars {main_~x~0=v_main_~x~0_11} OutVars{main_~x~0=v_main_~x~0_11} AuxVars[] AssignedVars[] {46148#(and (<= main_~z~0 0) (< 999999 main_~y~0))} is VALID [2022-04-28 03:49:53,520 INFO L290 TraceCheckUtils]: 10: Hoare triple {46148#(and (<= main_~z~0 0) (< 999999 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {46152#(and (<= main_~z~0 0) (< 999998 main_~y~0))} is VALID [2022-04-28 03:49:53,520 INFO L290 TraceCheckUtils]: 11: Hoare triple {46152#(and (<= main_~z~0 0) (< 999998 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {46156#(and (<= main_~z~0 0) (< 999997 main_~y~0))} is VALID [2022-04-28 03:49:53,521 INFO L290 TraceCheckUtils]: 12: Hoare triple {46156#(and (<= main_~z~0 0) (< 999997 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {46160#(and (<= main_~z~0 0) (< 999996 main_~y~0))} is VALID [2022-04-28 03:49:53,521 INFO L290 TraceCheckUtils]: 13: Hoare triple {46160#(and (<= main_~z~0 0) (< 999996 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {46164#(and (<= main_~z~0 0) (< 999995 main_~y~0))} is VALID [2022-04-28 03:49:53,522 INFO L290 TraceCheckUtils]: 14: Hoare triple {46164#(and (<= main_~z~0 0) (< 999995 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {46168#(and (<= main_~z~0 0) (< 999994 main_~y~0))} is VALID [2022-04-28 03:49:53,522 INFO L290 TraceCheckUtils]: 15: Hoare triple {46168#(and (<= main_~z~0 0) (< 999994 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {46172#(and (<= main_~z~0 0) (< 999993 main_~y~0))} is VALID [2022-04-28 03:49:53,523 INFO L290 TraceCheckUtils]: 16: Hoare triple {46172#(and (<= main_~z~0 0) (< 999993 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {46176#(and (<= main_~z~0 0) (< 999992 main_~y~0))} is VALID [2022-04-28 03:49:53,523 INFO L290 TraceCheckUtils]: 17: Hoare triple {46176#(and (<= main_~z~0 0) (< 999992 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {46180#(and (<= main_~z~0 0) (< 999991 main_~y~0))} is VALID [2022-04-28 03:49:53,524 INFO L290 TraceCheckUtils]: 18: Hoare triple {46180#(and (<= main_~z~0 0) (< 999991 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {46184#(and (<= main_~z~0 0) (< 999990 main_~y~0))} is VALID [2022-04-28 03:49:53,524 INFO L290 TraceCheckUtils]: 19: Hoare triple {46184#(and (<= main_~z~0 0) (< 999990 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {46188#(and (<= main_~z~0 0) (< 999989 main_~y~0))} is VALID [2022-04-28 03:49:53,525 INFO L290 TraceCheckUtils]: 20: Hoare triple {46188#(and (<= main_~z~0 0) (< 999989 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {46192#(and (<= main_~z~0 0) (< 999988 main_~y~0))} is VALID [2022-04-28 03:49:53,525 INFO L290 TraceCheckUtils]: 21: Hoare triple {46192#(and (<= main_~z~0 0) (< 999988 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {46196#(and (<= main_~z~0 0) (< 999987 main_~y~0))} is VALID [2022-04-28 03:49:53,526 INFO L290 TraceCheckUtils]: 22: Hoare triple {46196#(and (<= main_~z~0 0) (< 999987 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {46200#(and (<= main_~z~0 0) (< 999986 main_~y~0))} is VALID [2022-04-28 03:49:53,526 INFO L290 TraceCheckUtils]: 23: Hoare triple {46200#(and (<= main_~z~0 0) (< 999986 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {46204#(and (<= main_~z~0 0) (< 999985 main_~y~0))} is VALID [2022-04-28 03:49:53,527 INFO L290 TraceCheckUtils]: 24: Hoare triple {46204#(and (<= main_~z~0 0) (< 999985 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {46208#(and (<= main_~z~0 0) (< 999984 main_~y~0))} is VALID [2022-04-28 03:49:53,527 INFO L290 TraceCheckUtils]: 25: Hoare triple {46208#(and (<= main_~z~0 0) (< 999984 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {46212#(and (<= main_~z~0 0) (< 999983 main_~y~0))} is VALID [2022-04-28 03:49:53,528 INFO L290 TraceCheckUtils]: 26: Hoare triple {46212#(and (<= main_~z~0 0) (< 999983 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {46216#(and (<= main_~z~0 0) (< 999982 main_~y~0))} is VALID [2022-04-28 03:49:53,528 INFO L290 TraceCheckUtils]: 27: Hoare triple {46216#(and (<= main_~z~0 0) (< 999982 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {46220#(and (<= main_~z~0 0) (< 999981 main_~y~0))} is VALID [2022-04-28 03:49:53,529 INFO L290 TraceCheckUtils]: 28: Hoare triple {46220#(and (<= main_~z~0 0) (< 999981 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {46224#(and (<= main_~z~0 0) (< 999980 main_~y~0))} is VALID [2022-04-28 03:49:53,529 INFO L290 TraceCheckUtils]: 29: Hoare triple {46224#(and (<= main_~z~0 0) (< 999980 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {46228#(and (<= main_~z~0 0) (< 999979 main_~y~0))} is VALID [2022-04-28 03:49:53,529 INFO L290 TraceCheckUtils]: 30: Hoare triple {46228#(and (<= main_~z~0 0) (< 999979 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {46232#(and (<= main_~z~0 0) (< 999978 main_~y~0))} is VALID [2022-04-28 03:49:53,530 INFO L290 TraceCheckUtils]: 31: Hoare triple {46232#(and (<= main_~z~0 0) (< 999978 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {46236#(and (<= main_~z~0 0) (< 999977 main_~y~0))} is VALID [2022-04-28 03:49:53,530 INFO L290 TraceCheckUtils]: 32: Hoare triple {46236#(and (<= main_~z~0 0) (< 999977 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {46240#(and (<= main_~z~0 0) (< 999976 main_~y~0))} is VALID [2022-04-28 03:49:53,531 INFO L290 TraceCheckUtils]: 33: Hoare triple {46240#(and (<= main_~z~0 0) (< 999976 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {46244#(and (<= main_~z~0 0) (< 999975 main_~y~0))} is VALID [2022-04-28 03:49:53,531 INFO L290 TraceCheckUtils]: 34: Hoare triple {46244#(and (<= main_~z~0 0) (< 999975 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {46248#(and (<= main_~z~0 0) (< 999974 main_~y~0))} is VALID [2022-04-28 03:49:53,532 INFO L290 TraceCheckUtils]: 35: Hoare triple {46248#(and (<= main_~z~0 0) (< 999974 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {46252#(and (<= main_~z~0 0) (< 999973 main_~y~0))} is VALID [2022-04-28 03:49:53,532 INFO L290 TraceCheckUtils]: 36: Hoare triple {46252#(and (<= main_~z~0 0) (< 999973 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {46256#(and (<= main_~z~0 0) (< 999972 main_~y~0))} is VALID [2022-04-28 03:49:53,533 INFO L290 TraceCheckUtils]: 37: Hoare triple {46256#(and (<= main_~z~0 0) (< 999972 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {46260#(and (<= main_~z~0 0) (< 999971 main_~y~0))} is VALID [2022-04-28 03:49:53,533 INFO L290 TraceCheckUtils]: 38: Hoare triple {46260#(and (<= main_~z~0 0) (< 999971 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {46264#(and (<= main_~z~0 0) (< 999970 main_~y~0))} is VALID [2022-04-28 03:49:53,534 INFO L290 TraceCheckUtils]: 39: Hoare triple {46264#(and (<= main_~z~0 0) (< 999970 main_~y~0))} assume !(~y~0 > ~z~0); {46077#false} is VALID [2022-04-28 03:49:53,534 INFO L272 TraceCheckUtils]: 40: Hoare triple {46077#false} call __VERIFIER_assert((if ~x~0 == ~z~0 then 1 else 0)); {46077#false} is VALID [2022-04-28 03:49:53,534 INFO L290 TraceCheckUtils]: 41: Hoare triple {46077#false} ~cond := #in~cond; {46077#false} is VALID [2022-04-28 03:49:53,534 INFO L290 TraceCheckUtils]: 42: Hoare triple {46077#false} assume 0 == ~cond; {46077#false} is VALID [2022-04-28 03:49:53,534 INFO L290 TraceCheckUtils]: 43: Hoare triple {46077#false} assume !false; {46077#false} is VALID [2022-04-28 03:49:53,534 INFO L134 CoverageAnalysis]: Checked inductivity of 437 backedges. 0 proven. 437 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 03:49:53,534 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 03:49:56,194 INFO L290 TraceCheckUtils]: 43: Hoare triple {46077#false} assume !false; {46077#false} is VALID [2022-04-28 03:49:56,195 INFO L290 TraceCheckUtils]: 42: Hoare triple {46077#false} assume 0 == ~cond; {46077#false} is VALID [2022-04-28 03:49:56,195 INFO L290 TraceCheckUtils]: 41: Hoare triple {46077#false} ~cond := #in~cond; {46077#false} is VALID [2022-04-28 03:49:56,195 INFO L272 TraceCheckUtils]: 40: Hoare triple {46077#false} call __VERIFIER_assert((if ~x~0 == ~z~0 then 1 else 0)); {46077#false} is VALID [2022-04-28 03:49:56,195 INFO L290 TraceCheckUtils]: 39: Hoare triple {46292#(< main_~z~0 main_~y~0)} assume !(~y~0 > ~z~0); {46077#false} is VALID [2022-04-28 03:49:56,195 INFO L290 TraceCheckUtils]: 38: Hoare triple {46296#(< (+ main_~z~0 1) main_~y~0)} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {46292#(< main_~z~0 main_~y~0)} is VALID [2022-04-28 03:49:56,196 INFO L290 TraceCheckUtils]: 37: Hoare triple {46300#(< (+ main_~z~0 2) main_~y~0)} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {46296#(< (+ main_~z~0 1) main_~y~0)} is VALID [2022-04-28 03:49:56,196 INFO L290 TraceCheckUtils]: 36: Hoare triple {46304#(< (+ main_~z~0 3) main_~y~0)} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {46300#(< (+ main_~z~0 2) main_~y~0)} is VALID [2022-04-28 03:49:56,197 INFO L290 TraceCheckUtils]: 35: Hoare triple {46308#(< (+ main_~z~0 4) main_~y~0)} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {46304#(< (+ main_~z~0 3) main_~y~0)} is VALID [2022-04-28 03:49:56,197 INFO L290 TraceCheckUtils]: 34: Hoare triple {46312#(< (+ 5 main_~z~0) main_~y~0)} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {46308#(< (+ main_~z~0 4) main_~y~0)} is VALID [2022-04-28 03:49:56,198 INFO L290 TraceCheckUtils]: 33: Hoare triple {46316#(< (+ main_~z~0 6) main_~y~0)} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {46312#(< (+ 5 main_~z~0) main_~y~0)} is VALID [2022-04-28 03:49:56,198 INFO L290 TraceCheckUtils]: 32: Hoare triple {46320#(< (+ 7 main_~z~0) main_~y~0)} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {46316#(< (+ main_~z~0 6) main_~y~0)} is VALID [2022-04-28 03:49:56,199 INFO L290 TraceCheckUtils]: 31: Hoare triple {46324#(< (+ main_~z~0 8) main_~y~0)} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {46320#(< (+ 7 main_~z~0) main_~y~0)} is VALID [2022-04-28 03:49:56,199 INFO L290 TraceCheckUtils]: 30: Hoare triple {46328#(< (+ main_~z~0 9) main_~y~0)} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {46324#(< (+ main_~z~0 8) main_~y~0)} is VALID [2022-04-28 03:49:56,199 INFO L290 TraceCheckUtils]: 29: Hoare triple {46332#(< (+ main_~z~0 10) main_~y~0)} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {46328#(< (+ main_~z~0 9) main_~y~0)} is VALID [2022-04-28 03:49:56,200 INFO L290 TraceCheckUtils]: 28: Hoare triple {46336#(< (+ main_~z~0 11) main_~y~0)} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {46332#(< (+ main_~z~0 10) main_~y~0)} is VALID [2022-04-28 03:49:56,200 INFO L290 TraceCheckUtils]: 27: Hoare triple {46340#(< (+ main_~z~0 12) main_~y~0)} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {46336#(< (+ main_~z~0 11) main_~y~0)} is VALID [2022-04-28 03:49:56,201 INFO L290 TraceCheckUtils]: 26: Hoare triple {46344#(< (+ main_~z~0 13) main_~y~0)} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {46340#(< (+ main_~z~0 12) main_~y~0)} is VALID [2022-04-28 03:49:56,201 INFO L290 TraceCheckUtils]: 25: Hoare triple {46348#(< (+ main_~z~0 14) main_~y~0)} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {46344#(< (+ main_~z~0 13) main_~y~0)} is VALID [2022-04-28 03:49:56,202 INFO L290 TraceCheckUtils]: 24: Hoare triple {46352#(< (+ main_~z~0 15) main_~y~0)} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {46348#(< (+ main_~z~0 14) main_~y~0)} is VALID [2022-04-28 03:49:56,202 INFO L290 TraceCheckUtils]: 23: Hoare triple {46356#(< (+ main_~z~0 16) main_~y~0)} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {46352#(< (+ main_~z~0 15) main_~y~0)} is VALID [2022-04-28 03:49:56,203 INFO L290 TraceCheckUtils]: 22: Hoare triple {46360#(< (+ main_~z~0 17) main_~y~0)} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {46356#(< (+ main_~z~0 16) main_~y~0)} is VALID [2022-04-28 03:49:56,203 INFO L290 TraceCheckUtils]: 21: Hoare triple {46364#(< (+ main_~z~0 18) main_~y~0)} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {46360#(< (+ main_~z~0 17) main_~y~0)} is VALID [2022-04-28 03:49:56,203 INFO L290 TraceCheckUtils]: 20: Hoare triple {46368#(< (+ 19 main_~z~0) main_~y~0)} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {46364#(< (+ main_~z~0 18) main_~y~0)} is VALID [2022-04-28 03:49:56,204 INFO L290 TraceCheckUtils]: 19: Hoare triple {46372#(< (+ main_~z~0 20) main_~y~0)} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {46368#(< (+ 19 main_~z~0) main_~y~0)} is VALID [2022-04-28 03:49:56,204 INFO L290 TraceCheckUtils]: 18: Hoare triple {46376#(< (+ main_~z~0 21) main_~y~0)} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {46372#(< (+ main_~z~0 20) main_~y~0)} is VALID [2022-04-28 03:49:56,205 INFO L290 TraceCheckUtils]: 17: Hoare triple {46380#(< (+ main_~z~0 22) main_~y~0)} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {46376#(< (+ main_~z~0 21) main_~y~0)} is VALID [2022-04-28 03:49:56,205 INFO L290 TraceCheckUtils]: 16: Hoare triple {46384#(< (+ 23 main_~z~0) main_~y~0)} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {46380#(< (+ main_~z~0 22) main_~y~0)} is VALID [2022-04-28 03:49:56,206 INFO L290 TraceCheckUtils]: 15: Hoare triple {46388#(< (+ main_~z~0 24) main_~y~0)} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {46384#(< (+ 23 main_~z~0) main_~y~0)} is VALID [2022-04-28 03:49:56,206 INFO L290 TraceCheckUtils]: 14: Hoare triple {46392#(< (+ main_~z~0 25) main_~y~0)} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {46388#(< (+ main_~z~0 24) main_~y~0)} is VALID [2022-04-28 03:49:56,207 INFO L290 TraceCheckUtils]: 13: Hoare triple {46396#(< (+ main_~z~0 26) main_~y~0)} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {46392#(< (+ main_~z~0 25) main_~y~0)} is VALID [2022-04-28 03:49:56,207 INFO L290 TraceCheckUtils]: 12: Hoare triple {46400#(< (+ main_~z~0 27) main_~y~0)} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {46396#(< (+ main_~z~0 26) main_~y~0)} is VALID [2022-04-28 03:49:56,207 INFO L290 TraceCheckUtils]: 11: Hoare triple {46404#(< (+ main_~z~0 28) main_~y~0)} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {46400#(< (+ main_~z~0 27) main_~y~0)} is VALID [2022-04-28 03:49:56,208 INFO L290 TraceCheckUtils]: 10: Hoare triple {46408#(< (+ 29 main_~z~0) main_~y~0)} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {46404#(< (+ main_~z~0 28) main_~y~0)} is VALID [2022-04-28 03:49:56,208 INFO L290 TraceCheckUtils]: 9: Hoare triple {46412#(or (< main_~x~0 1000000) (< (+ 29 main_~z~0) main_~y~0))} [207] L18-1_primed-->L18-1: Formula: (not (< v_main_~x~0_11 1000000)) InVars {main_~x~0=v_main_~x~0_11} OutVars{main_~x~0=v_main_~x~0_11} AuxVars[] AssignedVars[] {46408#(< (+ 29 main_~z~0) main_~y~0)} is VALID [2022-04-28 03:49:56,209 INFO L290 TraceCheckUtils]: 8: Hoare triple {46416#(and (or (<= 1000000 main_~x~0) (< (+ main_~z~0 main_~x~0) (+ main_~y~0 999971)) (not (<= 50000 main_~x~0))) (or (< main_~x~0 1000000) (< (+ 29 main_~z~0) main_~y~0)))} [210] L11-2-->L18-1_primed: Formula: (let ((.cse1 (= |v_main_#t~post6_263| |v_main_#t~post6_262|)) (.cse2 (= v_main_~x~0_2138 v_main_~x~0_2137)) (.cse3 (= v_main_~y~0_2348 v_main_~y~0_2347)) (.cse4 (= |v_main_#t~post5_263| |v_main_#t~post5_262|)) (.cse0 (<= 50000 v_main_~x~0_2138))) (or (and .cse0 (< v_main_~x~0_2137 1000001) (= (+ v_main_~x~0_2137 v_main_~y~0_2348) (+ v_main_~x~0_2138 v_main_~y~0_2347)) (< v_main_~x~0_2138 v_main_~x~0_2137)) (and .cse1 .cse2 .cse3 .cse4) (and .cse1 .cse2 .cse3 .cse4 (or (not .cse0) (not (< v_main_~x~0_2138 1000000)))))) InVars {main_~y~0=v_main_~y~0_2348, main_#t~post5=|v_main_#t~post5_263|, main_~x~0=v_main_~x~0_2138, main_#t~post6=|v_main_#t~post6_263|} OutVars{main_~y~0=v_main_~y~0_2347, main_#t~post5=|v_main_#t~post5_262|, main_~x~0=v_main_~x~0_2137, main_#t~post6=|v_main_#t~post6_262|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {46412#(or (< main_~x~0 1000000) (< (+ 29 main_~z~0) main_~y~0))} is VALID [2022-04-28 03:49:56,209 INFO L290 TraceCheckUtils]: 7: Hoare triple {46416#(and (or (<= 1000000 main_~x~0) (< (+ main_~z~0 main_~x~0) (+ main_~y~0 999971)) (not (<= 50000 main_~x~0))) (or (< main_~x~0 1000000) (< (+ 29 main_~z~0) main_~y~0)))} [209] L18-1_primed-->L11-2: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {46416#(and (or (<= 1000000 main_~x~0) (< (+ main_~z~0 main_~x~0) (+ main_~y~0 999971)) (not (<= 50000 main_~x~0))) (or (< main_~x~0 1000000) (< (+ 29 main_~z~0) main_~y~0)))} is VALID [2022-04-28 03:49:56,210 INFO L290 TraceCheckUtils]: 6: Hoare triple {46423#(and (or (<= 1000000 main_~x~0) (< (+ main_~z~0 main_~x~0) (+ main_~y~0 999971))) (<= main_~z~0 (+ main_~y~0 949970)) (or (< main_~x~0 1000000) (< (+ 29 main_~z~0) main_~y~0)))} [208] L11-2-->L18-1_primed: Formula: (let ((.cse0 (= v_main_~x~0_2136 v_main_~x~0_2135)) (.cse1 (= |v_main_#t~post4_236| |v_main_#t~post4_235|))) (or (and .cse0 (not (< v_main_~x~0_2136 50000)) .cse1) (and (< v_main_~x~0_2136 v_main_~x~0_2135) (< v_main_~x~0_2135 50001)) (and .cse0 .cse1))) InVars {main_~x~0=v_main_~x~0_2136, main_#t~post4=|v_main_#t~post4_236|} OutVars{main_~x~0=v_main_~x~0_2135, main_#t~post4=|v_main_#t~post4_235|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {46416#(and (or (<= 1000000 main_~x~0) (< (+ main_~z~0 main_~x~0) (+ main_~y~0 999971)) (not (<= 50000 main_~x~0))) (or (< main_~x~0 1000000) (< (+ 29 main_~z~0) main_~y~0)))} is VALID [2022-04-28 03:49:56,211 INFO L290 TraceCheckUtils]: 5: Hoare triple {46076#true} ~x~0 := 0;~y~0 := 50000;~z~0 := 0;~x~0 := 0; {46423#(and (or (<= 1000000 main_~x~0) (< (+ main_~z~0 main_~x~0) (+ main_~y~0 999971))) (<= main_~z~0 (+ main_~y~0 949970)) (or (< main_~x~0 1000000) (< (+ 29 main_~z~0) main_~y~0)))} is VALID [2022-04-28 03:49:56,211 INFO L272 TraceCheckUtils]: 4: Hoare triple {46076#true} call #t~ret9 := main(); {46076#true} is VALID [2022-04-28 03:49:56,211 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {46076#true} {46076#true} #52#return; {46076#true} is VALID [2022-04-28 03:49:56,211 INFO L290 TraceCheckUtils]: 2: Hoare triple {46076#true} assume true; {46076#true} is VALID [2022-04-28 03:49:56,211 INFO L290 TraceCheckUtils]: 1: Hoare triple {46076#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(17, 2);call #Ultimate.allocInit(12, 3); {46076#true} is VALID [2022-04-28 03:49:56,211 INFO L272 TraceCheckUtils]: 0: Hoare triple {46076#true} call ULTIMATE.init(); {46076#true} is VALID [2022-04-28 03:49:56,211 INFO L134 CoverageAnalysis]: Checked inductivity of 437 backedges. 0 proven. 437 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 03:49:56,211 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1315541909] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 03:49:56,211 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 03:49:56,211 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [36, 35, 35] total 102 [2022-04-28 03:50:00,024 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 03:50:00,024 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [719376082] [2022-04-28 03:50:00,025 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [719376082] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 03:50:00,025 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 03:50:00,025 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [86] imperfect sequences [] total 86 [2022-04-28 03:50:00,025 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1482638737] [2022-04-28 03:50:00,025 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 03:50:00,025 INFO L78 Accepts]: Start accepts. Automaton has has 86 states, 86 states have (on average 1.6395348837209303) internal successors, (141), 85 states have internal predecessors, (141), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 145 [2022-04-28 03:50:00,026 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 03:50:00,026 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 86 states, 86 states have (on average 1.6395348837209303) internal successors, (141), 85 states have internal predecessors, (141), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:50:00,139 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 145 edges. 145 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 03:50:00,140 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 86 states [2022-04-28 03:50:00,140 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 03:50:00,140 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 86 interpolants. [2022-04-28 03:50:00,141 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6070, Invalid=17800, Unknown=0, NotChecked=0, Total=23870 [2022-04-28 03:50:00,141 INFO L87 Difference]: Start difference. First operand 242 states and 246 transitions. Second operand has 86 states, 86 states have (on average 1.6395348837209303) internal successors, (141), 85 states have internal predecessors, (141), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:50:13,734 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:50:13,734 INFO L93 Difference]: Finished difference Result 376 states and 385 transitions. [2022-04-28 03:50:13,735 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 56 states. [2022-04-28 03:50:13,735 INFO L78 Accepts]: Start accepts. Automaton has has 86 states, 86 states have (on average 1.6395348837209303) internal successors, (141), 85 states have internal predecessors, (141), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 145 [2022-04-28 03:50:13,735 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 03:50:13,735 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 86 states, 86 states have (on average 1.6395348837209303) internal successors, (141), 85 states have internal predecessors, (141), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:50:13,736 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 135 transitions. [2022-04-28 03:50:13,736 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 86 states, 86 states have (on average 1.6395348837209303) internal successors, (141), 85 states have internal predecessors, (141), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:50:13,737 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 135 transitions. [2022-04-28 03:50:13,737 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 56 states and 135 transitions. [2022-04-28 03:50:13,858 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 135 edges. 135 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 03:50:13,861 INFO L225 Difference]: With dead ends: 376 [2022-04-28 03:50:13,861 INFO L226 Difference]: Without dead ends: 244 [2022-04-28 03:50:13,864 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 287 GetRequests, 79 SyntacticMatches, 2 SemanticMatches, 206 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9643 ImplicationChecksByTransitivity, 10.0s TimeCoverageRelationStatistics Valid=8143, Invalid=34913, Unknown=0, NotChecked=0, Total=43056 [2022-04-28 03:50:13,864 INFO L413 NwaCegarLoop]: 13 mSDtfsCounter, 63 mSDsluCounter, 292 mSDsCounter, 0 mSdLazyCounter, 6674 mSolverCounterSat, 58 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 63 SdHoareTripleChecker+Valid, 305 SdHoareTripleChecker+Invalid, 6732 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 58 IncrementalHoareTripleChecker+Valid, 6674 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.2s IncrementalHoareTripleChecker+Time [2022-04-28 03:50:13,864 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [63 Valid, 305 Invalid, 6732 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [58 Valid, 6674 Invalid, 0 Unknown, 0 Unchecked, 5.2s Time] [2022-04-28 03:50:13,864 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 244 states. [2022-04-28 03:50:14,439 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 244 to 244. [2022-04-28 03:50:14,440 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 03:50:14,440 INFO L82 GeneralOperation]: Start isEquivalent. First operand 244 states. Second operand has 244 states, 239 states have (on average 1.0209205020920502) internal successors, (244), 239 states have internal predecessors, (244), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:50:14,440 INFO L74 IsIncluded]: Start isIncluded. First operand 244 states. Second operand has 244 states, 239 states have (on average 1.0209205020920502) internal successors, (244), 239 states have internal predecessors, (244), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:50:14,440 INFO L87 Difference]: Start difference. First operand 244 states. Second operand has 244 states, 239 states have (on average 1.0209205020920502) internal successors, (244), 239 states have internal predecessors, (244), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:50:14,443 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:50:14,443 INFO L93 Difference]: Finished difference Result 244 states and 248 transitions. [2022-04-28 03:50:14,443 INFO L276 IsEmpty]: Start isEmpty. Operand 244 states and 248 transitions. [2022-04-28 03:50:14,443 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:50:14,443 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:50:14,443 INFO L74 IsIncluded]: Start isIncluded. First operand has 244 states, 239 states have (on average 1.0209205020920502) internal successors, (244), 239 states have internal predecessors, (244), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 244 states. [2022-04-28 03:50:14,443 INFO L87 Difference]: Start difference. First operand has 244 states, 239 states have (on average 1.0209205020920502) internal successors, (244), 239 states have internal predecessors, (244), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 244 states. [2022-04-28 03:50:14,445 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:50:14,445 INFO L93 Difference]: Finished difference Result 244 states and 248 transitions. [2022-04-28 03:50:14,445 INFO L276 IsEmpty]: Start isEmpty. Operand 244 states and 248 transitions. [2022-04-28 03:50:14,446 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:50:14,446 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:50:14,446 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 03:50:14,446 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 03:50:14,446 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 244 states, 239 states have (on average 1.0209205020920502) internal successors, (244), 239 states have internal predecessors, (244), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:50:14,449 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 244 states to 244 states and 248 transitions. [2022-04-28 03:50:14,449 INFO L78 Accepts]: Start accepts. Automaton has 244 states and 248 transitions. Word has length 145 [2022-04-28 03:50:14,449 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 03:50:14,449 INFO L495 AbstractCegarLoop]: Abstraction has 244 states and 248 transitions. [2022-04-28 03:50:14,449 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 86 states, 86 states have (on average 1.6395348837209303) internal successors, (141), 85 states have internal predecessors, (141), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:50:14,449 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 244 states and 248 transitions. [2022-04-28 03:50:14,697 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 248 edges. 248 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 03:50:14,697 INFO L276 IsEmpty]: Start isEmpty. Operand 244 states and 248 transitions. [2022-04-28 03:50:14,697 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2022-04-28 03:50:14,698 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 03:50:14,698 INFO L195 NwaCegarLoop]: trace histogram [53, 52, 29, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 03:50:14,714 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (39)] Ended with exit code 0 [2022-04-28 03:50:14,898 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 39 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable40 [2022-04-28 03:50:14,898 INFO L420 AbstractCegarLoop]: === Iteration 42 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 03:50:14,898 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 03:50:14,898 INFO L85 PathProgramCache]: Analyzing trace with hash -1390958171, now seen corresponding path program 39 times [2022-04-28 03:50:14,899 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 03:50:14,899 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [538473967] [2022-04-28 03:50:15,007 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 1 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 03:50:15,211 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={1=1, 2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 03:50:15,212 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-28 03:50:15,214 INFO L85 PathProgramCache]: Analyzing trace with hash -1523554622, now seen corresponding path program 1 times [2022-04-28 03:50:15,214 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 03:50:15,214 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [745454743] [2022-04-28 03:50:15,214 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:50:15,214 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 03:50:15,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:50:15,984 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 03:50:15,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:50:15,987 INFO L290 TraceCheckUtils]: 0: Hoare triple {48369#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(17, 2);call #Ultimate.allocInit(12, 3); {48331#true} is VALID [2022-04-28 03:50:15,987 INFO L290 TraceCheckUtils]: 1: Hoare triple {48331#true} assume true; {48331#true} is VALID [2022-04-28 03:50:15,987 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {48331#true} {48331#true} #52#return; {48331#true} is VALID [2022-04-28 03:50:15,988 INFO L272 TraceCheckUtils]: 0: Hoare triple {48331#true} call ULTIMATE.init(); {48369#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 03:50:15,988 INFO L290 TraceCheckUtils]: 1: Hoare triple {48369#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(17, 2);call #Ultimate.allocInit(12, 3); {48331#true} is VALID [2022-04-28 03:50:15,988 INFO L290 TraceCheckUtils]: 2: Hoare triple {48331#true} assume true; {48331#true} is VALID [2022-04-28 03:50:15,988 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {48331#true} {48331#true} #52#return; {48331#true} is VALID [2022-04-28 03:50:15,988 INFO L272 TraceCheckUtils]: 4: Hoare triple {48331#true} call #t~ret9 := main(); {48331#true} is VALID [2022-04-28 03:50:15,988 INFO L290 TraceCheckUtils]: 5: Hoare triple {48331#true} ~x~0 := 0;~y~0 := 50000;~z~0 := 0;~x~0 := 0; {48336#(and (= main_~z~0 0) (= main_~x~0 0) (<= 50000 main_~y~0))} is VALID [2022-04-28 03:50:15,989 INFO L290 TraceCheckUtils]: 6: Hoare triple {48336#(and (= main_~z~0 0) (= main_~x~0 0) (<= 50000 main_~y~0))} [212] L11-2-->L18-1_primed: Formula: (let ((.cse0 (= |v_main_#t~post4_243| |v_main_#t~post4_242|)) (.cse1 (= v_main_~x~0_2234 v_main_~x~0_2233))) (or (and (<= 50000 v_main_~x~0_2234) .cse0 .cse1) (and .cse0 .cse1) (and (< v_main_~x~0_2234 v_main_~x~0_2233) (< v_main_~x~0_2233 50001)))) InVars {main_~x~0=v_main_~x~0_2234, main_#t~post4=|v_main_#t~post4_243|} OutVars{main_~x~0=v_main_~x~0_2233, main_#t~post4=|v_main_#t~post4_242|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {48337#(and (= main_~z~0 0) (<= main_~x~0 main_~y~0) (<= main_~x~0 50000))} is VALID [2022-04-28 03:50:15,989 INFO L290 TraceCheckUtils]: 7: Hoare triple {48337#(and (= main_~z~0 0) (<= main_~x~0 main_~y~0) (<= main_~x~0 50000))} [213] L18-1_primed-->L11-2: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {48337#(and (= main_~z~0 0) (<= main_~x~0 main_~y~0) (<= main_~x~0 50000))} is VALID [2022-04-28 03:50:15,990 INFO L290 TraceCheckUtils]: 8: Hoare triple {48337#(and (= main_~z~0 0) (<= main_~x~0 main_~y~0) (<= main_~x~0 50000))} [214] L11-2-->L18-1_primed: Formula: (let ((.cse0 (= v_main_~y~0_2466 v_main_~y~0_2465)) (.cse2 (= v_main_~x~0_2236 v_main_~x~0_2235)) (.cse3 (= |v_main_#t~post6_270| |v_main_#t~post6_269|)) (.cse4 (= |v_main_#t~post5_270| |v_main_#t~post5_269|)) (.cse1 (<= 50000 v_main_~x~0_2236))) (or (and .cse0 (or (not .cse1) (not (< v_main_~x~0_2236 1000000))) .cse2 .cse3 .cse4) (and .cse0 .cse2 .cse3 .cse4) (and .cse1 (< v_main_~x~0_2236 v_main_~x~0_2235) (< v_main_~x~0_2235 1000001) (= (+ v_main_~x~0_2236 v_main_~y~0_2465) (+ v_main_~x~0_2235 v_main_~y~0_2466))))) InVars {main_~y~0=v_main_~y~0_2466, main_#t~post5=|v_main_#t~post5_270|, main_~x~0=v_main_~x~0_2236, main_#t~post6=|v_main_#t~post6_270|} OutVars{main_~y~0=v_main_~y~0_2465, main_#t~post5=|v_main_#t~post5_269|, main_~x~0=v_main_~x~0_2235, main_#t~post6=|v_main_#t~post6_269|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {48338#(and (= main_~z~0 0) (or (<= main_~x~0 main_~y~0) (<= main_~x~0 50000)))} is VALID [2022-04-28 03:50:15,990 INFO L290 TraceCheckUtils]: 9: Hoare triple {48338#(and (= main_~z~0 0) (or (<= main_~x~0 main_~y~0) (<= main_~x~0 50000)))} [211] L18-1_primed-->L18-1: Formula: (not (< v_main_~x~0_11 1000000)) InVars {main_~x~0=v_main_~x~0_11} OutVars{main_~x~0=v_main_~x~0_11} AuxVars[] AssignedVars[] {48339#(and (= main_~z~0 0) (<= 1000000 main_~y~0))} is VALID [2022-04-28 03:50:15,991 INFO L290 TraceCheckUtils]: 10: Hoare triple {48339#(and (= main_~z~0 0) (<= 1000000 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {48340#(and (= main_~z~0 0) (<= 999999 main_~y~0))} is VALID [2022-04-28 03:50:15,991 INFO L290 TraceCheckUtils]: 11: Hoare triple {48340#(and (= main_~z~0 0) (<= 999999 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {48341#(and (= main_~z~0 0) (<= 999998 main_~y~0))} is VALID [2022-04-28 03:50:15,992 INFO L290 TraceCheckUtils]: 12: Hoare triple {48341#(and (= main_~z~0 0) (<= 999998 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {48342#(and (= main_~z~0 0) (<= 999997 main_~y~0))} is VALID [2022-04-28 03:50:15,992 INFO L290 TraceCheckUtils]: 13: Hoare triple {48342#(and (= main_~z~0 0) (<= 999997 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {48343#(and (<= 999996 main_~y~0) (= main_~z~0 0))} is VALID [2022-04-28 03:50:15,993 INFO L290 TraceCheckUtils]: 14: Hoare triple {48343#(and (<= 999996 main_~y~0) (= main_~z~0 0))} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {48344#(and (= main_~z~0 0) (<= 999995 main_~y~0))} is VALID [2022-04-28 03:50:15,993 INFO L290 TraceCheckUtils]: 15: Hoare triple {48344#(and (= main_~z~0 0) (<= 999995 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {48345#(and (= main_~z~0 0) (<= 999994 main_~y~0))} is VALID [2022-04-28 03:50:15,994 INFO L290 TraceCheckUtils]: 16: Hoare triple {48345#(and (= main_~z~0 0) (<= 999994 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {48346#(and (= main_~z~0 0) (<= 999993 main_~y~0))} is VALID [2022-04-28 03:50:15,994 INFO L290 TraceCheckUtils]: 17: Hoare triple {48346#(and (= main_~z~0 0) (<= 999993 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {48347#(and (= main_~z~0 0) (<= 999992 main_~y~0))} is VALID [2022-04-28 03:50:15,995 INFO L290 TraceCheckUtils]: 18: Hoare triple {48347#(and (= main_~z~0 0) (<= 999992 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {48348#(and (= main_~z~0 0) (<= 999991 main_~y~0))} is VALID [2022-04-28 03:50:15,995 INFO L290 TraceCheckUtils]: 19: Hoare triple {48348#(and (= main_~z~0 0) (<= 999991 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {48349#(and (= main_~z~0 0) (<= 999990 main_~y~0))} is VALID [2022-04-28 03:50:15,996 INFO L290 TraceCheckUtils]: 20: Hoare triple {48349#(and (= main_~z~0 0) (<= 999990 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {48350#(and (= main_~z~0 0) (<= 999989 main_~y~0))} is VALID [2022-04-28 03:50:15,996 INFO L290 TraceCheckUtils]: 21: Hoare triple {48350#(and (= main_~z~0 0) (<= 999989 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {48351#(and (= main_~z~0 0) (<= 999988 main_~y~0))} is VALID [2022-04-28 03:50:15,997 INFO L290 TraceCheckUtils]: 22: Hoare triple {48351#(and (= main_~z~0 0) (<= 999988 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {48352#(and (= main_~z~0 0) (<= 999987 main_~y~0))} is VALID [2022-04-28 03:50:15,997 INFO L290 TraceCheckUtils]: 23: Hoare triple {48352#(and (= main_~z~0 0) (<= 999987 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {48353#(and (= main_~z~0 0) (<= 999986 main_~y~0))} is VALID [2022-04-28 03:50:15,998 INFO L290 TraceCheckUtils]: 24: Hoare triple {48353#(and (= main_~z~0 0) (<= 999986 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {48354#(and (= main_~z~0 0) (<= 999985 main_~y~0))} is VALID [2022-04-28 03:50:15,998 INFO L290 TraceCheckUtils]: 25: Hoare triple {48354#(and (= main_~z~0 0) (<= 999985 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {48355#(and (= main_~z~0 0) (<= 999984 main_~y~0))} is VALID [2022-04-28 03:50:15,999 INFO L290 TraceCheckUtils]: 26: Hoare triple {48355#(and (= main_~z~0 0) (<= 999984 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {48356#(and (<= 999983 main_~y~0) (= main_~z~0 0))} is VALID [2022-04-28 03:50:15,999 INFO L290 TraceCheckUtils]: 27: Hoare triple {48356#(and (<= 999983 main_~y~0) (= main_~z~0 0))} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {48357#(and (= main_~z~0 0) (<= 999982 main_~y~0))} is VALID [2022-04-28 03:50:15,999 INFO L290 TraceCheckUtils]: 28: Hoare triple {48357#(and (= main_~z~0 0) (<= 999982 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {48358#(and (= main_~z~0 0) (<= 999981 main_~y~0))} is VALID [2022-04-28 03:50:16,000 INFO L290 TraceCheckUtils]: 29: Hoare triple {48358#(and (= main_~z~0 0) (<= 999981 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {48359#(and (= main_~z~0 0) (<= 999980 main_~y~0))} is VALID [2022-04-28 03:50:16,000 INFO L290 TraceCheckUtils]: 30: Hoare triple {48359#(and (= main_~z~0 0) (<= 999980 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {48360#(and (= main_~z~0 0) (<= 999979 main_~y~0))} is VALID [2022-04-28 03:50:16,001 INFO L290 TraceCheckUtils]: 31: Hoare triple {48360#(and (= main_~z~0 0) (<= 999979 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {48361#(and (= main_~z~0 0) (<= 999978 main_~y~0))} is VALID [2022-04-28 03:50:16,001 INFO L290 TraceCheckUtils]: 32: Hoare triple {48361#(and (= main_~z~0 0) (<= 999978 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {48362#(and (= main_~z~0 0) (<= 999977 main_~y~0))} is VALID [2022-04-28 03:50:16,002 INFO L290 TraceCheckUtils]: 33: Hoare triple {48362#(and (= main_~z~0 0) (<= 999977 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {48363#(and (<= 999976 main_~y~0) (= main_~z~0 0))} is VALID [2022-04-28 03:50:16,002 INFO L290 TraceCheckUtils]: 34: Hoare triple {48363#(and (<= 999976 main_~y~0) (= main_~z~0 0))} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {48364#(and (= main_~z~0 0) (<= 999975 main_~y~0))} is VALID [2022-04-28 03:50:16,003 INFO L290 TraceCheckUtils]: 35: Hoare triple {48364#(and (= main_~z~0 0) (<= 999975 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {48365#(and (= main_~z~0 0) (<= 999974 main_~y~0))} is VALID [2022-04-28 03:50:16,003 INFO L290 TraceCheckUtils]: 36: Hoare triple {48365#(and (= main_~z~0 0) (<= 999974 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {48366#(and (= main_~z~0 0) (<= 999973 main_~y~0))} is VALID [2022-04-28 03:50:16,004 INFO L290 TraceCheckUtils]: 37: Hoare triple {48366#(and (= main_~z~0 0) (<= 999973 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {48367#(and (= main_~z~0 0) (<= 999972 main_~y~0))} is VALID [2022-04-28 03:50:16,004 INFO L290 TraceCheckUtils]: 38: Hoare triple {48367#(and (= main_~z~0 0) (<= 999972 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {48368#(and (= main_~z~0 0) (<= 999971 main_~y~0))} is VALID [2022-04-28 03:50:16,005 INFO L290 TraceCheckUtils]: 39: Hoare triple {48368#(and (= main_~z~0 0) (<= 999971 main_~y~0))} assume !(~y~0 > ~z~0); {48332#false} is VALID [2022-04-28 03:50:16,005 INFO L272 TraceCheckUtils]: 40: Hoare triple {48332#false} call __VERIFIER_assert((if ~x~0 == ~z~0 then 1 else 0)); {48332#false} is VALID [2022-04-28 03:50:16,005 INFO L290 TraceCheckUtils]: 41: Hoare triple {48332#false} ~cond := #in~cond; {48332#false} is VALID [2022-04-28 03:50:16,005 INFO L290 TraceCheckUtils]: 42: Hoare triple {48332#false} assume 0 == ~cond; {48332#false} is VALID [2022-04-28 03:50:16,005 INFO L290 TraceCheckUtils]: 43: Hoare triple {48332#false} assume !false; {48332#false} is VALID [2022-04-28 03:50:16,005 INFO L134 CoverageAnalysis]: Checked inductivity of 437 backedges. 0 proven. 437 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 03:50:16,005 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 03:50:16,005 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [745454743] [2022-04-28 03:50:16,005 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [745454743] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 03:50:16,005 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1933395269] [2022-04-28 03:50:16,005 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:50:16,005 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 03:50:16,006 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 03:50:16,006 INFO L229 MonitoredProcess]: Starting monitored process 40 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 03:50:16,008 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (40)] Waiting until timeout for monitored process [2022-04-28 03:50:16,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:50:16,058 INFO L263 TraceCheckSpWp]: Trace formula consists of 204 conjuncts, 33 conjunts are in the unsatisfiable core [2022-04-28 03:50:16,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:50:16,078 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 03:50:17,826 INFO L272 TraceCheckUtils]: 0: Hoare triple {48331#true} call ULTIMATE.init(); {48331#true} is VALID [2022-04-28 03:50:17,826 INFO L290 TraceCheckUtils]: 1: Hoare triple {48331#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(17, 2);call #Ultimate.allocInit(12, 3); {48331#true} is VALID [2022-04-28 03:50:17,826 INFO L290 TraceCheckUtils]: 2: Hoare triple {48331#true} assume true; {48331#true} is VALID [2022-04-28 03:50:17,826 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {48331#true} {48331#true} #52#return; {48331#true} is VALID [2022-04-28 03:50:17,826 INFO L272 TraceCheckUtils]: 4: Hoare triple {48331#true} call #t~ret9 := main(); {48331#true} is VALID [2022-04-28 03:50:17,827 INFO L290 TraceCheckUtils]: 5: Hoare triple {48331#true} ~x~0 := 0;~y~0 := 50000;~z~0 := 0;~x~0 := 0; {48388#(and (<= main_~z~0 0) (<= 50000 main_~y~0))} is VALID [2022-04-28 03:50:17,827 INFO L290 TraceCheckUtils]: 6: Hoare triple {48388#(and (<= main_~z~0 0) (<= 50000 main_~y~0))} [212] L11-2-->L18-1_primed: Formula: (let ((.cse0 (= |v_main_#t~post4_243| |v_main_#t~post4_242|)) (.cse1 (= v_main_~x~0_2234 v_main_~x~0_2233))) (or (and (<= 50000 v_main_~x~0_2234) .cse0 .cse1) (and .cse0 .cse1) (and (< v_main_~x~0_2234 v_main_~x~0_2233) (< v_main_~x~0_2233 50001)))) InVars {main_~x~0=v_main_~x~0_2234, main_#t~post4=|v_main_#t~post4_243|} OutVars{main_~x~0=v_main_~x~0_2233, main_#t~post4=|v_main_#t~post4_242|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {48388#(and (<= main_~z~0 0) (<= 50000 main_~y~0))} is VALID [2022-04-28 03:50:17,828 INFO L290 TraceCheckUtils]: 7: Hoare triple {48388#(and (<= main_~z~0 0) (<= 50000 main_~y~0))} [213] L18-1_primed-->L11-2: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {48388#(and (<= main_~z~0 0) (<= 50000 main_~y~0))} is VALID [2022-04-28 03:50:17,828 INFO L290 TraceCheckUtils]: 8: Hoare triple {48388#(and (<= main_~z~0 0) (<= 50000 main_~y~0))} [214] L11-2-->L18-1_primed: Formula: (let ((.cse0 (= v_main_~y~0_2466 v_main_~y~0_2465)) (.cse2 (= v_main_~x~0_2236 v_main_~x~0_2235)) (.cse3 (= |v_main_#t~post6_270| |v_main_#t~post6_269|)) (.cse4 (= |v_main_#t~post5_270| |v_main_#t~post5_269|)) (.cse1 (<= 50000 v_main_~x~0_2236))) (or (and .cse0 (or (not .cse1) (not (< v_main_~x~0_2236 1000000))) .cse2 .cse3 .cse4) (and .cse0 .cse2 .cse3 .cse4) (and .cse1 (< v_main_~x~0_2236 v_main_~x~0_2235) (< v_main_~x~0_2235 1000001) (= (+ v_main_~x~0_2236 v_main_~y~0_2465) (+ v_main_~x~0_2235 v_main_~y~0_2466))))) InVars {main_~y~0=v_main_~y~0_2466, main_#t~post5=|v_main_#t~post5_270|, main_~x~0=v_main_~x~0_2236, main_#t~post6=|v_main_#t~post6_270|} OutVars{main_~y~0=v_main_~y~0_2465, main_#t~post5=|v_main_#t~post5_269|, main_~x~0=v_main_~x~0_2235, main_#t~post6=|v_main_#t~post6_269|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {48388#(and (<= main_~z~0 0) (<= 50000 main_~y~0))} is VALID [2022-04-28 03:50:17,829 INFO L290 TraceCheckUtils]: 9: Hoare triple {48388#(and (<= main_~z~0 0) (<= 50000 main_~y~0))} [211] L18-1_primed-->L18-1: Formula: (not (< v_main_~x~0_11 1000000)) InVars {main_~x~0=v_main_~x~0_11} OutVars{main_~x~0=v_main_~x~0_11} AuxVars[] AssignedVars[] {48388#(and (<= main_~z~0 0) (<= 50000 main_~y~0))} is VALID [2022-04-28 03:50:17,829 INFO L290 TraceCheckUtils]: 10: Hoare triple {48388#(and (<= main_~z~0 0) (<= 50000 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {48404#(and (<= main_~z~0 0) (<= 49999 main_~y~0))} is VALID [2022-04-28 03:50:17,830 INFO L290 TraceCheckUtils]: 11: Hoare triple {48404#(and (<= main_~z~0 0) (<= 49999 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {48408#(and (<= main_~z~0 0) (<= 49998 main_~y~0))} is VALID [2022-04-28 03:50:17,830 INFO L290 TraceCheckUtils]: 12: Hoare triple {48408#(and (<= main_~z~0 0) (<= 49998 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {48412#(and (<= main_~z~0 0) (<= 49997 main_~y~0))} is VALID [2022-04-28 03:50:17,831 INFO L290 TraceCheckUtils]: 13: Hoare triple {48412#(and (<= main_~z~0 0) (<= 49997 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {48416#(and (<= main_~z~0 0) (<= 49996 main_~y~0))} is VALID [2022-04-28 03:50:17,831 INFO L290 TraceCheckUtils]: 14: Hoare triple {48416#(and (<= main_~z~0 0) (<= 49996 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {48420#(and (<= main_~z~0 0) (<= 49995 main_~y~0))} is VALID [2022-04-28 03:50:17,832 INFO L290 TraceCheckUtils]: 15: Hoare triple {48420#(and (<= main_~z~0 0) (<= 49995 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {48424#(and (<= main_~z~0 0) (<= 49994 main_~y~0))} is VALID [2022-04-28 03:50:17,835 INFO L290 TraceCheckUtils]: 16: Hoare triple {48424#(and (<= main_~z~0 0) (<= 49994 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {48428#(and (<= main_~z~0 0) (<= 49993 main_~y~0))} is VALID [2022-04-28 03:50:17,836 INFO L290 TraceCheckUtils]: 17: Hoare triple {48428#(and (<= main_~z~0 0) (<= 49993 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {48432#(and (<= main_~z~0 0) (<= 49992 main_~y~0))} is VALID [2022-04-28 03:50:17,837 INFO L290 TraceCheckUtils]: 18: Hoare triple {48432#(and (<= main_~z~0 0) (<= 49992 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {48436#(and (<= main_~z~0 0) (<= 49991 main_~y~0))} is VALID [2022-04-28 03:50:17,837 INFO L290 TraceCheckUtils]: 19: Hoare triple {48436#(and (<= main_~z~0 0) (<= 49991 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {48440#(and (<= main_~z~0 0) (<= 49990 main_~y~0))} is VALID [2022-04-28 03:50:17,838 INFO L290 TraceCheckUtils]: 20: Hoare triple {48440#(and (<= main_~z~0 0) (<= 49990 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {48444#(and (<= main_~z~0 0) (<= 49989 main_~y~0))} is VALID [2022-04-28 03:50:17,839 INFO L290 TraceCheckUtils]: 21: Hoare triple {48444#(and (<= main_~z~0 0) (<= 49989 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {48448#(and (<= main_~z~0 0) (<= 49988 main_~y~0))} is VALID [2022-04-28 03:50:17,839 INFO L290 TraceCheckUtils]: 22: Hoare triple {48448#(and (<= main_~z~0 0) (<= 49988 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {48452#(and (<= main_~z~0 0) (<= 49987 main_~y~0))} is VALID [2022-04-28 03:50:17,840 INFO L290 TraceCheckUtils]: 23: Hoare triple {48452#(and (<= main_~z~0 0) (<= 49987 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {48456#(and (<= main_~z~0 0) (<= 49986 main_~y~0))} is VALID [2022-04-28 03:50:17,840 INFO L290 TraceCheckUtils]: 24: Hoare triple {48456#(and (<= main_~z~0 0) (<= 49986 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {48460#(and (<= main_~z~0 0) (<= 49985 main_~y~0))} is VALID [2022-04-28 03:50:17,841 INFO L290 TraceCheckUtils]: 25: Hoare triple {48460#(and (<= main_~z~0 0) (<= 49985 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {48464#(and (<= main_~z~0 0) (<= 49984 main_~y~0))} is VALID [2022-04-28 03:50:17,841 INFO L290 TraceCheckUtils]: 26: Hoare triple {48464#(and (<= main_~z~0 0) (<= 49984 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {48468#(and (<= main_~z~0 0) (<= 49983 main_~y~0))} is VALID [2022-04-28 03:50:17,842 INFO L290 TraceCheckUtils]: 27: Hoare triple {48468#(and (<= main_~z~0 0) (<= 49983 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {48472#(and (<= main_~z~0 0) (<= 49982 main_~y~0))} is VALID [2022-04-28 03:50:17,842 INFO L290 TraceCheckUtils]: 28: Hoare triple {48472#(and (<= main_~z~0 0) (<= 49982 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {48476#(and (<= main_~z~0 0) (<= 49981 main_~y~0))} is VALID [2022-04-28 03:50:17,843 INFO L290 TraceCheckUtils]: 29: Hoare triple {48476#(and (<= main_~z~0 0) (<= 49981 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {48480#(and (<= main_~z~0 0) (<= 49980 main_~y~0))} is VALID [2022-04-28 03:50:17,844 INFO L290 TraceCheckUtils]: 30: Hoare triple {48480#(and (<= main_~z~0 0) (<= 49980 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {48484#(and (<= main_~z~0 0) (<= 49979 main_~y~0))} is VALID [2022-04-28 03:50:17,844 INFO L290 TraceCheckUtils]: 31: Hoare triple {48484#(and (<= main_~z~0 0) (<= 49979 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {48488#(and (<= main_~z~0 0) (<= 49978 main_~y~0))} is VALID [2022-04-28 03:50:17,845 INFO L290 TraceCheckUtils]: 32: Hoare triple {48488#(and (<= main_~z~0 0) (<= 49978 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {48492#(and (<= main_~z~0 0) (<= 49977 main_~y~0))} is VALID [2022-04-28 03:50:17,845 INFO L290 TraceCheckUtils]: 33: Hoare triple {48492#(and (<= main_~z~0 0) (<= 49977 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {48496#(and (<= main_~z~0 0) (<= 49976 main_~y~0))} is VALID [2022-04-28 03:50:17,846 INFO L290 TraceCheckUtils]: 34: Hoare triple {48496#(and (<= main_~z~0 0) (<= 49976 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {48500#(and (<= main_~z~0 0) (<= 49975 main_~y~0))} is VALID [2022-04-28 03:50:17,846 INFO L290 TraceCheckUtils]: 35: Hoare triple {48500#(and (<= main_~z~0 0) (<= 49975 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {48504#(and (<= main_~z~0 0) (<= 49974 main_~y~0))} is VALID [2022-04-28 03:50:17,847 INFO L290 TraceCheckUtils]: 36: Hoare triple {48504#(and (<= main_~z~0 0) (<= 49974 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {48508#(and (<= main_~z~0 0) (<= 49973 main_~y~0))} is VALID [2022-04-28 03:50:17,847 INFO L290 TraceCheckUtils]: 37: Hoare triple {48508#(and (<= main_~z~0 0) (<= 49973 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {48512#(and (<= main_~z~0 0) (<= 49972 main_~y~0))} is VALID [2022-04-28 03:50:17,848 INFO L290 TraceCheckUtils]: 38: Hoare triple {48512#(and (<= main_~z~0 0) (<= 49972 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {48516#(and (<= main_~z~0 0) (<= 49971 main_~y~0))} is VALID [2022-04-28 03:50:17,848 INFO L290 TraceCheckUtils]: 39: Hoare triple {48516#(and (<= main_~z~0 0) (<= 49971 main_~y~0))} assume !(~y~0 > ~z~0); {48332#false} is VALID [2022-04-28 03:50:17,848 INFO L272 TraceCheckUtils]: 40: Hoare triple {48332#false} call __VERIFIER_assert((if ~x~0 == ~z~0 then 1 else 0)); {48332#false} is VALID [2022-04-28 03:50:17,848 INFO L290 TraceCheckUtils]: 41: Hoare triple {48332#false} ~cond := #in~cond; {48332#false} is VALID [2022-04-28 03:50:17,848 INFO L290 TraceCheckUtils]: 42: Hoare triple {48332#false} assume 0 == ~cond; {48332#false} is VALID [2022-04-28 03:50:17,848 INFO L290 TraceCheckUtils]: 43: Hoare triple {48332#false} assume !false; {48332#false} is VALID [2022-04-28 03:50:17,849 INFO L134 CoverageAnalysis]: Checked inductivity of 437 backedges. 0 proven. 435 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-04-28 03:50:17,849 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 03:50:20,151 INFO L290 TraceCheckUtils]: 43: Hoare triple {48332#false} assume !false; {48332#false} is VALID [2022-04-28 03:50:20,151 INFO L290 TraceCheckUtils]: 42: Hoare triple {48332#false} assume 0 == ~cond; {48332#false} is VALID [2022-04-28 03:50:20,151 INFO L290 TraceCheckUtils]: 41: Hoare triple {48332#false} ~cond := #in~cond; {48332#false} is VALID [2022-04-28 03:50:20,151 INFO L272 TraceCheckUtils]: 40: Hoare triple {48332#false} call __VERIFIER_assert((if ~x~0 == ~z~0 then 1 else 0)); {48332#false} is VALID [2022-04-28 03:50:20,151 INFO L290 TraceCheckUtils]: 39: Hoare triple {48544#(< main_~z~0 main_~y~0)} assume !(~y~0 > ~z~0); {48332#false} is VALID [2022-04-28 03:50:20,152 INFO L290 TraceCheckUtils]: 38: Hoare triple {48548#(< (+ main_~z~0 1) main_~y~0)} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {48544#(< main_~z~0 main_~y~0)} is VALID [2022-04-28 03:50:20,152 INFO L290 TraceCheckUtils]: 37: Hoare triple {48552#(< (+ main_~z~0 2) main_~y~0)} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {48548#(< (+ main_~z~0 1) main_~y~0)} is VALID [2022-04-28 03:50:20,153 INFO L290 TraceCheckUtils]: 36: Hoare triple {48556#(< (+ main_~z~0 3) main_~y~0)} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {48552#(< (+ main_~z~0 2) main_~y~0)} is VALID [2022-04-28 03:50:20,153 INFO L290 TraceCheckUtils]: 35: Hoare triple {48560#(< (+ main_~z~0 4) main_~y~0)} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {48556#(< (+ main_~z~0 3) main_~y~0)} is VALID [2022-04-28 03:50:20,154 INFO L290 TraceCheckUtils]: 34: Hoare triple {48564#(< (+ 5 main_~z~0) main_~y~0)} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {48560#(< (+ main_~z~0 4) main_~y~0)} is VALID [2022-04-28 03:50:20,154 INFO L290 TraceCheckUtils]: 33: Hoare triple {48568#(< (+ main_~z~0 6) main_~y~0)} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {48564#(< (+ 5 main_~z~0) main_~y~0)} is VALID [2022-04-28 03:50:20,155 INFO L290 TraceCheckUtils]: 32: Hoare triple {48572#(< (+ 7 main_~z~0) main_~y~0)} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {48568#(< (+ main_~z~0 6) main_~y~0)} is VALID [2022-04-28 03:50:20,155 INFO L290 TraceCheckUtils]: 31: Hoare triple {48576#(< (+ main_~z~0 8) main_~y~0)} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {48572#(< (+ 7 main_~z~0) main_~y~0)} is VALID [2022-04-28 03:50:20,156 INFO L290 TraceCheckUtils]: 30: Hoare triple {48580#(< (+ main_~z~0 9) main_~y~0)} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {48576#(< (+ main_~z~0 8) main_~y~0)} is VALID [2022-04-28 03:50:20,156 INFO L290 TraceCheckUtils]: 29: Hoare triple {48584#(< (+ main_~z~0 10) main_~y~0)} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {48580#(< (+ main_~z~0 9) main_~y~0)} is VALID [2022-04-28 03:50:20,157 INFO L290 TraceCheckUtils]: 28: Hoare triple {48588#(< (+ main_~z~0 11) main_~y~0)} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {48584#(< (+ main_~z~0 10) main_~y~0)} is VALID [2022-04-28 03:50:20,157 INFO L290 TraceCheckUtils]: 27: Hoare triple {48592#(< (+ main_~z~0 12) main_~y~0)} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {48588#(< (+ main_~z~0 11) main_~y~0)} is VALID [2022-04-28 03:50:20,157 INFO L290 TraceCheckUtils]: 26: Hoare triple {48596#(< (+ main_~z~0 13) main_~y~0)} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {48592#(< (+ main_~z~0 12) main_~y~0)} is VALID [2022-04-28 03:50:20,158 INFO L290 TraceCheckUtils]: 25: Hoare triple {48600#(< (+ main_~z~0 14) main_~y~0)} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {48596#(< (+ main_~z~0 13) main_~y~0)} is VALID [2022-04-28 03:50:20,158 INFO L290 TraceCheckUtils]: 24: Hoare triple {48604#(< (+ main_~z~0 15) main_~y~0)} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {48600#(< (+ main_~z~0 14) main_~y~0)} is VALID [2022-04-28 03:50:20,159 INFO L290 TraceCheckUtils]: 23: Hoare triple {48608#(< (+ main_~z~0 16) main_~y~0)} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {48604#(< (+ main_~z~0 15) main_~y~0)} is VALID [2022-04-28 03:50:20,159 INFO L290 TraceCheckUtils]: 22: Hoare triple {48612#(< (+ main_~z~0 17) main_~y~0)} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {48608#(< (+ main_~z~0 16) main_~y~0)} is VALID [2022-04-28 03:50:20,160 INFO L290 TraceCheckUtils]: 21: Hoare triple {48616#(< (+ main_~z~0 18) main_~y~0)} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {48612#(< (+ main_~z~0 17) main_~y~0)} is VALID [2022-04-28 03:50:20,160 INFO L290 TraceCheckUtils]: 20: Hoare triple {48620#(< (+ 19 main_~z~0) main_~y~0)} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {48616#(< (+ main_~z~0 18) main_~y~0)} is VALID [2022-04-28 03:50:20,161 INFO L290 TraceCheckUtils]: 19: Hoare triple {48624#(< (+ main_~z~0 20) main_~y~0)} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {48620#(< (+ 19 main_~z~0) main_~y~0)} is VALID [2022-04-28 03:50:20,161 INFO L290 TraceCheckUtils]: 18: Hoare triple {48628#(< (+ main_~z~0 21) main_~y~0)} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {48624#(< (+ main_~z~0 20) main_~y~0)} is VALID [2022-04-28 03:50:20,162 INFO L290 TraceCheckUtils]: 17: Hoare triple {48632#(< (+ main_~z~0 22) main_~y~0)} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {48628#(< (+ main_~z~0 21) main_~y~0)} is VALID [2022-04-28 03:50:20,162 INFO L290 TraceCheckUtils]: 16: Hoare triple {48636#(< (+ 23 main_~z~0) main_~y~0)} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {48632#(< (+ main_~z~0 22) main_~y~0)} is VALID [2022-04-28 03:50:20,163 INFO L290 TraceCheckUtils]: 15: Hoare triple {48640#(< (+ main_~z~0 24) main_~y~0)} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {48636#(< (+ 23 main_~z~0) main_~y~0)} is VALID [2022-04-28 03:50:20,163 INFO L290 TraceCheckUtils]: 14: Hoare triple {48644#(< (+ main_~z~0 25) main_~y~0)} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {48640#(< (+ main_~z~0 24) main_~y~0)} is VALID [2022-04-28 03:50:20,164 INFO L290 TraceCheckUtils]: 13: Hoare triple {48648#(< (+ main_~z~0 26) main_~y~0)} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {48644#(< (+ main_~z~0 25) main_~y~0)} is VALID [2022-04-28 03:50:20,164 INFO L290 TraceCheckUtils]: 12: Hoare triple {48652#(< (+ main_~z~0 27) main_~y~0)} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {48648#(< (+ main_~z~0 26) main_~y~0)} is VALID [2022-04-28 03:50:20,165 INFO L290 TraceCheckUtils]: 11: Hoare triple {48656#(< (+ main_~z~0 28) main_~y~0)} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {48652#(< (+ main_~z~0 27) main_~y~0)} is VALID [2022-04-28 03:50:20,165 INFO L290 TraceCheckUtils]: 10: Hoare triple {48660#(< (+ 29 main_~z~0) main_~y~0)} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {48656#(< (+ main_~z~0 28) main_~y~0)} is VALID [2022-04-28 03:50:20,165 INFO L290 TraceCheckUtils]: 9: Hoare triple {48660#(< (+ 29 main_~z~0) main_~y~0)} [211] L18-1_primed-->L18-1: Formula: (not (< v_main_~x~0_11 1000000)) InVars {main_~x~0=v_main_~x~0_11} OutVars{main_~x~0=v_main_~x~0_11} AuxVars[] AssignedVars[] {48660#(< (+ 29 main_~z~0) main_~y~0)} is VALID [2022-04-28 03:50:20,166 INFO L290 TraceCheckUtils]: 8: Hoare triple {48660#(< (+ 29 main_~z~0) main_~y~0)} [214] L11-2-->L18-1_primed: Formula: (let ((.cse0 (= v_main_~y~0_2466 v_main_~y~0_2465)) (.cse2 (= v_main_~x~0_2236 v_main_~x~0_2235)) (.cse3 (= |v_main_#t~post6_270| |v_main_#t~post6_269|)) (.cse4 (= |v_main_#t~post5_270| |v_main_#t~post5_269|)) (.cse1 (<= 50000 v_main_~x~0_2236))) (or (and .cse0 (or (not .cse1) (not (< v_main_~x~0_2236 1000000))) .cse2 .cse3 .cse4) (and .cse0 .cse2 .cse3 .cse4) (and .cse1 (< v_main_~x~0_2236 v_main_~x~0_2235) (< v_main_~x~0_2235 1000001) (= (+ v_main_~x~0_2236 v_main_~y~0_2465) (+ v_main_~x~0_2235 v_main_~y~0_2466))))) InVars {main_~y~0=v_main_~y~0_2466, main_#t~post5=|v_main_#t~post5_270|, main_~x~0=v_main_~x~0_2236, main_#t~post6=|v_main_#t~post6_270|} OutVars{main_~y~0=v_main_~y~0_2465, main_#t~post5=|v_main_#t~post5_269|, main_~x~0=v_main_~x~0_2235, main_#t~post6=|v_main_#t~post6_269|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {48660#(< (+ 29 main_~z~0) main_~y~0)} is VALID [2022-04-28 03:50:20,166 INFO L290 TraceCheckUtils]: 7: Hoare triple {48660#(< (+ 29 main_~z~0) main_~y~0)} [213] L18-1_primed-->L11-2: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {48660#(< (+ 29 main_~z~0) main_~y~0)} is VALID [2022-04-28 03:50:20,167 INFO L290 TraceCheckUtils]: 6: Hoare triple {48660#(< (+ 29 main_~z~0) main_~y~0)} [212] L11-2-->L18-1_primed: Formula: (let ((.cse0 (= |v_main_#t~post4_243| |v_main_#t~post4_242|)) (.cse1 (= v_main_~x~0_2234 v_main_~x~0_2233))) (or (and (<= 50000 v_main_~x~0_2234) .cse0 .cse1) (and .cse0 .cse1) (and (< v_main_~x~0_2234 v_main_~x~0_2233) (< v_main_~x~0_2233 50001)))) InVars {main_~x~0=v_main_~x~0_2234, main_#t~post4=|v_main_#t~post4_243|} OutVars{main_~x~0=v_main_~x~0_2233, main_#t~post4=|v_main_#t~post4_242|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {48660#(< (+ 29 main_~z~0) main_~y~0)} is VALID [2022-04-28 03:50:20,167 INFO L290 TraceCheckUtils]: 5: Hoare triple {48331#true} ~x~0 := 0;~y~0 := 50000;~z~0 := 0;~x~0 := 0; {48660#(< (+ 29 main_~z~0) main_~y~0)} is VALID [2022-04-28 03:50:20,167 INFO L272 TraceCheckUtils]: 4: Hoare triple {48331#true} call #t~ret9 := main(); {48331#true} is VALID [2022-04-28 03:50:20,167 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {48331#true} {48331#true} #52#return; {48331#true} is VALID [2022-04-28 03:50:20,167 INFO L290 TraceCheckUtils]: 2: Hoare triple {48331#true} assume true; {48331#true} is VALID [2022-04-28 03:50:20,167 INFO L290 TraceCheckUtils]: 1: Hoare triple {48331#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(17, 2);call #Ultimate.allocInit(12, 3); {48331#true} is VALID [2022-04-28 03:50:20,167 INFO L272 TraceCheckUtils]: 0: Hoare triple {48331#true} call ULTIMATE.init(); {48331#true} is VALID [2022-04-28 03:50:20,167 INFO L134 CoverageAnalysis]: Checked inductivity of 437 backedges. 0 proven. 435 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-04-28 03:50:20,168 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1933395269] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 03:50:20,168 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 03:50:20,168 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [36, 32, 32] total 96 [2022-04-28 03:50:23,438 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 03:50:23,438 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [538473967] [2022-04-28 03:50:23,438 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [538473967] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 03:50:23,438 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 03:50:23,438 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [87] imperfect sequences [] total 87 [2022-04-28 03:50:23,438 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1585323773] [2022-04-28 03:50:23,438 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 03:50:23,439 INFO L78 Accepts]: Start accepts. Automaton has has 87 states, 87 states have (on average 1.6436781609195403) internal successors, (143), 86 states have internal predecessors, (143), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 147 [2022-04-28 03:50:23,439 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 03:50:23,439 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 87 states, 87 states have (on average 1.6436781609195403) internal successors, (143), 86 states have internal predecessors, (143), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:50:23,546 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 147 edges. 147 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 03:50:23,546 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 87 states [2022-04-28 03:50:23,546 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 03:50:23,547 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 87 interpolants. [2022-04-28 03:50:23,548 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7663, Invalid=14687, Unknown=0, NotChecked=0, Total=22350 [2022-04-28 03:50:23,548 INFO L87 Difference]: Start difference. First operand 244 states and 248 transitions. Second operand has 87 states, 87 states have (on average 1.6436781609195403) internal successors, (143), 86 states have internal predecessors, (143), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:50:36,430 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:50:36,431 INFO L93 Difference]: Finished difference Result 378 states and 387 transitions. [2022-04-28 03:50:36,431 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 57 states. [2022-04-28 03:50:36,431 INFO L78 Accepts]: Start accepts. Automaton has has 87 states, 87 states have (on average 1.6436781609195403) internal successors, (143), 86 states have internal predecessors, (143), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 147 [2022-04-28 03:50:36,431 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 03:50:36,431 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 87 states, 87 states have (on average 1.6436781609195403) internal successors, (143), 86 states have internal predecessors, (143), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:50:36,432 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 137 transitions. [2022-04-28 03:50:36,432 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 87 states, 87 states have (on average 1.6436781609195403) internal successors, (143), 86 states have internal predecessors, (143), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:50:36,432 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 137 transitions. [2022-04-28 03:50:36,432 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 57 states and 137 transitions. [2022-04-28 03:50:36,557 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 137 edges. 137 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 03:50:36,561 INFO L225 Difference]: With dead ends: 378 [2022-04-28 03:50:36,561 INFO L226 Difference]: Without dead ends: 246 [2022-04-28 03:50:36,564 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 290 GetRequests, 86 SyntacticMatches, 2 SemanticMatches, 202 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10093 ImplicationChecksByTransitivity, 8.6s TimeCoverageRelationStatistics Valid=11177, Invalid=30235, Unknown=0, NotChecked=0, Total=41412 [2022-04-28 03:50:36,565 INFO L413 NwaCegarLoop]: 13 mSDtfsCounter, 64 mSDsluCounter, 282 mSDsCounter, 0 mSdLazyCounter, 6556 mSolverCounterSat, 59 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 64 SdHoareTripleChecker+Valid, 295 SdHoareTripleChecker+Invalid, 6615 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 59 IncrementalHoareTripleChecker+Valid, 6556 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.2s IncrementalHoareTripleChecker+Time [2022-04-28 03:50:36,565 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [64 Valid, 295 Invalid, 6615 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [59 Valid, 6556 Invalid, 0 Unknown, 0 Unchecked, 5.2s Time] [2022-04-28 03:50:36,565 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 246 states. [2022-04-28 03:50:37,176 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 246 to 246. [2022-04-28 03:50:37,176 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 03:50:37,177 INFO L82 GeneralOperation]: Start isEquivalent. First operand 246 states. Second operand has 246 states, 241 states have (on average 1.020746887966805) internal successors, (246), 241 states have internal predecessors, (246), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:50:37,177 INFO L74 IsIncluded]: Start isIncluded. First operand 246 states. Second operand has 246 states, 241 states have (on average 1.020746887966805) internal successors, (246), 241 states have internal predecessors, (246), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:50:37,177 INFO L87 Difference]: Start difference. First operand 246 states. Second operand has 246 states, 241 states have (on average 1.020746887966805) internal successors, (246), 241 states have internal predecessors, (246), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:50:37,180 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:50:37,180 INFO L93 Difference]: Finished difference Result 246 states and 250 transitions. [2022-04-28 03:50:37,181 INFO L276 IsEmpty]: Start isEmpty. Operand 246 states and 250 transitions. [2022-04-28 03:50:37,181 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:50:37,181 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:50:37,181 INFO L74 IsIncluded]: Start isIncluded. First operand has 246 states, 241 states have (on average 1.020746887966805) internal successors, (246), 241 states have internal predecessors, (246), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 246 states. [2022-04-28 03:50:37,181 INFO L87 Difference]: Start difference. First operand has 246 states, 241 states have (on average 1.020746887966805) internal successors, (246), 241 states have internal predecessors, (246), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 246 states. [2022-04-28 03:50:37,183 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:50:37,183 INFO L93 Difference]: Finished difference Result 246 states and 250 transitions. [2022-04-28 03:50:37,183 INFO L276 IsEmpty]: Start isEmpty. Operand 246 states and 250 transitions. [2022-04-28 03:50:37,184 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:50:37,184 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:50:37,184 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 03:50:37,184 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 03:50:37,184 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 246 states, 241 states have (on average 1.020746887966805) internal successors, (246), 241 states have internal predecessors, (246), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:50:37,187 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 246 states to 246 states and 250 transitions. [2022-04-28 03:50:37,187 INFO L78 Accepts]: Start accepts. Automaton has 246 states and 250 transitions. Word has length 147 [2022-04-28 03:50:37,187 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 03:50:37,187 INFO L495 AbstractCegarLoop]: Abstraction has 246 states and 250 transitions. [2022-04-28 03:50:37,187 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 87 states, 87 states have (on average 1.6436781609195403) internal successors, (143), 86 states have internal predecessors, (143), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:50:37,187 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 246 states and 250 transitions. [2022-04-28 03:50:37,424 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 250 edges. 250 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 03:50:37,424 INFO L276 IsEmpty]: Start isEmpty. Operand 246 states and 250 transitions. [2022-04-28 03:50:37,425 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 150 [2022-04-28 03:50:37,425 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 03:50:37,425 INFO L195 NwaCegarLoop]: trace histogram [54, 53, 29, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 03:50:37,441 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (40)] Forceful destruction successful, exit code 0 [2022-04-28 03:50:37,625 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 40 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable41 [2022-04-28 03:50:37,626 INFO L420 AbstractCegarLoop]: === Iteration 43 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 03:50:37,626 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 03:50:37,626 INFO L85 PathProgramCache]: Analyzing trace with hash 467601408, now seen corresponding path program 40 times [2022-04-28 03:50:37,626 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 03:50:37,626 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [747074137] [2022-04-28 03:50:41,175 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 1 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 03:50:41,414 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={1=1, 2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 03:50:41,415 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-28 03:50:41,417 INFO L85 PathProgramCache]: Analyzing trace with hash -444987454, now seen corresponding path program 1 times [2022-04-28 03:50:41,417 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 03:50:41,417 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [599546736] [2022-04-28 03:50:41,417 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:50:41,418 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 03:50:41,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:50:42,161 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 03:50:42,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:50:42,165 INFO L290 TraceCheckUtils]: 0: Hoare triple {50631#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(17, 2);call #Ultimate.allocInit(12, 3); {50595#true} is VALID [2022-04-28 03:50:42,165 INFO L290 TraceCheckUtils]: 1: Hoare triple {50595#true} assume true; {50595#true} is VALID [2022-04-28 03:50:42,165 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {50595#true} {50595#true} #52#return; {50595#true} is VALID [2022-04-28 03:50:42,166 INFO L272 TraceCheckUtils]: 0: Hoare triple {50595#true} call ULTIMATE.init(); {50631#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 03:50:42,166 INFO L290 TraceCheckUtils]: 1: Hoare triple {50631#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(17, 2);call #Ultimate.allocInit(12, 3); {50595#true} is VALID [2022-04-28 03:50:42,166 INFO L290 TraceCheckUtils]: 2: Hoare triple {50595#true} assume true; {50595#true} is VALID [2022-04-28 03:50:42,166 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {50595#true} {50595#true} #52#return; {50595#true} is VALID [2022-04-28 03:50:42,166 INFO L272 TraceCheckUtils]: 4: Hoare triple {50595#true} call #t~ret9 := main(); {50595#true} is VALID [2022-04-28 03:50:42,167 INFO L290 TraceCheckUtils]: 5: Hoare triple {50595#true} ~x~0 := 0;~y~0 := 50000;~z~0 := 0;~x~0 := 0; {50600#(and (= main_~z~0 0) (<= 50000 main_~y~0))} is VALID [2022-04-28 03:50:42,167 INFO L290 TraceCheckUtils]: 6: Hoare triple {50600#(and (= main_~z~0 0) (<= 50000 main_~y~0))} [216] L11-2-->L18-1_primed: Formula: (let ((.cse0 (= |v_main_#t~post4_249| |v_main_#t~post4_248|)) (.cse1 (= v_main_~x~0_2332 v_main_~x~0_2331))) (or (and .cse0 .cse1) (and .cse0 (<= 50000 v_main_~x~0_2332) .cse1) (and (< v_main_~x~0_2331 50001) (< v_main_~x~0_2332 v_main_~x~0_2331)))) InVars {main_~x~0=v_main_~x~0_2332, main_#t~post4=|v_main_#t~post4_249|} OutVars{main_~x~0=v_main_~x~0_2331, main_#t~post4=|v_main_#t~post4_248|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {50600#(and (= main_~z~0 0) (<= 50000 main_~y~0))} is VALID [2022-04-28 03:50:42,168 INFO L290 TraceCheckUtils]: 7: Hoare triple {50600#(and (= main_~z~0 0) (<= 50000 main_~y~0))} [217] L18-1_primed-->L11-2: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {50600#(and (= main_~z~0 0) (<= 50000 main_~y~0))} is VALID [2022-04-28 03:50:42,169 INFO L290 TraceCheckUtils]: 8: Hoare triple {50600#(and (= main_~z~0 0) (<= 50000 main_~y~0))} [218] L11-2-->L18-1_primed: Formula: (let ((.cse0 (= |v_main_#t~post6_277| |v_main_#t~post6_276|)) (.cse1 (= |v_main_#t~post5_277| |v_main_#t~post5_276|)) (.cse2 (= v_main_~x~0_2334 v_main_~x~0_2333)) (.cse3 (= v_main_~y~0_2585 v_main_~y~0_2584)) (.cse4 (<= 50000 v_main_~x~0_2334))) (or (and .cse0 .cse1 .cse2 .cse3) (and .cse0 .cse1 .cse2 (or (not .cse4) (not (< v_main_~x~0_2334 1000000))) .cse3) (let ((.cse5 (+ v_main_~x~0_2334 v_main_~y~0_2584))) (and (= .cse5 (+ v_main_~x~0_2333 v_main_~y~0_2585)) (< v_main_~y~0_2585 v_main_~y~0_2584) .cse4 (< .cse5 (+ 1000001 v_main_~y~0_2585)))))) InVars {main_~y~0=v_main_~y~0_2585, main_#t~post5=|v_main_#t~post5_277|, main_~x~0=v_main_~x~0_2334, main_#t~post6=|v_main_#t~post6_277|} OutVars{main_~y~0=v_main_~y~0_2584, main_#t~post5=|v_main_#t~post5_276|, main_~x~0=v_main_~x~0_2333, main_#t~post6=|v_main_#t~post6_276|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {50601#(and (= main_~z~0 0) (<= 30 main_~y~0))} is VALID [2022-04-28 03:50:42,169 INFO L290 TraceCheckUtils]: 9: Hoare triple {50601#(and (= main_~z~0 0) (<= 30 main_~y~0))} [215] L18-1_primed-->L18-1: Formula: (not (< v_main_~x~0_11 1000000)) InVars {main_~x~0=v_main_~x~0_11} OutVars{main_~x~0=v_main_~x~0_11} AuxVars[] AssignedVars[] {50601#(and (= main_~z~0 0) (<= 30 main_~y~0))} is VALID [2022-04-28 03:50:42,170 INFO L290 TraceCheckUtils]: 10: Hoare triple {50601#(and (= main_~z~0 0) (<= 30 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {50602#(and (<= 29 main_~y~0) (= main_~z~0 0))} is VALID [2022-04-28 03:50:42,170 INFO L290 TraceCheckUtils]: 11: Hoare triple {50602#(and (<= 29 main_~y~0) (= main_~z~0 0))} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {50603#(and (= main_~z~0 0) (<= 28 main_~y~0))} is VALID [2022-04-28 03:50:42,171 INFO L290 TraceCheckUtils]: 12: Hoare triple {50603#(and (= main_~z~0 0) (<= 28 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {50604#(and (= main_~z~0 0) (<= 27 main_~y~0))} is VALID [2022-04-28 03:50:42,172 INFO L290 TraceCheckUtils]: 13: Hoare triple {50604#(and (= main_~z~0 0) (<= 27 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {50605#(and (= main_~z~0 0) (<= 26 main_~y~0))} is VALID [2022-04-28 03:50:42,172 INFO L290 TraceCheckUtils]: 14: Hoare triple {50605#(and (= main_~z~0 0) (<= 26 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {50606#(and (= main_~z~0 0) (<= 25 main_~y~0))} is VALID [2022-04-28 03:50:42,173 INFO L290 TraceCheckUtils]: 15: Hoare triple {50606#(and (= main_~z~0 0) (<= 25 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {50607#(and (= main_~z~0 0) (<= 24 main_~y~0))} is VALID [2022-04-28 03:50:42,173 INFO L290 TraceCheckUtils]: 16: Hoare triple {50607#(and (= main_~z~0 0) (<= 24 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {50608#(and (= main_~z~0 0) (<= 23 main_~y~0))} is VALID [2022-04-28 03:50:42,174 INFO L290 TraceCheckUtils]: 17: Hoare triple {50608#(and (= main_~z~0 0) (<= 23 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {50609#(and (= main_~z~0 0) (<= 22 main_~y~0))} is VALID [2022-04-28 03:50:42,175 INFO L290 TraceCheckUtils]: 18: Hoare triple {50609#(and (= main_~z~0 0) (<= 22 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {50610#(and (= main_~z~0 0) (<= 21 main_~y~0))} is VALID [2022-04-28 03:50:42,175 INFO L290 TraceCheckUtils]: 19: Hoare triple {50610#(and (= main_~z~0 0) (<= 21 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {50611#(and (= main_~z~0 0) (<= 20 main_~y~0))} is VALID [2022-04-28 03:50:42,176 INFO L290 TraceCheckUtils]: 20: Hoare triple {50611#(and (= main_~z~0 0) (<= 20 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {50612#(and (= main_~z~0 0) (<= 19 main_~y~0))} is VALID [2022-04-28 03:50:42,177 INFO L290 TraceCheckUtils]: 21: Hoare triple {50612#(and (= main_~z~0 0) (<= 19 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {50613#(and (= main_~z~0 0) (<= 18 main_~y~0))} is VALID [2022-04-28 03:50:42,177 INFO L290 TraceCheckUtils]: 22: Hoare triple {50613#(and (= main_~z~0 0) (<= 18 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {50614#(and (= main_~z~0 0) (<= 17 main_~y~0))} is VALID [2022-04-28 03:50:42,178 INFO L290 TraceCheckUtils]: 23: Hoare triple {50614#(and (= main_~z~0 0) (<= 17 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {50615#(and (= main_~z~0 0) (<= 16 main_~y~0))} is VALID [2022-04-28 03:50:42,178 INFO L290 TraceCheckUtils]: 24: Hoare triple {50615#(and (= main_~z~0 0) (<= 16 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {50616#(and (= main_~z~0 0) (<= 15 main_~y~0))} is VALID [2022-04-28 03:50:42,179 INFO L290 TraceCheckUtils]: 25: Hoare triple {50616#(and (= main_~z~0 0) (<= 15 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {50617#(and (= main_~z~0 0) (<= 14 main_~y~0))} is VALID [2022-04-28 03:50:42,180 INFO L290 TraceCheckUtils]: 26: Hoare triple {50617#(and (= main_~z~0 0) (<= 14 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {50618#(and (= main_~z~0 0) (<= 13 main_~y~0))} is VALID [2022-04-28 03:50:42,180 INFO L290 TraceCheckUtils]: 27: Hoare triple {50618#(and (= main_~z~0 0) (<= 13 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {50619#(and (= main_~z~0 0) (<= 12 main_~y~0))} is VALID [2022-04-28 03:50:42,181 INFO L290 TraceCheckUtils]: 28: Hoare triple {50619#(and (= main_~z~0 0) (<= 12 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {50620#(and (= main_~z~0 0) (<= 11 main_~y~0))} is VALID [2022-04-28 03:50:42,181 INFO L290 TraceCheckUtils]: 29: Hoare triple {50620#(and (= main_~z~0 0) (<= 11 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {50621#(and (= main_~z~0 0) (<= 10 main_~y~0))} is VALID [2022-04-28 03:50:42,182 INFO L290 TraceCheckUtils]: 30: Hoare triple {50621#(and (= main_~z~0 0) (<= 10 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {50622#(and (= main_~z~0 0) (<= 9 main_~y~0))} is VALID [2022-04-28 03:50:42,183 INFO L290 TraceCheckUtils]: 31: Hoare triple {50622#(and (= main_~z~0 0) (<= 9 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {50623#(and (= main_~z~0 0) (<= 8 main_~y~0))} is VALID [2022-04-28 03:50:42,183 INFO L290 TraceCheckUtils]: 32: Hoare triple {50623#(and (= main_~z~0 0) (<= 8 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {50624#(and (= main_~z~0 0) (<= 7 main_~y~0))} is VALID [2022-04-28 03:50:42,184 INFO L290 TraceCheckUtils]: 33: Hoare triple {50624#(and (= main_~z~0 0) (<= 7 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {50625#(and (= main_~z~0 0) (<= 6 main_~y~0))} is VALID [2022-04-28 03:50:42,184 INFO L290 TraceCheckUtils]: 34: Hoare triple {50625#(and (= main_~z~0 0) (<= 6 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {50626#(and (= main_~z~0 0) (<= 5 main_~y~0))} is VALID [2022-04-28 03:50:42,185 INFO L290 TraceCheckUtils]: 35: Hoare triple {50626#(and (= main_~z~0 0) (<= 5 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {50627#(and (= main_~z~0 0) (<= 4 main_~y~0))} is VALID [2022-04-28 03:50:42,186 INFO L290 TraceCheckUtils]: 36: Hoare triple {50627#(and (= main_~z~0 0) (<= 4 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {50628#(and (= main_~z~0 0) (<= 3 main_~y~0))} is VALID [2022-04-28 03:50:42,186 INFO L290 TraceCheckUtils]: 37: Hoare triple {50628#(and (= main_~z~0 0) (<= 3 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {50629#(and (= main_~z~0 0) (<= 2 main_~y~0))} is VALID [2022-04-28 03:50:42,187 INFO L290 TraceCheckUtils]: 38: Hoare triple {50629#(and (= main_~z~0 0) (<= 2 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {50630#(and (= main_~z~0 0) (<= 1 main_~y~0))} is VALID [2022-04-28 03:50:42,187 INFO L290 TraceCheckUtils]: 39: Hoare triple {50630#(and (= main_~z~0 0) (<= 1 main_~y~0))} assume !(~y~0 > ~z~0); {50596#false} is VALID [2022-04-28 03:50:42,187 INFO L272 TraceCheckUtils]: 40: Hoare triple {50596#false} call __VERIFIER_assert((if ~x~0 == ~z~0 then 1 else 0)); {50596#false} is VALID [2022-04-28 03:50:42,187 INFO L290 TraceCheckUtils]: 41: Hoare triple {50596#false} ~cond := #in~cond; {50596#false} is VALID [2022-04-28 03:50:42,188 INFO L290 TraceCheckUtils]: 42: Hoare triple {50596#false} assume 0 == ~cond; {50596#false} is VALID [2022-04-28 03:50:42,188 INFO L290 TraceCheckUtils]: 43: Hoare triple {50596#false} assume !false; {50596#false} is VALID [2022-04-28 03:50:42,188 INFO L134 CoverageAnalysis]: Checked inductivity of 437 backedges. 0 proven. 436 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-04-28 03:50:42,188 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 03:50:42,188 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [599546736] [2022-04-28 03:50:42,188 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [599546736] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 03:50:42,188 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [231609007] [2022-04-28 03:50:42,188 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:50:42,189 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 03:50:42,189 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 03:50:42,190 INFO L229 MonitoredProcess]: Starting monitored process 41 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 03:50:42,218 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (41)] Waiting until timeout for monitored process [2022-04-28 03:50:42,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:50:42,265 INFO L263 TraceCheckSpWp]: Trace formula consists of 204 conjuncts, 33 conjunts are in the unsatisfiable core [2022-04-28 03:50:42,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:50:42,288 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 03:50:43,799 INFO L272 TraceCheckUtils]: 0: Hoare triple {50595#true} call ULTIMATE.init(); {50595#true} is VALID [2022-04-28 03:50:43,799 INFO L290 TraceCheckUtils]: 1: Hoare triple {50595#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(17, 2);call #Ultimate.allocInit(12, 3); {50595#true} is VALID [2022-04-28 03:50:43,799 INFO L290 TraceCheckUtils]: 2: Hoare triple {50595#true} assume true; {50595#true} is VALID [2022-04-28 03:50:43,799 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {50595#true} {50595#true} #52#return; {50595#true} is VALID [2022-04-28 03:50:43,799 INFO L272 TraceCheckUtils]: 4: Hoare triple {50595#true} call #t~ret9 := main(); {50595#true} is VALID [2022-04-28 03:50:43,799 INFO L290 TraceCheckUtils]: 5: Hoare triple {50595#true} ~x~0 := 0;~y~0 := 50000;~z~0 := 0;~x~0 := 0; {50650#(and (<= main_~z~0 0) (<= 50000 main_~y~0))} is VALID [2022-04-28 03:50:43,800 INFO L290 TraceCheckUtils]: 6: Hoare triple {50650#(and (<= main_~z~0 0) (<= 50000 main_~y~0))} [216] L11-2-->L18-1_primed: Formula: (let ((.cse0 (= |v_main_#t~post4_249| |v_main_#t~post4_248|)) (.cse1 (= v_main_~x~0_2332 v_main_~x~0_2331))) (or (and .cse0 .cse1) (and .cse0 (<= 50000 v_main_~x~0_2332) .cse1) (and (< v_main_~x~0_2331 50001) (< v_main_~x~0_2332 v_main_~x~0_2331)))) InVars {main_~x~0=v_main_~x~0_2332, main_#t~post4=|v_main_#t~post4_249|} OutVars{main_~x~0=v_main_~x~0_2331, main_#t~post4=|v_main_#t~post4_248|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {50650#(and (<= main_~z~0 0) (<= 50000 main_~y~0))} is VALID [2022-04-28 03:50:43,800 INFO L290 TraceCheckUtils]: 7: Hoare triple {50650#(and (<= main_~z~0 0) (<= 50000 main_~y~0))} [217] L18-1_primed-->L11-2: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {50650#(and (<= main_~z~0 0) (<= 50000 main_~y~0))} is VALID [2022-04-28 03:50:43,801 INFO L290 TraceCheckUtils]: 8: Hoare triple {50650#(and (<= main_~z~0 0) (<= 50000 main_~y~0))} [218] L11-2-->L18-1_primed: Formula: (let ((.cse0 (= |v_main_#t~post6_277| |v_main_#t~post6_276|)) (.cse1 (= |v_main_#t~post5_277| |v_main_#t~post5_276|)) (.cse2 (= v_main_~x~0_2334 v_main_~x~0_2333)) (.cse3 (= v_main_~y~0_2585 v_main_~y~0_2584)) (.cse4 (<= 50000 v_main_~x~0_2334))) (or (and .cse0 .cse1 .cse2 .cse3) (and .cse0 .cse1 .cse2 (or (not .cse4) (not (< v_main_~x~0_2334 1000000))) .cse3) (let ((.cse5 (+ v_main_~x~0_2334 v_main_~y~0_2584))) (and (= .cse5 (+ v_main_~x~0_2333 v_main_~y~0_2585)) (< v_main_~y~0_2585 v_main_~y~0_2584) .cse4 (< .cse5 (+ 1000001 v_main_~y~0_2585)))))) InVars {main_~y~0=v_main_~y~0_2585, main_#t~post5=|v_main_#t~post5_277|, main_~x~0=v_main_~x~0_2334, main_#t~post6=|v_main_#t~post6_277|} OutVars{main_~y~0=v_main_~y~0_2584, main_#t~post5=|v_main_#t~post5_276|, main_~x~0=v_main_~x~0_2333, main_#t~post6=|v_main_#t~post6_276|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {50650#(and (<= main_~z~0 0) (<= 50000 main_~y~0))} is VALID [2022-04-28 03:50:43,801 INFO L290 TraceCheckUtils]: 9: Hoare triple {50650#(and (<= main_~z~0 0) (<= 50000 main_~y~0))} [215] L18-1_primed-->L18-1: Formula: (not (< v_main_~x~0_11 1000000)) InVars {main_~x~0=v_main_~x~0_11} OutVars{main_~x~0=v_main_~x~0_11} AuxVars[] AssignedVars[] {50650#(and (<= main_~z~0 0) (<= 50000 main_~y~0))} is VALID [2022-04-28 03:50:43,802 INFO L290 TraceCheckUtils]: 10: Hoare triple {50650#(and (<= main_~z~0 0) (<= 50000 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {50666#(and (<= main_~z~0 0) (<= 49999 main_~y~0))} is VALID [2022-04-28 03:50:43,802 INFO L290 TraceCheckUtils]: 11: Hoare triple {50666#(and (<= main_~z~0 0) (<= 49999 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {50670#(and (<= main_~z~0 0) (<= 49998 main_~y~0))} is VALID [2022-04-28 03:50:43,803 INFO L290 TraceCheckUtils]: 12: Hoare triple {50670#(and (<= main_~z~0 0) (<= 49998 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {50674#(and (<= main_~z~0 0) (<= 49997 main_~y~0))} is VALID [2022-04-28 03:50:43,803 INFO L290 TraceCheckUtils]: 13: Hoare triple {50674#(and (<= main_~z~0 0) (<= 49997 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {50678#(and (<= main_~z~0 0) (<= 49996 main_~y~0))} is VALID [2022-04-28 03:50:43,804 INFO L290 TraceCheckUtils]: 14: Hoare triple {50678#(and (<= main_~z~0 0) (<= 49996 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {50682#(and (<= main_~z~0 0) (<= 49995 main_~y~0))} is VALID [2022-04-28 03:50:43,804 INFO L290 TraceCheckUtils]: 15: Hoare triple {50682#(and (<= main_~z~0 0) (<= 49995 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {50686#(and (<= main_~z~0 0) (<= 49994 main_~y~0))} is VALID [2022-04-28 03:50:43,805 INFO L290 TraceCheckUtils]: 16: Hoare triple {50686#(and (<= main_~z~0 0) (<= 49994 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {50690#(and (<= main_~z~0 0) (<= 49993 main_~y~0))} is VALID [2022-04-28 03:50:43,805 INFO L290 TraceCheckUtils]: 17: Hoare triple {50690#(and (<= main_~z~0 0) (<= 49993 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {50694#(and (<= main_~z~0 0) (<= 49992 main_~y~0))} is VALID [2022-04-28 03:50:43,806 INFO L290 TraceCheckUtils]: 18: Hoare triple {50694#(and (<= main_~z~0 0) (<= 49992 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {50698#(and (<= main_~z~0 0) (<= 49991 main_~y~0))} is VALID [2022-04-28 03:50:43,806 INFO L290 TraceCheckUtils]: 19: Hoare triple {50698#(and (<= main_~z~0 0) (<= 49991 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {50702#(and (<= main_~z~0 0) (<= 49990 main_~y~0))} is VALID [2022-04-28 03:50:43,807 INFO L290 TraceCheckUtils]: 20: Hoare triple {50702#(and (<= main_~z~0 0) (<= 49990 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {50706#(and (<= main_~z~0 0) (<= 49989 main_~y~0))} is VALID [2022-04-28 03:50:43,807 INFO L290 TraceCheckUtils]: 21: Hoare triple {50706#(and (<= main_~z~0 0) (<= 49989 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {50710#(and (<= main_~z~0 0) (<= 49988 main_~y~0))} is VALID [2022-04-28 03:50:43,808 INFO L290 TraceCheckUtils]: 22: Hoare triple {50710#(and (<= main_~z~0 0) (<= 49988 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {50714#(and (<= main_~z~0 0) (<= 49987 main_~y~0))} is VALID [2022-04-28 03:50:43,808 INFO L290 TraceCheckUtils]: 23: Hoare triple {50714#(and (<= main_~z~0 0) (<= 49987 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {50718#(and (<= main_~z~0 0) (<= 49986 main_~y~0))} is VALID [2022-04-28 03:50:43,809 INFO L290 TraceCheckUtils]: 24: Hoare triple {50718#(and (<= main_~z~0 0) (<= 49986 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {50722#(and (<= main_~z~0 0) (<= 49985 main_~y~0))} is VALID [2022-04-28 03:50:43,809 INFO L290 TraceCheckUtils]: 25: Hoare triple {50722#(and (<= main_~z~0 0) (<= 49985 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {50726#(and (<= main_~z~0 0) (<= 49984 main_~y~0))} is VALID [2022-04-28 03:50:43,810 INFO L290 TraceCheckUtils]: 26: Hoare triple {50726#(and (<= main_~z~0 0) (<= 49984 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {50730#(and (<= main_~z~0 0) (<= 49983 main_~y~0))} is VALID [2022-04-28 03:50:43,810 INFO L290 TraceCheckUtils]: 27: Hoare triple {50730#(and (<= main_~z~0 0) (<= 49983 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {50734#(and (<= main_~z~0 0) (<= 49982 main_~y~0))} is VALID [2022-04-28 03:50:43,811 INFO L290 TraceCheckUtils]: 28: Hoare triple {50734#(and (<= main_~z~0 0) (<= 49982 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {50738#(and (<= main_~z~0 0) (<= 49981 main_~y~0))} is VALID [2022-04-28 03:50:43,811 INFO L290 TraceCheckUtils]: 29: Hoare triple {50738#(and (<= main_~z~0 0) (<= 49981 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {50742#(and (<= main_~z~0 0) (<= 49980 main_~y~0))} is VALID [2022-04-28 03:50:43,812 INFO L290 TraceCheckUtils]: 30: Hoare triple {50742#(and (<= main_~z~0 0) (<= 49980 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {50746#(and (<= main_~z~0 0) (<= 49979 main_~y~0))} is VALID [2022-04-28 03:50:43,812 INFO L290 TraceCheckUtils]: 31: Hoare triple {50746#(and (<= main_~z~0 0) (<= 49979 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {50750#(and (<= main_~z~0 0) (<= 49978 main_~y~0))} is VALID [2022-04-28 03:50:43,813 INFO L290 TraceCheckUtils]: 32: Hoare triple {50750#(and (<= main_~z~0 0) (<= 49978 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {50754#(and (<= main_~z~0 0) (<= 49977 main_~y~0))} is VALID [2022-04-28 03:50:43,813 INFO L290 TraceCheckUtils]: 33: Hoare triple {50754#(and (<= main_~z~0 0) (<= 49977 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {50758#(and (<= main_~z~0 0) (<= 49976 main_~y~0))} is VALID [2022-04-28 03:50:43,814 INFO L290 TraceCheckUtils]: 34: Hoare triple {50758#(and (<= main_~z~0 0) (<= 49976 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {50762#(and (<= main_~z~0 0) (<= 49975 main_~y~0))} is VALID [2022-04-28 03:50:43,814 INFO L290 TraceCheckUtils]: 35: Hoare triple {50762#(and (<= main_~z~0 0) (<= 49975 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {50766#(and (<= main_~z~0 0) (<= 49974 main_~y~0))} is VALID [2022-04-28 03:50:43,815 INFO L290 TraceCheckUtils]: 36: Hoare triple {50766#(and (<= main_~z~0 0) (<= 49974 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {50770#(and (<= main_~z~0 0) (<= 49973 main_~y~0))} is VALID [2022-04-28 03:50:43,815 INFO L290 TraceCheckUtils]: 37: Hoare triple {50770#(and (<= main_~z~0 0) (<= 49973 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {50774#(and (<= main_~z~0 0) (<= 49972 main_~y~0))} is VALID [2022-04-28 03:50:43,816 INFO L290 TraceCheckUtils]: 38: Hoare triple {50774#(and (<= main_~z~0 0) (<= 49972 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {50778#(and (<= main_~z~0 0) (<= 49971 main_~y~0))} is VALID [2022-04-28 03:50:43,816 INFO L290 TraceCheckUtils]: 39: Hoare triple {50778#(and (<= main_~z~0 0) (<= 49971 main_~y~0))} assume !(~y~0 > ~z~0); {50596#false} is VALID [2022-04-28 03:50:43,816 INFO L272 TraceCheckUtils]: 40: Hoare triple {50596#false} call __VERIFIER_assert((if ~x~0 == ~z~0 then 1 else 0)); {50596#false} is VALID [2022-04-28 03:50:43,816 INFO L290 TraceCheckUtils]: 41: Hoare triple {50596#false} ~cond := #in~cond; {50596#false} is VALID [2022-04-28 03:50:43,816 INFO L290 TraceCheckUtils]: 42: Hoare triple {50596#false} assume 0 == ~cond; {50596#false} is VALID [2022-04-28 03:50:43,816 INFO L290 TraceCheckUtils]: 43: Hoare triple {50596#false} assume !false; {50596#false} is VALID [2022-04-28 03:50:43,816 INFO L134 CoverageAnalysis]: Checked inductivity of 437 backedges. 0 proven. 435 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-04-28 03:50:43,817 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 03:50:45,775 INFO L290 TraceCheckUtils]: 43: Hoare triple {50596#false} assume !false; {50596#false} is VALID [2022-04-28 03:50:45,775 INFO L290 TraceCheckUtils]: 42: Hoare triple {50596#false} assume 0 == ~cond; {50596#false} is VALID [2022-04-28 03:50:45,776 INFO L290 TraceCheckUtils]: 41: Hoare triple {50596#false} ~cond := #in~cond; {50596#false} is VALID [2022-04-28 03:50:45,776 INFO L272 TraceCheckUtils]: 40: Hoare triple {50596#false} call __VERIFIER_assert((if ~x~0 == ~z~0 then 1 else 0)); {50596#false} is VALID [2022-04-28 03:50:45,776 INFO L290 TraceCheckUtils]: 39: Hoare triple {50806#(< main_~z~0 main_~y~0)} assume !(~y~0 > ~z~0); {50596#false} is VALID [2022-04-28 03:50:45,776 INFO L290 TraceCheckUtils]: 38: Hoare triple {50810#(< (+ main_~z~0 1) main_~y~0)} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {50806#(< main_~z~0 main_~y~0)} is VALID [2022-04-28 03:50:45,777 INFO L290 TraceCheckUtils]: 37: Hoare triple {50814#(< (+ main_~z~0 2) main_~y~0)} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {50810#(< (+ main_~z~0 1) main_~y~0)} is VALID [2022-04-28 03:50:45,777 INFO L290 TraceCheckUtils]: 36: Hoare triple {50818#(< (+ main_~z~0 3) main_~y~0)} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {50814#(< (+ main_~z~0 2) main_~y~0)} is VALID [2022-04-28 03:50:45,778 INFO L290 TraceCheckUtils]: 35: Hoare triple {50822#(< (+ main_~z~0 4) main_~y~0)} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {50818#(< (+ main_~z~0 3) main_~y~0)} is VALID [2022-04-28 03:50:45,778 INFO L290 TraceCheckUtils]: 34: Hoare triple {50826#(< (+ 5 main_~z~0) main_~y~0)} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {50822#(< (+ main_~z~0 4) main_~y~0)} is VALID [2022-04-28 03:50:45,779 INFO L290 TraceCheckUtils]: 33: Hoare triple {50830#(< (+ main_~z~0 6) main_~y~0)} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {50826#(< (+ 5 main_~z~0) main_~y~0)} is VALID [2022-04-28 03:50:45,779 INFO L290 TraceCheckUtils]: 32: Hoare triple {50834#(< (+ 7 main_~z~0) main_~y~0)} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {50830#(< (+ main_~z~0 6) main_~y~0)} is VALID [2022-04-28 03:50:45,780 INFO L290 TraceCheckUtils]: 31: Hoare triple {50838#(< (+ main_~z~0 8) main_~y~0)} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {50834#(< (+ 7 main_~z~0) main_~y~0)} is VALID [2022-04-28 03:50:45,780 INFO L290 TraceCheckUtils]: 30: Hoare triple {50842#(< (+ main_~z~0 9) main_~y~0)} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {50838#(< (+ main_~z~0 8) main_~y~0)} is VALID [2022-04-28 03:50:45,780 INFO L290 TraceCheckUtils]: 29: Hoare triple {50846#(< (+ main_~z~0 10) main_~y~0)} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {50842#(< (+ main_~z~0 9) main_~y~0)} is VALID [2022-04-28 03:50:45,781 INFO L290 TraceCheckUtils]: 28: Hoare triple {50850#(< (+ main_~z~0 11) main_~y~0)} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {50846#(< (+ main_~z~0 10) main_~y~0)} is VALID [2022-04-28 03:50:45,781 INFO L290 TraceCheckUtils]: 27: Hoare triple {50854#(< (+ main_~z~0 12) main_~y~0)} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {50850#(< (+ main_~z~0 11) main_~y~0)} is VALID [2022-04-28 03:50:45,782 INFO L290 TraceCheckUtils]: 26: Hoare triple {50858#(< (+ main_~z~0 13) main_~y~0)} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {50854#(< (+ main_~z~0 12) main_~y~0)} is VALID [2022-04-28 03:50:45,782 INFO L290 TraceCheckUtils]: 25: Hoare triple {50862#(< (+ main_~z~0 14) main_~y~0)} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {50858#(< (+ main_~z~0 13) main_~y~0)} is VALID [2022-04-28 03:50:45,783 INFO L290 TraceCheckUtils]: 24: Hoare triple {50866#(< (+ main_~z~0 15) main_~y~0)} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {50862#(< (+ main_~z~0 14) main_~y~0)} is VALID [2022-04-28 03:50:45,783 INFO L290 TraceCheckUtils]: 23: Hoare triple {50870#(< (+ main_~z~0 16) main_~y~0)} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {50866#(< (+ main_~z~0 15) main_~y~0)} is VALID [2022-04-28 03:50:45,784 INFO L290 TraceCheckUtils]: 22: Hoare triple {50874#(< (+ main_~z~0 17) main_~y~0)} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {50870#(< (+ main_~z~0 16) main_~y~0)} is VALID [2022-04-28 03:50:45,784 INFO L290 TraceCheckUtils]: 21: Hoare triple {50878#(< (+ main_~z~0 18) main_~y~0)} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {50874#(< (+ main_~z~0 17) main_~y~0)} is VALID [2022-04-28 03:50:45,785 INFO L290 TraceCheckUtils]: 20: Hoare triple {50882#(< (+ 19 main_~z~0) main_~y~0)} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {50878#(< (+ main_~z~0 18) main_~y~0)} is VALID [2022-04-28 03:50:45,785 INFO L290 TraceCheckUtils]: 19: Hoare triple {50886#(< (+ main_~z~0 20) main_~y~0)} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {50882#(< (+ 19 main_~z~0) main_~y~0)} is VALID [2022-04-28 03:50:45,786 INFO L290 TraceCheckUtils]: 18: Hoare triple {50890#(< (+ main_~z~0 21) main_~y~0)} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {50886#(< (+ main_~z~0 20) main_~y~0)} is VALID [2022-04-28 03:50:45,786 INFO L290 TraceCheckUtils]: 17: Hoare triple {50894#(< (+ main_~z~0 22) main_~y~0)} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {50890#(< (+ main_~z~0 21) main_~y~0)} is VALID [2022-04-28 03:50:45,786 INFO L290 TraceCheckUtils]: 16: Hoare triple {50898#(< (+ 23 main_~z~0) main_~y~0)} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {50894#(< (+ main_~z~0 22) main_~y~0)} is VALID [2022-04-28 03:50:45,787 INFO L290 TraceCheckUtils]: 15: Hoare triple {50902#(< (+ main_~z~0 24) main_~y~0)} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {50898#(< (+ 23 main_~z~0) main_~y~0)} is VALID [2022-04-28 03:50:45,787 INFO L290 TraceCheckUtils]: 14: Hoare triple {50906#(< (+ main_~z~0 25) main_~y~0)} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {50902#(< (+ main_~z~0 24) main_~y~0)} is VALID [2022-04-28 03:50:45,788 INFO L290 TraceCheckUtils]: 13: Hoare triple {50910#(< (+ main_~z~0 26) main_~y~0)} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {50906#(< (+ main_~z~0 25) main_~y~0)} is VALID [2022-04-28 03:50:45,788 INFO L290 TraceCheckUtils]: 12: Hoare triple {50914#(< (+ main_~z~0 27) main_~y~0)} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {50910#(< (+ main_~z~0 26) main_~y~0)} is VALID [2022-04-28 03:50:45,789 INFO L290 TraceCheckUtils]: 11: Hoare triple {50918#(< (+ main_~z~0 28) main_~y~0)} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {50914#(< (+ main_~z~0 27) main_~y~0)} is VALID [2022-04-28 03:50:45,789 INFO L290 TraceCheckUtils]: 10: Hoare triple {50922#(< (+ 29 main_~z~0) main_~y~0)} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {50918#(< (+ main_~z~0 28) main_~y~0)} is VALID [2022-04-28 03:50:45,790 INFO L290 TraceCheckUtils]: 9: Hoare triple {50922#(< (+ 29 main_~z~0) main_~y~0)} [215] L18-1_primed-->L18-1: Formula: (not (< v_main_~x~0_11 1000000)) InVars {main_~x~0=v_main_~x~0_11} OutVars{main_~x~0=v_main_~x~0_11} AuxVars[] AssignedVars[] {50922#(< (+ 29 main_~z~0) main_~y~0)} is VALID [2022-04-28 03:50:45,790 INFO L290 TraceCheckUtils]: 8: Hoare triple {50922#(< (+ 29 main_~z~0) main_~y~0)} [218] L11-2-->L18-1_primed: Formula: (let ((.cse0 (= |v_main_#t~post6_277| |v_main_#t~post6_276|)) (.cse1 (= |v_main_#t~post5_277| |v_main_#t~post5_276|)) (.cse2 (= v_main_~x~0_2334 v_main_~x~0_2333)) (.cse3 (= v_main_~y~0_2585 v_main_~y~0_2584)) (.cse4 (<= 50000 v_main_~x~0_2334))) (or (and .cse0 .cse1 .cse2 .cse3) (and .cse0 .cse1 .cse2 (or (not .cse4) (not (< v_main_~x~0_2334 1000000))) .cse3) (let ((.cse5 (+ v_main_~x~0_2334 v_main_~y~0_2584))) (and (= .cse5 (+ v_main_~x~0_2333 v_main_~y~0_2585)) (< v_main_~y~0_2585 v_main_~y~0_2584) .cse4 (< .cse5 (+ 1000001 v_main_~y~0_2585)))))) InVars {main_~y~0=v_main_~y~0_2585, main_#t~post5=|v_main_#t~post5_277|, main_~x~0=v_main_~x~0_2334, main_#t~post6=|v_main_#t~post6_277|} OutVars{main_~y~0=v_main_~y~0_2584, main_#t~post5=|v_main_#t~post5_276|, main_~x~0=v_main_~x~0_2333, main_#t~post6=|v_main_#t~post6_276|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {50922#(< (+ 29 main_~z~0) main_~y~0)} is VALID [2022-04-28 03:50:45,791 INFO L290 TraceCheckUtils]: 7: Hoare triple {50922#(< (+ 29 main_~z~0) main_~y~0)} [217] L18-1_primed-->L11-2: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {50922#(< (+ 29 main_~z~0) main_~y~0)} is VALID [2022-04-28 03:50:45,791 INFO L290 TraceCheckUtils]: 6: Hoare triple {50922#(< (+ 29 main_~z~0) main_~y~0)} [216] L11-2-->L18-1_primed: Formula: (let ((.cse0 (= |v_main_#t~post4_249| |v_main_#t~post4_248|)) (.cse1 (= v_main_~x~0_2332 v_main_~x~0_2331))) (or (and .cse0 .cse1) (and .cse0 (<= 50000 v_main_~x~0_2332) .cse1) (and (< v_main_~x~0_2331 50001) (< v_main_~x~0_2332 v_main_~x~0_2331)))) InVars {main_~x~0=v_main_~x~0_2332, main_#t~post4=|v_main_#t~post4_249|} OutVars{main_~x~0=v_main_~x~0_2331, main_#t~post4=|v_main_#t~post4_248|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {50922#(< (+ 29 main_~z~0) main_~y~0)} is VALID [2022-04-28 03:50:45,791 INFO L290 TraceCheckUtils]: 5: Hoare triple {50595#true} ~x~0 := 0;~y~0 := 50000;~z~0 := 0;~x~0 := 0; {50922#(< (+ 29 main_~z~0) main_~y~0)} is VALID [2022-04-28 03:50:45,791 INFO L272 TraceCheckUtils]: 4: Hoare triple {50595#true} call #t~ret9 := main(); {50595#true} is VALID [2022-04-28 03:50:45,791 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {50595#true} {50595#true} #52#return; {50595#true} is VALID [2022-04-28 03:50:45,791 INFO L290 TraceCheckUtils]: 2: Hoare triple {50595#true} assume true; {50595#true} is VALID [2022-04-28 03:50:45,791 INFO L290 TraceCheckUtils]: 1: Hoare triple {50595#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(17, 2);call #Ultimate.allocInit(12, 3); {50595#true} is VALID [2022-04-28 03:50:45,791 INFO L272 TraceCheckUtils]: 0: Hoare triple {50595#true} call ULTIMATE.init(); {50595#true} is VALID [2022-04-28 03:50:45,792 INFO L134 CoverageAnalysis]: Checked inductivity of 437 backedges. 0 proven. 435 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-04-28 03:50:45,792 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [231609007] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 03:50:45,792 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 03:50:45,792 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [34, 32, 32] total 94 [2022-04-28 03:50:48,400 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 03:50:48,400 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [747074137] [2022-04-28 03:50:48,400 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [747074137] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 03:50:48,400 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 03:50:48,400 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [89] imperfect sequences [] total 89 [2022-04-28 03:50:48,401 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1516880056] [2022-04-28 03:50:48,401 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 03:50:48,401 INFO L78 Accepts]: Start accepts. Automaton has has 89 states, 89 states have (on average 1.6292134831460674) internal successors, (145), 88 states have internal predecessors, (145), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 149 [2022-04-28 03:50:48,401 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 03:50:48,401 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 89 states, 89 states have (on average 1.6292134831460674) internal successors, (145), 88 states have internal predecessors, (145), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:50:48,512 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 149 edges. 149 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 03:50:48,512 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 89 states [2022-04-28 03:50:48,512 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 03:50:48,513 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 89 interpolants. [2022-04-28 03:50:48,514 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8114, Invalid=13938, Unknown=0, NotChecked=0, Total=22052 [2022-04-28 03:50:48,514 INFO L87 Difference]: Start difference. First operand 246 states and 250 transitions. Second operand has 89 states, 89 states have (on average 1.6292134831460674) internal successors, (145), 88 states have internal predecessors, (145), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:51:02,274 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:51:02,274 INFO L93 Difference]: Finished difference Result 394 states and 417 transitions. [2022-04-28 03:51:02,274 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 89 states. [2022-04-28 03:51:02,274 INFO L78 Accepts]: Start accepts. Automaton has has 89 states, 89 states have (on average 1.6292134831460674) internal successors, (145), 88 states have internal predecessors, (145), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 149 [2022-04-28 03:51:02,274 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 03:51:02,274 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 89 states, 89 states have (on average 1.6292134831460674) internal successors, (145), 88 states have internal predecessors, (145), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:51:02,275 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 183 transitions. [2022-04-28 03:51:02,275 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 89 states, 89 states have (on average 1.6292134831460674) internal successors, (145), 88 states have internal predecessors, (145), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:51:02,277 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 183 transitions. [2022-04-28 03:51:02,277 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 89 states and 183 transitions. [2022-04-28 03:51:02,449 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 183 edges. 183 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 03:51:02,453 INFO L225 Difference]: With dead ends: 394 [2022-04-28 03:51:02,453 INFO L226 Difference]: Without dead ends: 262 [2022-04-28 03:51:02,457 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 322 GetRequests, 87 SyntacticMatches, 2 SemanticMatches, 233 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17586 ImplicationChecksByTransitivity, 8.4s TimeCoverageRelationStatistics Valid=16731, Invalid=38259, Unknown=0, NotChecked=0, Total=54990 [2022-04-28 03:51:02,457 INFO L413 NwaCegarLoop]: 12 mSDtfsCounter, 235 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 6040 mSolverCounterSat, 330 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 235 SdHoareTripleChecker+Valid, 34 SdHoareTripleChecker+Invalid, 6370 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 330 IncrementalHoareTripleChecker+Valid, 6040 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.1s IncrementalHoareTripleChecker+Time [2022-04-28 03:51:02,457 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [235 Valid, 34 Invalid, 6370 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [330 Valid, 6040 Invalid, 0 Unknown, 0 Unchecked, 5.1s Time] [2022-04-28 03:51:02,458 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 262 states. [2022-04-28 03:51:02,836 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 262 to 156. [2022-04-28 03:51:02,836 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 03:51:02,836 INFO L82 GeneralOperation]: Start isEquivalent. First operand 262 states. Second operand has 156 states, 151 states have (on average 1.0264900662251655) internal successors, (155), 151 states have internal predecessors, (155), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:51:02,836 INFO L74 IsIncluded]: Start isIncluded. First operand 262 states. Second operand has 156 states, 151 states have (on average 1.0264900662251655) internal successors, (155), 151 states have internal predecessors, (155), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:51:02,836 INFO L87 Difference]: Start difference. First operand 262 states. Second operand has 156 states, 151 states have (on average 1.0264900662251655) internal successors, (155), 151 states have internal predecessors, (155), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:51:02,840 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:51:02,840 INFO L93 Difference]: Finished difference Result 262 states and 266 transitions. [2022-04-28 03:51:02,840 INFO L276 IsEmpty]: Start isEmpty. Operand 262 states and 266 transitions. [2022-04-28 03:51:02,840 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:51:02,840 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:51:02,841 INFO L74 IsIncluded]: Start isIncluded. First operand has 156 states, 151 states have (on average 1.0264900662251655) internal successors, (155), 151 states have internal predecessors, (155), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 262 states. [2022-04-28 03:51:02,841 INFO L87 Difference]: Start difference. First operand has 156 states, 151 states have (on average 1.0264900662251655) internal successors, (155), 151 states have internal predecessors, (155), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 262 states. [2022-04-28 03:51:02,845 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:51:02,845 INFO L93 Difference]: Finished difference Result 262 states and 266 transitions. [2022-04-28 03:51:02,845 INFO L276 IsEmpty]: Start isEmpty. Operand 262 states and 266 transitions. [2022-04-28 03:51:02,845 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:51:02,845 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:51:02,845 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 03:51:02,845 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 03:51:02,845 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 156 states, 151 states have (on average 1.0264900662251655) internal successors, (155), 151 states have internal predecessors, (155), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:51:02,847 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 156 states to 156 states and 159 transitions. [2022-04-28 03:51:02,847 INFO L78 Accepts]: Start accepts. Automaton has 156 states and 159 transitions. Word has length 149 [2022-04-28 03:51:02,847 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 03:51:02,847 INFO L495 AbstractCegarLoop]: Abstraction has 156 states and 159 transitions. [2022-04-28 03:51:02,848 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 89 states, 89 states have (on average 1.6292134831460674) internal successors, (145), 88 states have internal predecessors, (145), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:51:02,848 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 156 states and 159 transitions. [2022-04-28 03:51:03,017 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 159 edges. 159 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 03:51:03,017 INFO L276 IsEmpty]: Start isEmpty. Operand 156 states and 159 transitions. [2022-04-28 03:51:03,018 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2022-04-28 03:51:03,018 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 03:51:03,018 INFO L195 NwaCegarLoop]: trace histogram [56, 55, 31, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 03:51:03,034 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (41)] Forceful destruction successful, exit code 0 [2022-04-28 03:51:03,218 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 41 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable42 [2022-04-28 03:51:03,219 INFO L420 AbstractCegarLoop]: === Iteration 44 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 03:51:03,219 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 03:51:03,219 INFO L85 PathProgramCache]: Analyzing trace with hash 504372054, now seen corresponding path program 41 times [2022-04-28 03:51:03,219 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 03:51:03,219 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [61526842] [2022-04-28 03:51:03,314 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 1 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 03:51:03,519 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={1=1, 2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 03:51:03,521 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-28 03:51:03,522 INFO L85 PathProgramCache]: Analyzing trace with hash 121957538, now seen corresponding path program 1 times [2022-04-28 03:51:03,523 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 03:51:03,523 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [392511879] [2022-04-28 03:51:03,523 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:51:03,523 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 03:51:03,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:51:04,235 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 03:51:04,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:51:04,260 INFO L290 TraceCheckUtils]: 0: Hoare triple {52846#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(17, 2);call #Ultimate.allocInit(12, 3); {52806#true} is VALID [2022-04-28 03:51:04,260 INFO L290 TraceCheckUtils]: 1: Hoare triple {52806#true} assume true; {52806#true} is VALID [2022-04-28 03:51:04,260 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {52806#true} {52806#true} #52#return; {52806#true} is VALID [2022-04-28 03:51:04,261 INFO L272 TraceCheckUtils]: 0: Hoare triple {52806#true} call ULTIMATE.init(); {52846#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 03:51:04,261 INFO L290 TraceCheckUtils]: 1: Hoare triple {52846#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(17, 2);call #Ultimate.allocInit(12, 3); {52806#true} is VALID [2022-04-28 03:51:04,261 INFO L290 TraceCheckUtils]: 2: Hoare triple {52806#true} assume true; {52806#true} is VALID [2022-04-28 03:51:04,261 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {52806#true} {52806#true} #52#return; {52806#true} is VALID [2022-04-28 03:51:04,261 INFO L272 TraceCheckUtils]: 4: Hoare triple {52806#true} call #t~ret9 := main(); {52806#true} is VALID [2022-04-28 03:51:04,261 INFO L290 TraceCheckUtils]: 5: Hoare triple {52806#true} ~x~0 := 0;~y~0 := 50000;~z~0 := 0;~x~0 := 0; {52811#(and (= main_~z~0 0) (= main_~x~0 0) (<= 50000 main_~y~0))} is VALID [2022-04-28 03:51:04,262 INFO L290 TraceCheckUtils]: 6: Hoare triple {52811#(and (= main_~z~0 0) (= main_~x~0 0) (<= 50000 main_~y~0))} [220] L11-2-->L18-1_primed: Formula: (let ((.cse0 (= v_main_~x~0_2431 v_main_~x~0_2430)) (.cse1 (= |v_main_#t~post4_255| |v_main_#t~post4_254|))) (or (and .cse0 .cse1 (<= 50000 v_main_~x~0_2431)) (and (< v_main_~x~0_2431 v_main_~x~0_2430) (< v_main_~x~0_2430 50001)) (and .cse0 .cse1))) InVars {main_~x~0=v_main_~x~0_2431, main_#t~post4=|v_main_#t~post4_255|} OutVars{main_~x~0=v_main_~x~0_2430, main_#t~post4=|v_main_#t~post4_254|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {52812#(or (= main_~x~0 0) (and (= main_~z~0 0) (<= main_~x~0 main_~y~0) (<= main_~x~0 50000)))} is VALID [2022-04-28 03:51:04,263 INFO L290 TraceCheckUtils]: 7: Hoare triple {52812#(or (= main_~x~0 0) (and (= main_~z~0 0) (<= main_~x~0 main_~y~0) (<= main_~x~0 50000)))} [221] L18-1_primed-->L11-2: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {52812#(or (= main_~x~0 0) (and (= main_~z~0 0) (<= main_~x~0 main_~y~0) (<= main_~x~0 50000)))} is VALID [2022-04-28 03:51:04,264 INFO L290 TraceCheckUtils]: 8: Hoare triple {52812#(or (= main_~x~0 0) (and (= main_~z~0 0) (<= main_~x~0 main_~y~0) (<= main_~x~0 50000)))} [222] L11-2-->L18-1_primed: Formula: (let ((.cse0 (<= 50000 v_main_~x~0_2433)) (.cse1 (= v_main_~y~0_2705 v_main_~y~0_2704)) (.cse2 (= |v_main_#t~post5_284| |v_main_#t~post5_283|)) (.cse3 (= |v_main_#t~post6_284| |v_main_#t~post6_283|)) (.cse4 (= v_main_~x~0_2433 v_main_~x~0_2432))) (or (and (< v_main_~x~0_2433 v_main_~x~0_2432) (< v_main_~x~0_2432 1000001) .cse0 (= (+ v_main_~x~0_2433 v_main_~y~0_2704) (+ v_main_~x~0_2432 v_main_~y~0_2705))) (and .cse1 .cse2 .cse3 .cse4) (and (or (not (< v_main_~x~0_2433 1000000)) (not .cse0)) .cse1 .cse2 .cse3 .cse4))) InVars {main_~y~0=v_main_~y~0_2705, main_#t~post5=|v_main_#t~post5_284|, main_~x~0=v_main_~x~0_2433, main_#t~post6=|v_main_#t~post6_284|} OutVars{main_~y~0=v_main_~y~0_2704, main_#t~post5=|v_main_#t~post5_283|, main_~x~0=v_main_~x~0_2432, main_#t~post6=|v_main_#t~post6_283|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {52813#(or (and (= main_~z~0 0) (<= main_~x~0 main_~y~0)) (<= main_~x~0 50000))} is VALID [2022-04-28 03:51:04,264 INFO L290 TraceCheckUtils]: 9: Hoare triple {52813#(or (and (= main_~z~0 0) (<= main_~x~0 main_~y~0)) (<= main_~x~0 50000))} [219] L18-1_primed-->L18-1: Formula: (not (< v_main_~x~0_11 1000000)) InVars {main_~x~0=v_main_~x~0_11} OutVars{main_~x~0=v_main_~x~0_11} AuxVars[] AssignedVars[] {52814#(and (= main_~z~0 0) (<= 1000000 main_~y~0))} is VALID [2022-04-28 03:51:04,265 INFO L290 TraceCheckUtils]: 10: Hoare triple {52814#(and (= main_~z~0 0) (<= 1000000 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {52815#(and (= main_~z~0 0) (<= 999999 main_~y~0))} is VALID [2022-04-28 03:51:04,265 INFO L290 TraceCheckUtils]: 11: Hoare triple {52815#(and (= main_~z~0 0) (<= 999999 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {52816#(and (= main_~z~0 0) (<= 999998 main_~y~0))} is VALID [2022-04-28 03:51:04,266 INFO L290 TraceCheckUtils]: 12: Hoare triple {52816#(and (= main_~z~0 0) (<= 999998 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {52817#(and (= main_~z~0 0) (<= 999997 main_~y~0))} is VALID [2022-04-28 03:51:04,266 INFO L290 TraceCheckUtils]: 13: Hoare triple {52817#(and (= main_~z~0 0) (<= 999997 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {52818#(and (<= 999996 main_~y~0) (= main_~z~0 0))} is VALID [2022-04-28 03:51:04,267 INFO L290 TraceCheckUtils]: 14: Hoare triple {52818#(and (<= 999996 main_~y~0) (= main_~z~0 0))} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {52819#(and (= main_~z~0 0) (<= 999995 main_~y~0))} is VALID [2022-04-28 03:51:04,267 INFO L290 TraceCheckUtils]: 15: Hoare triple {52819#(and (= main_~z~0 0) (<= 999995 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {52820#(and (= main_~z~0 0) (<= 999994 main_~y~0))} is VALID [2022-04-28 03:51:04,268 INFO L290 TraceCheckUtils]: 16: Hoare triple {52820#(and (= main_~z~0 0) (<= 999994 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {52821#(and (= main_~z~0 0) (<= 999993 main_~y~0))} is VALID [2022-04-28 03:51:04,268 INFO L290 TraceCheckUtils]: 17: Hoare triple {52821#(and (= main_~z~0 0) (<= 999993 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {52822#(and (= main_~z~0 0) (<= 999992 main_~y~0))} is VALID [2022-04-28 03:51:04,269 INFO L290 TraceCheckUtils]: 18: Hoare triple {52822#(and (= main_~z~0 0) (<= 999992 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {52823#(and (= main_~z~0 0) (<= 999991 main_~y~0))} is VALID [2022-04-28 03:51:04,269 INFO L290 TraceCheckUtils]: 19: Hoare triple {52823#(and (= main_~z~0 0) (<= 999991 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {52824#(and (= main_~z~0 0) (<= 999990 main_~y~0))} is VALID [2022-04-28 03:51:04,270 INFO L290 TraceCheckUtils]: 20: Hoare triple {52824#(and (= main_~z~0 0) (<= 999990 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {52825#(and (= main_~z~0 0) (<= 999989 main_~y~0))} is VALID [2022-04-28 03:51:04,271 INFO L290 TraceCheckUtils]: 21: Hoare triple {52825#(and (= main_~z~0 0) (<= 999989 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {52826#(and (= main_~z~0 0) (<= 999988 main_~y~0))} is VALID [2022-04-28 03:51:04,271 INFO L290 TraceCheckUtils]: 22: Hoare triple {52826#(and (= main_~z~0 0) (<= 999988 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {52827#(and (= main_~z~0 0) (<= 999987 main_~y~0))} is VALID [2022-04-28 03:51:04,272 INFO L290 TraceCheckUtils]: 23: Hoare triple {52827#(and (= main_~z~0 0) (<= 999987 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {52828#(and (= main_~z~0 0) (<= 999986 main_~y~0))} is VALID [2022-04-28 03:51:04,272 INFO L290 TraceCheckUtils]: 24: Hoare triple {52828#(and (= main_~z~0 0) (<= 999986 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {52829#(and (= main_~z~0 0) (<= 999985 main_~y~0))} is VALID [2022-04-28 03:51:04,273 INFO L290 TraceCheckUtils]: 25: Hoare triple {52829#(and (= main_~z~0 0) (<= 999985 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {52830#(and (= main_~z~0 0) (<= 999984 main_~y~0))} is VALID [2022-04-28 03:51:04,273 INFO L290 TraceCheckUtils]: 26: Hoare triple {52830#(and (= main_~z~0 0) (<= 999984 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {52831#(and (<= 999983 main_~y~0) (= main_~z~0 0))} is VALID [2022-04-28 03:51:04,274 INFO L290 TraceCheckUtils]: 27: Hoare triple {52831#(and (<= 999983 main_~y~0) (= main_~z~0 0))} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {52832#(and (= main_~z~0 0) (<= 999982 main_~y~0))} is VALID [2022-04-28 03:51:04,275 INFO L290 TraceCheckUtils]: 28: Hoare triple {52832#(and (= main_~z~0 0) (<= 999982 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {52833#(and (= main_~z~0 0) (<= 999981 main_~y~0))} is VALID [2022-04-28 03:51:04,275 INFO L290 TraceCheckUtils]: 29: Hoare triple {52833#(and (= main_~z~0 0) (<= 999981 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {52834#(and (= main_~z~0 0) (<= 999980 main_~y~0))} is VALID [2022-04-28 03:51:04,276 INFO L290 TraceCheckUtils]: 30: Hoare triple {52834#(and (= main_~z~0 0) (<= 999980 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {52835#(and (= main_~z~0 0) (<= 999979 main_~y~0))} is VALID [2022-04-28 03:51:04,276 INFO L290 TraceCheckUtils]: 31: Hoare triple {52835#(and (= main_~z~0 0) (<= 999979 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {52836#(and (= main_~z~0 0) (<= 999978 main_~y~0))} is VALID [2022-04-28 03:51:04,277 INFO L290 TraceCheckUtils]: 32: Hoare triple {52836#(and (= main_~z~0 0) (<= 999978 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {52837#(and (= main_~z~0 0) (<= 999977 main_~y~0))} is VALID [2022-04-28 03:51:04,277 INFO L290 TraceCheckUtils]: 33: Hoare triple {52837#(and (= main_~z~0 0) (<= 999977 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {52838#(and (<= 999976 main_~y~0) (= main_~z~0 0))} is VALID [2022-04-28 03:51:04,278 INFO L290 TraceCheckUtils]: 34: Hoare triple {52838#(and (<= 999976 main_~y~0) (= main_~z~0 0))} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {52839#(and (= main_~z~0 0) (<= 999975 main_~y~0))} is VALID [2022-04-28 03:51:04,278 INFO L290 TraceCheckUtils]: 35: Hoare triple {52839#(and (= main_~z~0 0) (<= 999975 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {52840#(and (= main_~z~0 0) (<= 999974 main_~y~0))} is VALID [2022-04-28 03:51:04,279 INFO L290 TraceCheckUtils]: 36: Hoare triple {52840#(and (= main_~z~0 0) (<= 999974 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {52841#(and (= main_~z~0 0) (<= 999973 main_~y~0))} is VALID [2022-04-28 03:51:04,279 INFO L290 TraceCheckUtils]: 37: Hoare triple {52841#(and (= main_~z~0 0) (<= 999973 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {52842#(and (= main_~z~0 0) (<= 999972 main_~y~0))} is VALID [2022-04-28 03:51:04,280 INFO L290 TraceCheckUtils]: 38: Hoare triple {52842#(and (= main_~z~0 0) (<= 999972 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {52843#(and (= main_~z~0 0) (<= 999971 main_~y~0))} is VALID [2022-04-28 03:51:04,280 INFO L290 TraceCheckUtils]: 39: Hoare triple {52843#(and (= main_~z~0 0) (<= 999971 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {52844#(and (= main_~z~0 0) (<= 999970 main_~y~0))} is VALID [2022-04-28 03:51:04,281 INFO L290 TraceCheckUtils]: 40: Hoare triple {52844#(and (= main_~z~0 0) (<= 999970 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {52845#(and (= main_~z~0 0) (<= 999969 main_~y~0))} is VALID [2022-04-28 03:51:04,281 INFO L290 TraceCheckUtils]: 41: Hoare triple {52845#(and (= main_~z~0 0) (<= 999969 main_~y~0))} assume !(~y~0 > ~z~0); {52807#false} is VALID [2022-04-28 03:51:04,281 INFO L272 TraceCheckUtils]: 42: Hoare triple {52807#false} call __VERIFIER_assert((if ~x~0 == ~z~0 then 1 else 0)); {52807#false} is VALID [2022-04-28 03:51:04,281 INFO L290 TraceCheckUtils]: 43: Hoare triple {52807#false} ~cond := #in~cond; {52807#false} is VALID [2022-04-28 03:51:04,281 INFO L290 TraceCheckUtils]: 44: Hoare triple {52807#false} assume 0 == ~cond; {52807#false} is VALID [2022-04-28 03:51:04,281 INFO L290 TraceCheckUtils]: 45: Hoare triple {52807#false} assume !false; {52807#false} is VALID [2022-04-28 03:51:04,282 INFO L134 CoverageAnalysis]: Checked inductivity of 498 backedges. 0 proven. 498 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 03:51:04,282 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 03:51:04,282 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [392511879] [2022-04-28 03:51:04,282 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [392511879] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 03:51:04,282 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1016797152] [2022-04-28 03:51:04,282 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:51:04,282 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 03:51:04,282 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 03:51:04,283 INFO L229 MonitoredProcess]: Starting monitored process 42 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 03:51:04,284 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (42)] Waiting until timeout for monitored process [2022-04-28 03:51:04,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:51:04,336 INFO L263 TraceCheckSpWp]: Trace formula consists of 214 conjuncts, 35 conjunts are in the unsatisfiable core [2022-04-28 03:51:04,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:51:04,358 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 03:51:06,339 INFO L272 TraceCheckUtils]: 0: Hoare triple {52806#true} call ULTIMATE.init(); {52806#true} is VALID [2022-04-28 03:51:06,339 INFO L290 TraceCheckUtils]: 1: Hoare triple {52806#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(17, 2);call #Ultimate.allocInit(12, 3); {52806#true} is VALID [2022-04-28 03:51:06,339 INFO L290 TraceCheckUtils]: 2: Hoare triple {52806#true} assume true; {52806#true} is VALID [2022-04-28 03:51:06,339 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {52806#true} {52806#true} #52#return; {52806#true} is VALID [2022-04-28 03:51:06,339 INFO L272 TraceCheckUtils]: 4: Hoare triple {52806#true} call #t~ret9 := main(); {52806#true} is VALID [2022-04-28 03:51:06,340 INFO L290 TraceCheckUtils]: 5: Hoare triple {52806#true} ~x~0 := 0;~y~0 := 50000;~z~0 := 0;~x~0 := 0; {52865#(and (<= main_~z~0 0) (<= 50000 main_~y~0))} is VALID [2022-04-28 03:51:06,340 INFO L290 TraceCheckUtils]: 6: Hoare triple {52865#(and (<= main_~z~0 0) (<= 50000 main_~y~0))} [220] L11-2-->L18-1_primed: Formula: (let ((.cse0 (= v_main_~x~0_2431 v_main_~x~0_2430)) (.cse1 (= |v_main_#t~post4_255| |v_main_#t~post4_254|))) (or (and .cse0 .cse1 (<= 50000 v_main_~x~0_2431)) (and (< v_main_~x~0_2431 v_main_~x~0_2430) (< v_main_~x~0_2430 50001)) (and .cse0 .cse1))) InVars {main_~x~0=v_main_~x~0_2431, main_#t~post4=|v_main_#t~post4_255|} OutVars{main_~x~0=v_main_~x~0_2430, main_#t~post4=|v_main_#t~post4_254|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {52865#(and (<= main_~z~0 0) (<= 50000 main_~y~0))} is VALID [2022-04-28 03:51:06,340 INFO L290 TraceCheckUtils]: 7: Hoare triple {52865#(and (<= main_~z~0 0) (<= 50000 main_~y~0))} [221] L18-1_primed-->L11-2: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {52865#(and (<= main_~z~0 0) (<= 50000 main_~y~0))} is VALID [2022-04-28 03:51:06,341 INFO L290 TraceCheckUtils]: 8: Hoare triple {52865#(and (<= main_~z~0 0) (<= 50000 main_~y~0))} [222] L11-2-->L18-1_primed: Formula: (let ((.cse0 (<= 50000 v_main_~x~0_2433)) (.cse1 (= v_main_~y~0_2705 v_main_~y~0_2704)) (.cse2 (= |v_main_#t~post5_284| |v_main_#t~post5_283|)) (.cse3 (= |v_main_#t~post6_284| |v_main_#t~post6_283|)) (.cse4 (= v_main_~x~0_2433 v_main_~x~0_2432))) (or (and (< v_main_~x~0_2433 v_main_~x~0_2432) (< v_main_~x~0_2432 1000001) .cse0 (= (+ v_main_~x~0_2433 v_main_~y~0_2704) (+ v_main_~x~0_2432 v_main_~y~0_2705))) (and .cse1 .cse2 .cse3 .cse4) (and (or (not (< v_main_~x~0_2433 1000000)) (not .cse0)) .cse1 .cse2 .cse3 .cse4))) InVars {main_~y~0=v_main_~y~0_2705, main_#t~post5=|v_main_#t~post5_284|, main_~x~0=v_main_~x~0_2433, main_#t~post6=|v_main_#t~post6_284|} OutVars{main_~y~0=v_main_~y~0_2704, main_#t~post5=|v_main_#t~post5_283|, main_~x~0=v_main_~x~0_2432, main_#t~post6=|v_main_#t~post6_283|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {52865#(and (<= main_~z~0 0) (<= 50000 main_~y~0))} is VALID [2022-04-28 03:51:06,342 INFO L290 TraceCheckUtils]: 9: Hoare triple {52865#(and (<= main_~z~0 0) (<= 50000 main_~y~0))} [219] L18-1_primed-->L18-1: Formula: (not (< v_main_~x~0_11 1000000)) InVars {main_~x~0=v_main_~x~0_11} OutVars{main_~x~0=v_main_~x~0_11} AuxVars[] AssignedVars[] {52865#(and (<= main_~z~0 0) (<= 50000 main_~y~0))} is VALID [2022-04-28 03:51:06,342 INFO L290 TraceCheckUtils]: 10: Hoare triple {52865#(and (<= main_~z~0 0) (<= 50000 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {52881#(and (<= main_~z~0 0) (<= 49999 main_~y~0))} is VALID [2022-04-28 03:51:06,343 INFO L290 TraceCheckUtils]: 11: Hoare triple {52881#(and (<= main_~z~0 0) (<= 49999 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {52885#(and (<= main_~z~0 0) (<= 49998 main_~y~0))} is VALID [2022-04-28 03:51:06,343 INFO L290 TraceCheckUtils]: 12: Hoare triple {52885#(and (<= main_~z~0 0) (<= 49998 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {52889#(and (<= main_~z~0 0) (<= 49997 main_~y~0))} is VALID [2022-04-28 03:51:06,344 INFO L290 TraceCheckUtils]: 13: Hoare triple {52889#(and (<= main_~z~0 0) (<= 49997 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {52893#(and (<= main_~z~0 0) (<= 49996 main_~y~0))} is VALID [2022-04-28 03:51:06,344 INFO L290 TraceCheckUtils]: 14: Hoare triple {52893#(and (<= main_~z~0 0) (<= 49996 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {52897#(and (<= main_~z~0 0) (<= 49995 main_~y~0))} is VALID [2022-04-28 03:51:06,345 INFO L290 TraceCheckUtils]: 15: Hoare triple {52897#(and (<= main_~z~0 0) (<= 49995 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {52901#(and (<= main_~z~0 0) (<= 49994 main_~y~0))} is VALID [2022-04-28 03:51:06,345 INFO L290 TraceCheckUtils]: 16: Hoare triple {52901#(and (<= main_~z~0 0) (<= 49994 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {52905#(and (<= main_~z~0 0) (<= 49993 main_~y~0))} is VALID [2022-04-28 03:51:06,346 INFO L290 TraceCheckUtils]: 17: Hoare triple {52905#(and (<= main_~z~0 0) (<= 49993 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {52909#(and (<= main_~z~0 0) (<= 49992 main_~y~0))} is VALID [2022-04-28 03:51:06,346 INFO L290 TraceCheckUtils]: 18: Hoare triple {52909#(and (<= main_~z~0 0) (<= 49992 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {52913#(and (<= main_~z~0 0) (<= 49991 main_~y~0))} is VALID [2022-04-28 03:51:06,347 INFO L290 TraceCheckUtils]: 19: Hoare triple {52913#(and (<= main_~z~0 0) (<= 49991 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {52917#(and (<= main_~z~0 0) (<= 49990 main_~y~0))} is VALID [2022-04-28 03:51:06,347 INFO L290 TraceCheckUtils]: 20: Hoare triple {52917#(and (<= main_~z~0 0) (<= 49990 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {52921#(and (<= main_~z~0 0) (<= 49989 main_~y~0))} is VALID [2022-04-28 03:51:06,348 INFO L290 TraceCheckUtils]: 21: Hoare triple {52921#(and (<= main_~z~0 0) (<= 49989 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {52925#(and (<= main_~z~0 0) (<= 49988 main_~y~0))} is VALID [2022-04-28 03:51:06,348 INFO L290 TraceCheckUtils]: 22: Hoare triple {52925#(and (<= main_~z~0 0) (<= 49988 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {52929#(and (<= main_~z~0 0) (<= 49987 main_~y~0))} is VALID [2022-04-28 03:51:06,349 INFO L290 TraceCheckUtils]: 23: Hoare triple {52929#(and (<= main_~z~0 0) (<= 49987 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {52933#(and (<= main_~z~0 0) (<= 49986 main_~y~0))} is VALID [2022-04-28 03:51:06,349 INFO L290 TraceCheckUtils]: 24: Hoare triple {52933#(and (<= main_~z~0 0) (<= 49986 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {52937#(and (<= main_~z~0 0) (<= 49985 main_~y~0))} is VALID [2022-04-28 03:51:06,350 INFO L290 TraceCheckUtils]: 25: Hoare triple {52937#(and (<= main_~z~0 0) (<= 49985 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {52941#(and (<= main_~z~0 0) (<= 49984 main_~y~0))} is VALID [2022-04-28 03:51:06,350 INFO L290 TraceCheckUtils]: 26: Hoare triple {52941#(and (<= main_~z~0 0) (<= 49984 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {52945#(and (<= main_~z~0 0) (<= 49983 main_~y~0))} is VALID [2022-04-28 03:51:06,351 INFO L290 TraceCheckUtils]: 27: Hoare triple {52945#(and (<= main_~z~0 0) (<= 49983 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {52949#(and (<= main_~z~0 0) (<= 49982 main_~y~0))} is VALID [2022-04-28 03:51:06,351 INFO L290 TraceCheckUtils]: 28: Hoare triple {52949#(and (<= main_~z~0 0) (<= 49982 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {52953#(and (<= main_~z~0 0) (<= 49981 main_~y~0))} is VALID [2022-04-28 03:51:06,352 INFO L290 TraceCheckUtils]: 29: Hoare triple {52953#(and (<= main_~z~0 0) (<= 49981 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {52957#(and (<= main_~z~0 0) (<= 49980 main_~y~0))} is VALID [2022-04-28 03:51:06,352 INFO L290 TraceCheckUtils]: 30: Hoare triple {52957#(and (<= main_~z~0 0) (<= 49980 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {52961#(and (<= main_~z~0 0) (<= 49979 main_~y~0))} is VALID [2022-04-28 03:51:06,353 INFO L290 TraceCheckUtils]: 31: Hoare triple {52961#(and (<= main_~z~0 0) (<= 49979 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {52965#(and (<= main_~z~0 0) (<= 49978 main_~y~0))} is VALID [2022-04-28 03:51:06,353 INFO L290 TraceCheckUtils]: 32: Hoare triple {52965#(and (<= main_~z~0 0) (<= 49978 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {52969#(and (<= main_~z~0 0) (<= 49977 main_~y~0))} is VALID [2022-04-28 03:51:06,354 INFO L290 TraceCheckUtils]: 33: Hoare triple {52969#(and (<= main_~z~0 0) (<= 49977 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {52973#(and (<= main_~z~0 0) (<= 49976 main_~y~0))} is VALID [2022-04-28 03:51:06,354 INFO L290 TraceCheckUtils]: 34: Hoare triple {52973#(and (<= main_~z~0 0) (<= 49976 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {52977#(and (<= main_~z~0 0) (<= 49975 main_~y~0))} is VALID [2022-04-28 03:51:06,354 INFO L290 TraceCheckUtils]: 35: Hoare triple {52977#(and (<= main_~z~0 0) (<= 49975 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {52981#(and (<= main_~z~0 0) (<= 49974 main_~y~0))} is VALID [2022-04-28 03:51:06,355 INFO L290 TraceCheckUtils]: 36: Hoare triple {52981#(and (<= main_~z~0 0) (<= 49974 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {52985#(and (<= main_~z~0 0) (<= 49973 main_~y~0))} is VALID [2022-04-28 03:51:06,355 INFO L290 TraceCheckUtils]: 37: Hoare triple {52985#(and (<= main_~z~0 0) (<= 49973 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {52989#(and (<= main_~z~0 0) (<= 49972 main_~y~0))} is VALID [2022-04-28 03:51:06,356 INFO L290 TraceCheckUtils]: 38: Hoare triple {52989#(and (<= main_~z~0 0) (<= 49972 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {52993#(and (<= main_~z~0 0) (<= 49971 main_~y~0))} is VALID [2022-04-28 03:51:06,356 INFO L290 TraceCheckUtils]: 39: Hoare triple {52993#(and (<= main_~z~0 0) (<= 49971 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {52997#(and (<= main_~z~0 0) (<= 49970 main_~y~0))} is VALID [2022-04-28 03:51:06,357 INFO L290 TraceCheckUtils]: 40: Hoare triple {52997#(and (<= main_~z~0 0) (<= 49970 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {53001#(and (<= main_~z~0 0) (<= 49969 main_~y~0))} is VALID [2022-04-28 03:51:06,357 INFO L290 TraceCheckUtils]: 41: Hoare triple {53001#(and (<= main_~z~0 0) (<= 49969 main_~y~0))} assume !(~y~0 > ~z~0); {52807#false} is VALID [2022-04-28 03:51:06,357 INFO L272 TraceCheckUtils]: 42: Hoare triple {52807#false} call __VERIFIER_assert((if ~x~0 == ~z~0 then 1 else 0)); {52807#false} is VALID [2022-04-28 03:51:06,357 INFO L290 TraceCheckUtils]: 43: Hoare triple {52807#false} ~cond := #in~cond; {52807#false} is VALID [2022-04-28 03:51:06,357 INFO L290 TraceCheckUtils]: 44: Hoare triple {52807#false} assume 0 == ~cond; {52807#false} is VALID [2022-04-28 03:51:06,357 INFO L290 TraceCheckUtils]: 45: Hoare triple {52807#false} assume !false; {52807#false} is VALID [2022-04-28 03:51:06,358 INFO L134 CoverageAnalysis]: Checked inductivity of 498 backedges. 0 proven. 496 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-04-28 03:51:06,358 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 03:51:08,905 INFO L290 TraceCheckUtils]: 45: Hoare triple {52807#false} assume !false; {52807#false} is VALID [2022-04-28 03:51:08,905 INFO L290 TraceCheckUtils]: 44: Hoare triple {52807#false} assume 0 == ~cond; {52807#false} is VALID [2022-04-28 03:51:08,905 INFO L290 TraceCheckUtils]: 43: Hoare triple {52807#false} ~cond := #in~cond; {52807#false} is VALID [2022-04-28 03:51:08,905 INFO L272 TraceCheckUtils]: 42: Hoare triple {52807#false} call __VERIFIER_assert((if ~x~0 == ~z~0 then 1 else 0)); {52807#false} is VALID [2022-04-28 03:51:08,906 INFO L290 TraceCheckUtils]: 41: Hoare triple {53029#(< main_~z~0 main_~y~0)} assume !(~y~0 > ~z~0); {52807#false} is VALID [2022-04-28 03:51:08,906 INFO L290 TraceCheckUtils]: 40: Hoare triple {53033#(< (+ main_~z~0 1) main_~y~0)} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {53029#(< main_~z~0 main_~y~0)} is VALID [2022-04-28 03:51:08,907 INFO L290 TraceCheckUtils]: 39: Hoare triple {53037#(< (+ main_~z~0 2) main_~y~0)} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {53033#(< (+ main_~z~0 1) main_~y~0)} is VALID [2022-04-28 03:51:08,907 INFO L290 TraceCheckUtils]: 38: Hoare triple {53041#(< (+ main_~z~0 3) main_~y~0)} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {53037#(< (+ main_~z~0 2) main_~y~0)} is VALID [2022-04-28 03:51:08,908 INFO L290 TraceCheckUtils]: 37: Hoare triple {53045#(< (+ main_~z~0 4) main_~y~0)} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {53041#(< (+ main_~z~0 3) main_~y~0)} is VALID [2022-04-28 03:51:08,908 INFO L290 TraceCheckUtils]: 36: Hoare triple {53049#(< (+ 5 main_~z~0) main_~y~0)} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {53045#(< (+ main_~z~0 4) main_~y~0)} is VALID [2022-04-28 03:51:08,909 INFO L290 TraceCheckUtils]: 35: Hoare triple {53053#(< (+ main_~z~0 6) main_~y~0)} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {53049#(< (+ 5 main_~z~0) main_~y~0)} is VALID [2022-04-28 03:51:08,909 INFO L290 TraceCheckUtils]: 34: Hoare triple {53057#(< (+ 7 main_~z~0) main_~y~0)} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {53053#(< (+ main_~z~0 6) main_~y~0)} is VALID [2022-04-28 03:51:08,910 INFO L290 TraceCheckUtils]: 33: Hoare triple {53061#(< (+ main_~z~0 8) main_~y~0)} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {53057#(< (+ 7 main_~z~0) main_~y~0)} is VALID [2022-04-28 03:51:08,910 INFO L290 TraceCheckUtils]: 32: Hoare triple {53065#(< (+ main_~z~0 9) main_~y~0)} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {53061#(< (+ main_~z~0 8) main_~y~0)} is VALID [2022-04-28 03:51:08,911 INFO L290 TraceCheckUtils]: 31: Hoare triple {53069#(< (+ main_~z~0 10) main_~y~0)} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {53065#(< (+ main_~z~0 9) main_~y~0)} is VALID [2022-04-28 03:51:08,911 INFO L290 TraceCheckUtils]: 30: Hoare triple {53073#(< (+ main_~z~0 11) main_~y~0)} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {53069#(< (+ main_~z~0 10) main_~y~0)} is VALID [2022-04-28 03:51:08,911 INFO L290 TraceCheckUtils]: 29: Hoare triple {53077#(< (+ main_~z~0 12) main_~y~0)} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {53073#(< (+ main_~z~0 11) main_~y~0)} is VALID [2022-04-28 03:51:08,912 INFO L290 TraceCheckUtils]: 28: Hoare triple {53081#(< (+ main_~z~0 13) main_~y~0)} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {53077#(< (+ main_~z~0 12) main_~y~0)} is VALID [2022-04-28 03:51:08,912 INFO L290 TraceCheckUtils]: 27: Hoare triple {53085#(< (+ main_~z~0 14) main_~y~0)} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {53081#(< (+ main_~z~0 13) main_~y~0)} is VALID [2022-04-28 03:51:08,913 INFO L290 TraceCheckUtils]: 26: Hoare triple {53089#(< (+ main_~z~0 15) main_~y~0)} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {53085#(< (+ main_~z~0 14) main_~y~0)} is VALID [2022-04-28 03:51:08,913 INFO L290 TraceCheckUtils]: 25: Hoare triple {53093#(< (+ main_~z~0 16) main_~y~0)} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {53089#(< (+ main_~z~0 15) main_~y~0)} is VALID [2022-04-28 03:51:08,914 INFO L290 TraceCheckUtils]: 24: Hoare triple {53097#(< (+ main_~z~0 17) main_~y~0)} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {53093#(< (+ main_~z~0 16) main_~y~0)} is VALID [2022-04-28 03:51:08,914 INFO L290 TraceCheckUtils]: 23: Hoare triple {53101#(< (+ main_~z~0 18) main_~y~0)} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {53097#(< (+ main_~z~0 17) main_~y~0)} is VALID [2022-04-28 03:51:08,915 INFO L290 TraceCheckUtils]: 22: Hoare triple {53105#(< (+ 19 main_~z~0) main_~y~0)} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {53101#(< (+ main_~z~0 18) main_~y~0)} is VALID [2022-04-28 03:51:08,915 INFO L290 TraceCheckUtils]: 21: Hoare triple {53109#(< (+ main_~z~0 20) main_~y~0)} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {53105#(< (+ 19 main_~z~0) main_~y~0)} is VALID [2022-04-28 03:51:08,916 INFO L290 TraceCheckUtils]: 20: Hoare triple {53113#(< (+ main_~z~0 21) main_~y~0)} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {53109#(< (+ main_~z~0 20) main_~y~0)} is VALID [2022-04-28 03:51:08,916 INFO L290 TraceCheckUtils]: 19: Hoare triple {53117#(< (+ main_~z~0 22) main_~y~0)} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {53113#(< (+ main_~z~0 21) main_~y~0)} is VALID [2022-04-28 03:51:08,917 INFO L290 TraceCheckUtils]: 18: Hoare triple {53121#(< (+ 23 main_~z~0) main_~y~0)} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {53117#(< (+ main_~z~0 22) main_~y~0)} is VALID [2022-04-28 03:51:08,917 INFO L290 TraceCheckUtils]: 17: Hoare triple {53125#(< (+ main_~z~0 24) main_~y~0)} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {53121#(< (+ 23 main_~z~0) main_~y~0)} is VALID [2022-04-28 03:51:08,917 INFO L290 TraceCheckUtils]: 16: Hoare triple {53129#(< (+ main_~z~0 25) main_~y~0)} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {53125#(< (+ main_~z~0 24) main_~y~0)} is VALID [2022-04-28 03:51:08,918 INFO L290 TraceCheckUtils]: 15: Hoare triple {53133#(< (+ main_~z~0 26) main_~y~0)} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {53129#(< (+ main_~z~0 25) main_~y~0)} is VALID [2022-04-28 03:51:08,918 INFO L290 TraceCheckUtils]: 14: Hoare triple {53137#(< (+ main_~z~0 27) main_~y~0)} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {53133#(< (+ main_~z~0 26) main_~y~0)} is VALID [2022-04-28 03:51:08,919 INFO L290 TraceCheckUtils]: 13: Hoare triple {53141#(< (+ main_~z~0 28) main_~y~0)} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {53137#(< (+ main_~z~0 27) main_~y~0)} is VALID [2022-04-28 03:51:08,919 INFO L290 TraceCheckUtils]: 12: Hoare triple {53145#(< (+ 29 main_~z~0) main_~y~0)} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {53141#(< (+ main_~z~0 28) main_~y~0)} is VALID [2022-04-28 03:51:08,920 INFO L290 TraceCheckUtils]: 11: Hoare triple {53149#(< (+ 30 main_~z~0) main_~y~0)} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {53145#(< (+ 29 main_~z~0) main_~y~0)} is VALID [2022-04-28 03:51:08,920 INFO L290 TraceCheckUtils]: 10: Hoare triple {53153#(< (+ main_~z~0 31) main_~y~0)} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {53149#(< (+ 30 main_~z~0) main_~y~0)} is VALID [2022-04-28 03:51:08,921 INFO L290 TraceCheckUtils]: 9: Hoare triple {53153#(< (+ main_~z~0 31) main_~y~0)} [219] L18-1_primed-->L18-1: Formula: (not (< v_main_~x~0_11 1000000)) InVars {main_~x~0=v_main_~x~0_11} OutVars{main_~x~0=v_main_~x~0_11} AuxVars[] AssignedVars[] {53153#(< (+ main_~z~0 31) main_~y~0)} is VALID [2022-04-28 03:51:08,921 INFO L290 TraceCheckUtils]: 8: Hoare triple {53153#(< (+ main_~z~0 31) main_~y~0)} [222] L11-2-->L18-1_primed: Formula: (let ((.cse0 (<= 50000 v_main_~x~0_2433)) (.cse1 (= v_main_~y~0_2705 v_main_~y~0_2704)) (.cse2 (= |v_main_#t~post5_284| |v_main_#t~post5_283|)) (.cse3 (= |v_main_#t~post6_284| |v_main_#t~post6_283|)) (.cse4 (= v_main_~x~0_2433 v_main_~x~0_2432))) (or (and (< v_main_~x~0_2433 v_main_~x~0_2432) (< v_main_~x~0_2432 1000001) .cse0 (= (+ v_main_~x~0_2433 v_main_~y~0_2704) (+ v_main_~x~0_2432 v_main_~y~0_2705))) (and .cse1 .cse2 .cse3 .cse4) (and (or (not (< v_main_~x~0_2433 1000000)) (not .cse0)) .cse1 .cse2 .cse3 .cse4))) InVars {main_~y~0=v_main_~y~0_2705, main_#t~post5=|v_main_#t~post5_284|, main_~x~0=v_main_~x~0_2433, main_#t~post6=|v_main_#t~post6_284|} OutVars{main_~y~0=v_main_~y~0_2704, main_#t~post5=|v_main_#t~post5_283|, main_~x~0=v_main_~x~0_2432, main_#t~post6=|v_main_#t~post6_283|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {53153#(< (+ main_~z~0 31) main_~y~0)} is VALID [2022-04-28 03:51:08,922 INFO L290 TraceCheckUtils]: 7: Hoare triple {53153#(< (+ main_~z~0 31) main_~y~0)} [221] L18-1_primed-->L11-2: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {53153#(< (+ main_~z~0 31) main_~y~0)} is VALID [2022-04-28 03:51:08,922 INFO L290 TraceCheckUtils]: 6: Hoare triple {53153#(< (+ main_~z~0 31) main_~y~0)} [220] L11-2-->L18-1_primed: Formula: (let ((.cse0 (= v_main_~x~0_2431 v_main_~x~0_2430)) (.cse1 (= |v_main_#t~post4_255| |v_main_#t~post4_254|))) (or (and .cse0 .cse1 (<= 50000 v_main_~x~0_2431)) (and (< v_main_~x~0_2431 v_main_~x~0_2430) (< v_main_~x~0_2430 50001)) (and .cse0 .cse1))) InVars {main_~x~0=v_main_~x~0_2431, main_#t~post4=|v_main_#t~post4_255|} OutVars{main_~x~0=v_main_~x~0_2430, main_#t~post4=|v_main_#t~post4_254|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {53153#(< (+ main_~z~0 31) main_~y~0)} is VALID [2022-04-28 03:51:08,922 INFO L290 TraceCheckUtils]: 5: Hoare triple {52806#true} ~x~0 := 0;~y~0 := 50000;~z~0 := 0;~x~0 := 0; {53153#(< (+ main_~z~0 31) main_~y~0)} is VALID [2022-04-28 03:51:08,922 INFO L272 TraceCheckUtils]: 4: Hoare triple {52806#true} call #t~ret9 := main(); {52806#true} is VALID [2022-04-28 03:51:08,923 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {52806#true} {52806#true} #52#return; {52806#true} is VALID [2022-04-28 03:51:08,923 INFO L290 TraceCheckUtils]: 2: Hoare triple {52806#true} assume true; {52806#true} is VALID [2022-04-28 03:51:08,923 INFO L290 TraceCheckUtils]: 1: Hoare triple {52806#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(17, 2);call #Ultimate.allocInit(12, 3); {52806#true} is VALID [2022-04-28 03:51:08,923 INFO L272 TraceCheckUtils]: 0: Hoare triple {52806#true} call ULTIMATE.init(); {52806#true} is VALID [2022-04-28 03:51:08,923 INFO L134 CoverageAnalysis]: Checked inductivity of 498 backedges. 0 proven. 496 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-04-28 03:51:08,923 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1016797152] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 03:51:08,923 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 03:51:08,923 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [38, 34, 34] total 102 [2022-04-28 03:51:12,479 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 03:51:12,479 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [61526842] [2022-04-28 03:51:12,479 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [61526842] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 03:51:12,479 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 03:51:12,479 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [92] imperfect sequences [] total 92 [2022-04-28 03:51:12,479 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1766558792] [2022-04-28 03:51:12,479 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 03:51:12,480 INFO L78 Accepts]: Start accepts. Automaton has has 92 states, 92 states have (on average 1.641304347826087) internal successors, (151), 91 states have internal predecessors, (151), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 155 [2022-04-28 03:51:12,480 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 03:51:12,480 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 92 states, 92 states have (on average 1.641304347826087) internal successors, (151), 91 states have internal predecessors, (151), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:51:12,592 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 155 edges. 155 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 03:51:12,593 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 92 states [2022-04-28 03:51:12,593 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 03:51:12,593 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 92 interpolants. [2022-04-28 03:51:12,595 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8651, Invalid=16471, Unknown=0, NotChecked=0, Total=25122 [2022-04-28 03:51:12,595 INFO L87 Difference]: Start difference. First operand 156 states and 159 transitions. Second operand has 92 states, 92 states have (on average 1.641304347826087) internal successors, (151), 91 states have internal predecessors, (151), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:51:27,183 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:51:27,183 INFO L93 Difference]: Finished difference Result 416 states and 426 transitions. [2022-04-28 03:51:27,183 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 60 states. [2022-04-28 03:51:27,183 INFO L78 Accepts]: Start accepts. Automaton has has 92 states, 92 states have (on average 1.641304347826087) internal successors, (151), 91 states have internal predecessors, (151), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 155 [2022-04-28 03:51:27,183 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 03:51:27,183 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 92 states, 92 states have (on average 1.641304347826087) internal successors, (151), 91 states have internal predecessors, (151), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:51:27,184 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 144 transitions. [2022-04-28 03:51:27,184 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 92 states, 92 states have (on average 1.641304347826087) internal successors, (151), 91 states have internal predecessors, (151), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:51:27,185 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 144 transitions. [2022-04-28 03:51:27,185 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 60 states and 144 transitions. [2022-04-28 03:51:27,302 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 144 edges. 144 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 03:51:27,305 INFO L225 Difference]: With dead ends: 416 [2022-04-28 03:51:27,305 INFO L226 Difference]: Without dead ends: 268 [2022-04-28 03:51:27,308 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 305 GetRequests, 89 SyntacticMatches, 2 SemanticMatches, 214 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11313 ImplicationChecksByTransitivity, 9.6s TimeCoverageRelationStatistics Valid=12588, Invalid=33852, Unknown=0, NotChecked=0, Total=46440 [2022-04-28 03:51:27,309 INFO L413 NwaCegarLoop]: 13 mSDtfsCounter, 67 mSDsluCounter, 302 mSDsCounter, 0 mSdLazyCounter, 7384 mSolverCounterSat, 63 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 67 SdHoareTripleChecker+Valid, 315 SdHoareTripleChecker+Invalid, 7447 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 63 IncrementalHoareTripleChecker+Valid, 7384 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.9s IncrementalHoareTripleChecker+Time [2022-04-28 03:51:27,309 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [67 Valid, 315 Invalid, 7447 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [63 Valid, 7384 Invalid, 0 Unknown, 0 Unchecked, 5.9s Time] [2022-04-28 03:51:27,309 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 268 states. [2022-04-28 03:51:28,004 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 268 to 268. [2022-04-28 03:51:28,005 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 03:51:28,005 INFO L82 GeneralOperation]: Start isEquivalent. First operand 268 states. Second operand has 268 states, 263 states have (on average 1.0190114068441065) internal successors, (268), 263 states have internal predecessors, (268), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:51:28,005 INFO L74 IsIncluded]: Start isIncluded. First operand 268 states. Second operand has 268 states, 263 states have (on average 1.0190114068441065) internal successors, (268), 263 states have internal predecessors, (268), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:51:28,005 INFO L87 Difference]: Start difference. First operand 268 states. Second operand has 268 states, 263 states have (on average 1.0190114068441065) internal successors, (268), 263 states have internal predecessors, (268), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:51:28,008 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:51:28,008 INFO L93 Difference]: Finished difference Result 268 states and 272 transitions. [2022-04-28 03:51:28,008 INFO L276 IsEmpty]: Start isEmpty. Operand 268 states and 272 transitions. [2022-04-28 03:51:28,008 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:51:28,008 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:51:28,009 INFO L74 IsIncluded]: Start isIncluded. First operand has 268 states, 263 states have (on average 1.0190114068441065) internal successors, (268), 263 states have internal predecessors, (268), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 268 states. [2022-04-28 03:51:28,009 INFO L87 Difference]: Start difference. First operand has 268 states, 263 states have (on average 1.0190114068441065) internal successors, (268), 263 states have internal predecessors, (268), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 268 states. [2022-04-28 03:51:28,011 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:51:28,011 INFO L93 Difference]: Finished difference Result 268 states and 272 transitions. [2022-04-28 03:51:28,011 INFO L276 IsEmpty]: Start isEmpty. Operand 268 states and 272 transitions. [2022-04-28 03:51:28,011 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:51:28,012 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:51:28,012 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 03:51:28,012 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 03:51:28,012 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 268 states, 263 states have (on average 1.0190114068441065) internal successors, (268), 263 states have internal predecessors, (268), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:51:28,015 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 268 states to 268 states and 272 transitions. [2022-04-28 03:51:28,015 INFO L78 Accepts]: Start accepts. Automaton has 268 states and 272 transitions. Word has length 155 [2022-04-28 03:51:28,015 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 03:51:28,015 INFO L495 AbstractCegarLoop]: Abstraction has 268 states and 272 transitions. [2022-04-28 03:51:28,015 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 92 states, 92 states have (on average 1.641304347826087) internal successors, (151), 91 states have internal predecessors, (151), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:51:28,015 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 268 states and 272 transitions. [2022-04-28 03:51:28,310 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 272 edges. 272 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 03:51:28,311 INFO L276 IsEmpty]: Start isEmpty. Operand 268 states and 272 transitions. [2022-04-28 03:51:28,311 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 158 [2022-04-28 03:51:28,311 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 03:51:28,311 INFO L195 NwaCegarLoop]: trace histogram [57, 56, 31, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 03:51:28,327 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (42)] Ended with exit code 0 [2022-04-28 03:51:28,519 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable43,42 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 03:51:28,519 INFO L420 AbstractCegarLoop]: === Iteration 45 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 03:51:28,519 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 03:51:28,520 INFO L85 PathProgramCache]: Analyzing trace with hash -1427312975, now seen corresponding path program 42 times [2022-04-28 03:51:28,520 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 03:51:28,520 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1878167699] [2022-04-28 03:51:30,790 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 1 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 03:51:31,020 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={1=1, 2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 03:51:31,021 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-28 03:51:31,023 INFO L85 PathProgramCache]: Analyzing trace with hash 1537887650, now seen corresponding path program 1 times [2022-04-28 03:51:31,023 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 03:51:31,023 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [119338375] [2022-04-28 03:51:31,023 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:51:31,023 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 03:51:31,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:51:31,783 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 03:51:31,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:51:31,792 INFO L290 TraceCheckUtils]: 0: Hoare triple {55301#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(17, 2);call #Ultimate.allocInit(12, 3); {55261#true} is VALID [2022-04-28 03:51:31,792 INFO L290 TraceCheckUtils]: 1: Hoare triple {55261#true} assume true; {55261#true} is VALID [2022-04-28 03:51:31,792 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {55261#true} {55261#true} #52#return; {55261#true} is VALID [2022-04-28 03:51:31,793 INFO L272 TraceCheckUtils]: 0: Hoare triple {55261#true} call ULTIMATE.init(); {55301#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 03:51:31,793 INFO L290 TraceCheckUtils]: 1: Hoare triple {55301#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(17, 2);call #Ultimate.allocInit(12, 3); {55261#true} is VALID [2022-04-28 03:51:31,793 INFO L290 TraceCheckUtils]: 2: Hoare triple {55261#true} assume true; {55261#true} is VALID [2022-04-28 03:51:31,793 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {55261#true} {55261#true} #52#return; {55261#true} is VALID [2022-04-28 03:51:31,793 INFO L272 TraceCheckUtils]: 4: Hoare triple {55261#true} call #t~ret9 := main(); {55261#true} is VALID [2022-04-28 03:51:31,794 INFO L290 TraceCheckUtils]: 5: Hoare triple {55261#true} ~x~0 := 0;~y~0 := 50000;~z~0 := 0;~x~0 := 0; {55266#(and (= main_~z~0 0) (= main_~x~0 0) (<= 50000 main_~y~0))} is VALID [2022-04-28 03:51:31,795 INFO L290 TraceCheckUtils]: 6: Hoare triple {55266#(and (= main_~z~0 0) (= main_~x~0 0) (<= 50000 main_~y~0))} [224] L11-2-->L18-1_primed: Formula: (let ((.cse0 (= v_main_~x~0_2534 v_main_~x~0_2533)) (.cse1 (= |v_main_#t~post4_261| |v_main_#t~post4_260|))) (or (and .cse0 (<= 50000 v_main_~x~0_2534) .cse1) (and (< v_main_~x~0_2534 v_main_~x~0_2533) (< v_main_~x~0_2533 50001)) (and .cse0 .cse1))) InVars {main_~x~0=v_main_~x~0_2534, main_#t~post4=|v_main_#t~post4_261|} OutVars{main_~x~0=v_main_~x~0_2533, main_#t~post4=|v_main_#t~post4_260|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {55267#(or (= main_~x~0 0) (and (= main_~z~0 0) (<= main_~x~0 main_~y~0) (<= main_~x~0 50000)))} is VALID [2022-04-28 03:51:31,795 INFO L290 TraceCheckUtils]: 7: Hoare triple {55267#(or (= main_~x~0 0) (and (= main_~z~0 0) (<= main_~x~0 main_~y~0) (<= main_~x~0 50000)))} [225] L18-1_primed-->L11-2: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {55267#(or (= main_~x~0 0) (and (= main_~z~0 0) (<= main_~x~0 main_~y~0) (<= main_~x~0 50000)))} is VALID [2022-04-28 03:51:31,796 INFO L290 TraceCheckUtils]: 8: Hoare triple {55267#(or (= main_~x~0 0) (and (= main_~z~0 0) (<= main_~x~0 main_~y~0) (<= main_~x~0 50000)))} [226] L11-2-->L18-1_primed: Formula: (let ((.cse0 (<= 50000 v_main_~x~0_2536)) (.cse1 (= |v_main_#t~post6_291| |v_main_#t~post6_290|)) (.cse2 (= v_main_~x~0_2536 v_main_~x~0_2535)) (.cse3 (= v_main_~y~0_2831 v_main_~y~0_2830))) (or (and (< v_main_~x~0_2535 1000001) .cse0 (< v_main_~x~0_2536 v_main_~x~0_2535) (= (+ v_main_~x~0_2536 v_main_~y~0_2830) (+ v_main_~x~0_2535 v_main_~y~0_2831))) (and (= |v_main_#t~post5_290| |v_main_#t~post5_291|) .cse1 .cse2 (or (not .cse0) (not (< v_main_~x~0_2536 1000000))) .cse3) (and (= |v_main_#t~post5_291| |v_main_#t~post5_290|) .cse1 .cse2 .cse3))) InVars {main_~y~0=v_main_~y~0_2831, main_#t~post5=|v_main_#t~post5_291|, main_~x~0=v_main_~x~0_2536, main_#t~post6=|v_main_#t~post6_291|} OutVars{main_~y~0=v_main_~y~0_2830, main_#t~post5=|v_main_#t~post5_290|, main_~x~0=v_main_~x~0_2535, main_#t~post6=|v_main_#t~post6_290|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {55268#(or (and (= main_~z~0 0) (<= main_~x~0 main_~y~0)) (<= main_~x~0 50000))} is VALID [2022-04-28 03:51:31,797 INFO L290 TraceCheckUtils]: 9: Hoare triple {55268#(or (and (= main_~z~0 0) (<= main_~x~0 main_~y~0)) (<= main_~x~0 50000))} [223] L18-1_primed-->L18-1: Formula: (not (< v_main_~x~0_11 1000000)) InVars {main_~x~0=v_main_~x~0_11} OutVars{main_~x~0=v_main_~x~0_11} AuxVars[] AssignedVars[] {55269#(and (= main_~z~0 0) (<= 1000000 main_~y~0))} is VALID [2022-04-28 03:51:31,798 INFO L290 TraceCheckUtils]: 10: Hoare triple {55269#(and (= main_~z~0 0) (<= 1000000 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {55270#(and (= main_~z~0 0) (<= 999999 main_~y~0))} is VALID [2022-04-28 03:51:31,798 INFO L290 TraceCheckUtils]: 11: Hoare triple {55270#(and (= main_~z~0 0) (<= 999999 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {55271#(and (= main_~z~0 0) (<= 999998 main_~y~0))} is VALID [2022-04-28 03:51:31,799 INFO L290 TraceCheckUtils]: 12: Hoare triple {55271#(and (= main_~z~0 0) (<= 999998 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {55272#(and (= main_~z~0 0) (<= 999997 main_~y~0))} is VALID [2022-04-28 03:51:31,800 INFO L290 TraceCheckUtils]: 13: Hoare triple {55272#(and (= main_~z~0 0) (<= 999997 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {55273#(and (<= 999996 main_~y~0) (= main_~z~0 0))} is VALID [2022-04-28 03:51:31,800 INFO L290 TraceCheckUtils]: 14: Hoare triple {55273#(and (<= 999996 main_~y~0) (= main_~z~0 0))} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {55274#(and (= main_~z~0 0) (<= 999995 main_~y~0))} is VALID [2022-04-28 03:51:31,801 INFO L290 TraceCheckUtils]: 15: Hoare triple {55274#(and (= main_~z~0 0) (<= 999995 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {55275#(and (= main_~z~0 0) (<= 999994 main_~y~0))} is VALID [2022-04-28 03:51:31,802 INFO L290 TraceCheckUtils]: 16: Hoare triple {55275#(and (= main_~z~0 0) (<= 999994 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {55276#(and (= main_~z~0 0) (<= 999993 main_~y~0))} is VALID [2022-04-28 03:51:31,802 INFO L290 TraceCheckUtils]: 17: Hoare triple {55276#(and (= main_~z~0 0) (<= 999993 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {55277#(and (= main_~z~0 0) (<= 999992 main_~y~0))} is VALID [2022-04-28 03:51:31,803 INFO L290 TraceCheckUtils]: 18: Hoare triple {55277#(and (= main_~z~0 0) (<= 999992 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {55278#(and (= main_~z~0 0) (<= 999991 main_~y~0))} is VALID [2022-04-28 03:51:31,804 INFO L290 TraceCheckUtils]: 19: Hoare triple {55278#(and (= main_~z~0 0) (<= 999991 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {55279#(and (= main_~z~0 0) (<= 999990 main_~y~0))} is VALID [2022-04-28 03:51:31,804 INFO L290 TraceCheckUtils]: 20: Hoare triple {55279#(and (= main_~z~0 0) (<= 999990 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {55280#(and (= main_~z~0 0) (<= 999989 main_~y~0))} is VALID [2022-04-28 03:51:31,805 INFO L290 TraceCheckUtils]: 21: Hoare triple {55280#(and (= main_~z~0 0) (<= 999989 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {55281#(and (= main_~z~0 0) (<= 999988 main_~y~0))} is VALID [2022-04-28 03:51:31,806 INFO L290 TraceCheckUtils]: 22: Hoare triple {55281#(and (= main_~z~0 0) (<= 999988 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {55282#(and (= main_~z~0 0) (<= 999987 main_~y~0))} is VALID [2022-04-28 03:51:31,806 INFO L290 TraceCheckUtils]: 23: Hoare triple {55282#(and (= main_~z~0 0) (<= 999987 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {55283#(and (= main_~z~0 0) (<= 999986 main_~y~0))} is VALID [2022-04-28 03:51:31,807 INFO L290 TraceCheckUtils]: 24: Hoare triple {55283#(and (= main_~z~0 0) (<= 999986 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {55284#(and (= main_~z~0 0) (<= 999985 main_~y~0))} is VALID [2022-04-28 03:51:31,808 INFO L290 TraceCheckUtils]: 25: Hoare triple {55284#(and (= main_~z~0 0) (<= 999985 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {55285#(and (= main_~z~0 0) (<= 999984 main_~y~0))} is VALID [2022-04-28 03:51:31,808 INFO L290 TraceCheckUtils]: 26: Hoare triple {55285#(and (= main_~z~0 0) (<= 999984 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {55286#(and (<= 999983 main_~y~0) (= main_~z~0 0))} is VALID [2022-04-28 03:51:31,809 INFO L290 TraceCheckUtils]: 27: Hoare triple {55286#(and (<= 999983 main_~y~0) (= main_~z~0 0))} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {55287#(and (= main_~z~0 0) (<= 999982 main_~y~0))} is VALID [2022-04-28 03:51:31,810 INFO L290 TraceCheckUtils]: 28: Hoare triple {55287#(and (= main_~z~0 0) (<= 999982 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {55288#(and (= main_~z~0 0) (<= 999981 main_~y~0))} is VALID [2022-04-28 03:51:31,810 INFO L290 TraceCheckUtils]: 29: Hoare triple {55288#(and (= main_~z~0 0) (<= 999981 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {55289#(and (= main_~z~0 0) (<= 999980 main_~y~0))} is VALID [2022-04-28 03:51:31,811 INFO L290 TraceCheckUtils]: 30: Hoare triple {55289#(and (= main_~z~0 0) (<= 999980 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {55290#(and (= main_~z~0 0) (<= 999979 main_~y~0))} is VALID [2022-04-28 03:51:31,812 INFO L290 TraceCheckUtils]: 31: Hoare triple {55290#(and (= main_~z~0 0) (<= 999979 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {55291#(and (= main_~z~0 0) (<= 999978 main_~y~0))} is VALID [2022-04-28 03:51:31,812 INFO L290 TraceCheckUtils]: 32: Hoare triple {55291#(and (= main_~z~0 0) (<= 999978 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {55292#(and (= main_~z~0 0) (<= 999977 main_~y~0))} is VALID [2022-04-28 03:51:31,813 INFO L290 TraceCheckUtils]: 33: Hoare triple {55292#(and (= main_~z~0 0) (<= 999977 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {55293#(and (<= 999976 main_~y~0) (= main_~z~0 0))} is VALID [2022-04-28 03:51:31,814 INFO L290 TraceCheckUtils]: 34: Hoare triple {55293#(and (<= 999976 main_~y~0) (= main_~z~0 0))} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {55294#(and (= main_~z~0 0) (<= 999975 main_~y~0))} is VALID [2022-04-28 03:51:31,814 INFO L290 TraceCheckUtils]: 35: Hoare triple {55294#(and (= main_~z~0 0) (<= 999975 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {55295#(and (= main_~z~0 0) (<= 999974 main_~y~0))} is VALID [2022-04-28 03:51:31,815 INFO L290 TraceCheckUtils]: 36: Hoare triple {55295#(and (= main_~z~0 0) (<= 999974 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {55296#(and (= main_~z~0 0) (<= 999973 main_~y~0))} is VALID [2022-04-28 03:51:31,815 INFO L290 TraceCheckUtils]: 37: Hoare triple {55296#(and (= main_~z~0 0) (<= 999973 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {55297#(and (= main_~z~0 0) (<= 999972 main_~y~0))} is VALID [2022-04-28 03:51:31,816 INFO L290 TraceCheckUtils]: 38: Hoare triple {55297#(and (= main_~z~0 0) (<= 999972 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {55298#(and (= main_~z~0 0) (<= 999971 main_~y~0))} is VALID [2022-04-28 03:51:31,817 INFO L290 TraceCheckUtils]: 39: Hoare triple {55298#(and (= main_~z~0 0) (<= 999971 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {55299#(and (= main_~z~0 0) (<= 999970 main_~y~0))} is VALID [2022-04-28 03:51:31,817 INFO L290 TraceCheckUtils]: 40: Hoare triple {55299#(and (= main_~z~0 0) (<= 999970 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {55300#(and (= main_~z~0 0) (<= 999969 main_~y~0))} is VALID [2022-04-28 03:51:31,818 INFO L290 TraceCheckUtils]: 41: Hoare triple {55300#(and (= main_~z~0 0) (<= 999969 main_~y~0))} assume !(~y~0 > ~z~0); {55262#false} is VALID [2022-04-28 03:51:31,818 INFO L272 TraceCheckUtils]: 42: Hoare triple {55262#false} call __VERIFIER_assert((if ~x~0 == ~z~0 then 1 else 0)); {55262#false} is VALID [2022-04-28 03:51:31,818 INFO L290 TraceCheckUtils]: 43: Hoare triple {55262#false} ~cond := #in~cond; {55262#false} is VALID [2022-04-28 03:51:31,818 INFO L290 TraceCheckUtils]: 44: Hoare triple {55262#false} assume 0 == ~cond; {55262#false} is VALID [2022-04-28 03:51:31,818 INFO L290 TraceCheckUtils]: 45: Hoare triple {55262#false} assume !false; {55262#false} is VALID [2022-04-28 03:51:31,818 INFO L134 CoverageAnalysis]: Checked inductivity of 498 backedges. 0 proven. 498 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 03:51:31,819 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 03:51:31,819 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [119338375] [2022-04-28 03:51:31,819 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [119338375] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 03:51:31,819 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [602306186] [2022-04-28 03:51:31,819 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:51:31,819 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 03:51:31,819 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 03:51:31,820 INFO L229 MonitoredProcess]: Starting monitored process 43 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 03:51:31,822 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (43)] Waiting until timeout for monitored process [2022-04-28 03:51:31,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:51:31,883 INFO L263 TraceCheckSpWp]: Trace formula consists of 214 conjuncts, 35 conjunts are in the unsatisfiable core [2022-04-28 03:51:31,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:51:31,904 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 03:51:33,810 INFO L272 TraceCheckUtils]: 0: Hoare triple {55261#true} call ULTIMATE.init(); {55261#true} is VALID [2022-04-28 03:51:33,810 INFO L290 TraceCheckUtils]: 1: Hoare triple {55261#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(17, 2);call #Ultimate.allocInit(12, 3); {55261#true} is VALID [2022-04-28 03:51:33,810 INFO L290 TraceCheckUtils]: 2: Hoare triple {55261#true} assume true; {55261#true} is VALID [2022-04-28 03:51:33,811 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {55261#true} {55261#true} #52#return; {55261#true} is VALID [2022-04-28 03:51:33,811 INFO L272 TraceCheckUtils]: 4: Hoare triple {55261#true} call #t~ret9 := main(); {55261#true} is VALID [2022-04-28 03:51:33,811 INFO L290 TraceCheckUtils]: 5: Hoare triple {55261#true} ~x~0 := 0;~y~0 := 50000;~z~0 := 0;~x~0 := 0; {55320#(and (<= main_~z~0 0) (<= 50000 main_~y~0))} is VALID [2022-04-28 03:51:33,811 INFO L290 TraceCheckUtils]: 6: Hoare triple {55320#(and (<= main_~z~0 0) (<= 50000 main_~y~0))} [224] L11-2-->L18-1_primed: Formula: (let ((.cse0 (= v_main_~x~0_2534 v_main_~x~0_2533)) (.cse1 (= |v_main_#t~post4_261| |v_main_#t~post4_260|))) (or (and .cse0 (<= 50000 v_main_~x~0_2534) .cse1) (and (< v_main_~x~0_2534 v_main_~x~0_2533) (< v_main_~x~0_2533 50001)) (and .cse0 .cse1))) InVars {main_~x~0=v_main_~x~0_2534, main_#t~post4=|v_main_#t~post4_261|} OutVars{main_~x~0=v_main_~x~0_2533, main_#t~post4=|v_main_#t~post4_260|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {55320#(and (<= main_~z~0 0) (<= 50000 main_~y~0))} is VALID [2022-04-28 03:51:33,812 INFO L290 TraceCheckUtils]: 7: Hoare triple {55320#(and (<= main_~z~0 0) (<= 50000 main_~y~0))} [225] L18-1_primed-->L11-2: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {55320#(and (<= main_~z~0 0) (<= 50000 main_~y~0))} is VALID [2022-04-28 03:51:33,812 INFO L290 TraceCheckUtils]: 8: Hoare triple {55320#(and (<= main_~z~0 0) (<= 50000 main_~y~0))} [226] L11-2-->L18-1_primed: Formula: (let ((.cse0 (<= 50000 v_main_~x~0_2536)) (.cse1 (= |v_main_#t~post6_291| |v_main_#t~post6_290|)) (.cse2 (= v_main_~x~0_2536 v_main_~x~0_2535)) (.cse3 (= v_main_~y~0_2831 v_main_~y~0_2830))) (or (and (< v_main_~x~0_2535 1000001) .cse0 (< v_main_~x~0_2536 v_main_~x~0_2535) (= (+ v_main_~x~0_2536 v_main_~y~0_2830) (+ v_main_~x~0_2535 v_main_~y~0_2831))) (and (= |v_main_#t~post5_290| |v_main_#t~post5_291|) .cse1 .cse2 (or (not .cse0) (not (< v_main_~x~0_2536 1000000))) .cse3) (and (= |v_main_#t~post5_291| |v_main_#t~post5_290|) .cse1 .cse2 .cse3))) InVars {main_~y~0=v_main_~y~0_2831, main_#t~post5=|v_main_#t~post5_291|, main_~x~0=v_main_~x~0_2536, main_#t~post6=|v_main_#t~post6_291|} OutVars{main_~y~0=v_main_~y~0_2830, main_#t~post5=|v_main_#t~post5_290|, main_~x~0=v_main_~x~0_2535, main_#t~post6=|v_main_#t~post6_290|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {55320#(and (<= main_~z~0 0) (<= 50000 main_~y~0))} is VALID [2022-04-28 03:51:33,813 INFO L290 TraceCheckUtils]: 9: Hoare triple {55320#(and (<= main_~z~0 0) (<= 50000 main_~y~0))} [223] L18-1_primed-->L18-1: Formula: (not (< v_main_~x~0_11 1000000)) InVars {main_~x~0=v_main_~x~0_11} OutVars{main_~x~0=v_main_~x~0_11} AuxVars[] AssignedVars[] {55320#(and (<= main_~z~0 0) (<= 50000 main_~y~0))} is VALID [2022-04-28 03:51:33,813 INFO L290 TraceCheckUtils]: 10: Hoare triple {55320#(and (<= main_~z~0 0) (<= 50000 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {55336#(and (<= main_~z~0 0) (<= 49999 main_~y~0))} is VALID [2022-04-28 03:51:33,814 INFO L290 TraceCheckUtils]: 11: Hoare triple {55336#(and (<= main_~z~0 0) (<= 49999 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {55340#(and (<= main_~z~0 0) (<= 49998 main_~y~0))} is VALID [2022-04-28 03:51:33,814 INFO L290 TraceCheckUtils]: 12: Hoare triple {55340#(and (<= main_~z~0 0) (<= 49998 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {55344#(and (<= main_~z~0 0) (<= 49997 main_~y~0))} is VALID [2022-04-28 03:51:33,815 INFO L290 TraceCheckUtils]: 13: Hoare triple {55344#(and (<= main_~z~0 0) (<= 49997 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {55348#(and (<= main_~z~0 0) (<= 49996 main_~y~0))} is VALID [2022-04-28 03:51:33,815 INFO L290 TraceCheckUtils]: 14: Hoare triple {55348#(and (<= main_~z~0 0) (<= 49996 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {55352#(and (<= main_~z~0 0) (<= 49995 main_~y~0))} is VALID [2022-04-28 03:51:33,816 INFO L290 TraceCheckUtils]: 15: Hoare triple {55352#(and (<= main_~z~0 0) (<= 49995 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {55356#(and (<= main_~z~0 0) (<= 49994 main_~y~0))} is VALID [2022-04-28 03:51:33,816 INFO L290 TraceCheckUtils]: 16: Hoare triple {55356#(and (<= main_~z~0 0) (<= 49994 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {55360#(and (<= main_~z~0 0) (<= 49993 main_~y~0))} is VALID [2022-04-28 03:51:33,817 INFO L290 TraceCheckUtils]: 17: Hoare triple {55360#(and (<= main_~z~0 0) (<= 49993 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {55364#(and (<= main_~z~0 0) (<= 49992 main_~y~0))} is VALID [2022-04-28 03:51:33,817 INFO L290 TraceCheckUtils]: 18: Hoare triple {55364#(and (<= main_~z~0 0) (<= 49992 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {55368#(and (<= main_~z~0 0) (<= 49991 main_~y~0))} is VALID [2022-04-28 03:51:33,818 INFO L290 TraceCheckUtils]: 19: Hoare triple {55368#(and (<= main_~z~0 0) (<= 49991 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {55372#(and (<= main_~z~0 0) (<= 49990 main_~y~0))} is VALID [2022-04-28 03:51:33,818 INFO L290 TraceCheckUtils]: 20: Hoare triple {55372#(and (<= main_~z~0 0) (<= 49990 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {55376#(and (<= main_~z~0 0) (<= 49989 main_~y~0))} is VALID [2022-04-28 03:51:33,819 INFO L290 TraceCheckUtils]: 21: Hoare triple {55376#(and (<= main_~z~0 0) (<= 49989 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {55380#(and (<= main_~z~0 0) (<= 49988 main_~y~0))} is VALID [2022-04-28 03:51:33,819 INFO L290 TraceCheckUtils]: 22: Hoare triple {55380#(and (<= main_~z~0 0) (<= 49988 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {55384#(and (<= main_~z~0 0) (<= 49987 main_~y~0))} is VALID [2022-04-28 03:51:33,820 INFO L290 TraceCheckUtils]: 23: Hoare triple {55384#(and (<= main_~z~0 0) (<= 49987 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {55388#(and (<= main_~z~0 0) (<= 49986 main_~y~0))} is VALID [2022-04-28 03:51:33,820 INFO L290 TraceCheckUtils]: 24: Hoare triple {55388#(and (<= main_~z~0 0) (<= 49986 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {55392#(and (<= main_~z~0 0) (<= 49985 main_~y~0))} is VALID [2022-04-28 03:51:33,821 INFO L290 TraceCheckUtils]: 25: Hoare triple {55392#(and (<= main_~z~0 0) (<= 49985 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {55396#(and (<= main_~z~0 0) (<= 49984 main_~y~0))} is VALID [2022-04-28 03:51:33,821 INFO L290 TraceCheckUtils]: 26: Hoare triple {55396#(and (<= main_~z~0 0) (<= 49984 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {55400#(and (<= main_~z~0 0) (<= 49983 main_~y~0))} is VALID [2022-04-28 03:51:33,822 INFO L290 TraceCheckUtils]: 27: Hoare triple {55400#(and (<= main_~z~0 0) (<= 49983 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {55404#(and (<= main_~z~0 0) (<= 49982 main_~y~0))} is VALID [2022-04-28 03:51:33,822 INFO L290 TraceCheckUtils]: 28: Hoare triple {55404#(and (<= main_~z~0 0) (<= 49982 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {55408#(and (<= main_~z~0 0) (<= 49981 main_~y~0))} is VALID [2022-04-28 03:51:33,823 INFO L290 TraceCheckUtils]: 29: Hoare triple {55408#(and (<= main_~z~0 0) (<= 49981 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {55412#(and (<= main_~z~0 0) (<= 49980 main_~y~0))} is VALID [2022-04-28 03:51:33,823 INFO L290 TraceCheckUtils]: 30: Hoare triple {55412#(and (<= main_~z~0 0) (<= 49980 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {55416#(and (<= main_~z~0 0) (<= 49979 main_~y~0))} is VALID [2022-04-28 03:51:33,824 INFO L290 TraceCheckUtils]: 31: Hoare triple {55416#(and (<= main_~z~0 0) (<= 49979 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {55420#(and (<= main_~z~0 0) (<= 49978 main_~y~0))} is VALID [2022-04-28 03:51:33,824 INFO L290 TraceCheckUtils]: 32: Hoare triple {55420#(and (<= main_~z~0 0) (<= 49978 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {55424#(and (<= main_~z~0 0) (<= 49977 main_~y~0))} is VALID [2022-04-28 03:51:33,825 INFO L290 TraceCheckUtils]: 33: Hoare triple {55424#(and (<= main_~z~0 0) (<= 49977 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {55428#(and (<= main_~z~0 0) (<= 49976 main_~y~0))} is VALID [2022-04-28 03:51:33,825 INFO L290 TraceCheckUtils]: 34: Hoare triple {55428#(and (<= main_~z~0 0) (<= 49976 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {55432#(and (<= main_~z~0 0) (<= 49975 main_~y~0))} is VALID [2022-04-28 03:51:33,825 INFO L290 TraceCheckUtils]: 35: Hoare triple {55432#(and (<= main_~z~0 0) (<= 49975 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {55436#(and (<= main_~z~0 0) (<= 49974 main_~y~0))} is VALID [2022-04-28 03:51:33,826 INFO L290 TraceCheckUtils]: 36: Hoare triple {55436#(and (<= main_~z~0 0) (<= 49974 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {55440#(and (<= main_~z~0 0) (<= 49973 main_~y~0))} is VALID [2022-04-28 03:51:33,826 INFO L290 TraceCheckUtils]: 37: Hoare triple {55440#(and (<= main_~z~0 0) (<= 49973 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {55444#(and (<= main_~z~0 0) (<= 49972 main_~y~0))} is VALID [2022-04-28 03:51:33,827 INFO L290 TraceCheckUtils]: 38: Hoare triple {55444#(and (<= main_~z~0 0) (<= 49972 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {55448#(and (<= main_~z~0 0) (<= 49971 main_~y~0))} is VALID [2022-04-28 03:51:33,827 INFO L290 TraceCheckUtils]: 39: Hoare triple {55448#(and (<= main_~z~0 0) (<= 49971 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {55452#(and (<= main_~z~0 0) (<= 49970 main_~y~0))} is VALID [2022-04-28 03:51:33,828 INFO L290 TraceCheckUtils]: 40: Hoare triple {55452#(and (<= main_~z~0 0) (<= 49970 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {55456#(and (<= main_~z~0 0) (<= 49969 main_~y~0))} is VALID [2022-04-28 03:51:33,828 INFO L290 TraceCheckUtils]: 41: Hoare triple {55456#(and (<= main_~z~0 0) (<= 49969 main_~y~0))} assume !(~y~0 > ~z~0); {55262#false} is VALID [2022-04-28 03:51:33,828 INFO L272 TraceCheckUtils]: 42: Hoare triple {55262#false} call __VERIFIER_assert((if ~x~0 == ~z~0 then 1 else 0)); {55262#false} is VALID [2022-04-28 03:51:33,828 INFO L290 TraceCheckUtils]: 43: Hoare triple {55262#false} ~cond := #in~cond; {55262#false} is VALID [2022-04-28 03:51:33,828 INFO L290 TraceCheckUtils]: 44: Hoare triple {55262#false} assume 0 == ~cond; {55262#false} is VALID [2022-04-28 03:51:33,829 INFO L290 TraceCheckUtils]: 45: Hoare triple {55262#false} assume !false; {55262#false} is VALID [2022-04-28 03:51:33,829 INFO L134 CoverageAnalysis]: Checked inductivity of 498 backedges. 0 proven. 496 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-04-28 03:51:33,829 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 03:51:36,364 INFO L290 TraceCheckUtils]: 45: Hoare triple {55262#false} assume !false; {55262#false} is VALID [2022-04-28 03:51:36,364 INFO L290 TraceCheckUtils]: 44: Hoare triple {55262#false} assume 0 == ~cond; {55262#false} is VALID [2022-04-28 03:51:36,364 INFO L290 TraceCheckUtils]: 43: Hoare triple {55262#false} ~cond := #in~cond; {55262#false} is VALID [2022-04-28 03:51:36,364 INFO L272 TraceCheckUtils]: 42: Hoare triple {55262#false} call __VERIFIER_assert((if ~x~0 == ~z~0 then 1 else 0)); {55262#false} is VALID [2022-04-28 03:51:36,364 INFO L290 TraceCheckUtils]: 41: Hoare triple {55484#(< main_~z~0 main_~y~0)} assume !(~y~0 > ~z~0); {55262#false} is VALID [2022-04-28 03:51:36,365 INFO L290 TraceCheckUtils]: 40: Hoare triple {55488#(< (+ main_~z~0 1) main_~y~0)} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {55484#(< main_~z~0 main_~y~0)} is VALID [2022-04-28 03:51:36,365 INFO L290 TraceCheckUtils]: 39: Hoare triple {55492#(< (+ main_~z~0 2) main_~y~0)} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {55488#(< (+ main_~z~0 1) main_~y~0)} is VALID [2022-04-28 03:51:36,366 INFO L290 TraceCheckUtils]: 38: Hoare triple {55496#(< (+ main_~z~0 3) main_~y~0)} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {55492#(< (+ main_~z~0 2) main_~y~0)} is VALID [2022-04-28 03:51:36,366 INFO L290 TraceCheckUtils]: 37: Hoare triple {55500#(< (+ main_~z~0 4) main_~y~0)} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {55496#(< (+ main_~z~0 3) main_~y~0)} is VALID [2022-04-28 03:51:36,367 INFO L290 TraceCheckUtils]: 36: Hoare triple {55504#(< (+ 5 main_~z~0) main_~y~0)} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {55500#(< (+ main_~z~0 4) main_~y~0)} is VALID [2022-04-28 03:51:36,367 INFO L290 TraceCheckUtils]: 35: Hoare triple {55508#(< (+ main_~z~0 6) main_~y~0)} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {55504#(< (+ 5 main_~z~0) main_~y~0)} is VALID [2022-04-28 03:51:36,368 INFO L290 TraceCheckUtils]: 34: Hoare triple {55512#(< (+ 7 main_~z~0) main_~y~0)} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {55508#(< (+ main_~z~0 6) main_~y~0)} is VALID [2022-04-28 03:51:36,368 INFO L290 TraceCheckUtils]: 33: Hoare triple {55516#(< (+ main_~z~0 8) main_~y~0)} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {55512#(< (+ 7 main_~z~0) main_~y~0)} is VALID [2022-04-28 03:51:36,369 INFO L290 TraceCheckUtils]: 32: Hoare triple {55520#(< (+ main_~z~0 9) main_~y~0)} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {55516#(< (+ main_~z~0 8) main_~y~0)} is VALID [2022-04-28 03:51:36,369 INFO L290 TraceCheckUtils]: 31: Hoare triple {55524#(< (+ main_~z~0 10) main_~y~0)} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {55520#(< (+ main_~z~0 9) main_~y~0)} is VALID [2022-04-28 03:51:36,370 INFO L290 TraceCheckUtils]: 30: Hoare triple {55528#(< (+ main_~z~0 11) main_~y~0)} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {55524#(< (+ main_~z~0 10) main_~y~0)} is VALID [2022-04-28 03:51:36,370 INFO L290 TraceCheckUtils]: 29: Hoare triple {55532#(< (+ main_~z~0 12) main_~y~0)} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {55528#(< (+ main_~z~0 11) main_~y~0)} is VALID [2022-04-28 03:51:36,370 INFO L290 TraceCheckUtils]: 28: Hoare triple {55536#(< (+ main_~z~0 13) main_~y~0)} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {55532#(< (+ main_~z~0 12) main_~y~0)} is VALID [2022-04-28 03:51:36,371 INFO L290 TraceCheckUtils]: 27: Hoare triple {55540#(< (+ main_~z~0 14) main_~y~0)} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {55536#(< (+ main_~z~0 13) main_~y~0)} is VALID [2022-04-28 03:51:36,371 INFO L290 TraceCheckUtils]: 26: Hoare triple {55544#(< (+ main_~z~0 15) main_~y~0)} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {55540#(< (+ main_~z~0 14) main_~y~0)} is VALID [2022-04-28 03:51:36,372 INFO L290 TraceCheckUtils]: 25: Hoare triple {55548#(< (+ main_~z~0 16) main_~y~0)} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {55544#(< (+ main_~z~0 15) main_~y~0)} is VALID [2022-04-28 03:51:36,372 INFO L290 TraceCheckUtils]: 24: Hoare triple {55552#(< (+ main_~z~0 17) main_~y~0)} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {55548#(< (+ main_~z~0 16) main_~y~0)} is VALID [2022-04-28 03:51:36,373 INFO L290 TraceCheckUtils]: 23: Hoare triple {55556#(< (+ main_~z~0 18) main_~y~0)} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {55552#(< (+ main_~z~0 17) main_~y~0)} is VALID [2022-04-28 03:51:36,373 INFO L290 TraceCheckUtils]: 22: Hoare triple {55560#(< (+ 19 main_~z~0) main_~y~0)} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {55556#(< (+ main_~z~0 18) main_~y~0)} is VALID [2022-04-28 03:51:36,374 INFO L290 TraceCheckUtils]: 21: Hoare triple {55564#(< (+ main_~z~0 20) main_~y~0)} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {55560#(< (+ 19 main_~z~0) main_~y~0)} is VALID [2022-04-28 03:51:36,374 INFO L290 TraceCheckUtils]: 20: Hoare triple {55568#(< (+ main_~z~0 21) main_~y~0)} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {55564#(< (+ main_~z~0 20) main_~y~0)} is VALID [2022-04-28 03:51:36,375 INFO L290 TraceCheckUtils]: 19: Hoare triple {55572#(< (+ main_~z~0 22) main_~y~0)} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {55568#(< (+ main_~z~0 21) main_~y~0)} is VALID [2022-04-28 03:51:36,375 INFO L290 TraceCheckUtils]: 18: Hoare triple {55576#(< (+ 23 main_~z~0) main_~y~0)} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {55572#(< (+ main_~z~0 22) main_~y~0)} is VALID [2022-04-28 03:51:36,376 INFO L290 TraceCheckUtils]: 17: Hoare triple {55580#(< (+ main_~z~0 24) main_~y~0)} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {55576#(< (+ 23 main_~z~0) main_~y~0)} is VALID [2022-04-28 03:51:36,376 INFO L290 TraceCheckUtils]: 16: Hoare triple {55584#(< (+ main_~z~0 25) main_~y~0)} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {55580#(< (+ main_~z~0 24) main_~y~0)} is VALID [2022-04-28 03:51:36,376 INFO L290 TraceCheckUtils]: 15: Hoare triple {55588#(< (+ main_~z~0 26) main_~y~0)} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {55584#(< (+ main_~z~0 25) main_~y~0)} is VALID [2022-04-28 03:51:36,377 INFO L290 TraceCheckUtils]: 14: Hoare triple {55592#(< (+ main_~z~0 27) main_~y~0)} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {55588#(< (+ main_~z~0 26) main_~y~0)} is VALID [2022-04-28 03:51:36,377 INFO L290 TraceCheckUtils]: 13: Hoare triple {55596#(< (+ main_~z~0 28) main_~y~0)} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {55592#(< (+ main_~z~0 27) main_~y~0)} is VALID [2022-04-28 03:51:36,378 INFO L290 TraceCheckUtils]: 12: Hoare triple {55600#(< (+ 29 main_~z~0) main_~y~0)} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {55596#(< (+ main_~z~0 28) main_~y~0)} is VALID [2022-04-28 03:51:36,378 INFO L290 TraceCheckUtils]: 11: Hoare triple {55604#(< (+ 30 main_~z~0) main_~y~0)} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {55600#(< (+ 29 main_~z~0) main_~y~0)} is VALID [2022-04-28 03:51:36,379 INFO L290 TraceCheckUtils]: 10: Hoare triple {55608#(< (+ main_~z~0 31) main_~y~0)} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {55604#(< (+ 30 main_~z~0) main_~y~0)} is VALID [2022-04-28 03:51:36,379 INFO L290 TraceCheckUtils]: 9: Hoare triple {55608#(< (+ main_~z~0 31) main_~y~0)} [223] L18-1_primed-->L18-1: Formula: (not (< v_main_~x~0_11 1000000)) InVars {main_~x~0=v_main_~x~0_11} OutVars{main_~x~0=v_main_~x~0_11} AuxVars[] AssignedVars[] {55608#(< (+ main_~z~0 31) main_~y~0)} is VALID [2022-04-28 03:51:36,380 INFO L290 TraceCheckUtils]: 8: Hoare triple {55608#(< (+ main_~z~0 31) main_~y~0)} [226] L11-2-->L18-1_primed: Formula: (let ((.cse0 (<= 50000 v_main_~x~0_2536)) (.cse1 (= |v_main_#t~post6_291| |v_main_#t~post6_290|)) (.cse2 (= v_main_~x~0_2536 v_main_~x~0_2535)) (.cse3 (= v_main_~y~0_2831 v_main_~y~0_2830))) (or (and (< v_main_~x~0_2535 1000001) .cse0 (< v_main_~x~0_2536 v_main_~x~0_2535) (= (+ v_main_~x~0_2536 v_main_~y~0_2830) (+ v_main_~x~0_2535 v_main_~y~0_2831))) (and (= |v_main_#t~post5_290| |v_main_#t~post5_291|) .cse1 .cse2 (or (not .cse0) (not (< v_main_~x~0_2536 1000000))) .cse3) (and (= |v_main_#t~post5_291| |v_main_#t~post5_290|) .cse1 .cse2 .cse3))) InVars {main_~y~0=v_main_~y~0_2831, main_#t~post5=|v_main_#t~post5_291|, main_~x~0=v_main_~x~0_2536, main_#t~post6=|v_main_#t~post6_291|} OutVars{main_~y~0=v_main_~y~0_2830, main_#t~post5=|v_main_#t~post5_290|, main_~x~0=v_main_~x~0_2535, main_#t~post6=|v_main_#t~post6_290|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {55608#(< (+ main_~z~0 31) main_~y~0)} is VALID [2022-04-28 03:51:36,380 INFO L290 TraceCheckUtils]: 7: Hoare triple {55608#(< (+ main_~z~0 31) main_~y~0)} [225] L18-1_primed-->L11-2: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {55608#(< (+ main_~z~0 31) main_~y~0)} is VALID [2022-04-28 03:51:36,380 INFO L290 TraceCheckUtils]: 6: Hoare triple {55608#(< (+ main_~z~0 31) main_~y~0)} [224] L11-2-->L18-1_primed: Formula: (let ((.cse0 (= v_main_~x~0_2534 v_main_~x~0_2533)) (.cse1 (= |v_main_#t~post4_261| |v_main_#t~post4_260|))) (or (and .cse0 (<= 50000 v_main_~x~0_2534) .cse1) (and (< v_main_~x~0_2534 v_main_~x~0_2533) (< v_main_~x~0_2533 50001)) (and .cse0 .cse1))) InVars {main_~x~0=v_main_~x~0_2534, main_#t~post4=|v_main_#t~post4_261|} OutVars{main_~x~0=v_main_~x~0_2533, main_#t~post4=|v_main_#t~post4_260|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {55608#(< (+ main_~z~0 31) main_~y~0)} is VALID [2022-04-28 03:51:36,381 INFO L290 TraceCheckUtils]: 5: Hoare triple {55261#true} ~x~0 := 0;~y~0 := 50000;~z~0 := 0;~x~0 := 0; {55608#(< (+ main_~z~0 31) main_~y~0)} is VALID [2022-04-28 03:51:36,381 INFO L272 TraceCheckUtils]: 4: Hoare triple {55261#true} call #t~ret9 := main(); {55261#true} is VALID [2022-04-28 03:51:36,381 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {55261#true} {55261#true} #52#return; {55261#true} is VALID [2022-04-28 03:51:36,381 INFO L290 TraceCheckUtils]: 2: Hoare triple {55261#true} assume true; {55261#true} is VALID [2022-04-28 03:51:36,381 INFO L290 TraceCheckUtils]: 1: Hoare triple {55261#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(17, 2);call #Ultimate.allocInit(12, 3); {55261#true} is VALID [2022-04-28 03:51:36,381 INFO L272 TraceCheckUtils]: 0: Hoare triple {55261#true} call ULTIMATE.init(); {55261#true} is VALID [2022-04-28 03:51:36,381 INFO L134 CoverageAnalysis]: Checked inductivity of 498 backedges. 0 proven. 496 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-04-28 03:51:36,381 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [602306186] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 03:51:36,382 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 03:51:36,382 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [38, 34, 34] total 102 [2022-04-28 03:51:40,048 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 03:51:40,048 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1878167699] [2022-04-28 03:51:40,048 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1878167699] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 03:51:40,048 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 03:51:40,048 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [93] imperfect sequences [] total 93 [2022-04-28 03:51:40,048 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1414569678] [2022-04-28 03:51:40,048 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 03:51:40,049 INFO L78 Accepts]: Start accepts. Automaton has has 93 states, 93 states have (on average 1.6451612903225807) internal successors, (153), 92 states have internal predecessors, (153), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 157 [2022-04-28 03:51:40,049 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 03:51:40,049 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 93 states, 93 states have (on average 1.6451612903225807) internal successors, (153), 92 states have internal predecessors, (153), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:51:40,171 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 157 edges. 157 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 03:51:40,172 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 93 states [2022-04-28 03:51:40,172 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 03:51:40,172 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 93 interpolants. [2022-04-28 03:51:40,174 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8718, Invalid=16722, Unknown=0, NotChecked=0, Total=25440 [2022-04-28 03:51:40,174 INFO L87 Difference]: Start difference. First operand 268 states and 272 transitions. Second operand has 93 states, 93 states have (on average 1.6451612903225807) internal successors, (153), 92 states have internal predecessors, (153), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:51:55,345 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:51:55,345 INFO L93 Difference]: Finished difference Result 418 states and 427 transitions. [2022-04-28 03:51:55,345 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 61 states. [2022-04-28 03:51:55,345 INFO L78 Accepts]: Start accepts. Automaton has has 93 states, 93 states have (on average 1.6451612903225807) internal successors, (153), 92 states have internal predecessors, (153), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 157 [2022-04-28 03:51:55,346 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 03:51:55,346 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 93 states, 93 states have (on average 1.6451612903225807) internal successors, (153), 92 states have internal predecessors, (153), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:51:55,346 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 145 transitions. [2022-04-28 03:51:55,347 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 93 states, 93 states have (on average 1.6451612903225807) internal successors, (153), 92 states have internal predecessors, (153), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:51:55,347 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 145 transitions. [2022-04-28 03:51:55,347 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 61 states and 145 transitions. [2022-04-28 03:51:55,466 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 145 edges. 145 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 03:51:55,470 INFO L225 Difference]: With dead ends: 418 [2022-04-28 03:51:55,470 INFO L226 Difference]: Without dead ends: 270 [2022-04-28 03:51:55,472 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 308 GetRequests, 90 SyntacticMatches, 2 SemanticMatches, 216 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11535 ImplicationChecksByTransitivity, 9.7s TimeCoverageRelationStatistics Valid=12724, Invalid=34582, Unknown=0, NotChecked=0, Total=47306 [2022-04-28 03:51:55,472 INFO L413 NwaCegarLoop]: 13 mSDtfsCounter, 68 mSDsluCounter, 312 mSDsCounter, 0 mSdLazyCounter, 7754 mSolverCounterSat, 63 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 68 SdHoareTripleChecker+Valid, 325 SdHoareTripleChecker+Invalid, 7817 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 63 IncrementalHoareTripleChecker+Valid, 7754 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6.2s IncrementalHoareTripleChecker+Time [2022-04-28 03:51:55,473 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [68 Valid, 325 Invalid, 7817 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [63 Valid, 7754 Invalid, 0 Unknown, 0 Unchecked, 6.2s Time] [2022-04-28 03:51:55,473 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 270 states. [2022-04-28 03:51:56,225 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 270 to 270. [2022-04-28 03:51:56,226 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 03:51:56,226 INFO L82 GeneralOperation]: Start isEquivalent. First operand 270 states. Second operand has 270 states, 265 states have (on average 1.0188679245283019) internal successors, (270), 265 states have internal predecessors, (270), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:51:56,226 INFO L74 IsIncluded]: Start isIncluded. First operand 270 states. Second operand has 270 states, 265 states have (on average 1.0188679245283019) internal successors, (270), 265 states have internal predecessors, (270), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:51:56,226 INFO L87 Difference]: Start difference. First operand 270 states. Second operand has 270 states, 265 states have (on average 1.0188679245283019) internal successors, (270), 265 states have internal predecessors, (270), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:51:56,229 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:51:56,229 INFO L93 Difference]: Finished difference Result 270 states and 274 transitions. [2022-04-28 03:51:56,229 INFO L276 IsEmpty]: Start isEmpty. Operand 270 states and 274 transitions. [2022-04-28 03:51:56,230 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:51:56,230 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:51:56,230 INFO L74 IsIncluded]: Start isIncluded. First operand has 270 states, 265 states have (on average 1.0188679245283019) internal successors, (270), 265 states have internal predecessors, (270), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 270 states. [2022-04-28 03:51:56,230 INFO L87 Difference]: Start difference. First operand has 270 states, 265 states have (on average 1.0188679245283019) internal successors, (270), 265 states have internal predecessors, (270), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 270 states. [2022-04-28 03:51:56,233 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:51:56,233 INFO L93 Difference]: Finished difference Result 270 states and 274 transitions. [2022-04-28 03:51:56,233 INFO L276 IsEmpty]: Start isEmpty. Operand 270 states and 274 transitions. [2022-04-28 03:51:56,233 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:51:56,233 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:51:56,233 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 03:51:56,233 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 03:51:56,233 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 270 states, 265 states have (on average 1.0188679245283019) internal successors, (270), 265 states have internal predecessors, (270), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:51:56,236 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 270 states to 270 states and 274 transitions. [2022-04-28 03:51:56,237 INFO L78 Accepts]: Start accepts. Automaton has 270 states and 274 transitions. Word has length 157 [2022-04-28 03:51:56,237 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 03:51:56,237 INFO L495 AbstractCegarLoop]: Abstraction has 270 states and 274 transitions. [2022-04-28 03:51:56,237 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 93 states, 93 states have (on average 1.6451612903225807) internal successors, (153), 92 states have internal predecessors, (153), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:51:56,237 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 270 states and 274 transitions. [2022-04-28 03:51:56,518 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 274 edges. 274 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 03:51:56,519 INFO L276 IsEmpty]: Start isEmpty. Operand 270 states and 274 transitions. [2022-04-28 03:51:56,519 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 160 [2022-04-28 03:51:56,519 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 03:51:56,519 INFO L195 NwaCegarLoop]: trace histogram [58, 57, 31, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 03:51:56,535 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (43)] Forceful destruction successful, exit code 0 [2022-04-28 03:51:56,719 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable44,43 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 03:51:56,720 INFO L420 AbstractCegarLoop]: === Iteration 46 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 03:51:56,720 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 03:51:56,720 INFO L85 PathProgramCache]: Analyzing trace with hash 1944213324, now seen corresponding path program 43 times [2022-04-28 03:51:56,720 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 03:51:56,720 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1201649347] [2022-04-28 03:52:00,788 WARN L977 rdanLoopAcceleration]: Unable to prove correctness of quantifier elimination. [2022-04-28 03:52:00,836 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 1 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 03:52:01,042 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={1=1, 2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 03:52:01,044 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-28 03:52:01,046 INFO L85 PathProgramCache]: Analyzing trace with hash -1341149534, now seen corresponding path program 1 times [2022-04-28 03:52:01,046 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 03:52:01,046 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [520522174] [2022-04-28 03:52:01,046 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:52:01,046 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 03:52:01,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:52:01,872 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 03:52:01,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:52:01,876 INFO L290 TraceCheckUtils]: 0: Hoare triple {57771#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(17, 2);call #Ultimate.allocInit(12, 3); {57731#true} is VALID [2022-04-28 03:52:01,876 INFO L290 TraceCheckUtils]: 1: Hoare triple {57731#true} assume true; {57731#true} is VALID [2022-04-28 03:52:01,876 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {57731#true} {57731#true} #52#return; {57731#true} is VALID [2022-04-28 03:52:01,877 INFO L272 TraceCheckUtils]: 0: Hoare triple {57731#true} call ULTIMATE.init(); {57771#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 03:52:01,877 INFO L290 TraceCheckUtils]: 1: Hoare triple {57771#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(17, 2);call #Ultimate.allocInit(12, 3); {57731#true} is VALID [2022-04-28 03:52:01,877 INFO L290 TraceCheckUtils]: 2: Hoare triple {57731#true} assume true; {57731#true} is VALID [2022-04-28 03:52:01,877 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {57731#true} {57731#true} #52#return; {57731#true} is VALID [2022-04-28 03:52:01,877 INFO L272 TraceCheckUtils]: 4: Hoare triple {57731#true} call #t~ret9 := main(); {57731#true} is VALID [2022-04-28 03:52:01,878 INFO L290 TraceCheckUtils]: 5: Hoare triple {57731#true} ~x~0 := 0;~y~0 := 50000;~z~0 := 0;~x~0 := 0; {57736#(and (= main_~z~0 0) (= main_~x~0 0) (<= 50000 main_~y~0))} is VALID [2022-04-28 03:52:01,878 INFO L290 TraceCheckUtils]: 6: Hoare triple {57736#(and (= main_~z~0 0) (= main_~x~0 0) (<= 50000 main_~y~0))} [228] L11-2-->L18-1_primed: Formula: (let ((.cse0 (= v_main_~x~0_2638 v_main_~x~0_2637)) (.cse1 (= |v_main_#t~post4_267| |v_main_#t~post4_266|))) (or (and .cse0 .cse1) (and (< v_main_~x~0_2638 v_main_~x~0_2637) (< v_main_~x~0_2637 50001)) (and .cse0 (<= 50000 v_main_~x~0_2638) .cse1))) InVars {main_~x~0=v_main_~x~0_2638, main_#t~post4=|v_main_#t~post4_267|} OutVars{main_~x~0=v_main_~x~0_2637, main_#t~post4=|v_main_#t~post4_266|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {57737#(and (= main_~z~0 0) (<= main_~x~0 50000) (<= 50000 main_~y~0))} is VALID [2022-04-28 03:52:01,879 INFO L290 TraceCheckUtils]: 7: Hoare triple {57737#(and (= main_~z~0 0) (<= main_~x~0 50000) (<= 50000 main_~y~0))} [229] L18-1_primed-->L11-2: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {57737#(and (= main_~z~0 0) (<= main_~x~0 50000) (<= 50000 main_~y~0))} is VALID [2022-04-28 03:52:01,880 INFO L290 TraceCheckUtils]: 8: Hoare triple {57737#(and (= main_~z~0 0) (<= main_~x~0 50000) (<= 50000 main_~y~0))} [230] L11-2-->L18-1_primed: Formula: (let ((.cse0 (= |v_main_#t~post6_298| |v_main_#t~post6_297|)) (.cse1 (= |v_main_#t~post5_298| |v_main_#t~post5_297|)) (.cse2 (= v_main_~y~0_2958 v_main_~y~0_2957)) (.cse3 (<= 50000 v_main_~x~0_2640))) (or (and .cse0 .cse1 .cse2 (= v_main_~x~0_2640 v_main_~x~0_2639)) (and .cse0 .cse1 .cse2 (= v_main_~x~0_2639 v_main_~x~0_2640) (or (not .cse3) (not (< v_main_~x~0_2640 1000000)))) (let ((.cse4 (+ v_main_~x~0_2640 v_main_~y~0_2957))) (and (< .cse4 (+ 1000001 v_main_~y~0_2958)) (= (+ v_main_~x~0_2639 v_main_~y~0_2958) .cse4) (< v_main_~y~0_2958 v_main_~y~0_2957) .cse3)))) InVars {main_~y~0=v_main_~y~0_2958, main_#t~post5=|v_main_#t~post5_298|, main_~x~0=v_main_~x~0_2640, main_#t~post6=|v_main_#t~post6_298|} OutVars{main_~y~0=v_main_~y~0_2957, main_#t~post5=|v_main_#t~post5_297|, main_~x~0=v_main_~x~0_2639, main_#t~post6=|v_main_#t~post6_297|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {57738#(or (<= main_~x~0 999999) (and (= main_~z~0 0) (<= 50001 main_~y~0)))} is VALID [2022-04-28 03:52:01,880 INFO L290 TraceCheckUtils]: 9: Hoare triple {57738#(or (<= main_~x~0 999999) (and (= main_~z~0 0) (<= 50001 main_~y~0)))} [227] L18-1_primed-->L18-1: Formula: (not (< v_main_~x~0_11 1000000)) InVars {main_~x~0=v_main_~x~0_11} OutVars{main_~x~0=v_main_~x~0_11} AuxVars[] AssignedVars[] {57739#(and (= main_~z~0 0) (<= 50001 main_~y~0))} is VALID [2022-04-28 03:52:01,881 INFO L290 TraceCheckUtils]: 10: Hoare triple {57739#(and (= main_~z~0 0) (<= 50001 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {57740#(and (= main_~z~0 0) (<= 50000 main_~y~0))} is VALID [2022-04-28 03:52:01,882 INFO L290 TraceCheckUtils]: 11: Hoare triple {57740#(and (= main_~z~0 0) (<= 50000 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {57741#(and (= main_~z~0 0) (<= 49999 main_~y~0))} is VALID [2022-04-28 03:52:01,882 INFO L290 TraceCheckUtils]: 12: Hoare triple {57741#(and (= main_~z~0 0) (<= 49999 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {57742#(and (<= 49998 main_~y~0) (= main_~z~0 0))} is VALID [2022-04-28 03:52:01,883 INFO L290 TraceCheckUtils]: 13: Hoare triple {57742#(and (<= 49998 main_~y~0) (= main_~z~0 0))} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {57743#(and (= main_~z~0 0) (<= 49997 main_~y~0))} is VALID [2022-04-28 03:52:01,884 INFO L290 TraceCheckUtils]: 14: Hoare triple {57743#(and (= main_~z~0 0) (<= 49997 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {57744#(and (= main_~z~0 0) (<= 49996 main_~y~0))} is VALID [2022-04-28 03:52:01,884 INFO L290 TraceCheckUtils]: 15: Hoare triple {57744#(and (= main_~z~0 0) (<= 49996 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {57745#(and (= main_~z~0 0) (<= 49995 main_~y~0))} is VALID [2022-04-28 03:52:01,885 INFO L290 TraceCheckUtils]: 16: Hoare triple {57745#(and (= main_~z~0 0) (<= 49995 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {57746#(and (= main_~z~0 0) (<= 49994 main_~y~0))} is VALID [2022-04-28 03:52:01,885 INFO L290 TraceCheckUtils]: 17: Hoare triple {57746#(and (= main_~z~0 0) (<= 49994 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {57747#(and (= main_~z~0 0) (<= 49993 main_~y~0))} is VALID [2022-04-28 03:52:01,886 INFO L290 TraceCheckUtils]: 18: Hoare triple {57747#(and (= main_~z~0 0) (<= 49993 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {57748#(and (= main_~z~0 0) (<= 49992 main_~y~0))} is VALID [2022-04-28 03:52:01,889 INFO L290 TraceCheckUtils]: 19: Hoare triple {57748#(and (= main_~z~0 0) (<= 49992 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {57749#(and (= main_~z~0 0) (<= 49991 main_~y~0))} is VALID [2022-04-28 03:52:01,889 INFO L290 TraceCheckUtils]: 20: Hoare triple {57749#(and (= main_~z~0 0) (<= 49991 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {57750#(and (<= 49990 main_~y~0) (= main_~z~0 0))} is VALID [2022-04-28 03:52:01,891 INFO L290 TraceCheckUtils]: 21: Hoare triple {57750#(and (<= 49990 main_~y~0) (= main_~z~0 0))} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {57751#(and (= main_~z~0 0) (<= 49989 main_~y~0))} is VALID [2022-04-28 03:52:01,892 INFO L290 TraceCheckUtils]: 22: Hoare triple {57751#(and (= main_~z~0 0) (<= 49989 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {57752#(and (= main_~z~0 0) (<= 49988 main_~y~0))} is VALID [2022-04-28 03:52:01,892 INFO L290 TraceCheckUtils]: 23: Hoare triple {57752#(and (= main_~z~0 0) (<= 49988 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {57753#(and (= main_~z~0 0) (<= 49987 main_~y~0))} is VALID [2022-04-28 03:52:01,893 INFO L290 TraceCheckUtils]: 24: Hoare triple {57753#(and (= main_~z~0 0) (<= 49987 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {57754#(and (= main_~z~0 0) (<= 49986 main_~y~0))} is VALID [2022-04-28 03:52:01,893 INFO L290 TraceCheckUtils]: 25: Hoare triple {57754#(and (= main_~z~0 0) (<= 49986 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {57755#(and (= main_~z~0 0) (<= 49985 main_~y~0))} is VALID [2022-04-28 03:52:01,894 INFO L290 TraceCheckUtils]: 26: Hoare triple {57755#(and (= main_~z~0 0) (<= 49985 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {57756#(and (= main_~z~0 0) (<= 49984 main_~y~0))} is VALID [2022-04-28 03:52:01,894 INFO L290 TraceCheckUtils]: 27: Hoare triple {57756#(and (= main_~z~0 0) (<= 49984 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {57757#(and (= main_~z~0 0) (<= 49983 main_~y~0))} is VALID [2022-04-28 03:52:01,895 INFO L290 TraceCheckUtils]: 28: Hoare triple {57757#(and (= main_~z~0 0) (<= 49983 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {57758#(and (= main_~z~0 0) (<= 49982 main_~y~0))} is VALID [2022-04-28 03:52:01,895 INFO L290 TraceCheckUtils]: 29: Hoare triple {57758#(and (= main_~z~0 0) (<= 49982 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {57759#(and (<= 49981 main_~y~0) (= main_~z~0 0))} is VALID [2022-04-28 03:52:01,896 INFO L290 TraceCheckUtils]: 30: Hoare triple {57759#(and (<= 49981 main_~y~0) (= main_~z~0 0))} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {57760#(and (= main_~z~0 0) (<= 49980 main_~y~0))} is VALID [2022-04-28 03:52:01,896 INFO L290 TraceCheckUtils]: 31: Hoare triple {57760#(and (= main_~z~0 0) (<= 49980 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {57761#(and (= main_~z~0 0) (<= 49979 main_~y~0))} is VALID [2022-04-28 03:52:01,897 INFO L290 TraceCheckUtils]: 32: Hoare triple {57761#(and (= main_~z~0 0) (<= 49979 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {57762#(and (= main_~z~0 0) (<= 49978 main_~y~0))} is VALID [2022-04-28 03:52:01,897 INFO L290 TraceCheckUtils]: 33: Hoare triple {57762#(and (= main_~z~0 0) (<= 49978 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {57763#(and (= main_~z~0 0) (<= 49977 main_~y~0))} is VALID [2022-04-28 03:52:01,898 INFO L290 TraceCheckUtils]: 34: Hoare triple {57763#(and (= main_~z~0 0) (<= 49977 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {57764#(and (= main_~z~0 0) (<= 49976 main_~y~0))} is VALID [2022-04-28 03:52:01,898 INFO L290 TraceCheckUtils]: 35: Hoare triple {57764#(and (= main_~z~0 0) (<= 49976 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {57765#(and (= main_~z~0 0) (<= 49975 main_~y~0))} is VALID [2022-04-28 03:52:01,899 INFO L290 TraceCheckUtils]: 36: Hoare triple {57765#(and (= main_~z~0 0) (<= 49975 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {57766#(and (= main_~z~0 0) (<= 49974 main_~y~0))} is VALID [2022-04-28 03:52:01,899 INFO L290 TraceCheckUtils]: 37: Hoare triple {57766#(and (= main_~z~0 0) (<= 49974 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {57767#(and (= main_~z~0 0) (<= 49973 main_~y~0))} is VALID [2022-04-28 03:52:01,900 INFO L290 TraceCheckUtils]: 38: Hoare triple {57767#(and (= main_~z~0 0) (<= 49973 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {57768#(and (= main_~z~0 0) (<= 49972 main_~y~0))} is VALID [2022-04-28 03:52:01,900 INFO L290 TraceCheckUtils]: 39: Hoare triple {57768#(and (= main_~z~0 0) (<= 49972 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {57769#(and (= main_~z~0 0) (<= 49971 main_~y~0))} is VALID [2022-04-28 03:52:01,901 INFO L290 TraceCheckUtils]: 40: Hoare triple {57769#(and (= main_~z~0 0) (<= 49971 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {57770#(and (= main_~z~0 0) (<= 49970 main_~y~0))} is VALID [2022-04-28 03:52:01,901 INFO L290 TraceCheckUtils]: 41: Hoare triple {57770#(and (= main_~z~0 0) (<= 49970 main_~y~0))} assume !(~y~0 > ~z~0); {57732#false} is VALID [2022-04-28 03:52:01,901 INFO L272 TraceCheckUtils]: 42: Hoare triple {57732#false} call __VERIFIER_assert((if ~x~0 == ~z~0 then 1 else 0)); {57732#false} is VALID [2022-04-28 03:52:01,901 INFO L290 TraceCheckUtils]: 43: Hoare triple {57732#false} ~cond := #in~cond; {57732#false} is VALID [2022-04-28 03:52:01,901 INFO L290 TraceCheckUtils]: 44: Hoare triple {57732#false} assume 0 == ~cond; {57732#false} is VALID [2022-04-28 03:52:01,901 INFO L290 TraceCheckUtils]: 45: Hoare triple {57732#false} assume !false; {57732#false} is VALID [2022-04-28 03:52:01,902 INFO L134 CoverageAnalysis]: Checked inductivity of 498 backedges. 0 proven. 498 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 03:52:01,902 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 03:52:01,902 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [520522174] [2022-04-28 03:52:01,902 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [520522174] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 03:52:01,902 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1742988594] [2022-04-28 03:52:01,902 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:52:01,902 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 03:52:01,902 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 03:52:01,903 INFO L229 MonitoredProcess]: Starting monitored process 44 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 03:52:01,904 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (44)] Waiting until timeout for monitored process [2022-04-28 03:52:01,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:52:01,958 INFO L263 TraceCheckSpWp]: Trace formula consists of 214 conjuncts, 35 conjunts are in the unsatisfiable core [2022-04-28 03:52:01,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:52:01,985 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 03:52:03,805 INFO L272 TraceCheckUtils]: 0: Hoare triple {57731#true} call ULTIMATE.init(); {57731#true} is VALID [2022-04-28 03:52:03,805 INFO L290 TraceCheckUtils]: 1: Hoare triple {57731#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(17, 2);call #Ultimate.allocInit(12, 3); {57731#true} is VALID [2022-04-28 03:52:03,805 INFO L290 TraceCheckUtils]: 2: Hoare triple {57731#true} assume true; {57731#true} is VALID [2022-04-28 03:52:03,805 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {57731#true} {57731#true} #52#return; {57731#true} is VALID [2022-04-28 03:52:03,805 INFO L272 TraceCheckUtils]: 4: Hoare triple {57731#true} call #t~ret9 := main(); {57731#true} is VALID [2022-04-28 03:52:03,805 INFO L290 TraceCheckUtils]: 5: Hoare triple {57731#true} ~x~0 := 0;~y~0 := 50000;~z~0 := 0;~x~0 := 0; {57790#(and (<= main_~z~0 0) (<= 50000 main_~y~0))} is VALID [2022-04-28 03:52:03,806 INFO L290 TraceCheckUtils]: 6: Hoare triple {57790#(and (<= main_~z~0 0) (<= 50000 main_~y~0))} [228] L11-2-->L18-1_primed: Formula: (let ((.cse0 (= v_main_~x~0_2638 v_main_~x~0_2637)) (.cse1 (= |v_main_#t~post4_267| |v_main_#t~post4_266|))) (or (and .cse0 .cse1) (and (< v_main_~x~0_2638 v_main_~x~0_2637) (< v_main_~x~0_2637 50001)) (and .cse0 (<= 50000 v_main_~x~0_2638) .cse1))) InVars {main_~x~0=v_main_~x~0_2638, main_#t~post4=|v_main_#t~post4_267|} OutVars{main_~x~0=v_main_~x~0_2637, main_#t~post4=|v_main_#t~post4_266|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {57790#(and (<= main_~z~0 0) (<= 50000 main_~y~0))} is VALID [2022-04-28 03:52:03,806 INFO L290 TraceCheckUtils]: 7: Hoare triple {57790#(and (<= main_~z~0 0) (<= 50000 main_~y~0))} [229] L18-1_primed-->L11-2: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {57790#(and (<= main_~z~0 0) (<= 50000 main_~y~0))} is VALID [2022-04-28 03:52:03,807 INFO L290 TraceCheckUtils]: 8: Hoare triple {57790#(and (<= main_~z~0 0) (<= 50000 main_~y~0))} [230] L11-2-->L18-1_primed: Formula: (let ((.cse0 (= |v_main_#t~post6_298| |v_main_#t~post6_297|)) (.cse1 (= |v_main_#t~post5_298| |v_main_#t~post5_297|)) (.cse2 (= v_main_~y~0_2958 v_main_~y~0_2957)) (.cse3 (<= 50000 v_main_~x~0_2640))) (or (and .cse0 .cse1 .cse2 (= v_main_~x~0_2640 v_main_~x~0_2639)) (and .cse0 .cse1 .cse2 (= v_main_~x~0_2639 v_main_~x~0_2640) (or (not .cse3) (not (< v_main_~x~0_2640 1000000)))) (let ((.cse4 (+ v_main_~x~0_2640 v_main_~y~0_2957))) (and (< .cse4 (+ 1000001 v_main_~y~0_2958)) (= (+ v_main_~x~0_2639 v_main_~y~0_2958) .cse4) (< v_main_~y~0_2958 v_main_~y~0_2957) .cse3)))) InVars {main_~y~0=v_main_~y~0_2958, main_#t~post5=|v_main_#t~post5_298|, main_~x~0=v_main_~x~0_2640, main_#t~post6=|v_main_#t~post6_298|} OutVars{main_~y~0=v_main_~y~0_2957, main_#t~post5=|v_main_#t~post5_297|, main_~x~0=v_main_~x~0_2639, main_#t~post6=|v_main_#t~post6_297|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {57790#(and (<= main_~z~0 0) (<= 50000 main_~y~0))} is VALID [2022-04-28 03:52:03,807 INFO L290 TraceCheckUtils]: 9: Hoare triple {57790#(and (<= main_~z~0 0) (<= 50000 main_~y~0))} [227] L18-1_primed-->L18-1: Formula: (not (< v_main_~x~0_11 1000000)) InVars {main_~x~0=v_main_~x~0_11} OutVars{main_~x~0=v_main_~x~0_11} AuxVars[] AssignedVars[] {57790#(and (<= main_~z~0 0) (<= 50000 main_~y~0))} is VALID [2022-04-28 03:52:03,808 INFO L290 TraceCheckUtils]: 10: Hoare triple {57790#(and (<= main_~z~0 0) (<= 50000 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {57806#(and (<= main_~z~0 0) (<= 49999 main_~y~0))} is VALID [2022-04-28 03:52:03,808 INFO L290 TraceCheckUtils]: 11: Hoare triple {57806#(and (<= main_~z~0 0) (<= 49999 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {57810#(and (<= main_~z~0 0) (<= 49998 main_~y~0))} is VALID [2022-04-28 03:52:03,809 INFO L290 TraceCheckUtils]: 12: Hoare triple {57810#(and (<= main_~z~0 0) (<= 49998 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {57814#(and (<= main_~z~0 0) (<= 49997 main_~y~0))} is VALID [2022-04-28 03:52:03,809 INFO L290 TraceCheckUtils]: 13: Hoare triple {57814#(and (<= main_~z~0 0) (<= 49997 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {57818#(and (<= main_~z~0 0) (<= 49996 main_~y~0))} is VALID [2022-04-28 03:52:03,810 INFO L290 TraceCheckUtils]: 14: Hoare triple {57818#(and (<= main_~z~0 0) (<= 49996 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {57822#(and (<= main_~z~0 0) (<= 49995 main_~y~0))} is VALID [2022-04-28 03:52:03,810 INFO L290 TraceCheckUtils]: 15: Hoare triple {57822#(and (<= main_~z~0 0) (<= 49995 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {57826#(and (<= main_~z~0 0) (<= 49994 main_~y~0))} is VALID [2022-04-28 03:52:03,811 INFO L290 TraceCheckUtils]: 16: Hoare triple {57826#(and (<= main_~z~0 0) (<= 49994 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {57830#(and (<= main_~z~0 0) (<= 49993 main_~y~0))} is VALID [2022-04-28 03:52:03,811 INFO L290 TraceCheckUtils]: 17: Hoare triple {57830#(and (<= main_~z~0 0) (<= 49993 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {57834#(and (<= main_~z~0 0) (<= 49992 main_~y~0))} is VALID [2022-04-28 03:52:03,812 INFO L290 TraceCheckUtils]: 18: Hoare triple {57834#(and (<= main_~z~0 0) (<= 49992 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {57838#(and (<= main_~z~0 0) (<= 49991 main_~y~0))} is VALID [2022-04-28 03:52:03,812 INFO L290 TraceCheckUtils]: 19: Hoare triple {57838#(and (<= main_~z~0 0) (<= 49991 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {57842#(and (<= main_~z~0 0) (<= 49990 main_~y~0))} is VALID [2022-04-28 03:52:03,813 INFO L290 TraceCheckUtils]: 20: Hoare triple {57842#(and (<= main_~z~0 0) (<= 49990 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {57846#(and (<= main_~z~0 0) (<= 49989 main_~y~0))} is VALID [2022-04-28 03:52:03,813 INFO L290 TraceCheckUtils]: 21: Hoare triple {57846#(and (<= main_~z~0 0) (<= 49989 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {57850#(and (<= main_~z~0 0) (<= 49988 main_~y~0))} is VALID [2022-04-28 03:52:03,814 INFO L290 TraceCheckUtils]: 22: Hoare triple {57850#(and (<= main_~z~0 0) (<= 49988 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {57854#(and (<= main_~z~0 0) (<= 49987 main_~y~0))} is VALID [2022-04-28 03:52:03,814 INFO L290 TraceCheckUtils]: 23: Hoare triple {57854#(and (<= main_~z~0 0) (<= 49987 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {57858#(and (<= main_~z~0 0) (<= 49986 main_~y~0))} is VALID [2022-04-28 03:52:03,815 INFO L290 TraceCheckUtils]: 24: Hoare triple {57858#(and (<= main_~z~0 0) (<= 49986 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {57862#(and (<= main_~z~0 0) (<= 49985 main_~y~0))} is VALID [2022-04-28 03:52:03,815 INFO L290 TraceCheckUtils]: 25: Hoare triple {57862#(and (<= main_~z~0 0) (<= 49985 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {57866#(and (<= main_~z~0 0) (<= 49984 main_~y~0))} is VALID [2022-04-28 03:52:03,816 INFO L290 TraceCheckUtils]: 26: Hoare triple {57866#(and (<= main_~z~0 0) (<= 49984 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {57870#(and (<= main_~z~0 0) (<= 49983 main_~y~0))} is VALID [2022-04-28 03:52:03,816 INFO L290 TraceCheckUtils]: 27: Hoare triple {57870#(and (<= main_~z~0 0) (<= 49983 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {57874#(and (<= main_~z~0 0) (<= 49982 main_~y~0))} is VALID [2022-04-28 03:52:03,817 INFO L290 TraceCheckUtils]: 28: Hoare triple {57874#(and (<= main_~z~0 0) (<= 49982 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {57878#(and (<= main_~z~0 0) (<= 49981 main_~y~0))} is VALID [2022-04-28 03:52:03,817 INFO L290 TraceCheckUtils]: 29: Hoare triple {57878#(and (<= main_~z~0 0) (<= 49981 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {57882#(and (<= main_~z~0 0) (<= 49980 main_~y~0))} is VALID [2022-04-28 03:52:03,818 INFO L290 TraceCheckUtils]: 30: Hoare triple {57882#(and (<= main_~z~0 0) (<= 49980 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {57886#(and (<= main_~z~0 0) (<= 49979 main_~y~0))} is VALID [2022-04-28 03:52:03,818 INFO L290 TraceCheckUtils]: 31: Hoare triple {57886#(and (<= main_~z~0 0) (<= 49979 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {57890#(and (<= main_~z~0 0) (<= 49978 main_~y~0))} is VALID [2022-04-28 03:52:03,818 INFO L290 TraceCheckUtils]: 32: Hoare triple {57890#(and (<= main_~z~0 0) (<= 49978 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {57894#(and (<= main_~z~0 0) (<= 49977 main_~y~0))} is VALID [2022-04-28 03:52:03,819 INFO L290 TraceCheckUtils]: 33: Hoare triple {57894#(and (<= main_~z~0 0) (<= 49977 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {57898#(and (<= main_~z~0 0) (<= 49976 main_~y~0))} is VALID [2022-04-28 03:52:03,819 INFO L290 TraceCheckUtils]: 34: Hoare triple {57898#(and (<= main_~z~0 0) (<= 49976 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {57902#(and (<= main_~z~0 0) (<= 49975 main_~y~0))} is VALID [2022-04-28 03:52:03,820 INFO L290 TraceCheckUtils]: 35: Hoare triple {57902#(and (<= main_~z~0 0) (<= 49975 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {57906#(and (<= main_~z~0 0) (<= 49974 main_~y~0))} is VALID [2022-04-28 03:52:03,820 INFO L290 TraceCheckUtils]: 36: Hoare triple {57906#(and (<= main_~z~0 0) (<= 49974 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {57910#(and (<= main_~z~0 0) (<= 49973 main_~y~0))} is VALID [2022-04-28 03:52:03,821 INFO L290 TraceCheckUtils]: 37: Hoare triple {57910#(and (<= main_~z~0 0) (<= 49973 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {57914#(and (<= main_~z~0 0) (<= 49972 main_~y~0))} is VALID [2022-04-28 03:52:03,821 INFO L290 TraceCheckUtils]: 38: Hoare triple {57914#(and (<= main_~z~0 0) (<= 49972 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {57918#(and (<= main_~z~0 0) (<= 49971 main_~y~0))} is VALID [2022-04-28 03:52:03,822 INFO L290 TraceCheckUtils]: 39: Hoare triple {57918#(and (<= main_~z~0 0) (<= 49971 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {57922#(and (<= main_~z~0 0) (<= 49970 main_~y~0))} is VALID [2022-04-28 03:52:03,822 INFO L290 TraceCheckUtils]: 40: Hoare triple {57922#(and (<= main_~z~0 0) (<= 49970 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {57926#(and (<= main_~z~0 0) (<= 49969 main_~y~0))} is VALID [2022-04-28 03:52:03,823 INFO L290 TraceCheckUtils]: 41: Hoare triple {57926#(and (<= main_~z~0 0) (<= 49969 main_~y~0))} assume !(~y~0 > ~z~0); {57732#false} is VALID [2022-04-28 03:52:03,823 INFO L272 TraceCheckUtils]: 42: Hoare triple {57732#false} call __VERIFIER_assert((if ~x~0 == ~z~0 then 1 else 0)); {57732#false} is VALID [2022-04-28 03:52:03,823 INFO L290 TraceCheckUtils]: 43: Hoare triple {57732#false} ~cond := #in~cond; {57732#false} is VALID [2022-04-28 03:52:03,823 INFO L290 TraceCheckUtils]: 44: Hoare triple {57732#false} assume 0 == ~cond; {57732#false} is VALID [2022-04-28 03:52:03,823 INFO L290 TraceCheckUtils]: 45: Hoare triple {57732#false} assume !false; {57732#false} is VALID [2022-04-28 03:52:03,823 INFO L134 CoverageAnalysis]: Checked inductivity of 498 backedges. 0 proven. 496 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-04-28 03:52:03,823 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 03:52:06,388 INFO L290 TraceCheckUtils]: 45: Hoare triple {57732#false} assume !false; {57732#false} is VALID [2022-04-28 03:52:06,388 INFO L290 TraceCheckUtils]: 44: Hoare triple {57732#false} assume 0 == ~cond; {57732#false} is VALID [2022-04-28 03:52:06,388 INFO L290 TraceCheckUtils]: 43: Hoare triple {57732#false} ~cond := #in~cond; {57732#false} is VALID [2022-04-28 03:52:06,388 INFO L272 TraceCheckUtils]: 42: Hoare triple {57732#false} call __VERIFIER_assert((if ~x~0 == ~z~0 then 1 else 0)); {57732#false} is VALID [2022-04-28 03:52:06,389 INFO L290 TraceCheckUtils]: 41: Hoare triple {57954#(< main_~z~0 main_~y~0)} assume !(~y~0 > ~z~0); {57732#false} is VALID [2022-04-28 03:52:06,389 INFO L290 TraceCheckUtils]: 40: Hoare triple {57958#(< (+ main_~z~0 1) main_~y~0)} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {57954#(< main_~z~0 main_~y~0)} is VALID [2022-04-28 03:52:06,390 INFO L290 TraceCheckUtils]: 39: Hoare triple {57962#(< (+ main_~z~0 2) main_~y~0)} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {57958#(< (+ main_~z~0 1) main_~y~0)} is VALID [2022-04-28 03:52:06,390 INFO L290 TraceCheckUtils]: 38: Hoare triple {57966#(< (+ main_~z~0 3) main_~y~0)} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {57962#(< (+ main_~z~0 2) main_~y~0)} is VALID [2022-04-28 03:52:06,391 INFO L290 TraceCheckUtils]: 37: Hoare triple {57970#(< (+ main_~z~0 4) main_~y~0)} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {57966#(< (+ main_~z~0 3) main_~y~0)} is VALID [2022-04-28 03:52:06,391 INFO L290 TraceCheckUtils]: 36: Hoare triple {57974#(< (+ 5 main_~z~0) main_~y~0)} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {57970#(< (+ main_~z~0 4) main_~y~0)} is VALID [2022-04-28 03:52:06,392 INFO L290 TraceCheckUtils]: 35: Hoare triple {57978#(< (+ main_~z~0 6) main_~y~0)} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {57974#(< (+ 5 main_~z~0) main_~y~0)} is VALID [2022-04-28 03:52:06,392 INFO L290 TraceCheckUtils]: 34: Hoare triple {57982#(< (+ 7 main_~z~0) main_~y~0)} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {57978#(< (+ main_~z~0 6) main_~y~0)} is VALID [2022-04-28 03:52:06,392 INFO L290 TraceCheckUtils]: 33: Hoare triple {57986#(< (+ main_~z~0 8) main_~y~0)} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {57982#(< (+ 7 main_~z~0) main_~y~0)} is VALID [2022-04-28 03:52:06,393 INFO L290 TraceCheckUtils]: 32: Hoare triple {57990#(< (+ main_~z~0 9) main_~y~0)} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {57986#(< (+ main_~z~0 8) main_~y~0)} is VALID [2022-04-28 03:52:06,393 INFO L290 TraceCheckUtils]: 31: Hoare triple {57994#(< (+ main_~z~0 10) main_~y~0)} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {57990#(< (+ main_~z~0 9) main_~y~0)} is VALID [2022-04-28 03:52:06,394 INFO L290 TraceCheckUtils]: 30: Hoare triple {57998#(< (+ main_~z~0 11) main_~y~0)} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {57994#(< (+ main_~z~0 10) main_~y~0)} is VALID [2022-04-28 03:52:06,394 INFO L290 TraceCheckUtils]: 29: Hoare triple {58002#(< (+ main_~z~0 12) main_~y~0)} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {57998#(< (+ main_~z~0 11) main_~y~0)} is VALID [2022-04-28 03:52:06,395 INFO L290 TraceCheckUtils]: 28: Hoare triple {58006#(< (+ main_~z~0 13) main_~y~0)} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {58002#(< (+ main_~z~0 12) main_~y~0)} is VALID [2022-04-28 03:52:06,395 INFO L290 TraceCheckUtils]: 27: Hoare triple {58010#(< (+ main_~z~0 14) main_~y~0)} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {58006#(< (+ main_~z~0 13) main_~y~0)} is VALID [2022-04-28 03:52:06,396 INFO L290 TraceCheckUtils]: 26: Hoare triple {58014#(< (+ main_~z~0 15) main_~y~0)} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {58010#(< (+ main_~z~0 14) main_~y~0)} is VALID [2022-04-28 03:52:06,396 INFO L290 TraceCheckUtils]: 25: Hoare triple {58018#(< (+ main_~z~0 16) main_~y~0)} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {58014#(< (+ main_~z~0 15) main_~y~0)} is VALID [2022-04-28 03:52:06,397 INFO L290 TraceCheckUtils]: 24: Hoare triple {58022#(< (+ main_~z~0 17) main_~y~0)} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {58018#(< (+ main_~z~0 16) main_~y~0)} is VALID [2022-04-28 03:52:06,397 INFO L290 TraceCheckUtils]: 23: Hoare triple {58026#(< (+ main_~z~0 18) main_~y~0)} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {58022#(< (+ main_~z~0 17) main_~y~0)} is VALID [2022-04-28 03:52:06,397 INFO L290 TraceCheckUtils]: 22: Hoare triple {58030#(< (+ 19 main_~z~0) main_~y~0)} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {58026#(< (+ main_~z~0 18) main_~y~0)} is VALID [2022-04-28 03:52:06,398 INFO L290 TraceCheckUtils]: 21: Hoare triple {58034#(< (+ main_~z~0 20) main_~y~0)} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {58030#(< (+ 19 main_~z~0) main_~y~0)} is VALID [2022-04-28 03:52:06,398 INFO L290 TraceCheckUtils]: 20: Hoare triple {58038#(< (+ main_~z~0 21) main_~y~0)} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {58034#(< (+ main_~z~0 20) main_~y~0)} is VALID [2022-04-28 03:52:06,399 INFO L290 TraceCheckUtils]: 19: Hoare triple {58042#(< (+ main_~z~0 22) main_~y~0)} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {58038#(< (+ main_~z~0 21) main_~y~0)} is VALID [2022-04-28 03:52:06,399 INFO L290 TraceCheckUtils]: 18: Hoare triple {58046#(< (+ 23 main_~z~0) main_~y~0)} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {58042#(< (+ main_~z~0 22) main_~y~0)} is VALID [2022-04-28 03:52:06,400 INFO L290 TraceCheckUtils]: 17: Hoare triple {58050#(< (+ main_~z~0 24) main_~y~0)} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {58046#(< (+ 23 main_~z~0) main_~y~0)} is VALID [2022-04-28 03:52:06,400 INFO L290 TraceCheckUtils]: 16: Hoare triple {58054#(< (+ main_~z~0 25) main_~y~0)} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {58050#(< (+ main_~z~0 24) main_~y~0)} is VALID [2022-04-28 03:52:06,401 INFO L290 TraceCheckUtils]: 15: Hoare triple {58058#(< (+ main_~z~0 26) main_~y~0)} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {58054#(< (+ main_~z~0 25) main_~y~0)} is VALID [2022-04-28 03:52:06,401 INFO L290 TraceCheckUtils]: 14: Hoare triple {58062#(< (+ main_~z~0 27) main_~y~0)} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {58058#(< (+ main_~z~0 26) main_~y~0)} is VALID [2022-04-28 03:52:06,402 INFO L290 TraceCheckUtils]: 13: Hoare triple {58066#(< (+ main_~z~0 28) main_~y~0)} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {58062#(< (+ main_~z~0 27) main_~y~0)} is VALID [2022-04-28 03:52:06,402 INFO L290 TraceCheckUtils]: 12: Hoare triple {58070#(< (+ 29 main_~z~0) main_~y~0)} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {58066#(< (+ main_~z~0 28) main_~y~0)} is VALID [2022-04-28 03:52:06,403 INFO L290 TraceCheckUtils]: 11: Hoare triple {58074#(< (+ 30 main_~z~0) main_~y~0)} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {58070#(< (+ 29 main_~z~0) main_~y~0)} is VALID [2022-04-28 03:52:06,403 INFO L290 TraceCheckUtils]: 10: Hoare triple {58078#(< (+ main_~z~0 31) main_~y~0)} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {58074#(< (+ 30 main_~z~0) main_~y~0)} is VALID [2022-04-28 03:52:06,403 INFO L290 TraceCheckUtils]: 9: Hoare triple {58078#(< (+ main_~z~0 31) main_~y~0)} [227] L18-1_primed-->L18-1: Formula: (not (< v_main_~x~0_11 1000000)) InVars {main_~x~0=v_main_~x~0_11} OutVars{main_~x~0=v_main_~x~0_11} AuxVars[] AssignedVars[] {58078#(< (+ main_~z~0 31) main_~y~0)} is VALID [2022-04-28 03:52:06,404 INFO L290 TraceCheckUtils]: 8: Hoare triple {58078#(< (+ main_~z~0 31) main_~y~0)} [230] L11-2-->L18-1_primed: Formula: (let ((.cse0 (= |v_main_#t~post6_298| |v_main_#t~post6_297|)) (.cse1 (= |v_main_#t~post5_298| |v_main_#t~post5_297|)) (.cse2 (= v_main_~y~0_2958 v_main_~y~0_2957)) (.cse3 (<= 50000 v_main_~x~0_2640))) (or (and .cse0 .cse1 .cse2 (= v_main_~x~0_2640 v_main_~x~0_2639)) (and .cse0 .cse1 .cse2 (= v_main_~x~0_2639 v_main_~x~0_2640) (or (not .cse3) (not (< v_main_~x~0_2640 1000000)))) (let ((.cse4 (+ v_main_~x~0_2640 v_main_~y~0_2957))) (and (< .cse4 (+ 1000001 v_main_~y~0_2958)) (= (+ v_main_~x~0_2639 v_main_~y~0_2958) .cse4) (< v_main_~y~0_2958 v_main_~y~0_2957) .cse3)))) InVars {main_~y~0=v_main_~y~0_2958, main_#t~post5=|v_main_#t~post5_298|, main_~x~0=v_main_~x~0_2640, main_#t~post6=|v_main_#t~post6_298|} OutVars{main_~y~0=v_main_~y~0_2957, main_#t~post5=|v_main_#t~post5_297|, main_~x~0=v_main_~x~0_2639, main_#t~post6=|v_main_#t~post6_297|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {58078#(< (+ main_~z~0 31) main_~y~0)} is VALID [2022-04-28 03:52:06,404 INFO L290 TraceCheckUtils]: 7: Hoare triple {58078#(< (+ main_~z~0 31) main_~y~0)} [229] L18-1_primed-->L11-2: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {58078#(< (+ main_~z~0 31) main_~y~0)} is VALID [2022-04-28 03:52:06,405 INFO L290 TraceCheckUtils]: 6: Hoare triple {58078#(< (+ main_~z~0 31) main_~y~0)} [228] L11-2-->L18-1_primed: Formula: (let ((.cse0 (= v_main_~x~0_2638 v_main_~x~0_2637)) (.cse1 (= |v_main_#t~post4_267| |v_main_#t~post4_266|))) (or (and .cse0 .cse1) (and (< v_main_~x~0_2638 v_main_~x~0_2637) (< v_main_~x~0_2637 50001)) (and .cse0 (<= 50000 v_main_~x~0_2638) .cse1))) InVars {main_~x~0=v_main_~x~0_2638, main_#t~post4=|v_main_#t~post4_267|} OutVars{main_~x~0=v_main_~x~0_2637, main_#t~post4=|v_main_#t~post4_266|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {58078#(< (+ main_~z~0 31) main_~y~0)} is VALID [2022-04-28 03:52:06,405 INFO L290 TraceCheckUtils]: 5: Hoare triple {57731#true} ~x~0 := 0;~y~0 := 50000;~z~0 := 0;~x~0 := 0; {58078#(< (+ main_~z~0 31) main_~y~0)} is VALID [2022-04-28 03:52:06,405 INFO L272 TraceCheckUtils]: 4: Hoare triple {57731#true} call #t~ret9 := main(); {57731#true} is VALID [2022-04-28 03:52:06,405 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {57731#true} {57731#true} #52#return; {57731#true} is VALID [2022-04-28 03:52:06,405 INFO L290 TraceCheckUtils]: 2: Hoare triple {57731#true} assume true; {57731#true} is VALID [2022-04-28 03:52:06,405 INFO L290 TraceCheckUtils]: 1: Hoare triple {57731#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(17, 2);call #Ultimate.allocInit(12, 3); {57731#true} is VALID [2022-04-28 03:52:06,405 INFO L272 TraceCheckUtils]: 0: Hoare triple {57731#true} call ULTIMATE.init(); {57731#true} is VALID [2022-04-28 03:52:06,406 INFO L134 CoverageAnalysis]: Checked inductivity of 498 backedges. 0 proven. 496 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-04-28 03:52:06,406 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1742988594] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 03:52:06,406 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 03:52:06,406 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [38, 34, 34] total 102 [2022-04-28 03:52:09,350 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 03:52:09,351 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1201649347] [2022-04-28 03:52:09,351 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1201649347] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 03:52:09,351 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 03:52:09,351 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [94] imperfect sequences [] total 94 [2022-04-28 03:52:09,351 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [632266972] [2022-04-28 03:52:09,351 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 03:52:09,351 INFO L78 Accepts]: Start accepts. Automaton has has 94 states, 94 states have (on average 1.648936170212766) internal successors, (155), 93 states have internal predecessors, (155), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 159 [2022-04-28 03:52:09,351 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 03:52:09,352 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 94 states, 94 states have (on average 1.648936170212766) internal successors, (155), 93 states have internal predecessors, (155), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:52:09,469 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 159 edges. 159 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 03:52:09,469 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 94 states [2022-04-28 03:52:09,469 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 03:52:09,470 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 94 interpolants. [2022-04-28 03:52:09,471 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10333, Invalid=15427, Unknown=0, NotChecked=0, Total=25760 [2022-04-28 03:52:09,472 INFO L87 Difference]: Start difference. First operand 270 states and 274 transitions. Second operand has 94 states, 94 states have (on average 1.648936170212766) internal successors, (155), 93 states have internal predecessors, (155), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:52:25,674 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:52:25,675 INFO L93 Difference]: Finished difference Result 421 states and 431 transitions. [2022-04-28 03:52:25,675 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 94 states. [2022-04-28 03:52:25,675 INFO L78 Accepts]: Start accepts. Automaton has has 94 states, 94 states have (on average 1.648936170212766) internal successors, (155), 93 states have internal predecessors, (155), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 159 [2022-04-28 03:52:25,675 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 03:52:25,675 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 94 states, 94 states have (on average 1.648936170212766) internal successors, (155), 93 states have internal predecessors, (155), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:52:25,677 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 180 transitions. [2022-04-28 03:52:25,677 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 94 states, 94 states have (on average 1.648936170212766) internal successors, (155), 93 states have internal predecessors, (155), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:52:25,678 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 180 transitions. [2022-04-28 03:52:25,678 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 94 states and 180 transitions. [2022-04-28 03:52:25,870 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 180 edges. 180 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 03:52:25,873 INFO L225 Difference]: With dead ends: 421 [2022-04-28 03:52:25,873 INFO L226 Difference]: Without dead ends: 273 [2022-04-28 03:52:25,876 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 343 GetRequests, 91 SyntacticMatches, 2 SemanticMatches, 250 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18474 ImplicationChecksByTransitivity, 9.8s TimeCoverageRelationStatistics Valid=20884, Invalid=42368, Unknown=0, NotChecked=0, Total=63252 [2022-04-28 03:52:25,877 INFO L413 NwaCegarLoop]: 13 mSDtfsCounter, 549 mSDsluCounter, 27 mSDsCounter, 0 mSdLazyCounter, 7200 mSolverCounterSat, 577 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 549 SdHoareTripleChecker+Valid, 40 SdHoareTripleChecker+Invalid, 7777 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 577 IncrementalHoareTripleChecker+Valid, 7200 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6.2s IncrementalHoareTripleChecker+Time [2022-04-28 03:52:25,877 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [549 Valid, 40 Invalid, 7777 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [577 Valid, 7200 Invalid, 0 Unknown, 0 Unchecked, 6.2s Time] [2022-04-28 03:52:25,877 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 273 states. [2022-04-28 03:52:26,687 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 273 to 273. [2022-04-28 03:52:26,687 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 03:52:26,687 INFO L82 GeneralOperation]: Start isEquivalent. First operand 273 states. Second operand has 273 states, 268 states have (on average 1.0186567164179106) internal successors, (273), 268 states have internal predecessors, (273), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:52:26,687 INFO L74 IsIncluded]: Start isIncluded. First operand 273 states. Second operand has 273 states, 268 states have (on average 1.0186567164179106) internal successors, (273), 268 states have internal predecessors, (273), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:52:26,687 INFO L87 Difference]: Start difference. First operand 273 states. Second operand has 273 states, 268 states have (on average 1.0186567164179106) internal successors, (273), 268 states have internal predecessors, (273), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:52:26,690 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:52:26,690 INFO L93 Difference]: Finished difference Result 273 states and 277 transitions. [2022-04-28 03:52:26,691 INFO L276 IsEmpty]: Start isEmpty. Operand 273 states and 277 transitions. [2022-04-28 03:52:26,691 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:52:26,691 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:52:26,691 INFO L74 IsIncluded]: Start isIncluded. First operand has 273 states, 268 states have (on average 1.0186567164179106) internal successors, (273), 268 states have internal predecessors, (273), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 273 states. [2022-04-28 03:52:26,691 INFO L87 Difference]: Start difference. First operand has 273 states, 268 states have (on average 1.0186567164179106) internal successors, (273), 268 states have internal predecessors, (273), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 273 states. [2022-04-28 03:52:26,694 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:52:26,694 INFO L93 Difference]: Finished difference Result 273 states and 277 transitions. [2022-04-28 03:52:26,694 INFO L276 IsEmpty]: Start isEmpty. Operand 273 states and 277 transitions. [2022-04-28 03:52:26,694 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:52:26,694 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:52:26,694 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 03:52:26,694 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 03:52:26,694 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 273 states, 268 states have (on average 1.0186567164179106) internal successors, (273), 268 states have internal predecessors, (273), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:52:26,698 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 273 states to 273 states and 277 transitions. [2022-04-28 03:52:26,698 INFO L78 Accepts]: Start accepts. Automaton has 273 states and 277 transitions. Word has length 159 [2022-04-28 03:52:26,698 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 03:52:26,698 INFO L495 AbstractCegarLoop]: Abstraction has 273 states and 277 transitions. [2022-04-28 03:52:26,698 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 94 states, 94 states have (on average 1.648936170212766) internal successors, (155), 93 states have internal predecessors, (155), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:52:26,698 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 273 states and 277 transitions. [2022-04-28 03:52:26,985 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 277 edges. 277 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 03:52:26,985 INFO L276 IsEmpty]: Start isEmpty. Operand 273 states and 277 transitions. [2022-04-28 03:52:26,986 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 163 [2022-04-28 03:52:26,986 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 03:52:26,986 INFO L195 NwaCegarLoop]: trace histogram [59, 58, 32, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 03:52:27,001 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (44)] Forceful destruction successful, exit code 0 [2022-04-28 03:52:27,186 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 44 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable45 [2022-04-28 03:52:27,186 INFO L420 AbstractCegarLoop]: === Iteration 47 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 03:52:27,187 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 03:52:27,187 INFO L85 PathProgramCache]: Analyzing trace with hash -788602084, now seen corresponding path program 44 times [2022-04-28 03:52:27,187 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 03:52:27,187 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [277641179] [2022-04-28 03:52:27,300 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 1 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 03:52:27,533 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={1=1, 2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 03:52:27,534 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-28 03:52:27,536 INFO L85 PathProgramCache]: Analyzing trace with hash -1941231615, now seen corresponding path program 1 times [2022-04-28 03:52:27,536 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 03:52:27,536 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [798061723] [2022-04-28 03:52:27,536 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:52:27,536 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 03:52:27,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:52:28,353 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 03:52:28,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:52:28,364 INFO L290 TraceCheckUtils]: 0: Hoare triple {60327#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(17, 2);call #Ultimate.allocInit(12, 3); {60286#true} is VALID [2022-04-28 03:52:28,364 INFO L290 TraceCheckUtils]: 1: Hoare triple {60286#true} assume true; {60286#true} is VALID [2022-04-28 03:52:28,364 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {60286#true} {60286#true} #52#return; {60286#true} is VALID [2022-04-28 03:52:28,365 INFO L272 TraceCheckUtils]: 0: Hoare triple {60286#true} call ULTIMATE.init(); {60327#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 03:52:28,365 INFO L290 TraceCheckUtils]: 1: Hoare triple {60327#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(17, 2);call #Ultimate.allocInit(12, 3); {60286#true} is VALID [2022-04-28 03:52:28,365 INFO L290 TraceCheckUtils]: 2: Hoare triple {60286#true} assume true; {60286#true} is VALID [2022-04-28 03:52:28,365 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {60286#true} {60286#true} #52#return; {60286#true} is VALID [2022-04-28 03:52:28,365 INFO L272 TraceCheckUtils]: 4: Hoare triple {60286#true} call #t~ret9 := main(); {60286#true} is VALID [2022-04-28 03:52:28,366 INFO L290 TraceCheckUtils]: 5: Hoare triple {60286#true} ~x~0 := 0;~y~0 := 50000;~z~0 := 0;~x~0 := 0; {60291#(and (= main_~z~0 0) (= main_~x~0 0) (<= 50000 main_~y~0))} is VALID [2022-04-28 03:52:28,367 INFO L290 TraceCheckUtils]: 6: Hoare triple {60291#(and (= main_~z~0 0) (= main_~x~0 0) (<= 50000 main_~y~0))} [232] L11-2-->L18-1_primed: Formula: (let ((.cse0 (= v_main_~x~0_2743 v_main_~x~0_2742)) (.cse1 (= |v_main_#t~post4_273| |v_main_#t~post4_272|))) (or (and (< v_main_~x~0_2742 50001) (< v_main_~x~0_2743 v_main_~x~0_2742)) (and .cse0 (<= 50000 v_main_~x~0_2743) .cse1) (and .cse0 .cse1))) InVars {main_~x~0=v_main_~x~0_2743, main_#t~post4=|v_main_#t~post4_273|} OutVars{main_~x~0=v_main_~x~0_2742, main_#t~post4=|v_main_#t~post4_272|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {60292#(or (<= main_~x~0 0) (and (= main_~z~0 0) (<= main_~x~0 main_~y~0) (<= main_~x~0 50000)))} is VALID [2022-04-28 03:52:28,367 INFO L290 TraceCheckUtils]: 7: Hoare triple {60292#(or (<= main_~x~0 0) (and (= main_~z~0 0) (<= main_~x~0 main_~y~0) (<= main_~x~0 50000)))} [233] L18-1_primed-->L11-2: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {60292#(or (<= main_~x~0 0) (and (= main_~z~0 0) (<= main_~x~0 main_~y~0) (<= main_~x~0 50000)))} is VALID [2022-04-28 03:52:28,368 INFO L290 TraceCheckUtils]: 8: Hoare triple {60292#(or (<= main_~x~0 0) (and (= main_~z~0 0) (<= main_~x~0 main_~y~0) (<= main_~x~0 50000)))} [234] L11-2-->L18-1_primed: Formula: (let ((.cse0 (= v_main_~x~0_2745 v_main_~x~0_2744)) (.cse1 (= |v_main_#t~post5_305| |v_main_#t~post5_304|)) (.cse2 (= |v_main_#t~post6_305| |v_main_#t~post6_304|)) (.cse3 (<= 50000 v_main_~x~0_2745))) (or (and .cse0 .cse1 (= v_main_~y~0_3086 v_main_~y~0_3085) .cse2) (and (= v_main_~y~0_3085 v_main_~y~0_3086) .cse0 .cse1 .cse2 (or (not .cse3) (not (< v_main_~x~0_2745 1000000)))) (and .cse3 (< v_main_~x~0_2745 v_main_~x~0_2744) (< v_main_~x~0_2744 1000001) (= (+ v_main_~x~0_2744 v_main_~y~0_3086) (+ v_main_~x~0_2745 v_main_~y~0_3085))))) InVars {main_~y~0=v_main_~y~0_3086, main_#t~post5=|v_main_#t~post5_305|, main_~x~0=v_main_~x~0_2745, main_#t~post6=|v_main_#t~post6_305|} OutVars{main_~y~0=v_main_~y~0_3085, main_#t~post5=|v_main_#t~post5_304|, main_~x~0=v_main_~x~0_2744, main_#t~post6=|v_main_#t~post6_304|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {60293#(or (and (= main_~z~0 0) (<= main_~x~0 main_~y~0)) (<= main_~x~0 50000))} is VALID [2022-04-28 03:52:28,369 INFO L290 TraceCheckUtils]: 9: Hoare triple {60293#(or (and (= main_~z~0 0) (<= main_~x~0 main_~y~0)) (<= main_~x~0 50000))} [231] L18-1_primed-->L18-1: Formula: (not (< v_main_~x~0_11 1000000)) InVars {main_~x~0=v_main_~x~0_11} OutVars{main_~x~0=v_main_~x~0_11} AuxVars[] AssignedVars[] {60294#(and (= main_~z~0 0) (<= 1000000 main_~y~0))} is VALID [2022-04-28 03:52:28,370 INFO L290 TraceCheckUtils]: 10: Hoare triple {60294#(and (= main_~z~0 0) (<= 1000000 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {60295#(and (= main_~z~0 0) (<= 999999 main_~y~0))} is VALID [2022-04-28 03:52:28,370 INFO L290 TraceCheckUtils]: 11: Hoare triple {60295#(and (= main_~z~0 0) (<= 999999 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {60296#(and (= main_~z~0 0) (<= 999998 main_~y~0))} is VALID [2022-04-28 03:52:28,371 INFO L290 TraceCheckUtils]: 12: Hoare triple {60296#(and (= main_~z~0 0) (<= 999998 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {60297#(and (= main_~z~0 0) (<= 999997 main_~y~0))} is VALID [2022-04-28 03:52:28,372 INFO L290 TraceCheckUtils]: 13: Hoare triple {60297#(and (= main_~z~0 0) (<= 999997 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {60298#(and (<= 999996 main_~y~0) (= main_~z~0 0))} is VALID [2022-04-28 03:52:28,372 INFO L290 TraceCheckUtils]: 14: Hoare triple {60298#(and (<= 999996 main_~y~0) (= main_~z~0 0))} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {60299#(and (= main_~z~0 0) (<= 999995 main_~y~0))} is VALID [2022-04-28 03:52:28,373 INFO L290 TraceCheckUtils]: 15: Hoare triple {60299#(and (= main_~z~0 0) (<= 999995 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {60300#(and (= main_~z~0 0) (<= 999994 main_~y~0))} is VALID [2022-04-28 03:52:28,374 INFO L290 TraceCheckUtils]: 16: Hoare triple {60300#(and (= main_~z~0 0) (<= 999994 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {60301#(and (= main_~z~0 0) (<= 999993 main_~y~0))} is VALID [2022-04-28 03:52:28,374 INFO L290 TraceCheckUtils]: 17: Hoare triple {60301#(and (= main_~z~0 0) (<= 999993 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {60302#(and (= main_~z~0 0) (<= 999992 main_~y~0))} is VALID [2022-04-28 03:52:28,375 INFO L290 TraceCheckUtils]: 18: Hoare triple {60302#(and (= main_~z~0 0) (<= 999992 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {60303#(and (= main_~z~0 0) (<= 999991 main_~y~0))} is VALID [2022-04-28 03:52:28,376 INFO L290 TraceCheckUtils]: 19: Hoare triple {60303#(and (= main_~z~0 0) (<= 999991 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {60304#(and (= main_~z~0 0) (<= 999990 main_~y~0))} is VALID [2022-04-28 03:52:28,376 INFO L290 TraceCheckUtils]: 20: Hoare triple {60304#(and (= main_~z~0 0) (<= 999990 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {60305#(and (= main_~z~0 0) (<= 999989 main_~y~0))} is VALID [2022-04-28 03:52:28,377 INFO L290 TraceCheckUtils]: 21: Hoare triple {60305#(and (= main_~z~0 0) (<= 999989 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {60306#(and (= main_~z~0 0) (<= 999988 main_~y~0))} is VALID [2022-04-28 03:52:28,378 INFO L290 TraceCheckUtils]: 22: Hoare triple {60306#(and (= main_~z~0 0) (<= 999988 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {60307#(and (= main_~z~0 0) (<= 999987 main_~y~0))} is VALID [2022-04-28 03:52:28,378 INFO L290 TraceCheckUtils]: 23: Hoare triple {60307#(and (= main_~z~0 0) (<= 999987 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {60308#(and (= main_~z~0 0) (<= 999986 main_~y~0))} is VALID [2022-04-28 03:52:28,379 INFO L290 TraceCheckUtils]: 24: Hoare triple {60308#(and (= main_~z~0 0) (<= 999986 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {60309#(and (= main_~z~0 0) (<= 999985 main_~y~0))} is VALID [2022-04-28 03:52:28,380 INFO L290 TraceCheckUtils]: 25: Hoare triple {60309#(and (= main_~z~0 0) (<= 999985 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {60310#(and (= main_~z~0 0) (<= 999984 main_~y~0))} is VALID [2022-04-28 03:52:28,380 INFO L290 TraceCheckUtils]: 26: Hoare triple {60310#(and (= main_~z~0 0) (<= 999984 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {60311#(and (<= 999983 main_~y~0) (= main_~z~0 0))} is VALID [2022-04-28 03:52:28,381 INFO L290 TraceCheckUtils]: 27: Hoare triple {60311#(and (<= 999983 main_~y~0) (= main_~z~0 0))} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {60312#(and (= main_~z~0 0) (<= 999982 main_~y~0))} is VALID [2022-04-28 03:52:28,382 INFO L290 TraceCheckUtils]: 28: Hoare triple {60312#(and (= main_~z~0 0) (<= 999982 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {60313#(and (= main_~z~0 0) (<= 999981 main_~y~0))} is VALID [2022-04-28 03:52:28,382 INFO L290 TraceCheckUtils]: 29: Hoare triple {60313#(and (= main_~z~0 0) (<= 999981 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {60314#(and (= main_~z~0 0) (<= 999980 main_~y~0))} is VALID [2022-04-28 03:52:28,383 INFO L290 TraceCheckUtils]: 30: Hoare triple {60314#(and (= main_~z~0 0) (<= 999980 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {60315#(and (= main_~z~0 0) (<= 999979 main_~y~0))} is VALID [2022-04-28 03:52:28,384 INFO L290 TraceCheckUtils]: 31: Hoare triple {60315#(and (= main_~z~0 0) (<= 999979 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {60316#(and (= main_~z~0 0) (<= 999978 main_~y~0))} is VALID [2022-04-28 03:52:28,384 INFO L290 TraceCheckUtils]: 32: Hoare triple {60316#(and (= main_~z~0 0) (<= 999978 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {60317#(and (= main_~z~0 0) (<= 999977 main_~y~0))} is VALID [2022-04-28 03:52:28,385 INFO L290 TraceCheckUtils]: 33: Hoare triple {60317#(and (= main_~z~0 0) (<= 999977 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {60318#(and (<= 999976 main_~y~0) (= main_~z~0 0))} is VALID [2022-04-28 03:52:28,385 INFO L290 TraceCheckUtils]: 34: Hoare triple {60318#(and (<= 999976 main_~y~0) (= main_~z~0 0))} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {60319#(and (= main_~z~0 0) (<= 999975 main_~y~0))} is VALID [2022-04-28 03:52:28,386 INFO L290 TraceCheckUtils]: 35: Hoare triple {60319#(and (= main_~z~0 0) (<= 999975 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {60320#(and (= main_~z~0 0) (<= 999974 main_~y~0))} is VALID [2022-04-28 03:52:28,387 INFO L290 TraceCheckUtils]: 36: Hoare triple {60320#(and (= main_~z~0 0) (<= 999974 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {60321#(and (= main_~z~0 0) (<= 999973 main_~y~0))} is VALID [2022-04-28 03:52:28,387 INFO L290 TraceCheckUtils]: 37: Hoare triple {60321#(and (= main_~z~0 0) (<= 999973 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {60322#(and (= main_~z~0 0) (<= 999972 main_~y~0))} is VALID [2022-04-28 03:52:28,388 INFO L290 TraceCheckUtils]: 38: Hoare triple {60322#(and (= main_~z~0 0) (<= 999972 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {60323#(and (= main_~z~0 0) (<= 999971 main_~y~0))} is VALID [2022-04-28 03:52:28,389 INFO L290 TraceCheckUtils]: 39: Hoare triple {60323#(and (= main_~z~0 0) (<= 999971 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {60324#(and (= main_~z~0 0) (<= 999970 main_~y~0))} is VALID [2022-04-28 03:52:28,389 INFO L290 TraceCheckUtils]: 40: Hoare triple {60324#(and (= main_~z~0 0) (<= 999970 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {60325#(and (= main_~z~0 0) (<= 999969 main_~y~0))} is VALID [2022-04-28 03:52:28,390 INFO L290 TraceCheckUtils]: 41: Hoare triple {60325#(and (= main_~z~0 0) (<= 999969 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {60326#(and (<= 999968 main_~y~0) (= main_~z~0 0))} is VALID [2022-04-28 03:52:28,390 INFO L290 TraceCheckUtils]: 42: Hoare triple {60326#(and (<= 999968 main_~y~0) (= main_~z~0 0))} assume !(~y~0 > ~z~0); {60287#false} is VALID [2022-04-28 03:52:28,390 INFO L272 TraceCheckUtils]: 43: Hoare triple {60287#false} call __VERIFIER_assert((if ~x~0 == ~z~0 then 1 else 0)); {60287#false} is VALID [2022-04-28 03:52:28,390 INFO L290 TraceCheckUtils]: 44: Hoare triple {60287#false} ~cond := #in~cond; {60287#false} is VALID [2022-04-28 03:52:28,390 INFO L290 TraceCheckUtils]: 45: Hoare triple {60287#false} assume 0 == ~cond; {60287#false} is VALID [2022-04-28 03:52:28,391 INFO L290 TraceCheckUtils]: 46: Hoare triple {60287#false} assume !false; {60287#false} is VALID [2022-04-28 03:52:28,391 INFO L134 CoverageAnalysis]: Checked inductivity of 530 backedges. 0 proven. 530 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 03:52:28,391 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 03:52:28,391 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [798061723] [2022-04-28 03:52:28,391 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [798061723] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 03:52:28,391 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [740050236] [2022-04-28 03:52:28,391 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:52:28,391 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 03:52:28,392 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 03:52:28,393 INFO L229 MonitoredProcess]: Starting monitored process 45 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 03:52:28,394 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (45)] Waiting until timeout for monitored process [2022-04-28 03:52:28,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:52:28,451 INFO L263 TraceCheckSpWp]: Trace formula consists of 219 conjuncts, 36 conjunts are in the unsatisfiable core [2022-04-28 03:52:28,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:52:28,489 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 03:52:30,586 INFO L272 TraceCheckUtils]: 0: Hoare triple {60286#true} call ULTIMATE.init(); {60286#true} is VALID [2022-04-28 03:52:30,586 INFO L290 TraceCheckUtils]: 1: Hoare triple {60286#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(17, 2);call #Ultimate.allocInit(12, 3); {60286#true} is VALID [2022-04-28 03:52:30,586 INFO L290 TraceCheckUtils]: 2: Hoare triple {60286#true} assume true; {60286#true} is VALID [2022-04-28 03:52:30,586 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {60286#true} {60286#true} #52#return; {60286#true} is VALID [2022-04-28 03:52:30,586 INFO L272 TraceCheckUtils]: 4: Hoare triple {60286#true} call #t~ret9 := main(); {60286#true} is VALID [2022-04-28 03:52:30,586 INFO L290 TraceCheckUtils]: 5: Hoare triple {60286#true} ~x~0 := 0;~y~0 := 50000;~z~0 := 0;~x~0 := 0; {60346#(and (<= main_~z~0 0) (<= 50000 main_~y~0))} is VALID [2022-04-28 03:52:30,587 INFO L290 TraceCheckUtils]: 6: Hoare triple {60346#(and (<= main_~z~0 0) (<= 50000 main_~y~0))} [232] L11-2-->L18-1_primed: Formula: (let ((.cse0 (= v_main_~x~0_2743 v_main_~x~0_2742)) (.cse1 (= |v_main_#t~post4_273| |v_main_#t~post4_272|))) (or (and (< v_main_~x~0_2742 50001) (< v_main_~x~0_2743 v_main_~x~0_2742)) (and .cse0 (<= 50000 v_main_~x~0_2743) .cse1) (and .cse0 .cse1))) InVars {main_~x~0=v_main_~x~0_2743, main_#t~post4=|v_main_#t~post4_273|} OutVars{main_~x~0=v_main_~x~0_2742, main_#t~post4=|v_main_#t~post4_272|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {60346#(and (<= main_~z~0 0) (<= 50000 main_~y~0))} is VALID [2022-04-28 03:52:30,587 INFO L290 TraceCheckUtils]: 7: Hoare triple {60346#(and (<= main_~z~0 0) (<= 50000 main_~y~0))} [233] L18-1_primed-->L11-2: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {60346#(and (<= main_~z~0 0) (<= 50000 main_~y~0))} is VALID [2022-04-28 03:52:30,588 INFO L290 TraceCheckUtils]: 8: Hoare triple {60346#(and (<= main_~z~0 0) (<= 50000 main_~y~0))} [234] L11-2-->L18-1_primed: Formula: (let ((.cse0 (= v_main_~x~0_2745 v_main_~x~0_2744)) (.cse1 (= |v_main_#t~post5_305| |v_main_#t~post5_304|)) (.cse2 (= |v_main_#t~post6_305| |v_main_#t~post6_304|)) (.cse3 (<= 50000 v_main_~x~0_2745))) (or (and .cse0 .cse1 (= v_main_~y~0_3086 v_main_~y~0_3085) .cse2) (and (= v_main_~y~0_3085 v_main_~y~0_3086) .cse0 .cse1 .cse2 (or (not .cse3) (not (< v_main_~x~0_2745 1000000)))) (and .cse3 (< v_main_~x~0_2745 v_main_~x~0_2744) (< v_main_~x~0_2744 1000001) (= (+ v_main_~x~0_2744 v_main_~y~0_3086) (+ v_main_~x~0_2745 v_main_~y~0_3085))))) InVars {main_~y~0=v_main_~y~0_3086, main_#t~post5=|v_main_#t~post5_305|, main_~x~0=v_main_~x~0_2745, main_#t~post6=|v_main_#t~post6_305|} OutVars{main_~y~0=v_main_~y~0_3085, main_#t~post5=|v_main_#t~post5_304|, main_~x~0=v_main_~x~0_2744, main_#t~post6=|v_main_#t~post6_304|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {60346#(and (<= main_~z~0 0) (<= 50000 main_~y~0))} is VALID [2022-04-28 03:52:30,588 INFO L290 TraceCheckUtils]: 9: Hoare triple {60346#(and (<= main_~z~0 0) (<= 50000 main_~y~0))} [231] L18-1_primed-->L18-1: Formula: (not (< v_main_~x~0_11 1000000)) InVars {main_~x~0=v_main_~x~0_11} OutVars{main_~x~0=v_main_~x~0_11} AuxVars[] AssignedVars[] {60346#(and (<= main_~z~0 0) (<= 50000 main_~y~0))} is VALID [2022-04-28 03:52:30,589 INFO L290 TraceCheckUtils]: 10: Hoare triple {60346#(and (<= main_~z~0 0) (<= 50000 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {60362#(and (<= main_~z~0 0) (<= 49999 main_~y~0))} is VALID [2022-04-28 03:52:30,589 INFO L290 TraceCheckUtils]: 11: Hoare triple {60362#(and (<= main_~z~0 0) (<= 49999 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {60366#(and (<= main_~z~0 0) (<= 49998 main_~y~0))} is VALID [2022-04-28 03:52:30,590 INFO L290 TraceCheckUtils]: 12: Hoare triple {60366#(and (<= main_~z~0 0) (<= 49998 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {60370#(and (<= main_~z~0 0) (<= 49997 main_~y~0))} is VALID [2022-04-28 03:52:30,590 INFO L290 TraceCheckUtils]: 13: Hoare triple {60370#(and (<= main_~z~0 0) (<= 49997 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {60374#(and (<= main_~z~0 0) (<= 49996 main_~y~0))} is VALID [2022-04-28 03:52:30,591 INFO L290 TraceCheckUtils]: 14: Hoare triple {60374#(and (<= main_~z~0 0) (<= 49996 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {60378#(and (<= main_~z~0 0) (<= 49995 main_~y~0))} is VALID [2022-04-28 03:52:30,591 INFO L290 TraceCheckUtils]: 15: Hoare triple {60378#(and (<= main_~z~0 0) (<= 49995 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {60382#(and (<= main_~z~0 0) (<= 49994 main_~y~0))} is VALID [2022-04-28 03:52:30,591 INFO L290 TraceCheckUtils]: 16: Hoare triple {60382#(and (<= main_~z~0 0) (<= 49994 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {60386#(and (<= main_~z~0 0) (<= 49993 main_~y~0))} is VALID [2022-04-28 03:52:30,592 INFO L290 TraceCheckUtils]: 17: Hoare triple {60386#(and (<= main_~z~0 0) (<= 49993 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {60390#(and (<= main_~z~0 0) (<= 49992 main_~y~0))} is VALID [2022-04-28 03:52:30,592 INFO L290 TraceCheckUtils]: 18: Hoare triple {60390#(and (<= main_~z~0 0) (<= 49992 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {60394#(and (<= main_~z~0 0) (<= 49991 main_~y~0))} is VALID [2022-04-28 03:52:30,593 INFO L290 TraceCheckUtils]: 19: Hoare triple {60394#(and (<= main_~z~0 0) (<= 49991 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {60398#(and (<= main_~z~0 0) (<= 49990 main_~y~0))} is VALID [2022-04-28 03:52:30,593 INFO L290 TraceCheckUtils]: 20: Hoare triple {60398#(and (<= main_~z~0 0) (<= 49990 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {60402#(and (<= main_~z~0 0) (<= 49989 main_~y~0))} is VALID [2022-04-28 03:52:30,594 INFO L290 TraceCheckUtils]: 21: Hoare triple {60402#(and (<= main_~z~0 0) (<= 49989 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {60406#(and (<= main_~z~0 0) (<= 49988 main_~y~0))} is VALID [2022-04-28 03:52:30,594 INFO L290 TraceCheckUtils]: 22: Hoare triple {60406#(and (<= main_~z~0 0) (<= 49988 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {60410#(and (<= main_~z~0 0) (<= 49987 main_~y~0))} is VALID [2022-04-28 03:52:30,595 INFO L290 TraceCheckUtils]: 23: Hoare triple {60410#(and (<= main_~z~0 0) (<= 49987 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {60414#(and (<= main_~z~0 0) (<= 49986 main_~y~0))} is VALID [2022-04-28 03:52:30,595 INFO L290 TraceCheckUtils]: 24: Hoare triple {60414#(and (<= main_~z~0 0) (<= 49986 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {60418#(and (<= main_~z~0 0) (<= 49985 main_~y~0))} is VALID [2022-04-28 03:52:30,596 INFO L290 TraceCheckUtils]: 25: Hoare triple {60418#(and (<= main_~z~0 0) (<= 49985 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {60422#(and (<= main_~z~0 0) (<= 49984 main_~y~0))} is VALID [2022-04-28 03:52:30,596 INFO L290 TraceCheckUtils]: 26: Hoare triple {60422#(and (<= main_~z~0 0) (<= 49984 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {60426#(and (<= main_~z~0 0) (<= 49983 main_~y~0))} is VALID [2022-04-28 03:52:30,597 INFO L290 TraceCheckUtils]: 27: Hoare triple {60426#(and (<= main_~z~0 0) (<= 49983 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {60430#(and (<= main_~z~0 0) (<= 49982 main_~y~0))} is VALID [2022-04-28 03:52:30,597 INFO L290 TraceCheckUtils]: 28: Hoare triple {60430#(and (<= main_~z~0 0) (<= 49982 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {60434#(and (<= main_~z~0 0) (<= 49981 main_~y~0))} is VALID [2022-04-28 03:52:30,598 INFO L290 TraceCheckUtils]: 29: Hoare triple {60434#(and (<= main_~z~0 0) (<= 49981 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {60438#(and (<= main_~z~0 0) (<= 49980 main_~y~0))} is VALID [2022-04-28 03:52:30,598 INFO L290 TraceCheckUtils]: 30: Hoare triple {60438#(and (<= main_~z~0 0) (<= 49980 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {60442#(and (<= main_~z~0 0) (<= 49979 main_~y~0))} is VALID [2022-04-28 03:52:30,599 INFO L290 TraceCheckUtils]: 31: Hoare triple {60442#(and (<= main_~z~0 0) (<= 49979 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {60446#(and (<= main_~z~0 0) (<= 49978 main_~y~0))} is VALID [2022-04-28 03:52:30,599 INFO L290 TraceCheckUtils]: 32: Hoare triple {60446#(and (<= main_~z~0 0) (<= 49978 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {60450#(and (<= main_~z~0 0) (<= 49977 main_~y~0))} is VALID [2022-04-28 03:52:30,600 INFO L290 TraceCheckUtils]: 33: Hoare triple {60450#(and (<= main_~z~0 0) (<= 49977 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {60454#(and (<= main_~z~0 0) (<= 49976 main_~y~0))} is VALID [2022-04-28 03:52:30,600 INFO L290 TraceCheckUtils]: 34: Hoare triple {60454#(and (<= main_~z~0 0) (<= 49976 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {60458#(and (<= main_~z~0 0) (<= 49975 main_~y~0))} is VALID [2022-04-28 03:52:30,601 INFO L290 TraceCheckUtils]: 35: Hoare triple {60458#(and (<= main_~z~0 0) (<= 49975 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {60462#(and (<= main_~z~0 0) (<= 49974 main_~y~0))} is VALID [2022-04-28 03:52:30,601 INFO L290 TraceCheckUtils]: 36: Hoare triple {60462#(and (<= main_~z~0 0) (<= 49974 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {60466#(and (<= main_~z~0 0) (<= 49973 main_~y~0))} is VALID [2022-04-28 03:52:30,602 INFO L290 TraceCheckUtils]: 37: Hoare triple {60466#(and (<= main_~z~0 0) (<= 49973 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {60470#(and (<= main_~z~0 0) (<= 49972 main_~y~0))} is VALID [2022-04-28 03:52:30,602 INFO L290 TraceCheckUtils]: 38: Hoare triple {60470#(and (<= main_~z~0 0) (<= 49972 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {60474#(and (<= main_~z~0 0) (<= 49971 main_~y~0))} is VALID [2022-04-28 03:52:30,602 INFO L290 TraceCheckUtils]: 39: Hoare triple {60474#(and (<= main_~z~0 0) (<= 49971 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {60478#(and (<= main_~z~0 0) (<= 49970 main_~y~0))} is VALID [2022-04-28 03:52:30,603 INFO L290 TraceCheckUtils]: 40: Hoare triple {60478#(and (<= main_~z~0 0) (<= 49970 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {60482#(and (<= main_~z~0 0) (<= 49969 main_~y~0))} is VALID [2022-04-28 03:52:30,603 INFO L290 TraceCheckUtils]: 41: Hoare triple {60482#(and (<= main_~z~0 0) (<= 49969 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {60486#(and (<= main_~z~0 0) (<= 49968 main_~y~0))} is VALID [2022-04-28 03:52:30,604 INFO L290 TraceCheckUtils]: 42: Hoare triple {60486#(and (<= main_~z~0 0) (<= 49968 main_~y~0))} assume !(~y~0 > ~z~0); {60287#false} is VALID [2022-04-28 03:52:30,604 INFO L272 TraceCheckUtils]: 43: Hoare triple {60287#false} call __VERIFIER_assert((if ~x~0 == ~z~0 then 1 else 0)); {60287#false} is VALID [2022-04-28 03:52:30,612 INFO L290 TraceCheckUtils]: 44: Hoare triple {60287#false} ~cond := #in~cond; {60287#false} is VALID [2022-04-28 03:52:30,612 INFO L290 TraceCheckUtils]: 45: Hoare triple {60287#false} assume 0 == ~cond; {60287#false} is VALID [2022-04-28 03:52:30,612 INFO L290 TraceCheckUtils]: 46: Hoare triple {60287#false} assume !false; {60287#false} is VALID [2022-04-28 03:52:30,612 INFO L134 CoverageAnalysis]: Checked inductivity of 530 backedges. 0 proven. 528 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-04-28 03:52:30,612 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 03:52:33,292 INFO L290 TraceCheckUtils]: 46: Hoare triple {60287#false} assume !false; {60287#false} is VALID [2022-04-28 03:52:33,293 INFO L290 TraceCheckUtils]: 45: Hoare triple {60287#false} assume 0 == ~cond; {60287#false} is VALID [2022-04-28 03:52:33,293 INFO L290 TraceCheckUtils]: 44: Hoare triple {60287#false} ~cond := #in~cond; {60287#false} is VALID [2022-04-28 03:52:33,293 INFO L272 TraceCheckUtils]: 43: Hoare triple {60287#false} call __VERIFIER_assert((if ~x~0 == ~z~0 then 1 else 0)); {60287#false} is VALID [2022-04-28 03:52:33,293 INFO L290 TraceCheckUtils]: 42: Hoare triple {60514#(< main_~z~0 main_~y~0)} assume !(~y~0 > ~z~0); {60287#false} is VALID [2022-04-28 03:52:33,294 INFO L290 TraceCheckUtils]: 41: Hoare triple {60518#(< (+ main_~z~0 1) main_~y~0)} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {60514#(< main_~z~0 main_~y~0)} is VALID [2022-04-28 03:52:33,294 INFO L290 TraceCheckUtils]: 40: Hoare triple {60522#(< (+ main_~z~0 2) main_~y~0)} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {60518#(< (+ main_~z~0 1) main_~y~0)} is VALID [2022-04-28 03:52:33,294 INFO L290 TraceCheckUtils]: 39: Hoare triple {60526#(< (+ main_~z~0 3) main_~y~0)} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {60522#(< (+ main_~z~0 2) main_~y~0)} is VALID [2022-04-28 03:52:33,295 INFO L290 TraceCheckUtils]: 38: Hoare triple {60530#(< (+ main_~z~0 4) main_~y~0)} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {60526#(< (+ main_~z~0 3) main_~y~0)} is VALID [2022-04-28 03:52:33,295 INFO L290 TraceCheckUtils]: 37: Hoare triple {60534#(< (+ 5 main_~z~0) main_~y~0)} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {60530#(< (+ main_~z~0 4) main_~y~0)} is VALID [2022-04-28 03:52:33,296 INFO L290 TraceCheckUtils]: 36: Hoare triple {60538#(< (+ main_~z~0 6) main_~y~0)} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {60534#(< (+ 5 main_~z~0) main_~y~0)} is VALID [2022-04-28 03:52:33,296 INFO L290 TraceCheckUtils]: 35: Hoare triple {60542#(< (+ 7 main_~z~0) main_~y~0)} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {60538#(< (+ main_~z~0 6) main_~y~0)} is VALID [2022-04-28 03:52:33,297 INFO L290 TraceCheckUtils]: 34: Hoare triple {60546#(< (+ main_~z~0 8) main_~y~0)} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {60542#(< (+ 7 main_~z~0) main_~y~0)} is VALID [2022-04-28 03:52:33,297 INFO L290 TraceCheckUtils]: 33: Hoare triple {60550#(< (+ main_~z~0 9) main_~y~0)} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {60546#(< (+ main_~z~0 8) main_~y~0)} is VALID [2022-04-28 03:52:33,299 INFO L290 TraceCheckUtils]: 32: Hoare triple {60554#(< (+ main_~z~0 10) main_~y~0)} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {60550#(< (+ main_~z~0 9) main_~y~0)} is VALID [2022-04-28 03:52:33,299 INFO L290 TraceCheckUtils]: 31: Hoare triple {60558#(< (+ main_~z~0 11) main_~y~0)} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {60554#(< (+ main_~z~0 10) main_~y~0)} is VALID [2022-04-28 03:52:33,300 INFO L290 TraceCheckUtils]: 30: Hoare triple {60562#(< (+ main_~z~0 12) main_~y~0)} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {60558#(< (+ main_~z~0 11) main_~y~0)} is VALID [2022-04-28 03:52:33,300 INFO L290 TraceCheckUtils]: 29: Hoare triple {60566#(< (+ main_~z~0 13) main_~y~0)} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {60562#(< (+ main_~z~0 12) main_~y~0)} is VALID [2022-04-28 03:52:33,300 INFO L290 TraceCheckUtils]: 28: Hoare triple {60570#(< (+ main_~z~0 14) main_~y~0)} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {60566#(< (+ main_~z~0 13) main_~y~0)} is VALID [2022-04-28 03:52:33,301 INFO L290 TraceCheckUtils]: 27: Hoare triple {60574#(< (+ main_~z~0 15) main_~y~0)} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {60570#(< (+ main_~z~0 14) main_~y~0)} is VALID [2022-04-28 03:52:33,301 INFO L290 TraceCheckUtils]: 26: Hoare triple {60578#(< (+ main_~z~0 16) main_~y~0)} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {60574#(< (+ main_~z~0 15) main_~y~0)} is VALID [2022-04-28 03:52:33,302 INFO L290 TraceCheckUtils]: 25: Hoare triple {60582#(< (+ main_~z~0 17) main_~y~0)} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {60578#(< (+ main_~z~0 16) main_~y~0)} is VALID [2022-04-28 03:52:33,302 INFO L290 TraceCheckUtils]: 24: Hoare triple {60586#(< (+ main_~z~0 18) main_~y~0)} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {60582#(< (+ main_~z~0 17) main_~y~0)} is VALID [2022-04-28 03:52:33,303 INFO L290 TraceCheckUtils]: 23: Hoare triple {60590#(< (+ 19 main_~z~0) main_~y~0)} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {60586#(< (+ main_~z~0 18) main_~y~0)} is VALID [2022-04-28 03:52:33,303 INFO L290 TraceCheckUtils]: 22: Hoare triple {60594#(< (+ main_~z~0 20) main_~y~0)} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {60590#(< (+ 19 main_~z~0) main_~y~0)} is VALID [2022-04-28 03:52:33,304 INFO L290 TraceCheckUtils]: 21: Hoare triple {60598#(< (+ main_~z~0 21) main_~y~0)} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {60594#(< (+ main_~z~0 20) main_~y~0)} is VALID [2022-04-28 03:52:33,304 INFO L290 TraceCheckUtils]: 20: Hoare triple {60602#(< (+ main_~z~0 22) main_~y~0)} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {60598#(< (+ main_~z~0 21) main_~y~0)} is VALID [2022-04-28 03:52:33,305 INFO L290 TraceCheckUtils]: 19: Hoare triple {60606#(< (+ 23 main_~z~0) main_~y~0)} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {60602#(< (+ main_~z~0 22) main_~y~0)} is VALID [2022-04-28 03:52:33,305 INFO L290 TraceCheckUtils]: 18: Hoare triple {60610#(< (+ main_~z~0 24) main_~y~0)} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {60606#(< (+ 23 main_~z~0) main_~y~0)} is VALID [2022-04-28 03:52:33,305 INFO L290 TraceCheckUtils]: 17: Hoare triple {60614#(< (+ main_~z~0 25) main_~y~0)} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {60610#(< (+ main_~z~0 24) main_~y~0)} is VALID [2022-04-28 03:52:33,306 INFO L290 TraceCheckUtils]: 16: Hoare triple {60618#(< (+ main_~z~0 26) main_~y~0)} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {60614#(< (+ main_~z~0 25) main_~y~0)} is VALID [2022-04-28 03:52:33,306 INFO L290 TraceCheckUtils]: 15: Hoare triple {60622#(< (+ main_~z~0 27) main_~y~0)} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {60618#(< (+ main_~z~0 26) main_~y~0)} is VALID [2022-04-28 03:52:33,307 INFO L290 TraceCheckUtils]: 14: Hoare triple {60626#(< (+ main_~z~0 28) main_~y~0)} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {60622#(< (+ main_~z~0 27) main_~y~0)} is VALID [2022-04-28 03:52:33,307 INFO L290 TraceCheckUtils]: 13: Hoare triple {60630#(< (+ 29 main_~z~0) main_~y~0)} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {60626#(< (+ main_~z~0 28) main_~y~0)} is VALID [2022-04-28 03:52:33,308 INFO L290 TraceCheckUtils]: 12: Hoare triple {60634#(< (+ 30 main_~z~0) main_~y~0)} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {60630#(< (+ 29 main_~z~0) main_~y~0)} is VALID [2022-04-28 03:52:33,308 INFO L290 TraceCheckUtils]: 11: Hoare triple {60638#(< (+ main_~z~0 31) main_~y~0)} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {60634#(< (+ 30 main_~z~0) main_~y~0)} is VALID [2022-04-28 03:52:33,309 INFO L290 TraceCheckUtils]: 10: Hoare triple {60642#(< (+ 32 main_~z~0) main_~y~0)} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {60638#(< (+ main_~z~0 31) main_~y~0)} is VALID [2022-04-28 03:52:33,309 INFO L290 TraceCheckUtils]: 9: Hoare triple {60642#(< (+ 32 main_~z~0) main_~y~0)} [231] L18-1_primed-->L18-1: Formula: (not (< v_main_~x~0_11 1000000)) InVars {main_~x~0=v_main_~x~0_11} OutVars{main_~x~0=v_main_~x~0_11} AuxVars[] AssignedVars[] {60642#(< (+ 32 main_~z~0) main_~y~0)} is VALID [2022-04-28 03:52:33,310 INFO L290 TraceCheckUtils]: 8: Hoare triple {60642#(< (+ 32 main_~z~0) main_~y~0)} [234] L11-2-->L18-1_primed: Formula: (let ((.cse0 (= v_main_~x~0_2745 v_main_~x~0_2744)) (.cse1 (= |v_main_#t~post5_305| |v_main_#t~post5_304|)) (.cse2 (= |v_main_#t~post6_305| |v_main_#t~post6_304|)) (.cse3 (<= 50000 v_main_~x~0_2745))) (or (and .cse0 .cse1 (= v_main_~y~0_3086 v_main_~y~0_3085) .cse2) (and (= v_main_~y~0_3085 v_main_~y~0_3086) .cse0 .cse1 .cse2 (or (not .cse3) (not (< v_main_~x~0_2745 1000000)))) (and .cse3 (< v_main_~x~0_2745 v_main_~x~0_2744) (< v_main_~x~0_2744 1000001) (= (+ v_main_~x~0_2744 v_main_~y~0_3086) (+ v_main_~x~0_2745 v_main_~y~0_3085))))) InVars {main_~y~0=v_main_~y~0_3086, main_#t~post5=|v_main_#t~post5_305|, main_~x~0=v_main_~x~0_2745, main_#t~post6=|v_main_#t~post6_305|} OutVars{main_~y~0=v_main_~y~0_3085, main_#t~post5=|v_main_#t~post5_304|, main_~x~0=v_main_~x~0_2744, main_#t~post6=|v_main_#t~post6_304|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {60642#(< (+ 32 main_~z~0) main_~y~0)} is VALID [2022-04-28 03:52:33,310 INFO L290 TraceCheckUtils]: 7: Hoare triple {60642#(< (+ 32 main_~z~0) main_~y~0)} [233] L18-1_primed-->L11-2: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {60642#(< (+ 32 main_~z~0) main_~y~0)} is VALID [2022-04-28 03:52:33,310 INFO L290 TraceCheckUtils]: 6: Hoare triple {60642#(< (+ 32 main_~z~0) main_~y~0)} [232] L11-2-->L18-1_primed: Formula: (let ((.cse0 (= v_main_~x~0_2743 v_main_~x~0_2742)) (.cse1 (= |v_main_#t~post4_273| |v_main_#t~post4_272|))) (or (and (< v_main_~x~0_2742 50001) (< v_main_~x~0_2743 v_main_~x~0_2742)) (and .cse0 (<= 50000 v_main_~x~0_2743) .cse1) (and .cse0 .cse1))) InVars {main_~x~0=v_main_~x~0_2743, main_#t~post4=|v_main_#t~post4_273|} OutVars{main_~x~0=v_main_~x~0_2742, main_#t~post4=|v_main_#t~post4_272|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {60642#(< (+ 32 main_~z~0) main_~y~0)} is VALID [2022-04-28 03:52:33,311 INFO L290 TraceCheckUtils]: 5: Hoare triple {60286#true} ~x~0 := 0;~y~0 := 50000;~z~0 := 0;~x~0 := 0; {60642#(< (+ 32 main_~z~0) main_~y~0)} is VALID [2022-04-28 03:52:33,311 INFO L272 TraceCheckUtils]: 4: Hoare triple {60286#true} call #t~ret9 := main(); {60286#true} is VALID [2022-04-28 03:52:33,311 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {60286#true} {60286#true} #52#return; {60286#true} is VALID [2022-04-28 03:52:33,311 INFO L290 TraceCheckUtils]: 2: Hoare triple {60286#true} assume true; {60286#true} is VALID [2022-04-28 03:52:33,311 INFO L290 TraceCheckUtils]: 1: Hoare triple {60286#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(17, 2);call #Ultimate.allocInit(12, 3); {60286#true} is VALID [2022-04-28 03:52:33,311 INFO L272 TraceCheckUtils]: 0: Hoare triple {60286#true} call ULTIMATE.init(); {60286#true} is VALID [2022-04-28 03:52:33,311 INFO L134 CoverageAnalysis]: Checked inductivity of 530 backedges. 0 proven. 528 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-04-28 03:52:33,311 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [740050236] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 03:52:33,311 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 03:52:33,311 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [39, 35, 35] total 105 [2022-04-28 03:52:37,260 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 03:52:37,260 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [277641179] [2022-04-28 03:52:37,260 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [277641179] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 03:52:37,260 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 03:52:37,260 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [96] imperfect sequences [] total 96 [2022-04-28 03:52:37,261 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [169428412] [2022-04-28 03:52:37,261 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 03:52:37,261 INFO L78 Accepts]: Start accepts. Automaton has has 96 states, 96 states have (on average 1.6458333333333333) internal successors, (158), 95 states have internal predecessors, (158), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 162 [2022-04-28 03:52:37,261 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 03:52:37,261 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 96 states, 96 states have (on average 1.6458333333333333) internal successors, (158), 95 states have internal predecessors, (158), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:52:37,385 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 162 edges. 162 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 03:52:37,385 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 96 states [2022-04-28 03:52:37,385 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 03:52:37,386 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 96 interpolants. [2022-04-28 03:52:37,387 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9271, Invalid=17789, Unknown=0, NotChecked=0, Total=27060 [2022-04-28 03:52:37,387 INFO L87 Difference]: Start difference. First operand 273 states and 277 transitions. Second operand has 96 states, 96 states have (on average 1.6458333333333333) internal successors, (158), 95 states have internal predecessors, (158), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:52:54,506 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:52:54,506 INFO L93 Difference]: Finished difference Result 424 states and 433 transitions. [2022-04-28 03:52:54,506 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 63 states. [2022-04-28 03:52:54,506 INFO L78 Accepts]: Start accepts. Automaton has has 96 states, 96 states have (on average 1.6458333333333333) internal successors, (158), 95 states have internal predecessors, (158), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 162 [2022-04-28 03:52:54,506 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 03:52:54,506 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 96 states, 96 states have (on average 1.6458333333333333) internal successors, (158), 95 states have internal predecessors, (158), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:52:54,507 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 149 transitions. [2022-04-28 03:52:54,507 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 96 states, 96 states have (on average 1.6458333333333333) internal successors, (158), 95 states have internal predecessors, (158), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:52:54,508 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 149 transitions. [2022-04-28 03:52:54,508 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 63 states and 149 transitions. [2022-04-28 03:52:54,633 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 149 edges. 149 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 03:52:54,636 INFO L225 Difference]: With dead ends: 424 [2022-04-28 03:52:54,636 INFO L226 Difference]: Without dead ends: 275 [2022-04-28 03:52:54,639 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 317 GetRequests, 92 SyntacticMatches, 2 SemanticMatches, 223 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12292 ImplicationChecksByTransitivity, 10.5s TimeCoverageRelationStatistics Valid=13535, Invalid=36865, Unknown=0, NotChecked=0, Total=50400 [2022-04-28 03:52:54,639 INFO L413 NwaCegarLoop]: 13 mSDtfsCounter, 70 mSDsluCounter, 337 mSDsCounter, 0 mSdLazyCounter, 8643 mSolverCounterSat, 65 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 7.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 70 SdHoareTripleChecker+Valid, 350 SdHoareTripleChecker+Invalid, 8708 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 65 IncrementalHoareTripleChecker+Valid, 8643 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 7.1s IncrementalHoareTripleChecker+Time [2022-04-28 03:52:54,639 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [70 Valid, 350 Invalid, 8708 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [65 Valid, 8643 Invalid, 0 Unknown, 0 Unchecked, 7.1s Time] [2022-04-28 03:52:54,640 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 275 states. [2022-04-28 03:52:55,422 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 275 to 275. [2022-04-28 03:52:55,422 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 03:52:55,423 INFO L82 GeneralOperation]: Start isEquivalent. First operand 275 states. Second operand has 275 states, 270 states have (on average 1.0185185185185186) internal successors, (275), 270 states have internal predecessors, (275), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:52:55,423 INFO L74 IsIncluded]: Start isIncluded. First operand 275 states. Second operand has 275 states, 270 states have (on average 1.0185185185185186) internal successors, (275), 270 states have internal predecessors, (275), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:52:55,423 INFO L87 Difference]: Start difference. First operand 275 states. Second operand has 275 states, 270 states have (on average 1.0185185185185186) internal successors, (275), 270 states have internal predecessors, (275), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:52:55,426 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:52:55,426 INFO L93 Difference]: Finished difference Result 275 states and 279 transitions. [2022-04-28 03:52:55,426 INFO L276 IsEmpty]: Start isEmpty. Operand 275 states and 279 transitions. [2022-04-28 03:52:55,426 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:52:55,426 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:52:55,426 INFO L74 IsIncluded]: Start isIncluded. First operand has 275 states, 270 states have (on average 1.0185185185185186) internal successors, (275), 270 states have internal predecessors, (275), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 275 states. [2022-04-28 03:52:55,426 INFO L87 Difference]: Start difference. First operand has 275 states, 270 states have (on average 1.0185185185185186) internal successors, (275), 270 states have internal predecessors, (275), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 275 states. [2022-04-28 03:52:55,429 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:52:55,429 INFO L93 Difference]: Finished difference Result 275 states and 279 transitions. [2022-04-28 03:52:55,429 INFO L276 IsEmpty]: Start isEmpty. Operand 275 states and 279 transitions. [2022-04-28 03:52:55,429 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:52:55,429 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:52:55,430 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 03:52:55,430 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 03:52:55,430 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 275 states, 270 states have (on average 1.0185185185185186) internal successors, (275), 270 states have internal predecessors, (275), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:52:55,433 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 275 states to 275 states and 279 transitions. [2022-04-28 03:52:55,433 INFO L78 Accepts]: Start accepts. Automaton has 275 states and 279 transitions. Word has length 162 [2022-04-28 03:52:55,433 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 03:52:55,433 INFO L495 AbstractCegarLoop]: Abstraction has 275 states and 279 transitions. [2022-04-28 03:52:55,433 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 96 states, 96 states have (on average 1.6458333333333333) internal successors, (158), 95 states have internal predecessors, (158), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:52:55,433 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 275 states and 279 transitions. [2022-04-28 03:52:55,728 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 279 edges. 279 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 03:52:55,729 INFO L276 IsEmpty]: Start isEmpty. Operand 275 states and 279 transitions. [2022-04-28 03:52:55,729 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 165 [2022-04-28 03:52:55,729 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 03:52:55,729 INFO L195 NwaCegarLoop]: trace histogram [60, 59, 32, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 03:52:55,745 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (45)] Forceful destruction successful, exit code 0 [2022-04-28 03:52:55,929 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 45 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable46 [2022-04-28 03:52:55,930 INFO L420 AbstractCegarLoop]: === Iteration 48 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 03:52:55,930 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 03:52:55,930 INFO L85 PathProgramCache]: Analyzing trace with hash -643194015, now seen corresponding path program 45 times [2022-04-28 03:52:55,930 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 03:52:55,930 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1624328244] [2022-04-28 03:53:00,019 WARN L977 rdanLoopAcceleration]: Unable to prove correctness of quantifier elimination. [2022-04-28 03:53:00,067 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 1 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 03:53:00,273 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={1=1, 2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 03:53:00,274 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-28 03:53:00,276 INFO L85 PathProgramCache]: Analyzing trace with hash -997071103, now seen corresponding path program 1 times [2022-04-28 03:53:00,277 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 03:53:00,277 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1653612305] [2022-04-28 03:53:00,277 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:53:00,277 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 03:53:00,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:53:01,061 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 03:53:01,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:53:01,064 INFO L290 TraceCheckUtils]: 0: Hoare triple {62844#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(17, 2);call #Ultimate.allocInit(12, 3); {62803#true} is VALID [2022-04-28 03:53:01,064 INFO L290 TraceCheckUtils]: 1: Hoare triple {62803#true} assume true; {62803#true} is VALID [2022-04-28 03:53:01,064 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {62803#true} {62803#true} #52#return; {62803#true} is VALID [2022-04-28 03:53:01,064 INFO L272 TraceCheckUtils]: 0: Hoare triple {62803#true} call ULTIMATE.init(); {62844#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 03:53:01,064 INFO L290 TraceCheckUtils]: 1: Hoare triple {62844#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(17, 2);call #Ultimate.allocInit(12, 3); {62803#true} is VALID [2022-04-28 03:53:01,064 INFO L290 TraceCheckUtils]: 2: Hoare triple {62803#true} assume true; {62803#true} is VALID [2022-04-28 03:53:01,064 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {62803#true} {62803#true} #52#return; {62803#true} is VALID [2022-04-28 03:53:01,065 INFO L272 TraceCheckUtils]: 4: Hoare triple {62803#true} call #t~ret9 := main(); {62803#true} is VALID [2022-04-28 03:53:01,065 INFO L290 TraceCheckUtils]: 5: Hoare triple {62803#true} ~x~0 := 0;~y~0 := 50000;~z~0 := 0;~x~0 := 0; {62808#(and (= main_~z~0 0) (= main_~x~0 0) (<= 50000 main_~y~0))} is VALID [2022-04-28 03:53:01,066 INFO L290 TraceCheckUtils]: 6: Hoare triple {62808#(and (= main_~z~0 0) (= main_~x~0 0) (<= 50000 main_~y~0))} [236] L11-2-->L18-1_primed: Formula: (let ((.cse0 (= |v_main_#t~post4_279| |v_main_#t~post4_278|))) (or (and (= v_main_~x~0_2850 v_main_~x~0_2849) .cse0) (and (< v_main_~x~0_2849 50001) (< v_main_~x~0_2850 v_main_~x~0_2849)) (and (= v_main_~x~0_2849 v_main_~x~0_2850) (<= 50000 v_main_~x~0_2850) .cse0))) InVars {main_~x~0=v_main_~x~0_2850, main_#t~post4=|v_main_#t~post4_279|} OutVars{main_~x~0=v_main_~x~0_2849, main_#t~post4=|v_main_#t~post4_278|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {62809#(and (= main_~z~0 0) (<= main_~x~0 main_~y~0) (<= main_~x~0 50000))} is VALID [2022-04-28 03:53:01,066 INFO L290 TraceCheckUtils]: 7: Hoare triple {62809#(and (= main_~z~0 0) (<= main_~x~0 main_~y~0) (<= main_~x~0 50000))} [237] L18-1_primed-->L11-2: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {62809#(and (= main_~z~0 0) (<= main_~x~0 main_~y~0) (<= main_~x~0 50000))} is VALID [2022-04-28 03:53:01,067 INFO L290 TraceCheckUtils]: 8: Hoare triple {62809#(and (= main_~z~0 0) (<= main_~x~0 main_~y~0) (<= main_~x~0 50000))} [238] L11-2-->L18-1_primed: Formula: (let ((.cse0 (<= 50000 v_main_~x~0_2852)) (.cse1 (= |v_main_#t~post6_312| |v_main_#t~post6_311|)) (.cse2 (= v_main_~y~0_3217 v_main_~y~0_3216)) (.cse3 (= v_main_~x~0_2852 v_main_~x~0_2851)) (.cse4 (= |v_main_#t~post5_312| |v_main_#t~post5_311|))) (or (and (< v_main_~x~0_2851 1000001) (= (+ v_main_~x~0_2852 v_main_~y~0_3216) (+ v_main_~x~0_2851 v_main_~y~0_3217)) (< v_main_~x~0_2852 v_main_~x~0_2851) .cse0) (and .cse1 .cse2 .cse3 .cse4) (and (or (not (< v_main_~x~0_2852 1000000)) (not .cse0)) .cse1 .cse2 .cse3 .cse4))) InVars {main_~y~0=v_main_~y~0_3217, main_#t~post5=|v_main_#t~post5_312|, main_~x~0=v_main_~x~0_2852, main_#t~post6=|v_main_#t~post6_312|} OutVars{main_~y~0=v_main_~y~0_3216, main_#t~post5=|v_main_#t~post5_311|, main_~x~0=v_main_~x~0_2851, main_#t~post6=|v_main_#t~post6_311|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {62810#(and (= main_~z~0 0) (or (<= main_~x~0 main_~y~0) (<= main_~x~0 50000)))} is VALID [2022-04-28 03:53:01,067 INFO L290 TraceCheckUtils]: 9: Hoare triple {62810#(and (= main_~z~0 0) (or (<= main_~x~0 main_~y~0) (<= main_~x~0 50000)))} [235] L18-1_primed-->L18-1: Formula: (not (< v_main_~x~0_11 1000000)) InVars {main_~x~0=v_main_~x~0_11} OutVars{main_~x~0=v_main_~x~0_11} AuxVars[] AssignedVars[] {62811#(and (= main_~z~0 0) (<= 1000000 main_~y~0))} is VALID [2022-04-28 03:53:01,068 INFO L290 TraceCheckUtils]: 10: Hoare triple {62811#(and (= main_~z~0 0) (<= 1000000 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {62812#(and (= main_~z~0 0) (<= 999999 main_~y~0))} is VALID [2022-04-28 03:53:01,068 INFO L290 TraceCheckUtils]: 11: Hoare triple {62812#(and (= main_~z~0 0) (<= 999999 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {62813#(and (= main_~z~0 0) (<= 999998 main_~y~0))} is VALID [2022-04-28 03:53:01,069 INFO L290 TraceCheckUtils]: 12: Hoare triple {62813#(and (= main_~z~0 0) (<= 999998 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {62814#(and (= main_~z~0 0) (<= 999997 main_~y~0))} is VALID [2022-04-28 03:53:01,069 INFO L290 TraceCheckUtils]: 13: Hoare triple {62814#(and (= main_~z~0 0) (<= 999997 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {62815#(and (<= 999996 main_~y~0) (= main_~z~0 0))} is VALID [2022-04-28 03:53:01,070 INFO L290 TraceCheckUtils]: 14: Hoare triple {62815#(and (<= 999996 main_~y~0) (= main_~z~0 0))} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {62816#(and (= main_~z~0 0) (<= 999995 main_~y~0))} is VALID [2022-04-28 03:53:01,070 INFO L290 TraceCheckUtils]: 15: Hoare triple {62816#(and (= main_~z~0 0) (<= 999995 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {62817#(and (= main_~z~0 0) (<= 999994 main_~y~0))} is VALID [2022-04-28 03:53:01,071 INFO L290 TraceCheckUtils]: 16: Hoare triple {62817#(and (= main_~z~0 0) (<= 999994 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {62818#(and (= main_~z~0 0) (<= 999993 main_~y~0))} is VALID [2022-04-28 03:53:01,071 INFO L290 TraceCheckUtils]: 17: Hoare triple {62818#(and (= main_~z~0 0) (<= 999993 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {62819#(and (= main_~z~0 0) (<= 999992 main_~y~0))} is VALID [2022-04-28 03:53:01,072 INFO L290 TraceCheckUtils]: 18: Hoare triple {62819#(and (= main_~z~0 0) (<= 999992 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {62820#(and (= main_~z~0 0) (<= 999991 main_~y~0))} is VALID [2022-04-28 03:53:01,072 INFO L290 TraceCheckUtils]: 19: Hoare triple {62820#(and (= main_~z~0 0) (<= 999991 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {62821#(and (= main_~z~0 0) (<= 999990 main_~y~0))} is VALID [2022-04-28 03:53:01,073 INFO L290 TraceCheckUtils]: 20: Hoare triple {62821#(and (= main_~z~0 0) (<= 999990 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {62822#(and (= main_~z~0 0) (<= 999989 main_~y~0))} is VALID [2022-04-28 03:53:01,073 INFO L290 TraceCheckUtils]: 21: Hoare triple {62822#(and (= main_~z~0 0) (<= 999989 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {62823#(and (= main_~z~0 0) (<= 999988 main_~y~0))} is VALID [2022-04-28 03:53:01,074 INFO L290 TraceCheckUtils]: 22: Hoare triple {62823#(and (= main_~z~0 0) (<= 999988 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {62824#(and (= main_~z~0 0) (<= 999987 main_~y~0))} is VALID [2022-04-28 03:53:01,074 INFO L290 TraceCheckUtils]: 23: Hoare triple {62824#(and (= main_~z~0 0) (<= 999987 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {62825#(and (= main_~z~0 0) (<= 999986 main_~y~0))} is VALID [2022-04-28 03:53:01,075 INFO L290 TraceCheckUtils]: 24: Hoare triple {62825#(and (= main_~z~0 0) (<= 999986 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {62826#(and (= main_~z~0 0) (<= 999985 main_~y~0))} is VALID [2022-04-28 03:53:01,075 INFO L290 TraceCheckUtils]: 25: Hoare triple {62826#(and (= main_~z~0 0) (<= 999985 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {62827#(and (= main_~z~0 0) (<= 999984 main_~y~0))} is VALID [2022-04-28 03:53:01,076 INFO L290 TraceCheckUtils]: 26: Hoare triple {62827#(and (= main_~z~0 0) (<= 999984 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {62828#(and (<= 999983 main_~y~0) (= main_~z~0 0))} is VALID [2022-04-28 03:53:01,076 INFO L290 TraceCheckUtils]: 27: Hoare triple {62828#(and (<= 999983 main_~y~0) (= main_~z~0 0))} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {62829#(and (= main_~z~0 0) (<= 999982 main_~y~0))} is VALID [2022-04-28 03:53:01,077 INFO L290 TraceCheckUtils]: 28: Hoare triple {62829#(and (= main_~z~0 0) (<= 999982 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {62830#(and (= main_~z~0 0) (<= 999981 main_~y~0))} is VALID [2022-04-28 03:53:01,077 INFO L290 TraceCheckUtils]: 29: Hoare triple {62830#(and (= main_~z~0 0) (<= 999981 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {62831#(and (= main_~z~0 0) (<= 999980 main_~y~0))} is VALID [2022-04-28 03:53:01,078 INFO L290 TraceCheckUtils]: 30: Hoare triple {62831#(and (= main_~z~0 0) (<= 999980 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {62832#(and (= main_~z~0 0) (<= 999979 main_~y~0))} is VALID [2022-04-28 03:53:01,078 INFO L290 TraceCheckUtils]: 31: Hoare triple {62832#(and (= main_~z~0 0) (<= 999979 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {62833#(and (= main_~z~0 0) (<= 999978 main_~y~0))} is VALID [2022-04-28 03:53:01,078 INFO L290 TraceCheckUtils]: 32: Hoare triple {62833#(and (= main_~z~0 0) (<= 999978 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {62834#(and (= main_~z~0 0) (<= 999977 main_~y~0))} is VALID [2022-04-28 03:53:01,079 INFO L290 TraceCheckUtils]: 33: Hoare triple {62834#(and (= main_~z~0 0) (<= 999977 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {62835#(and (<= 999976 main_~y~0) (= main_~z~0 0))} is VALID [2022-04-28 03:53:01,079 INFO L290 TraceCheckUtils]: 34: Hoare triple {62835#(and (<= 999976 main_~y~0) (= main_~z~0 0))} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {62836#(and (= main_~z~0 0) (<= 999975 main_~y~0))} is VALID [2022-04-28 03:53:01,080 INFO L290 TraceCheckUtils]: 35: Hoare triple {62836#(and (= main_~z~0 0) (<= 999975 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {62837#(and (= main_~z~0 0) (<= 999974 main_~y~0))} is VALID [2022-04-28 03:53:01,080 INFO L290 TraceCheckUtils]: 36: Hoare triple {62837#(and (= main_~z~0 0) (<= 999974 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {62838#(and (= main_~z~0 0) (<= 999973 main_~y~0))} is VALID [2022-04-28 03:53:01,081 INFO L290 TraceCheckUtils]: 37: Hoare triple {62838#(and (= main_~z~0 0) (<= 999973 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {62839#(and (= main_~z~0 0) (<= 999972 main_~y~0))} is VALID [2022-04-28 03:53:01,081 INFO L290 TraceCheckUtils]: 38: Hoare triple {62839#(and (= main_~z~0 0) (<= 999972 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {62840#(and (= main_~z~0 0) (<= 999971 main_~y~0))} is VALID [2022-04-28 03:53:01,082 INFO L290 TraceCheckUtils]: 39: Hoare triple {62840#(and (= main_~z~0 0) (<= 999971 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {62841#(and (= main_~z~0 0) (<= 999970 main_~y~0))} is VALID [2022-04-28 03:53:01,082 INFO L290 TraceCheckUtils]: 40: Hoare triple {62841#(and (= main_~z~0 0) (<= 999970 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {62842#(and (= main_~z~0 0) (<= 999969 main_~y~0))} is VALID [2022-04-28 03:53:01,083 INFO L290 TraceCheckUtils]: 41: Hoare triple {62842#(and (= main_~z~0 0) (<= 999969 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {62843#(and (<= 999968 main_~y~0) (= main_~z~0 0))} is VALID [2022-04-28 03:53:01,083 INFO L290 TraceCheckUtils]: 42: Hoare triple {62843#(and (<= 999968 main_~y~0) (= main_~z~0 0))} assume !(~y~0 > ~z~0); {62804#false} is VALID [2022-04-28 03:53:01,083 INFO L272 TraceCheckUtils]: 43: Hoare triple {62804#false} call __VERIFIER_assert((if ~x~0 == ~z~0 then 1 else 0)); {62804#false} is VALID [2022-04-28 03:53:01,083 INFO L290 TraceCheckUtils]: 44: Hoare triple {62804#false} ~cond := #in~cond; {62804#false} is VALID [2022-04-28 03:53:01,083 INFO L290 TraceCheckUtils]: 45: Hoare triple {62804#false} assume 0 == ~cond; {62804#false} is VALID [2022-04-28 03:53:01,083 INFO L290 TraceCheckUtils]: 46: Hoare triple {62804#false} assume !false; {62804#false} is VALID [2022-04-28 03:53:01,084 INFO L134 CoverageAnalysis]: Checked inductivity of 530 backedges. 0 proven. 530 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 03:53:01,084 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 03:53:01,084 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1653612305] [2022-04-28 03:53:01,084 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1653612305] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 03:53:01,084 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1989777719] [2022-04-28 03:53:01,084 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:53:01,084 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 03:53:01,084 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 03:53:01,087 INFO L229 MonitoredProcess]: Starting monitored process 46 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 03:53:01,087 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (46)] Waiting until timeout for monitored process [2022-04-28 03:53:01,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:53:01,141 INFO L263 TraceCheckSpWp]: Trace formula consists of 219 conjuncts, 39 conjunts are in the unsatisfiable core [2022-04-28 03:53:01,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:53:01,165 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 03:53:03,239 INFO L272 TraceCheckUtils]: 0: Hoare triple {62803#true} call ULTIMATE.init(); {62803#true} is VALID [2022-04-28 03:53:03,239 INFO L290 TraceCheckUtils]: 1: Hoare triple {62803#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(17, 2);call #Ultimate.allocInit(12, 3); {62803#true} is VALID [2022-04-28 03:53:03,240 INFO L290 TraceCheckUtils]: 2: Hoare triple {62803#true} assume true; {62803#true} is VALID [2022-04-28 03:53:03,240 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {62803#true} {62803#true} #52#return; {62803#true} is VALID [2022-04-28 03:53:03,240 INFO L272 TraceCheckUtils]: 4: Hoare triple {62803#true} call #t~ret9 := main(); {62803#true} is VALID [2022-04-28 03:53:03,240 INFO L290 TraceCheckUtils]: 5: Hoare triple {62803#true} ~x~0 := 0;~y~0 := 50000;~z~0 := 0;~x~0 := 0; {62863#(and (<= main_~z~0 0) (<= main_~x~0 0) (<= 50000 main_~y~0))} is VALID [2022-04-28 03:53:03,241 INFO L290 TraceCheckUtils]: 6: Hoare triple {62863#(and (<= main_~z~0 0) (<= main_~x~0 0) (<= 50000 main_~y~0))} [236] L11-2-->L18-1_primed: Formula: (let ((.cse0 (= |v_main_#t~post4_279| |v_main_#t~post4_278|))) (or (and (= v_main_~x~0_2850 v_main_~x~0_2849) .cse0) (and (< v_main_~x~0_2849 50001) (< v_main_~x~0_2850 v_main_~x~0_2849)) (and (= v_main_~x~0_2849 v_main_~x~0_2850) (<= 50000 v_main_~x~0_2850) .cse0))) InVars {main_~x~0=v_main_~x~0_2850, main_#t~post4=|v_main_#t~post4_279|} OutVars{main_~x~0=v_main_~x~0_2849, main_#t~post4=|v_main_#t~post4_278|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {62867#(and (<= main_~z~0 0) (< main_~x~0 50001) (<= 50000 main_~y~0))} is VALID [2022-04-28 03:53:03,241 INFO L290 TraceCheckUtils]: 7: Hoare triple {62867#(and (<= main_~z~0 0) (< main_~x~0 50001) (<= 50000 main_~y~0))} [237] L18-1_primed-->L11-2: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {62867#(and (<= main_~z~0 0) (< main_~x~0 50001) (<= 50000 main_~y~0))} is VALID [2022-04-28 03:53:03,242 INFO L290 TraceCheckUtils]: 8: Hoare triple {62867#(and (<= main_~z~0 0) (< main_~x~0 50001) (<= 50000 main_~y~0))} [238] L11-2-->L18-1_primed: Formula: (let ((.cse0 (<= 50000 v_main_~x~0_2852)) (.cse1 (= |v_main_#t~post6_312| |v_main_#t~post6_311|)) (.cse2 (= v_main_~y~0_3217 v_main_~y~0_3216)) (.cse3 (= v_main_~x~0_2852 v_main_~x~0_2851)) (.cse4 (= |v_main_#t~post5_312| |v_main_#t~post5_311|))) (or (and (< v_main_~x~0_2851 1000001) (= (+ v_main_~x~0_2852 v_main_~y~0_3216) (+ v_main_~x~0_2851 v_main_~y~0_3217)) (< v_main_~x~0_2852 v_main_~x~0_2851) .cse0) (and .cse1 .cse2 .cse3 .cse4) (and (or (not (< v_main_~x~0_2852 1000000)) (not .cse0)) .cse1 .cse2 .cse3 .cse4))) InVars {main_~y~0=v_main_~y~0_3217, main_#t~post5=|v_main_#t~post5_312|, main_~x~0=v_main_~x~0_2852, main_#t~post6=|v_main_#t~post6_312|} OutVars{main_~y~0=v_main_~y~0_3216, main_#t~post5=|v_main_#t~post5_311|, main_~x~0=v_main_~x~0_2851, main_#t~post6=|v_main_#t~post6_311|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {62874#(and (<= main_~z~0 0) (or (and (< main_~x~0 50001) (<= 50000 main_~y~0)) (and (< main_~x~0 (+ main_~y~0 1)) (< main_~x~0 1000001) (< 50000 main_~x~0))))} is VALID [2022-04-28 03:53:03,242 INFO L290 TraceCheckUtils]: 9: Hoare triple {62874#(and (<= main_~z~0 0) (or (and (< main_~x~0 50001) (<= 50000 main_~y~0)) (and (< main_~x~0 (+ main_~y~0 1)) (< main_~x~0 1000001) (< 50000 main_~x~0))))} [235] L18-1_primed-->L18-1: Formula: (not (< v_main_~x~0_11 1000000)) InVars {main_~x~0=v_main_~x~0_11} OutVars{main_~x~0=v_main_~x~0_11} AuxVars[] AssignedVars[] {62878#(and (<= main_~z~0 0) (< 999999 main_~y~0))} is VALID [2022-04-28 03:53:03,243 INFO L290 TraceCheckUtils]: 10: Hoare triple {62878#(and (<= main_~z~0 0) (< 999999 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {62882#(and (<= main_~z~0 0) (< 999998 main_~y~0))} is VALID [2022-04-28 03:53:03,243 INFO L290 TraceCheckUtils]: 11: Hoare triple {62882#(and (<= main_~z~0 0) (< 999998 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {62886#(and (<= main_~z~0 0) (< 999997 main_~y~0))} is VALID [2022-04-28 03:53:03,244 INFO L290 TraceCheckUtils]: 12: Hoare triple {62886#(and (<= main_~z~0 0) (< 999997 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {62890#(and (<= main_~z~0 0) (< 999996 main_~y~0))} is VALID [2022-04-28 03:53:03,244 INFO L290 TraceCheckUtils]: 13: Hoare triple {62890#(and (<= main_~z~0 0) (< 999996 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {62894#(and (<= main_~z~0 0) (< 999995 main_~y~0))} is VALID [2022-04-28 03:53:03,245 INFO L290 TraceCheckUtils]: 14: Hoare triple {62894#(and (<= main_~z~0 0) (< 999995 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {62898#(and (<= main_~z~0 0) (< 999994 main_~y~0))} is VALID [2022-04-28 03:53:03,245 INFO L290 TraceCheckUtils]: 15: Hoare triple {62898#(and (<= main_~z~0 0) (< 999994 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {62902#(and (<= main_~z~0 0) (< 999993 main_~y~0))} is VALID [2022-04-28 03:53:03,246 INFO L290 TraceCheckUtils]: 16: Hoare triple {62902#(and (<= main_~z~0 0) (< 999993 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {62906#(and (<= main_~z~0 0) (< 999992 main_~y~0))} is VALID [2022-04-28 03:53:03,246 INFO L290 TraceCheckUtils]: 17: Hoare triple {62906#(and (<= main_~z~0 0) (< 999992 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {62910#(and (<= main_~z~0 0) (< 999991 main_~y~0))} is VALID [2022-04-28 03:53:03,247 INFO L290 TraceCheckUtils]: 18: Hoare triple {62910#(and (<= main_~z~0 0) (< 999991 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {62914#(and (<= main_~z~0 0) (< 999990 main_~y~0))} is VALID [2022-04-28 03:53:03,247 INFO L290 TraceCheckUtils]: 19: Hoare triple {62914#(and (<= main_~z~0 0) (< 999990 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {62918#(and (<= main_~z~0 0) (< 999989 main_~y~0))} is VALID [2022-04-28 03:53:03,248 INFO L290 TraceCheckUtils]: 20: Hoare triple {62918#(and (<= main_~z~0 0) (< 999989 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {62922#(and (<= main_~z~0 0) (< 999988 main_~y~0))} is VALID [2022-04-28 03:53:03,248 INFO L290 TraceCheckUtils]: 21: Hoare triple {62922#(and (<= main_~z~0 0) (< 999988 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {62926#(and (<= main_~z~0 0) (< 999987 main_~y~0))} is VALID [2022-04-28 03:53:03,249 INFO L290 TraceCheckUtils]: 22: Hoare triple {62926#(and (<= main_~z~0 0) (< 999987 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {62930#(and (<= main_~z~0 0) (< 999986 main_~y~0))} is VALID [2022-04-28 03:53:03,249 INFO L290 TraceCheckUtils]: 23: Hoare triple {62930#(and (<= main_~z~0 0) (< 999986 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {62934#(and (<= main_~z~0 0) (< 999985 main_~y~0))} is VALID [2022-04-28 03:53:03,250 INFO L290 TraceCheckUtils]: 24: Hoare triple {62934#(and (<= main_~z~0 0) (< 999985 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {62938#(and (<= main_~z~0 0) (< 999984 main_~y~0))} is VALID [2022-04-28 03:53:03,250 INFO L290 TraceCheckUtils]: 25: Hoare triple {62938#(and (<= main_~z~0 0) (< 999984 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {62942#(and (<= main_~z~0 0) (< 999983 main_~y~0))} is VALID [2022-04-28 03:53:03,251 INFO L290 TraceCheckUtils]: 26: Hoare triple {62942#(and (<= main_~z~0 0) (< 999983 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {62946#(and (<= main_~z~0 0) (< 999982 main_~y~0))} is VALID [2022-04-28 03:53:03,251 INFO L290 TraceCheckUtils]: 27: Hoare triple {62946#(and (<= main_~z~0 0) (< 999982 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {62950#(and (<= main_~z~0 0) (< 999981 main_~y~0))} is VALID [2022-04-28 03:53:03,252 INFO L290 TraceCheckUtils]: 28: Hoare triple {62950#(and (<= main_~z~0 0) (< 999981 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {62954#(and (<= main_~z~0 0) (< 999980 main_~y~0))} is VALID [2022-04-28 03:53:03,252 INFO L290 TraceCheckUtils]: 29: Hoare triple {62954#(and (<= main_~z~0 0) (< 999980 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {62958#(and (<= main_~z~0 0) (< 999979 main_~y~0))} is VALID [2022-04-28 03:53:03,253 INFO L290 TraceCheckUtils]: 30: Hoare triple {62958#(and (<= main_~z~0 0) (< 999979 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {62962#(and (<= main_~z~0 0) (< 999978 main_~y~0))} is VALID [2022-04-28 03:53:03,253 INFO L290 TraceCheckUtils]: 31: Hoare triple {62962#(and (<= main_~z~0 0) (< 999978 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {62966#(and (<= main_~z~0 0) (< 999977 main_~y~0))} is VALID [2022-04-28 03:53:03,254 INFO L290 TraceCheckUtils]: 32: Hoare triple {62966#(and (<= main_~z~0 0) (< 999977 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {62970#(and (<= main_~z~0 0) (< 999976 main_~y~0))} is VALID [2022-04-28 03:53:03,254 INFO L290 TraceCheckUtils]: 33: Hoare triple {62970#(and (<= main_~z~0 0) (< 999976 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {62974#(and (<= main_~z~0 0) (< 999975 main_~y~0))} is VALID [2022-04-28 03:53:03,254 INFO L290 TraceCheckUtils]: 34: Hoare triple {62974#(and (<= main_~z~0 0) (< 999975 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {62978#(and (<= main_~z~0 0) (< 999974 main_~y~0))} is VALID [2022-04-28 03:53:03,255 INFO L290 TraceCheckUtils]: 35: Hoare triple {62978#(and (<= main_~z~0 0) (< 999974 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {62982#(and (<= main_~z~0 0) (< 999973 main_~y~0))} is VALID [2022-04-28 03:53:03,255 INFO L290 TraceCheckUtils]: 36: Hoare triple {62982#(and (<= main_~z~0 0) (< 999973 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {62986#(and (<= main_~z~0 0) (< 999972 main_~y~0))} is VALID [2022-04-28 03:53:03,256 INFO L290 TraceCheckUtils]: 37: Hoare triple {62986#(and (<= main_~z~0 0) (< 999972 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {62990#(and (<= main_~z~0 0) (< 999971 main_~y~0))} is VALID [2022-04-28 03:53:03,256 INFO L290 TraceCheckUtils]: 38: Hoare triple {62990#(and (<= main_~z~0 0) (< 999971 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {62994#(and (<= main_~z~0 0) (< 999970 main_~y~0))} is VALID [2022-04-28 03:53:03,257 INFO L290 TraceCheckUtils]: 39: Hoare triple {62994#(and (<= main_~z~0 0) (< 999970 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {62998#(and (<= main_~z~0 0) (< 999969 main_~y~0))} is VALID [2022-04-28 03:53:03,258 INFO L290 TraceCheckUtils]: 40: Hoare triple {62998#(and (<= main_~z~0 0) (< 999969 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {63002#(and (<= main_~z~0 0) (< 999968 main_~y~0))} is VALID [2022-04-28 03:53:03,258 INFO L290 TraceCheckUtils]: 41: Hoare triple {63002#(and (<= main_~z~0 0) (< 999968 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {63006#(and (<= main_~z~0 0) (< 999967 main_~y~0))} is VALID [2022-04-28 03:53:03,259 INFO L290 TraceCheckUtils]: 42: Hoare triple {63006#(and (<= main_~z~0 0) (< 999967 main_~y~0))} assume !(~y~0 > ~z~0); {62804#false} is VALID [2022-04-28 03:53:03,259 INFO L272 TraceCheckUtils]: 43: Hoare triple {62804#false} call __VERIFIER_assert((if ~x~0 == ~z~0 then 1 else 0)); {62804#false} is VALID [2022-04-28 03:53:03,259 INFO L290 TraceCheckUtils]: 44: Hoare triple {62804#false} ~cond := #in~cond; {62804#false} is VALID [2022-04-28 03:53:03,259 INFO L290 TraceCheckUtils]: 45: Hoare triple {62804#false} assume 0 == ~cond; {62804#false} is VALID [2022-04-28 03:53:03,259 INFO L290 TraceCheckUtils]: 46: Hoare triple {62804#false} assume !false; {62804#false} is VALID [2022-04-28 03:53:03,259 INFO L134 CoverageAnalysis]: Checked inductivity of 530 backedges. 0 proven. 530 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 03:53:03,259 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 03:53:06,465 INFO L290 TraceCheckUtils]: 46: Hoare triple {62804#false} assume !false; {62804#false} is VALID [2022-04-28 03:53:06,465 INFO L290 TraceCheckUtils]: 45: Hoare triple {62804#false} assume 0 == ~cond; {62804#false} is VALID [2022-04-28 03:53:06,465 INFO L290 TraceCheckUtils]: 44: Hoare triple {62804#false} ~cond := #in~cond; {62804#false} is VALID [2022-04-28 03:53:06,465 INFO L272 TraceCheckUtils]: 43: Hoare triple {62804#false} call __VERIFIER_assert((if ~x~0 == ~z~0 then 1 else 0)); {62804#false} is VALID [2022-04-28 03:53:06,465 INFO L290 TraceCheckUtils]: 42: Hoare triple {63034#(< main_~z~0 main_~y~0)} assume !(~y~0 > ~z~0); {62804#false} is VALID [2022-04-28 03:53:06,466 INFO L290 TraceCheckUtils]: 41: Hoare triple {63038#(< (+ main_~z~0 1) main_~y~0)} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {63034#(< main_~z~0 main_~y~0)} is VALID [2022-04-28 03:53:06,466 INFO L290 TraceCheckUtils]: 40: Hoare triple {63042#(< (+ main_~z~0 2) main_~y~0)} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {63038#(< (+ main_~z~0 1) main_~y~0)} is VALID [2022-04-28 03:53:06,467 INFO L290 TraceCheckUtils]: 39: Hoare triple {63046#(< (+ main_~z~0 3) main_~y~0)} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {63042#(< (+ main_~z~0 2) main_~y~0)} is VALID [2022-04-28 03:53:06,467 INFO L290 TraceCheckUtils]: 38: Hoare triple {63050#(< (+ main_~z~0 4) main_~y~0)} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {63046#(< (+ main_~z~0 3) main_~y~0)} is VALID [2022-04-28 03:53:06,467 INFO L290 TraceCheckUtils]: 37: Hoare triple {63054#(< (+ 5 main_~z~0) main_~y~0)} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {63050#(< (+ main_~z~0 4) main_~y~0)} is VALID [2022-04-28 03:53:06,468 INFO L290 TraceCheckUtils]: 36: Hoare triple {63058#(< (+ main_~z~0 6) main_~y~0)} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {63054#(< (+ 5 main_~z~0) main_~y~0)} is VALID [2022-04-28 03:53:06,468 INFO L290 TraceCheckUtils]: 35: Hoare triple {63062#(< (+ 7 main_~z~0) main_~y~0)} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {63058#(< (+ main_~z~0 6) main_~y~0)} is VALID [2022-04-28 03:53:06,469 INFO L290 TraceCheckUtils]: 34: Hoare triple {63066#(< (+ main_~z~0 8) main_~y~0)} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {63062#(< (+ 7 main_~z~0) main_~y~0)} is VALID [2022-04-28 03:53:06,469 INFO L290 TraceCheckUtils]: 33: Hoare triple {63070#(< (+ main_~z~0 9) main_~y~0)} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {63066#(< (+ main_~z~0 8) main_~y~0)} is VALID [2022-04-28 03:53:06,470 INFO L290 TraceCheckUtils]: 32: Hoare triple {63074#(< (+ main_~z~0 10) main_~y~0)} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {63070#(< (+ main_~z~0 9) main_~y~0)} is VALID [2022-04-28 03:53:06,470 INFO L290 TraceCheckUtils]: 31: Hoare triple {63078#(< (+ main_~z~0 11) main_~y~0)} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {63074#(< (+ main_~z~0 10) main_~y~0)} is VALID [2022-04-28 03:53:06,471 INFO L290 TraceCheckUtils]: 30: Hoare triple {63082#(< (+ main_~z~0 12) main_~y~0)} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {63078#(< (+ main_~z~0 11) main_~y~0)} is VALID [2022-04-28 03:53:06,471 INFO L290 TraceCheckUtils]: 29: Hoare triple {63086#(< (+ main_~z~0 13) main_~y~0)} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {63082#(< (+ main_~z~0 12) main_~y~0)} is VALID [2022-04-28 03:53:06,472 INFO L290 TraceCheckUtils]: 28: Hoare triple {63090#(< (+ main_~z~0 14) main_~y~0)} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {63086#(< (+ main_~z~0 13) main_~y~0)} is VALID [2022-04-28 03:53:06,472 INFO L290 TraceCheckUtils]: 27: Hoare triple {63094#(< (+ main_~z~0 15) main_~y~0)} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {63090#(< (+ main_~z~0 14) main_~y~0)} is VALID [2022-04-28 03:53:06,473 INFO L290 TraceCheckUtils]: 26: Hoare triple {63098#(< (+ main_~z~0 16) main_~y~0)} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {63094#(< (+ main_~z~0 15) main_~y~0)} is VALID [2022-04-28 03:53:06,473 INFO L290 TraceCheckUtils]: 25: Hoare triple {63102#(< (+ main_~z~0 17) main_~y~0)} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {63098#(< (+ main_~z~0 16) main_~y~0)} is VALID [2022-04-28 03:53:06,473 INFO L290 TraceCheckUtils]: 24: Hoare triple {63106#(< (+ main_~z~0 18) main_~y~0)} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {63102#(< (+ main_~z~0 17) main_~y~0)} is VALID [2022-04-28 03:53:06,474 INFO L290 TraceCheckUtils]: 23: Hoare triple {63110#(< (+ 19 main_~z~0) main_~y~0)} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {63106#(< (+ main_~z~0 18) main_~y~0)} is VALID [2022-04-28 03:53:06,474 INFO L290 TraceCheckUtils]: 22: Hoare triple {63114#(< (+ main_~z~0 20) main_~y~0)} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {63110#(< (+ 19 main_~z~0) main_~y~0)} is VALID [2022-04-28 03:53:06,475 INFO L290 TraceCheckUtils]: 21: Hoare triple {63118#(< (+ main_~z~0 21) main_~y~0)} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {63114#(< (+ main_~z~0 20) main_~y~0)} is VALID [2022-04-28 03:53:06,475 INFO L290 TraceCheckUtils]: 20: Hoare triple {63122#(< (+ main_~z~0 22) main_~y~0)} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {63118#(< (+ main_~z~0 21) main_~y~0)} is VALID [2022-04-28 03:53:06,476 INFO L290 TraceCheckUtils]: 19: Hoare triple {63126#(< (+ 23 main_~z~0) main_~y~0)} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {63122#(< (+ main_~z~0 22) main_~y~0)} is VALID [2022-04-28 03:53:06,476 INFO L290 TraceCheckUtils]: 18: Hoare triple {63130#(< (+ main_~z~0 24) main_~y~0)} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {63126#(< (+ 23 main_~z~0) main_~y~0)} is VALID [2022-04-28 03:53:06,477 INFO L290 TraceCheckUtils]: 17: Hoare triple {63134#(< (+ main_~z~0 25) main_~y~0)} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {63130#(< (+ main_~z~0 24) main_~y~0)} is VALID [2022-04-28 03:53:06,477 INFO L290 TraceCheckUtils]: 16: Hoare triple {63138#(< (+ main_~z~0 26) main_~y~0)} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {63134#(< (+ main_~z~0 25) main_~y~0)} is VALID [2022-04-28 03:53:06,478 INFO L290 TraceCheckUtils]: 15: Hoare triple {63142#(< (+ main_~z~0 27) main_~y~0)} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {63138#(< (+ main_~z~0 26) main_~y~0)} is VALID [2022-04-28 03:53:06,478 INFO L290 TraceCheckUtils]: 14: Hoare triple {63146#(< (+ main_~z~0 28) main_~y~0)} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {63142#(< (+ main_~z~0 27) main_~y~0)} is VALID [2022-04-28 03:53:06,479 INFO L290 TraceCheckUtils]: 13: Hoare triple {63150#(< (+ 29 main_~z~0) main_~y~0)} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {63146#(< (+ main_~z~0 28) main_~y~0)} is VALID [2022-04-28 03:53:06,479 INFO L290 TraceCheckUtils]: 12: Hoare triple {63154#(< (+ 30 main_~z~0) main_~y~0)} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {63150#(< (+ 29 main_~z~0) main_~y~0)} is VALID [2022-04-28 03:53:06,479 INFO L290 TraceCheckUtils]: 11: Hoare triple {63158#(< (+ main_~z~0 31) main_~y~0)} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {63154#(< (+ 30 main_~z~0) main_~y~0)} is VALID [2022-04-28 03:53:06,480 INFO L290 TraceCheckUtils]: 10: Hoare triple {63162#(< (+ 32 main_~z~0) main_~y~0)} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {63158#(< (+ main_~z~0 31) main_~y~0)} is VALID [2022-04-28 03:53:06,480 INFO L290 TraceCheckUtils]: 9: Hoare triple {63166#(or (< (+ 32 main_~z~0) main_~y~0) (< main_~x~0 1000000))} [235] L18-1_primed-->L18-1: Formula: (not (< v_main_~x~0_11 1000000)) InVars {main_~x~0=v_main_~x~0_11} OutVars{main_~x~0=v_main_~x~0_11} AuxVars[] AssignedVars[] {63162#(< (+ 32 main_~z~0) main_~y~0)} is VALID [2022-04-28 03:53:06,481 INFO L290 TraceCheckUtils]: 8: Hoare triple {63170#(and (or (< (+ 32 main_~z~0) main_~y~0) (< main_~x~0 1000000)) (or (< (+ main_~z~0 main_~x~0) (+ 999968 main_~y~0)) (<= 1000000 main_~x~0) (not (<= 50000 main_~x~0))))} [238] L11-2-->L18-1_primed: Formula: (let ((.cse0 (<= 50000 v_main_~x~0_2852)) (.cse1 (= |v_main_#t~post6_312| |v_main_#t~post6_311|)) (.cse2 (= v_main_~y~0_3217 v_main_~y~0_3216)) (.cse3 (= v_main_~x~0_2852 v_main_~x~0_2851)) (.cse4 (= |v_main_#t~post5_312| |v_main_#t~post5_311|))) (or (and (< v_main_~x~0_2851 1000001) (= (+ v_main_~x~0_2852 v_main_~y~0_3216) (+ v_main_~x~0_2851 v_main_~y~0_3217)) (< v_main_~x~0_2852 v_main_~x~0_2851) .cse0) (and .cse1 .cse2 .cse3 .cse4) (and (or (not (< v_main_~x~0_2852 1000000)) (not .cse0)) .cse1 .cse2 .cse3 .cse4))) InVars {main_~y~0=v_main_~y~0_3217, main_#t~post5=|v_main_#t~post5_312|, main_~x~0=v_main_~x~0_2852, main_#t~post6=|v_main_#t~post6_312|} OutVars{main_~y~0=v_main_~y~0_3216, main_#t~post5=|v_main_#t~post5_311|, main_~x~0=v_main_~x~0_2851, main_#t~post6=|v_main_#t~post6_311|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {63166#(or (< (+ 32 main_~z~0) main_~y~0) (< main_~x~0 1000000))} is VALID [2022-04-28 03:53:06,482 INFO L290 TraceCheckUtils]: 7: Hoare triple {63170#(and (or (< (+ 32 main_~z~0) main_~y~0) (< main_~x~0 1000000)) (or (< (+ main_~z~0 main_~x~0) (+ 999968 main_~y~0)) (<= 1000000 main_~x~0) (not (<= 50000 main_~x~0))))} [237] L18-1_primed-->L11-2: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {63170#(and (or (< (+ 32 main_~z~0) main_~y~0) (< main_~x~0 1000000)) (or (< (+ main_~z~0 main_~x~0) (+ 999968 main_~y~0)) (<= 1000000 main_~x~0) (not (<= 50000 main_~x~0))))} is VALID [2022-04-28 03:53:06,482 INFO L290 TraceCheckUtils]: 6: Hoare triple {63177#(and (or (< (+ 32 main_~z~0) main_~y~0) (< main_~x~0 1000000)) (<= main_~z~0 (+ 949967 main_~y~0)) (or (< (+ main_~z~0 main_~x~0) (+ 999968 main_~y~0)) (<= 1000000 main_~x~0)))} [236] L11-2-->L18-1_primed: Formula: (let ((.cse0 (= |v_main_#t~post4_279| |v_main_#t~post4_278|))) (or (and (= v_main_~x~0_2850 v_main_~x~0_2849) .cse0) (and (< v_main_~x~0_2849 50001) (< v_main_~x~0_2850 v_main_~x~0_2849)) (and (= v_main_~x~0_2849 v_main_~x~0_2850) (<= 50000 v_main_~x~0_2850) .cse0))) InVars {main_~x~0=v_main_~x~0_2850, main_#t~post4=|v_main_#t~post4_279|} OutVars{main_~x~0=v_main_~x~0_2849, main_#t~post4=|v_main_#t~post4_278|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {63170#(and (or (< (+ 32 main_~z~0) main_~y~0) (< main_~x~0 1000000)) (or (< (+ main_~z~0 main_~x~0) (+ 999968 main_~y~0)) (<= 1000000 main_~x~0) (not (<= 50000 main_~x~0))))} is VALID [2022-04-28 03:53:06,483 INFO L290 TraceCheckUtils]: 5: Hoare triple {62803#true} ~x~0 := 0;~y~0 := 50000;~z~0 := 0;~x~0 := 0; {63177#(and (or (< (+ 32 main_~z~0) main_~y~0) (< main_~x~0 1000000)) (<= main_~z~0 (+ 949967 main_~y~0)) (or (< (+ main_~z~0 main_~x~0) (+ 999968 main_~y~0)) (<= 1000000 main_~x~0)))} is VALID [2022-04-28 03:53:06,483 INFO L272 TraceCheckUtils]: 4: Hoare triple {62803#true} call #t~ret9 := main(); {62803#true} is VALID [2022-04-28 03:53:06,483 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {62803#true} {62803#true} #52#return; {62803#true} is VALID [2022-04-28 03:53:06,483 INFO L290 TraceCheckUtils]: 2: Hoare triple {62803#true} assume true; {62803#true} is VALID [2022-04-28 03:53:06,483 INFO L290 TraceCheckUtils]: 1: Hoare triple {62803#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(17, 2);call #Ultimate.allocInit(12, 3); {62803#true} is VALID [2022-04-28 03:53:06,483 INFO L272 TraceCheckUtils]: 0: Hoare triple {62803#true} call ULTIMATE.init(); {62803#true} is VALID [2022-04-28 03:53:06,483 INFO L134 CoverageAnalysis]: Checked inductivity of 530 backedges. 0 proven. 530 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 03:53:06,483 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1989777719] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 03:53:06,483 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 03:53:06,483 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [39, 38, 38] total 111 [2022-04-28 03:53:11,386 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 03:53:11,387 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1624328244] [2022-04-28 03:53:11,387 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1624328244] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 03:53:11,387 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 03:53:11,387 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [97] imperfect sequences [] total 97 [2022-04-28 03:53:11,387 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1182437602] [2022-04-28 03:53:11,387 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 03:53:11,387 INFO L78 Accepts]: Start accepts. Automaton has has 97 states, 97 states have (on average 1.6494845360824741) internal successors, (160), 96 states have internal predecessors, (160), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 164 [2022-04-28 03:53:11,387 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 03:53:11,387 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 97 states, 97 states have (on average 1.6494845360824741) internal successors, (160), 96 states have internal predecessors, (160), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:53:11,508 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 164 edges. 164 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 03:53:11,508 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 97 states [2022-04-28 03:53:11,508 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 03:53:11,508 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 97 interpolants. [2022-04-28 03:53:11,510 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7348, Invalid=22064, Unknown=0, NotChecked=0, Total=29412 [2022-04-28 03:53:11,510 INFO L87 Difference]: Start difference. First operand 275 states and 279 transitions. Second operand has 97 states, 97 states have (on average 1.6494845360824741) internal successors, (160), 96 states have internal predecessors, (160), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:53:28,978 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:53:28,978 INFO L93 Difference]: Finished difference Result 426 states and 435 transitions. [2022-04-28 03:53:28,978 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 64 states. [2022-04-28 03:53:28,978 INFO L78 Accepts]: Start accepts. Automaton has has 97 states, 97 states have (on average 1.6494845360824741) internal successors, (160), 96 states have internal predecessors, (160), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 164 [2022-04-28 03:53:28,979 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 03:53:28,979 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 97 states, 97 states have (on average 1.6494845360824741) internal successors, (160), 96 states have internal predecessors, (160), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:53:28,979 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 151 transitions. [2022-04-28 03:53:28,979 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 97 states, 97 states have (on average 1.6494845360824741) internal successors, (160), 96 states have internal predecessors, (160), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:53:28,980 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 151 transitions. [2022-04-28 03:53:28,980 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 64 states and 151 transitions. [2022-04-28 03:53:29,105 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 151 edges. 151 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 03:53:29,108 INFO L225 Difference]: With dead ends: 426 [2022-04-28 03:53:29,108 INFO L226 Difference]: Without dead ends: 277 [2022-04-28 03:53:29,111 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 320 GetRequests, 87 SyntacticMatches, 2 SemanticMatches, 231 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11924 ImplicationChecksByTransitivity, 12.6s TimeCoverageRelationStatistics Valid=9916, Invalid=44140, Unknown=0, NotChecked=0, Total=54056 [2022-04-28 03:53:29,112 INFO L413 NwaCegarLoop]: 13 mSDtfsCounter, 71 mSDsluCounter, 332 mSDsCounter, 0 mSdLazyCounter, 8650 mSolverCounterSat, 66 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 71 SdHoareTripleChecker+Valid, 345 SdHoareTripleChecker+Invalid, 8716 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 66 IncrementalHoareTripleChecker+Valid, 8650 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6.8s IncrementalHoareTripleChecker+Time [2022-04-28 03:53:29,112 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [71 Valid, 345 Invalid, 8716 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [66 Valid, 8650 Invalid, 0 Unknown, 0 Unchecked, 6.8s Time] [2022-04-28 03:53:29,112 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 277 states. [2022-04-28 03:53:29,854 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 277 to 277. [2022-04-28 03:53:29,854 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 03:53:29,854 INFO L82 GeneralOperation]: Start isEquivalent. First operand 277 states. Second operand has 277 states, 272 states have (on average 1.0183823529411764) internal successors, (277), 272 states have internal predecessors, (277), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:53:29,855 INFO L74 IsIncluded]: Start isIncluded. First operand 277 states. Second operand has 277 states, 272 states have (on average 1.0183823529411764) internal successors, (277), 272 states have internal predecessors, (277), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:53:29,855 INFO L87 Difference]: Start difference. First operand 277 states. Second operand has 277 states, 272 states have (on average 1.0183823529411764) internal successors, (277), 272 states have internal predecessors, (277), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:53:29,857 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:53:29,858 INFO L93 Difference]: Finished difference Result 277 states and 281 transitions. [2022-04-28 03:53:29,858 INFO L276 IsEmpty]: Start isEmpty. Operand 277 states and 281 transitions. [2022-04-28 03:53:29,858 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:53:29,858 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:53:29,858 INFO L74 IsIncluded]: Start isIncluded. First operand has 277 states, 272 states have (on average 1.0183823529411764) internal successors, (277), 272 states have internal predecessors, (277), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 277 states. [2022-04-28 03:53:29,858 INFO L87 Difference]: Start difference. First operand has 277 states, 272 states have (on average 1.0183823529411764) internal successors, (277), 272 states have internal predecessors, (277), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 277 states. [2022-04-28 03:53:29,861 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:53:29,861 INFO L93 Difference]: Finished difference Result 277 states and 281 transitions. [2022-04-28 03:53:29,861 INFO L276 IsEmpty]: Start isEmpty. Operand 277 states and 281 transitions. [2022-04-28 03:53:29,861 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:53:29,861 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:53:29,861 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 03:53:29,861 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 03:53:29,861 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 277 states, 272 states have (on average 1.0183823529411764) internal successors, (277), 272 states have internal predecessors, (277), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:53:29,864 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 277 states to 277 states and 281 transitions. [2022-04-28 03:53:29,864 INFO L78 Accepts]: Start accepts. Automaton has 277 states and 281 transitions. Word has length 164 [2022-04-28 03:53:29,865 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 03:53:29,865 INFO L495 AbstractCegarLoop]: Abstraction has 277 states and 281 transitions. [2022-04-28 03:53:29,865 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 97 states, 97 states have (on average 1.6494845360824741) internal successors, (160), 96 states have internal predecessors, (160), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:53:29,865 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 277 states and 281 transitions. [2022-04-28 03:53:30,156 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 281 edges. 281 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 03:53:30,156 INFO L276 IsEmpty]: Start isEmpty. Operand 277 states and 281 transitions. [2022-04-28 03:53:30,156 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 167 [2022-04-28 03:53:30,156 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 03:53:30,156 INFO L195 NwaCegarLoop]: trace histogram [61, 60, 32, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 03:53:30,174 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (46)] Forceful destruction successful, exit code 0 [2022-04-28 03:53:30,357 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 46 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable47 [2022-04-28 03:53:30,357 INFO L420 AbstractCegarLoop]: === Iteration 49 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 03:53:30,357 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 03:53:30,357 INFO L85 PathProgramCache]: Analyzing trace with hash 1655006822, now seen corresponding path program 46 times [2022-04-28 03:53:30,357 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 03:53:30,358 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1894385562] [2022-04-28 03:53:30,498 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 1 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 03:53:34,638 WARN L977 rdanLoopAcceleration]: Unable to prove correctness of quantifier elimination. [2022-04-28 03:53:34,751 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={1=1, 2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 03:53:34,752 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-28 03:53:34,754 INFO L85 PathProgramCache]: Analyzing trace with hash -52910591, now seen corresponding path program 1 times [2022-04-28 03:53:34,754 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 03:53:34,754 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1901409710] [2022-04-28 03:53:34,754 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:53:34,754 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 03:53:34,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:53:35,507 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 03:53:35,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:53:35,514 INFO L290 TraceCheckUtils]: 0: Hoare triple {65379#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(17, 2);call #Ultimate.allocInit(12, 3); {65341#true} is VALID [2022-04-28 03:53:35,514 INFO L290 TraceCheckUtils]: 1: Hoare triple {65341#true} assume true; {65341#true} is VALID [2022-04-28 03:53:35,514 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {65341#true} {65341#true} #52#return; {65341#true} is VALID [2022-04-28 03:53:35,514 INFO L272 TraceCheckUtils]: 0: Hoare triple {65341#true} call ULTIMATE.init(); {65379#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 03:53:35,514 INFO L290 TraceCheckUtils]: 1: Hoare triple {65379#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(17, 2);call #Ultimate.allocInit(12, 3); {65341#true} is VALID [2022-04-28 03:53:35,514 INFO L290 TraceCheckUtils]: 2: Hoare triple {65341#true} assume true; {65341#true} is VALID [2022-04-28 03:53:35,514 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {65341#true} {65341#true} #52#return; {65341#true} is VALID [2022-04-28 03:53:35,515 INFO L272 TraceCheckUtils]: 4: Hoare triple {65341#true} call #t~ret9 := main(); {65341#true} is VALID [2022-04-28 03:53:35,515 INFO L290 TraceCheckUtils]: 5: Hoare triple {65341#true} ~x~0 := 0;~y~0 := 50000;~z~0 := 0;~x~0 := 0; {65346#(and (= main_~z~0 0) (<= 50000 main_~y~0))} is VALID [2022-04-28 03:53:35,515 INFO L290 TraceCheckUtils]: 6: Hoare triple {65346#(and (= main_~z~0 0) (<= 50000 main_~y~0))} [240] L11-2-->L18-1_primed: Formula: (let ((.cse0 (= v_main_~x~0_2959 v_main_~x~0_2958)) (.cse1 (= |v_main_#t~post4_286| |v_main_#t~post4_285|))) (or (and .cse0 .cse1 (not (< v_main_~x~0_2959 50000))) (and (< v_main_~x~0_2958 50001) (< v_main_~x~0_2959 v_main_~x~0_2958)) (and .cse0 .cse1))) InVars {main_~x~0=v_main_~x~0_2959, main_#t~post4=|v_main_#t~post4_286|} OutVars{main_~x~0=v_main_~x~0_2958, main_#t~post4=|v_main_#t~post4_285|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {65346#(and (= main_~z~0 0) (<= 50000 main_~y~0))} is VALID [2022-04-28 03:53:35,516 INFO L290 TraceCheckUtils]: 7: Hoare triple {65346#(and (= main_~z~0 0) (<= 50000 main_~y~0))} [241] L18-1_primed-->L11-2: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {65346#(and (= main_~z~0 0) (<= 50000 main_~y~0))} is VALID [2022-04-28 03:53:35,516 INFO L290 TraceCheckUtils]: 8: Hoare triple {65346#(and (= main_~z~0 0) (<= 50000 main_~y~0))} [242] L11-2-->L18-1_primed: Formula: (let ((.cse0 (= v_main_~y~0_3349 v_main_~y~0_3348)) (.cse1 (= |v_main_#t~post5_319| |v_main_#t~post5_318|)) (.cse2 (= |v_main_#t~post6_319| |v_main_#t~post6_318|)) (.cse3 (= v_main_~x~0_2961 v_main_~x~0_2960)) (.cse4 (<= 50000 v_main_~x~0_2961))) (or (and .cse0 .cse1 .cse2 .cse3 (or (not .cse4) (not (< v_main_~x~0_2961 1000000)))) (and .cse0 .cse1 .cse2 .cse3) (let ((.cse5 (+ v_main_~x~0_2961 v_main_~y~0_3348))) (and .cse4 (< v_main_~y~0_3349 v_main_~y~0_3348) (= .cse5 (+ v_main_~x~0_2960 v_main_~y~0_3349)) (< .cse5 (+ 1000001 v_main_~y~0_3349)))))) InVars {main_~y~0=v_main_~y~0_3349, main_#t~post5=|v_main_#t~post5_319|, main_~x~0=v_main_~x~0_2961, main_#t~post6=|v_main_#t~post6_319|} OutVars{main_~y~0=v_main_~y~0_3348, main_#t~post5=|v_main_#t~post5_318|, main_~x~0=v_main_~x~0_2960, main_#t~post6=|v_main_#t~post6_318|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {65346#(and (= main_~z~0 0) (<= 50000 main_~y~0))} is VALID [2022-04-28 03:53:35,517 INFO L290 TraceCheckUtils]: 9: Hoare triple {65346#(and (= main_~z~0 0) (<= 50000 main_~y~0))} [239] L18-1_primed-->L18-1: Formula: (not (< v_main_~x~0_11 1000000)) InVars {main_~x~0=v_main_~x~0_11} OutVars{main_~x~0=v_main_~x~0_11} AuxVars[] AssignedVars[] {65346#(and (= main_~z~0 0) (<= 50000 main_~y~0))} is VALID [2022-04-28 03:53:35,517 INFO L290 TraceCheckUtils]: 10: Hoare triple {65346#(and (= main_~z~0 0) (<= 50000 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {65347#(and (= main_~z~0 0) (<= 49999 main_~y~0))} is VALID [2022-04-28 03:53:35,518 INFO L290 TraceCheckUtils]: 11: Hoare triple {65347#(and (= main_~z~0 0) (<= 49999 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {65348#(and (<= 49998 main_~y~0) (= main_~z~0 0))} is VALID [2022-04-28 03:53:35,518 INFO L290 TraceCheckUtils]: 12: Hoare triple {65348#(and (<= 49998 main_~y~0) (= main_~z~0 0))} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {65349#(and (= main_~z~0 0) (<= 49997 main_~y~0))} is VALID [2022-04-28 03:53:35,519 INFO L290 TraceCheckUtils]: 13: Hoare triple {65349#(and (= main_~z~0 0) (<= 49997 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {65350#(and (= main_~z~0 0) (<= 49996 main_~y~0))} is VALID [2022-04-28 03:53:35,519 INFO L290 TraceCheckUtils]: 14: Hoare triple {65350#(and (= main_~z~0 0) (<= 49996 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {65351#(and (= main_~z~0 0) (<= 49995 main_~y~0))} is VALID [2022-04-28 03:53:35,520 INFO L290 TraceCheckUtils]: 15: Hoare triple {65351#(and (= main_~z~0 0) (<= 49995 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {65352#(and (= main_~z~0 0) (<= 49994 main_~y~0))} is VALID [2022-04-28 03:53:35,520 INFO L290 TraceCheckUtils]: 16: Hoare triple {65352#(and (= main_~z~0 0) (<= 49994 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {65353#(and (= main_~z~0 0) (<= 49993 main_~y~0))} is VALID [2022-04-28 03:53:35,521 INFO L290 TraceCheckUtils]: 17: Hoare triple {65353#(and (= main_~z~0 0) (<= 49993 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {65354#(and (= main_~z~0 0) (<= 49992 main_~y~0))} is VALID [2022-04-28 03:53:35,521 INFO L290 TraceCheckUtils]: 18: Hoare triple {65354#(and (= main_~z~0 0) (<= 49992 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {65355#(and (= main_~z~0 0) (<= 49991 main_~y~0))} is VALID [2022-04-28 03:53:35,522 INFO L290 TraceCheckUtils]: 19: Hoare triple {65355#(and (= main_~z~0 0) (<= 49991 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {65356#(and (<= 49990 main_~y~0) (= main_~z~0 0))} is VALID [2022-04-28 03:53:35,522 INFO L290 TraceCheckUtils]: 20: Hoare triple {65356#(and (<= 49990 main_~y~0) (= main_~z~0 0))} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {65357#(and (= main_~z~0 0) (<= 49989 main_~y~0))} is VALID [2022-04-28 03:53:35,522 INFO L290 TraceCheckUtils]: 21: Hoare triple {65357#(and (= main_~z~0 0) (<= 49989 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {65358#(and (= main_~z~0 0) (<= 49988 main_~y~0))} is VALID [2022-04-28 03:53:35,523 INFO L290 TraceCheckUtils]: 22: Hoare triple {65358#(and (= main_~z~0 0) (<= 49988 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {65359#(and (= main_~z~0 0) (<= 49987 main_~y~0))} is VALID [2022-04-28 03:53:35,523 INFO L290 TraceCheckUtils]: 23: Hoare triple {65359#(and (= main_~z~0 0) (<= 49987 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {65360#(and (= main_~z~0 0) (<= 49986 main_~y~0))} is VALID [2022-04-28 03:53:35,524 INFO L290 TraceCheckUtils]: 24: Hoare triple {65360#(and (= main_~z~0 0) (<= 49986 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {65361#(and (= main_~z~0 0) (<= 49985 main_~y~0))} is VALID [2022-04-28 03:53:35,524 INFO L290 TraceCheckUtils]: 25: Hoare triple {65361#(and (= main_~z~0 0) (<= 49985 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {65362#(and (= main_~z~0 0) (<= 49984 main_~y~0))} is VALID [2022-04-28 03:53:35,525 INFO L290 TraceCheckUtils]: 26: Hoare triple {65362#(and (= main_~z~0 0) (<= 49984 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {65363#(and (= main_~z~0 0) (<= 49983 main_~y~0))} is VALID [2022-04-28 03:53:35,525 INFO L290 TraceCheckUtils]: 27: Hoare triple {65363#(and (= main_~z~0 0) (<= 49983 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {65364#(and (= main_~z~0 0) (<= 49982 main_~y~0))} is VALID [2022-04-28 03:53:35,526 INFO L290 TraceCheckUtils]: 28: Hoare triple {65364#(and (= main_~z~0 0) (<= 49982 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {65365#(and (<= 49981 main_~y~0) (= main_~z~0 0))} is VALID [2022-04-28 03:53:35,526 INFO L290 TraceCheckUtils]: 29: Hoare triple {65365#(and (<= 49981 main_~y~0) (= main_~z~0 0))} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {65366#(and (= main_~z~0 0) (<= 49980 main_~y~0))} is VALID [2022-04-28 03:53:35,527 INFO L290 TraceCheckUtils]: 30: Hoare triple {65366#(and (= main_~z~0 0) (<= 49980 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {65367#(and (= main_~z~0 0) (<= 49979 main_~y~0))} is VALID [2022-04-28 03:53:35,527 INFO L290 TraceCheckUtils]: 31: Hoare triple {65367#(and (= main_~z~0 0) (<= 49979 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {65368#(and (= main_~z~0 0) (<= 49978 main_~y~0))} is VALID [2022-04-28 03:53:35,528 INFO L290 TraceCheckUtils]: 32: Hoare triple {65368#(and (= main_~z~0 0) (<= 49978 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {65369#(and (= main_~z~0 0) (<= 49977 main_~y~0))} is VALID [2022-04-28 03:53:35,528 INFO L290 TraceCheckUtils]: 33: Hoare triple {65369#(and (= main_~z~0 0) (<= 49977 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {65370#(and (= main_~z~0 0) (<= 49976 main_~y~0))} is VALID [2022-04-28 03:53:35,529 INFO L290 TraceCheckUtils]: 34: Hoare triple {65370#(and (= main_~z~0 0) (<= 49976 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {65371#(and (= main_~z~0 0) (<= 49975 main_~y~0))} is VALID [2022-04-28 03:53:35,529 INFO L290 TraceCheckUtils]: 35: Hoare triple {65371#(and (= main_~z~0 0) (<= 49975 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {65372#(and (= main_~z~0 0) (<= 49974 main_~y~0))} is VALID [2022-04-28 03:53:35,530 INFO L290 TraceCheckUtils]: 36: Hoare triple {65372#(and (= main_~z~0 0) (<= 49974 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {65373#(and (= main_~z~0 0) (<= 49973 main_~y~0))} is VALID [2022-04-28 03:53:35,530 INFO L290 TraceCheckUtils]: 37: Hoare triple {65373#(and (= main_~z~0 0) (<= 49973 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {65374#(and (= main_~z~0 0) (<= 49972 main_~y~0))} is VALID [2022-04-28 03:53:35,531 INFO L290 TraceCheckUtils]: 38: Hoare triple {65374#(and (= main_~z~0 0) (<= 49972 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {65375#(and (= main_~z~0 0) (<= 49971 main_~y~0))} is VALID [2022-04-28 03:53:35,531 INFO L290 TraceCheckUtils]: 39: Hoare triple {65375#(and (= main_~z~0 0) (<= 49971 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {65376#(and (= main_~z~0 0) (<= 49970 main_~y~0))} is VALID [2022-04-28 03:53:35,531 INFO L290 TraceCheckUtils]: 40: Hoare triple {65376#(and (= main_~z~0 0) (<= 49970 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {65377#(and (= main_~z~0 0) (<= 49969 main_~y~0))} is VALID [2022-04-28 03:53:35,532 INFO L290 TraceCheckUtils]: 41: Hoare triple {65377#(and (= main_~z~0 0) (<= 49969 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {65378#(and (= main_~z~0 0) (<= 49968 main_~y~0))} is VALID [2022-04-28 03:53:35,532 INFO L290 TraceCheckUtils]: 42: Hoare triple {65378#(and (= main_~z~0 0) (<= 49968 main_~y~0))} assume !(~y~0 > ~z~0); {65342#false} is VALID [2022-04-28 03:53:35,532 INFO L272 TraceCheckUtils]: 43: Hoare triple {65342#false} call __VERIFIER_assert((if ~x~0 == ~z~0 then 1 else 0)); {65342#false} is VALID [2022-04-28 03:53:35,532 INFO L290 TraceCheckUtils]: 44: Hoare triple {65342#false} ~cond := #in~cond; {65342#false} is VALID [2022-04-28 03:53:35,532 INFO L290 TraceCheckUtils]: 45: Hoare triple {65342#false} assume 0 == ~cond; {65342#false} is VALID [2022-04-28 03:53:35,533 INFO L290 TraceCheckUtils]: 46: Hoare triple {65342#false} assume !false; {65342#false} is VALID [2022-04-28 03:53:35,533 INFO L134 CoverageAnalysis]: Checked inductivity of 530 backedges. 0 proven. 528 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-04-28 03:53:35,533 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 03:53:35,533 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1901409710] [2022-04-28 03:53:35,533 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1901409710] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 03:53:35,533 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1394627497] [2022-04-28 03:53:35,533 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:53:35,533 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 03:53:35,533 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 03:53:35,534 INFO L229 MonitoredProcess]: Starting monitored process 47 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 03:53:35,535 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (47)] Waiting until timeout for monitored process [2022-04-28 03:53:35,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:53:35,589 INFO L263 TraceCheckSpWp]: Trace formula consists of 219 conjuncts, 36 conjunts are in the unsatisfiable core [2022-04-28 03:53:35,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:53:35,610 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 03:53:37,381 INFO L272 TraceCheckUtils]: 0: Hoare triple {65341#true} call ULTIMATE.init(); {65341#true} is VALID [2022-04-28 03:53:37,382 INFO L290 TraceCheckUtils]: 1: Hoare triple {65341#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(17, 2);call #Ultimate.allocInit(12, 3); {65341#true} is VALID [2022-04-28 03:53:37,382 INFO L290 TraceCheckUtils]: 2: Hoare triple {65341#true} assume true; {65341#true} is VALID [2022-04-28 03:53:37,382 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {65341#true} {65341#true} #52#return; {65341#true} is VALID [2022-04-28 03:53:37,382 INFO L272 TraceCheckUtils]: 4: Hoare triple {65341#true} call #t~ret9 := main(); {65341#true} is VALID [2022-04-28 03:53:37,382 INFO L290 TraceCheckUtils]: 5: Hoare triple {65341#true} ~x~0 := 0;~y~0 := 50000;~z~0 := 0;~x~0 := 0; {65398#(and (<= main_~z~0 0) (<= 50000 main_~y~0))} is VALID [2022-04-28 03:53:37,383 INFO L290 TraceCheckUtils]: 6: Hoare triple {65398#(and (<= main_~z~0 0) (<= 50000 main_~y~0))} [240] L11-2-->L18-1_primed: Formula: (let ((.cse0 (= v_main_~x~0_2959 v_main_~x~0_2958)) (.cse1 (= |v_main_#t~post4_286| |v_main_#t~post4_285|))) (or (and .cse0 .cse1 (not (< v_main_~x~0_2959 50000))) (and (< v_main_~x~0_2958 50001) (< v_main_~x~0_2959 v_main_~x~0_2958)) (and .cse0 .cse1))) InVars {main_~x~0=v_main_~x~0_2959, main_#t~post4=|v_main_#t~post4_286|} OutVars{main_~x~0=v_main_~x~0_2958, main_#t~post4=|v_main_#t~post4_285|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {65398#(and (<= main_~z~0 0) (<= 50000 main_~y~0))} is VALID [2022-04-28 03:53:37,383 INFO L290 TraceCheckUtils]: 7: Hoare triple {65398#(and (<= main_~z~0 0) (<= 50000 main_~y~0))} [241] L18-1_primed-->L11-2: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {65398#(and (<= main_~z~0 0) (<= 50000 main_~y~0))} is VALID [2022-04-28 03:53:37,384 INFO L290 TraceCheckUtils]: 8: Hoare triple {65398#(and (<= main_~z~0 0) (<= 50000 main_~y~0))} [242] L11-2-->L18-1_primed: Formula: (let ((.cse0 (= v_main_~y~0_3349 v_main_~y~0_3348)) (.cse1 (= |v_main_#t~post5_319| |v_main_#t~post5_318|)) (.cse2 (= |v_main_#t~post6_319| |v_main_#t~post6_318|)) (.cse3 (= v_main_~x~0_2961 v_main_~x~0_2960)) (.cse4 (<= 50000 v_main_~x~0_2961))) (or (and .cse0 .cse1 .cse2 .cse3 (or (not .cse4) (not (< v_main_~x~0_2961 1000000)))) (and .cse0 .cse1 .cse2 .cse3) (let ((.cse5 (+ v_main_~x~0_2961 v_main_~y~0_3348))) (and .cse4 (< v_main_~y~0_3349 v_main_~y~0_3348) (= .cse5 (+ v_main_~x~0_2960 v_main_~y~0_3349)) (< .cse5 (+ 1000001 v_main_~y~0_3349)))))) InVars {main_~y~0=v_main_~y~0_3349, main_#t~post5=|v_main_#t~post5_319|, main_~x~0=v_main_~x~0_2961, main_#t~post6=|v_main_#t~post6_319|} OutVars{main_~y~0=v_main_~y~0_3348, main_#t~post5=|v_main_#t~post5_318|, main_~x~0=v_main_~x~0_2960, main_#t~post6=|v_main_#t~post6_318|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {65398#(and (<= main_~z~0 0) (<= 50000 main_~y~0))} is VALID [2022-04-28 03:53:37,384 INFO L290 TraceCheckUtils]: 9: Hoare triple {65398#(and (<= main_~z~0 0) (<= 50000 main_~y~0))} [239] L18-1_primed-->L18-1: Formula: (not (< v_main_~x~0_11 1000000)) InVars {main_~x~0=v_main_~x~0_11} OutVars{main_~x~0=v_main_~x~0_11} AuxVars[] AssignedVars[] {65398#(and (<= main_~z~0 0) (<= 50000 main_~y~0))} is VALID [2022-04-28 03:53:37,385 INFO L290 TraceCheckUtils]: 10: Hoare triple {65398#(and (<= main_~z~0 0) (<= 50000 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {65414#(and (<= main_~z~0 0) (<= 49999 main_~y~0))} is VALID [2022-04-28 03:53:37,385 INFO L290 TraceCheckUtils]: 11: Hoare triple {65414#(and (<= main_~z~0 0) (<= 49999 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {65418#(and (<= main_~z~0 0) (<= 49998 main_~y~0))} is VALID [2022-04-28 03:53:37,386 INFO L290 TraceCheckUtils]: 12: Hoare triple {65418#(and (<= main_~z~0 0) (<= 49998 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {65422#(and (<= main_~z~0 0) (<= 49997 main_~y~0))} is VALID [2022-04-28 03:53:37,386 INFO L290 TraceCheckUtils]: 13: Hoare triple {65422#(and (<= main_~z~0 0) (<= 49997 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {65426#(and (<= main_~z~0 0) (<= 49996 main_~y~0))} is VALID [2022-04-28 03:53:37,387 INFO L290 TraceCheckUtils]: 14: Hoare triple {65426#(and (<= main_~z~0 0) (<= 49996 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {65430#(and (<= main_~z~0 0) (<= 49995 main_~y~0))} is VALID [2022-04-28 03:53:37,387 INFO L290 TraceCheckUtils]: 15: Hoare triple {65430#(and (<= main_~z~0 0) (<= 49995 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {65434#(and (<= main_~z~0 0) (<= 49994 main_~y~0))} is VALID [2022-04-28 03:53:37,387 INFO L290 TraceCheckUtils]: 16: Hoare triple {65434#(and (<= main_~z~0 0) (<= 49994 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {65438#(and (<= main_~z~0 0) (<= 49993 main_~y~0))} is VALID [2022-04-28 03:53:37,388 INFO L290 TraceCheckUtils]: 17: Hoare triple {65438#(and (<= main_~z~0 0) (<= 49993 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {65442#(and (<= main_~z~0 0) (<= 49992 main_~y~0))} is VALID [2022-04-28 03:53:37,388 INFO L290 TraceCheckUtils]: 18: Hoare triple {65442#(and (<= main_~z~0 0) (<= 49992 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {65446#(and (<= main_~z~0 0) (<= 49991 main_~y~0))} is VALID [2022-04-28 03:53:37,389 INFO L290 TraceCheckUtils]: 19: Hoare triple {65446#(and (<= main_~z~0 0) (<= 49991 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {65450#(and (<= main_~z~0 0) (<= 49990 main_~y~0))} is VALID [2022-04-28 03:53:37,389 INFO L290 TraceCheckUtils]: 20: Hoare triple {65450#(and (<= main_~z~0 0) (<= 49990 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {65454#(and (<= main_~z~0 0) (<= 49989 main_~y~0))} is VALID [2022-04-28 03:53:37,390 INFO L290 TraceCheckUtils]: 21: Hoare triple {65454#(and (<= main_~z~0 0) (<= 49989 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {65458#(and (<= main_~z~0 0) (<= 49988 main_~y~0))} is VALID [2022-04-28 03:53:37,390 INFO L290 TraceCheckUtils]: 22: Hoare triple {65458#(and (<= main_~z~0 0) (<= 49988 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {65462#(and (<= main_~z~0 0) (<= 49987 main_~y~0))} is VALID [2022-04-28 03:53:37,391 INFO L290 TraceCheckUtils]: 23: Hoare triple {65462#(and (<= main_~z~0 0) (<= 49987 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {65466#(and (<= main_~z~0 0) (<= 49986 main_~y~0))} is VALID [2022-04-28 03:53:37,391 INFO L290 TraceCheckUtils]: 24: Hoare triple {65466#(and (<= main_~z~0 0) (<= 49986 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {65470#(and (<= main_~z~0 0) (<= 49985 main_~y~0))} is VALID [2022-04-28 03:53:37,392 INFO L290 TraceCheckUtils]: 25: Hoare triple {65470#(and (<= main_~z~0 0) (<= 49985 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {65474#(and (<= main_~z~0 0) (<= 49984 main_~y~0))} is VALID [2022-04-28 03:53:37,392 INFO L290 TraceCheckUtils]: 26: Hoare triple {65474#(and (<= main_~z~0 0) (<= 49984 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {65478#(and (<= main_~z~0 0) (<= 49983 main_~y~0))} is VALID [2022-04-28 03:53:37,393 INFO L290 TraceCheckUtils]: 27: Hoare triple {65478#(and (<= main_~z~0 0) (<= 49983 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {65482#(and (<= main_~z~0 0) (<= 49982 main_~y~0))} is VALID [2022-04-28 03:53:37,393 INFO L290 TraceCheckUtils]: 28: Hoare triple {65482#(and (<= main_~z~0 0) (<= 49982 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {65486#(and (<= main_~z~0 0) (<= 49981 main_~y~0))} is VALID [2022-04-28 03:53:37,394 INFO L290 TraceCheckUtils]: 29: Hoare triple {65486#(and (<= main_~z~0 0) (<= 49981 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {65490#(and (<= main_~z~0 0) (<= 49980 main_~y~0))} is VALID [2022-04-28 03:53:37,394 INFO L290 TraceCheckUtils]: 30: Hoare triple {65490#(and (<= main_~z~0 0) (<= 49980 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {65494#(and (<= main_~z~0 0) (<= 49979 main_~y~0))} is VALID [2022-04-28 03:53:37,395 INFO L290 TraceCheckUtils]: 31: Hoare triple {65494#(and (<= main_~z~0 0) (<= 49979 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {65498#(and (<= main_~z~0 0) (<= 49978 main_~y~0))} is VALID [2022-04-28 03:53:37,395 INFO L290 TraceCheckUtils]: 32: Hoare triple {65498#(and (<= main_~z~0 0) (<= 49978 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {65502#(and (<= main_~z~0 0) (<= 49977 main_~y~0))} is VALID [2022-04-28 03:53:37,396 INFO L290 TraceCheckUtils]: 33: Hoare triple {65502#(and (<= main_~z~0 0) (<= 49977 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {65506#(and (<= main_~z~0 0) (<= 49976 main_~y~0))} is VALID [2022-04-28 03:53:37,396 INFO L290 TraceCheckUtils]: 34: Hoare triple {65506#(and (<= main_~z~0 0) (<= 49976 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {65510#(and (<= main_~z~0 0) (<= 49975 main_~y~0))} is VALID [2022-04-28 03:53:37,397 INFO L290 TraceCheckUtils]: 35: Hoare triple {65510#(and (<= main_~z~0 0) (<= 49975 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {65514#(and (<= main_~z~0 0) (<= 49974 main_~y~0))} is VALID [2022-04-28 03:53:37,397 INFO L290 TraceCheckUtils]: 36: Hoare triple {65514#(and (<= main_~z~0 0) (<= 49974 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {65518#(and (<= main_~z~0 0) (<= 49973 main_~y~0))} is VALID [2022-04-28 03:53:37,398 INFO L290 TraceCheckUtils]: 37: Hoare triple {65518#(and (<= main_~z~0 0) (<= 49973 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {65522#(and (<= main_~z~0 0) (<= 49972 main_~y~0))} is VALID [2022-04-28 03:53:37,398 INFO L290 TraceCheckUtils]: 38: Hoare triple {65522#(and (<= main_~z~0 0) (<= 49972 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {65526#(and (<= main_~z~0 0) (<= 49971 main_~y~0))} is VALID [2022-04-28 03:53:37,399 INFO L290 TraceCheckUtils]: 39: Hoare triple {65526#(and (<= main_~z~0 0) (<= 49971 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {65530#(and (<= main_~z~0 0) (<= 49970 main_~y~0))} is VALID [2022-04-28 03:53:37,399 INFO L290 TraceCheckUtils]: 40: Hoare triple {65530#(and (<= main_~z~0 0) (<= 49970 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {65534#(and (<= main_~z~0 0) (<= 49969 main_~y~0))} is VALID [2022-04-28 03:53:37,399 INFO L290 TraceCheckUtils]: 41: Hoare triple {65534#(and (<= main_~z~0 0) (<= 49969 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {65538#(and (<= main_~z~0 0) (<= 49968 main_~y~0))} is VALID [2022-04-28 03:53:37,400 INFO L290 TraceCheckUtils]: 42: Hoare triple {65538#(and (<= main_~z~0 0) (<= 49968 main_~y~0))} assume !(~y~0 > ~z~0); {65342#false} is VALID [2022-04-28 03:53:37,400 INFO L272 TraceCheckUtils]: 43: Hoare triple {65342#false} call __VERIFIER_assert((if ~x~0 == ~z~0 then 1 else 0)); {65342#false} is VALID [2022-04-28 03:53:37,400 INFO L290 TraceCheckUtils]: 44: Hoare triple {65342#false} ~cond := #in~cond; {65342#false} is VALID [2022-04-28 03:53:37,400 INFO L290 TraceCheckUtils]: 45: Hoare triple {65342#false} assume 0 == ~cond; {65342#false} is VALID [2022-04-28 03:53:37,400 INFO L290 TraceCheckUtils]: 46: Hoare triple {65342#false} assume !false; {65342#false} is VALID [2022-04-28 03:53:37,400 INFO L134 CoverageAnalysis]: Checked inductivity of 530 backedges. 0 proven. 528 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-04-28 03:53:37,400 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 03:53:39,955 INFO L290 TraceCheckUtils]: 46: Hoare triple {65342#false} assume !false; {65342#false} is VALID [2022-04-28 03:53:39,955 INFO L290 TraceCheckUtils]: 45: Hoare triple {65342#false} assume 0 == ~cond; {65342#false} is VALID [2022-04-28 03:53:39,955 INFO L290 TraceCheckUtils]: 44: Hoare triple {65342#false} ~cond := #in~cond; {65342#false} is VALID [2022-04-28 03:53:39,955 INFO L272 TraceCheckUtils]: 43: Hoare triple {65342#false} call __VERIFIER_assert((if ~x~0 == ~z~0 then 1 else 0)); {65342#false} is VALID [2022-04-28 03:53:39,956 INFO L290 TraceCheckUtils]: 42: Hoare triple {65566#(< main_~z~0 main_~y~0)} assume !(~y~0 > ~z~0); {65342#false} is VALID [2022-04-28 03:53:39,956 INFO L290 TraceCheckUtils]: 41: Hoare triple {65570#(< (+ main_~z~0 1) main_~y~0)} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {65566#(< main_~z~0 main_~y~0)} is VALID [2022-04-28 03:53:39,957 INFO L290 TraceCheckUtils]: 40: Hoare triple {65574#(< (+ main_~z~0 2) main_~y~0)} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {65570#(< (+ main_~z~0 1) main_~y~0)} is VALID [2022-04-28 03:53:39,957 INFO L290 TraceCheckUtils]: 39: Hoare triple {65578#(< (+ main_~z~0 3) main_~y~0)} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {65574#(< (+ main_~z~0 2) main_~y~0)} is VALID [2022-04-28 03:53:39,958 INFO L290 TraceCheckUtils]: 38: Hoare triple {65582#(< (+ main_~z~0 4) main_~y~0)} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {65578#(< (+ main_~z~0 3) main_~y~0)} is VALID [2022-04-28 03:53:39,958 INFO L290 TraceCheckUtils]: 37: Hoare triple {65586#(< (+ 5 main_~z~0) main_~y~0)} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {65582#(< (+ main_~z~0 4) main_~y~0)} is VALID [2022-04-28 03:53:39,959 INFO L290 TraceCheckUtils]: 36: Hoare triple {65590#(< (+ main_~z~0 6) main_~y~0)} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {65586#(< (+ 5 main_~z~0) main_~y~0)} is VALID [2022-04-28 03:53:39,959 INFO L290 TraceCheckUtils]: 35: Hoare triple {65594#(< (+ 7 main_~z~0) main_~y~0)} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {65590#(< (+ main_~z~0 6) main_~y~0)} is VALID [2022-04-28 03:53:39,960 INFO L290 TraceCheckUtils]: 34: Hoare triple {65598#(< (+ main_~z~0 8) main_~y~0)} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {65594#(< (+ 7 main_~z~0) main_~y~0)} is VALID [2022-04-28 03:53:39,960 INFO L290 TraceCheckUtils]: 33: Hoare triple {65602#(< (+ main_~z~0 9) main_~y~0)} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {65598#(< (+ main_~z~0 8) main_~y~0)} is VALID [2022-04-28 03:53:39,960 INFO L290 TraceCheckUtils]: 32: Hoare triple {65606#(< (+ main_~z~0 10) main_~y~0)} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {65602#(< (+ main_~z~0 9) main_~y~0)} is VALID [2022-04-28 03:53:39,961 INFO L290 TraceCheckUtils]: 31: Hoare triple {65610#(< (+ main_~z~0 11) main_~y~0)} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {65606#(< (+ main_~z~0 10) main_~y~0)} is VALID [2022-04-28 03:53:39,961 INFO L290 TraceCheckUtils]: 30: Hoare triple {65614#(< (+ main_~z~0 12) main_~y~0)} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {65610#(< (+ main_~z~0 11) main_~y~0)} is VALID [2022-04-28 03:53:39,962 INFO L290 TraceCheckUtils]: 29: Hoare triple {65618#(< (+ main_~z~0 13) main_~y~0)} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {65614#(< (+ main_~z~0 12) main_~y~0)} is VALID [2022-04-28 03:53:39,962 INFO L290 TraceCheckUtils]: 28: Hoare triple {65622#(< (+ main_~z~0 14) main_~y~0)} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {65618#(< (+ main_~z~0 13) main_~y~0)} is VALID [2022-04-28 03:53:39,963 INFO L290 TraceCheckUtils]: 27: Hoare triple {65626#(< (+ main_~z~0 15) main_~y~0)} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {65622#(< (+ main_~z~0 14) main_~y~0)} is VALID [2022-04-28 03:53:39,963 INFO L290 TraceCheckUtils]: 26: Hoare triple {65630#(< (+ main_~z~0 16) main_~y~0)} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {65626#(< (+ main_~z~0 15) main_~y~0)} is VALID [2022-04-28 03:53:39,964 INFO L290 TraceCheckUtils]: 25: Hoare triple {65634#(< (+ main_~z~0 17) main_~y~0)} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {65630#(< (+ main_~z~0 16) main_~y~0)} is VALID [2022-04-28 03:53:39,964 INFO L290 TraceCheckUtils]: 24: Hoare triple {65638#(< (+ main_~z~0 18) main_~y~0)} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {65634#(< (+ main_~z~0 17) main_~y~0)} is VALID [2022-04-28 03:53:39,965 INFO L290 TraceCheckUtils]: 23: Hoare triple {65642#(< (+ 19 main_~z~0) main_~y~0)} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {65638#(< (+ main_~z~0 18) main_~y~0)} is VALID [2022-04-28 03:53:39,965 INFO L290 TraceCheckUtils]: 22: Hoare triple {65646#(< (+ main_~z~0 20) main_~y~0)} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {65642#(< (+ 19 main_~z~0) main_~y~0)} is VALID [2022-04-28 03:53:39,965 INFO L290 TraceCheckUtils]: 21: Hoare triple {65650#(< (+ main_~z~0 21) main_~y~0)} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {65646#(< (+ main_~z~0 20) main_~y~0)} is VALID [2022-04-28 03:53:39,966 INFO L290 TraceCheckUtils]: 20: Hoare triple {65654#(< (+ main_~z~0 22) main_~y~0)} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {65650#(< (+ main_~z~0 21) main_~y~0)} is VALID [2022-04-28 03:53:39,966 INFO L290 TraceCheckUtils]: 19: Hoare triple {65658#(< (+ 23 main_~z~0) main_~y~0)} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {65654#(< (+ main_~z~0 22) main_~y~0)} is VALID [2022-04-28 03:53:39,967 INFO L290 TraceCheckUtils]: 18: Hoare triple {65662#(< (+ main_~z~0 24) main_~y~0)} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {65658#(< (+ 23 main_~z~0) main_~y~0)} is VALID [2022-04-28 03:53:39,967 INFO L290 TraceCheckUtils]: 17: Hoare triple {65666#(< (+ main_~z~0 25) main_~y~0)} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {65662#(< (+ main_~z~0 24) main_~y~0)} is VALID [2022-04-28 03:53:39,968 INFO L290 TraceCheckUtils]: 16: Hoare triple {65670#(< (+ main_~z~0 26) main_~y~0)} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {65666#(< (+ main_~z~0 25) main_~y~0)} is VALID [2022-04-28 03:53:39,968 INFO L290 TraceCheckUtils]: 15: Hoare triple {65674#(< (+ main_~z~0 27) main_~y~0)} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {65670#(< (+ main_~z~0 26) main_~y~0)} is VALID [2022-04-28 03:53:39,969 INFO L290 TraceCheckUtils]: 14: Hoare triple {65678#(< (+ main_~z~0 28) main_~y~0)} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {65674#(< (+ main_~z~0 27) main_~y~0)} is VALID [2022-04-28 03:53:39,969 INFO L290 TraceCheckUtils]: 13: Hoare triple {65682#(< (+ 29 main_~z~0) main_~y~0)} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {65678#(< (+ main_~z~0 28) main_~y~0)} is VALID [2022-04-28 03:53:39,970 INFO L290 TraceCheckUtils]: 12: Hoare triple {65686#(< (+ 30 main_~z~0) main_~y~0)} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {65682#(< (+ 29 main_~z~0) main_~y~0)} is VALID [2022-04-28 03:53:39,970 INFO L290 TraceCheckUtils]: 11: Hoare triple {65690#(< (+ main_~z~0 31) main_~y~0)} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {65686#(< (+ 30 main_~z~0) main_~y~0)} is VALID [2022-04-28 03:53:39,971 INFO L290 TraceCheckUtils]: 10: Hoare triple {65694#(< (+ 32 main_~z~0) main_~y~0)} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {65690#(< (+ main_~z~0 31) main_~y~0)} is VALID [2022-04-28 03:53:39,971 INFO L290 TraceCheckUtils]: 9: Hoare triple {65694#(< (+ 32 main_~z~0) main_~y~0)} [239] L18-1_primed-->L18-1: Formula: (not (< v_main_~x~0_11 1000000)) InVars {main_~x~0=v_main_~x~0_11} OutVars{main_~x~0=v_main_~x~0_11} AuxVars[] AssignedVars[] {65694#(< (+ 32 main_~z~0) main_~y~0)} is VALID [2022-04-28 03:53:39,972 INFO L290 TraceCheckUtils]: 8: Hoare triple {65694#(< (+ 32 main_~z~0) main_~y~0)} [242] L11-2-->L18-1_primed: Formula: (let ((.cse0 (= v_main_~y~0_3349 v_main_~y~0_3348)) (.cse1 (= |v_main_#t~post5_319| |v_main_#t~post5_318|)) (.cse2 (= |v_main_#t~post6_319| |v_main_#t~post6_318|)) (.cse3 (= v_main_~x~0_2961 v_main_~x~0_2960)) (.cse4 (<= 50000 v_main_~x~0_2961))) (or (and .cse0 .cse1 .cse2 .cse3 (or (not .cse4) (not (< v_main_~x~0_2961 1000000)))) (and .cse0 .cse1 .cse2 .cse3) (let ((.cse5 (+ v_main_~x~0_2961 v_main_~y~0_3348))) (and .cse4 (< v_main_~y~0_3349 v_main_~y~0_3348) (= .cse5 (+ v_main_~x~0_2960 v_main_~y~0_3349)) (< .cse5 (+ 1000001 v_main_~y~0_3349)))))) InVars {main_~y~0=v_main_~y~0_3349, main_#t~post5=|v_main_#t~post5_319|, main_~x~0=v_main_~x~0_2961, main_#t~post6=|v_main_#t~post6_319|} OutVars{main_~y~0=v_main_~y~0_3348, main_#t~post5=|v_main_#t~post5_318|, main_~x~0=v_main_~x~0_2960, main_#t~post6=|v_main_#t~post6_318|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {65694#(< (+ 32 main_~z~0) main_~y~0)} is VALID [2022-04-28 03:53:39,972 INFO L290 TraceCheckUtils]: 7: Hoare triple {65694#(< (+ 32 main_~z~0) main_~y~0)} [241] L18-1_primed-->L11-2: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {65694#(< (+ 32 main_~z~0) main_~y~0)} is VALID [2022-04-28 03:53:39,972 INFO L290 TraceCheckUtils]: 6: Hoare triple {65694#(< (+ 32 main_~z~0) main_~y~0)} [240] L11-2-->L18-1_primed: Formula: (let ((.cse0 (= v_main_~x~0_2959 v_main_~x~0_2958)) (.cse1 (= |v_main_#t~post4_286| |v_main_#t~post4_285|))) (or (and .cse0 .cse1 (not (< v_main_~x~0_2959 50000))) (and (< v_main_~x~0_2958 50001) (< v_main_~x~0_2959 v_main_~x~0_2958)) (and .cse0 .cse1))) InVars {main_~x~0=v_main_~x~0_2959, main_#t~post4=|v_main_#t~post4_286|} OutVars{main_~x~0=v_main_~x~0_2958, main_#t~post4=|v_main_#t~post4_285|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {65694#(< (+ 32 main_~z~0) main_~y~0)} is VALID [2022-04-28 03:53:39,973 INFO L290 TraceCheckUtils]: 5: Hoare triple {65341#true} ~x~0 := 0;~y~0 := 50000;~z~0 := 0;~x~0 := 0; {65694#(< (+ 32 main_~z~0) main_~y~0)} is VALID [2022-04-28 03:53:39,973 INFO L272 TraceCheckUtils]: 4: Hoare triple {65341#true} call #t~ret9 := main(); {65341#true} is VALID [2022-04-28 03:53:39,973 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {65341#true} {65341#true} #52#return; {65341#true} is VALID [2022-04-28 03:53:39,973 INFO L290 TraceCheckUtils]: 2: Hoare triple {65341#true} assume true; {65341#true} is VALID [2022-04-28 03:53:39,973 INFO L290 TraceCheckUtils]: 1: Hoare triple {65341#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(17, 2);call #Ultimate.allocInit(12, 3); {65341#true} is VALID [2022-04-28 03:53:39,973 INFO L272 TraceCheckUtils]: 0: Hoare triple {65341#true} call ULTIMATE.init(); {65341#true} is VALID [2022-04-28 03:53:39,973 INFO L134 CoverageAnalysis]: Checked inductivity of 530 backedges. 0 proven. 528 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-04-28 03:53:39,973 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1394627497] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 03:53:39,973 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 03:53:39,973 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [36, 35, 35] total 102 [2022-04-28 03:53:43,084 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 03:53:43,084 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1894385562] [2022-04-28 03:53:43,084 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1894385562] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 03:53:43,084 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 03:53:43,084 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [98] imperfect sequences [] total 98 [2022-04-28 03:53:43,084 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1270938331] [2022-04-28 03:53:43,084 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 03:53:43,085 INFO L78 Accepts]: Start accepts. Automaton has has 98 states, 98 states have (on average 1.653061224489796) internal successors, (162), 97 states have internal predecessors, (162), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 166 [2022-04-28 03:53:43,085 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 03:53:43,085 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 98 states, 98 states have (on average 1.653061224489796) internal successors, (162), 97 states have internal predecessors, (162), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:53:43,205 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 166 edges. 166 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 03:53:43,206 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 98 states [2022-04-28 03:53:43,206 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 03:53:43,206 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 98 interpolants. [2022-04-28 03:53:43,208 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10847, Invalid=15885, Unknown=0, NotChecked=0, Total=26732 [2022-04-28 03:53:43,208 INFO L87 Difference]: Start difference. First operand 277 states and 281 transitions. Second operand has 98 states, 98 states have (on average 1.653061224489796) internal successors, (162), 97 states have internal predecessors, (162), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:54:00,245 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:54:00,245 INFO L93 Difference]: Finished difference Result 441 states and 463 transitions. [2022-04-28 03:54:00,245 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 98 states. [2022-04-28 03:54:00,245 INFO L78 Accepts]: Start accepts. Automaton has has 98 states, 98 states have (on average 1.653061224489796) internal successors, (162), 97 states have internal predecessors, (162), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 166 [2022-04-28 03:54:00,246 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 03:54:00,246 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 98 states, 98 states have (on average 1.653061224489796) internal successors, (162), 97 states have internal predecessors, (162), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:54:00,247 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 198 transitions. [2022-04-28 03:54:00,247 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 98 states, 98 states have (on average 1.653061224489796) internal successors, (162), 97 states have internal predecessors, (162), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:54:00,248 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 198 transitions. [2022-04-28 03:54:00,248 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 98 states and 198 transitions. [2022-04-28 03:54:00,429 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 198 edges. 198 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 03:54:00,432 INFO L225 Difference]: With dead ends: 441 [2022-04-28 03:54:00,432 INFO L226 Difference]: Without dead ends: 292 [2022-04-28 03:54:00,436 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 354 GetRequests, 95 SyntacticMatches, 2 SemanticMatches, 257 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19386 ImplicationChecksByTransitivity, 10.1s TimeCoverageRelationStatistics Valid=22239, Invalid=44583, Unknown=0, NotChecked=0, Total=66822 [2022-04-28 03:54:00,436 INFO L413 NwaCegarLoop]: 12 mSDtfsCounter, 389 mSDsluCounter, 32 mSDsCounter, 0 mSdLazyCounter, 7752 mSolverCounterSat, 496 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 389 SdHoareTripleChecker+Valid, 44 SdHoareTripleChecker+Invalid, 8248 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 496 IncrementalHoareTripleChecker+Valid, 7752 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6.5s IncrementalHoareTripleChecker+Time [2022-04-28 03:54:00,436 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [389 Valid, 44 Invalid, 8248 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [496 Valid, 7752 Invalid, 0 Unknown, 0 Unchecked, 6.5s Time] [2022-04-28 03:54:00,436 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 292 states. [2022-04-28 03:54:00,873 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 292 to 172. [2022-04-28 03:54:00,873 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 03:54:00,873 INFO L82 GeneralOperation]: Start isEquivalent. First operand 292 states. Second operand has 172 states, 167 states have (on average 1.0239520958083832) internal successors, (171), 167 states have internal predecessors, (171), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:54:00,873 INFO L74 IsIncluded]: Start isIncluded. First operand 292 states. Second operand has 172 states, 167 states have (on average 1.0239520958083832) internal successors, (171), 167 states have internal predecessors, (171), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:54:00,874 INFO L87 Difference]: Start difference. First operand 292 states. Second operand has 172 states, 167 states have (on average 1.0239520958083832) internal successors, (171), 167 states have internal predecessors, (171), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:54:00,877 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:54:00,877 INFO L93 Difference]: Finished difference Result 292 states and 296 transitions. [2022-04-28 03:54:00,877 INFO L276 IsEmpty]: Start isEmpty. Operand 292 states and 296 transitions. [2022-04-28 03:54:00,877 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:54:00,877 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:54:00,877 INFO L74 IsIncluded]: Start isIncluded. First operand has 172 states, 167 states have (on average 1.0239520958083832) internal successors, (171), 167 states have internal predecessors, (171), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 292 states. [2022-04-28 03:54:00,877 INFO L87 Difference]: Start difference. First operand has 172 states, 167 states have (on average 1.0239520958083832) internal successors, (171), 167 states have internal predecessors, (171), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 292 states. [2022-04-28 03:54:00,880 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:54:00,880 INFO L93 Difference]: Finished difference Result 292 states and 296 transitions. [2022-04-28 03:54:00,880 INFO L276 IsEmpty]: Start isEmpty. Operand 292 states and 296 transitions. [2022-04-28 03:54:00,881 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:54:00,881 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:54:00,881 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 03:54:00,881 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 03:54:00,881 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 172 states, 167 states have (on average 1.0239520958083832) internal successors, (171), 167 states have internal predecessors, (171), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:54:00,882 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 172 states to 172 states and 175 transitions. [2022-04-28 03:54:00,882 INFO L78 Accepts]: Start accepts. Automaton has 172 states and 175 transitions. Word has length 166 [2022-04-28 03:54:00,882 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 03:54:00,883 INFO L495 AbstractCegarLoop]: Abstraction has 172 states and 175 transitions. [2022-04-28 03:54:00,883 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 98 states, 98 states have (on average 1.653061224489796) internal successors, (162), 97 states have internal predecessors, (162), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:54:00,883 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 172 states and 175 transitions. [2022-04-28 03:54:01,069 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 175 edges. 175 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 03:54:01,069 INFO L276 IsEmpty]: Start isEmpty. Operand 172 states and 175 transitions. [2022-04-28 03:54:01,069 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 172 [2022-04-28 03:54:01,069 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 03:54:01,069 INFO L195 NwaCegarLoop]: trace histogram [63, 62, 33, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 03:54:01,085 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (47)] Forceful destruction successful, exit code 0 [2022-04-28 03:54:01,270 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable48,47 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 03:54:01,270 INFO L420 AbstractCegarLoop]: === Iteration 50 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 03:54:01,270 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 03:54:01,270 INFO L85 PathProgramCache]: Analyzing trace with hash -2090883917, now seen corresponding path program 47 times [2022-04-28 03:54:01,271 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 03:54:01,271 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [289530484] [2022-04-28 03:54:01,408 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 1 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 03:54:05,544 WARN L977 rdanLoopAcceleration]: Unable to prove correctness of quantifier elimination. [2022-04-28 03:54:05,650 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={1=1, 2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 03:54:05,651 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-28 03:54:05,653 INFO L85 PathProgramCache]: Analyzing trace with hash 1894481538, now seen corresponding path program 1 times [2022-04-28 03:54:05,653 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 03:54:05,654 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [336806590] [2022-04-28 03:54:05,654 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:54:05,654 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 03:54:05,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:54:06,655 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 03:54:06,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:54:06,658 INFO L290 TraceCheckUtils]: 0: Hoare triple {67831#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(17, 2);call #Ultimate.allocInit(12, 3); {67789#true} is VALID [2022-04-28 03:54:06,659 INFO L290 TraceCheckUtils]: 1: Hoare triple {67789#true} assume true; {67789#true} is VALID [2022-04-28 03:54:06,659 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {67789#true} {67789#true} #52#return; {67789#true} is VALID [2022-04-28 03:54:06,659 INFO L272 TraceCheckUtils]: 0: Hoare triple {67789#true} call ULTIMATE.init(); {67831#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 03:54:06,659 INFO L290 TraceCheckUtils]: 1: Hoare triple {67831#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(17, 2);call #Ultimate.allocInit(12, 3); {67789#true} is VALID [2022-04-28 03:54:06,659 INFO L290 TraceCheckUtils]: 2: Hoare triple {67789#true} assume true; {67789#true} is VALID [2022-04-28 03:54:06,659 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {67789#true} {67789#true} #52#return; {67789#true} is VALID [2022-04-28 03:54:06,659 INFO L272 TraceCheckUtils]: 4: Hoare triple {67789#true} call #t~ret9 := main(); {67789#true} is VALID [2022-04-28 03:54:06,660 INFO L290 TraceCheckUtils]: 5: Hoare triple {67789#true} ~x~0 := 0;~y~0 := 50000;~z~0 := 0;~x~0 := 0; {67794#(and (= main_~z~0 0) (= main_~x~0 0) (<= 50000 main_~y~0))} is VALID [2022-04-28 03:54:06,661 INFO L290 TraceCheckUtils]: 6: Hoare triple {67794#(and (= main_~z~0 0) (= main_~x~0 0) (<= 50000 main_~y~0))} [244] L11-2-->L18-1_primed: Formula: (let ((.cse0 (= v_main_~x~0_3068 v_main_~x~0_3067))) (or (and (= |v_main_#t~post4_291| |v_main_#t~post4_292|) .cse0 (<= 50000 v_main_~x~0_3068)) (and .cse0 (= |v_main_#t~post4_292| |v_main_#t~post4_291|)) (and (< v_main_~x~0_3067 50001) (< v_main_~x~0_3068 v_main_~x~0_3067)))) InVars {main_~x~0=v_main_~x~0_3068, main_#t~post4=|v_main_#t~post4_292|} OutVars{main_~x~0=v_main_~x~0_3067, main_#t~post4=|v_main_#t~post4_291|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {67795#(and (= main_~z~0 0) (<= main_~x~0 main_~y~0) (<= 50000 main_~y~0))} is VALID [2022-04-28 03:54:06,661 INFO L290 TraceCheckUtils]: 7: Hoare triple {67795#(and (= main_~z~0 0) (<= main_~x~0 main_~y~0) (<= 50000 main_~y~0))} [245] L18-1_primed-->L11-2: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {67795#(and (= main_~z~0 0) (<= main_~x~0 main_~y~0) (<= 50000 main_~y~0))} is VALID [2022-04-28 03:54:06,662 INFO L290 TraceCheckUtils]: 8: Hoare triple {67795#(and (= main_~z~0 0) (<= main_~x~0 main_~y~0) (<= 50000 main_~y~0))} [246] L11-2-->L18-1_primed: Formula: (let ((.cse0 (= |v_main_#t~post6_326| |v_main_#t~post6_325|)) (.cse1 (= |v_main_#t~post5_326| |v_main_#t~post5_325|)) (.cse2 (= v_main_~x~0_3070 v_main_~x~0_3069)) (.cse3 (<= 50000 v_main_~x~0_3070))) (or (and .cse0 .cse1 .cse2 (= v_main_~y~0_3482 v_main_~y~0_3481)) (and (or (not (< v_main_~x~0_3070 1000000)) (not .cse3)) .cse0 .cse1 (= v_main_~y~0_3481 v_main_~y~0_3482) .cse2) (and (< v_main_~x~0_3070 v_main_~x~0_3069) .cse3 (< v_main_~x~0_3069 1000001) (= (+ v_main_~x~0_3069 v_main_~y~0_3482) (+ v_main_~x~0_3070 v_main_~y~0_3481))))) InVars {main_~y~0=v_main_~y~0_3482, main_#t~post5=|v_main_#t~post5_326|, main_~x~0=v_main_~x~0_3070, main_#t~post6=|v_main_#t~post6_326|} OutVars{main_~y~0=v_main_~y~0_3481, main_#t~post5=|v_main_#t~post5_325|, main_~x~0=v_main_~x~0_3069, main_#t~post6=|v_main_#t~post6_325|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {67796#(and (= main_~z~0 0) (or (<= main_~x~0 main_~y~0) (<= 34 main_~y~0)))} is VALID [2022-04-28 03:54:06,662 INFO L290 TraceCheckUtils]: 9: Hoare triple {67796#(and (= main_~z~0 0) (or (<= main_~x~0 main_~y~0) (<= 34 main_~y~0)))} [243] L18-1_primed-->L18-1: Formula: (not (< v_main_~x~0_11 1000000)) InVars {main_~x~0=v_main_~x~0_11} OutVars{main_~x~0=v_main_~x~0_11} AuxVars[] AssignedVars[] {67797#(and (= main_~z~0 0) (<= 34 main_~y~0))} is VALID [2022-04-28 03:54:06,663 INFO L290 TraceCheckUtils]: 10: Hoare triple {67797#(and (= main_~z~0 0) (<= 34 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {67798#(and (<= 33 main_~y~0) (= main_~z~0 0))} is VALID [2022-04-28 03:54:06,664 INFO L290 TraceCheckUtils]: 11: Hoare triple {67798#(and (<= 33 main_~y~0) (= main_~z~0 0))} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {67799#(and (= main_~z~0 0) (<= 32 main_~y~0))} is VALID [2022-04-28 03:54:06,664 INFO L290 TraceCheckUtils]: 12: Hoare triple {67799#(and (= main_~z~0 0) (<= 32 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {67800#(and (= main_~z~0 0) (<= 31 main_~y~0))} is VALID [2022-04-28 03:54:06,665 INFO L290 TraceCheckUtils]: 13: Hoare triple {67800#(and (= main_~z~0 0) (<= 31 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {67801#(and (= main_~z~0 0) (<= 30 main_~y~0))} is VALID [2022-04-28 03:54:06,665 INFO L290 TraceCheckUtils]: 14: Hoare triple {67801#(and (= main_~z~0 0) (<= 30 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {67802#(and (<= 29 main_~y~0) (= main_~z~0 0))} is VALID [2022-04-28 03:54:06,666 INFO L290 TraceCheckUtils]: 15: Hoare triple {67802#(and (<= 29 main_~y~0) (= main_~z~0 0))} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {67803#(and (= main_~z~0 0) (<= 28 main_~y~0))} is VALID [2022-04-28 03:54:06,667 INFO L290 TraceCheckUtils]: 16: Hoare triple {67803#(and (= main_~z~0 0) (<= 28 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {67804#(and (= main_~z~0 0) (<= 27 main_~y~0))} is VALID [2022-04-28 03:54:06,667 INFO L290 TraceCheckUtils]: 17: Hoare triple {67804#(and (= main_~z~0 0) (<= 27 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {67805#(and (= main_~z~0 0) (<= 26 main_~y~0))} is VALID [2022-04-28 03:54:06,668 INFO L290 TraceCheckUtils]: 18: Hoare triple {67805#(and (= main_~z~0 0) (<= 26 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {67806#(and (= main_~z~0 0) (<= 25 main_~y~0))} is VALID [2022-04-28 03:54:06,668 INFO L290 TraceCheckUtils]: 19: Hoare triple {67806#(and (= main_~z~0 0) (<= 25 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {67807#(and (= main_~z~0 0) (<= 24 main_~y~0))} is VALID [2022-04-28 03:54:06,669 INFO L290 TraceCheckUtils]: 20: Hoare triple {67807#(and (= main_~z~0 0) (<= 24 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {67808#(and (= main_~z~0 0) (<= 23 main_~y~0))} is VALID [2022-04-28 03:54:06,670 INFO L290 TraceCheckUtils]: 21: Hoare triple {67808#(and (= main_~z~0 0) (<= 23 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {67809#(and (= main_~z~0 0) (<= 22 main_~y~0))} is VALID [2022-04-28 03:54:06,670 INFO L290 TraceCheckUtils]: 22: Hoare triple {67809#(and (= main_~z~0 0) (<= 22 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {67810#(and (= main_~z~0 0) (<= 21 main_~y~0))} is VALID [2022-04-28 03:54:06,671 INFO L290 TraceCheckUtils]: 23: Hoare triple {67810#(and (= main_~z~0 0) (<= 21 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {67811#(and (= main_~z~0 0) (<= 20 main_~y~0))} is VALID [2022-04-28 03:54:06,671 INFO L290 TraceCheckUtils]: 24: Hoare triple {67811#(and (= main_~z~0 0) (<= 20 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {67812#(and (= main_~z~0 0) (<= 19 main_~y~0))} is VALID [2022-04-28 03:54:06,672 INFO L290 TraceCheckUtils]: 25: Hoare triple {67812#(and (= main_~z~0 0) (<= 19 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {67813#(and (= main_~z~0 0) (<= 18 main_~y~0))} is VALID [2022-04-28 03:54:06,673 INFO L290 TraceCheckUtils]: 26: Hoare triple {67813#(and (= main_~z~0 0) (<= 18 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {67814#(and (= main_~z~0 0) (<= 17 main_~y~0))} is VALID [2022-04-28 03:54:06,673 INFO L290 TraceCheckUtils]: 27: Hoare triple {67814#(and (= main_~z~0 0) (<= 17 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {67815#(and (= main_~z~0 0) (<= 16 main_~y~0))} is VALID [2022-04-28 03:54:06,674 INFO L290 TraceCheckUtils]: 28: Hoare triple {67815#(and (= main_~z~0 0) (<= 16 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {67816#(and (= main_~z~0 0) (<= 15 main_~y~0))} is VALID [2022-04-28 03:54:06,674 INFO L290 TraceCheckUtils]: 29: Hoare triple {67816#(and (= main_~z~0 0) (<= 15 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {67817#(and (= main_~z~0 0) (<= 14 main_~y~0))} is VALID [2022-04-28 03:54:06,675 INFO L290 TraceCheckUtils]: 30: Hoare triple {67817#(and (= main_~z~0 0) (<= 14 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {67818#(and (= main_~z~0 0) (<= 13 main_~y~0))} is VALID [2022-04-28 03:54:06,676 INFO L290 TraceCheckUtils]: 31: Hoare triple {67818#(and (= main_~z~0 0) (<= 13 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {67819#(and (= main_~z~0 0) (<= 12 main_~y~0))} is VALID [2022-04-28 03:54:06,676 INFO L290 TraceCheckUtils]: 32: Hoare triple {67819#(and (= main_~z~0 0) (<= 12 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {67820#(and (= main_~z~0 0) (<= 11 main_~y~0))} is VALID [2022-04-28 03:54:06,677 INFO L290 TraceCheckUtils]: 33: Hoare triple {67820#(and (= main_~z~0 0) (<= 11 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {67821#(and (= main_~z~0 0) (<= 10 main_~y~0))} is VALID [2022-04-28 03:54:06,677 INFO L290 TraceCheckUtils]: 34: Hoare triple {67821#(and (= main_~z~0 0) (<= 10 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {67822#(and (= main_~z~0 0) (<= 9 main_~y~0))} is VALID [2022-04-28 03:54:06,678 INFO L290 TraceCheckUtils]: 35: Hoare triple {67822#(and (= main_~z~0 0) (<= 9 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {67823#(and (= main_~z~0 0) (<= 8 main_~y~0))} is VALID [2022-04-28 03:54:06,679 INFO L290 TraceCheckUtils]: 36: Hoare triple {67823#(and (= main_~z~0 0) (<= 8 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {67824#(and (= main_~z~0 0) (<= 7 main_~y~0))} is VALID [2022-04-28 03:54:06,679 INFO L290 TraceCheckUtils]: 37: Hoare triple {67824#(and (= main_~z~0 0) (<= 7 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {67825#(and (= main_~z~0 0) (<= 6 main_~y~0))} is VALID [2022-04-28 03:54:06,680 INFO L290 TraceCheckUtils]: 38: Hoare triple {67825#(and (= main_~z~0 0) (<= 6 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {67826#(and (= main_~z~0 0) (<= 5 main_~y~0))} is VALID [2022-04-28 03:54:06,680 INFO L290 TraceCheckUtils]: 39: Hoare triple {67826#(and (= main_~z~0 0) (<= 5 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {67827#(and (= main_~z~0 0) (<= 4 main_~y~0))} is VALID [2022-04-28 03:54:06,681 INFO L290 TraceCheckUtils]: 40: Hoare triple {67827#(and (= main_~z~0 0) (<= 4 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {67828#(and (= main_~z~0 0) (<= 3 main_~y~0))} is VALID [2022-04-28 03:54:06,681 INFO L290 TraceCheckUtils]: 41: Hoare triple {67828#(and (= main_~z~0 0) (<= 3 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {67829#(and (= main_~z~0 0) (<= 2 main_~y~0))} is VALID [2022-04-28 03:54:06,682 INFO L290 TraceCheckUtils]: 42: Hoare triple {67829#(and (= main_~z~0 0) (<= 2 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {67830#(and (= main_~z~0 0) (<= 1 main_~y~0))} is VALID [2022-04-28 03:54:06,682 INFO L290 TraceCheckUtils]: 43: Hoare triple {67830#(and (= main_~z~0 0) (<= 1 main_~y~0))} assume !(~y~0 > ~z~0); {67790#false} is VALID [2022-04-28 03:54:06,683 INFO L272 TraceCheckUtils]: 44: Hoare triple {67790#false} call __VERIFIER_assert((if ~x~0 == ~z~0 then 1 else 0)); {67790#false} is VALID [2022-04-28 03:54:06,683 INFO L290 TraceCheckUtils]: 45: Hoare triple {67790#false} ~cond := #in~cond; {67790#false} is VALID [2022-04-28 03:54:06,683 INFO L290 TraceCheckUtils]: 46: Hoare triple {67790#false} assume 0 == ~cond; {67790#false} is VALID [2022-04-28 03:54:06,683 INFO L290 TraceCheckUtils]: 47: Hoare triple {67790#false} assume !false; {67790#false} is VALID [2022-04-28 03:54:06,683 INFO L134 CoverageAnalysis]: Checked inductivity of 563 backedges. 0 proven. 563 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 03:54:06,683 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 03:54:06,683 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [336806590] [2022-04-28 03:54:06,683 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [336806590] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 03:54:06,683 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1405121216] [2022-04-28 03:54:06,684 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:54:06,684 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 03:54:06,684 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 03:54:06,685 INFO L229 MonitoredProcess]: Starting monitored process 48 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 03:54:06,686 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (48)] Waiting until timeout for monitored process [2022-04-28 03:54:06,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:54:06,749 INFO L263 TraceCheckSpWp]: Trace formula consists of 224 conjuncts, 40 conjunts are in the unsatisfiable core [2022-04-28 03:54:06,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:54:06,774 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 03:54:08,706 INFO L272 TraceCheckUtils]: 0: Hoare triple {67789#true} call ULTIMATE.init(); {67789#true} is VALID [2022-04-28 03:54:08,706 INFO L290 TraceCheckUtils]: 1: Hoare triple {67789#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(17, 2);call #Ultimate.allocInit(12, 3); {67789#true} is VALID [2022-04-28 03:54:08,706 INFO L290 TraceCheckUtils]: 2: Hoare triple {67789#true} assume true; {67789#true} is VALID [2022-04-28 03:54:08,706 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {67789#true} {67789#true} #52#return; {67789#true} is VALID [2022-04-28 03:54:08,706 INFO L272 TraceCheckUtils]: 4: Hoare triple {67789#true} call #t~ret9 := main(); {67789#true} is VALID [2022-04-28 03:54:08,707 INFO L290 TraceCheckUtils]: 5: Hoare triple {67789#true} ~x~0 := 0;~y~0 := 50000;~z~0 := 0;~x~0 := 0; {67850#(and (<= main_~z~0 0) (<= main_~x~0 0) (<= 50000 main_~y~0))} is VALID [2022-04-28 03:54:08,707 INFO L290 TraceCheckUtils]: 6: Hoare triple {67850#(and (<= main_~z~0 0) (<= main_~x~0 0) (<= 50000 main_~y~0))} [244] L11-2-->L18-1_primed: Formula: (let ((.cse0 (= v_main_~x~0_3068 v_main_~x~0_3067))) (or (and (= |v_main_#t~post4_291| |v_main_#t~post4_292|) .cse0 (<= 50000 v_main_~x~0_3068)) (and .cse0 (= |v_main_#t~post4_292| |v_main_#t~post4_291|)) (and (< v_main_~x~0_3067 50001) (< v_main_~x~0_3068 v_main_~x~0_3067)))) InVars {main_~x~0=v_main_~x~0_3068, main_#t~post4=|v_main_#t~post4_292|} OutVars{main_~x~0=v_main_~x~0_3067, main_#t~post4=|v_main_#t~post4_291|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {67854#(and (<= main_~z~0 0) (< main_~x~0 50001) (<= 50000 main_~y~0))} is VALID [2022-04-28 03:54:08,708 INFO L290 TraceCheckUtils]: 7: Hoare triple {67854#(and (<= main_~z~0 0) (< main_~x~0 50001) (<= 50000 main_~y~0))} [245] L18-1_primed-->L11-2: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {67854#(and (<= main_~z~0 0) (< main_~x~0 50001) (<= 50000 main_~y~0))} is VALID [2022-04-28 03:54:08,708 INFO L290 TraceCheckUtils]: 8: Hoare triple {67854#(and (<= main_~z~0 0) (< main_~x~0 50001) (<= 50000 main_~y~0))} [246] L11-2-->L18-1_primed: Formula: (let ((.cse0 (= |v_main_#t~post6_326| |v_main_#t~post6_325|)) (.cse1 (= |v_main_#t~post5_326| |v_main_#t~post5_325|)) (.cse2 (= v_main_~x~0_3070 v_main_~x~0_3069)) (.cse3 (<= 50000 v_main_~x~0_3070))) (or (and .cse0 .cse1 .cse2 (= v_main_~y~0_3482 v_main_~y~0_3481)) (and (or (not (< v_main_~x~0_3070 1000000)) (not .cse3)) .cse0 .cse1 (= v_main_~y~0_3481 v_main_~y~0_3482) .cse2) (and (< v_main_~x~0_3070 v_main_~x~0_3069) .cse3 (< v_main_~x~0_3069 1000001) (= (+ v_main_~x~0_3069 v_main_~y~0_3482) (+ v_main_~x~0_3070 v_main_~y~0_3481))))) InVars {main_~y~0=v_main_~y~0_3482, main_#t~post5=|v_main_#t~post5_326|, main_~x~0=v_main_~x~0_3070, main_#t~post6=|v_main_#t~post6_326|} OutVars{main_~y~0=v_main_~y~0_3481, main_#t~post5=|v_main_#t~post5_325|, main_~x~0=v_main_~x~0_3069, main_#t~post6=|v_main_#t~post6_325|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {67861#(and (<= main_~z~0 0) (or (and (< main_~x~0 50001) (<= 50000 main_~y~0)) (and (< main_~x~0 (+ main_~y~0 1)) (< main_~x~0 1000001) (< 50000 main_~x~0))))} is VALID [2022-04-28 03:54:08,709 INFO L290 TraceCheckUtils]: 9: Hoare triple {67861#(and (<= main_~z~0 0) (or (and (< main_~x~0 50001) (<= 50000 main_~y~0)) (and (< main_~x~0 (+ main_~y~0 1)) (< main_~x~0 1000001) (< 50000 main_~x~0))))} [243] L18-1_primed-->L18-1: Formula: (not (< v_main_~x~0_11 1000000)) InVars {main_~x~0=v_main_~x~0_11} OutVars{main_~x~0=v_main_~x~0_11} AuxVars[] AssignedVars[] {67865#(and (<= main_~z~0 0) (< 999999 main_~y~0))} is VALID [2022-04-28 03:54:08,709 INFO L290 TraceCheckUtils]: 10: Hoare triple {67865#(and (<= main_~z~0 0) (< 999999 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {67869#(and (<= main_~z~0 0) (< 999998 main_~y~0))} is VALID [2022-04-28 03:54:08,710 INFO L290 TraceCheckUtils]: 11: Hoare triple {67869#(and (<= main_~z~0 0) (< 999998 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {67873#(and (<= main_~z~0 0) (< 999997 main_~y~0))} is VALID [2022-04-28 03:54:08,710 INFO L290 TraceCheckUtils]: 12: Hoare triple {67873#(and (<= main_~z~0 0) (< 999997 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {67877#(and (<= main_~z~0 0) (< 999996 main_~y~0))} is VALID [2022-04-28 03:54:08,711 INFO L290 TraceCheckUtils]: 13: Hoare triple {67877#(and (<= main_~z~0 0) (< 999996 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {67881#(and (<= main_~z~0 0) (< 999995 main_~y~0))} is VALID [2022-04-28 03:54:08,711 INFO L290 TraceCheckUtils]: 14: Hoare triple {67881#(and (<= main_~z~0 0) (< 999995 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {67885#(and (<= main_~z~0 0) (< 999994 main_~y~0))} is VALID [2022-04-28 03:54:08,712 INFO L290 TraceCheckUtils]: 15: Hoare triple {67885#(and (<= main_~z~0 0) (< 999994 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {67889#(and (<= main_~z~0 0) (< 999993 main_~y~0))} is VALID [2022-04-28 03:54:08,712 INFO L290 TraceCheckUtils]: 16: Hoare triple {67889#(and (<= main_~z~0 0) (< 999993 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {67893#(and (<= main_~z~0 0) (< 999992 main_~y~0))} is VALID [2022-04-28 03:54:08,713 INFO L290 TraceCheckUtils]: 17: Hoare triple {67893#(and (<= main_~z~0 0) (< 999992 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {67897#(and (<= main_~z~0 0) (< 999991 main_~y~0))} is VALID [2022-04-28 03:54:08,713 INFO L290 TraceCheckUtils]: 18: Hoare triple {67897#(and (<= main_~z~0 0) (< 999991 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {67901#(and (<= main_~z~0 0) (< 999990 main_~y~0))} is VALID [2022-04-28 03:54:08,714 INFO L290 TraceCheckUtils]: 19: Hoare triple {67901#(and (<= main_~z~0 0) (< 999990 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {67905#(and (<= main_~z~0 0) (< 999989 main_~y~0))} is VALID [2022-04-28 03:54:08,714 INFO L290 TraceCheckUtils]: 20: Hoare triple {67905#(and (<= main_~z~0 0) (< 999989 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {67909#(and (<= main_~z~0 0) (< 999988 main_~y~0))} is VALID [2022-04-28 03:54:08,715 INFO L290 TraceCheckUtils]: 21: Hoare triple {67909#(and (<= main_~z~0 0) (< 999988 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {67913#(and (<= main_~z~0 0) (< 999987 main_~y~0))} is VALID [2022-04-28 03:54:08,715 INFO L290 TraceCheckUtils]: 22: Hoare triple {67913#(and (<= main_~z~0 0) (< 999987 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {67917#(and (<= main_~z~0 0) (< 999986 main_~y~0))} is VALID [2022-04-28 03:54:08,716 INFO L290 TraceCheckUtils]: 23: Hoare triple {67917#(and (<= main_~z~0 0) (< 999986 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {67921#(and (<= main_~z~0 0) (< 999985 main_~y~0))} is VALID [2022-04-28 03:54:08,716 INFO L290 TraceCheckUtils]: 24: Hoare triple {67921#(and (<= main_~z~0 0) (< 999985 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {67925#(and (<= main_~z~0 0) (< 999984 main_~y~0))} is VALID [2022-04-28 03:54:08,717 INFO L290 TraceCheckUtils]: 25: Hoare triple {67925#(and (<= main_~z~0 0) (< 999984 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {67929#(and (<= main_~z~0 0) (< 999983 main_~y~0))} is VALID [2022-04-28 03:54:08,717 INFO L290 TraceCheckUtils]: 26: Hoare triple {67929#(and (<= main_~z~0 0) (< 999983 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {67933#(and (<= main_~z~0 0) (< 999982 main_~y~0))} is VALID [2022-04-28 03:54:08,718 INFO L290 TraceCheckUtils]: 27: Hoare triple {67933#(and (<= main_~z~0 0) (< 999982 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {67937#(and (<= main_~z~0 0) (< 999981 main_~y~0))} is VALID [2022-04-28 03:54:08,718 INFO L290 TraceCheckUtils]: 28: Hoare triple {67937#(and (<= main_~z~0 0) (< 999981 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {67941#(and (<= main_~z~0 0) (< 999980 main_~y~0))} is VALID [2022-04-28 03:54:08,719 INFO L290 TraceCheckUtils]: 29: Hoare triple {67941#(and (<= main_~z~0 0) (< 999980 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {67945#(and (<= main_~z~0 0) (< 999979 main_~y~0))} is VALID [2022-04-28 03:54:08,719 INFO L290 TraceCheckUtils]: 30: Hoare triple {67945#(and (<= main_~z~0 0) (< 999979 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {67949#(and (<= main_~z~0 0) (< 999978 main_~y~0))} is VALID [2022-04-28 03:54:08,720 INFO L290 TraceCheckUtils]: 31: Hoare triple {67949#(and (<= main_~z~0 0) (< 999978 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {67953#(and (<= main_~z~0 0) (< 999977 main_~y~0))} is VALID [2022-04-28 03:54:08,720 INFO L290 TraceCheckUtils]: 32: Hoare triple {67953#(and (<= main_~z~0 0) (< 999977 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {67957#(and (<= main_~z~0 0) (< 999976 main_~y~0))} is VALID [2022-04-28 03:54:08,721 INFO L290 TraceCheckUtils]: 33: Hoare triple {67957#(and (<= main_~z~0 0) (< 999976 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {67961#(and (<= main_~z~0 0) (< 999975 main_~y~0))} is VALID [2022-04-28 03:54:08,721 INFO L290 TraceCheckUtils]: 34: Hoare triple {67961#(and (<= main_~z~0 0) (< 999975 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {67965#(and (<= main_~z~0 0) (< 999974 main_~y~0))} is VALID [2022-04-28 03:54:08,722 INFO L290 TraceCheckUtils]: 35: Hoare triple {67965#(and (<= main_~z~0 0) (< 999974 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {67969#(and (<= main_~z~0 0) (< 999973 main_~y~0))} is VALID [2022-04-28 03:54:08,722 INFO L290 TraceCheckUtils]: 36: Hoare triple {67969#(and (<= main_~z~0 0) (< 999973 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {67973#(and (<= main_~z~0 0) (< 999972 main_~y~0))} is VALID [2022-04-28 03:54:08,723 INFO L290 TraceCheckUtils]: 37: Hoare triple {67973#(and (<= main_~z~0 0) (< 999972 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {67977#(and (<= main_~z~0 0) (< 999971 main_~y~0))} is VALID [2022-04-28 03:54:08,723 INFO L290 TraceCheckUtils]: 38: Hoare triple {67977#(and (<= main_~z~0 0) (< 999971 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {67981#(and (<= main_~z~0 0) (< 999970 main_~y~0))} is VALID [2022-04-28 03:54:08,723 INFO L290 TraceCheckUtils]: 39: Hoare triple {67981#(and (<= main_~z~0 0) (< 999970 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {67985#(and (<= main_~z~0 0) (< 999969 main_~y~0))} is VALID [2022-04-28 03:54:08,724 INFO L290 TraceCheckUtils]: 40: Hoare triple {67985#(and (<= main_~z~0 0) (< 999969 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {67989#(and (<= main_~z~0 0) (< 999968 main_~y~0))} is VALID [2022-04-28 03:54:08,724 INFO L290 TraceCheckUtils]: 41: Hoare triple {67989#(and (<= main_~z~0 0) (< 999968 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {67993#(and (<= main_~z~0 0) (< 999967 main_~y~0))} is VALID [2022-04-28 03:54:08,725 INFO L290 TraceCheckUtils]: 42: Hoare triple {67993#(and (<= main_~z~0 0) (< 999967 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {67997#(and (<= main_~z~0 0) (< 999966 main_~y~0))} is VALID [2022-04-28 03:54:08,725 INFO L290 TraceCheckUtils]: 43: Hoare triple {67997#(and (<= main_~z~0 0) (< 999966 main_~y~0))} assume !(~y~0 > ~z~0); {67790#false} is VALID [2022-04-28 03:54:08,725 INFO L272 TraceCheckUtils]: 44: Hoare triple {67790#false} call __VERIFIER_assert((if ~x~0 == ~z~0 then 1 else 0)); {67790#false} is VALID [2022-04-28 03:54:08,725 INFO L290 TraceCheckUtils]: 45: Hoare triple {67790#false} ~cond := #in~cond; {67790#false} is VALID [2022-04-28 03:54:08,725 INFO L290 TraceCheckUtils]: 46: Hoare triple {67790#false} assume 0 == ~cond; {67790#false} is VALID [2022-04-28 03:54:08,726 INFO L290 TraceCheckUtils]: 47: Hoare triple {67790#false} assume !false; {67790#false} is VALID [2022-04-28 03:54:08,726 INFO L134 CoverageAnalysis]: Checked inductivity of 563 backedges. 0 proven. 563 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 03:54:08,726 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 03:54:11,616 INFO L290 TraceCheckUtils]: 47: Hoare triple {67790#false} assume !false; {67790#false} is VALID [2022-04-28 03:54:11,616 INFO L290 TraceCheckUtils]: 46: Hoare triple {67790#false} assume 0 == ~cond; {67790#false} is VALID [2022-04-28 03:54:11,616 INFO L290 TraceCheckUtils]: 45: Hoare triple {67790#false} ~cond := #in~cond; {67790#false} is VALID [2022-04-28 03:54:11,616 INFO L272 TraceCheckUtils]: 44: Hoare triple {67790#false} call __VERIFIER_assert((if ~x~0 == ~z~0 then 1 else 0)); {67790#false} is VALID [2022-04-28 03:54:11,616 INFO L290 TraceCheckUtils]: 43: Hoare triple {68025#(< main_~z~0 main_~y~0)} assume !(~y~0 > ~z~0); {67790#false} is VALID [2022-04-28 03:54:11,617 INFO L290 TraceCheckUtils]: 42: Hoare triple {68029#(< (+ main_~z~0 1) main_~y~0)} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {68025#(< main_~z~0 main_~y~0)} is VALID [2022-04-28 03:54:11,617 INFO L290 TraceCheckUtils]: 41: Hoare triple {68033#(< (+ main_~z~0 2) main_~y~0)} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {68029#(< (+ main_~z~0 1) main_~y~0)} is VALID [2022-04-28 03:54:11,618 INFO L290 TraceCheckUtils]: 40: Hoare triple {68037#(< (+ main_~z~0 3) main_~y~0)} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {68033#(< (+ main_~z~0 2) main_~y~0)} is VALID [2022-04-28 03:54:11,618 INFO L290 TraceCheckUtils]: 39: Hoare triple {68041#(< (+ main_~z~0 4) main_~y~0)} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {68037#(< (+ main_~z~0 3) main_~y~0)} is VALID [2022-04-28 03:54:11,619 INFO L290 TraceCheckUtils]: 38: Hoare triple {68045#(< (+ 5 main_~z~0) main_~y~0)} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {68041#(< (+ main_~z~0 4) main_~y~0)} is VALID [2022-04-28 03:54:11,619 INFO L290 TraceCheckUtils]: 37: Hoare triple {68049#(< (+ main_~z~0 6) main_~y~0)} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {68045#(< (+ 5 main_~z~0) main_~y~0)} is VALID [2022-04-28 03:54:11,620 INFO L290 TraceCheckUtils]: 36: Hoare triple {68053#(< (+ 7 main_~z~0) main_~y~0)} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {68049#(< (+ main_~z~0 6) main_~y~0)} is VALID [2022-04-28 03:54:11,620 INFO L290 TraceCheckUtils]: 35: Hoare triple {68057#(< (+ main_~z~0 8) main_~y~0)} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {68053#(< (+ 7 main_~z~0) main_~y~0)} is VALID [2022-04-28 03:54:11,621 INFO L290 TraceCheckUtils]: 34: Hoare triple {68061#(< (+ main_~z~0 9) main_~y~0)} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {68057#(< (+ main_~z~0 8) main_~y~0)} is VALID [2022-04-28 03:54:11,621 INFO L290 TraceCheckUtils]: 33: Hoare triple {68065#(< (+ main_~z~0 10) main_~y~0)} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {68061#(< (+ main_~z~0 9) main_~y~0)} is VALID [2022-04-28 03:54:11,622 INFO L290 TraceCheckUtils]: 32: Hoare triple {68069#(< (+ main_~z~0 11) main_~y~0)} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {68065#(< (+ main_~z~0 10) main_~y~0)} is VALID [2022-04-28 03:54:11,622 INFO L290 TraceCheckUtils]: 31: Hoare triple {68073#(< (+ main_~z~0 12) main_~y~0)} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {68069#(< (+ main_~z~0 11) main_~y~0)} is VALID [2022-04-28 03:54:11,622 INFO L290 TraceCheckUtils]: 30: Hoare triple {68077#(< (+ main_~z~0 13) main_~y~0)} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {68073#(< (+ main_~z~0 12) main_~y~0)} is VALID [2022-04-28 03:54:11,623 INFO L290 TraceCheckUtils]: 29: Hoare triple {68081#(< (+ main_~z~0 14) main_~y~0)} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {68077#(< (+ main_~z~0 13) main_~y~0)} is VALID [2022-04-28 03:54:11,623 INFO L290 TraceCheckUtils]: 28: Hoare triple {68085#(< (+ main_~z~0 15) main_~y~0)} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {68081#(< (+ main_~z~0 14) main_~y~0)} is VALID [2022-04-28 03:54:11,624 INFO L290 TraceCheckUtils]: 27: Hoare triple {68089#(< (+ main_~z~0 16) main_~y~0)} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {68085#(< (+ main_~z~0 15) main_~y~0)} is VALID [2022-04-28 03:54:11,624 INFO L290 TraceCheckUtils]: 26: Hoare triple {68093#(< (+ main_~z~0 17) main_~y~0)} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {68089#(< (+ main_~z~0 16) main_~y~0)} is VALID [2022-04-28 03:54:11,625 INFO L290 TraceCheckUtils]: 25: Hoare triple {68097#(< (+ main_~z~0 18) main_~y~0)} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {68093#(< (+ main_~z~0 17) main_~y~0)} is VALID [2022-04-28 03:54:11,625 INFO L290 TraceCheckUtils]: 24: Hoare triple {68101#(< (+ 19 main_~z~0) main_~y~0)} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {68097#(< (+ main_~z~0 18) main_~y~0)} is VALID [2022-04-28 03:54:11,626 INFO L290 TraceCheckUtils]: 23: Hoare triple {68105#(< (+ main_~z~0 20) main_~y~0)} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {68101#(< (+ 19 main_~z~0) main_~y~0)} is VALID [2022-04-28 03:54:11,626 INFO L290 TraceCheckUtils]: 22: Hoare triple {68109#(< (+ main_~z~0 21) main_~y~0)} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {68105#(< (+ main_~z~0 20) main_~y~0)} is VALID [2022-04-28 03:54:11,627 INFO L290 TraceCheckUtils]: 21: Hoare triple {68113#(< (+ main_~z~0 22) main_~y~0)} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {68109#(< (+ main_~z~0 21) main_~y~0)} is VALID [2022-04-28 03:54:11,627 INFO L290 TraceCheckUtils]: 20: Hoare triple {68117#(< (+ 23 main_~z~0) main_~y~0)} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {68113#(< (+ main_~z~0 22) main_~y~0)} is VALID [2022-04-28 03:54:11,628 INFO L290 TraceCheckUtils]: 19: Hoare triple {68121#(< (+ main_~z~0 24) main_~y~0)} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {68117#(< (+ 23 main_~z~0) main_~y~0)} is VALID [2022-04-28 03:54:11,628 INFO L290 TraceCheckUtils]: 18: Hoare triple {68125#(< (+ main_~z~0 25) main_~y~0)} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {68121#(< (+ main_~z~0 24) main_~y~0)} is VALID [2022-04-28 03:54:11,628 INFO L290 TraceCheckUtils]: 17: Hoare triple {68129#(< (+ main_~z~0 26) main_~y~0)} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {68125#(< (+ main_~z~0 25) main_~y~0)} is VALID [2022-04-28 03:54:11,629 INFO L290 TraceCheckUtils]: 16: Hoare triple {68133#(< (+ main_~z~0 27) main_~y~0)} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {68129#(< (+ main_~z~0 26) main_~y~0)} is VALID [2022-04-28 03:54:11,629 INFO L290 TraceCheckUtils]: 15: Hoare triple {68137#(< (+ main_~z~0 28) main_~y~0)} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {68133#(< (+ main_~z~0 27) main_~y~0)} is VALID [2022-04-28 03:54:11,630 INFO L290 TraceCheckUtils]: 14: Hoare triple {68141#(< (+ 29 main_~z~0) main_~y~0)} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {68137#(< (+ main_~z~0 28) main_~y~0)} is VALID [2022-04-28 03:54:11,630 INFO L290 TraceCheckUtils]: 13: Hoare triple {68145#(< (+ 30 main_~z~0) main_~y~0)} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {68141#(< (+ 29 main_~z~0) main_~y~0)} is VALID [2022-04-28 03:54:11,631 INFO L290 TraceCheckUtils]: 12: Hoare triple {68149#(< (+ main_~z~0 31) main_~y~0)} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {68145#(< (+ 30 main_~z~0) main_~y~0)} is VALID [2022-04-28 03:54:11,631 INFO L290 TraceCheckUtils]: 11: Hoare triple {68153#(< (+ 32 main_~z~0) main_~y~0)} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {68149#(< (+ main_~z~0 31) main_~y~0)} is VALID [2022-04-28 03:54:11,632 INFO L290 TraceCheckUtils]: 10: Hoare triple {68157#(< (+ main_~z~0 33) main_~y~0)} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {68153#(< (+ 32 main_~z~0) main_~y~0)} is VALID [2022-04-28 03:54:11,632 INFO L290 TraceCheckUtils]: 9: Hoare triple {68161#(or (< main_~x~0 1000000) (< (+ main_~z~0 33) main_~y~0))} [243] L18-1_primed-->L18-1: Formula: (not (< v_main_~x~0_11 1000000)) InVars {main_~x~0=v_main_~x~0_11} OutVars{main_~x~0=v_main_~x~0_11} AuxVars[] AssignedVars[] {68157#(< (+ main_~z~0 33) main_~y~0)} is VALID [2022-04-28 03:54:11,633 INFO L290 TraceCheckUtils]: 8: Hoare triple {68165#(and (or (< (+ main_~z~0 main_~x~0) (+ 999967 main_~y~0)) (<= 1000000 main_~x~0) (not (<= 50000 main_~x~0))) (or (< main_~x~0 1000000) (< (+ main_~z~0 33) main_~y~0)))} [246] L11-2-->L18-1_primed: Formula: (let ((.cse0 (= |v_main_#t~post6_326| |v_main_#t~post6_325|)) (.cse1 (= |v_main_#t~post5_326| |v_main_#t~post5_325|)) (.cse2 (= v_main_~x~0_3070 v_main_~x~0_3069)) (.cse3 (<= 50000 v_main_~x~0_3070))) (or (and .cse0 .cse1 .cse2 (= v_main_~y~0_3482 v_main_~y~0_3481)) (and (or (not (< v_main_~x~0_3070 1000000)) (not .cse3)) .cse0 .cse1 (= v_main_~y~0_3481 v_main_~y~0_3482) .cse2) (and (< v_main_~x~0_3070 v_main_~x~0_3069) .cse3 (< v_main_~x~0_3069 1000001) (= (+ v_main_~x~0_3069 v_main_~y~0_3482) (+ v_main_~x~0_3070 v_main_~y~0_3481))))) InVars {main_~y~0=v_main_~y~0_3482, main_#t~post5=|v_main_#t~post5_326|, main_~x~0=v_main_~x~0_3070, main_#t~post6=|v_main_#t~post6_326|} OutVars{main_~y~0=v_main_~y~0_3481, main_#t~post5=|v_main_#t~post5_325|, main_~x~0=v_main_~x~0_3069, main_#t~post6=|v_main_#t~post6_325|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {68161#(or (< main_~x~0 1000000) (< (+ main_~z~0 33) main_~y~0))} is VALID [2022-04-28 03:54:11,633 INFO L290 TraceCheckUtils]: 7: Hoare triple {68165#(and (or (< (+ main_~z~0 main_~x~0) (+ 999967 main_~y~0)) (<= 1000000 main_~x~0) (not (<= 50000 main_~x~0))) (or (< main_~x~0 1000000) (< (+ main_~z~0 33) main_~y~0)))} [245] L18-1_primed-->L11-2: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {68165#(and (or (< (+ main_~z~0 main_~x~0) (+ 999967 main_~y~0)) (<= 1000000 main_~x~0) (not (<= 50000 main_~x~0))) (or (< main_~x~0 1000000) (< (+ main_~z~0 33) main_~y~0)))} is VALID [2022-04-28 03:54:11,634 INFO L290 TraceCheckUtils]: 6: Hoare triple {68172#(and (<= main_~z~0 (+ main_~y~0 949966)) (or (< main_~x~0 1000000) (< (+ main_~z~0 33) main_~y~0)) (or (< (+ main_~z~0 main_~x~0) (+ 999967 main_~y~0)) (<= 1000000 main_~x~0)))} [244] L11-2-->L18-1_primed: Formula: (let ((.cse0 (= v_main_~x~0_3068 v_main_~x~0_3067))) (or (and (= |v_main_#t~post4_291| |v_main_#t~post4_292|) .cse0 (<= 50000 v_main_~x~0_3068)) (and .cse0 (= |v_main_#t~post4_292| |v_main_#t~post4_291|)) (and (< v_main_~x~0_3067 50001) (< v_main_~x~0_3068 v_main_~x~0_3067)))) InVars {main_~x~0=v_main_~x~0_3068, main_#t~post4=|v_main_#t~post4_292|} OutVars{main_~x~0=v_main_~x~0_3067, main_#t~post4=|v_main_#t~post4_291|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {68165#(and (or (< (+ main_~z~0 main_~x~0) (+ 999967 main_~y~0)) (<= 1000000 main_~x~0) (not (<= 50000 main_~x~0))) (or (< main_~x~0 1000000) (< (+ main_~z~0 33) main_~y~0)))} is VALID [2022-04-28 03:54:11,635 INFO L290 TraceCheckUtils]: 5: Hoare triple {67789#true} ~x~0 := 0;~y~0 := 50000;~z~0 := 0;~x~0 := 0; {68172#(and (<= main_~z~0 (+ main_~y~0 949966)) (or (< main_~x~0 1000000) (< (+ main_~z~0 33) main_~y~0)) (or (< (+ main_~z~0 main_~x~0) (+ 999967 main_~y~0)) (<= 1000000 main_~x~0)))} is VALID [2022-04-28 03:54:11,635 INFO L272 TraceCheckUtils]: 4: Hoare triple {67789#true} call #t~ret9 := main(); {67789#true} is VALID [2022-04-28 03:54:11,635 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {67789#true} {67789#true} #52#return; {67789#true} is VALID [2022-04-28 03:54:11,635 INFO L290 TraceCheckUtils]: 2: Hoare triple {67789#true} assume true; {67789#true} is VALID [2022-04-28 03:54:11,635 INFO L290 TraceCheckUtils]: 1: Hoare triple {67789#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(17, 2);call #Ultimate.allocInit(12, 3); {67789#true} is VALID [2022-04-28 03:54:11,635 INFO L272 TraceCheckUtils]: 0: Hoare triple {67789#true} call ULTIMATE.init(); {67789#true} is VALID [2022-04-28 03:54:11,635 INFO L134 CoverageAnalysis]: Checked inductivity of 563 backedges. 0 proven. 563 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 03:54:11,635 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1405121216] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 03:54:11,635 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 03:54:11,635 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [40, 39, 39] total 114