/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-e106359-m [2022-04-15 06:41:48,032 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-04-15 06:41:48,034 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-04-15 06:41:48,067 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-04-15 06:41:48,067 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-04-15 06:41:48,068 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-04-15 06:41:48,070 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-04-15 06:41:48,072 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-04-15 06:41:48,073 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-04-15 06:41:48,076 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-04-15 06:41:48,077 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-04-15 06:41:48,077 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-04-15 06:41:48,078 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-04-15 06:41:48,081 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-04-15 06:41:48,082 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-04-15 06:41:48,084 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-04-15 06:41:48,084 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-04-15 06:41:48,085 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-04-15 06:41:48,086 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-04-15 06:41:48,090 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-04-15 06:41:48,091 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-04-15 06:41:48,092 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-04-15 06:41:48,092 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-04-15 06:41:48,093 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-04-15 06:41:48,094 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-04-15 06:41:48,098 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-04-15 06:41:48,098 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-04-15 06:41:48,099 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-04-15 06:41:48,099 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-04-15 06:41:48,099 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-04-15 06:41:48,100 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-04-15 06:41:48,100 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-04-15 06:41:48,101 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-04-15 06:41:48,102 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-04-15 06:41:48,102 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-04-15 06:41:48,103 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-04-15 06:41:48,103 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-04-15 06:41:48,103 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-04-15 06:41:48,103 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-04-15 06:41:48,103 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-04-15 06:41:48,104 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-04-15 06:41:48,104 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-04-15 06:41:48,105 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationJordan_32.epf [2022-04-15 06:41:48,113 INFO L113 SettingsManager]: Loading preferences was successful [2022-04-15 06:41:48,114 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-04-15 06:41:48,114 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-04-15 06:41:48,115 INFO L138 SettingsManager]: * sizeof long=4 [2022-04-15 06:41:48,115 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-04-15 06:41:48,115 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-04-15 06:41:48,115 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-04-15 06:41:48,115 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-04-15 06:41:48,115 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-04-15 06:41:48,116 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-04-15 06:41:48,116 INFO L138 SettingsManager]: * sizeof long double=12 [2022-04-15 06:41:48,116 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-04-15 06:41:48,116 INFO L138 SettingsManager]: * Use constant arrays=true [2022-04-15 06:41:48,116 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-04-15 06:41:48,116 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-04-15 06:41:48,116 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-04-15 06:41:48,116 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-04-15 06:41:48,116 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-04-15 06:41:48,116 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-15 06:41:48,117 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-04-15 06:41:48,117 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_NestedInterpolation [2022-04-15 06:41:48,117 INFO L138 SettingsManager]: * Trace refinement strategy=ACCELERATED_INTERPOLATION [2022-04-15 06:41:48,117 INFO L138 SettingsManager]: * Trace refinement strategy used in Accelerated Interpolation=CAMEL [2022-04-15 06:41:48,117 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-04-15 06:41:48,117 INFO L138 SettingsManager]: * Loop acceleration method that is used by accelerated interpolation=JORDAN [2022-04-15 06:41:48,117 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-15 06:41:48,290 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-04-15 06:41:48,302 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-04-15 06:41:48,303 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-04-15 06:41:48,304 INFO L271 PluginConnector]: Initializing CDTParser... [2022-04-15 06:41:48,304 INFO L275 PluginConnector]: CDTParser initialized [2022-04-15 06:41:48,305 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-15 06:41:48,355 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/cef2a3402/77cb2c4465f6482f8b8b18ceefbd3be9/FLAGd042adb32 [2022-04-15 06:41:48,698 INFO L306 CDTParser]: Found 1 translation units. [2022-04-15 06:41:48,699 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loops-crafted-1/mono-crafted_1.c [2022-04-15 06:41:48,702 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/cef2a3402/77cb2c4465f6482f8b8b18ceefbd3be9/FLAGd042adb32 [2022-04-15 06:41:48,710 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/cef2a3402/77cb2c4465f6482f8b8b18ceefbd3be9 [2022-04-15 06:41:48,712 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-04-15 06:41:48,713 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2022-04-15 06:41:48,714 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-04-15 06:41:48,714 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-04-15 06:41:48,729 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-04-15 06:41:48,730 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.04 06:41:48" (1/1) ... [2022-04-15 06:41:48,731 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2a2fd215 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 06:41:48, skipping insertion in model container [2022-04-15 06:41:48,731 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.04 06:41:48" (1/1) ... [2022-04-15 06:41:48,736 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-04-15 06:41:48,744 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-04-15 06:41:48,837 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-15 06:41:48,864 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-15 06:41:48,871 INFO L203 MainTranslator]: Completed pre-run [2022-04-15 06:41:48,880 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-15 06:41:48,883 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-15 06:41:48,893 INFO L208 MainTranslator]: Completed translation [2022-04-15 06:41:48,894 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 06:41:48 WrapperNode [2022-04-15 06:41:48,894 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-04-15 06:41:48,895 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-04-15 06:41:48,895 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-04-15 06:41:48,895 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-04-15 06:41:48,902 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 06:41:48" (1/1) ... [2022-04-15 06:41:48,903 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 06:41:48" (1/1) ... [2022-04-15 06:41:48,907 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 06:41:48" (1/1) ... [2022-04-15 06:41:48,907 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 06:41:48" (1/1) ... [2022-04-15 06:41:48,911 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 06:41:48" (1/1) ... [2022-04-15 06:41:48,916 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 06:41:48" (1/1) ... [2022-04-15 06:41:48,921 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 06:41:48" (1/1) ... [2022-04-15 06:41:48,923 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-04-15 06:41:48,923 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-04-15 06:41:48,923 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-04-15 06:41:48,924 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-04-15 06:41:48,924 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 06:41:48" (1/1) ... [2022-04-15 06:41:48,933 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-15 06:41:48,939 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 06:41:48,949 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-15 06:41:48,950 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-15 06:41:48,972 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-04-15 06:41:48,972 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-04-15 06:41:48,972 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-04-15 06:41:48,972 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-04-15 06:41:48,973 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-04-15 06:41:48,973 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-04-15 06:41:48,973 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-04-15 06:41:48,973 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-04-15 06:41:48,973 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-04-15 06:41:48,973 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-04-15 06:41:48,973 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-04-15 06:41:48,973 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-04-15 06:41:48,973 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-04-15 06:41:48,973 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-04-15 06:41:48,973 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-04-15 06:41:48,973 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-04-15 06:41:48,974 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-04-15 06:41:49,022 INFO L234 CfgBuilder]: Building ICFG [2022-04-15 06:41:49,024 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-04-15 06:41:49,141 INFO L275 CfgBuilder]: Performing block encoding [2022-04-15 06:41:49,145 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-04-15 06:41:49,145 INFO L299 CfgBuilder]: Removed 2 assume(true) statements. [2022-04-15 06:41:49,146 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.04 06:41:49 BoogieIcfgContainer [2022-04-15 06:41:49,146 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-04-15 06:41:49,147 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-04-15 06:41:49,148 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-04-15 06:41:49,150 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-04-15 06:41:49,150 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 15.04 06:41:48" (1/3) ... [2022-04-15 06:41:49,164 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5aace832 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.04 06:41:49, skipping insertion in model container [2022-04-15 06:41:49,164 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 06:41:48" (2/3) ... [2022-04-15 06:41:49,164 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5aace832 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.04 06:41:49, skipping insertion in model container [2022-04-15 06:41:49,164 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.04 06:41:49" (3/3) ... [2022-04-15 06:41:49,165 INFO L111 eAbstractionObserver]: Analyzing ICFG mono-crafted_1.c [2022-04-15 06:41:49,168 INFO L202 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2022-04-15 06:41:49,168 INFO L161 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-04-15 06:41:49,198 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-04-15 06:41:49,202 INFO L340 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 [2022-04-15 06:41:49,202 INFO L341 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-04-15 06:41:49,214 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-15 06:41:49,218 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-04-15 06:41:49,218 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 06:41:49,218 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 06:41:49,219 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 06:41:49,222 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 06:41:49,222 INFO L85 PathProgramCache]: Analyzing trace with hash -1168619535, now seen corresponding path program 1 times [2022-04-15 06:41:49,227 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 06:41:49,228 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [852143137] [2022-04-15 06:41:49,234 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-15 06:41:49,235 INFO L85 PathProgramCache]: Analyzing trace with hash -1168619535, now seen corresponding path program 2 times [2022-04-15 06:41:49,237 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 06:41:49,237 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1105765679] [2022-04-15 06:41:49,237 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 06:41:49,238 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 06:41:49,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:41:49,387 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 06:41:49,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:41:49,401 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-15 06:41:49,401 INFO L290 TraceCheckUtils]: 1: Hoare triple {24#true} assume true; {24#true} is VALID [2022-04-15 06:41:49,401 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {24#true} {24#true} #52#return; {24#true} is VALID [2022-04-15 06:41:49,403 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-15 06:41:49,403 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-15 06:41:49,403 INFO L290 TraceCheckUtils]: 2: Hoare triple {24#true} assume true; {24#true} is VALID [2022-04-15 06:41:49,404 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {24#true} {24#true} #52#return; {24#true} is VALID [2022-04-15 06:41:49,404 INFO L272 TraceCheckUtils]: 4: Hoare triple {24#true} call #t~ret9 := main(); {24#true} is VALID [2022-04-15 06:41:49,404 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-15 06:41:49,405 INFO L290 TraceCheckUtils]: 6: Hoare triple {24#true} assume !true; {25#false} is VALID [2022-04-15 06:41:49,405 INFO L290 TraceCheckUtils]: 7: Hoare triple {25#false} assume !true; {25#false} is VALID [2022-04-15 06:41:49,405 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-15 06:41:49,405 INFO L290 TraceCheckUtils]: 9: Hoare triple {25#false} ~cond := #in~cond; {25#false} is VALID [2022-04-15 06:41:49,406 INFO L290 TraceCheckUtils]: 10: Hoare triple {25#false} assume 0 == ~cond; {25#false} is VALID [2022-04-15 06:41:49,406 INFO L290 TraceCheckUtils]: 11: Hoare triple {25#false} assume !false; {25#false} is VALID [2022-04-15 06:41:49,407 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-15 06:41:49,407 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 06:41:49,408 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1105765679] [2022-04-15 06:41:49,408 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1105765679] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 06:41:49,409 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 06:41:49,409 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-04-15 06:41:49,411 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 06:41:49,412 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [852143137] [2022-04-15 06:41:49,412 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [852143137] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 06:41:49,412 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 06:41:49,412 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-04-15 06:41:49,412 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [699856072] [2022-04-15 06:41:49,413 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 06:41:49,416 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-15 06:41:49,417 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 06:41:49,419 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-15 06:41:49,450 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-15 06:41:49,450 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-04-15 06:41:49,451 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 06:41:49,475 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-04-15 06:41:49,477 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-15 06:41:49,479 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-15 06:41:49,563 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:41:49,564 INFO L93 Difference]: Finished difference Result 34 states and 42 transitions. [2022-04-15 06:41:49,564 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-04-15 06:41:49,564 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-15 06:41:49,564 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 06:41:49,565 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-15 06:41:49,569 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 42 transitions. [2022-04-15 06:41:49,572 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-15 06:41:49,579 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 42 transitions. [2022-04-15 06:41:49,580 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 3 states and 42 transitions. [2022-04-15 06:41:49,627 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-15 06:41:49,633 INFO L225 Difference]: With dead ends: 34 [2022-04-15 06:41:49,634 INFO L226 Difference]: Without dead ends: 14 [2022-04-15 06:41:49,635 INFO L912 BasicCegarLoop]: 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-15 06:41:49,639 INFO L913 BasicCegarLoop]: 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-15 06:41:49,640 INFO L914 BasicCegarLoop]: 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-15 06:41:49,651 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14 states. [2022-04-15 06:41:49,660 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14 to 14. [2022-04-15 06:41:49,660 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 06:41:49,661 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-15 06:41:49,661 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-15 06:41:49,662 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-15 06:41:49,665 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:41:49,666 INFO L93 Difference]: Finished difference Result 14 states and 16 transitions. [2022-04-15 06:41:49,666 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 16 transitions. [2022-04-15 06:41:49,666 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 06:41:49,666 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 06:41:49,666 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-15 06:41:49,667 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-15 06:41:49,671 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:41:49,671 INFO L93 Difference]: Finished difference Result 14 states and 16 transitions. [2022-04-15 06:41:49,671 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 16 transitions. [2022-04-15 06:41:49,671 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 06:41:49,671 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 06:41:49,671 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 06:41:49,671 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 06:41:49,672 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-15 06:41:49,677 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 16 transitions. [2022-04-15 06:41:49,678 INFO L78 Accepts]: Start accepts. Automaton has 14 states and 16 transitions. Word has length 12 [2022-04-15 06:41:49,678 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 06:41:49,678 INFO L478 AbstractCegarLoop]: Abstraction has 14 states and 16 transitions. [2022-04-15 06:41:49,679 INFO L479 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-15 06:41:49,679 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 14 states and 16 transitions. [2022-04-15 06:41:49,697 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-15 06:41:49,697 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 16 transitions. [2022-04-15 06:41:49,699 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-04-15 06:41:49,700 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 06:41:49,704 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 06:41:49,704 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-04-15 06:41:49,704 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 06:41:49,706 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 06:41:49,706 INFO L85 PathProgramCache]: Analyzing trace with hash -1458605129, now seen corresponding path program 1 times [2022-04-15 06:41:49,706 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 06:41:49,706 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1483788223] [2022-04-15 06:41:49,708 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-15 06:41:49,708 INFO L85 PathProgramCache]: Analyzing trace with hash -1458605129, now seen corresponding path program 2 times [2022-04-15 06:41:49,708 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 06:41:49,708 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1187874959] [2022-04-15 06:41:49,709 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 06:41:49,709 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 06:41:49,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:41:49,770 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 06:41:49,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:41:49,786 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-15 06:41:49,786 INFO L290 TraceCheckUtils]: 1: Hoare triple {156#true} assume true; {156#true} is VALID [2022-04-15 06:41:49,787 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {156#true} {156#true} #52#return; {156#true} is VALID [2022-04-15 06:41:49,788 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-15 06:41:49,788 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-15 06:41:49,788 INFO L290 TraceCheckUtils]: 2: Hoare triple {156#true} assume true; {156#true} is VALID [2022-04-15 06:41:49,789 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {156#true} {156#true} #52#return; {156#true} is VALID [2022-04-15 06:41:49,789 INFO L272 TraceCheckUtils]: 4: Hoare triple {156#true} call #t~ret9 := main(); {156#true} is VALID [2022-04-15 06:41:49,789 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-15 06:41:49,790 INFO L290 TraceCheckUtils]: 6: Hoare triple {161#(= main_~x~0 0)} assume !(~x~0 < 1000000); {157#false} is VALID [2022-04-15 06:41:49,790 INFO L290 TraceCheckUtils]: 7: Hoare triple {157#false} assume !(~y~0 > ~z~0); {157#false} is VALID [2022-04-15 06:41:49,790 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-15 06:41:49,790 INFO L290 TraceCheckUtils]: 9: Hoare triple {157#false} ~cond := #in~cond; {157#false} is VALID [2022-04-15 06:41:49,790 INFO L290 TraceCheckUtils]: 10: Hoare triple {157#false} assume 0 == ~cond; {157#false} is VALID [2022-04-15 06:41:49,790 INFO L290 TraceCheckUtils]: 11: Hoare triple {157#false} assume !false; {157#false} is VALID [2022-04-15 06:41:49,791 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-15 06:41:49,791 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 06:41:49,793 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1187874959] [2022-04-15 06:41:49,793 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1187874959] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 06:41:49,794 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 06:41:49,794 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 06:41:49,794 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 06:41:49,794 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1483788223] [2022-04-15 06:41:49,795 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1483788223] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 06:41:49,795 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 06:41:49,795 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 06:41:49,795 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [508544714] [2022-04-15 06:41:49,795 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 06:41:49,796 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-15 06:41:49,796 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 06:41:49,796 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-15 06:41:49,806 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-15 06:41:49,806 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-15 06:41:49,806 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 06:41:49,806 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-15 06:41:49,807 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-15 06:41:49,807 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-15 06:41:49,905 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:41:49,905 INFO L93 Difference]: Finished difference Result 24 states and 30 transitions. [2022-04-15 06:41:49,905 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-15 06:41:49,905 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-15 06:41:49,906 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 06:41:49,906 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-15 06:41:49,908 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 30 transitions. [2022-04-15 06:41:49,908 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-15 06:41:49,909 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 30 transitions. [2022-04-15 06:41:49,910 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 30 transitions. [2022-04-15 06:41:49,948 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-15 06:41:49,949 INFO L225 Difference]: With dead ends: 24 [2022-04-15 06:41:49,949 INFO L226 Difference]: Without dead ends: 16 [2022-04-15 06:41:49,950 INFO L912 BasicCegarLoop]: 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-15 06:41:49,950 INFO L913 BasicCegarLoop]: 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-15 06:41:49,951 INFO L914 BasicCegarLoop]: 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-15 06:41:49,952 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states. [2022-04-15 06:41:49,954 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 16. [2022-04-15 06:41:49,954 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 06:41:49,954 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-15 06:41:49,954 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-15 06:41:49,954 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-15 06:41:49,955 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:41:49,955 INFO L93 Difference]: Finished difference Result 16 states and 18 transitions. [2022-04-15 06:41:49,955 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 18 transitions. [2022-04-15 06:41:49,955 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 06:41:49,956 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 06:41:49,956 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-15 06:41:49,956 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-15 06:41:49,957 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:41:49,957 INFO L93 Difference]: Finished difference Result 16 states and 18 transitions. [2022-04-15 06:41:49,957 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 18 transitions. [2022-04-15 06:41:49,957 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 06:41:49,957 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 06:41:49,957 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 06:41:49,957 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 06:41:49,958 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-15 06:41:49,958 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 18 transitions. [2022-04-15 06:41:49,958 INFO L78 Accepts]: Start accepts. Automaton has 16 states and 18 transitions. Word has length 12 [2022-04-15 06:41:49,958 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 06:41:49,959 INFO L478 AbstractCegarLoop]: Abstraction has 16 states and 18 transitions. [2022-04-15 06:41:49,959 INFO L479 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-15 06:41:49,959 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 16 states and 18 transitions. [2022-04-15 06:41:49,976 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-15 06:41:49,976 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 18 transitions. [2022-04-15 06:41:49,977 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-04-15 06:41:49,977 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 06:41:49,977 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 06:41:49,977 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-04-15 06:41:49,977 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 06:41:49,978 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 06:41:49,978 INFO L85 PathProgramCache]: Analyzing trace with hash -1316432198, now seen corresponding path program 1 times [2022-04-15 06:41:49,978 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 06:41:49,982 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [2002668145] [2022-04-15 06:41:50,181 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-15 06:41:50,182 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-15 06:41:50,185 INFO L85 PathProgramCache]: Analyzing trace with hash -1148992352, now seen corresponding path program 1 times [2022-04-15 06:41:50,185 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 06:41:50,185 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1659568266] [2022-04-15 06:41:50,185 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 06:41:50,186 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 06:41:50,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:41:50,236 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 06:41:50,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:41:50,241 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-15 06:41:50,241 INFO L290 TraceCheckUtils]: 1: Hoare triple {279#true} assume true; {279#true} is VALID [2022-04-15 06:41:50,241 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {279#true} {279#true} #52#return; {279#true} is VALID [2022-04-15 06:41:50,242 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-15 06:41:50,242 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-15 06:41:50,242 INFO L290 TraceCheckUtils]: 2: Hoare triple {279#true} assume true; {279#true} is VALID [2022-04-15 06:41:50,243 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {279#true} {279#true} #52#return; {279#true} is VALID [2022-04-15 06:41:50,243 INFO L272 TraceCheckUtils]: 4: Hoare triple {279#true} call #t~ret9 := main(); {279#true} is VALID [2022-04-15 06:41:50,243 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-15 06:41:50,244 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-15 06:41:50,244 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-15 06:41:50,245 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-15 06:41:50,245 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-15 06:41:50,245 INFO L290 TraceCheckUtils]: 10: Hoare triple {280#false} ~cond := #in~cond; {280#false} is VALID [2022-04-15 06:41:50,245 INFO L290 TraceCheckUtils]: 11: Hoare triple {280#false} assume 0 == ~cond; {280#false} is VALID [2022-04-15 06:41:50,245 INFO L290 TraceCheckUtils]: 12: Hoare triple {280#false} assume !false; {280#false} is VALID [2022-04-15 06:41:50,246 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-15 06:41:50,246 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 06:41:50,246 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1659568266] [2022-04-15 06:41:50,246 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1659568266] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 06:41:50,246 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 06:41:50,246 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 06:41:50,293 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 06:41:50,294 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [2002668145] [2022-04-15 06:41:50,294 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [2002668145] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 06:41:50,294 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 06:41:50,294 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-15 06:41:50,294 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1254627562] [2022-04-15 06:41:50,294 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 06:41:50,294 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-15 06:41:50,295 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 06:41:50,295 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-15 06:41:50,303 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-15 06:41:50,303 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-15 06:41:50,304 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 06:41:50,304 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-15 06:41:50,304 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2022-04-15 06:41:50,304 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-15 06:41:50,399 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:41:50,399 INFO L93 Difference]: Finished difference Result 26 states and 32 transitions. [2022-04-15 06:41:50,399 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-04-15 06:41:50,400 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-15 06:41:50,400 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 06:41:50,400 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-15 06:41:50,401 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 30 transitions. [2022-04-15 06:41:50,401 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-15 06:41:50,402 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 30 transitions. [2022-04-15 06:41:50,402 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 6 states and 30 transitions. [2022-04-15 06:41:50,423 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-15 06:41:50,423 INFO L225 Difference]: With dead ends: 26 [2022-04-15 06:41:50,423 INFO L226 Difference]: Without dead ends: 20 [2022-04-15 06:41:50,424 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 8 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2022-04-15 06:41:50,424 INFO L913 BasicCegarLoop]: 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-15 06:41:50,425 INFO L914 BasicCegarLoop]: 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-15 06:41:50,425 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2022-04-15 06:41:50,437 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 20. [2022-04-15 06:41:50,437 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 06:41:50,437 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-15 06:41:50,438 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-15 06:41:50,438 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-15 06:41:50,439 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:41:50,439 INFO L93 Difference]: Finished difference Result 20 states and 23 transitions. [2022-04-15 06:41:50,439 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 23 transitions. [2022-04-15 06:41:50,439 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 06:41:50,439 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 06:41:50,439 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-15 06:41:50,440 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-15 06:41:50,440 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:41:50,440 INFO L93 Difference]: Finished difference Result 20 states and 23 transitions. [2022-04-15 06:41:50,441 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 23 transitions. [2022-04-15 06:41:50,441 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 06:41:50,441 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 06:41:50,441 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 06:41:50,441 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 06:41:50,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-15 06:41:50,442 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 23 transitions. [2022-04-15 06:41:50,442 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 23 transitions. Word has length 14 [2022-04-15 06:41:50,442 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 06:41:50,442 INFO L478 AbstractCegarLoop]: Abstraction has 20 states and 23 transitions. [2022-04-15 06:41:50,442 INFO L479 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-15 06:41:50,442 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 20 states and 23 transitions. [2022-04-15 06:41:50,459 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-15 06:41:50,459 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 23 transitions. [2022-04-15 06:41:50,460 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-04-15 06:41:50,460 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 06:41:50,460 INFO L499 BasicCegarLoop]: trace histogram [3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 06:41:50,460 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-04-15 06:41:50,460 INFO L403 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 06:41:50,460 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 06:41:50,460 INFO L85 PathProgramCache]: Analyzing trace with hash -1342594849, now seen corresponding path program 1 times [2022-04-15 06:41:50,460 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 06:41:50,460 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [881320738] [2022-04-15 06:41:54,560 WARN L977 rdanLoopAcceleration]: Unable to prove correctness of quantifier elimination. [2022-04-15 06:41:54,629 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-15 06:41:58,800 WARN L977 rdanLoopAcceleration]: Unable to prove correctness of quantifier elimination. [2022-04-15 06:41:58,965 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-15 06:41:58,966 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-15 06:41:58,969 INFO L85 PathProgramCache]: Analyzing trace with hash -538275198, now seen corresponding path program 1 times [2022-04-15 06:41:58,969 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 06:41:58,969 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [385728943] [2022-04-15 06:41:58,969 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 06:41:58,969 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 06:41:59,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:41:59,104 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 06:41:59,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:41:59,117 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-15 06:41:59,117 INFO L290 TraceCheckUtils]: 1: Hoare triple {428#true} assume true; {428#true} is VALID [2022-04-15 06:41:59,117 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {428#true} {428#true} #52#return; {428#true} is VALID [2022-04-15 06:41:59,119 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-15 06:41:59,120 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-15 06:41:59,120 INFO L290 TraceCheckUtils]: 2: Hoare triple {428#true} assume true; {428#true} is VALID [2022-04-15 06:41:59,120 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {428#true} {428#true} #52#return; {428#true} is VALID [2022-04-15 06:41:59,120 INFO L272 TraceCheckUtils]: 4: Hoare triple {428#true} call #t~ret9 := main(); {428#true} is VALID [2022-04-15 06:41:59,121 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-15 06:41:59,122 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-15 06:41:59,123 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-15 06:41:59,124 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-15 06:41:59,124 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-15 06:41:59,125 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-15 06:41:59,125 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-15 06:41:59,125 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-15 06:41:59,126 INFO L290 TraceCheckUtils]: 13: Hoare triple {429#false} ~cond := #in~cond; {429#false} is VALID [2022-04-15 06:41:59,126 INFO L290 TraceCheckUtils]: 14: Hoare triple {429#false} assume 0 == ~cond; {429#false} is VALID [2022-04-15 06:41:59,126 INFO L290 TraceCheckUtils]: 15: Hoare triple {429#false} assume !false; {429#false} is VALID [2022-04-15 06:41:59,126 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-15 06:41:59,126 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 06:41:59,127 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [385728943] [2022-04-15 06:41:59,127 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [385728943] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 06:41:59,127 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [376444270] [2022-04-15 06:41:59,127 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 06:41:59,127 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 06:41:59,127 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 06:41:59,129 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-15 06:41:59,163 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-15 06:41:59,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:41:59,183 INFO L263 TraceCheckSpWp]: Trace formula consists of 64 conjuncts, 8 conjunts are in the unsatisfiable core [2022-04-15 06:41:59,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:41:59,195 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 06:41:59,588 INFO L272 TraceCheckUtils]: 0: Hoare triple {428#true} call ULTIMATE.init(); {428#true} is VALID [2022-04-15 06:41:59,588 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-15 06:41:59,588 INFO L290 TraceCheckUtils]: 2: Hoare triple {428#true} assume true; {428#true} is VALID [2022-04-15 06:41:59,589 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {428#true} {428#true} #52#return; {428#true} is VALID [2022-04-15 06:41:59,589 INFO L272 TraceCheckUtils]: 4: Hoare triple {428#true} call #t~ret9 := main(); {428#true} is VALID [2022-04-15 06:41:59,589 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-15 06:41:59,590 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-15 06:41:59,590 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-15 06:41:59,591 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-15 06:41:59,592 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-15 06:41:59,592 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-15 06:41:59,593 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-15 06:41:59,593 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-15 06:41:59,593 INFO L290 TraceCheckUtils]: 13: Hoare triple {429#false} ~cond := #in~cond; {429#false} is VALID [2022-04-15 06:41:59,593 INFO L290 TraceCheckUtils]: 14: Hoare triple {429#false} assume 0 == ~cond; {429#false} is VALID [2022-04-15 06:41:59,593 INFO L290 TraceCheckUtils]: 15: Hoare triple {429#false} assume !false; {429#false} is VALID [2022-04-15 06:41:59,594 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-15 06:41:59,594 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 06:42:00,093 INFO L290 TraceCheckUtils]: 15: Hoare triple {429#false} assume !false; {429#false} is VALID [2022-04-15 06:42:00,093 INFO L290 TraceCheckUtils]: 14: Hoare triple {429#false} assume 0 == ~cond; {429#false} is VALID [2022-04-15 06:42:00,093 INFO L290 TraceCheckUtils]: 13: Hoare triple {429#false} ~cond := #in~cond; {429#false} is VALID [2022-04-15 06:42:00,093 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-15 06:42:00,094 INFO L290 TraceCheckUtils]: 11: Hoare triple {504#(< main_~z~0 main_~y~0)} assume !(~y~0 > ~z~0); {429#false} is VALID [2022-04-15 06:42:00,094 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-15 06:42:00,095 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-15 06:42:00,096 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-15 06:42:00,096 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-15 06:42:00,097 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-15 06:42:00,098 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-15 06:42:00,098 INFO L272 TraceCheckUtils]: 4: Hoare triple {428#true} call #t~ret9 := main(); {428#true} is VALID [2022-04-15 06:42:00,098 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {428#true} {428#true} #52#return; {428#true} is VALID [2022-04-15 06:42:00,098 INFO L290 TraceCheckUtils]: 2: Hoare triple {428#true} assume true; {428#true} is VALID [2022-04-15 06:42:00,098 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-15 06:42:00,098 INFO L272 TraceCheckUtils]: 0: Hoare triple {428#true} call ULTIMATE.init(); {428#true} is VALID [2022-04-15 06:42:00,099 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-15 06:42:00,099 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [376444270] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 06:42:00,099 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 06:42:00,099 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7, 7] total 18 [2022-04-15 06:42:00,258 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 06:42:00,258 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [881320738] [2022-04-15 06:42:00,258 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [881320738] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 06:42:00,258 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 06:42:00,258 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-04-15 06:42:00,258 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1913842224] [2022-04-15 06:42:00,258 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 06:42:00,259 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-15 06:42:00,259 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 06:42:00,259 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-15 06:42:00,278 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-15 06:42:00,278 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-04-15 06:42:00,278 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 06:42:00,279 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-04-15 06:42:00,279 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=141, Invalid=321, Unknown=0, NotChecked=0, Total=462 [2022-04-15 06:42:00,279 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-15 06:42:00,563 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:42:00,563 INFO L93 Difference]: Finished difference Result 38 states and 48 transitions. [2022-04-15 06:42:00,563 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-04-15 06:42:00,563 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-15 06:42:00,563 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 06:42:00,564 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-15 06:42:00,564 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 38 transitions. [2022-04-15 06:42:00,565 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-15 06:42:00,565 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 38 transitions. [2022-04-15 06:42:00,565 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 7 states and 38 transitions. [2022-04-15 06:42:00,600 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-15 06:42:00,601 INFO L225 Difference]: With dead ends: 38 [2022-04-15 06:42:00,601 INFO L226 Difference]: Without dead ends: 26 [2022-04-15 06:42:00,601 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 30 SyntacticMatches, 2 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 158 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=191, Invalid=459, Unknown=0, NotChecked=0, Total=650 [2022-04-15 06:42:00,602 INFO L913 BasicCegarLoop]: 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-15 06:42:00,602 INFO L914 BasicCegarLoop]: 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-15 06:42:00,603 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2022-04-15 06:42:00,623 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 26. [2022-04-15 06:42:00,623 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 06:42:00,623 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-15 06:42:00,623 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-15 06:42:00,624 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-15 06:42:00,625 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:42:00,625 INFO L93 Difference]: Finished difference Result 26 states and 30 transitions. [2022-04-15 06:42:00,625 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 30 transitions. [2022-04-15 06:42:00,625 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 06:42:00,625 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 06:42:00,625 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-15 06:42:00,625 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-15 06:42:00,626 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:42:00,626 INFO L93 Difference]: Finished difference Result 26 states and 30 transitions. [2022-04-15 06:42:00,626 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 30 transitions. [2022-04-15 06:42:00,627 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 06:42:00,627 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 06:42:00,627 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 06:42:00,627 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 06:42:00,627 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-15 06:42:00,628 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 30 transitions. [2022-04-15 06:42:00,628 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 30 transitions. Word has length 19 [2022-04-15 06:42:00,628 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 06:42:00,628 INFO L478 AbstractCegarLoop]: Abstraction has 26 states and 30 transitions. [2022-04-15 06:42:00,628 INFO L479 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-15 06:42:00,628 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 26 states and 30 transitions. [2022-04-15 06:42:00,656 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-15 06:42:00,656 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 30 transitions. [2022-04-15 06:42:00,656 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-04-15 06:42:00,656 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 06:42:00,656 INFO L499 BasicCegarLoop]: trace histogram [4, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 06:42:00,674 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2022-04-15 06:42:00,859 WARN L460 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-15 06:42:00,860 INFO L403 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 06:42:00,860 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 06:42:00,860 INFO L85 PathProgramCache]: Analyzing trace with hash 952217402, now seen corresponding path program 2 times [2022-04-15 06:42:00,860 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 06:42:00,860 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [272020994] [2022-04-15 06:42:04,940 WARN L977 rdanLoopAcceleration]: Unable to prove correctness of quantifier elimination. [2022-04-15 06:42:05,028 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-15 06:42:05,324 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-15 06:42:05,326 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-15 06:42:05,328 INFO L85 PathProgramCache]: Analyzing trace with hash 1967108994, now seen corresponding path program 1 times [2022-04-15 06:42:05,329 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 06:42:05,329 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1528909600] [2022-04-15 06:42:05,329 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 06:42:05,329 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 06:42:05,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:42:05,399 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 06:42:05,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:42:05,417 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-15 06:42:05,417 INFO L290 TraceCheckUtils]: 1: Hoare triple {736#true} assume true; {736#true} is VALID [2022-04-15 06:42:05,417 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {736#true} {736#true} #52#return; {736#true} is VALID [2022-04-15 06:42:05,418 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-15 06:42:05,418 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-15 06:42:05,418 INFO L290 TraceCheckUtils]: 2: Hoare triple {736#true} assume true; {736#true} is VALID [2022-04-15 06:42:05,418 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {736#true} {736#true} #52#return; {736#true} is VALID [2022-04-15 06:42:05,418 INFO L272 TraceCheckUtils]: 4: Hoare triple {736#true} call #t~ret9 := main(); {736#true} is VALID [2022-04-15 06:42:05,419 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-15 06:42:05,419 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-15 06:42:05,420 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-15 06:42:05,420 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-15 06:42:05,421 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-15 06:42:05,421 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-15 06:42:05,422 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-15 06:42:05,422 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-15 06:42:05,422 INFO L290 TraceCheckUtils]: 13: Hoare triple {737#false} ~cond := #in~cond; {737#false} is VALID [2022-04-15 06:42:05,422 INFO L290 TraceCheckUtils]: 14: Hoare triple {737#false} assume 0 == ~cond; {737#false} is VALID [2022-04-15 06:42:05,422 INFO L290 TraceCheckUtils]: 15: Hoare triple {737#false} assume !false; {737#false} is VALID [2022-04-15 06:42:05,422 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-15 06:42:05,423 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 06:42:05,423 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1528909600] [2022-04-15 06:42:05,423 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1528909600] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 06:42:05,423 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [574101677] [2022-04-15 06:42:05,423 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 06:42:05,423 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 06:42:05,423 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 06:42:05,424 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-15 06:42:05,425 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-15 06:42:05,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:42:05,450 INFO L263 TraceCheckSpWp]: Trace formula consists of 64 conjuncts, 5 conjunts are in the unsatisfiable core [2022-04-15 06:42:05,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:42:05,456 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 06:42:05,595 INFO L272 TraceCheckUtils]: 0: Hoare triple {736#true} call ULTIMATE.init(); {736#true} is VALID [2022-04-15 06:42:05,596 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-15 06:42:05,596 INFO L290 TraceCheckUtils]: 2: Hoare triple {736#true} assume true; {736#true} is VALID [2022-04-15 06:42:05,596 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {736#true} {736#true} #52#return; {736#true} is VALID [2022-04-15 06:42:05,596 INFO L272 TraceCheckUtils]: 4: Hoare triple {736#true} call #t~ret9 := main(); {736#true} is VALID [2022-04-15 06:42:05,603 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-15 06:42:05,604 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-15 06:42:05,604 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-15 06:42:05,605 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-15 06:42:05,606 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-15 06:42:05,606 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-15 06:42:05,607 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-15 06:42:05,607 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-15 06:42:05,607 INFO L290 TraceCheckUtils]: 13: Hoare triple {737#false} ~cond := #in~cond; {737#false} is VALID [2022-04-15 06:42:05,607 INFO L290 TraceCheckUtils]: 14: Hoare triple {737#false} assume 0 == ~cond; {737#false} is VALID [2022-04-15 06:42:05,607 INFO L290 TraceCheckUtils]: 15: Hoare triple {737#false} assume !false; {737#false} is VALID [2022-04-15 06:42:05,608 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-15 06:42:05,608 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 06:42:05,767 INFO L290 TraceCheckUtils]: 15: Hoare triple {737#false} assume !false; {737#false} is VALID [2022-04-15 06:42:05,767 INFO L290 TraceCheckUtils]: 14: Hoare triple {737#false} assume 0 == ~cond; {737#false} is VALID [2022-04-15 06:42:05,767 INFO L290 TraceCheckUtils]: 13: Hoare triple {737#false} ~cond := #in~cond; {737#false} is VALID [2022-04-15 06:42:05,767 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-15 06:42:05,768 INFO L290 TraceCheckUtils]: 11: Hoare triple {806#(< main_~z~0 main_~y~0)} assume !(~y~0 > ~z~0); {737#false} is VALID [2022-04-15 06:42:05,769 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-15 06:42:05,769 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-15 06:42:05,770 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-15 06:42:05,770 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-15 06:42:05,771 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-15 06:42:05,771 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-15 06:42:05,771 INFO L272 TraceCheckUtils]: 4: Hoare triple {736#true} call #t~ret9 := main(); {736#true} is VALID [2022-04-15 06:42:05,771 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {736#true} {736#true} #52#return; {736#true} is VALID [2022-04-15 06:42:05,772 INFO L290 TraceCheckUtils]: 2: Hoare triple {736#true} assume true; {736#true} is VALID [2022-04-15 06:42:05,772 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-15 06:42:05,772 INFO L272 TraceCheckUtils]: 0: Hoare triple {736#true} call ULTIMATE.init(); {736#true} is VALID [2022-04-15 06:42:05,772 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-15 06:42:05,772 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [574101677] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 06:42:05,772 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 06:42:05,772 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4, 4] total 9 [2022-04-15 06:42:05,914 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 06:42:05,914 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [272020994] [2022-04-15 06:42:05,914 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [272020994] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 06:42:05,914 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 06:42:05,914 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-04-15 06:42:05,914 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1950158123] [2022-04-15 06:42:05,914 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 06:42:05,915 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-15 06:42:05,915 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 06:42:05,915 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-15 06:42:05,930 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-15 06:42:05,930 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-04-15 06:42:05,930 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 06:42:05,931 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-04-15 06:42:05,931 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=73, Invalid=109, Unknown=0, NotChecked=0, Total=182 [2022-04-15 06:42:05,931 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-15 06:42:06,208 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:42:06,208 INFO L93 Difference]: Finished difference Result 45 states and 59 transitions. [2022-04-15 06:42:06,208 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-04-15 06:42:06,208 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-15 06:42:06,208 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 06:42:06,209 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-15 06:42:06,210 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 45 transitions. [2022-04-15 06:42:06,210 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-15 06:42:06,211 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 45 transitions. [2022-04-15 06:42:06,211 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 10 states and 45 transitions. [2022-04-15 06:42:06,261 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-15 06:42:06,262 INFO L225 Difference]: With dead ends: 45 [2022-04-15 06:42:06,262 INFO L226 Difference]: Without dead ends: 33 [2022-04-15 06:42:06,262 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 38 SyntacticMatches, 2 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 91 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=158, Invalid=262, Unknown=0, NotChecked=0, Total=420 [2022-04-15 06:42:06,263 INFO L913 BasicCegarLoop]: 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-15 06:42:06,263 INFO L914 BasicCegarLoop]: 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-15 06:42:06,263 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2022-04-15 06:42:06,287 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 27. [2022-04-15 06:42:06,287 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 06:42:06,287 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-15 06:42:06,287 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-15 06:42:06,287 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-15 06:42:06,288 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:42:06,288 INFO L93 Difference]: Finished difference Result 33 states and 37 transitions. [2022-04-15 06:42:06,289 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 37 transitions. [2022-04-15 06:42:06,289 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 06:42:06,289 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 06:42:06,289 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-15 06:42:06,289 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-15 06:42:06,290 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:42:06,290 INFO L93 Difference]: Finished difference Result 33 states and 37 transitions. [2022-04-15 06:42:06,290 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 37 transitions. [2022-04-15 06:42:06,290 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 06:42:06,291 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 06:42:06,291 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 06:42:06,291 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 06:42:06,291 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-15 06:42:06,291 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 30 transitions. [2022-04-15 06:42:06,292 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 30 transitions. Word has length 21 [2022-04-15 06:42:06,292 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 06:42:06,292 INFO L478 AbstractCegarLoop]: Abstraction has 27 states and 30 transitions. [2022-04-15 06:42:06,292 INFO L479 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-15 06:42:06,292 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 27 states and 30 transitions. [2022-04-15 06:42:06,317 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-15 06:42:06,317 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 30 transitions. [2022-04-15 06:42:06,318 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2022-04-15 06:42:06,318 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 06:42:06,318 INFO L499 BasicCegarLoop]: trace histogram [6, 5, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 06:42:06,335 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2022-04-15 06:42:06,535 WARN L460 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-15 06:42:06,535 INFO L403 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 06:42:06,536 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 06:42:06,536 INFO L85 PathProgramCache]: Analyzing trace with hash 2108341683, now seen corresponding path program 3 times [2022-04-15 06:42:06,536 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 06:42:06,536 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [803799336] [2022-04-15 06:42:10,609 WARN L977 rdanLoopAcceleration]: Unable to prove correctness of quantifier elimination. [2022-04-15 06:42:10,692 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-15 06:42:14,860 WARN L977 rdanLoopAcceleration]: Unable to prove correctness of quantifier elimination. [2022-04-15 06:42:14,994 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-15 06:42:14,995 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-15 06:42:14,998 INFO L85 PathProgramCache]: Analyzing trace with hash 1243873057, now seen corresponding path program 1 times [2022-04-15 06:42:14,998 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 06:42:14,998 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1924642401] [2022-04-15 06:42:14,998 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 06:42:14,998 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 06:42:15,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:42:15,096 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 06:42:15,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:42:15,103 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-15 06:42:15,103 INFO L290 TraceCheckUtils]: 1: Hoare triple {1072#true} assume true; {1072#true} is VALID [2022-04-15 06:42:15,103 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {1072#true} {1072#true} #52#return; {1072#true} is VALID [2022-04-15 06:42:15,104 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-15 06:42:15,104 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-15 06:42:15,104 INFO L290 TraceCheckUtils]: 2: Hoare triple {1072#true} assume true; {1072#true} is VALID [2022-04-15 06:42:15,104 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1072#true} {1072#true} #52#return; {1072#true} is VALID [2022-04-15 06:42:15,104 INFO L272 TraceCheckUtils]: 4: Hoare triple {1072#true} call #t~ret9 := main(); {1072#true} is VALID [2022-04-15 06:42:15,104 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-15 06:42:15,105 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-15 06:42:15,106 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-15 06:42:15,106 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-15 06:42:15,107 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-15 06:42:15,107 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-15 06:42:15,108 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-15 06:42:15,108 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-15 06:42:15,108 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-15 06:42:15,109 INFO L290 TraceCheckUtils]: 14: Hoare triple {1073#false} ~cond := #in~cond; {1073#false} is VALID [2022-04-15 06:42:15,109 INFO L290 TraceCheckUtils]: 15: Hoare triple {1073#false} assume 0 == ~cond; {1073#false} is VALID [2022-04-15 06:42:15,109 INFO L290 TraceCheckUtils]: 16: Hoare triple {1073#false} assume !false; {1073#false} is VALID [2022-04-15 06:42:15,109 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-15 06:42:15,109 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 06:42:15,109 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1924642401] [2022-04-15 06:42:15,109 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1924642401] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 06:42:15,109 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1743763828] [2022-04-15 06:42:15,109 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 06:42:15,109 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 06:42:15,110 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 06:42:15,110 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-15 06:42:15,111 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-15 06:42:15,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:42:15,137 INFO L263 TraceCheckSpWp]: Trace formula consists of 69 conjuncts, 9 conjunts are in the unsatisfiable core [2022-04-15 06:42:15,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:42:15,146 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 06:42:15,528 INFO L272 TraceCheckUtils]: 0: Hoare triple {1072#true} call ULTIMATE.init(); {1072#true} is VALID [2022-04-15 06:42:15,528 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-15 06:42:15,528 INFO L290 TraceCheckUtils]: 2: Hoare triple {1072#true} assume true; {1072#true} is VALID [2022-04-15 06:42:15,528 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1072#true} {1072#true} #52#return; {1072#true} is VALID [2022-04-15 06:42:15,528 INFO L272 TraceCheckUtils]: 4: Hoare triple {1072#true} call #t~ret9 := main(); {1072#true} is VALID [2022-04-15 06:42:15,529 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-15 06:42:15,529 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-15 06:42:15,530 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-15 06:42:15,531 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-15 06:42:15,531 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-15 06:42:15,532 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-15 06:42:15,533 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-15 06:42:15,533 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-15 06:42:15,533 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-15 06:42:15,533 INFO L290 TraceCheckUtils]: 14: Hoare triple {1073#false} ~cond := #in~cond; {1073#false} is VALID [2022-04-15 06:42:15,533 INFO L290 TraceCheckUtils]: 15: Hoare triple {1073#false} assume 0 == ~cond; {1073#false} is VALID [2022-04-15 06:42:15,533 INFO L290 TraceCheckUtils]: 16: Hoare triple {1073#false} assume !false; {1073#false} is VALID [2022-04-15 06:42:15,534 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-15 06:42:15,534 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 06:42:15,997 INFO L290 TraceCheckUtils]: 16: Hoare triple {1073#false} assume !false; {1073#false} is VALID [2022-04-15 06:42:15,997 INFO L290 TraceCheckUtils]: 15: Hoare triple {1073#false} assume 0 == ~cond; {1073#false} is VALID [2022-04-15 06:42:15,997 INFO L290 TraceCheckUtils]: 14: Hoare triple {1073#false} ~cond := #in~cond; {1073#false} is VALID [2022-04-15 06:42:15,998 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-15 06:42:15,998 INFO L290 TraceCheckUtils]: 12: Hoare triple {1153#(< main_~z~0 main_~y~0)} assume !(~y~0 > ~z~0); {1073#false} is VALID [2022-04-15 06:42:15,999 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-15 06:42:15,999 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-15 06:42:16,000 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-15 06:42:16,001 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-15 06:42:16,001 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-15 06:42:16,002 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-15 06:42:16,002 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-15 06:42:16,002 INFO L272 TraceCheckUtils]: 4: Hoare triple {1072#true} call #t~ret9 := main(); {1072#true} is VALID [2022-04-15 06:42:16,002 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1072#true} {1072#true} #52#return; {1072#true} is VALID [2022-04-15 06:42:16,003 INFO L290 TraceCheckUtils]: 2: Hoare triple {1072#true} assume true; {1072#true} is VALID [2022-04-15 06:42:16,003 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-15 06:42:16,003 INFO L272 TraceCheckUtils]: 0: Hoare triple {1072#true} call ULTIMATE.init(); {1072#true} is VALID [2022-04-15 06:42:16,003 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-15 06:42:16,003 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1743763828] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 06:42:16,003 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 06:42:16,003 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8, 8] total 21 [2022-04-15 06:42:16,237 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 06:42:16,237 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [803799336] [2022-04-15 06:42:16,237 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [803799336] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 06:42:16,238 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 06:42:16,238 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2022-04-15 06:42:16,238 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1718093902] [2022-04-15 06:42:16,238 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 06:42:16,238 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-15 06:42:16,238 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 06:42:16,238 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-15 06:42:16,257 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-15 06:42:16,258 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-04-15 06:42:16,258 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 06:42:16,258 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-04-15 06:42:16,259 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=208, Invalid=548, Unknown=0, NotChecked=0, Total=756 [2022-04-15 06:42:16,259 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-15 06:42:16,787 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:42:16,787 INFO L93 Difference]: Finished difference Result 58 states and 68 transitions. [2022-04-15 06:42:16,787 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-04-15 06:42:16,788 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-15 06:42:16,788 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 06:42:16,788 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-15 06:42:16,789 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 44 transitions. [2022-04-15 06:42:16,789 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-15 06:42:16,790 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 44 transitions. [2022-04-15 06:42:16,790 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 10 states and 44 transitions. [2022-04-15 06:42:16,827 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-15 06:42:16,828 INFO L225 Difference]: With dead ends: 58 [2022-04-15 06:42:16,828 INFO L226 Difference]: Without dead ends: 39 [2022-04-15 06:42:16,829 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 33 SyntacticMatches, 2 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 272 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=298, Invalid=892, Unknown=0, NotChecked=0, Total=1190 [2022-04-15 06:42:16,829 INFO L913 BasicCegarLoop]: 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-15 06:42:16,830 INFO L914 BasicCegarLoop]: 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-15 06:42:16,830 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2022-04-15 06:42:16,889 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 39. [2022-04-15 06:42:16,890 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 06:42:16,890 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-15 06:42:16,890 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-15 06:42:16,890 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-15 06:42:16,891 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:42:16,891 INFO L93 Difference]: Finished difference Result 39 states and 43 transitions. [2022-04-15 06:42:16,891 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 43 transitions. [2022-04-15 06:42:16,891 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 06:42:16,892 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 06:42:16,892 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-15 06:42:16,892 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-15 06:42:16,893 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:42:16,893 INFO L93 Difference]: Finished difference Result 39 states and 43 transitions. [2022-04-15 06:42:16,893 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 43 transitions. [2022-04-15 06:42:16,893 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 06:42:16,893 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 06:42:16,893 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 06:42:16,893 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 06:42:16,893 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-15 06:42:16,894 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 43 transitions. [2022-04-15 06:42:16,894 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 43 transitions. Word has length 26 [2022-04-15 06:42:16,900 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 06:42:16,900 INFO L478 AbstractCegarLoop]: Abstraction has 39 states and 43 transitions. [2022-04-15 06:42:16,900 INFO L479 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-15 06:42:16,900 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 39 states and 43 transitions. [2022-04-15 06:42:16,937 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-15 06:42:16,937 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 43 transitions. [2022-04-15 06:42:16,939 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2022-04-15 06:42:16,939 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 06:42:16,939 INFO L499 BasicCegarLoop]: trace histogram [7, 6, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 06:42:16,957 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-15 06:42:17,151 WARN L460 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-15 06:42:17,151 INFO L403 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 06:42:17,152 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 06:42:17,152 INFO L85 PathProgramCache]: Analyzing trace with hash 1096934136, now seen corresponding path program 4 times [2022-04-15 06:42:17,152 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 06:42:17,152 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [772268140] [2022-04-15 06:42:21,222 WARN L977 rdanLoopAcceleration]: Unable to prove correctness of quantifier elimination. [2022-04-15 06:42:21,275 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-15 06:42:21,555 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-15 06:42:21,560 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-15 06:42:21,563 INFO L85 PathProgramCache]: Analyzing trace with hash 1601371681, now seen corresponding path program 1 times [2022-04-15 06:42:21,563 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 06:42:21,563 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1454037846] [2022-04-15 06:42:21,564 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 06:42:21,564 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 06:42:21,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:42:21,671 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 06:42:21,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:42:21,676 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-15 06:42:21,676 INFO L290 TraceCheckUtils]: 1: Hoare triple {1490#true} assume true; {1490#true} is VALID [2022-04-15 06:42:21,676 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {1490#true} {1490#true} #52#return; {1490#true} is VALID [2022-04-15 06:42:21,677 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-15 06:42:21,677 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-15 06:42:21,677 INFO L290 TraceCheckUtils]: 2: Hoare triple {1490#true} assume true; {1490#true} is VALID [2022-04-15 06:42:21,677 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1490#true} {1490#true} #52#return; {1490#true} is VALID [2022-04-15 06:42:21,677 INFO L272 TraceCheckUtils]: 4: Hoare triple {1490#true} call #t~ret9 := main(); {1490#true} is VALID [2022-04-15 06:42:21,678 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-15 06:42:21,678 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-15 06:42:21,679 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-15 06:42:21,680 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-15 06:42:21,680 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-15 06:42:21,681 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-15 06:42:21,681 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-15 06:42:21,682 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-15 06:42:21,682 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-15 06:42:21,682 INFO L290 TraceCheckUtils]: 14: Hoare triple {1491#false} ~cond := #in~cond; {1491#false} is VALID [2022-04-15 06:42:21,682 INFO L290 TraceCheckUtils]: 15: Hoare triple {1491#false} assume 0 == ~cond; {1491#false} is VALID [2022-04-15 06:42:21,682 INFO L290 TraceCheckUtils]: 16: Hoare triple {1491#false} assume !false; {1491#false} is VALID [2022-04-15 06:42:21,682 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-15 06:42:21,682 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 06:42:21,682 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1454037846] [2022-04-15 06:42:21,682 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1454037846] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 06:42:21,683 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [252901103] [2022-04-15 06:42:21,683 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 06:42:21,683 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 06:42:21,683 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 06:42:21,684 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-15 06:42:21,684 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-15 06:42:21,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:42:21,729 INFO L263 TraceCheckSpWp]: Trace formula consists of 69 conjuncts, 6 conjunts are in the unsatisfiable core [2022-04-15 06:42:21,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:42:21,749 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 06:42:21,939 INFO L272 TraceCheckUtils]: 0: Hoare triple {1490#true} call ULTIMATE.init(); {1490#true} is VALID [2022-04-15 06:42:21,939 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-15 06:42:21,939 INFO L290 TraceCheckUtils]: 2: Hoare triple {1490#true} assume true; {1490#true} is VALID [2022-04-15 06:42:21,939 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1490#true} {1490#true} #52#return; {1490#true} is VALID [2022-04-15 06:42:21,939 INFO L272 TraceCheckUtils]: 4: Hoare triple {1490#true} call #t~ret9 := main(); {1490#true} is VALID [2022-04-15 06:42:21,940 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-15 06:42:21,940 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-15 06:42:21,941 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-15 06:42:21,942 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-15 06:42:21,942 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-15 06:42:21,943 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-15 06:42:21,943 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-15 06:42:21,944 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-15 06:42:21,944 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-15 06:42:21,944 INFO L290 TraceCheckUtils]: 14: Hoare triple {1491#false} ~cond := #in~cond; {1491#false} is VALID [2022-04-15 06:42:21,944 INFO L290 TraceCheckUtils]: 15: Hoare triple {1491#false} assume 0 == ~cond; {1491#false} is VALID [2022-04-15 06:42:21,944 INFO L290 TraceCheckUtils]: 16: Hoare triple {1491#false} assume !false; {1491#false} is VALID [2022-04-15 06:42:21,944 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-15 06:42:21,944 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 06:42:22,159 INFO L290 TraceCheckUtils]: 16: Hoare triple {1491#false} assume !false; {1491#false} is VALID [2022-04-15 06:42:22,159 INFO L290 TraceCheckUtils]: 15: Hoare triple {1491#false} assume 0 == ~cond; {1491#false} is VALID [2022-04-15 06:42:22,160 INFO L290 TraceCheckUtils]: 14: Hoare triple {1491#false} ~cond := #in~cond; {1491#false} is VALID [2022-04-15 06:42:22,160 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-15 06:42:22,166 INFO L290 TraceCheckUtils]: 12: Hoare triple {1568#(< main_~z~0 main_~y~0)} assume !(~y~0 > ~z~0); {1491#false} is VALID [2022-04-15 06:42:22,166 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-15 06:42:22,167 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-15 06:42:22,167 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-15 06:42:22,168 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-15 06:42:22,168 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-15 06:42:22,169 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-15 06:42:22,169 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-15 06:42:22,169 INFO L272 TraceCheckUtils]: 4: Hoare triple {1490#true} call #t~ret9 := main(); {1490#true} is VALID [2022-04-15 06:42:22,170 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1490#true} {1490#true} #52#return; {1490#true} is VALID [2022-04-15 06:42:22,170 INFO L290 TraceCheckUtils]: 2: Hoare triple {1490#true} assume true; {1490#true} is VALID [2022-04-15 06:42:22,170 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-15 06:42:22,170 INFO L272 TraceCheckUtils]: 0: Hoare triple {1490#true} call ULTIMATE.init(); {1490#true} is VALID [2022-04-15 06:42:22,170 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-15 06:42:22,170 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [252901103] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 06:42:22,170 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 06:42:22,170 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 5, 5] total 15 [2022-04-15 06:42:22,431 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 06:42:22,431 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [772268140] [2022-04-15 06:42:22,431 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [772268140] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 06:42:22,432 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 06:42:22,432 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2022-04-15 06:42:22,432 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1561397108] [2022-04-15 06:42:22,432 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 06:42:22,432 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-15 06:42:22,432 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 06:42:22,432 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-15 06:42:22,453 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-15 06:42:22,454 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-04-15 06:42:22,454 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 06:42:22,454 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-04-15 06:42:22,454 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=180, Invalid=326, Unknown=0, NotChecked=0, Total=506 [2022-04-15 06:42:22,454 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-15 06:42:23,013 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:42:23,013 INFO L93 Difference]: Finished difference Result 61 states and 71 transitions. [2022-04-15 06:42:23,013 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-04-15 06:42:23,013 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-15 06:42:23,013 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 06:42:23,013 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-15 06:42:23,014 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 49 transitions. [2022-04-15 06:42:23,015 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-15 06:42:23,015 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 49 transitions. [2022-04-15 06:42:23,015 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 14 states and 49 transitions. [2022-04-15 06:42:23,061 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-15 06:42:23,063 INFO L225 Difference]: With dead ends: 61 [2022-04-15 06:42:23,063 INFO L226 Difference]: Without dead ends: 42 [2022-04-15 06:42:23,063 INFO L912 BasicCegarLoop]: 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-15 06:42:23,064 INFO L913 BasicCegarLoop]: 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-15 06:42:23,064 INFO L914 BasicCegarLoop]: 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-15 06:42:23,065 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2022-04-15 06:42:23,128 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 42. [2022-04-15 06:42:23,128 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 06:42:23,129 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-15 06:42:23,129 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-15 06:42:23,129 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-15 06:42:23,130 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:42:23,130 INFO L93 Difference]: Finished difference Result 42 states and 46 transitions. [2022-04-15 06:42:23,130 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 46 transitions. [2022-04-15 06:42:23,130 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 06:42:23,130 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 06:42:23,131 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-15 06:42:23,131 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-15 06:42:23,132 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:42:23,132 INFO L93 Difference]: Finished difference Result 42 states and 46 transitions. [2022-04-15 06:42:23,132 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 46 transitions. [2022-04-15 06:42:23,132 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 06:42:23,132 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 06:42:23,132 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 06:42:23,132 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 06:42:23,132 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-15 06:42:23,133 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 46 transitions. [2022-04-15 06:42:23,133 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 46 transitions. Word has length 28 [2022-04-15 06:42:23,133 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 06:42:23,133 INFO L478 AbstractCegarLoop]: Abstraction has 42 states and 46 transitions. [2022-04-15 06:42:23,133 INFO L479 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-15 06:42:23,133 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 42 states and 46 transitions. [2022-04-15 06:42:23,178 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-15 06:42:23,178 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 46 transitions. [2022-04-15 06:42:23,179 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2022-04-15 06:42:23,179 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 06:42:23,179 INFO L499 BasicCegarLoop]: trace histogram [8, 7, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 06:42:23,202 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2022-04-15 06:42:23,379 WARN L460 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-15 06:42:23,380 INFO L403 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 06:42:23,380 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 06:42:23,380 INFO L85 PathProgramCache]: Analyzing trace with hash -1965893626, now seen corresponding path program 5 times [2022-04-15 06:42:23,380 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 06:42:23,380 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [838286844] [2022-04-15 06:42:23,497 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-15 06:42:23,747 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-15 06:42:23,748 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-15 06:42:23,751 INFO L85 PathProgramCache]: Analyzing trace with hash 630975074, now seen corresponding path program 1 times [2022-04-15 06:42:23,751 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 06:42:23,751 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2096969660] [2022-04-15 06:42:23,751 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 06:42:23,751 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 06:42:23,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:42:23,823 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 06:42:23,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:42:23,840 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-15 06:42:23,840 INFO L290 TraceCheckUtils]: 1: Hoare triple {1929#true} assume true; {1929#true} is VALID [2022-04-15 06:42:23,840 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {1929#true} {1929#true} #52#return; {1929#true} is VALID [2022-04-15 06:42:23,840 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-15 06:42:23,841 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-15 06:42:23,841 INFO L290 TraceCheckUtils]: 2: Hoare triple {1929#true} assume true; {1929#true} is VALID [2022-04-15 06:42:23,841 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1929#true} {1929#true} #52#return; {1929#true} is VALID [2022-04-15 06:42:23,841 INFO L272 TraceCheckUtils]: 4: Hoare triple {1929#true} call #t~ret9 := main(); {1929#true} is VALID [2022-04-15 06:42:23,841 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-15 06:42:23,842 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-15 06:42:23,842 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-15 06:42:23,843 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-15 06:42:23,844 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-15 06:42:23,844 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-15 06:42:23,845 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-15 06:42:23,845 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-15 06:42:23,846 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-15 06:42:23,846 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-15 06:42:23,846 INFO L290 TraceCheckUtils]: 15: Hoare triple {1930#false} ~cond := #in~cond; {1930#false} is VALID [2022-04-15 06:42:23,846 INFO L290 TraceCheckUtils]: 16: Hoare triple {1930#false} assume 0 == ~cond; {1930#false} is VALID [2022-04-15 06:42:23,846 INFO L290 TraceCheckUtils]: 17: Hoare triple {1930#false} assume !false; {1930#false} is VALID [2022-04-15 06:42:23,846 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-15 06:42:23,846 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 06:42:23,846 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2096969660] [2022-04-15 06:42:23,846 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2096969660] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 06:42:23,846 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [167702464] [2022-04-15 06:42:23,847 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 06:42:23,847 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 06:42:23,847 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 06:42:23,848 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-15 06:42:23,848 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-15 06:42:23,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:42:23,875 INFO L263 TraceCheckSpWp]: Trace formula consists of 74 conjuncts, 7 conjunts are in the unsatisfiable core [2022-04-15 06:42:23,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:42:23,882 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 06:42:24,055 INFO L272 TraceCheckUtils]: 0: Hoare triple {1929#true} call ULTIMATE.init(); {1929#true} is VALID [2022-04-15 06:42:24,055 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-15 06:42:24,055 INFO L290 TraceCheckUtils]: 2: Hoare triple {1929#true} assume true; {1929#true} is VALID [2022-04-15 06:42:24,055 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1929#true} {1929#true} #52#return; {1929#true} is VALID [2022-04-15 06:42:24,056 INFO L272 TraceCheckUtils]: 4: Hoare triple {1929#true} call #t~ret9 := main(); {1929#true} is VALID [2022-04-15 06:42:24,056 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-15 06:42:24,056 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-15 06:42:24,057 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-15 06:42:24,058 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-15 06:42:24,058 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-15 06:42:24,059 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-15 06:42:24,060 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-15 06:42:24,060 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-15 06:42:24,060 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-15 06:42:24,061 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-15 06:42:24,061 INFO L290 TraceCheckUtils]: 15: Hoare triple {1930#false} ~cond := #in~cond; {1930#false} is VALID [2022-04-15 06:42:24,061 INFO L290 TraceCheckUtils]: 16: Hoare triple {1930#false} assume 0 == ~cond; {1930#false} is VALID [2022-04-15 06:42:24,061 INFO L290 TraceCheckUtils]: 17: Hoare triple {1930#false} assume !false; {1930#false} is VALID [2022-04-15 06:42:24,062 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-15 06:42:24,063 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 06:42:24,249 INFO L290 TraceCheckUtils]: 17: Hoare triple {1930#false} assume !false; {1930#false} is VALID [2022-04-15 06:42:24,249 INFO L290 TraceCheckUtils]: 16: Hoare triple {1930#false} assume 0 == ~cond; {1930#false} is VALID [2022-04-15 06:42:24,249 INFO L290 TraceCheckUtils]: 15: Hoare triple {1930#false} ~cond := #in~cond; {1930#false} is VALID [2022-04-15 06:42:24,249 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-15 06:42:24,249 INFO L290 TraceCheckUtils]: 13: Hoare triple {2009#(< main_~z~0 main_~y~0)} assume !(~y~0 > ~z~0); {1930#false} is VALID [2022-04-15 06:42:24,250 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-15 06:42:24,251 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-15 06:42:24,252 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-15 06:42:24,252 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-15 06:42:24,253 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-15 06:42:24,254 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-15 06:42:24,254 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-15 06:42:24,255 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-15 06:42:24,255 INFO L272 TraceCheckUtils]: 4: Hoare triple {1929#true} call #t~ret9 := main(); {1929#true} is VALID [2022-04-15 06:42:24,255 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1929#true} {1929#true} #52#return; {1929#true} is VALID [2022-04-15 06:42:24,255 INFO L290 TraceCheckUtils]: 2: Hoare triple {1929#true} assume true; {1929#true} is VALID [2022-04-15 06:42:24,255 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-15 06:42:24,255 INFO L272 TraceCheckUtils]: 0: Hoare triple {1929#true} call ULTIMATE.init(); {1929#true} is VALID [2022-04-15 06:42:24,255 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-15 06:42:24,255 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [167702464] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 06:42:24,256 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 06:42:24,256 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6, 6] total 15 [2022-04-15 06:42:24,500 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 06:42:24,500 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [838286844] [2022-04-15 06:42:24,500 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [838286844] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 06:42:24,500 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 06:42:24,500 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2022-04-15 06:42:24,500 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [183485888] [2022-04-15 06:42:24,500 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 06:42:24,501 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-15 06:42:24,501 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 06:42:24,501 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-15 06:42:24,535 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-15 06:42:24,535 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2022-04-15 06:42:24,535 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 06:42:24,536 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-04-15 06:42:24,536 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=221, Invalid=331, Unknown=0, NotChecked=0, Total=552 [2022-04-15 06:42:24,536 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-15 06:42:25,104 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:42:25,105 INFO L93 Difference]: Finished difference Result 71 states and 87 transitions. [2022-04-15 06:42:25,105 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-04-15 06:42:25,105 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-15 06:42:25,105 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 06:42:25,105 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-15 06:42:25,106 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 57 transitions. [2022-04-15 06:42:25,106 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-15 06:42:25,107 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 57 transitions. [2022-04-15 06:42:25,107 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 16 states and 57 transitions. [2022-04-15 06:42:25,146 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-15 06:42:25,146 INFO L225 Difference]: With dead ends: 71 [2022-04-15 06:42:25,147 INFO L226 Difference]: Without dead ends: 51 [2022-04-15 06:42:25,147 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 79 GetRequests, 42 SyntacticMatches, 2 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 339 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=471, Invalid=861, Unknown=0, NotChecked=0, Total=1332 [2022-04-15 06:42:25,148 INFO L913 BasicCegarLoop]: 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-15 06:42:25,148 INFO L914 BasicCegarLoop]: 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-15 06:42:25,148 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2022-04-15 06:42:25,193 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 37. [2022-04-15 06:42:25,193 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 06:42:25,193 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-15 06:42:25,193 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-15 06:42:25,193 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-15 06:42:25,194 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:42:25,194 INFO L93 Difference]: Finished difference Result 51 states and 55 transitions. [2022-04-15 06:42:25,194 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 55 transitions. [2022-04-15 06:42:25,195 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 06:42:25,195 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 06:42:25,195 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-15 06:42:25,195 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-15 06:42:25,196 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:42:25,196 INFO L93 Difference]: Finished difference Result 51 states and 55 transitions. [2022-04-15 06:42:25,196 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 55 transitions. [2022-04-15 06:42:25,196 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 06:42:25,196 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 06:42:25,196 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 06:42:25,196 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 06:42:25,197 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-15 06:42:25,197 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 40 transitions. [2022-04-15 06:42:25,197 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 40 transitions. Word has length 31 [2022-04-15 06:42:25,197 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 06:42:25,197 INFO L478 AbstractCegarLoop]: Abstraction has 37 states and 40 transitions. [2022-04-15 06:42:25,198 INFO L479 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-15 06:42:25,198 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 37 states and 40 transitions. [2022-04-15 06:42:25,241 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-15 06:42:25,241 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 40 transitions. [2022-04-15 06:42:25,242 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2022-04-15 06:42:25,242 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 06:42:25,242 INFO L499 BasicCegarLoop]: trace histogram [10, 9, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 06:42:25,258 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-15 06:42:25,443 WARN L460 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-15 06:42:25,444 INFO L403 AbstractCegarLoop]: === Iteration 9 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 06:42:25,444 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 06:42:25,444 INFO L85 PathProgramCache]: Analyzing trace with hash 804248039, now seen corresponding path program 6 times [2022-04-15 06:42:25,444 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 06:42:25,444 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [638336226] [2022-04-15 06:42:25,568 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-15 06:42:25,814 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-15 06:42:25,815 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-15 06:42:25,817 INFO L85 PathProgramCache]: Analyzing trace with hash -1920277439, now seen corresponding path program 1 times [2022-04-15 06:42:25,817 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 06:42:25,817 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1342138632] [2022-04-15 06:42:25,818 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 06:42:25,818 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 06:42:25,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:42:25,927 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 06:42:25,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:42:25,937 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-15 06:42:25,938 INFO L290 TraceCheckUtils]: 1: Hoare triple {2407#true} assume true; {2407#true} is VALID [2022-04-15 06:42:25,938 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {2407#true} {2407#true} #52#return; {2407#true} is VALID [2022-04-15 06:42:25,938 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-15 06:42:25,938 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-15 06:42:25,938 INFO L290 TraceCheckUtils]: 2: Hoare triple {2407#true} assume true; {2407#true} is VALID [2022-04-15 06:42:25,938 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2407#true} {2407#true} #52#return; {2407#true} is VALID [2022-04-15 06:42:25,938 INFO L272 TraceCheckUtils]: 4: Hoare triple {2407#true} call #t~ret9 := main(); {2407#true} is VALID [2022-04-15 06:42:25,939 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-15 06:42:25,939 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-15 06:42:25,940 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-15 06:42:25,941 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-15 06:42:25,941 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-15 06:42:25,942 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-15 06:42:25,942 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-15 06:42:25,943 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-15 06:42:25,943 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-15 06:42:25,944 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-15 06:42:25,944 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-15 06:42:25,944 INFO L290 TraceCheckUtils]: 16: Hoare triple {2408#false} ~cond := #in~cond; {2408#false} is VALID [2022-04-15 06:42:25,944 INFO L290 TraceCheckUtils]: 17: Hoare triple {2408#false} assume 0 == ~cond; {2408#false} is VALID [2022-04-15 06:42:25,944 INFO L290 TraceCheckUtils]: 18: Hoare triple {2408#false} assume !false; {2408#false} is VALID [2022-04-15 06:42:25,944 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-15 06:42:25,944 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 06:42:25,944 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1342138632] [2022-04-15 06:42:25,944 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1342138632] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 06:42:25,944 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [603969099] [2022-04-15 06:42:25,944 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 06:42:25,945 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 06:42:25,945 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 06:42:25,945 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-15 06:42:25,948 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-15 06:42:25,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:42:25,988 INFO L263 TraceCheckSpWp]: Trace formula consists of 79 conjuncts, 8 conjunts are in the unsatisfiable core [2022-04-15 06:42:25,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:42:25,997 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 06:42:26,257 INFO L272 TraceCheckUtils]: 0: Hoare triple {2407#true} call ULTIMATE.init(); {2407#true} is VALID [2022-04-15 06:42:26,257 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-15 06:42:26,257 INFO L290 TraceCheckUtils]: 2: Hoare triple {2407#true} assume true; {2407#true} is VALID [2022-04-15 06:42:26,257 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2407#true} {2407#true} #52#return; {2407#true} is VALID [2022-04-15 06:42:26,257 INFO L272 TraceCheckUtils]: 4: Hoare triple {2407#true} call #t~ret9 := main(); {2407#true} is VALID [2022-04-15 06:42:26,258 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-15 06:42:26,258 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-15 06:42:26,258 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-15 06:42:26,259 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-15 06:42:26,260 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-15 06:42:26,260 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-15 06:42:26,261 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-15 06:42:26,261 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-15 06:42:26,262 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-15 06:42:26,262 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-15 06:42:26,262 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-15 06:42:26,262 INFO L290 TraceCheckUtils]: 16: Hoare triple {2408#false} ~cond := #in~cond; {2408#false} is VALID [2022-04-15 06:42:26,262 INFO L290 TraceCheckUtils]: 17: Hoare triple {2408#false} assume 0 == ~cond; {2408#false} is VALID [2022-04-15 06:42:26,262 INFO L290 TraceCheckUtils]: 18: Hoare triple {2408#false} assume !false; {2408#false} is VALID [2022-04-15 06:42:26,262 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-15 06:42:26,263 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 06:42:26,498 INFO L290 TraceCheckUtils]: 18: Hoare triple {2408#false} assume !false; {2408#false} is VALID [2022-04-15 06:42:26,498 INFO L290 TraceCheckUtils]: 17: Hoare triple {2408#false} assume 0 == ~cond; {2408#false} is VALID [2022-04-15 06:42:26,499 INFO L290 TraceCheckUtils]: 16: Hoare triple {2408#false} ~cond := #in~cond; {2408#false} is VALID [2022-04-15 06:42:26,499 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-15 06:42:26,499 INFO L290 TraceCheckUtils]: 14: Hoare triple {2495#(< main_~z~0 main_~y~0)} assume !(~y~0 > ~z~0); {2408#false} is VALID [2022-04-15 06:42:26,500 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-15 06:42:26,500 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-15 06:42:26,501 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-15 06:42:26,501 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-15 06:42:26,502 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-15 06:42:26,502 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-15 06:42:26,503 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-15 06:42:26,503 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-15 06:42:26,504 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-15 06:42:26,504 INFO L272 TraceCheckUtils]: 4: Hoare triple {2407#true} call #t~ret9 := main(); {2407#true} is VALID [2022-04-15 06:42:26,504 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2407#true} {2407#true} #52#return; {2407#true} is VALID [2022-04-15 06:42:26,504 INFO L290 TraceCheckUtils]: 2: Hoare triple {2407#true} assume true; {2407#true} is VALID [2022-04-15 06:42:26,504 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-15 06:42:26,504 INFO L272 TraceCheckUtils]: 0: Hoare triple {2407#true} call ULTIMATE.init(); {2407#true} is VALID [2022-04-15 06:42:26,504 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-15 06:42:26,504 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [603969099] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 06:42:26,504 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 06:42:26,504 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 7, 7] total 21 [2022-04-15 06:42:26,851 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 06:42:26,851 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [638336226] [2022-04-15 06:42:26,851 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [638336226] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 06:42:26,852 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 06:42:26,852 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [19] imperfect sequences [] total 19 [2022-04-15 06:42:26,852 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1891473162] [2022-04-15 06:42:26,852 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 06:42:26,852 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-15 06:42:26,852 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 06:42:26,852 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-15 06:42:26,877 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-15 06:42:26,877 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2022-04-15 06:42:26,877 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 06:42:26,878 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2022-04-15 06:42:26,878 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=370, Invalid=622, Unknown=0, NotChecked=0, Total=992 [2022-04-15 06:42:26,878 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-15 06:42:27,739 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:42:27,739 INFO L93 Difference]: Finished difference Result 87 states and 98 transitions. [2022-04-15 06:42:27,739 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2022-04-15 06:42:27,740 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-15 06:42:27,740 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 06:42:27,740 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-15 06:42:27,741 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 58 transitions. [2022-04-15 06:42:27,741 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-15 06:42:27,742 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 58 transitions. [2022-04-15 06:42:27,742 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 19 states and 58 transitions. [2022-04-15 06:42:27,785 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-15 06:42:27,786 INFO L225 Difference]: With dead ends: 87 [2022-04-15 06:42:27,786 INFO L226 Difference]: Without dead ends: 58 [2022-04-15 06:42:27,787 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 91 GetRequests, 43 SyntacticMatches, 2 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 624 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=730, Invalid=1526, Unknown=0, NotChecked=0, Total=2256 [2022-04-15 06:42:27,788 INFO L913 BasicCegarLoop]: 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-15 06:42:27,788 INFO L914 BasicCegarLoop]: 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-15 06:42:27,788 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2022-04-15 06:42:27,885 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 58. [2022-04-15 06:42:27,885 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 06:42:27,886 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-15 06:42:27,886 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-15 06:42:27,886 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-15 06:42:27,887 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:42:27,887 INFO L93 Difference]: Finished difference Result 58 states and 62 transitions. [2022-04-15 06:42:27,887 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 62 transitions. [2022-04-15 06:42:27,887 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 06:42:27,887 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 06:42:27,888 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-15 06:42:27,888 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-15 06:42:27,889 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:42:27,889 INFO L93 Difference]: Finished difference Result 58 states and 62 transitions. [2022-04-15 06:42:27,889 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 62 transitions. [2022-04-15 06:42:27,889 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 06:42:27,889 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 06:42:27,889 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 06:42:27,889 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 06:42:27,889 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-15 06:42:27,890 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 62 transitions. [2022-04-15 06:42:27,890 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 62 transitions. Word has length 36 [2022-04-15 06:42:27,890 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 06:42:27,890 INFO L478 AbstractCegarLoop]: Abstraction has 58 states and 62 transitions. [2022-04-15 06:42:27,891 INFO L479 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-15 06:42:27,891 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 58 states and 62 transitions. [2022-04-15 06:42:27,955 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-15 06:42:27,955 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 62 transitions. [2022-04-15 06:42:27,955 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2022-04-15 06:42:27,956 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 06:42:27,956 INFO L499 BasicCegarLoop]: trace histogram [11, 10, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 06:42:27,972 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2022-04-15 06:42:28,156 WARN L460 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-15 06:42:28,158 INFO L403 AbstractCegarLoop]: === Iteration 10 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 06:42:28,159 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 06:42:28,159 INFO L85 PathProgramCache]: Analyzing trace with hash 601551863, now seen corresponding path program 7 times [2022-04-15 06:42:28,159 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 06:42:28,159 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1046183915] [2022-04-15 06:42:30,635 WARN L977 rdanLoopAcceleration]: Unable to prove correctness of quantifier elimination. [2022-04-15 06:42:30,677 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-15 06:42:30,917 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-15 06:42:30,918 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-15 06:42:30,920 INFO L85 PathProgramCache]: Analyzing trace with hash -640907198, now seen corresponding path program 1 times [2022-04-15 06:42:30,920 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 06:42:30,920 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [135447858] [2022-04-15 06:42:30,920 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 06:42:30,920 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 06:42:30,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:42:31,072 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 06:42:31,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:42:31,078 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-15 06:42:31,081 INFO L290 TraceCheckUtils]: 1: Hoare triple {2993#true} assume true; {2993#true} is VALID [2022-04-15 06:42:31,081 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {2993#true} {2993#true} #52#return; {2993#true} is VALID [2022-04-15 06:42:31,083 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-15 06:42:31,083 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-15 06:42:31,083 INFO L290 TraceCheckUtils]: 2: Hoare triple {2993#true} assume true; {2993#true} is VALID [2022-04-15 06:42:31,083 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2993#true} {2993#true} #52#return; {2993#true} is VALID [2022-04-15 06:42:31,084 INFO L272 TraceCheckUtils]: 4: Hoare triple {2993#true} call #t~ret9 := main(); {2993#true} is VALID [2022-04-15 06:42:31,084 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-15 06:42:31,085 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-15 06:42:31,085 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-15 06:42:31,086 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-15 06:42:31,087 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-15 06:42:31,087 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-15 06:42:31,088 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-15 06:42:31,088 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-15 06:42:31,089 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-15 06:42:31,089 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-15 06:42:31,089 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-15 06:42:31,090 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-15 06:42:31,090 INFO L290 TraceCheckUtils]: 17: Hoare triple {2994#false} ~cond := #in~cond; {2994#false} is VALID [2022-04-15 06:42:31,090 INFO L290 TraceCheckUtils]: 18: Hoare triple {2994#false} assume 0 == ~cond; {2994#false} is VALID [2022-04-15 06:42:31,090 INFO L290 TraceCheckUtils]: 19: Hoare triple {2994#false} assume !false; {2994#false} is VALID [2022-04-15 06:42:31,090 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-15 06:42:31,090 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 06:42:31,090 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [135447858] [2022-04-15 06:42:31,090 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [135447858] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 06:42:31,090 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [399986387] [2022-04-15 06:42:31,090 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 06:42:31,090 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 06:42:31,091 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 06:42:31,096 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-15 06:42:31,097 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-15 06:42:31,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:42:31,127 INFO L263 TraceCheckSpWp]: Trace formula consists of 84 conjuncts, 9 conjunts are in the unsatisfiable core [2022-04-15 06:42:31,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:42:31,135 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 06:42:31,362 INFO L272 TraceCheckUtils]: 0: Hoare triple {2993#true} call ULTIMATE.init(); {2993#true} is VALID [2022-04-15 06:42:31,362 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-15 06:42:31,362 INFO L290 TraceCheckUtils]: 2: Hoare triple {2993#true} assume true; {2993#true} is VALID [2022-04-15 06:42:31,363 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2993#true} {2993#true} #52#return; {2993#true} is VALID [2022-04-15 06:42:31,363 INFO L272 TraceCheckUtils]: 4: Hoare triple {2993#true} call #t~ret9 := main(); {2993#true} is VALID [2022-04-15 06:42:31,363 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-15 06:42:31,363 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-15 06:42:31,366 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-15 06:42:31,367 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-15 06:42:31,367 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-15 06:42:31,368 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-15 06:42:31,369 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-15 06:42:31,369 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-15 06:42:31,370 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-15 06:42:31,370 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-15 06:42:31,371 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-15 06:42:31,371 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-15 06:42:31,371 INFO L290 TraceCheckUtils]: 17: Hoare triple {2994#false} ~cond := #in~cond; {2994#false} is VALID [2022-04-15 06:42:31,371 INFO L290 TraceCheckUtils]: 18: Hoare triple {2994#false} assume 0 == ~cond; {2994#false} is VALID [2022-04-15 06:42:31,371 INFO L290 TraceCheckUtils]: 19: Hoare triple {2994#false} assume !false; {2994#false} is VALID [2022-04-15 06:42:31,371 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-15 06:42:31,371 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 06:42:31,609 INFO L290 TraceCheckUtils]: 19: Hoare triple {2994#false} assume !false; {2994#false} is VALID [2022-04-15 06:42:31,609 INFO L290 TraceCheckUtils]: 18: Hoare triple {2994#false} assume 0 == ~cond; {2994#false} is VALID [2022-04-15 06:42:31,609 INFO L290 TraceCheckUtils]: 17: Hoare triple {2994#false} ~cond := #in~cond; {2994#false} is VALID [2022-04-15 06:42:31,609 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-15 06:42:31,609 INFO L290 TraceCheckUtils]: 15: Hoare triple {3086#(< main_~z~0 main_~y~0)} assume !(~y~0 > ~z~0); {2994#false} is VALID [2022-04-15 06:42:31,612 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-15 06:42:31,613 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-15 06:42:31,613 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-15 06:42:31,614 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-15 06:42:31,614 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-15 06:42:31,615 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-15 06:42:31,615 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-15 06:42:31,616 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-15 06:42:31,616 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-15 06:42:31,616 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-15 06:42:31,616 INFO L272 TraceCheckUtils]: 4: Hoare triple {2993#true} call #t~ret9 := main(); {2993#true} is VALID [2022-04-15 06:42:31,617 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2993#true} {2993#true} #52#return; {2993#true} is VALID [2022-04-15 06:42:31,617 INFO L290 TraceCheckUtils]: 2: Hoare triple {2993#true} assume true; {2993#true} is VALID [2022-04-15 06:42:31,617 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-15 06:42:31,617 INFO L272 TraceCheckUtils]: 0: Hoare triple {2993#true} call ULTIMATE.init(); {2993#true} is VALID [2022-04-15 06:42:31,617 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-15 06:42:31,617 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [399986387] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 06:42:31,617 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 06:42:31,617 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 8, 8] total 24 [2022-04-15 06:42:31,956 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 06:42:31,956 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1046183915] [2022-04-15 06:42:31,956 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1046183915] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 06:42:31,956 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 06:42:31,956 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [21] imperfect sequences [] total 21 [2022-04-15 06:42:31,956 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [469600754] [2022-04-15 06:42:31,956 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 06:42:31,957 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-15 06:42:31,957 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 06:42:31,957 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-15 06:42:31,983 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-15 06:42:31,983 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2022-04-15 06:42:31,983 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 06:42:31,984 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2022-04-15 06:42:31,984 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=480, Invalid=780, Unknown=0, NotChecked=0, Total=1260 [2022-04-15 06:42:31,984 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-15 06:42:32,977 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:42:32,977 INFO L93 Difference]: Finished difference Result 91 states and 101 transitions. [2022-04-15 06:42:32,978 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2022-04-15 06:42:32,978 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-15 06:42:32,978 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 06:42:32,978 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-15 06:42:32,979 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 60 transitions. [2022-04-15 06:42:32,979 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-15 06:42:32,980 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 60 transitions. [2022-04-15 06:42:32,980 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 21 states and 60 transitions. [2022-04-15 06:42:33,032 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-15 06:42:33,035 INFO L225 Difference]: With dead ends: 91 [2022-04-15 06:42:33,036 INFO L226 Difference]: Without dead ends: 61 [2022-04-15 06:42:33,037 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 98 GetRequests, 44 SyntacticMatches, 2 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 797 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=945, Invalid=1917, Unknown=0, NotChecked=0, Total=2862 [2022-04-15 06:42:33,037 INFO L913 BasicCegarLoop]: 13 mSDtfsCounter, 77 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 356 mSolverCounterSat, 80 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s 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.3s IncrementalHoareTripleChecker+Time [2022-04-15 06:42:33,037 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [77 Valid, 25 Invalid, 436 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [80 Valid, 356 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-04-15 06:42:33,037 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2022-04-15 06:42:33,128 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 61. [2022-04-15 06:42:33,129 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 06:42:33,129 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-15 06:42:33,129 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-15 06:42:33,129 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-15 06:42:33,130 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:42:33,131 INFO L93 Difference]: Finished difference Result 61 states and 65 transitions. [2022-04-15 06:42:33,131 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 65 transitions. [2022-04-15 06:42:33,131 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 06:42:33,131 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 06:42:33,131 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-15 06:42:33,131 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-15 06:42:33,132 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:42:33,132 INFO L93 Difference]: Finished difference Result 61 states and 65 transitions. [2022-04-15 06:42:33,132 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 65 transitions. [2022-04-15 06:42:33,132 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 06:42:33,132 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 06:42:33,132 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 06:42:33,132 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 06:42:33,132 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-15 06:42:33,133 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 65 transitions. [2022-04-15 06:42:33,133 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 65 transitions. Word has length 39 [2022-04-15 06:42:33,133 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 06:42:33,133 INFO L478 AbstractCegarLoop]: Abstraction has 61 states and 65 transitions. [2022-04-15 06:42:33,133 INFO L479 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-15 06:42:33,134 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 61 states and 65 transitions. [2022-04-15 06:42:33,193 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-15 06:42:33,193 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 65 transitions. [2022-04-15 06:42:33,193 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2022-04-15 06:42:33,193 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 06:42:33,193 INFO L499 BasicCegarLoop]: trace histogram [12, 11, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 06:42:33,211 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-15 06:42:33,407 WARN L460 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-15 06:42:33,407 INFO L403 AbstractCegarLoop]: === Iteration 11 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 06:42:33,408 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 06:42:33,408 INFO L85 PathProgramCache]: Analyzing trace with hash -1080568111, now seen corresponding path program 8 times [2022-04-15 06:42:33,408 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 06:42:33,408 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [2002675000] [2022-04-15 06:42:33,517 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-15 06:42:33,763 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-15 06:42:33,764 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-15 06:42:33,766 INFO L85 PathProgramCache]: Analyzing trace with hash 697975393, now seen corresponding path program 1 times [2022-04-15 06:42:33,766 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 06:42:33,766 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [72025305] [2022-04-15 06:42:33,766 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 06:42:33,766 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 06:42:33,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:42:33,920 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 06:42:33,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:42:33,927 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-15 06:42:33,928 INFO L290 TraceCheckUtils]: 1: Hoare triple {3613#true} assume true; {3613#true} is VALID [2022-04-15 06:42:33,928 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {3613#true} {3613#true} #52#return; {3613#true} is VALID [2022-04-15 06:42:33,928 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-15 06:42:33,928 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-15 06:42:33,928 INFO L290 TraceCheckUtils]: 2: Hoare triple {3613#true} assume true; {3613#true} is VALID [2022-04-15 06:42:33,928 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3613#true} {3613#true} #52#return; {3613#true} is VALID [2022-04-15 06:42:33,929 INFO L272 TraceCheckUtils]: 4: Hoare triple {3613#true} call #t~ret9 := main(); {3613#true} is VALID [2022-04-15 06:42:33,929 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-15 06:42:33,930 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-15 06:42:33,930 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-15 06:42:33,931 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-15 06:42:33,931 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-15 06:42:33,932 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-15 06:42:33,932 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-15 06:42:33,933 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-15 06:42:33,933 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-15 06:42:33,934 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-15 06:42:33,934 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-15 06:42:33,935 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-15 06:42:33,935 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-15 06:42:33,935 INFO L290 TraceCheckUtils]: 18: Hoare triple {3614#false} ~cond := #in~cond; {3614#false} is VALID [2022-04-15 06:42:33,935 INFO L290 TraceCheckUtils]: 19: Hoare triple {3614#false} assume 0 == ~cond; {3614#false} is VALID [2022-04-15 06:42:33,935 INFO L290 TraceCheckUtils]: 20: Hoare triple {3614#false} assume !false; {3614#false} is VALID [2022-04-15 06:42:33,935 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-15 06:42:33,935 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 06:42:33,936 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [72025305] [2022-04-15 06:42:33,936 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [72025305] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 06:42:33,936 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1759167593] [2022-04-15 06:42:33,936 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 06:42:33,936 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 06:42:33,936 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 06:42:33,937 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-15 06:42:33,938 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-15 06:42:33,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:42:33,968 INFO L263 TraceCheckSpWp]: Trace formula consists of 89 conjuncts, 10 conjunts are in the unsatisfiable core [2022-04-15 06:42:33,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:42:33,979 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 06:42:34,273 INFO L272 TraceCheckUtils]: 0: Hoare triple {3613#true} call ULTIMATE.init(); {3613#true} is VALID [2022-04-15 06:42:34,274 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-15 06:42:34,274 INFO L290 TraceCheckUtils]: 2: Hoare triple {3613#true} assume true; {3613#true} is VALID [2022-04-15 06:42:34,274 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3613#true} {3613#true} #52#return; {3613#true} is VALID [2022-04-15 06:42:34,274 INFO L272 TraceCheckUtils]: 4: Hoare triple {3613#true} call #t~ret9 := main(); {3613#true} is VALID [2022-04-15 06:42:34,274 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-15 06:42:34,275 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-15 06:42:34,276 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-15 06:42:34,277 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-15 06:42:34,277 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-15 06:42:34,278 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-15 06:42:34,278 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-15 06:42:34,279 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-15 06:42:34,279 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-15 06:42:34,280 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-15 06:42:34,280 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-15 06:42:34,280 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-15 06:42:34,280 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-15 06:42:34,281 INFO L290 TraceCheckUtils]: 18: Hoare triple {3614#false} ~cond := #in~cond; {3614#false} is VALID [2022-04-15 06:42:34,281 INFO L290 TraceCheckUtils]: 19: Hoare triple {3614#false} assume 0 == ~cond; {3614#false} is VALID [2022-04-15 06:42:34,281 INFO L290 TraceCheckUtils]: 20: Hoare triple {3614#false} assume !false; {3614#false} is VALID [2022-04-15 06:42:34,281 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-15 06:42:34,281 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 06:42:34,567 INFO L290 TraceCheckUtils]: 20: Hoare triple {3614#false} assume !false; {3614#false} is VALID [2022-04-15 06:42:34,567 INFO L290 TraceCheckUtils]: 19: Hoare triple {3614#false} assume 0 == ~cond; {3614#false} is VALID [2022-04-15 06:42:34,568 INFO L290 TraceCheckUtils]: 18: Hoare triple {3614#false} ~cond := #in~cond; {3614#false} is VALID [2022-04-15 06:42:34,568 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-15 06:42:34,568 INFO L290 TraceCheckUtils]: 16: Hoare triple {3711#(< main_~z~0 main_~y~0)} assume !(~y~0 > ~z~0); {3614#false} is VALID [2022-04-15 06:42:34,568 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-15 06:42:34,569 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-15 06:42:34,569 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-15 06:42:34,570 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-15 06:42:34,570 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-15 06:42:34,571 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-15 06:42:34,571 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-15 06:42:34,572 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-15 06:42:34,572 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-15 06:42:34,573 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-15 06:42:34,573 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-15 06:42:34,573 INFO L272 TraceCheckUtils]: 4: Hoare triple {3613#true} call #t~ret9 := main(); {3613#true} is VALID [2022-04-15 06:42:34,573 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3613#true} {3613#true} #52#return; {3613#true} is VALID [2022-04-15 06:42:34,573 INFO L290 TraceCheckUtils]: 2: Hoare triple {3613#true} assume true; {3613#true} is VALID [2022-04-15 06:42:34,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-15 06:42:34,573 INFO L272 TraceCheckUtils]: 0: Hoare triple {3613#true} call ULTIMATE.init(); {3613#true} is VALID [2022-04-15 06:42:34,574 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-15 06:42:34,574 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1759167593] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 06:42:34,574 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 06:42:34,574 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 9, 9] total 27 [2022-04-15 06:42:35,026 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 06:42:35,027 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [2002675000] [2022-04-15 06:42:35,027 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [2002675000] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 06:42:35,027 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 06:42:35,027 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [23] imperfect sequences [] total 23 [2022-04-15 06:42:35,027 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [571392461] [2022-04-15 06:42:35,027 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 06:42:35,027 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-15 06:42:35,027 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 06:42:35,028 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-15 06:42:35,063 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-15 06:42:35,064 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2022-04-15 06:42:35,064 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 06:42:35,064 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2022-04-15 06:42:35,065 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=503, Invalid=1057, Unknown=0, NotChecked=0, Total=1560 [2022-04-15 06:42:35,065 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-15 06:42:36,132 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:42:36,132 INFO L93 Difference]: Finished difference Result 94 states and 103 transitions. [2022-04-15 06:42:36,132 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-04-15 06:42:36,132 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-15 06:42:36,132 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 06:42:36,133 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-15 06:42:36,133 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 55 transitions. [2022-04-15 06:42:36,134 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-15 06:42:36,134 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 55 transitions. [2022-04-15 06:42:36,134 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 16 states and 55 transitions. [2022-04-15 06:42:36,173 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-15 06:42:36,174 INFO L225 Difference]: With dead ends: 94 [2022-04-15 06:42:36,174 INFO L226 Difference]: Without dead ends: 63 [2022-04-15 06:42:36,175 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 98 GetRequests, 45 SyntacticMatches, 2 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 660 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=754, Invalid=2002, Unknown=0, NotChecked=0, Total=2756 [2022-04-15 06:42:36,175 INFO L913 BasicCegarLoop]: 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-15 06:42:36,175 INFO L914 BasicCegarLoop]: 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-15 06:42:36,176 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2022-04-15 06:42:36,289 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 63. [2022-04-15 06:42:36,289 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 06:42:36,289 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-15 06:42:36,289 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-15 06:42:36,289 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-15 06:42:36,290 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:42:36,290 INFO L93 Difference]: Finished difference Result 63 states and 67 transitions. [2022-04-15 06:42:36,290 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 67 transitions. [2022-04-15 06:42:36,291 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 06:42:36,291 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 06:42:36,291 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-15 06:42:36,291 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-15 06:42:36,292 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:42:36,292 INFO L93 Difference]: Finished difference Result 63 states and 67 transitions. [2022-04-15 06:42:36,292 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 67 transitions. [2022-04-15 06:42:36,292 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 06:42:36,292 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 06:42:36,292 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 06:42:36,292 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 06:42:36,292 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-15 06:42:36,293 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 67 transitions. [2022-04-15 06:42:36,293 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 67 transitions. Word has length 42 [2022-04-15 06:42:36,293 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 06:42:36,293 INFO L478 AbstractCegarLoop]: Abstraction has 63 states and 67 transitions. [2022-04-15 06:42:36,293 INFO L479 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-15 06:42:36,293 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 63 states and 67 transitions. [2022-04-15 06:42:36,359 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-15 06:42:36,359 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 67 transitions. [2022-04-15 06:42:36,359 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2022-04-15 06:42:36,359 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 06:42:36,360 INFO L499 BasicCegarLoop]: trace histogram [13, 12, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 06:42:36,375 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2022-04-15 06:42:36,563 WARN L460 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-15 06:42:36,563 INFO L403 AbstractCegarLoop]: === Iteration 12 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 06:42:36,564 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 06:42:36,564 INFO L85 PathProgramCache]: Analyzing trace with hash -2144480746, now seen corresponding path program 9 times [2022-04-15 06:42:36,564 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 06:42:36,564 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [741540981] [2022-04-15 06:42:38,673 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-15 06:42:38,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-15 06:42:38,865 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-15 06:42:38,867 INFO L85 PathProgramCache]: Analyzing trace with hash -246300319, now seen corresponding path program 1 times [2022-04-15 06:42:38,868 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 06:42:38,868 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1777112577] [2022-04-15 06:42:38,868 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 06:42:38,868 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 06:42:38,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:42:39,028 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 06:42:39,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:42:39,037 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-15 06:42:39,038 INFO L290 TraceCheckUtils]: 1: Hoare triple {4247#true} assume true; {4247#true} is VALID [2022-04-15 06:42:39,038 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {4247#true} {4247#true} #52#return; {4247#true} is VALID [2022-04-15 06:42:39,038 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-15 06:42:39,038 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-15 06:42:39,038 INFO L290 TraceCheckUtils]: 2: Hoare triple {4247#true} assume true; {4247#true} is VALID [2022-04-15 06:42:39,039 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {4247#true} {4247#true} #52#return; {4247#true} is VALID [2022-04-15 06:42:39,039 INFO L272 TraceCheckUtils]: 4: Hoare triple {4247#true} call #t~ret9 := main(); {4247#true} is VALID [2022-04-15 06:42:39,039 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-15 06:42:39,040 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-15 06:42:39,040 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-15 06:42:39,041 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-15 06:42:39,041 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-15 06:42:39,042 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-15 06:42:39,042 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-15 06:42:39,043 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-15 06:42:39,043 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-15 06:42:39,044 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-15 06:42:39,044 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-15 06:42:39,044 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-15 06:42:39,045 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-15 06:42:39,045 INFO L290 TraceCheckUtils]: 18: Hoare triple {4248#false} ~cond := #in~cond; {4248#false} is VALID [2022-04-15 06:42:39,045 INFO L290 TraceCheckUtils]: 19: Hoare triple {4248#false} assume 0 == ~cond; {4248#false} is VALID [2022-04-15 06:42:39,045 INFO L290 TraceCheckUtils]: 20: Hoare triple {4248#false} assume !false; {4248#false} is VALID [2022-04-15 06:42:39,045 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-15 06:42:39,045 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 06:42:39,045 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1777112577] [2022-04-15 06:42:39,045 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1777112577] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 06:42:39,045 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [932441522] [2022-04-15 06:42:39,045 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 06:42:39,045 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 06:42:39,046 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 06:42:39,046 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-15 06:42:39,047 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-15 06:42:39,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:42:39,075 INFO L263 TraceCheckSpWp]: Trace formula consists of 89 conjuncts, 10 conjunts are in the unsatisfiable core [2022-04-15 06:42:39,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:42:39,084 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 06:42:39,370 INFO L272 TraceCheckUtils]: 0: Hoare triple {4247#true} call ULTIMATE.init(); {4247#true} is VALID [2022-04-15 06:42:39,370 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-15 06:42:39,370 INFO L290 TraceCheckUtils]: 2: Hoare triple {4247#true} assume true; {4247#true} is VALID [2022-04-15 06:42:39,370 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {4247#true} {4247#true} #52#return; {4247#true} is VALID [2022-04-15 06:42:39,370 INFO L272 TraceCheckUtils]: 4: Hoare triple {4247#true} call #t~ret9 := main(); {4247#true} is VALID [2022-04-15 06:42:39,370 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-15 06:42:39,371 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-15 06:42:39,372 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-15 06:42:39,373 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-15 06:42:39,373 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-15 06:42:39,381 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-15 06:42:39,381 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-15 06:42:39,382 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-15 06:42:39,382 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-15 06:42:39,383 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-15 06:42:39,383 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-15 06:42:39,384 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-15 06:42:39,384 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-15 06:42:39,384 INFO L290 TraceCheckUtils]: 18: Hoare triple {4248#false} ~cond := #in~cond; {4248#false} is VALID [2022-04-15 06:42:39,384 INFO L290 TraceCheckUtils]: 19: Hoare triple {4248#false} assume 0 == ~cond; {4248#false} is VALID [2022-04-15 06:42:39,384 INFO L290 TraceCheckUtils]: 20: Hoare triple {4248#false} assume !false; {4248#false} is VALID [2022-04-15 06:42:39,384 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-15 06:42:39,384 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 06:42:39,660 INFO L290 TraceCheckUtils]: 20: Hoare triple {4248#false} assume !false; {4248#false} is VALID [2022-04-15 06:42:39,660 INFO L290 TraceCheckUtils]: 19: Hoare triple {4248#false} assume 0 == ~cond; {4248#false} is VALID [2022-04-15 06:42:39,661 INFO L290 TraceCheckUtils]: 18: Hoare triple {4248#false} ~cond := #in~cond; {4248#false} is VALID [2022-04-15 06:42:39,661 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-15 06:42:39,661 INFO L290 TraceCheckUtils]: 16: Hoare triple {4345#(< main_~z~0 main_~y~0)} assume !(~y~0 > ~z~0); {4248#false} is VALID [2022-04-15 06:42:39,661 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-15 06:42:39,662 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-15 06:42:39,662 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-15 06:42:39,663 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-15 06:42:39,663 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-15 06:42:39,664 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-15 06:42:39,664 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-15 06:42:39,665 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-15 06:42:39,665 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-15 06:42:39,666 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-15 06:42:39,666 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-15 06:42:39,666 INFO L272 TraceCheckUtils]: 4: Hoare triple {4247#true} call #t~ret9 := main(); {4247#true} is VALID [2022-04-15 06:42:39,666 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {4247#true} {4247#true} #52#return; {4247#true} is VALID [2022-04-15 06:42:39,666 INFO L290 TraceCheckUtils]: 2: Hoare triple {4247#true} assume true; {4247#true} is VALID [2022-04-15 06:42:39,666 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-15 06:42:39,666 INFO L272 TraceCheckUtils]: 0: Hoare triple {4247#true} call ULTIMATE.init(); {4247#true} is VALID [2022-04-15 06:42:39,666 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-15 06:42:39,667 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [932441522] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 06:42:39,667 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 06:42:39,667 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 9, 9] total 27 [2022-04-15 06:42:40,057 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 06:42:40,057 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [741540981] [2022-04-15 06:42:40,057 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [741540981] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 06:42:40,057 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 06:42:40,057 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [24] imperfect sequences [] total 24 [2022-04-15 06:42:40,057 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1418821574] [2022-04-15 06:42:40,057 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 06:42:40,058 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-15 06:42:40,058 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 06:42:40,058 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-15 06:42:40,087 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-15 06:42:40,087 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2022-04-15 06:42:40,087 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 06:42:40,088 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2022-04-15 06:42:40,088 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=640, Invalid=1000, Unknown=0, NotChecked=0, Total=1640 [2022-04-15 06:42:40,088 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-15 06:42:41,122 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:42:41,123 INFO L93 Difference]: Finished difference Result 97 states and 107 transitions. [2022-04-15 06:42:41,123 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2022-04-15 06:42:41,123 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-15 06:42:41,123 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 06:42:41,123 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-15 06:42:41,124 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 65 transitions. [2022-04-15 06:42:41,124 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-15 06:42:41,125 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 65 transitions. [2022-04-15 06:42:41,125 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 24 states and 65 transitions. [2022-04-15 06:42:41,172 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-15 06:42:41,173 INFO L225 Difference]: With dead ends: 97 [2022-04-15 06:42:41,173 INFO L226 Difference]: Without dead ends: 66 [2022-04-15 06:42:41,174 INFO L912 BasicCegarLoop]: 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-15 06:42:41,175 INFO L913 BasicCegarLoop]: 13 mSDtfsCounter, 39 mSDsluCounter, 27 mSDsCounter, 0 mSdLazyCounter, 404 mSolverCounterSat, 43 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s 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.3s IncrementalHoareTripleChecker+Time [2022-04-15 06:42:41,175 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [39 Valid, 40 Invalid, 447 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [43 Valid, 404 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-04-15 06:42:41,175 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2022-04-15 06:42:41,301 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 66. [2022-04-15 06:42:41,301 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 06:42:41,301 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-15 06:42:41,301 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-15 06:42:41,302 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-15 06:42:41,302 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:42:41,303 INFO L93 Difference]: Finished difference Result 66 states and 70 transitions. [2022-04-15 06:42:41,303 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 70 transitions. [2022-04-15 06:42:41,303 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 06:42:41,303 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 06:42:41,303 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-15 06:42:41,303 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-15 06:42:41,304 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:42:41,304 INFO L93 Difference]: Finished difference Result 66 states and 70 transitions. [2022-04-15 06:42:41,304 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 70 transitions. [2022-04-15 06:42:41,304 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 06:42:41,304 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 06:42:41,304 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 06:42:41,304 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 06:42:41,304 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-15 06:42:41,305 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 70 transitions. [2022-04-15 06:42:41,305 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 70 transitions. Word has length 44 [2022-04-15 06:42:41,305 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 06:42:41,305 INFO L478 AbstractCegarLoop]: Abstraction has 66 states and 70 transitions. [2022-04-15 06:42:41,306 INFO L479 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-15 06:42:41,306 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 66 states and 70 transitions. [2022-04-15 06:42:41,366 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-15 06:42:41,367 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 70 transitions. [2022-04-15 06:42:41,367 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2022-04-15 06:42:41,367 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 06:42:41,367 INFO L499 BasicCegarLoop]: trace histogram [14, 13, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 06:42:41,383 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-15 06:42:41,583 WARN L460 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-15 06:42:41,584 INFO L403 AbstractCegarLoop]: === Iteration 13 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 06:42:41,584 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 06:42:41,584 INFO L85 PathProgramCache]: Analyzing trace with hash -181520728, now seen corresponding path program 10 times [2022-04-15 06:42:41,584 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 06:42:41,584 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [996109606] [2022-04-15 06:42:41,674 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-15 06:42:41,895 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-15 06:42:41,896 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-15 06:42:41,898 INFO L85 PathProgramCache]: Analyzing trace with hash 1782386466, now seen corresponding path program 1 times [2022-04-15 06:42:41,898 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 06:42:41,898 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1034128093] [2022-04-15 06:42:41,898 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 06:42:41,898 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 06:42:41,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:42:42,076 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 06:42:42,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:42:42,081 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-15 06:42:42,081 INFO L290 TraceCheckUtils]: 1: Hoare triple {4916#true} assume true; {4916#true} is VALID [2022-04-15 06:42:42,081 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {4916#true} {4916#true} #52#return; {4916#true} is VALID [2022-04-15 06:42:42,081 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-15 06:42:42,081 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-15 06:42:42,081 INFO L290 TraceCheckUtils]: 2: Hoare triple {4916#true} assume true; {4916#true} is VALID [2022-04-15 06:42:42,081 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {4916#true} {4916#true} #52#return; {4916#true} is VALID [2022-04-15 06:42:42,082 INFO L272 TraceCheckUtils]: 4: Hoare triple {4916#true} call #t~ret9 := main(); {4916#true} is VALID [2022-04-15 06:42:42,082 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-15 06:42:42,083 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-15 06:42:42,083 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-15 06:42:42,084 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-15 06:42:42,085 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-15 06:42:42,085 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-15 06:42:42,086 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-15 06:42:42,086 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-15 06:42:42,087 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-15 06:42:42,087 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-15 06:42:42,088 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-15 06:42:42,088 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-15 06:42:42,089 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-15 06:42:42,089 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-15 06:42:42,089 INFO L290 TraceCheckUtils]: 19: Hoare triple {4917#false} ~cond := #in~cond; {4917#false} is VALID [2022-04-15 06:42:42,089 INFO L290 TraceCheckUtils]: 20: Hoare triple {4917#false} assume 0 == ~cond; {4917#false} is VALID [2022-04-15 06:42:42,089 INFO L290 TraceCheckUtils]: 21: Hoare triple {4917#false} assume !false; {4917#false} is VALID [2022-04-15 06:42:42,089 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-15 06:42:42,089 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 06:42:42,090 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1034128093] [2022-04-15 06:42:42,090 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1034128093] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 06:42:42,090 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1909788580] [2022-04-15 06:42:42,090 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 06:42:42,090 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 06:42:42,090 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 06:42:42,091 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-15 06:42:42,092 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-15 06:42:42,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:42:42,132 INFO L263 TraceCheckSpWp]: Trace formula consists of 94 conjuncts, 11 conjunts are in the unsatisfiable core [2022-04-15 06:42:42,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:42:42,141 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 06:42:42,469 INFO L272 TraceCheckUtils]: 0: Hoare triple {4916#true} call ULTIMATE.init(); {4916#true} is VALID [2022-04-15 06:42:42,469 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-15 06:42:42,469 INFO L290 TraceCheckUtils]: 2: Hoare triple {4916#true} assume true; {4916#true} is VALID [2022-04-15 06:42:42,469 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {4916#true} {4916#true} #52#return; {4916#true} is VALID [2022-04-15 06:42:42,469 INFO L272 TraceCheckUtils]: 4: Hoare triple {4916#true} call #t~ret9 := main(); {4916#true} is VALID [2022-04-15 06:42:42,470 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-15 06:42:42,470 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-15 06:42:42,470 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-15 06:42:42,471 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-15 06:42:42,472 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-15 06:42:42,472 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-15 06:42:42,473 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-15 06:42:42,473 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-15 06:42:42,474 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-15 06:42:42,474 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-15 06:42:42,475 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-15 06:42:42,475 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-15 06:42:42,476 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-15 06:42:42,476 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-15 06:42:42,476 INFO L290 TraceCheckUtils]: 19: Hoare triple {4917#false} ~cond := #in~cond; {4917#false} is VALID [2022-04-15 06:42:42,476 INFO L290 TraceCheckUtils]: 20: Hoare triple {4917#false} assume 0 == ~cond; {4917#false} is VALID [2022-04-15 06:42:42,476 INFO L290 TraceCheckUtils]: 21: Hoare triple {4917#false} assume !false; {4917#false} is VALID [2022-04-15 06:42:42,476 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-15 06:42:42,476 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 06:42:42,831 INFO L290 TraceCheckUtils]: 21: Hoare triple {4917#false} assume !false; {4917#false} is VALID [2022-04-15 06:42:42,832 INFO L290 TraceCheckUtils]: 20: Hoare triple {4917#false} assume 0 == ~cond; {4917#false} is VALID [2022-04-15 06:42:42,832 INFO L290 TraceCheckUtils]: 19: Hoare triple {4917#false} ~cond := #in~cond; {4917#false} is VALID [2022-04-15 06:42:42,832 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-15 06:42:42,832 INFO L290 TraceCheckUtils]: 17: Hoare triple {5019#(< main_~z~0 main_~y~0)} assume !(~y~0 > ~z~0); {4917#false} is VALID [2022-04-15 06:42:42,833 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-15 06:42:42,833 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-15 06:42:42,834 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-15 06:42:42,834 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-15 06:42:42,834 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-15 06:42:42,835 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-15 06:42:42,835 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-15 06:42:42,836 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-15 06:42:42,836 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-15 06:42:42,837 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-15 06:42:42,837 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-15 06:42:42,837 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-15 06:42:42,838 INFO L272 TraceCheckUtils]: 4: Hoare triple {4916#true} call #t~ret9 := main(); {4916#true} is VALID [2022-04-15 06:42:42,838 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {4916#true} {4916#true} #52#return; {4916#true} is VALID [2022-04-15 06:42:42,838 INFO L290 TraceCheckUtils]: 2: Hoare triple {4916#true} assume true; {4916#true} is VALID [2022-04-15 06:42:42,838 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-15 06:42:42,838 INFO L272 TraceCheckUtils]: 0: Hoare triple {4916#true} call ULTIMATE.init(); {4916#true} is VALID [2022-04-15 06:42:42,838 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-15 06:42:42,838 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1909788580] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 06:42:42,838 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 06:42:42,838 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 10, 10] total 30 [2022-04-15 06:42:43,327 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 06:42:43,327 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [996109606] [2022-04-15 06:42:43,327 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [996109606] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 06:42:43,327 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 06:42:43,327 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [26] imperfect sequences [] total 26 [2022-04-15 06:42:43,327 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1882757472] [2022-04-15 06:42:43,327 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 06:42:43,328 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-15 06:42:43,328 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 06:42:43,328 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-15 06:42:43,366 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-15 06:42:43,366 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2022-04-15 06:42:43,366 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 06:42:43,366 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2022-04-15 06:42:43,367 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=641, Invalid=1339, Unknown=0, NotChecked=0, Total=1980 [2022-04-15 06:42:43,367 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-15 06:42:44,805 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:42:44,805 INFO L93 Difference]: Finished difference Result 100 states and 109 transitions. [2022-04-15 06:42:44,805 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2022-04-15 06:42:44,806 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-15 06:42:44,806 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 06:42:44,806 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-15 06:42:44,807 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 59 transitions. [2022-04-15 06:42:44,807 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-15 06:42:44,807 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 59 transitions. [2022-04-15 06:42:44,807 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 18 states and 59 transitions. [2022-04-15 06:42:44,860 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-15 06:42:44,860 INFO L225 Difference]: With dead ends: 100 [2022-04-15 06:42:44,860 INFO L226 Difference]: Without dead ends: 68 [2022-04-15 06:42:44,861 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 107 GetRequests, 47 SyntacticMatches, 2 SemanticMatches, 58 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 852 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=960, Invalid=2580, Unknown=0, NotChecked=0, Total=3540 [2022-04-15 06:42:44,862 INFO L913 BasicCegarLoop]: 13 mSDtfsCounter, 25 mSDsluCounter, 92 mSDsCounter, 0 mSdLazyCounter, 702 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s 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.5s IncrementalHoareTripleChecker+Time [2022-04-15 06:42:44,862 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [25 Valid, 105 Invalid, 722 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 702 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-04-15 06:42:44,862 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2022-04-15 06:42:44,969 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 68. [2022-04-15 06:42:44,970 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 06:42:44,970 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-15 06:42:44,970 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-15 06:42:44,970 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-15 06:42:44,971 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:42:44,971 INFO L93 Difference]: Finished difference Result 68 states and 72 transitions. [2022-04-15 06:42:44,971 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 72 transitions. [2022-04-15 06:42:44,971 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 06:42:44,971 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 06:42:44,971 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-15 06:42:44,972 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-15 06:42:44,972 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:42:44,972 INFO L93 Difference]: Finished difference Result 68 states and 72 transitions. [2022-04-15 06:42:44,972 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 72 transitions. [2022-04-15 06:42:44,972 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 06:42:44,973 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 06:42:44,973 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 06:42:44,973 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 06:42:44,973 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-15 06:42:44,973 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 72 transitions. [2022-04-15 06:42:44,974 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 72 transitions. Word has length 47 [2022-04-15 06:42:44,974 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 06:42:44,974 INFO L478 AbstractCegarLoop]: Abstraction has 68 states and 72 transitions. [2022-04-15 06:42:44,974 INFO L479 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-15 06:42:44,974 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 68 states and 72 transitions. [2022-04-15 06:42:45,036 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-15 06:42:45,036 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 72 transitions. [2022-04-15 06:42:45,037 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2022-04-15 06:42:45,037 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 06:42:45,037 INFO L499 BasicCegarLoop]: trace histogram [15, 14, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 06:42:45,052 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-15 06:42:45,237 WARN L460 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-15 06:42:45,237 INFO L403 AbstractCegarLoop]: === Iteration 14 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 06:42:45,238 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 06:42:45,238 INFO L85 PathProgramCache]: Analyzing trace with hash 266043011, now seen corresponding path program 11 times [2022-04-15 06:42:45,238 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 06:42:45,238 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [359097566] [2022-04-15 06:42:49,291 WARN L977 rdanLoopAcceleration]: Unable to prove correctness of quantifier elimination. [2022-04-15 06:42:49,333 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-15 06:42:49,552 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-15 06:42:49,553 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-15 06:42:49,555 INFO L85 PathProgramCache]: Analyzing trace with hash -1720356830, now seen corresponding path program 1 times [2022-04-15 06:42:49,555 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 06:42:49,555 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1521457402] [2022-04-15 06:42:49,556 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 06:42:49,556 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 06:42:49,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:42:49,710 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 06:42:49,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:42:49,714 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-15 06:42:49,715 INFO L290 TraceCheckUtils]: 1: Hoare triple {5597#true} assume true; {5597#true} is VALID [2022-04-15 06:42:49,715 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {5597#true} {5597#true} #52#return; {5597#true} is VALID [2022-04-15 06:42:49,716 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-15 06:42:49,716 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-15 06:42:49,717 INFO L290 TraceCheckUtils]: 2: Hoare triple {5597#true} assume true; {5597#true} is VALID [2022-04-15 06:42:49,717 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {5597#true} {5597#true} #52#return; {5597#true} is VALID [2022-04-15 06:42:49,717 INFO L272 TraceCheckUtils]: 4: Hoare triple {5597#true} call #t~ret9 := main(); {5597#true} is VALID [2022-04-15 06:42:49,717 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-15 06:42:49,718 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-15 06:42:49,718 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-15 06:42:49,719 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-15 06:42:49,719 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-15 06:42:49,720 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-15 06:42:49,720 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-15 06:42:49,721 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-15 06:42:49,721 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-15 06:42:49,722 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-15 06:42:49,722 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-15 06:42:49,723 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-15 06:42:49,723 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-15 06:42:49,723 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-15 06:42:49,723 INFO L290 TraceCheckUtils]: 19: Hoare triple {5598#false} ~cond := #in~cond; {5598#false} is VALID [2022-04-15 06:42:49,723 INFO L290 TraceCheckUtils]: 20: Hoare triple {5598#false} assume 0 == ~cond; {5598#false} is VALID [2022-04-15 06:42:49,723 INFO L290 TraceCheckUtils]: 21: Hoare triple {5598#false} assume !false; {5598#false} is VALID [2022-04-15 06:42:49,724 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-15 06:42:49,724 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 06:42:49,724 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1521457402] [2022-04-15 06:42:49,724 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1521457402] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 06:42:49,724 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [205740556] [2022-04-15 06:42:49,724 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 06:42:49,725 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 06:42:49,725 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 06:42:49,725 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-15 06:42:49,726 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-15 06:42:49,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:42:49,756 INFO L263 TraceCheckSpWp]: Trace formula consists of 94 conjuncts, 11 conjunts are in the unsatisfiable core [2022-04-15 06:42:49,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:42:49,770 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 06:42:50,063 INFO L272 TraceCheckUtils]: 0: Hoare triple {5597#true} call ULTIMATE.init(); {5597#true} is VALID [2022-04-15 06:42:50,063 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-15 06:42:50,063 INFO L290 TraceCheckUtils]: 2: Hoare triple {5597#true} assume true; {5597#true} is VALID [2022-04-15 06:42:50,063 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {5597#true} {5597#true} #52#return; {5597#true} is VALID [2022-04-15 06:42:50,063 INFO L272 TraceCheckUtils]: 4: Hoare triple {5597#true} call #t~ret9 := main(); {5597#true} is VALID [2022-04-15 06:42:50,064 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-15 06:42:50,064 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-15 06:42:50,065 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-15 06:42:50,065 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-15 06:42:50,066 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-15 06:42:50,066 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-15 06:42:50,067 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-15 06:42:50,067 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-15 06:42:50,068 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-15 06:42:50,068 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-15 06:42:50,069 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-15 06:42:50,069 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-15 06:42:50,069 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-15 06:42:50,069 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-15 06:42:50,070 INFO L290 TraceCheckUtils]: 19: Hoare triple {5598#false} ~cond := #in~cond; {5598#false} is VALID [2022-04-15 06:42:50,070 INFO L290 TraceCheckUtils]: 20: Hoare triple {5598#false} assume 0 == ~cond; {5598#false} is VALID [2022-04-15 06:42:50,070 INFO L290 TraceCheckUtils]: 21: Hoare triple {5598#false} assume !false; {5598#false} is VALID [2022-04-15 06:42:50,070 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-15 06:42:50,070 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 06:42:50,361 INFO L290 TraceCheckUtils]: 21: Hoare triple {5598#false} assume !false; {5598#false} is VALID [2022-04-15 06:42:50,362 INFO L290 TraceCheckUtils]: 20: Hoare triple {5598#false} assume 0 == ~cond; {5598#false} is VALID [2022-04-15 06:42:50,362 INFO L290 TraceCheckUtils]: 19: Hoare triple {5598#false} ~cond := #in~cond; {5598#false} is VALID [2022-04-15 06:42:50,362 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-15 06:42:50,362 INFO L290 TraceCheckUtils]: 17: Hoare triple {5697#(< main_~z~0 main_~y~0)} assume !(~y~0 > ~z~0); {5598#false} is VALID [2022-04-15 06:42:50,363 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-15 06:42:50,363 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-15 06:42:50,364 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-15 06:42:50,364 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-15 06:42:50,365 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-15 06:42:50,365 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-15 06:42:50,365 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-15 06:42:50,366 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-15 06:42:50,367 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-15 06:42:50,367 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-15 06:42:50,367 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-15 06:42:50,367 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-15 06:42:50,368 INFO L272 TraceCheckUtils]: 4: Hoare triple {5597#true} call #t~ret9 := main(); {5597#true} is VALID [2022-04-15 06:42:50,368 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {5597#true} {5597#true} #52#return; {5597#true} is VALID [2022-04-15 06:42:50,368 INFO L290 TraceCheckUtils]: 2: Hoare triple {5597#true} assume true; {5597#true} is VALID [2022-04-15 06:42:50,368 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-15 06:42:50,368 INFO L272 TraceCheckUtils]: 0: Hoare triple {5597#true} call ULTIMATE.init(); {5597#true} is VALID [2022-04-15 06:42:50,368 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-15 06:42:50,368 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [205740556] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 06:42:50,368 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 06:42:50,368 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10, 10] total 27 [2022-04-15 06:42:50,851 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 06:42:50,851 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [359097566] [2022-04-15 06:42:50,851 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [359097566] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 06:42:50,851 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 06:42:50,851 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [27] imperfect sequences [] total 27 [2022-04-15 06:42:50,851 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [615975272] [2022-04-15 06:42:50,851 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 06:42:50,852 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-15 06:42:50,852 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 06:42:50,852 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-15 06:42:50,914 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-15 06:42:50,914 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2022-04-15 06:42:50,914 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 06:42:50,915 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2022-04-15 06:42:50,915 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=730, Invalid=1076, Unknown=0, NotChecked=0, Total=1806 [2022-04-15 06:42:50,915 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-15 06:42:52,289 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:42:52,290 INFO L93 Difference]: Finished difference Result 115 states and 137 transitions. [2022-04-15 06:42:52,290 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2022-04-15 06:42:52,290 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-15 06:42:52,290 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 06:42:52,290 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-15 06:42:52,291 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 81 transitions. [2022-04-15 06:42:52,291 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-15 06:42:52,292 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 81 transitions. [2022-04-15 06:42:52,292 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 27 states and 81 transitions. [2022-04-15 06:42:52,353 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-15 06:42:52,354 INFO L225 Difference]: With dead ends: 115 [2022-04-15 06:42:52,354 INFO L226 Difference]: Without dead ends: 83 [2022-04-15 06:42:52,355 INFO L912 BasicCegarLoop]: 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-15 06:42:52,356 INFO L913 BasicCegarLoop]: 12 mSDtfsCounter, 61 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 511 mSolverCounterSat, 93 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s 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.4s IncrementalHoareTripleChecker+Time [2022-04-15 06:42:52,356 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [61 Valid, 24 Invalid, 604 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [93 Valid, 511 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-04-15 06:42:52,356 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2022-04-15 06:42:52,433 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 55. [2022-04-15 06:42:52,433 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 06:42:52,433 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-15 06:42:52,433 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-15 06:42:52,433 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-15 06:42:52,434 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:42:52,434 INFO L93 Difference]: Finished difference Result 83 states and 87 transitions. [2022-04-15 06:42:52,434 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 87 transitions. [2022-04-15 06:42:52,435 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 06:42:52,435 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 06:42:52,435 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-15 06:42:52,435 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-15 06:42:52,436 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:42:52,436 INFO L93 Difference]: Finished difference Result 83 states and 87 transitions. [2022-04-15 06:42:52,436 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 87 transitions. [2022-04-15 06:42:52,436 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 06:42:52,436 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 06:42:52,436 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 06:42:52,436 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 06:42:52,436 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-15 06:42:52,437 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 58 transitions. [2022-04-15 06:42:52,437 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 58 transitions. Word has length 49 [2022-04-15 06:42:52,437 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 06:42:52,437 INFO L478 AbstractCegarLoop]: Abstraction has 55 states and 58 transitions. [2022-04-15 06:42:52,437 INFO L479 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-15 06:42:52,437 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 55 states and 58 transitions. [2022-04-15 06:42:52,495 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-15 06:42:52,495 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 58 transitions. [2022-04-15 06:42:52,495 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2022-04-15 06:42:52,496 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 06:42:52,496 INFO L499 BasicCegarLoop]: trace histogram [17, 16, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 06:42:52,511 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2022-04-15 06:42:52,696 WARN L460 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-15 06:42:52,696 INFO L403 AbstractCegarLoop]: === Iteration 15 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 06:42:52,696 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 06:42:52,696 INFO L85 PathProgramCache]: Analyzing trace with hash 2144068746, now seen corresponding path program 12 times [2022-04-15 06:42:52,697 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 06:42:52,697 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1682875404] [2022-04-15 06:42:55,129 WARN L977 rdanLoopAcceleration]: Unable to prove correctness of quantifier elimination. [2022-04-15 06:42:55,170 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-15 06:42:59,300 WARN L977 rdanLoopAcceleration]: Unable to prove correctness of quantifier elimination. [2022-04-15 06:42:59,417 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-15 06:42:59,418 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-15 06:42:59,420 INFO L85 PathProgramCache]: Analyzing trace with hash 1328191105, now seen corresponding path program 1 times [2022-04-15 06:42:59,420 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 06:42:59,420 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1586302132] [2022-04-15 06:42:59,420 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 06:42:59,421 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 06:42:59,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:42:59,599 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 06:42:59,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:42:59,603 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-15 06:42:59,603 INFO L290 TraceCheckUtils]: 1: Hoare triple {6328#true} assume true; {6328#true} is VALID [2022-04-15 06:42:59,603 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {6328#true} {6328#true} #52#return; {6328#true} is VALID [2022-04-15 06:42:59,604 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-15 06:42:59,604 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-15 06:42:59,604 INFO L290 TraceCheckUtils]: 2: Hoare triple {6328#true} assume true; {6328#true} is VALID [2022-04-15 06:42:59,604 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {6328#true} {6328#true} #52#return; {6328#true} is VALID [2022-04-15 06:42:59,604 INFO L272 TraceCheckUtils]: 4: Hoare triple {6328#true} call #t~ret9 := main(); {6328#true} is VALID [2022-04-15 06:42:59,605 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-15 06:42:59,605 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-15 06:42:59,606 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-15 06:42:59,607 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-15 06:42:59,607 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-15 06:42:59,608 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-15 06:42:59,608 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-15 06:42:59,609 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-15 06:42:59,609 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-15 06:42:59,610 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-15 06:42:59,611 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-15 06:42:59,611 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-15 06:42:59,612 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-15 06:42:59,612 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-15 06:42:59,612 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-15 06:42:59,612 INFO L290 TraceCheckUtils]: 20: Hoare triple {6329#false} ~cond := #in~cond; {6329#false} is VALID [2022-04-15 06:42:59,612 INFO L290 TraceCheckUtils]: 21: Hoare triple {6329#false} assume 0 == ~cond; {6329#false} is VALID [2022-04-15 06:42:59,612 INFO L290 TraceCheckUtils]: 22: Hoare triple {6329#false} assume !false; {6329#false} is VALID [2022-04-15 06:42:59,613 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-15 06:42:59,613 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 06:42:59,613 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1586302132] [2022-04-15 06:42:59,613 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1586302132] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 06:42:59,613 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [250181403] [2022-04-15 06:42:59,613 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 06:42:59,613 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 06:42:59,613 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 06:42:59,614 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-15 06:42:59,616 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-15 06:42:59,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:42:59,647 INFO L263 TraceCheckSpWp]: Trace formula consists of 99 conjuncts, 12 conjunts are in the unsatisfiable core [2022-04-15 06:42:59,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:42:59,658 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 06:43:00,019 INFO L272 TraceCheckUtils]: 0: Hoare triple {6328#true} call ULTIMATE.init(); {6328#true} is VALID [2022-04-15 06:43:00,020 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-15 06:43:00,020 INFO L290 TraceCheckUtils]: 2: Hoare triple {6328#true} assume true; {6328#true} is VALID [2022-04-15 06:43:00,020 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {6328#true} {6328#true} #52#return; {6328#true} is VALID [2022-04-15 06:43:00,020 INFO L272 TraceCheckUtils]: 4: Hoare triple {6328#true} call #t~ret9 := main(); {6328#true} is VALID [2022-04-15 06:43:00,021 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-15 06:43:00,021 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-15 06:43:00,021 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-15 06:43:00,022 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-15 06:43:00,023 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-15 06:43:00,023 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-15 06:43:00,024 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-15 06:43:00,024 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-15 06:43:00,025 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-15 06:43:00,025 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-15 06:43:00,026 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-15 06:43:00,026 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-15 06:43:00,027 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-15 06:43:00,027 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-15 06:43:00,027 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-15 06:43:00,027 INFO L290 TraceCheckUtils]: 20: Hoare triple {6329#false} ~cond := #in~cond; {6329#false} is VALID [2022-04-15 06:43:00,027 INFO L290 TraceCheckUtils]: 21: Hoare triple {6329#false} assume 0 == ~cond; {6329#false} is VALID [2022-04-15 06:43:00,027 INFO L290 TraceCheckUtils]: 22: Hoare triple {6329#false} assume !false; {6329#false} is VALID [2022-04-15 06:43:00,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-15 06:43:00,028 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 06:43:00,413 INFO L290 TraceCheckUtils]: 22: Hoare triple {6329#false} assume !false; {6329#false} is VALID [2022-04-15 06:43:00,413 INFO L290 TraceCheckUtils]: 21: Hoare triple {6329#false} assume 0 == ~cond; {6329#false} is VALID [2022-04-15 06:43:00,413 INFO L290 TraceCheckUtils]: 20: Hoare triple {6329#false} ~cond := #in~cond; {6329#false} is VALID [2022-04-15 06:43:00,413 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-15 06:43:00,413 INFO L290 TraceCheckUtils]: 18: Hoare triple {6436#(< main_~z~0 main_~y~0)} assume !(~y~0 > ~z~0); {6329#false} is VALID [2022-04-15 06:43:00,414 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-15 06:43:00,415 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-15 06:43:00,415 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-15 06:43:00,416 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-15 06:43:00,416 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-15 06:43:00,417 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-15 06:43:00,417 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-15 06:43:00,418 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-15 06:43:00,418 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-15 06:43:00,419 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-15 06:43:00,420 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-15 06:43:00,420 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-15 06:43:00,421 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-15 06:43:00,421 INFO L272 TraceCheckUtils]: 4: Hoare triple {6328#true} call #t~ret9 := main(); {6328#true} is VALID [2022-04-15 06:43:00,421 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {6328#true} {6328#true} #52#return; {6328#true} is VALID [2022-04-15 06:43:00,421 INFO L290 TraceCheckUtils]: 2: Hoare triple {6328#true} assume true; {6328#true} is VALID [2022-04-15 06:43:00,421 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-15 06:43:00,421 INFO L272 TraceCheckUtils]: 0: Hoare triple {6328#true} call ULTIMATE.init(); {6328#true} is VALID [2022-04-15 06:43:00,421 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-15 06:43:00,421 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [250181403] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 06:43:00,421 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 06:43:00,422 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 11, 11] total 33 [2022-04-15 06:43:01,074 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 06:43:01,074 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1682875404] [2022-04-15 06:43:01,074 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1682875404] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 06:43:01,074 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 06:43:01,074 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [30] imperfect sequences [] total 30 [2022-04-15 06:43:01,074 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [503587057] [2022-04-15 06:43:01,074 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 06:43:01,075 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-15 06:43:01,075 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 06:43:01,075 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-15 06:43:01,117 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-15 06:43:01,117 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2022-04-15 06:43:01,117 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 06:43:01,117 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2022-04-15 06:43:01,118 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=817, Invalid=1733, Unknown=0, NotChecked=0, Total=2550 [2022-04-15 06:43:01,118 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-15 06:43:03,183 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:43:03,184 INFO L93 Difference]: Finished difference Result 136 states and 146 transitions. [2022-04-15 06:43:03,184 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2022-04-15 06:43:03,184 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-15 06:43:03,184 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 06:43:03,184 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-15 06:43:03,185 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 66 transitions. [2022-04-15 06:43:03,185 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-15 06:43:03,185 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 66 transitions. [2022-04-15 06:43:03,186 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 21 states and 66 transitions. [2022-04-15 06:43:03,236 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-15 06:43:03,237 INFO L225 Difference]: With dead ends: 136 [2022-04-15 06:43:03,237 INFO L226 Difference]: Without dead ends: 89 [2022-04-15 06:43:03,238 INFO L912 BasicCegarLoop]: 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-15 06:43:03,239 INFO L913 BasicCegarLoop]: 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-15 06:43:03,239 INFO L914 BasicCegarLoop]: 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-15 06:43:03,239 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2022-04-15 06:43:03,394 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 89. [2022-04-15 06:43:03,395 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 06:43:03,395 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-15 06:43:03,395 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-15 06:43:03,395 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-15 06:43:03,396 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:43:03,396 INFO L93 Difference]: Finished difference Result 89 states and 93 transitions. [2022-04-15 06:43:03,396 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 93 transitions. [2022-04-15 06:43:03,396 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 06:43:03,396 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 06:43:03,397 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-15 06:43:03,397 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-15 06:43:03,398 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:43:03,398 INFO L93 Difference]: Finished difference Result 89 states and 93 transitions. [2022-04-15 06:43:03,398 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 93 transitions. [2022-04-15 06:43:03,398 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 06:43:03,398 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 06:43:03,398 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 06:43:03,398 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 06:43:03,398 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-15 06:43:03,399 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 93 transitions. [2022-04-15 06:43:03,399 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 93 transitions. Word has length 54 [2022-04-15 06:43:03,399 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 06:43:03,399 INFO L478 AbstractCegarLoop]: Abstraction has 89 states and 93 transitions. [2022-04-15 06:43:03,399 INFO L479 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-15 06:43:03,399 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 89 states and 93 transitions. [2022-04-15 06:43:03,481 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-15 06:43:03,481 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 93 transitions. [2022-04-15 06:43:03,482 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2022-04-15 06:43:03,482 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 06:43:03,482 INFO L499 BasicCegarLoop]: trace histogram [18, 17, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 06:43:03,497 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Forceful destruction successful, exit code 0 [2022-04-15 06:43:03,682 WARN L460 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-15 06:43:03,682 INFO L403 AbstractCegarLoop]: === Iteration 16 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 06:43:03,683 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 06:43:03,683 INFO L85 PathProgramCache]: Analyzing trace with hash -913170353, now seen corresponding path program 13 times [2022-04-15 06:43:03,683 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 06:43:03,683 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1157142199] [2022-04-15 06:43:03,786 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-15 06:43:04,007 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-15 06:43:04,008 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-15 06:43:04,011 INFO L85 PathProgramCache]: Analyzing trace with hash 117331329, now seen corresponding path program 1 times [2022-04-15 06:43:04,011 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 06:43:04,011 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [5331861] [2022-04-15 06:43:04,011 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 06:43:04,011 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 06:43:04,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:43:04,133 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 06:43:04,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:43:04,138 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-15 06:43:04,139 INFO L290 TraceCheckUtils]: 1: Hoare triple {7183#true} assume true; {7183#true} is VALID [2022-04-15 06:43:04,139 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {7183#true} {7183#true} #52#return; {7183#true} is VALID [2022-04-15 06:43:04,139 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-15 06:43:04,139 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-15 06:43:04,139 INFO L290 TraceCheckUtils]: 2: Hoare triple {7183#true} assume true; {7183#true} is VALID [2022-04-15 06:43:04,139 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {7183#true} {7183#true} #52#return; {7183#true} is VALID [2022-04-15 06:43:04,139 INFO L272 TraceCheckUtils]: 4: Hoare triple {7183#true} call #t~ret9 := main(); {7183#true} is VALID [2022-04-15 06:43:04,140 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-15 06:43:04,140 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-15 06:43:04,141 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-15 06:43:04,142 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-15 06:43:04,142 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-15 06:43:04,142 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-15 06:43:04,143 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-15 06:43:04,143 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-15 06:43:04,144 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-15 06:43:04,144 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-15 06:43:04,145 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-15 06:43:04,145 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-15 06:43:04,146 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-15 06:43:04,146 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-15 06:43:04,146 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-15 06:43:04,146 INFO L290 TraceCheckUtils]: 20: Hoare triple {7184#false} ~cond := #in~cond; {7184#false} is VALID [2022-04-15 06:43:04,147 INFO L290 TraceCheckUtils]: 21: Hoare triple {7184#false} assume 0 == ~cond; {7184#false} is VALID [2022-04-15 06:43:04,147 INFO L290 TraceCheckUtils]: 22: Hoare triple {7184#false} assume !false; {7184#false} is VALID [2022-04-15 06:43:04,147 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-15 06:43:04,147 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 06:43:04,147 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [5331861] [2022-04-15 06:43:04,147 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [5331861] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 06:43:04,147 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1807562282] [2022-04-15 06:43:04,147 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 06:43:04,147 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 06:43:04,147 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 06:43:04,148 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-15 06:43:04,149 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-15 06:43:04,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:43:04,180 INFO L263 TraceCheckSpWp]: Trace formula consists of 99 conjuncts, 12 conjunts are in the unsatisfiable core [2022-04-15 06:43:04,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:43:04,188 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 06:43:04,515 INFO L272 TraceCheckUtils]: 0: Hoare triple {7183#true} call ULTIMATE.init(); {7183#true} is VALID [2022-04-15 06:43:04,515 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-15 06:43:04,515 INFO L290 TraceCheckUtils]: 2: Hoare triple {7183#true} assume true; {7183#true} is VALID [2022-04-15 06:43:04,515 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {7183#true} {7183#true} #52#return; {7183#true} is VALID [2022-04-15 06:43:04,516 INFO L272 TraceCheckUtils]: 4: Hoare triple {7183#true} call #t~ret9 := main(); {7183#true} is VALID [2022-04-15 06:43:04,516 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-15 06:43:04,516 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-15 06:43:04,517 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-15 06:43:04,518 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-15 06:43:04,518 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-15 06:43:04,519 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-15 06:43:04,519 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-15 06:43:04,520 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-15 06:43:04,524 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-15 06:43:04,525 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-15 06:43:04,526 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-15 06:43:04,526 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-15 06:43:04,527 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-15 06:43:04,527 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-15 06:43:04,527 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-15 06:43:04,527 INFO L290 TraceCheckUtils]: 20: Hoare triple {7184#false} ~cond := #in~cond; {7184#false} is VALID [2022-04-15 06:43:04,527 INFO L290 TraceCheckUtils]: 21: Hoare triple {7184#false} assume 0 == ~cond; {7184#false} is VALID [2022-04-15 06:43:04,527 INFO L290 TraceCheckUtils]: 22: Hoare triple {7184#false} assume !false; {7184#false} is VALID [2022-04-15 06:43:04,528 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-15 06:43:04,528 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 06:43:04,885 INFO L290 TraceCheckUtils]: 22: Hoare triple {7184#false} assume !false; {7184#false} is VALID [2022-04-15 06:43:04,885 INFO L290 TraceCheckUtils]: 21: Hoare triple {7184#false} assume 0 == ~cond; {7184#false} is VALID [2022-04-15 06:43:04,885 INFO L290 TraceCheckUtils]: 20: Hoare triple {7184#false} ~cond := #in~cond; {7184#false} is VALID [2022-04-15 06:43:04,885 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-15 06:43:04,885 INFO L290 TraceCheckUtils]: 18: Hoare triple {7288#(< main_~z~0 main_~y~0)} assume !(~y~0 > ~z~0); {7184#false} is VALID [2022-04-15 06:43:04,886 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-15 06:43:04,887 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-15 06:43:04,895 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-15 06:43:04,895 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-15 06:43:04,896 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-15 06:43:04,896 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-15 06:43:04,897 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-15 06:43:04,897 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-15 06:43:04,898 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-15 06:43:04,898 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-15 06:43:04,899 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-15 06:43:04,899 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-15 06:43:04,900 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-15 06:43:04,900 INFO L272 TraceCheckUtils]: 4: Hoare triple {7183#true} call #t~ret9 := main(); {7183#true} is VALID [2022-04-15 06:43:04,900 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {7183#true} {7183#true} #52#return; {7183#true} is VALID [2022-04-15 06:43:04,900 INFO L290 TraceCheckUtils]: 2: Hoare triple {7183#true} assume true; {7183#true} is VALID [2022-04-15 06:43:04,900 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-15 06:43:04,900 INFO L272 TraceCheckUtils]: 0: Hoare triple {7183#true} call ULTIMATE.init(); {7183#true} is VALID [2022-04-15 06:43:04,900 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-15 06:43:04,900 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1807562282] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 06:43:04,900 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 06:43:04,900 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 11, 11] total 30 [2022-04-15 06:43:05,472 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 06:43:05,472 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1157142199] [2022-04-15 06:43:05,472 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1157142199] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 06:43:05,472 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 06:43:05,472 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [31] imperfect sequences [] total 31 [2022-04-15 06:43:05,472 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1934037097] [2022-04-15 06:43:05,472 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 06:43:05,473 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-15 06:43:05,473 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 06:43:05,473 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-15 06:43:05,519 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-15 06:43:05,519 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 31 states [2022-04-15 06:43:05,519 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 06:43:05,519 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2022-04-15 06:43:05,520 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=941, Invalid=1411, Unknown=0, NotChecked=0, Total=2352 [2022-04-15 06:43:05,520 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-15 06:43:07,445 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:43:07,445 INFO L93 Difference]: Finished difference Result 143 states and 157 transitions. [2022-04-15 06:43:07,445 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2022-04-15 06:43:07,446 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-15 06:43:07,446 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 06:43:07,446 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-15 06:43:07,447 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 80 transitions. [2022-04-15 06:43:07,447 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-15 06:43:07,448 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 80 transitions. [2022-04-15 06:43:07,448 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 31 states and 80 transitions. [2022-04-15 06:43:07,519 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-15 06:43:07,520 INFO L225 Difference]: With dead ends: 143 [2022-04-15 06:43:07,520 INFO L226 Difference]: Without dead ends: 96 [2022-04-15 06:43:07,522 INFO L912 BasicCegarLoop]: 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-15 06:43:07,523 INFO L913 BasicCegarLoop]: 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-15 06:43:07,523 INFO L914 BasicCegarLoop]: 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-15 06:43:07,523 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2022-04-15 06:43:07,621 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 62. [2022-04-15 06:43:07,621 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 06:43:07,622 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-15 06:43:07,622 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-15 06:43:07,622 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-15 06:43:07,623 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:43:07,623 INFO L93 Difference]: Finished difference Result 96 states and 100 transitions. [2022-04-15 06:43:07,623 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 100 transitions. [2022-04-15 06:43:07,623 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 06:43:07,623 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 06:43:07,623 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-15 06:43:07,624 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-15 06:43:07,624 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:43:07,625 INFO L93 Difference]: Finished difference Result 96 states and 100 transitions. [2022-04-15 06:43:07,625 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 100 transitions. [2022-04-15 06:43:07,625 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 06:43:07,625 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 06:43:07,625 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 06:43:07,625 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 06:43:07,625 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-15 06:43:07,626 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 65 transitions. [2022-04-15 06:43:07,626 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 65 transitions. Word has length 56 [2022-04-15 06:43:07,626 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 06:43:07,626 INFO L478 AbstractCegarLoop]: Abstraction has 62 states and 65 transitions. [2022-04-15 06:43:07,626 INFO L479 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-15 06:43:07,626 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 62 states and 65 transitions. [2022-04-15 06:43:07,698 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-15 06:43:07,698 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 65 transitions. [2022-04-15 06:43:07,699 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2022-04-15 06:43:07,699 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 06:43:07,699 INFO L499 BasicCegarLoop]: trace histogram [20, 19, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 06:43:07,717 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-15 06:43:07,899 WARN L460 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-15 06:43:07,900 INFO L403 AbstractCegarLoop]: === Iteration 17 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 06:43:07,900 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 06:43:07,900 INFO L85 PathProgramCache]: Analyzing trace with hash 2122774122, now seen corresponding path program 14 times [2022-04-15 06:43:07,900 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 06:43:07,900 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1311200629] [2022-04-15 06:43:11,964 WARN L977 rdanLoopAcceleration]: Unable to prove correctness of quantifier elimination. [2022-04-15 06:43:12,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-15 06:43:12,240 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-15 06:43:12,241 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-15 06:43:12,243 INFO L85 PathProgramCache]: Analyzing trace with hash 495894274, now seen corresponding path program 1 times [2022-04-15 06:43:12,243 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 06:43:12,243 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1004765599] [2022-04-15 06:43:12,243 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 06:43:12,243 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 06:43:12,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:43:12,433 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 06:43:12,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:43:12,452 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-15 06:43:12,452 INFO L290 TraceCheckUtils]: 1: Hoare triple {8030#true} assume true; {8030#true} is VALID [2022-04-15 06:43:12,452 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {8030#true} {8030#true} #52#return; {8030#true} is VALID [2022-04-15 06:43:12,453 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-15 06:43:12,453 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-15 06:43:12,453 INFO L290 TraceCheckUtils]: 2: Hoare triple {8030#true} assume true; {8030#true} is VALID [2022-04-15 06:43:12,453 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {8030#true} {8030#true} #52#return; {8030#true} is VALID [2022-04-15 06:43:12,453 INFO L272 TraceCheckUtils]: 4: Hoare triple {8030#true} call #t~ret9 := main(); {8030#true} is VALID [2022-04-15 06:43:12,453 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-15 06:43:12,454 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-15 06:43:12,454 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-15 06:43:12,455 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-15 06:43:12,456 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-15 06:43:12,456 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-15 06:43:12,457 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-15 06:43:12,457 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-15 06:43:12,458 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-15 06:43:12,458 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-15 06:43:12,459 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-15 06:43:12,459 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-15 06:43:12,460 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-15 06:43:12,460 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-15 06:43:12,461 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-15 06:43:12,461 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-15 06:43:12,461 INFO L290 TraceCheckUtils]: 21: Hoare triple {8031#false} ~cond := #in~cond; {8031#false} is VALID [2022-04-15 06:43:12,461 INFO L290 TraceCheckUtils]: 22: Hoare triple {8031#false} assume 0 == ~cond; {8031#false} is VALID [2022-04-15 06:43:12,461 INFO L290 TraceCheckUtils]: 23: Hoare triple {8031#false} assume !false; {8031#false} is VALID [2022-04-15 06:43:12,461 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-15 06:43:12,461 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 06:43:12,461 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1004765599] [2022-04-15 06:43:12,461 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1004765599] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 06:43:12,461 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1825690371] [2022-04-15 06:43:12,461 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 06:43:12,462 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 06:43:12,462 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 06:43:12,463 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-15 06:43:12,465 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-15 06:43:12,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:43:12,494 INFO L263 TraceCheckSpWp]: Trace formula consists of 104 conjuncts, 13 conjunts are in the unsatisfiable core [2022-04-15 06:43:12,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:43:12,506 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 06:43:12,923 INFO L272 TraceCheckUtils]: 0: Hoare triple {8030#true} call ULTIMATE.init(); {8030#true} is VALID [2022-04-15 06:43:12,923 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-15 06:43:12,923 INFO L290 TraceCheckUtils]: 2: Hoare triple {8030#true} assume true; {8030#true} is VALID [2022-04-15 06:43:12,923 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {8030#true} {8030#true} #52#return; {8030#true} is VALID [2022-04-15 06:43:12,923 INFO L272 TraceCheckUtils]: 4: Hoare triple {8030#true} call #t~ret9 := main(); {8030#true} is VALID [2022-04-15 06:43:12,924 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-15 06:43:12,924 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-15 06:43:12,924 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-15 06:43:12,925 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-15 06:43:12,926 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-15 06:43:12,926 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-15 06:43:12,927 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-15 06:43:12,927 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-15 06:43:12,928 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-15 06:43:12,928 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-15 06:43:12,934 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-15 06:43:12,935 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-15 06:43:12,935 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-15 06:43:12,936 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-15 06:43:12,936 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-15 06:43:12,936 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-15 06:43:12,936 INFO L290 TraceCheckUtils]: 21: Hoare triple {8031#false} ~cond := #in~cond; {8031#false} is VALID [2022-04-15 06:43:12,937 INFO L290 TraceCheckUtils]: 22: Hoare triple {8031#false} assume 0 == ~cond; {8031#false} is VALID [2022-04-15 06:43:12,937 INFO L290 TraceCheckUtils]: 23: Hoare triple {8031#false} assume !false; {8031#false} is VALID [2022-04-15 06:43:12,937 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-15 06:43:12,937 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 06:43:13,347 INFO L290 TraceCheckUtils]: 23: Hoare triple {8031#false} assume !false; {8031#false} is VALID [2022-04-15 06:43:13,347 INFO L290 TraceCheckUtils]: 22: Hoare triple {8031#false} assume 0 == ~cond; {8031#false} is VALID [2022-04-15 06:43:13,347 INFO L290 TraceCheckUtils]: 21: Hoare triple {8031#false} ~cond := #in~cond; {8031#false} is VALID [2022-04-15 06:43:13,347 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-15 06:43:13,348 INFO L290 TraceCheckUtils]: 19: Hoare triple {8143#(< main_~z~0 main_~y~0)} assume !(~y~0 > ~z~0); {8031#false} is VALID [2022-04-15 06:43:13,348 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-15 06:43:13,349 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-15 06:43:13,349 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-15 06:43:13,350 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-15 06:43:13,350 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-15 06:43:13,350 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-15 06:43:13,351 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-15 06:43:13,351 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-15 06:43:13,352 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-15 06:43:13,352 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-15 06:43:13,353 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-15 06:43:13,353 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-15 06:43:13,354 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-15 06:43:13,354 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-15 06:43:13,354 INFO L272 TraceCheckUtils]: 4: Hoare triple {8030#true} call #t~ret9 := main(); {8030#true} is VALID [2022-04-15 06:43:13,354 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {8030#true} {8030#true} #52#return; {8030#true} is VALID [2022-04-15 06:43:13,354 INFO L290 TraceCheckUtils]: 2: Hoare triple {8030#true} assume true; {8030#true} is VALID [2022-04-15 06:43:13,354 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-15 06:43:13,354 INFO L272 TraceCheckUtils]: 0: Hoare triple {8030#true} call ULTIMATE.init(); {8030#true} is VALID [2022-04-15 06:43:13,354 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-15 06:43:13,355 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1825690371] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 06:43:13,355 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 06:43:13,355 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 12, 12] total 36 [2022-04-15 06:43:13,984 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 06:43:13,984 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1311200629] [2022-04-15 06:43:13,984 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1311200629] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 06:43:13,984 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 06:43:13,984 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [34] imperfect sequences [] total 34 [2022-04-15 06:43:13,984 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [69459355] [2022-04-15 06:43:13,984 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 06:43:13,985 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-15 06:43:13,985 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 06:43:13,985 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-15 06:43:14,027 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-15 06:43:14,027 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 34 states [2022-04-15 06:43:14,027 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 06:43:14,028 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2022-04-15 06:43:14,029 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1225, Invalid=1967, Unknown=0, NotChecked=0, Total=3192 [2022-04-15 06:43:14,029 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-15 06:43:16,281 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:43:16,282 INFO L93 Difference]: Finished difference Result 157 states and 168 transitions. [2022-04-15 06:43:16,282 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2022-04-15 06:43:16,282 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-15 06:43:16,282 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 06:43:16,282 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-15 06:43:16,283 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 83 transitions. [2022-04-15 06:43:16,283 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-15 06:43:16,284 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 83 transitions. [2022-04-15 06:43:16,284 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 34 states and 83 transitions. [2022-04-15 06:43:16,344 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-15 06:43:16,345 INFO L225 Difference]: With dead ends: 157 [2022-04-15 06:43:16,345 INFO L226 Difference]: Without dead ends: 103 [2022-04-15 06:43:16,347 INFO L912 BasicCegarLoop]: 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-15 06:43:16,347 INFO L913 BasicCegarLoop]: 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-15 06:43:16,347 INFO L914 BasicCegarLoop]: 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-15 06:43:16,347 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2022-04-15 06:43:16,524 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 103. [2022-04-15 06:43:16,524 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 06:43:16,524 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-15 06:43:16,524 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-15 06:43:16,524 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-15 06:43:16,526 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:43:16,526 INFO L93 Difference]: Finished difference Result 103 states and 107 transitions. [2022-04-15 06:43:16,526 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 107 transitions. [2022-04-15 06:43:16,526 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 06:43:16,526 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 06:43:16,526 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-15 06:43:16,526 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-15 06:43:16,527 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:43:16,527 INFO L93 Difference]: Finished difference Result 103 states and 107 transitions. [2022-04-15 06:43:16,527 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 107 transitions. [2022-04-15 06:43:16,528 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 06:43:16,528 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 06:43:16,528 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 06:43:16,528 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 06:43:16,528 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-15 06:43:16,529 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 107 transitions. [2022-04-15 06:43:16,529 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 107 transitions. Word has length 61 [2022-04-15 06:43:16,529 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 06:43:16,529 INFO L478 AbstractCegarLoop]: Abstraction has 103 states and 107 transitions. [2022-04-15 06:43:16,529 INFO L479 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-15 06:43:16,529 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 103 states and 107 transitions. [2022-04-15 06:43:16,644 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-15 06:43:16,645 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 107 transitions. [2022-04-15 06:43:16,645 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2022-04-15 06:43:16,645 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 06:43:16,645 INFO L499 BasicCegarLoop]: trace histogram [21, 20, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 06:43:16,660 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-15 06:43:16,847 WARN L460 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-15 06:43:16,848 INFO L403 AbstractCegarLoop]: === Iteration 18 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 06:43:16,848 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 06:43:16,848 INFO L85 PathProgramCache]: Analyzing trace with hash 1450885374, now seen corresponding path program 15 times [2022-04-15 06:43:16,848 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 06:43:16,848 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [477247922] [2022-04-15 06:43:20,917 WARN L977 rdanLoopAcceleration]: Unable to prove correctness of quantifier elimination. [2022-04-15 06:43:20,961 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-15 06:43:21,189 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-15 06:43:21,191 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-15 06:43:21,193 INFO L85 PathProgramCache]: Analyzing trace with hash -1471716447, now seen corresponding path program 1 times [2022-04-15 06:43:21,193 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 06:43:21,193 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [348809035] [2022-04-15 06:43:21,193 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 06:43:21,193 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 06:43:21,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:43:21,407 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 06:43:21,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:43:21,412 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-15 06:43:21,412 INFO L290 TraceCheckUtils]: 1: Hoare triple {9021#true} assume true; {9021#true} is VALID [2022-04-15 06:43:21,412 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {9021#true} {9021#true} #52#return; {9021#true} is VALID [2022-04-15 06:43:21,413 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-15 06:43:21,413 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-15 06:43:21,413 INFO L290 TraceCheckUtils]: 2: Hoare triple {9021#true} assume true; {9021#true} is VALID [2022-04-15 06:43:21,413 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {9021#true} {9021#true} #52#return; {9021#true} is VALID [2022-04-15 06:43:21,413 INFO L272 TraceCheckUtils]: 4: Hoare triple {9021#true} call #t~ret9 := main(); {9021#true} is VALID [2022-04-15 06:43:21,413 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-15 06:43:21,414 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-15 06:43:21,414 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-15 06:43:21,415 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-15 06:43:21,416 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-15 06:43:21,416 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-15 06:43:21,416 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-15 06:43:21,417 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-15 06:43:21,417 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-15 06:43:21,418 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-15 06:43:21,418 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-15 06:43:21,419 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-15 06:43:21,420 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-15 06:43:21,420 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-15 06:43:21,421 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-15 06:43:21,421 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-15 06:43:21,421 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-15 06:43:21,421 INFO L290 TraceCheckUtils]: 22: Hoare triple {9022#false} ~cond := #in~cond; {9022#false} is VALID [2022-04-15 06:43:21,421 INFO L290 TraceCheckUtils]: 23: Hoare triple {9022#false} assume 0 == ~cond; {9022#false} is VALID [2022-04-15 06:43:21,421 INFO L290 TraceCheckUtils]: 24: Hoare triple {9022#false} assume !false; {9022#false} is VALID [2022-04-15 06:43:21,421 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-15 06:43:21,422 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 06:43:21,422 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [348809035] [2022-04-15 06:43:21,422 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [348809035] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 06:43:21,422 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [820931740] [2022-04-15 06:43:21,422 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 06:43:21,422 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 06:43:21,422 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 06:43:21,423 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-15 06:43:21,424 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-15 06:43:21,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:43:21,462 INFO L263 TraceCheckSpWp]: Trace formula consists of 109 conjuncts, 14 conjunts are in the unsatisfiable core [2022-04-15 06:43:21,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:43:21,472 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 06:43:21,865 INFO L272 TraceCheckUtils]: 0: Hoare triple {9021#true} call ULTIMATE.init(); {9021#true} is VALID [2022-04-15 06:43:21,865 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-15 06:43:21,865 INFO L290 TraceCheckUtils]: 2: Hoare triple {9021#true} assume true; {9021#true} is VALID [2022-04-15 06:43:21,865 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {9021#true} {9021#true} #52#return; {9021#true} is VALID [2022-04-15 06:43:21,865 INFO L272 TraceCheckUtils]: 4: Hoare triple {9021#true} call #t~ret9 := main(); {9021#true} is VALID [2022-04-15 06:43:21,866 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-15 06:43:21,866 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-15 06:43:21,867 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-15 06:43:21,867 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-15 06:43:21,868 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-15 06:43:21,868 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-15 06:43:21,869 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-15 06:43:21,869 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-15 06:43:21,870 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-15 06:43:21,870 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-15 06:43:21,871 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-15 06:43:21,871 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-15 06:43:21,871 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-15 06:43:21,872 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-15 06:43:21,872 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-15 06:43:21,873 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-15 06:43:21,873 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-15 06:43:21,873 INFO L290 TraceCheckUtils]: 22: Hoare triple {9022#false} ~cond := #in~cond; {9022#false} is VALID [2022-04-15 06:43:21,873 INFO L290 TraceCheckUtils]: 23: Hoare triple {9022#false} assume 0 == ~cond; {9022#false} is VALID [2022-04-15 06:43:21,873 INFO L290 TraceCheckUtils]: 24: Hoare triple {9022#false} assume !false; {9022#false} is VALID [2022-04-15 06:43:21,873 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-15 06:43:21,873 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 06:43:22,344 INFO L290 TraceCheckUtils]: 24: Hoare triple {9022#false} assume !false; {9022#false} is VALID [2022-04-15 06:43:22,344 INFO L290 TraceCheckUtils]: 23: Hoare triple {9022#false} assume 0 == ~cond; {9022#false} is VALID [2022-04-15 06:43:22,345 INFO L290 TraceCheckUtils]: 22: Hoare triple {9022#false} ~cond := #in~cond; {9022#false} is VALID [2022-04-15 06:43:22,345 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-15 06:43:22,345 INFO L290 TraceCheckUtils]: 20: Hoare triple {9139#(< main_~z~0 main_~y~0)} assume !(~y~0 > ~z~0); {9022#false} is VALID [2022-04-15 06:43:22,345 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-15 06:43:22,346 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-15 06:43:22,346 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-15 06:43:22,347 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-15 06:43:22,347 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-15 06:43:22,348 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-15 06:43:22,348 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-15 06:43:22,349 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-15 06:43:22,349 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-15 06:43:22,350 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-15 06:43:22,350 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-15 06:43:22,351 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-15 06:43:22,351 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-15 06:43:22,351 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-15 06:43:22,352 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-15 06:43:22,352 INFO L272 TraceCheckUtils]: 4: Hoare triple {9021#true} call #t~ret9 := main(); {9021#true} is VALID [2022-04-15 06:43:22,352 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {9021#true} {9021#true} #52#return; {9021#true} is VALID [2022-04-15 06:43:22,352 INFO L290 TraceCheckUtils]: 2: Hoare triple {9021#true} assume true; {9021#true} is VALID [2022-04-15 06:43:22,352 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-15 06:43:22,352 INFO L272 TraceCheckUtils]: 0: Hoare triple {9021#true} call ULTIMATE.init(); {9021#true} is VALID [2022-04-15 06:43:22,352 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-15 06:43:22,353 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [820931740] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 06:43:22,353 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 06:43:22,353 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 13, 13] total 39 [2022-04-15 06:43:23,060 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 06:43:23,060 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [477247922] [2022-04-15 06:43:23,060 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [477247922] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 06:43:23,060 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 06:43:23,060 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [36] imperfect sequences [] total 36 [2022-04-15 06:43:23,060 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [69823876] [2022-04-15 06:43:23,060 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 06:43:23,061 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-15 06:43:23,061 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 06:43:23,061 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-15 06:43:23,107 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-15 06:43:23,107 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 36 states [2022-04-15 06:43:23,108 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 06:43:23,108 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2022-04-15 06:43:23,110 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1434, Invalid=2226, Unknown=0, NotChecked=0, Total=3660 [2022-04-15 06:43:23,110 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-15 06:43:25,752 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:43:25,752 INFO L93 Difference]: Finished difference Result 161 states and 171 transitions. [2022-04-15 06:43:25,752 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2022-04-15 06:43:25,752 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-15 06:43:25,753 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 06:43:25,753 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-15 06:43:25,754 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 85 transitions. [2022-04-15 06:43:25,754 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-15 06:43:25,755 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 85 transitions. [2022-04-15 06:43:25,755 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 36 states and 85 transitions. [2022-04-15 06:43:25,845 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-15 06:43:25,847 INFO L225 Difference]: With dead ends: 161 [2022-04-15 06:43:25,847 INFO L226 Difference]: Without dead ends: 106 [2022-04-15 06:43:25,848 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 148 GetRequests, 54 SyntacticMatches, 2 SemanticMatches, 92 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2527 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=2878, Invalid=5864, Unknown=0, NotChecked=0, Total=8742 [2022-04-15 06:43:25,848 INFO L913 BasicCegarLoop]: 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-15 06:43:25,849 INFO L914 BasicCegarLoop]: 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-15 06:43:25,850 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states. [2022-04-15 06:43:26,046 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 106. [2022-04-15 06:43:26,046 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 06:43:26,046 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-15 06:43:26,046 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-15 06:43:26,047 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-15 06:43:26,048 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:43:26,048 INFO L93 Difference]: Finished difference Result 106 states and 110 transitions. [2022-04-15 06:43:26,048 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 110 transitions. [2022-04-15 06:43:26,049 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 06:43:26,049 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 06:43:26,049 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-15 06:43:26,049 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-15 06:43:26,051 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:43:26,051 INFO L93 Difference]: Finished difference Result 106 states and 110 transitions. [2022-04-15 06:43:26,051 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 110 transitions. [2022-04-15 06:43:26,051 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 06:43:26,051 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 06:43:26,051 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 06:43:26,051 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 06:43:26,052 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-15 06:43:26,053 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 110 transitions. [2022-04-15 06:43:26,053 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 110 transitions. Word has length 64 [2022-04-15 06:43:26,053 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 06:43:26,053 INFO L478 AbstractCegarLoop]: Abstraction has 106 states and 110 transitions. [2022-04-15 06:43:26,053 INFO L479 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-15 06:43:26,054 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 106 states and 110 transitions. [2022-04-15 06:43:26,173 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-15 06:43:26,174 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 110 transitions. [2022-04-15 06:43:26,174 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2022-04-15 06:43:26,174 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 06:43:26,174 INFO L499 BasicCegarLoop]: trace histogram [22, 21, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 06:43:26,214 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-15 06:43:26,387 WARN L460 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-15 06:43:26,387 INFO L403 AbstractCegarLoop]: === Iteration 19 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 06:43:26,388 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 06:43:26,388 INFO L85 PathProgramCache]: Analyzing trace with hash 1447479616, now seen corresponding path program 16 times [2022-04-15 06:43:26,388 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 06:43:26,388 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1863370658] [2022-04-15 06:43:30,464 WARN L977 rdanLoopAcceleration]: Unable to prove correctness of quantifier elimination. [2022-04-15 06:43:30,514 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-15 06:43:30,720 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-15 06:43:30,721 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-15 06:43:30,723 INFO L85 PathProgramCache]: Analyzing trace with hash -1931266846, now seen corresponding path program 1 times [2022-04-15 06:43:30,723 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 06:43:30,723 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1389456795] [2022-04-15 06:43:30,723 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 06:43:30,724 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 06:43:30,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:43:30,914 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 06:43:30,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:43:30,920 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-15 06:43:30,921 INFO L290 TraceCheckUtils]: 1: Hoare triple {10046#true} assume true; {10046#true} is VALID [2022-04-15 06:43:30,921 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {10046#true} {10046#true} #52#return; {10046#true} is VALID [2022-04-15 06:43:30,921 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-15 06:43:30,921 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-15 06:43:30,921 INFO L290 TraceCheckUtils]: 2: Hoare triple {10046#true} assume true; {10046#true} is VALID [2022-04-15 06:43:30,921 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {10046#true} {10046#true} #52#return; {10046#true} is VALID [2022-04-15 06:43:30,921 INFO L272 TraceCheckUtils]: 4: Hoare triple {10046#true} call #t~ret9 := main(); {10046#true} is VALID [2022-04-15 06:43:30,930 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-15 06:43:30,930 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-15 06:43:30,930 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-15 06:43:30,931 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-15 06:43:30,932 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-15 06:43:30,932 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-15 06:43:30,933 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-15 06:43:30,933 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-15 06:43:30,934 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-15 06:43:30,934 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-15 06:43:30,935 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-15 06:43:30,935 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-15 06:43:30,936 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-15 06:43:30,936 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-15 06:43:30,937 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-15 06:43:30,937 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-15 06:43:30,937 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-15 06:43:30,938 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-15 06:43:30,938 INFO L290 TraceCheckUtils]: 23: Hoare triple {10047#false} ~cond := #in~cond; {10047#false} is VALID [2022-04-15 06:43:30,938 INFO L290 TraceCheckUtils]: 24: Hoare triple {10047#false} assume 0 == ~cond; {10047#false} is VALID [2022-04-15 06:43:30,938 INFO L290 TraceCheckUtils]: 25: Hoare triple {10047#false} assume !false; {10047#false} is VALID [2022-04-15 06:43:30,938 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-15 06:43:30,938 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 06:43:30,938 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1389456795] [2022-04-15 06:43:30,938 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1389456795] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 06:43:30,938 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [264146141] [2022-04-15 06:43:30,938 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 06:43:30,938 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 06:43:30,939 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 06:43:30,939 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-15 06:43:30,940 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-15 06:43:30,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:43:30,973 INFO L263 TraceCheckSpWp]: Trace formula consists of 114 conjuncts, 15 conjunts are in the unsatisfiable core [2022-04-15 06:43:30,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:43:30,983 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 06:43:31,387 INFO L272 TraceCheckUtils]: 0: Hoare triple {10046#true} call ULTIMATE.init(); {10046#true} is VALID [2022-04-15 06:43:31,388 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-15 06:43:31,388 INFO L290 TraceCheckUtils]: 2: Hoare triple {10046#true} assume true; {10046#true} is VALID [2022-04-15 06:43:31,388 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {10046#true} {10046#true} #52#return; {10046#true} is VALID [2022-04-15 06:43:31,388 INFO L272 TraceCheckUtils]: 4: Hoare triple {10046#true} call #t~ret9 := main(); {10046#true} is VALID [2022-04-15 06:43:31,388 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-15 06:43:31,389 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-15 06:43:31,389 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-15 06:43:31,390 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-15 06:43:31,390 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-15 06:43:31,391 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-15 06:43:31,391 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-15 06:43:31,392 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-15 06:43:31,392 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-15 06:43:31,393 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-15 06:43:31,393 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-15 06:43:31,394 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-15 06:43:31,394 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-15 06:43:31,394 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-15 06:43:31,395 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-15 06:43:31,395 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-15 06:43:31,396 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-15 06:43:31,396 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-15 06:43:31,396 INFO L290 TraceCheckUtils]: 23: Hoare triple {10047#false} ~cond := #in~cond; {10047#false} is VALID [2022-04-15 06:43:31,396 INFO L290 TraceCheckUtils]: 24: Hoare triple {10047#false} assume 0 == ~cond; {10047#false} is VALID [2022-04-15 06:43:31,396 INFO L290 TraceCheckUtils]: 25: Hoare triple {10047#false} assume !false; {10047#false} is VALID [2022-04-15 06:43:31,396 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-15 06:43:31,396 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 06:43:31,862 INFO L290 TraceCheckUtils]: 25: Hoare triple {10047#false} assume !false; {10047#false} is VALID [2022-04-15 06:43:31,862 INFO L290 TraceCheckUtils]: 24: Hoare triple {10047#false} assume 0 == ~cond; {10047#false} is VALID [2022-04-15 06:43:31,862 INFO L290 TraceCheckUtils]: 23: Hoare triple {10047#false} ~cond := #in~cond; {10047#false} is VALID [2022-04-15 06:43:31,862 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-15 06:43:31,863 INFO L290 TraceCheckUtils]: 21: Hoare triple {10166#(< main_~z~0 main_~y~0)} assume !(~y~0 > ~z~0); {10047#false} is VALID [2022-04-15 06:43:31,863 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-15 06:43:31,864 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-15 06:43:31,864 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-15 06:43:31,865 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-15 06:43:31,865 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-15 06:43:31,866 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-15 06:43:31,866 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-15 06:43:31,866 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-15 06:43:31,867 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-15 06:43:31,867 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-15 06:43:31,868 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-15 06:43:31,868 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-15 06:43:31,869 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-15 06:43:31,869 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-15 06:43:31,870 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-15 06:43:31,870 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-15 06:43:31,870 INFO L272 TraceCheckUtils]: 4: Hoare triple {10046#true} call #t~ret9 := main(); {10046#true} is VALID [2022-04-15 06:43:31,870 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {10046#true} {10046#true} #52#return; {10046#true} is VALID [2022-04-15 06:43:31,870 INFO L290 TraceCheckUtils]: 2: Hoare triple {10046#true} assume true; {10046#true} is VALID [2022-04-15 06:43:31,870 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-15 06:43:31,870 INFO L272 TraceCheckUtils]: 0: Hoare triple {10046#true} call ULTIMATE.init(); {10046#true} is VALID [2022-04-15 06:43:31,871 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-15 06:43:31,871 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [264146141] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 06:43:31,871 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 06:43:31,871 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 14, 14] total 39 [2022-04-15 06:43:32,608 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 06:43:32,609 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1863370658] [2022-04-15 06:43:32,609 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1863370658] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 06:43:32,609 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 06:43:32,609 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [38] imperfect sequences [] total 38 [2022-04-15 06:43:32,609 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1587020029] [2022-04-15 06:43:32,609 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 06:43:32,609 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-15 06:43:32,609 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 06:43:32,610 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-15 06:43:32,665 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-15 06:43:32,665 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 38 states [2022-04-15 06:43:32,665 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 06:43:32,666 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2022-04-15 06:43:32,666 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1535, Invalid=2247, Unknown=0, NotChecked=0, Total=3782 [2022-04-15 06:43:32,667 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-15 06:43:35,216 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:43:35,216 INFO L93 Difference]: Finished difference Result 171 states and 187 transitions. [2022-04-15 06:43:35,216 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2022-04-15 06:43:35,217 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-15 06:43:35,217 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 06:43:35,217 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-15 06:43:35,218 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 93 transitions. [2022-04-15 06:43:35,218 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-15 06:43:35,218 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 93 transitions. [2022-04-15 06:43:35,218 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 38 states and 93 transitions. [2022-04-15 06:43:35,287 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-15 06:43:35,288 INFO L225 Difference]: With dead ends: 171 [2022-04-15 06:43:35,288 INFO L226 Difference]: Without dead ends: 115 [2022-04-15 06:43:35,289 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 153 GetRequests, 55 SyntacticMatches, 3 SemanticMatches, 95 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2651 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=3177, Invalid=6135, Unknown=0, NotChecked=0, Total=9312 [2022-04-15 06:43:35,289 INFO L913 BasicCegarLoop]: 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-15 06:43:35,290 INFO L914 BasicCegarLoop]: 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-15 06:43:35,290 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115 states. [2022-04-15 06:43:35,447 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115 to 73. [2022-04-15 06:43:35,448 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 06:43:35,448 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-15 06:43:35,448 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-15 06:43:35,448 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-15 06:43:35,449 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:43:35,449 INFO L93 Difference]: Finished difference Result 115 states and 119 transitions. [2022-04-15 06:43:35,449 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 119 transitions. [2022-04-15 06:43:35,450 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 06:43:35,450 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 06:43:35,450 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-15 06:43:35,450 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-15 06:43:35,453 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:43:35,454 INFO L93 Difference]: Finished difference Result 115 states and 119 transitions. [2022-04-15 06:43:35,454 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 119 transitions. [2022-04-15 06:43:35,454 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 06:43:35,454 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 06:43:35,454 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 06:43:35,454 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 06:43:35,455 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-15 06:43:35,456 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 76 transitions. [2022-04-15 06:43:35,456 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 76 transitions. Word has length 67 [2022-04-15 06:43:35,456 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 06:43:35,456 INFO L478 AbstractCegarLoop]: Abstraction has 73 states and 76 transitions. [2022-04-15 06:43:35,457 INFO L479 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-15 06:43:35,457 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 73 states and 76 transitions. [2022-04-15 06:43:35,530 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-15 06:43:35,530 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 76 transitions. [2022-04-15 06:43:35,531 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2022-04-15 06:43:35,531 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 06:43:35,531 INFO L499 BasicCegarLoop]: trace histogram [24, 23, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 06:43:35,547 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-15 06:43:35,731 WARN L460 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-15 06:43:35,731 INFO L403 AbstractCegarLoop]: === Iteration 20 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 06:43:35,732 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 06:43:35,732 INFO L85 PathProgramCache]: Analyzing trace with hash 435450605, now seen corresponding path program 17 times [2022-04-15 06:43:35,732 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 06:43:35,732 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1451136692] [2022-04-15 06:43:35,816 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-15 06:43:35,996 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-15 06:43:35,998 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-15 06:43:36,000 INFO L85 PathProgramCache]: Analyzing trace with hash 729672129, now seen corresponding path program 1 times [2022-04-15 06:43:36,000 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 06:43:36,000 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1699386372] [2022-04-15 06:43:36,000 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 06:43:36,000 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 06:43:36,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:43:36,241 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 06:43:36,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:43:36,253 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-15 06:43:36,253 INFO L290 TraceCheckUtils]: 1: Hoare triple {11054#true} assume true; {11054#true} is VALID [2022-04-15 06:43:36,253 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {11054#true} {11054#true} #52#return; {11054#true} is VALID [2022-04-15 06:43:36,253 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-15 06:43:36,254 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-15 06:43:36,254 INFO L290 TraceCheckUtils]: 2: Hoare triple {11054#true} assume true; {11054#true} is VALID [2022-04-15 06:43:36,254 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {11054#true} {11054#true} #52#return; {11054#true} is VALID [2022-04-15 06:43:36,254 INFO L272 TraceCheckUtils]: 4: Hoare triple {11054#true} call #t~ret9 := main(); {11054#true} is VALID [2022-04-15 06:43:36,254 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-15 06:43:36,255 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-15 06:43:36,255 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-15 06:43:36,256 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-15 06:43:36,257 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-15 06:43:36,257 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-15 06:43:36,258 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-15 06:43:36,258 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-15 06:43:36,259 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-15 06:43:36,259 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-15 06:43:36,259 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-15 06:43:36,260 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-15 06:43:36,260 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-15 06:43:36,261 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-15 06:43:36,261 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-15 06:43:36,262 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-15 06:43:36,262 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-15 06:43:36,263 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-15 06:43:36,263 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-15 06:43:36,263 INFO L290 TraceCheckUtils]: 24: Hoare triple {11055#false} ~cond := #in~cond; {11055#false} is VALID [2022-04-15 06:43:36,263 INFO L290 TraceCheckUtils]: 25: Hoare triple {11055#false} assume 0 == ~cond; {11055#false} is VALID [2022-04-15 06:43:36,263 INFO L290 TraceCheckUtils]: 26: Hoare triple {11055#false} assume !false; {11055#false} is VALID [2022-04-15 06:43:36,263 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-15 06:43:36,263 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 06:43:36,263 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1699386372] [2022-04-15 06:43:36,263 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1699386372] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 06:43:36,264 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1254097321] [2022-04-15 06:43:36,264 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 06:43:36,264 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 06:43:36,264 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 06:43:36,265 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-15 06:43:36,266 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-15 06:43:36,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:43:36,297 INFO L263 TraceCheckSpWp]: Trace formula consists of 119 conjuncts, 16 conjunts are in the unsatisfiable core [2022-04-15 06:43:36,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:43:36,308 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 06:43:36,843 INFO L272 TraceCheckUtils]: 0: Hoare triple {11054#true} call ULTIMATE.init(); {11054#true} is VALID [2022-04-15 06:43:36,843 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-15 06:43:36,843 INFO L290 TraceCheckUtils]: 2: Hoare triple {11054#true} assume true; {11054#true} is VALID [2022-04-15 06:43:36,843 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {11054#true} {11054#true} #52#return; {11054#true} is VALID [2022-04-15 06:43:36,843 INFO L272 TraceCheckUtils]: 4: Hoare triple {11054#true} call #t~ret9 := main(); {11054#true} is VALID [2022-04-15 06:43:36,844 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-15 06:43:36,844 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-15 06:43:36,845 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-15 06:43:36,845 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-15 06:43:36,846 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-15 06:43:36,846 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-15 06:43:36,847 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-15 06:43:36,847 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-15 06:43:36,848 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-15 06:43:36,848 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-15 06:43:36,849 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-15 06:43:36,849 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-15 06:43:36,850 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-15 06:43:36,850 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-15 06:43:36,851 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-15 06:43:36,851 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-15 06:43:36,852 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-15 06:43:36,852 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-15 06:43:36,852 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-15 06:43:36,852 INFO L290 TraceCheckUtils]: 24: Hoare triple {11055#false} ~cond := #in~cond; {11055#false} is VALID [2022-04-15 06:43:36,852 INFO L290 TraceCheckUtils]: 25: Hoare triple {11055#false} assume 0 == ~cond; {11055#false} is VALID [2022-04-15 06:43:36,853 INFO L290 TraceCheckUtils]: 26: Hoare triple {11055#false} assume !false; {11055#false} is VALID [2022-04-15 06:43:36,853 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-15 06:43:36,853 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 06:43:37,440 INFO L290 TraceCheckUtils]: 26: Hoare triple {11055#false} assume !false; {11055#false} is VALID [2022-04-15 06:43:37,440 INFO L290 TraceCheckUtils]: 25: Hoare triple {11055#false} assume 0 == ~cond; {11055#false} is VALID [2022-04-15 06:43:37,441 INFO L290 TraceCheckUtils]: 24: Hoare triple {11055#false} ~cond := #in~cond; {11055#false} is VALID [2022-04-15 06:43:37,441 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-15 06:43:37,441 INFO L290 TraceCheckUtils]: 22: Hoare triple {11182#(< main_~z~0 main_~y~0)} assume !(~y~0 > ~z~0); {11055#false} is VALID [2022-04-15 06:43:37,441 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-15 06:43:37,442 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-15 06:43:37,443 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-15 06:43:37,443 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-15 06:43:37,444 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-15 06:43:37,444 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-15 06:43:37,445 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-15 06:43:37,445 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-15 06:43:37,446 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-15 06:43:37,446 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-15 06:43:37,447 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-15 06:43:37,447 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-15 06:43:37,448 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-15 06:43:37,448 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-15 06:43:37,449 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-15 06:43:37,449 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-15 06:43:37,450 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-15 06:43:37,450 INFO L272 TraceCheckUtils]: 4: Hoare triple {11054#true} call #t~ret9 := main(); {11054#true} is VALID [2022-04-15 06:43:37,450 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {11054#true} {11054#true} #52#return; {11054#true} is VALID [2022-04-15 06:43:37,450 INFO L290 TraceCheckUtils]: 2: Hoare triple {11054#true} assume true; {11054#true} is VALID [2022-04-15 06:43:37,450 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-15 06:43:37,450 INFO L272 TraceCheckUtils]: 0: Hoare triple {11054#true} call ULTIMATE.init(); {11054#true} is VALID [2022-04-15 06:43:37,450 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-15 06:43:37,450 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1254097321] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 06:43:37,450 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 06:43:37,450 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 15, 15] total 45 [2022-04-15 06:43:38,448 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 06:43:38,448 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1451136692] [2022-04-15 06:43:38,449 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1451136692] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 06:43:38,449 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 06:43:38,449 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [41] imperfect sequences [] total 41 [2022-04-15 06:43:38,449 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1232421370] [2022-04-15 06:43:38,449 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 06:43:38,449 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-15 06:43:38,450 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 06:43:38,450 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-15 06:43:38,515 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-15 06:43:38,515 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 41 states [2022-04-15 06:43:38,515 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 06:43:38,515 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2022-04-15 06:43:38,516 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1586, Invalid=3244, Unknown=0, NotChecked=0, Total=4830 [2022-04-15 06:43:38,516 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-15 06:43:41,833 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:43:41,833 INFO L93 Difference]: Finished difference Result 186 states and 196 transitions. [2022-04-15 06:43:41,833 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2022-04-15 06:43:41,833 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-15 06:43:41,833 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 06:43:41,833 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-15 06:43:41,834 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 80 transitions. [2022-04-15 06:43:41,834 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-15 06:43:41,835 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 80 transitions. [2022-04-15 06:43:41,835 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 28 states and 80 transitions. [2022-04-15 06:43:41,899 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-15 06:43:41,900 INFO L225 Difference]: With dead ends: 186 [2022-04-15 06:43:41,900 INFO L226 Difference]: Without dead ends: 121 [2022-04-15 06:43:41,901 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 152 GetRequests, 57 SyntacticMatches, 2 SemanticMatches, 93 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2172 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=2365, Invalid=6565, Unknown=0, NotChecked=0, Total=8930 [2022-04-15 06:43:41,901 INFO L913 BasicCegarLoop]: 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-15 06:43:41,901 INFO L914 BasicCegarLoop]: 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-15 06:43:41,902 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121 states. [2022-04-15 06:43:42,122 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121 to 121. [2022-04-15 06:43:42,122 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 06:43:42,123 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-15 06:43:42,123 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-15 06:43:42,123 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-15 06:43:42,124 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:43:42,124 INFO L93 Difference]: Finished difference Result 121 states and 125 transitions. [2022-04-15 06:43:42,124 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states and 125 transitions. [2022-04-15 06:43:42,125 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 06:43:42,125 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 06:43:42,125 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-15 06:43:42,125 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-15 06:43:42,126 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:43:42,126 INFO L93 Difference]: Finished difference Result 121 states and 125 transitions. [2022-04-15 06:43:42,126 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states and 125 transitions. [2022-04-15 06:43:42,126 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 06:43:42,127 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 06:43:42,127 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 06:43:42,127 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 06:43:42,127 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-15 06:43:42,128 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 121 states to 121 states and 125 transitions. [2022-04-15 06:43:42,128 INFO L78 Accepts]: Start accepts. Automaton has 121 states and 125 transitions. Word has length 72 [2022-04-15 06:43:42,128 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 06:43:42,128 INFO L478 AbstractCegarLoop]: Abstraction has 121 states and 125 transitions. [2022-04-15 06:43:42,128 INFO L479 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-15 06:43:42,128 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 121 states and 125 transitions. [2022-04-15 06:43:42,280 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-15 06:43:42,281 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states and 125 transitions. [2022-04-15 06:43:42,281 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2022-04-15 06:43:42,281 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 06:43:42,281 INFO L499 BasicCegarLoop]: trace histogram [25, 24, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 06:43:42,301 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-15 06:43:42,481 WARN L460 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-15 06:43:42,482 INFO L403 AbstractCegarLoop]: === Iteration 21 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 06:43:42,482 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 06:43:42,482 INFO L85 PathProgramCache]: Analyzing trace with hash 1189029746, now seen corresponding path program 18 times [2022-04-15 06:43:42,482 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 06:43:42,482 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1044340064] [2022-04-15 06:43:42,574 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-15 06:43:42,816 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-15 06:43:42,818 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-15 06:43:42,820 INFO L85 PathProgramCache]: Analyzing trace with hash 1163536577, now seen corresponding path program 1 times [2022-04-15 06:43:42,820 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 06:43:42,820 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1464948194] [2022-04-15 06:43:42,821 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 06:43:42,821 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 06:43:42,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:43:43,065 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 06:43:43,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:43:43,069 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-15 06:43:43,069 INFO L290 TraceCheckUtils]: 1: Hoare triple {12194#true} assume true; {12194#true} is VALID [2022-04-15 06:43:43,069 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {12194#true} {12194#true} #52#return; {12194#true} is VALID [2022-04-15 06:43:43,069 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-15 06:43:43,069 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-15 06:43:43,069 INFO L290 TraceCheckUtils]: 2: Hoare triple {12194#true} assume true; {12194#true} is VALID [2022-04-15 06:43:43,069 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {12194#true} {12194#true} #52#return; {12194#true} is VALID [2022-04-15 06:43:43,069 INFO L272 TraceCheckUtils]: 4: Hoare triple {12194#true} call #t~ret9 := main(); {12194#true} is VALID [2022-04-15 06:43:43,070 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-15 06:43:43,070 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-15 06:43:43,071 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-15 06:43:43,072 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-15 06:43:43,072 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-15 06:43:43,072 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-15 06:43:43,073 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-15 06:43:43,073 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-15 06:43:43,074 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-15 06:43:43,074 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-15 06:43:43,075 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-15 06:43:43,075 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-15 06:43:43,076 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-15 06:43:43,076 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-15 06:43:43,077 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-15 06:43:43,077 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-15 06:43:43,077 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-15 06:43:43,078 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-15 06:43:43,078 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-15 06:43:43,078 INFO L290 TraceCheckUtils]: 24: Hoare triple {12195#false} ~cond := #in~cond; {12195#false} is VALID [2022-04-15 06:43:43,078 INFO L290 TraceCheckUtils]: 25: Hoare triple {12195#false} assume 0 == ~cond; {12195#false} is VALID [2022-04-15 06:43:43,078 INFO L290 TraceCheckUtils]: 26: Hoare triple {12195#false} assume !false; {12195#false} is VALID [2022-04-15 06:43:43,078 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-15 06:43:43,078 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 06:43:43,079 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1464948194] [2022-04-15 06:43:43,079 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1464948194] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 06:43:43,079 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1949054635] [2022-04-15 06:43:43,079 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 06:43:43,079 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 06:43:43,079 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 06:43:43,080 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-15 06:43:43,080 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-15 06:43:43,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:43:43,111 INFO L263 TraceCheckSpWp]: Trace formula consists of 119 conjuncts, 16 conjunts are in the unsatisfiable core [2022-04-15 06:43:43,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:43:43,123 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 06:43:43,585 INFO L272 TraceCheckUtils]: 0: Hoare triple {12194#true} call ULTIMATE.init(); {12194#true} is VALID [2022-04-15 06:43:43,586 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-15 06:43:43,586 INFO L290 TraceCheckUtils]: 2: Hoare triple {12194#true} assume true; {12194#true} is VALID [2022-04-15 06:43:43,586 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {12194#true} {12194#true} #52#return; {12194#true} is VALID [2022-04-15 06:43:43,586 INFO L272 TraceCheckUtils]: 4: Hoare triple {12194#true} call #t~ret9 := main(); {12194#true} is VALID [2022-04-15 06:43:43,586 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-15 06:43:43,587 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-15 06:43:43,587 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-15 06:43:43,588 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-15 06:43:43,588 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-15 06:43:43,589 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-15 06:43:43,589 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-15 06:43:43,589 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-15 06:43:43,590 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-15 06:43:43,590 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-15 06:43:43,591 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-15 06:43:43,591 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-15 06:43:43,592 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-15 06:43:43,592 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-15 06:43:43,593 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-15 06:43:43,593 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-15 06:43:43,594 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-15 06:43:43,594 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-15 06:43:43,594 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-15 06:43:43,594 INFO L290 TraceCheckUtils]: 24: Hoare triple {12195#false} ~cond := #in~cond; {12195#false} is VALID [2022-04-15 06:43:43,594 INFO L290 TraceCheckUtils]: 25: Hoare triple {12195#false} assume 0 == ~cond; {12195#false} is VALID [2022-04-15 06:43:43,594 INFO L290 TraceCheckUtils]: 26: Hoare triple {12195#false} assume !false; {12195#false} is VALID [2022-04-15 06:43:43,595 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-15 06:43:43,595 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 06:43:44,145 INFO L290 TraceCheckUtils]: 26: Hoare triple {12195#false} assume !false; {12195#false} is VALID [2022-04-15 06:43:44,145 INFO L290 TraceCheckUtils]: 25: Hoare triple {12195#false} assume 0 == ~cond; {12195#false} is VALID [2022-04-15 06:43:44,145 INFO L290 TraceCheckUtils]: 24: Hoare triple {12195#false} ~cond := #in~cond; {12195#false} is VALID [2022-04-15 06:43:44,145 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-15 06:43:44,146 INFO L290 TraceCheckUtils]: 22: Hoare triple {12322#(< main_~z~0 main_~y~0)} assume !(~y~0 > ~z~0); {12195#false} is VALID [2022-04-15 06:43:44,146 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-15 06:43:44,147 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-15 06:43:44,147 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-15 06:43:44,148 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-15 06:43:44,148 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-15 06:43:44,149 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-15 06:43:44,149 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-15 06:43:44,150 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-15 06:43:44,150 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-15 06:43:44,151 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-15 06:43:44,151 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-15 06:43:44,151 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-15 06:43:44,152 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-15 06:43:44,153 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-15 06:43:44,153 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-15 06:43:44,153 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-15 06:43:44,154 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-15 06:43:44,154 INFO L272 TraceCheckUtils]: 4: Hoare triple {12194#true} call #t~ret9 := main(); {12194#true} is VALID [2022-04-15 06:43:44,154 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {12194#true} {12194#true} #52#return; {12194#true} is VALID [2022-04-15 06:43:44,154 INFO L290 TraceCheckUtils]: 2: Hoare triple {12194#true} assume true; {12194#true} is VALID [2022-04-15 06:43:44,154 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-15 06:43:44,154 INFO L272 TraceCheckUtils]: 0: Hoare triple {12194#true} call ULTIMATE.init(); {12194#true} is VALID [2022-04-15 06:43:44,154 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-15 06:43:44,154 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1949054635] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 06:43:44,155 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 06:43:44,155 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 15, 15] total 45 [2022-04-15 06:43:44,969 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 06:43:44,969 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1044340064] [2022-04-15 06:43:44,969 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1044340064] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 06:43:44,969 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 06:43:44,969 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [42] imperfect sequences [] total 42 [2022-04-15 06:43:44,969 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1487049546] [2022-04-15 06:43:44,969 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 06:43:44,970 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-15 06:43:44,970 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 06:43:44,970 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-15 06:43:45,019 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-15 06:43:45,019 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 42 states [2022-04-15 06:43:45,019 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 06:43:45,020 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2022-04-15 06:43:45,020 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1960, Invalid=3010, Unknown=0, NotChecked=0, Total=4970 [2022-04-15 06:43:45,020 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-15 06:43:48,454 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:43:48,454 INFO L93 Difference]: Finished difference Result 189 states and 199 transitions. [2022-04-15 06:43:48,454 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2022-04-15 06:43:48,454 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-15 06:43:48,455 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 06:43:48,455 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-15 06:43:48,455 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 95 transitions. [2022-04-15 06:43:48,456 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-15 06:43:48,456 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 95 transitions. [2022-04-15 06:43:48,456 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 42 states and 95 transitions. [2022-04-15 06:43:48,533 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-15 06:43:48,535 INFO L225 Difference]: With dead ends: 189 [2022-04-15 06:43:48,535 INFO L226 Difference]: Without dead ends: 124 [2022-04-15 06:43:48,537 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 168 GetRequests, 58 SyntacticMatches, 2 SemanticMatches, 108 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3464 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=3947, Invalid=8043, Unknown=0, NotChecked=0, Total=11990 [2022-04-15 06:43:48,537 INFO L913 BasicCegarLoop]: 13 mSDtfsCounter, 149 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 1413 mSolverCounterSat, 161 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s 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.2s IncrementalHoareTripleChecker+Time [2022-04-15 06:43:48,537 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [149 Valid, 35 Invalid, 1574 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [161 Valid, 1413 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2022-04-15 06:43:48,537 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 124 states. [2022-04-15 06:43:48,780 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 124 to 124. [2022-04-15 06:43:48,781 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 06:43:48,781 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-15 06:43:48,781 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-15 06:43:48,781 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-15 06:43:48,782 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:43:48,782 INFO L93 Difference]: Finished difference Result 124 states and 128 transitions. [2022-04-15 06:43:48,782 INFO L276 IsEmpty]: Start isEmpty. Operand 124 states and 128 transitions. [2022-04-15 06:43:48,783 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 06:43:48,783 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 06:43:48,783 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-15 06:43:48,783 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-15 06:43:48,784 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:43:48,784 INFO L93 Difference]: Finished difference Result 124 states and 128 transitions. [2022-04-15 06:43:48,784 INFO L276 IsEmpty]: Start isEmpty. Operand 124 states and 128 transitions. [2022-04-15 06:43:48,785 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 06:43:48,785 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 06:43:48,785 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 06:43:48,785 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 06:43:48,785 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-15 06:43:48,786 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 124 states to 124 states and 128 transitions. [2022-04-15 06:43:48,786 INFO L78 Accepts]: Start accepts. Automaton has 124 states and 128 transitions. Word has length 74 [2022-04-15 06:43:48,786 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 06:43:48,786 INFO L478 AbstractCegarLoop]: Abstraction has 124 states and 128 transitions. [2022-04-15 06:43:48,786 INFO L479 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-15 06:43:48,786 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 124 states and 128 transitions. [2022-04-15 06:43:48,910 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-15 06:43:48,911 INFO L276 IsEmpty]: Start isEmpty. Operand 124 states and 128 transitions. [2022-04-15 06:43:48,911 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2022-04-15 06:43:48,911 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 06:43:48,911 INFO L499 BasicCegarLoop]: trace histogram [26, 25, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 06:43:48,950 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-15 06:43:49,111 WARN L460 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-15 06:43:49,112 INFO L403 AbstractCegarLoop]: === Iteration 22 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 06:43:49,112 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 06:43:49,112 INFO L85 PathProgramCache]: Analyzing trace with hash -1677112436, now seen corresponding path program 19 times [2022-04-15 06:43:49,112 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 06:43:49,112 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [806303800] [2022-04-15 06:43:49,221 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-15 06:43:49,424 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-15 06:43:49,425 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-15 06:43:49,427 INFO L85 PathProgramCache]: Analyzing trace with hash -1984638014, now seen corresponding path program 1 times [2022-04-15 06:43:49,427 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 06:43:49,427 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [41256761] [2022-04-15 06:43:49,427 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 06:43:49,428 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 06:43:49,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:43:49,662 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 06:43:49,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:43:49,665 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-15 06:43:49,665 INFO L290 TraceCheckUtils]: 1: Hoare triple {13381#true} assume true; {13381#true} is VALID [2022-04-15 06:43:49,665 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {13381#true} {13381#true} #52#return; {13381#true} is VALID [2022-04-15 06:43:49,665 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-15 06:43:49,665 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-15 06:43:49,665 INFO L290 TraceCheckUtils]: 2: Hoare triple {13381#true} assume true; {13381#true} is VALID [2022-04-15 06:43:49,666 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {13381#true} {13381#true} #52#return; {13381#true} is VALID [2022-04-15 06:43:49,666 INFO L272 TraceCheckUtils]: 4: Hoare triple {13381#true} call #t~ret9 := main(); {13381#true} is VALID [2022-04-15 06:43:49,666 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-15 06:43:49,667 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-15 06:43:49,667 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-15 06:43:49,668 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-15 06:43:49,668 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-15 06:43:49,669 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-15 06:43:49,669 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-15 06:43:49,670 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-15 06:43:49,670 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-15 06:43:49,670 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-15 06:43:49,671 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-15 06:43:49,671 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-15 06:43:49,672 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-15 06:43:49,672 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-15 06:43:49,673 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-15 06:43:49,673 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-15 06:43:49,674 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-15 06:43:49,674 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-15 06:43:49,674 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-15 06:43:49,675 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-15 06:43:49,675 INFO L290 TraceCheckUtils]: 25: Hoare triple {13382#false} ~cond := #in~cond; {13382#false} is VALID [2022-04-15 06:43:49,675 INFO L290 TraceCheckUtils]: 26: Hoare triple {13382#false} assume 0 == ~cond; {13382#false} is VALID [2022-04-15 06:43:49,675 INFO L290 TraceCheckUtils]: 27: Hoare triple {13382#false} assume !false; {13382#false} is VALID [2022-04-15 06:43:49,675 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-15 06:43:49,675 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 06:43:49,675 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [41256761] [2022-04-15 06:43:49,675 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [41256761] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 06:43:49,675 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [256274308] [2022-04-15 06:43:49,675 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 06:43:49,675 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 06:43:49,676 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 06:43:49,676 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-15 06:43:49,688 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-15 06:43:49,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:43:49,720 INFO L263 TraceCheckSpWp]: Trace formula consists of 124 conjuncts, 17 conjunts are in the unsatisfiable core [2022-04-15 06:43:49,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:43:49,733 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 06:43:50,250 INFO L272 TraceCheckUtils]: 0: Hoare triple {13381#true} call ULTIMATE.init(); {13381#true} is VALID [2022-04-15 06:43:50,250 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-15 06:43:50,250 INFO L290 TraceCheckUtils]: 2: Hoare triple {13381#true} assume true; {13381#true} is VALID [2022-04-15 06:43:50,250 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {13381#true} {13381#true} #52#return; {13381#true} is VALID [2022-04-15 06:43:50,250 INFO L272 TraceCheckUtils]: 4: Hoare triple {13381#true} call #t~ret9 := main(); {13381#true} is VALID [2022-04-15 06:43:50,250 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-15 06:43:50,251 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-15 06:43:50,251 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-15 06:43:50,261 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-15 06:43:50,261 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-15 06:43:50,262 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-15 06:43:50,262 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-15 06:43:50,263 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-15 06:43:50,263 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-15 06:43:50,264 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-15 06:43:50,264 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-15 06:43:50,264 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-15 06:43:50,265 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-15 06:43:50,265 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-15 06:43:50,266 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-15 06:43:50,266 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-15 06:43:50,267 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-15 06:43:50,267 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-15 06:43:50,268 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-15 06:43:50,268 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-15 06:43:50,268 INFO L290 TraceCheckUtils]: 25: Hoare triple {13382#false} ~cond := #in~cond; {13382#false} is VALID [2022-04-15 06:43:50,268 INFO L290 TraceCheckUtils]: 26: Hoare triple {13382#false} assume 0 == ~cond; {13382#false} is VALID [2022-04-15 06:43:50,268 INFO L290 TraceCheckUtils]: 27: Hoare triple {13382#false} assume !false; {13382#false} is VALID [2022-04-15 06:43:50,268 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-15 06:43:50,268 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 06:43:50,892 INFO L290 TraceCheckUtils]: 27: Hoare triple {13382#false} assume !false; {13382#false} is VALID [2022-04-15 06:43:50,892 INFO L290 TraceCheckUtils]: 26: Hoare triple {13382#false} assume 0 == ~cond; {13382#false} is VALID [2022-04-15 06:43:50,892 INFO L290 TraceCheckUtils]: 25: Hoare triple {13382#false} ~cond := #in~cond; {13382#false} is VALID [2022-04-15 06:43:50,892 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-15 06:43:50,892 INFO L290 TraceCheckUtils]: 23: Hoare triple {13514#(< main_~z~0 main_~y~0)} assume !(~y~0 > ~z~0); {13382#false} is VALID [2022-04-15 06:43:50,893 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-15 06:43:50,893 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-15 06:43:50,894 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-15 06:43:50,894 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-15 06:43:50,895 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-15 06:43:50,895 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-15 06:43:50,896 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-15 06:43:50,896 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-15 06:43:50,897 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-15 06:43:50,897 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-15 06:43:50,899 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-15 06:43:50,899 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-15 06:43:50,900 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-15 06:43:50,900 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-15 06:43:50,901 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-15 06:43:50,902 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-15 06:43:50,902 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-15 06:43:50,902 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-15 06:43:50,902 INFO L272 TraceCheckUtils]: 4: Hoare triple {13381#true} call #t~ret9 := main(); {13381#true} is VALID [2022-04-15 06:43:50,902 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {13381#true} {13381#true} #52#return; {13381#true} is VALID [2022-04-15 06:43:50,903 INFO L290 TraceCheckUtils]: 2: Hoare triple {13381#true} assume true; {13381#true} is VALID [2022-04-15 06:43:50,903 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-15 06:43:50,903 INFO L272 TraceCheckUtils]: 0: Hoare triple {13381#true} call ULTIMATE.init(); {13381#true} is VALID [2022-04-15 06:43:50,903 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-15 06:43:50,903 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [256274308] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 06:43:50,903 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 06:43:50,903 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 16, 16] total 48 [2022-04-15 06:43:51,765 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 06:43:51,765 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [806303800] [2022-04-15 06:43:51,765 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [806303800] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 06:43:51,765 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 06:43:51,765 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [44] imperfect sequences [] total 44 [2022-04-15 06:43:51,765 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1561836842] [2022-04-15 06:43:51,765 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 06:43:51,766 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-15 06:43:51,766 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 06:43:51,766 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-15 06:43:51,818 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-15 06:43:51,818 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 44 states [2022-04-15 06:43:51,818 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 06:43:51,818 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2022-04-15 06:43:51,819 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=2179, Invalid=3371, Unknown=0, NotChecked=0, Total=5550 [2022-04-15 06:43:51,819 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-15 06:43:55,197 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:43:55,197 INFO L93 Difference]: Finished difference Result 193 states and 203 transitions. [2022-04-15 06:43:55,197 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2022-04-15 06:43:55,197 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-15 06:43:55,198 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 06:43:55,198 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-15 06:43:55,199 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 98 transitions. [2022-04-15 06:43:55,199 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-15 06:43:55,199 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 98 transitions. [2022-04-15 06:43:55,199 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 44 states and 98 transitions. [2022-04-15 06:43:55,288 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-15 06:43:55,289 INFO L225 Difference]: With dead ends: 193 [2022-04-15 06:43:55,289 INFO L226 Difference]: Without dead ends: 127 [2022-04-15 06:43:55,290 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 175 GetRequests, 59 SyntacticMatches, 2 SemanticMatches, 114 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3852 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=4379, Invalid=8961, Unknown=0, NotChecked=0, Total=13340 [2022-04-15 06:43:55,291 INFO L913 BasicCegarLoop]: 13 mSDtfsCounter, 149 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 1523 mSolverCounterSat, 159 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s 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.2s IncrementalHoareTripleChecker+Time [2022-04-15 06:43:55,291 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [149 Valid, 35 Invalid, 1682 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [159 Valid, 1523 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2022-04-15 06:43:55,291 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 127 states. [2022-04-15 06:43:55,520 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 127 to 127. [2022-04-15 06:43:55,520 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 06:43:55,521 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-15 06:43:55,521 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-15 06:43:55,521 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-15 06:43:55,522 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:43:55,522 INFO L93 Difference]: Finished difference Result 127 states and 131 transitions. [2022-04-15 06:43:55,523 INFO L276 IsEmpty]: Start isEmpty. Operand 127 states and 131 transitions. [2022-04-15 06:43:55,523 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 06:43:55,523 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 06:43:55,523 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-15 06:43:55,523 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-15 06:43:55,529 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:43:55,530 INFO L93 Difference]: Finished difference Result 127 states and 131 transitions. [2022-04-15 06:43:55,530 INFO L276 IsEmpty]: Start isEmpty. Operand 127 states and 131 transitions. [2022-04-15 06:43:55,530 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 06:43:55,530 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 06:43:55,530 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 06:43:55,530 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 06:43:55,530 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-15 06:43:55,531 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 127 states to 127 states and 131 transitions. [2022-04-15 06:43:55,531 INFO L78 Accepts]: Start accepts. Automaton has 127 states and 131 transitions. Word has length 77 [2022-04-15 06:43:55,531 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 06:43:55,532 INFO L478 AbstractCegarLoop]: Abstraction has 127 states and 131 transitions. [2022-04-15 06:43:55,532 INFO L479 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-15 06:43:55,532 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 127 states and 131 transitions. [2022-04-15 06:43:55,654 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-15 06:43:55,654 INFO L276 IsEmpty]: Start isEmpty. Operand 127 states and 131 transitions. [2022-04-15 06:43:55,655 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2022-04-15 06:43:55,655 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 06:43:55,655 INFO L499 BasicCegarLoop]: trace histogram [27, 26, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 06:43:55,672 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-15 06:43:55,868 WARN L460 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-15 06:43:55,868 INFO L403 AbstractCegarLoop]: === Iteration 23 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 06:43:55,868 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 06:43:55,868 INFO L85 PathProgramCache]: Analyzing trace with hash -1712396772, now seen corresponding path program 20 times [2022-04-15 06:43:55,868 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 06:43:55,868 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [79898310] [2022-04-15 06:43:59,938 WARN L977 rdanLoopAcceleration]: Unable to prove correctness of quantifier elimination. [2022-04-15 06:43:59,986 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-15 06:44:04,109 WARN L977 rdanLoopAcceleration]: Unable to prove correctness of quantifier elimination. [2022-04-15 06:44:04,223 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-15 06:44:04,224 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-15 06:44:04,226 INFO L85 PathProgramCache]: Analyzing trace with hash -1026791711, now seen corresponding path program 1 times [2022-04-15 06:44:04,226 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 06:44:04,227 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [98461974] [2022-04-15 06:44:04,227 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 06:44:04,227 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 06:44:04,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:44:04,514 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 06:44:04,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:44:04,517 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-15 06:44:04,518 INFO L290 TraceCheckUtils]: 1: Hoare triple {14602#true} assume true; {14602#true} is VALID [2022-04-15 06:44:04,518 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {14602#true} {14602#true} #52#return; {14602#true} is VALID [2022-04-15 06:44:04,518 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-15 06:44:04,518 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-15 06:44:04,518 INFO L290 TraceCheckUtils]: 2: Hoare triple {14602#true} assume true; {14602#true} is VALID [2022-04-15 06:44:04,518 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {14602#true} {14602#true} #52#return; {14602#true} is VALID [2022-04-15 06:44:04,518 INFO L272 TraceCheckUtils]: 4: Hoare triple {14602#true} call #t~ret9 := main(); {14602#true} is VALID [2022-04-15 06:44:04,519 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-15 06:44:04,520 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-15 06:44:04,520 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-15 06:44:04,521 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-15 06:44:04,521 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-15 06:44:04,522 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-15 06:44:04,522 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-15 06:44:04,523 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-15 06:44:04,523 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-15 06:44:04,524 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-15 06:44:04,525 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-15 06:44:04,525 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-15 06:44:04,526 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-15 06:44:04,526 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-15 06:44:04,527 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-15 06:44:04,527 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-15 06:44:04,528 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-15 06:44:04,528 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-15 06:44:04,529 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-15 06:44:04,529 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-15 06:44:04,529 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-15 06:44:04,529 INFO L290 TraceCheckUtils]: 26: Hoare triple {14603#false} ~cond := #in~cond; {14603#false} is VALID [2022-04-15 06:44:04,530 INFO L290 TraceCheckUtils]: 27: Hoare triple {14603#false} assume 0 == ~cond; {14603#false} is VALID [2022-04-15 06:44:04,530 INFO L290 TraceCheckUtils]: 28: Hoare triple {14603#false} assume !false; {14603#false} is VALID [2022-04-15 06:44:04,530 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-15 06:44:04,530 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 06:44:04,530 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [98461974] [2022-04-15 06:44:04,530 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [98461974] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 06:44:04,530 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2085356192] [2022-04-15 06:44:04,530 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 06:44:04,530 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 06:44:04,530 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 06:44:04,531 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-15 06:44:04,532 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-15 06:44:04,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:44:04,568 INFO L263 TraceCheckSpWp]: Trace formula consists of 129 conjuncts, 18 conjunts are in the unsatisfiable core [2022-04-15 06:44:04,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:44:04,581 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 06:44:05,191 INFO L272 TraceCheckUtils]: 0: Hoare triple {14602#true} call ULTIMATE.init(); {14602#true} is VALID [2022-04-15 06:44:05,191 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-15 06:44:05,191 INFO L290 TraceCheckUtils]: 2: Hoare triple {14602#true} assume true; {14602#true} is VALID [2022-04-15 06:44:05,191 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {14602#true} {14602#true} #52#return; {14602#true} is VALID [2022-04-15 06:44:05,191 INFO L272 TraceCheckUtils]: 4: Hoare triple {14602#true} call #t~ret9 := main(); {14602#true} is VALID [2022-04-15 06:44:05,192 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-15 06:44:05,192 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-15 06:44:05,192 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-15 06:44:05,193 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-15 06:44:05,194 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-15 06:44:05,194 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-15 06:44:05,195 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-15 06:44:05,195 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-15 06:44:05,196 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-15 06:44:05,196 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-15 06:44:05,197 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-15 06:44:05,198 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-15 06:44:05,198 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-15 06:44:05,199 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-15 06:44:05,199 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-15 06:44:05,200 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-15 06:44:05,200 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-15 06:44:05,201 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-15 06:44:05,201 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-15 06:44:05,202 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-15 06:44:05,202 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-15 06:44:05,202 INFO L290 TraceCheckUtils]: 26: Hoare triple {14603#false} ~cond := #in~cond; {14603#false} is VALID [2022-04-15 06:44:05,202 INFO L290 TraceCheckUtils]: 27: Hoare triple {14603#false} assume 0 == ~cond; {14603#false} is VALID [2022-04-15 06:44:05,202 INFO L290 TraceCheckUtils]: 28: Hoare triple {14603#false} assume !false; {14603#false} is VALID [2022-04-15 06:44:05,202 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-15 06:44:05,202 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 06:44:05,922 INFO L290 TraceCheckUtils]: 28: Hoare triple {14603#false} assume !false; {14603#false} is VALID [2022-04-15 06:44:05,923 INFO L290 TraceCheckUtils]: 27: Hoare triple {14603#false} assume 0 == ~cond; {14603#false} is VALID [2022-04-15 06:44:05,923 INFO L290 TraceCheckUtils]: 26: Hoare triple {14603#false} ~cond := #in~cond; {14603#false} is VALID [2022-04-15 06:44:05,923 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-15 06:44:05,923 INFO L290 TraceCheckUtils]: 24: Hoare triple {14740#(< main_~z~0 main_~y~0)} assume !(~y~0 > ~z~0); {14603#false} is VALID [2022-04-15 06:44:05,924 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-15 06:44:05,925 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-15 06:44:05,925 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-15 06:44:05,926 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-15 06:44:05,926 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-15 06:44:05,927 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-15 06:44:05,927 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-15 06:44:05,928 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-15 06:44:05,928 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-15 06:44:05,929 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-15 06:44:05,929 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-15 06:44:05,930 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-15 06:44:05,930 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-15 06:44:05,931 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-15 06:44:05,931 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-15 06:44:05,932 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-15 06:44:05,932 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-15 06:44:05,933 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-15 06:44:05,933 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-15 06:44:05,933 INFO L272 TraceCheckUtils]: 4: Hoare triple {14602#true} call #t~ret9 := main(); {14602#true} is VALID [2022-04-15 06:44:05,933 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {14602#true} {14602#true} #52#return; {14602#true} is VALID [2022-04-15 06:44:05,933 INFO L290 TraceCheckUtils]: 2: Hoare triple {14602#true} assume true; {14602#true} is VALID [2022-04-15 06:44:05,934 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-15 06:44:05,934 INFO L272 TraceCheckUtils]: 0: Hoare triple {14602#true} call ULTIMATE.init(); {14602#true} is VALID [2022-04-15 06:44:05,934 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-15 06:44:05,934 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2085356192] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 06:44:05,934 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 06:44:05,934 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 17, 17] total 51 [2022-04-15 06:44:06,944 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 06:44:06,944 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [79898310] [2022-04-15 06:44:06,944 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [79898310] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 06:44:06,944 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 06:44:06,945 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [46] imperfect sequences [] total 46 [2022-04-15 06:44:06,945 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1007790673] [2022-04-15 06:44:06,945 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 06:44:06,945 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-15 06:44:06,945 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 06:44:06,946 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-15 06:44:07,008 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-15 06:44:07,008 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 46 states [2022-04-15 06:44:07,008 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 06:44:07,009 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2022-04-15 06:44:07,009 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=2436, Invalid=3726, Unknown=0, NotChecked=0, Total=6162 [2022-04-15 06:44:07,009 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-15 06:44:10,798 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:44:10,798 INFO L93 Difference]: Finished difference Result 197 states and 207 transitions. [2022-04-15 06:44:10,798 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2022-04-15 06:44:10,798 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-15 06:44:10,798 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 06:44:10,798 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-15 06:44:10,800 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 101 transitions. [2022-04-15 06:44:10,800 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-15 06:44:10,801 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 101 transitions. [2022-04-15 06:44:10,801 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 46 states and 101 transitions. [2022-04-15 06:44:10,890 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-15 06:44:10,891 INFO L225 Difference]: With dead ends: 197 [2022-04-15 06:44:10,892 INFO L226 Difference]: Without dead ends: 130 [2022-04-15 06:44:10,892 INFO L912 BasicCegarLoop]: 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-15 06:44:10,893 INFO L913 BasicCegarLoop]: 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-15 06:44:10,893 INFO L914 BasicCegarLoop]: 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-15 06:44:10,893 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 130 states. [2022-04-15 06:44:11,140 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 130 to 130. [2022-04-15 06:44:11,140 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 06:44:11,140 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-15 06:44:11,140 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-15 06:44:11,140 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-15 06:44:11,142 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:44:11,142 INFO L93 Difference]: Finished difference Result 130 states and 134 transitions. [2022-04-15 06:44:11,142 INFO L276 IsEmpty]: Start isEmpty. Operand 130 states and 134 transitions. [2022-04-15 06:44:11,142 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 06:44:11,142 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 06:44:11,142 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-15 06:44:11,142 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-15 06:44:11,144 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:44:11,144 INFO L93 Difference]: Finished difference Result 130 states and 134 transitions. [2022-04-15 06:44:11,144 INFO L276 IsEmpty]: Start isEmpty. Operand 130 states and 134 transitions. [2022-04-15 06:44:11,144 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 06:44:11,144 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 06:44:11,144 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 06:44:11,144 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 06:44:11,144 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-15 06:44:11,145 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 130 states to 130 states and 134 transitions. [2022-04-15 06:44:11,145 INFO L78 Accepts]: Start accepts. Automaton has 130 states and 134 transitions. Word has length 80 [2022-04-15 06:44:11,146 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 06:44:11,146 INFO L478 AbstractCegarLoop]: Abstraction has 130 states and 134 transitions. [2022-04-15 06:44:11,146 INFO L479 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-15 06:44:11,146 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 130 states and 134 transitions. [2022-04-15 06:44:11,260 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-15 06:44:11,261 INFO L276 IsEmpty]: Start isEmpty. Operand 130 states and 134 transitions. [2022-04-15 06:44:11,267 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2022-04-15 06:44:11,267 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 06:44:11,267 INFO L499 BasicCegarLoop]: trace histogram [28, 27, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 06:44:11,283 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-15 06:44:11,483 WARN L460 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-15 06:44:11,483 INFO L403 AbstractCegarLoop]: === Iteration 24 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 06:44:11,483 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 06:44:11,483 INFO L85 PathProgramCache]: Analyzing trace with hash -300699166, now seen corresponding path program 21 times [2022-04-15 06:44:11,483 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 06:44:11,484 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [444397504] [2022-04-15 06:44:11,568 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-15 06:44:11,827 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-15 06:44:11,828 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-15 06:44:11,830 INFO L85 PathProgramCache]: Analyzing trace with hash -31057502, now seen corresponding path program 1 times [2022-04-15 06:44:11,830 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 06:44:11,830 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [617563026] [2022-04-15 06:44:11,830 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 06:44:11,830 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 06:44:11,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:44:12,066 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 06:44:12,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:44:12,080 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-15 06:44:12,080 INFO L290 TraceCheckUtils]: 1: Hoare triple {15857#true} assume true; {15857#true} is VALID [2022-04-15 06:44:12,080 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {15857#true} {15857#true} #52#return; {15857#true} is VALID [2022-04-15 06:44:12,080 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-15 06:44:12,081 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-15 06:44:12,081 INFO L290 TraceCheckUtils]: 2: Hoare triple {15857#true} assume true; {15857#true} is VALID [2022-04-15 06:44:12,081 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {15857#true} {15857#true} #52#return; {15857#true} is VALID [2022-04-15 06:44:12,081 INFO L272 TraceCheckUtils]: 4: Hoare triple {15857#true} call #t~ret9 := main(); {15857#true} is VALID [2022-04-15 06:44:12,081 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-15 06:44:12,082 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-15 06:44:12,082 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-15 06:44:12,083 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-15 06:44:12,083 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-15 06:44:12,084 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-15 06:44:12,084 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-15 06:44:12,085 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-15 06:44:12,085 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-15 06:44:12,085 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-15 06:44:12,086 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-15 06:44:12,086 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-15 06:44:12,087 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-15 06:44:12,087 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-15 06:44:12,088 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-15 06:44:12,088 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-15 06:44:12,089 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-15 06:44:12,089 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-15 06:44:12,090 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-15 06:44:12,090 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-15 06:44:12,090 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-15 06:44:12,090 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-15 06:44:12,090 INFO L290 TraceCheckUtils]: 27: Hoare triple {15858#false} ~cond := #in~cond; {15858#false} is VALID [2022-04-15 06:44:12,091 INFO L290 TraceCheckUtils]: 28: Hoare triple {15858#false} assume 0 == ~cond; {15858#false} is VALID [2022-04-15 06:44:12,091 INFO L290 TraceCheckUtils]: 29: Hoare triple {15858#false} assume !false; {15858#false} is VALID [2022-04-15 06:44:12,091 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-15 06:44:12,091 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 06:44:12,091 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [617563026] [2022-04-15 06:44:12,091 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [617563026] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 06:44:12,091 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [578301897] [2022-04-15 06:44:12,091 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 06:44:12,091 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 06:44:12,092 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 06:44:12,092 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-15 06:44:12,093 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-15 06:44:12,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:44:12,131 INFO L263 TraceCheckSpWp]: Trace formula consists of 134 conjuncts, 19 conjunts are in the unsatisfiable core [2022-04-15 06:44:12,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:44:12,144 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 06:44:12,675 INFO L272 TraceCheckUtils]: 0: Hoare triple {15857#true} call ULTIMATE.init(); {15857#true} is VALID [2022-04-15 06:44:12,675 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-15 06:44:12,675 INFO L290 TraceCheckUtils]: 2: Hoare triple {15857#true} assume true; {15857#true} is VALID [2022-04-15 06:44:12,676 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {15857#true} {15857#true} #52#return; {15857#true} is VALID [2022-04-15 06:44:12,676 INFO L272 TraceCheckUtils]: 4: Hoare triple {15857#true} call #t~ret9 := main(); {15857#true} is VALID [2022-04-15 06:44:12,676 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-15 06:44:12,676 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-15 06:44:12,677 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-15 06:44:12,678 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-15 06:44:12,678 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-15 06:44:12,678 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-15 06:44:12,679 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-15 06:44:12,679 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-15 06:44:12,680 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-15 06:44:12,680 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-15 06:44:12,681 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-15 06:44:12,681 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-15 06:44:12,682 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-15 06:44:12,682 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-15 06:44:12,683 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-15 06:44:12,683 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-15 06:44:12,684 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-15 06:44:12,684 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-15 06:44:12,685 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-15 06:44:12,685 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-15 06:44:12,685 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-15 06:44:12,685 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-15 06:44:12,686 INFO L290 TraceCheckUtils]: 27: Hoare triple {15858#false} ~cond := #in~cond; {15858#false} is VALID [2022-04-15 06:44:12,686 INFO L290 TraceCheckUtils]: 28: Hoare triple {15858#false} assume 0 == ~cond; {15858#false} is VALID [2022-04-15 06:44:12,686 INFO L290 TraceCheckUtils]: 29: Hoare triple {15858#false} assume !false; {15858#false} is VALID [2022-04-15 06:44:12,686 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-15 06:44:12,686 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 06:44:13,369 INFO L290 TraceCheckUtils]: 29: Hoare triple {15858#false} assume !false; {15858#false} is VALID [2022-04-15 06:44:13,370 INFO L290 TraceCheckUtils]: 28: Hoare triple {15858#false} assume 0 == ~cond; {15858#false} is VALID [2022-04-15 06:44:13,370 INFO L290 TraceCheckUtils]: 27: Hoare triple {15858#false} ~cond := #in~cond; {15858#false} is VALID [2022-04-15 06:44:13,370 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-15 06:44:13,370 INFO L290 TraceCheckUtils]: 25: Hoare triple {15998#(< main_~z~0 main_~y~0)} assume !(~y~0 > ~z~0); {15858#false} is VALID [2022-04-15 06:44:13,371 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-15 06:44:13,371 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-15 06:44:13,371 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-15 06:44:13,372 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-15 06:44:13,372 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-15 06:44:13,373 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-15 06:44:13,373 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-15 06:44:13,374 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-15 06:44:13,374 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-15 06:44:13,375 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-15 06:44:13,375 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-15 06:44:13,375 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-15 06:44:13,376 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-15 06:44:13,376 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-15 06:44:13,377 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-15 06:44:13,377 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-15 06:44:13,378 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-15 06:44:13,378 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-15 06:44:13,379 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-15 06:44:13,379 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-15 06:44:13,379 INFO L272 TraceCheckUtils]: 4: Hoare triple {15857#true} call #t~ret9 := main(); {15857#true} is VALID [2022-04-15 06:44:13,379 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {15857#true} {15857#true} #52#return; {15857#true} is VALID [2022-04-15 06:44:13,379 INFO L290 TraceCheckUtils]: 2: Hoare triple {15857#true} assume true; {15857#true} is VALID [2022-04-15 06:44:13,379 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-15 06:44:13,379 INFO L272 TraceCheckUtils]: 0: Hoare triple {15857#true} call ULTIMATE.init(); {15857#true} is VALID [2022-04-15 06:44:13,380 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-15 06:44:13,380 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [578301897] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 06:44:13,380 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 06:44:13,380 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 18, 18] total 52 [2022-04-15 06:44:14,380 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 06:44:14,381 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [444397504] [2022-04-15 06:44:14,381 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [444397504] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 06:44:14,381 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 06:44:14,381 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [49] imperfect sequences [] total 49 [2022-04-15 06:44:14,381 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1675999056] [2022-04-15 06:44:14,381 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 06:44:14,381 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-15 06:44:14,382 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 06:44:14,382 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-15 06:44:14,446 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-15 06:44:14,446 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 49 states [2022-04-15 06:44:14,446 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 06:44:14,447 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 49 interpolants. [2022-04-15 06:44:14,447 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=2408, Invalid=4072, Unknown=0, NotChecked=0, Total=6480 [2022-04-15 06:44:14,448 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-15 06:44:18,749 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:44:18,750 INFO L93 Difference]: Finished difference Result 212 states and 233 transitions. [2022-04-15 06:44:18,750 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 49 states. [2022-04-15 06:44:18,750 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-15 06:44:18,750 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 06:44:18,750 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-15 06:44:18,751 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 115 transitions. [2022-04-15 06:44:18,751 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-15 06:44:18,752 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 115 transitions. [2022-04-15 06:44:18,752 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 49 states and 115 transitions. [2022-04-15 06:44:18,867 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-15 06:44:18,869 INFO L225 Difference]: With dead ends: 212 [2022-04-15 06:44:18,869 INFO L226 Difference]: Without dead ends: 144 [2022-04-15 06:44:18,870 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 188 GetRequests, 61 SyntacticMatches, 2 SemanticMatches, 125 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4993 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=5002, Invalid=11000, Unknown=0, NotChecked=0, Total=16002 [2022-04-15 06:44:18,870 INFO L913 BasicCegarLoop]: 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-15 06:44:18,870 INFO L914 BasicCegarLoop]: 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-15 06:44:18,871 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 144 states. [2022-04-15 06:44:19,037 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 144 to 90. [2022-04-15 06:44:19,037 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 06:44:19,037 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-15 06:44:19,037 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-15 06:44:19,037 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-15 06:44:19,039 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:44:19,039 INFO L93 Difference]: Finished difference Result 144 states and 148 transitions. [2022-04-15 06:44:19,039 INFO L276 IsEmpty]: Start isEmpty. Operand 144 states and 148 transitions. [2022-04-15 06:44:19,039 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 06:44:19,039 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 06:44:19,039 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-15 06:44:19,039 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-15 06:44:19,040 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:44:19,041 INFO L93 Difference]: Finished difference Result 144 states and 148 transitions. [2022-04-15 06:44:19,041 INFO L276 IsEmpty]: Start isEmpty. Operand 144 states and 148 transitions. [2022-04-15 06:44:19,041 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 06:44:19,041 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 06:44:19,041 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 06:44:19,041 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 06:44:19,041 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-15 06:44:19,042 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 93 transitions. [2022-04-15 06:44:19,042 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 93 transitions. Word has length 83 [2022-04-15 06:44:19,042 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 06:44:19,042 INFO L478 AbstractCegarLoop]: Abstraction has 90 states and 93 transitions. [2022-04-15 06:44:19,042 INFO L479 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-15 06:44:19,042 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 90 states and 93 transitions. [2022-04-15 06:44:19,128 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-15 06:44:19,128 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 93 transitions. [2022-04-15 06:44:19,129 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2022-04-15 06:44:19,129 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 06:44:19,129 INFO L499 BasicCegarLoop]: trace histogram [30, 29, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 06:44:19,147 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-15 06:44:19,335 WARN L460 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-15 06:44:19,335 INFO L403 AbstractCegarLoop]: === Iteration 25 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 06:44:19,335 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 06:44:19,335 INFO L85 PathProgramCache]: Analyzing trace with hash -945173960, now seen corresponding path program 22 times [2022-04-15 06:44:19,336 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 06:44:19,336 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1821002780] [2022-04-15 06:44:19,419 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-15 06:44:19,611 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-15 06:44:19,612 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-15 06:44:19,614 INFO L85 PathProgramCache]: Analyzing trace with hash -2118007166, now seen corresponding path program 1 times [2022-04-15 06:44:19,614 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 06:44:19,615 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2062634015] [2022-04-15 06:44:19,615 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 06:44:19,615 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 06:44:19,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:44:19,912 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 06:44:19,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:44:19,924 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-15 06:44:19,924 INFO L290 TraceCheckUtils]: 1: Hoare triple {17104#true} assume true; {17104#true} is VALID [2022-04-15 06:44:19,924 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {17104#true} {17104#true} #52#return; {17104#true} is VALID [2022-04-15 06:44:19,924 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-15 06:44:19,924 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-15 06:44:19,924 INFO L290 TraceCheckUtils]: 2: Hoare triple {17104#true} assume true; {17104#true} is VALID [2022-04-15 06:44:19,925 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {17104#true} {17104#true} #52#return; {17104#true} is VALID [2022-04-15 06:44:19,925 INFO L272 TraceCheckUtils]: 4: Hoare triple {17104#true} call #t~ret9 := main(); {17104#true} is VALID [2022-04-15 06:44:19,925 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-15 06:44:19,925 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-15 06:44:19,926 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-15 06:44:19,928 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-15 06:44:19,928 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-15 06:44:19,929 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-15 06:44:19,929 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-15 06:44:19,930 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-15 06:44:19,930 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-15 06:44:19,931 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-15 06:44:19,931 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-15 06:44:19,932 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-15 06:44:19,932 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-15 06:44:19,933 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-15 06:44:19,933 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-15 06:44:19,934 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-15 06:44:19,934 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-15 06:44:19,934 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-15 06:44:19,935 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-15 06:44:19,935 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-15 06:44:19,936 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-15 06:44:19,936 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-15 06:44:19,937 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-15 06:44:19,937 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-15 06:44:19,937 INFO L290 TraceCheckUtils]: 29: Hoare triple {17105#false} ~cond := #in~cond; {17105#false} is VALID [2022-04-15 06:44:19,937 INFO L290 TraceCheckUtils]: 30: Hoare triple {17105#false} assume 0 == ~cond; {17105#false} is VALID [2022-04-15 06:44:19,937 INFO L290 TraceCheckUtils]: 31: Hoare triple {17105#false} assume !false; {17105#false} is VALID [2022-04-15 06:44:19,937 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-15 06:44:19,937 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 06:44:19,937 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2062634015] [2022-04-15 06:44:19,937 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2062634015] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 06:44:19,938 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1154843226] [2022-04-15 06:44:19,938 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 06:44:19,938 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 06:44:19,938 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 06:44:19,939 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-15 06:44:19,939 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-15 06:44:19,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:44:19,974 INFO L263 TraceCheckSpWp]: Trace formula consists of 144 conjuncts, 21 conjunts are in the unsatisfiable core [2022-04-15 06:44:19,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:44:19,988 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 06:44:20,647 INFO L272 TraceCheckUtils]: 0: Hoare triple {17104#true} call ULTIMATE.init(); {17104#true} is VALID [2022-04-15 06:44:20,647 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-15 06:44:20,647 INFO L290 TraceCheckUtils]: 2: Hoare triple {17104#true} assume true; {17104#true} is VALID [2022-04-15 06:44:20,647 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {17104#true} {17104#true} #52#return; {17104#true} is VALID [2022-04-15 06:44:20,647 INFO L272 TraceCheckUtils]: 4: Hoare triple {17104#true} call #t~ret9 := main(); {17104#true} is VALID [2022-04-15 06:44:20,648 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-15 06:44:20,648 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-15 06:44:20,648 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-15 06:44:20,649 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-15 06:44:20,650 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-15 06:44:20,650 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-15 06:44:20,651 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-15 06:44:20,651 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-15 06:44:20,651 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-15 06:44:20,652 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-15 06:44:20,652 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-15 06:44:20,653 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-15 06:44:20,653 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-15 06:44:20,654 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-15 06:44:20,654 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-15 06:44:20,655 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-15 06:44:20,655 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-15 06:44:20,656 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-15 06:44:20,656 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-15 06:44:20,657 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-15 06:44:20,657 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-15 06:44:20,658 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-15 06:44:20,658 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-15 06:44:20,658 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-15 06:44:20,658 INFO L290 TraceCheckUtils]: 29: Hoare triple {17105#false} ~cond := #in~cond; {17105#false} is VALID [2022-04-15 06:44:20,658 INFO L290 TraceCheckUtils]: 30: Hoare triple {17105#false} assume 0 == ~cond; {17105#false} is VALID [2022-04-15 06:44:20,658 INFO L290 TraceCheckUtils]: 31: Hoare triple {17105#false} assume !false; {17105#false} is VALID [2022-04-15 06:44:20,658 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-15 06:44:20,659 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 06:44:21,476 INFO L290 TraceCheckUtils]: 31: Hoare triple {17105#false} assume !false; {17105#false} is VALID [2022-04-15 06:44:21,476 INFO L290 TraceCheckUtils]: 30: Hoare triple {17105#false} assume 0 == ~cond; {17105#false} is VALID [2022-04-15 06:44:21,476 INFO L290 TraceCheckUtils]: 29: Hoare triple {17105#false} ~cond := #in~cond; {17105#false} is VALID [2022-04-15 06:44:21,476 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-15 06:44:21,476 INFO L290 TraceCheckUtils]: 27: Hoare triple {17254#(< main_~z~0 main_~y~0)} assume !(~y~0 > ~z~0); {17105#false} is VALID [2022-04-15 06:44:21,477 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-15 06:44:21,477 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-15 06:44:21,478 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-15 06:44:21,478 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-15 06:44:21,479 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-15 06:44:21,479 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-15 06:44:21,480 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-15 06:44:21,480 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-15 06:44:21,480 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-15 06:44:21,481 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-15 06:44:21,481 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-15 06:44:21,482 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-15 06:44:21,482 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-15 06:44:21,483 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-15 06:44:21,483 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-15 06:44:21,484 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-15 06:44:21,484 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-15 06:44:21,484 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-15 06:44:21,485 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-15 06:44:21,485 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-15 06:44:21,486 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-15 06:44:21,486 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-15 06:44:21,486 INFO L272 TraceCheckUtils]: 4: Hoare triple {17104#true} call #t~ret9 := main(); {17104#true} is VALID [2022-04-15 06:44:21,486 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {17104#true} {17104#true} #52#return; {17104#true} is VALID [2022-04-15 06:44:21,486 INFO L290 TraceCheckUtils]: 2: Hoare triple {17104#true} assume true; {17104#true} is VALID [2022-04-15 06:44:21,486 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-15 06:44:21,487 INFO L272 TraceCheckUtils]: 0: Hoare triple {17104#true} call ULTIMATE.init(); {17104#true} is VALID [2022-04-15 06:44:21,487 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-15 06:44:21,487 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1154843226] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 06:44:21,487 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 06:44:21,487 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 20, 20] total 57 [2022-04-15 06:44:22,510 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 06:44:22,510 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1821002780] [2022-04-15 06:44:22,511 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1821002780] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 06:44:22,511 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 06:44:22,511 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [52] imperfect sequences [] total 52 [2022-04-15 06:44:22,511 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1527601438] [2022-04-15 06:44:22,511 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 06:44:22,511 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-15 06:44:22,511 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 06:44:22,511 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-15 06:44:22,573 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-15 06:44:22,573 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 52 states [2022-04-15 06:44:22,573 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 06:44:22,574 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 52 interpolants. [2022-04-15 06:44:22,575 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3155, Invalid=4501, Unknown=0, NotChecked=0, Total=7656 [2022-04-15 06:44:22,575 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-15 06:44:26,852 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:44:26,852 INFO L93 Difference]: Finished difference Result 177 states and 188 transitions. [2022-04-15 06:44:26,852 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 52 states. [2022-04-15 06:44:26,852 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-15 06:44:26,852 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 06:44:26,852 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-15 06:44:26,853 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 111 transitions. [2022-04-15 06:44:26,854 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-15 06:44:26,854 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 111 transitions. [2022-04-15 06:44:26,854 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 52 states and 111 transitions. [2022-04-15 06:44:26,944 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-15 06:44:26,945 INFO L225 Difference]: With dead ends: 177 [2022-04-15 06:44:26,945 INFO L226 Difference]: Without dead ends: 95 [2022-04-15 06:44:26,947 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 201 GetRequests, 64 SyntacticMatches, 2 SemanticMatches, 135 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5278 ImplicationChecksByTransitivity, 2.9s TimeCoverageRelationStatistics Valid=6444, Invalid=12188, Unknown=0, NotChecked=0, Total=18632 [2022-04-15 06:44:26,947 INFO L913 BasicCegarLoop]: 12 mSDtfsCounter, 168 mSDsluCounter, 42 mSDsCounter, 0 mSdLazyCounter, 1967 mSolverCounterSat, 194 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s 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-15 06:44:26,948 INFO L914 BasicCegarLoop]: 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-15 06:44:26,948 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2022-04-15 06:44:27,120 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 95. [2022-04-15 06:44:27,120 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 06:44:27,120 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-15 06:44:27,120 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-15 06:44:27,120 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-15 06:44:27,121 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:44:27,121 INFO L93 Difference]: Finished difference Result 95 states and 98 transitions. [2022-04-15 06:44:27,121 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 98 transitions. [2022-04-15 06:44:27,122 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 06:44:27,122 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 06:44:27,122 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-15 06:44:27,122 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-15 06:44:27,122 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:44:27,123 INFO L93 Difference]: Finished difference Result 95 states and 98 transitions. [2022-04-15 06:44:27,123 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 98 transitions. [2022-04-15 06:44:27,123 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 06:44:27,123 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 06:44:27,123 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 06:44:27,123 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 06:44:27,123 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-15 06:44:27,124 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 98 transitions. [2022-04-15 06:44:27,124 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 98 transitions. Word has length 89 [2022-04-15 06:44:27,124 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 06:44:27,124 INFO L478 AbstractCegarLoop]: Abstraction has 95 states and 98 transitions. [2022-04-15 06:44:27,124 INFO L479 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-15 06:44:27,124 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 95 states and 98 transitions. [2022-04-15 06:44:27,222 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-15 06:44:27,223 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 98 transitions. [2022-04-15 06:44:27,223 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2022-04-15 06:44:27,223 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 06:44:27,223 INFO L499 BasicCegarLoop]: trace histogram [32, 31, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 06:44:27,242 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (23)] Forceful destruction successful, exit code 0 [2022-04-15 06:44:27,423 WARN L460 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-15 06:44:27,424 INFO L403 AbstractCegarLoop]: === Iteration 26 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 06:44:27,424 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 06:44:27,424 INFO L85 PathProgramCache]: Analyzing trace with hash 140017013, now seen corresponding path program 23 times [2022-04-15 06:44:27,424 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 06:44:27,424 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1794450527] [2022-04-15 06:44:27,524 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-15 06:44:27,723 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-15 06:44:27,724 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-15 06:44:27,726 INFO L85 PathProgramCache]: Analyzing trace with hash -1509536735, now seen corresponding path program 1 times [2022-04-15 06:44:27,726 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 06:44:27,727 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1243737690] [2022-04-15 06:44:27,727 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 06:44:27,727 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 06:44:27,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:44:28,079 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 06:44:28,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:44:28,092 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-15 06:44:28,092 INFO L290 TraceCheckUtils]: 1: Hoare triple {18218#true} assume true; {18218#true} is VALID [2022-04-15 06:44:28,092 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {18218#true} {18218#true} #52#return; {18218#true} is VALID [2022-04-15 06:44:28,093 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-15 06:44:28,093 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-15 06:44:28,093 INFO L290 TraceCheckUtils]: 2: Hoare triple {18218#true} assume true; {18218#true} is VALID [2022-04-15 06:44:28,093 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {18218#true} {18218#true} #52#return; {18218#true} is VALID [2022-04-15 06:44:28,093 INFO L272 TraceCheckUtils]: 4: Hoare triple {18218#true} call #t~ret9 := main(); {18218#true} is VALID [2022-04-15 06:44:28,094 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-15 06:44:28,094 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-15 06:44:28,095 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-15 06:44:28,095 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-15 06:44:28,096 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-15 06:44:28,096 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-15 06:44:28,097 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-15 06:44:28,097 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-15 06:44:28,098 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-15 06:44:28,098 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-15 06:44:28,099 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-15 06:44:28,099 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-15 06:44:28,100 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-15 06:44:28,100 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-15 06:44:28,101 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-15 06:44:28,101 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-15 06:44:28,102 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-15 06:44:28,102 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-15 06:44:28,103 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-15 06:44:28,103 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-15 06:44:28,103 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-15 06:44:28,104 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-15 06:44:28,104 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-15 06:44:28,105 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-15 06:44:28,105 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-15 06:44:28,105 INFO L290 TraceCheckUtils]: 30: Hoare triple {18219#false} ~cond := #in~cond; {18219#false} is VALID [2022-04-15 06:44:28,105 INFO L290 TraceCheckUtils]: 31: Hoare triple {18219#false} assume 0 == ~cond; {18219#false} is VALID [2022-04-15 06:44:28,105 INFO L290 TraceCheckUtils]: 32: Hoare triple {18219#false} assume !false; {18219#false} is VALID [2022-04-15 06:44:28,105 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-15 06:44:28,105 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 06:44:28,106 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1243737690] [2022-04-15 06:44:28,106 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1243737690] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 06:44:28,106 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2081626572] [2022-04-15 06:44:28,106 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 06:44:28,106 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 06:44:28,106 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 06:44:28,107 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-15 06:44:28,108 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-15 06:44:28,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:44:28,139 INFO L263 TraceCheckSpWp]: Trace formula consists of 149 conjuncts, 22 conjunts are in the unsatisfiable core [2022-04-15 06:44:28,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:44:28,151 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 06:44:28,923 INFO L272 TraceCheckUtils]: 0: Hoare triple {18218#true} call ULTIMATE.init(); {18218#true} is VALID [2022-04-15 06:44:28,924 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-15 06:44:28,924 INFO L290 TraceCheckUtils]: 2: Hoare triple {18218#true} assume true; {18218#true} is VALID [2022-04-15 06:44:28,924 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {18218#true} {18218#true} #52#return; {18218#true} is VALID [2022-04-15 06:44:28,924 INFO L272 TraceCheckUtils]: 4: Hoare triple {18218#true} call #t~ret9 := main(); {18218#true} is VALID [2022-04-15 06:44:28,924 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-15 06:44:28,925 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-15 06:44:28,925 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-15 06:44:28,926 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-15 06:44:28,926 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-15 06:44:28,927 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-15 06:44:28,927 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-15 06:44:28,927 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-15 06:44:28,928 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-15 06:44:28,928 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-15 06:44:28,929 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-15 06:44:28,929 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-15 06:44:28,930 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-15 06:44:28,930 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-15 06:44:28,931 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-15 06:44:28,931 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-15 06:44:28,932 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-15 06:44:28,932 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-15 06:44:28,933 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-15 06:44:28,933 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-15 06:44:28,934 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-15 06:44:28,934 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-15 06:44:28,935 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-15 06:44:28,935 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-15 06:44:28,935 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-15 06:44:28,935 INFO L290 TraceCheckUtils]: 30: Hoare triple {18219#false} ~cond := #in~cond; {18219#false} is VALID [2022-04-15 06:44:28,935 INFO L290 TraceCheckUtils]: 31: Hoare triple {18219#false} assume 0 == ~cond; {18219#false} is VALID [2022-04-15 06:44:28,935 INFO L290 TraceCheckUtils]: 32: Hoare triple {18219#false} assume !false; {18219#false} is VALID [2022-04-15 06:44:28,935 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-15 06:44:28,936 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 06:44:29,903 INFO L290 TraceCheckUtils]: 32: Hoare triple {18219#false} assume !false; {18219#false} is VALID [2022-04-15 06:44:29,903 INFO L290 TraceCheckUtils]: 31: Hoare triple {18219#false} assume 0 == ~cond; {18219#false} is VALID [2022-04-15 06:44:29,903 INFO L290 TraceCheckUtils]: 30: Hoare triple {18219#false} ~cond := #in~cond; {18219#false} is VALID [2022-04-15 06:44:29,903 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-15 06:44:29,903 INFO L290 TraceCheckUtils]: 28: Hoare triple {18376#(< main_~z~0 main_~y~0)} assume !(~y~0 > ~z~0); {18219#false} is VALID [2022-04-15 06:44:29,904 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-15 06:44:29,904 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-15 06:44:29,905 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-15 06:44:29,905 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-15 06:44:29,906 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-15 06:44:29,906 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-15 06:44:29,907 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-15 06:44:29,907 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-15 06:44:29,908 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-15 06:44:29,908 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-15 06:44:29,908 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-15 06:44:29,909 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-15 06:44:29,909 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-15 06:44:29,910 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-15 06:44:29,910 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-15 06:44:29,911 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-15 06:44:29,911 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-15 06:44:29,912 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-15 06:44:29,912 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-15 06:44:29,913 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-15 06:44:29,913 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-15 06:44:29,913 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-15 06:44:29,914 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-15 06:44:29,914 INFO L272 TraceCheckUtils]: 4: Hoare triple {18218#true} call #t~ret9 := main(); {18218#true} is VALID [2022-04-15 06:44:29,914 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {18218#true} {18218#true} #52#return; {18218#true} is VALID [2022-04-15 06:44:29,914 INFO L290 TraceCheckUtils]: 2: Hoare triple {18218#true} assume true; {18218#true} is VALID [2022-04-15 06:44:29,914 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-15 06:44:29,914 INFO L272 TraceCheckUtils]: 0: Hoare triple {18218#true} call ULTIMATE.init(); {18218#true} is VALID [2022-04-15 06:44:29,914 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-15 06:44:29,914 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2081626572] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 06:44:29,914 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 06:44:29,915 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 21, 21] total 63 [2022-04-15 06:44:31,317 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 06:44:31,317 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1794450527] [2022-04-15 06:44:31,317 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1794450527] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 06:44:31,317 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 06:44:31,317 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [55] imperfect sequences [] total 55 [2022-04-15 06:44:31,317 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [314419098] [2022-04-15 06:44:31,317 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 06:44:31,318 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-15 06:44:31,318 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 06:44:31,318 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-15 06:44:31,389 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-15 06:44:31,389 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 55 states [2022-04-15 06:44:31,389 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 06:44:31,390 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 55 interpolants. [2022-04-15 06:44:31,390 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3117, Invalid=6003, Unknown=0, NotChecked=0, Total=9120 [2022-04-15 06:44:31,391 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-15 06:44:36,512 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:44:36,513 INFO L93 Difference]: Finished difference Result 246 states and 256 transitions. [2022-04-15 06:44:36,513 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2022-04-15 06:44:36,513 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-15 06:44:36,513 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 06:44:36,513 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-15 06:44:36,521 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 96 transitions. [2022-04-15 06:44:36,521 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-15 06:44:36,522 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 96 transitions. [2022-04-15 06:44:36,522 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 36 states and 96 transitions. [2022-04-15 06:44:36,595 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-15 06:44:36,596 INFO L225 Difference]: With dead ends: 246 [2022-04-15 06:44:36,596 INFO L226 Difference]: Without dead ends: 159 [2022-04-15 06:44:36,597 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 194 GetRequests, 65 SyntacticMatches, 2 SemanticMatches, 127 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4010 ImplicationChecksByTransitivity, 3.3s TimeCoverageRelationStatistics Valid=4540, Invalid=11972, Unknown=0, NotChecked=0, Total=16512 [2022-04-15 06:44:36,597 INFO L913 BasicCegarLoop]: 13 mSDtfsCounter, 43 mSDsluCounter, 187 mSDsCounter, 0 mSdLazyCounter, 2775 mSolverCounterSat, 39 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.0s 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.0s IncrementalHoareTripleChecker+Time [2022-04-15 06:44:36,597 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [43 Valid, 200 Invalid, 2814 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [39 Valid, 2775 Invalid, 0 Unknown, 0 Unchecked, 2.0s Time] [2022-04-15 06:44:36,598 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 159 states. [2022-04-15 06:44:36,899 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 159 to 159. [2022-04-15 06:44:36,899 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 06:44:36,899 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-15 06:44:36,899 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-15 06:44:36,899 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-15 06:44:36,901 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:44:36,901 INFO L93 Difference]: Finished difference Result 159 states and 163 transitions. [2022-04-15 06:44:36,901 INFO L276 IsEmpty]: Start isEmpty. Operand 159 states and 163 transitions. [2022-04-15 06:44:36,901 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 06:44:36,901 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 06:44:36,901 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-15 06:44:36,902 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-15 06:44:36,903 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:44:36,903 INFO L93 Difference]: Finished difference Result 159 states and 163 transitions. [2022-04-15 06:44:36,903 INFO L276 IsEmpty]: Start isEmpty. Operand 159 states and 163 transitions. [2022-04-15 06:44:36,903 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 06:44:36,903 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 06:44:36,903 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 06:44:36,903 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 06:44:36,903 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-15 06:44:36,905 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 159 states to 159 states and 163 transitions. [2022-04-15 06:44:36,905 INFO L78 Accepts]: Start accepts. Automaton has 159 states and 163 transitions. Word has length 94 [2022-04-15 06:44:36,905 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 06:44:36,905 INFO L478 AbstractCegarLoop]: Abstraction has 159 states and 163 transitions. [2022-04-15 06:44:36,905 INFO L479 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-15 06:44:36,905 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 159 states and 163 transitions. [2022-04-15 06:44:37,050 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-15 06:44:37,050 INFO L276 IsEmpty]: Start isEmpty. Operand 159 states and 163 transitions. [2022-04-15 06:44:37,050 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2022-04-15 06:44:37,050 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 06:44:37,051 INFO L499 BasicCegarLoop]: trace histogram [33, 32, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 06:44:37,073 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-15 06:44:37,263 WARN L460 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-15 06:44:37,263 INFO L403 AbstractCegarLoop]: === Iteration 27 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 06:44:37,264 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 06:44:37,264 INFO L85 PathProgramCache]: Analyzing trace with hash -1253519302, now seen corresponding path program 24 times [2022-04-15 06:44:37,264 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 06:44:37,264 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1325742778] [2022-04-15 06:44:37,347 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-15 06:44:37,564 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-15 06:44:37,566 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-15 06:44:37,567 INFO L85 PathProgramCache]: Analyzing trace with hash -1820898527, now seen corresponding path program 1 times [2022-04-15 06:44:37,568 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 06:44:37,568 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [256780680] [2022-04-15 06:44:37,568 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 06:44:37,568 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 06:44:37,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:44:37,886 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 06:44:37,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:44:37,900 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-15 06:44:37,900 INFO L290 TraceCheckUtils]: 1: Hoare triple {19708#true} assume true; {19708#true} is VALID [2022-04-15 06:44:37,900 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {19708#true} {19708#true} #52#return; {19708#true} is VALID [2022-04-15 06:44:37,901 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-15 06:44:37,901 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-15 06:44:37,901 INFO L290 TraceCheckUtils]: 2: Hoare triple {19708#true} assume true; {19708#true} is VALID [2022-04-15 06:44:37,901 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {19708#true} {19708#true} #52#return; {19708#true} is VALID [2022-04-15 06:44:37,901 INFO L272 TraceCheckUtils]: 4: Hoare triple {19708#true} call #t~ret9 := main(); {19708#true} is VALID [2022-04-15 06:44:37,901 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-15 06:44:37,902 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-15 06:44:37,902 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-15 06:44:37,903 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-15 06:44:37,904 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-15 06:44:37,904 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-15 06:44:37,905 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-15 06:44:37,905 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-15 06:44:37,906 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-15 06:44:37,906 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-15 06:44:37,907 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-15 06:44:37,907 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-15 06:44:37,908 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-15 06:44:37,908 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-15 06:44:37,909 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-15 06:44:37,909 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-15 06:44:37,910 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-15 06:44:37,910 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-15 06:44:37,911 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-15 06:44:37,911 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-15 06:44:37,912 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-15 06:44:37,912 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-15 06:44:37,913 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-15 06:44:37,913 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-15 06:44:37,913 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-15 06:44:37,913 INFO L290 TraceCheckUtils]: 30: Hoare triple {19709#false} ~cond := #in~cond; {19709#false} is VALID [2022-04-15 06:44:37,913 INFO L290 TraceCheckUtils]: 31: Hoare triple {19709#false} assume 0 == ~cond; {19709#false} is VALID [2022-04-15 06:44:37,913 INFO L290 TraceCheckUtils]: 32: Hoare triple {19709#false} assume !false; {19709#false} is VALID [2022-04-15 06:44:37,913 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-15 06:44:37,914 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 06:44:37,914 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [256780680] [2022-04-15 06:44:37,914 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [256780680] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 06:44:37,914 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1254859413] [2022-04-15 06:44:37,914 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 06:44:37,914 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 06:44:37,914 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 06:44:37,915 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-15 06:44:37,950 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-15 06:44:37,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:44:37,970 INFO L263 TraceCheckSpWp]: Trace formula consists of 149 conjuncts, 22 conjunts are in the unsatisfiable core [2022-04-15 06:44:37,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:44:37,982 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 06:44:38,662 INFO L272 TraceCheckUtils]: 0: Hoare triple {19708#true} call ULTIMATE.init(); {19708#true} is VALID [2022-04-15 06:44:38,663 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-15 06:44:38,663 INFO L290 TraceCheckUtils]: 2: Hoare triple {19708#true} assume true; {19708#true} is VALID [2022-04-15 06:44:38,663 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {19708#true} {19708#true} #52#return; {19708#true} is VALID [2022-04-15 06:44:38,663 INFO L272 TraceCheckUtils]: 4: Hoare triple {19708#true} call #t~ret9 := main(); {19708#true} is VALID [2022-04-15 06:44:38,663 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-15 06:44:38,664 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-15 06:44:38,664 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-15 06:44:38,665 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-15 06:44:38,665 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-15 06:44:38,666 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-15 06:44:38,666 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-15 06:44:38,667 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-15 06:44:38,667 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-15 06:44:38,668 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-15 06:44:38,668 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-15 06:44:38,669 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-15 06:44:38,669 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-15 06:44:38,669 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-15 06:44:38,670 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-15 06:44:38,670 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-15 06:44:38,671 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-15 06:44:38,671 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-15 06:44:38,672 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-15 06:44:38,672 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-15 06:44:38,673 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-15 06:44:38,673 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-15 06:44:38,674 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-15 06:44:38,674 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-15 06:44:38,674 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-15 06:44:38,674 INFO L290 TraceCheckUtils]: 30: Hoare triple {19709#false} ~cond := #in~cond; {19709#false} is VALID [2022-04-15 06:44:38,674 INFO L290 TraceCheckUtils]: 31: Hoare triple {19709#false} assume 0 == ~cond; {19709#false} is VALID [2022-04-15 06:44:38,674 INFO L290 TraceCheckUtils]: 32: Hoare triple {19709#false} assume !false; {19709#false} is VALID [2022-04-15 06:44:38,675 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-15 06:44:38,675 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 06:44:39,577 INFO L290 TraceCheckUtils]: 32: Hoare triple {19709#false} assume !false; {19709#false} is VALID [2022-04-15 06:44:39,578 INFO L290 TraceCheckUtils]: 31: Hoare triple {19709#false} assume 0 == ~cond; {19709#false} is VALID [2022-04-15 06:44:39,578 INFO L290 TraceCheckUtils]: 30: Hoare triple {19709#false} ~cond := #in~cond; {19709#false} is VALID [2022-04-15 06:44:39,578 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-15 06:44:39,578 INFO L290 TraceCheckUtils]: 28: Hoare triple {19863#(< main_~z~0 main_~y~0)} assume !(~y~0 > ~z~0); {19709#false} is VALID [2022-04-15 06:44:39,578 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-15 06:44:39,579 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-15 06:44:39,579 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-15 06:44:39,580 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-15 06:44:39,580 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-15 06:44:39,581 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-15 06:44:39,581 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-15 06:44:39,582 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-15 06:44:39,582 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-15 06:44:39,583 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-15 06:44:39,583 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-15 06:44:39,583 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-15 06:44:39,584 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-15 06:44:39,584 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-15 06:44:39,585 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-15 06:44:39,585 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-15 06:44:39,586 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-15 06:44:39,586 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-15 06:44:39,586 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-15 06:44:39,587 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-15 06:44:39,587 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-15 06:44:39,588 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-15 06:44:39,588 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-15 06:44:39,588 INFO L272 TraceCheckUtils]: 4: Hoare triple {19708#true} call #t~ret9 := main(); {19708#true} is VALID [2022-04-15 06:44:39,588 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {19708#true} {19708#true} #52#return; {19708#true} is VALID [2022-04-15 06:44:39,588 INFO L290 TraceCheckUtils]: 2: Hoare triple {19708#true} assume true; {19708#true} is VALID [2022-04-15 06:44:39,589 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-15 06:44:39,589 INFO L272 TraceCheckUtils]: 0: Hoare triple {19708#true} call ULTIMATE.init(); {19708#true} is VALID [2022-04-15 06:44:39,589 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-15 06:44:39,589 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1254859413] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 06:44:39,589 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 06:44:39,589 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 21, 21] total 60 [2022-04-15 06:44:40,766 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 06:44:40,766 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1325742778] [2022-04-15 06:44:40,766 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1325742778] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 06:44:40,767 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 06:44:40,767 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [56] imperfect sequences [] total 56 [2022-04-15 06:44:40,767 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [185580834] [2022-04-15 06:44:40,767 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 06:44:40,767 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-15 06:44:40,767 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 06:44:40,768 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-15 06:44:40,839 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-15 06:44:40,840 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 56 states [2022-04-15 06:44:40,840 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 06:44:40,841 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 56 interpolants. [2022-04-15 06:44:40,842 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3581, Invalid=5161, Unknown=0, NotChecked=0, Total=8742 [2022-04-15 06:44:40,842 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-15 06:44:45,844 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:44:45,844 INFO L93 Difference]: Finished difference Result 253 states and 267 transitions. [2022-04-15 06:44:45,844 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 56 states. [2022-04-15 06:44:45,844 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-15 06:44:45,844 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 06:44:45,845 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-15 06:44:45,845 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 120 transitions. [2022-04-15 06:44:45,845 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-15 06:44:45,846 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 120 transitions. [2022-04-15 06:44:45,846 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 56 states and 120 transitions. [2022-04-15 06:44:45,940 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-15 06:44:45,942 INFO L225 Difference]: With dead ends: 253 [2022-04-15 06:44:45,942 INFO L226 Difference]: Without dead ends: 166 [2022-04-15 06:44:45,943 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 214 GetRequests, 67 SyntacticMatches, 2 SemanticMatches, 145 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6114 ImplicationChecksByTransitivity, 3.2s TimeCoverageRelationStatistics Valid=7336, Invalid=14126, Unknown=0, NotChecked=0, Total=21462 [2022-04-15 06:44:45,944 INFO L913 BasicCegarLoop]: 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-15 06:44:45,944 INFO L914 BasicCegarLoop]: 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-15 06:44:45,944 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 166 states. [2022-04-15 06:44:46,114 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 166 to 102. [2022-04-15 06:44:46,115 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 06:44:46,115 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-15 06:44:46,115 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-15 06:44:46,115 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-15 06:44:46,116 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:44:46,117 INFO L93 Difference]: Finished difference Result 166 states and 170 transitions. [2022-04-15 06:44:46,117 INFO L276 IsEmpty]: Start isEmpty. Operand 166 states and 170 transitions. [2022-04-15 06:44:46,117 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 06:44:46,117 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 06:44:46,117 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-15 06:44:46,117 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-15 06:44:46,118 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:44:46,119 INFO L93 Difference]: Finished difference Result 166 states and 170 transitions. [2022-04-15 06:44:46,119 INFO L276 IsEmpty]: Start isEmpty. Operand 166 states and 170 transitions. [2022-04-15 06:44:46,119 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 06:44:46,119 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 06:44:46,119 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 06:44:46,119 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 06:44:46,119 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-15 06:44:46,120 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 105 transitions. [2022-04-15 06:44:46,120 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 105 transitions. Word has length 96 [2022-04-15 06:44:46,120 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 06:44:46,120 INFO L478 AbstractCegarLoop]: Abstraction has 102 states and 105 transitions. [2022-04-15 06:44:46,120 INFO L479 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-15 06:44:46,120 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 102 states and 105 transitions. [2022-04-15 06:44:46,247 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-15 06:44:46,247 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 105 transitions. [2022-04-15 06:44:46,248 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2022-04-15 06:44:46,248 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 06:44:46,248 INFO L499 BasicCegarLoop]: trace histogram [35, 34, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 06:44:46,263 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-15 06:44:46,448 WARN L460 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-15 06:44:46,449 INFO L403 AbstractCegarLoop]: === Iteration 28 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 06:44:46,449 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 06:44:46,449 INFO L85 PathProgramCache]: Analyzing trace with hash 792532447, now seen corresponding path program 25 times [2022-04-15 06:44:46,449 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 06:44:46,449 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1962638064] [2022-04-15 06:44:46,555 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-15 06:44:46,776 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-15 06:44:46,777 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-15 06:44:46,779 INFO L85 PathProgramCache]: Analyzing trace with hash -1640022686, now seen corresponding path program 1 times [2022-04-15 06:44:46,779 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 06:44:46,779 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [339036245] [2022-04-15 06:44:46,779 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 06:44:46,779 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 06:44:46,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:44:47,121 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 06:44:47,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:44:47,124 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-15 06:44:47,124 INFO L290 TraceCheckUtils]: 1: Hoare triple {21150#true} assume true; {21150#true} is VALID [2022-04-15 06:44:47,124 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {21150#true} {21150#true} #52#return; {21150#true} is VALID [2022-04-15 06:44:47,125 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-15 06:44:47,125 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-15 06:44:47,125 INFO L290 TraceCheckUtils]: 2: Hoare triple {21150#true} assume true; {21150#true} is VALID [2022-04-15 06:44:47,125 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {21150#true} {21150#true} #52#return; {21150#true} is VALID [2022-04-15 06:44:47,125 INFO L272 TraceCheckUtils]: 4: Hoare triple {21150#true} call #t~ret9 := main(); {21150#true} is VALID [2022-04-15 06:44:47,125 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-15 06:44:47,126 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-15 06:44:47,126 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-15 06:44:47,127 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-15 06:44:47,127 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-15 06:44:47,128 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-15 06:44:47,128 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-15 06:44:47,129 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-15 06:44:47,129 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-15 06:44:47,130 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-15 06:44:47,130 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-15 06:44:47,131 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-15 06:44:47,131 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-15 06:44:47,132 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-15 06:44:47,132 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-15 06:44:47,132 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-15 06:44:47,133 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-15 06:44:47,133 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-15 06:44:47,134 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-15 06:44:47,134 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-15 06:44:47,135 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-15 06:44:47,135 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-15 06:44:47,136 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-15 06:44:47,136 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-15 06:44:47,137 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-15 06:44:47,137 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-15 06:44:47,137 INFO L290 TraceCheckUtils]: 31: Hoare triple {21151#false} ~cond := #in~cond; {21151#false} is VALID [2022-04-15 06:44:47,137 INFO L290 TraceCheckUtils]: 32: Hoare triple {21151#false} assume 0 == ~cond; {21151#false} is VALID [2022-04-15 06:44:47,137 INFO L290 TraceCheckUtils]: 33: Hoare triple {21151#false} assume !false; {21151#false} is VALID [2022-04-15 06:44:47,137 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-15 06:44:47,137 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 06:44:47,137 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [339036245] [2022-04-15 06:44:47,137 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [339036245] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 06:44:47,137 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2025308448] [2022-04-15 06:44:47,138 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 06:44:47,138 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 06:44:47,138 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 06:44:47,138 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-15 06:44:47,139 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-15 06:44:47,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:44:47,177 INFO L263 TraceCheckSpWp]: Trace formula consists of 154 conjuncts, 23 conjunts are in the unsatisfiable core [2022-04-15 06:44:47,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:44:47,189 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 06:44:47,982 INFO L272 TraceCheckUtils]: 0: Hoare triple {21150#true} call ULTIMATE.init(); {21150#true} is VALID [2022-04-15 06:44:47,982 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-15 06:44:47,982 INFO L290 TraceCheckUtils]: 2: Hoare triple {21150#true} assume true; {21150#true} is VALID [2022-04-15 06:44:47,982 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {21150#true} {21150#true} #52#return; {21150#true} is VALID [2022-04-15 06:44:47,982 INFO L272 TraceCheckUtils]: 4: Hoare triple {21150#true} call #t~ret9 := main(); {21150#true} is VALID [2022-04-15 06:44:47,982 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-15 06:44:47,983 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-15 06:44:47,983 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-15 06:44:47,984 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-15 06:44:47,984 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-15 06:44:47,985 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-15 06:44:47,985 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-15 06:44:47,986 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-15 06:44:47,986 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-15 06:44:47,987 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-15 06:44:47,987 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-15 06:44:47,988 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-15 06:44:47,988 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-15 06:44:47,989 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-15 06:44:47,989 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-15 06:44:47,990 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-15 06:44:47,990 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-15 06:44:47,991 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-15 06:44:47,991 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-15 06:44:47,991 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-15 06:44:47,992 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-15 06:44:47,992 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-15 06:44:47,993 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-15 06:44:47,993 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-15 06:44:47,994 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-15 06:44:47,994 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-15 06:44:47,994 INFO L290 TraceCheckUtils]: 31: Hoare triple {21151#false} ~cond := #in~cond; {21151#false} is VALID [2022-04-15 06:44:47,994 INFO L290 TraceCheckUtils]: 32: Hoare triple {21151#false} assume 0 == ~cond; {21151#false} is VALID [2022-04-15 06:44:47,994 INFO L290 TraceCheckUtils]: 33: Hoare triple {21151#false} assume !false; {21151#false} is VALID [2022-04-15 06:44:47,994 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-15 06:44:47,994 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 06:44:48,984 INFO L290 TraceCheckUtils]: 33: Hoare triple {21151#false} assume !false; {21151#false} is VALID [2022-04-15 06:44:48,984 INFO L290 TraceCheckUtils]: 32: Hoare triple {21151#false} assume 0 == ~cond; {21151#false} is VALID [2022-04-15 06:44:48,984 INFO L290 TraceCheckUtils]: 31: Hoare triple {21151#false} ~cond := #in~cond; {21151#false} is VALID [2022-04-15 06:44:48,985 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-15 06:44:48,985 INFO L290 TraceCheckUtils]: 29: Hoare triple {21310#(< main_~z~0 main_~y~0)} assume !(~y~0 > ~z~0); {21151#false} is VALID [2022-04-15 06:44:48,985 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-15 06:44:48,986 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-15 06:44:48,986 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-15 06:44:48,987 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-15 06:44:48,987 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-15 06:44:48,988 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-15 06:44:48,988 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-15 06:44:48,988 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-15 06:44:48,989 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-15 06:44:48,989 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-15 06:44:48,990 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-15 06:44:48,990 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-15 06:44:48,991 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-15 06:44:48,991 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-15 06:44:48,992 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-15 06:44:48,992 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-15 06:44:48,992 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-15 06:44:48,993 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-15 06:44:48,993 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-15 06:44:48,994 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-15 06:44:48,994 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-15 06:44:48,995 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-15 06:44:48,995 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-15 06:44:48,995 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-15 06:44:48,995 INFO L272 TraceCheckUtils]: 4: Hoare triple {21150#true} call #t~ret9 := main(); {21150#true} is VALID [2022-04-15 06:44:48,995 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {21150#true} {21150#true} #52#return; {21150#true} is VALID [2022-04-15 06:44:48,996 INFO L290 TraceCheckUtils]: 2: Hoare triple {21150#true} assume true; {21150#true} is VALID [2022-04-15 06:44:48,996 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-15 06:44:48,996 INFO L272 TraceCheckUtils]: 0: Hoare triple {21150#true} call ULTIMATE.init(); {21150#true} is VALID [2022-04-15 06:44:48,996 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-15 06:44:48,996 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2025308448] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 06:44:48,996 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 06:44:48,996 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 22, 22] total 63 [2022-04-15 06:44:50,209 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 06:44:50,209 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1962638064] [2022-04-15 06:44:50,209 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1962638064] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 06:44:50,209 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 06:44:50,209 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [59] imperfect sequences [] total 59 [2022-04-15 06:44:50,209 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [552548860] [2022-04-15 06:44:50,209 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 06:44:50,210 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-15 06:44:50,210 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 06:44:50,210 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-15 06:44:50,280 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-15 06:44:50,280 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 59 states [2022-04-15 06:44:50,280 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 06:44:50,281 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 59 interpolants. [2022-04-15 06:44:50,281 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3970, Invalid=5732, Unknown=0, NotChecked=0, Total=9702 [2022-04-15 06:44:50,281 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-15 06:44:56,078 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:44:56,078 INFO L93 Difference]: Finished difference Result 201 states and 212 transitions. [2022-04-15 06:44:56,078 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 59 states. [2022-04-15 06:44:56,078 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-15 06:44:56,078 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 06:44:56,079 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-15 06:44:56,079 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 123 transitions. [2022-04-15 06:44:56,080 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-15 06:44:56,081 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 123 transitions. [2022-04-15 06:44:56,081 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 59 states and 123 transitions. [2022-04-15 06:44:56,185 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-15 06:44:56,186 INFO L225 Difference]: With dead ends: 201 [2022-04-15 06:44:56,186 INFO L226 Difference]: Without dead ends: 107 [2022-04-15 06:44:56,187 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 224 GetRequests, 69 SyntacticMatches, 2 SemanticMatches, 153 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6815 ImplicationChecksByTransitivity, 3.6s TimeCoverageRelationStatistics Valid=8134, Invalid=15736, Unknown=0, NotChecked=0, Total=23870 [2022-04-15 06:44:56,188 INFO L913 BasicCegarLoop]: 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.2s IncrementalHoareTripleChecker+Time [2022-04-15 06:44:56,188 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [273 Valid, 44 Invalid, 2961 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [335 Valid, 2626 Invalid, 0 Unknown, 0 Unchecked, 2.2s Time] [2022-04-15 06:44:56,188 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states. [2022-04-15 06:44:56,373 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 107. [2022-04-15 06:44:56,373 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 06:44:56,374 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-15 06:44:56,374 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-15 06:44:56,374 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-15 06:44:56,375 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:44:56,375 INFO L93 Difference]: Finished difference Result 107 states and 110 transitions. [2022-04-15 06:44:56,375 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 110 transitions. [2022-04-15 06:44:56,375 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 06:44:56,375 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 06:44:56,375 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-15 06:44:56,375 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-15 06:44:56,376 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:44:56,376 INFO L93 Difference]: Finished difference Result 107 states and 110 transitions. [2022-04-15 06:44:56,376 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 110 transitions. [2022-04-15 06:44:56,376 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 06:44:56,377 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 06:44:56,377 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 06:44:56,377 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 06:44:56,377 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-15 06:44:56,378 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 110 transitions. [2022-04-15 06:44:56,378 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 110 transitions. Word has length 101 [2022-04-15 06:44:56,378 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 06:44:56,378 INFO L478 AbstractCegarLoop]: Abstraction has 107 states and 110 transitions. [2022-04-15 06:44:56,378 INFO L479 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-15 06:44:56,378 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 107 states and 110 transitions. [2022-04-15 06:44:56,473 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-15 06:44:56,473 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 110 transitions. [2022-04-15 06:44:56,474 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2022-04-15 06:44:56,474 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 06:44:56,474 INFO L499 BasicCegarLoop]: trace histogram [37, 36, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 06:44:56,499 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-15 06:44:56,674 WARN L460 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-15 06:44:56,674 INFO L403 AbstractCegarLoop]: === Iteration 29 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 06:44:56,675 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 06:44:56,675 INFO L85 PathProgramCache]: Analyzing trace with hash -1847916626, now seen corresponding path program 26 times [2022-04-15 06:44:56,675 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 06:44:56,675 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [594378758] [2022-04-15 06:44:58,762 WARN L977 rdanLoopAcceleration]: Unable to prove correctness of quantifier elimination. [2022-04-15 06:44:58,813 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-15 06:44:59,035 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-15 06:44:59,036 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-15 06:44:59,038 INFO L85 PathProgramCache]: Analyzing trace with hash -2131496639, now seen corresponding path program 1 times [2022-04-15 06:44:59,038 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 06:44:59,039 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [626408739] [2022-04-15 06:44:59,039 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 06:44:59,039 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 06:44:59,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:44:59,464 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 06:44:59,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:44:59,467 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-15 06:44:59,467 INFO L290 TraceCheckUtils]: 1: Hoare triple {22397#true} assume true; {22397#true} is VALID [2022-04-15 06:44:59,467 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {22397#true} {22397#true} #52#return; {22397#true} is VALID [2022-04-15 06:44:59,467 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-15 06:44:59,467 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-15 06:44:59,467 INFO L290 TraceCheckUtils]: 2: Hoare triple {22397#true} assume true; {22397#true} is VALID [2022-04-15 06:44:59,467 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {22397#true} {22397#true} #52#return; {22397#true} is VALID [2022-04-15 06:44:59,468 INFO L272 TraceCheckUtils]: 4: Hoare triple {22397#true} call #t~ret9 := main(); {22397#true} is VALID [2022-04-15 06:44:59,468 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-15 06:44:59,469 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-15 06:44:59,469 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-15 06:44:59,470 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-15 06:44:59,483 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-15 06:44:59,484 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-15 06:44:59,484 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-15 06:44:59,485 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-15 06:44:59,485 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-15 06:44:59,486 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-15 06:44:59,486 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-15 06:44:59,486 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-15 06:44:59,487 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-15 06:44:59,487 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-15 06:44:59,488 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-15 06:44:59,488 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-15 06:44:59,489 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-15 06:44:59,489 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-15 06:44:59,490 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-15 06:44:59,490 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-15 06:44:59,491 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-15 06:44:59,491 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-15 06:44:59,492 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-15 06:44:59,492 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-15 06:44:59,493 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-15 06:44:59,493 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-15 06:44:59,493 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-15 06:44:59,493 INFO L290 TraceCheckUtils]: 32: Hoare triple {22398#false} ~cond := #in~cond; {22398#false} is VALID [2022-04-15 06:44:59,493 INFO L290 TraceCheckUtils]: 33: Hoare triple {22398#false} assume 0 == ~cond; {22398#false} is VALID [2022-04-15 06:44:59,493 INFO L290 TraceCheckUtils]: 34: Hoare triple {22398#false} assume !false; {22398#false} is VALID [2022-04-15 06:44:59,494 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-15 06:44:59,494 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 06:44:59,494 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [626408739] [2022-04-15 06:44:59,494 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [626408739] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 06:44:59,494 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1711268030] [2022-04-15 06:44:59,494 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 06:44:59,494 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 06:44:59,494 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 06:44:59,495 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-15 06:44:59,496 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-15 06:44:59,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:44:59,533 INFO L263 TraceCheckSpWp]: Trace formula consists of 159 conjuncts, 24 conjunts are in the unsatisfiable core [2022-04-15 06:44:59,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:44:59,556 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 06:45:00,455 INFO L272 TraceCheckUtils]: 0: Hoare triple {22397#true} call ULTIMATE.init(); {22397#true} is VALID [2022-04-15 06:45:00,456 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-15 06:45:00,456 INFO L290 TraceCheckUtils]: 2: Hoare triple {22397#true} assume true; {22397#true} is VALID [2022-04-15 06:45:00,456 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {22397#true} {22397#true} #52#return; {22397#true} is VALID [2022-04-15 06:45:00,456 INFO L272 TraceCheckUtils]: 4: Hoare triple {22397#true} call #t~ret9 := main(); {22397#true} is VALID [2022-04-15 06:45:00,456 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-15 06:45:00,457 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-15 06:45:00,457 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-15 06:45:00,458 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-15 06:45:00,458 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-15 06:45:00,459 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-15 06:45:00,459 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-15 06:45:00,460 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-15 06:45:00,461 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-15 06:45:00,461 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-15 06:45:00,462 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-15 06:45:00,462 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-15 06:45:00,463 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-15 06:45:00,463 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-15 06:45:00,464 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-15 06:45:00,464 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-15 06:45:00,465 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-15 06:45:00,465 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-15 06:45:00,466 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-15 06:45:00,466 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-15 06:45:00,467 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-15 06:45:00,468 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-15 06:45:00,468 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-15 06:45:00,469 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-15 06:45:00,469 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-15 06:45:00,470 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-15 06:45:00,470 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-15 06:45:00,470 INFO L290 TraceCheckUtils]: 32: Hoare triple {22398#false} ~cond := #in~cond; {22398#false} is VALID [2022-04-15 06:45:00,470 INFO L290 TraceCheckUtils]: 33: Hoare triple {22398#false} assume 0 == ~cond; {22398#false} is VALID [2022-04-15 06:45:00,470 INFO L290 TraceCheckUtils]: 34: Hoare triple {22398#false} assume !false; {22398#false} is VALID [2022-04-15 06:45:00,470 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-15 06:45:00,470 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 06:45:01,613 INFO L290 TraceCheckUtils]: 34: Hoare triple {22398#false} assume !false; {22398#false} is VALID [2022-04-15 06:45:01,613 INFO L290 TraceCheckUtils]: 33: Hoare triple {22398#false} assume 0 == ~cond; {22398#false} is VALID [2022-04-15 06:45:01,613 INFO L290 TraceCheckUtils]: 32: Hoare triple {22398#false} ~cond := #in~cond; {22398#false} is VALID [2022-04-15 06:45:01,613 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-15 06:45:01,614 INFO L290 TraceCheckUtils]: 30: Hoare triple {22565#(< main_~z~0 main_~y~0)} assume !(~y~0 > ~z~0); {22398#false} is VALID [2022-04-15 06:45:01,615 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-15 06:45:01,615 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-15 06:45:01,616 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-15 06:45:01,616 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-15 06:45:01,617 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-15 06:45:01,617 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-15 06:45:01,618 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-15 06:45:01,618 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-15 06:45:01,618 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-15 06:45:01,619 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-15 06:45:01,619 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-15 06:45:01,620 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-15 06:45:01,620 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-15 06:45:01,621 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-15 06:45:01,621 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-15 06:45:01,622 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-15 06:45:01,622 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-15 06:45:01,623 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-15 06:45:01,623 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-15 06:45:01,623 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-15 06:45:01,624 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-15 06:45:01,625 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-15 06:45:01,625 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-15 06:45:01,625 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-15 06:45:01,626 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-15 06:45:01,626 INFO L272 TraceCheckUtils]: 4: Hoare triple {22397#true} call #t~ret9 := main(); {22397#true} is VALID [2022-04-15 06:45:01,626 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {22397#true} {22397#true} #52#return; {22397#true} is VALID [2022-04-15 06:45:01,626 INFO L290 TraceCheckUtils]: 2: Hoare triple {22397#true} assume true; {22397#true} is VALID [2022-04-15 06:45:01,626 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-15 06:45:01,626 INFO L272 TraceCheckUtils]: 0: Hoare triple {22397#true} call ULTIMATE.init(); {22397#true} is VALID [2022-04-15 06:45:01,626 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-15 06:45:01,626 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1711268030] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 06:45:01,626 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 06:45:01,627 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 23, 23] total 69 [2022-04-15 06:45:03,338 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 06:45:03,339 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [594378758] [2022-04-15 06:45:03,339 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [594378758] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 06:45:03,339 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 06:45:03,339 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [62] imperfect sequences [] total 62 [2022-04-15 06:45:03,339 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [979299433] [2022-04-15 06:45:03,339 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 06:45:03,339 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-15 06:45:03,340 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 06:45:03,340 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-15 06:45:03,415 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-15 06:45:03,416 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 62 states [2022-04-15 06:45:03,416 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 06:45:03,416 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 62 interpolants. [2022-04-15 06:45:03,417 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3847, Invalid=7495, Unknown=0, NotChecked=0, Total=11342 [2022-04-15 06:45:03,417 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-15 06:45:09,856 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:45:09,856 INFO L93 Difference]: Finished difference Result 280 states and 290 transitions. [2022-04-15 06:45:09,856 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2022-04-15 06:45:09,856 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-15 06:45:09,857 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 06:45:09,857 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-15 06:45:09,857 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 106 transitions. [2022-04-15 06:45:09,857 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-15 06:45:09,858 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 106 transitions. [2022-04-15 06:45:09,858 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 41 states and 106 transitions. [2022-04-15 06:45:09,938 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-15 06:45:09,940 INFO L225 Difference]: With dead ends: 280 [2022-04-15 06:45:09,940 INFO L226 Difference]: Without dead ends: 181 [2022-04-15 06:45:09,941 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 215 GetRequests, 70 SyntacticMatches, 2 SemanticMatches, 143 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5085 ImplicationChecksByTransitivity, 4.2s TimeCoverageRelationStatistics Valid=5637, Invalid=15243, Unknown=0, NotChecked=0, Total=20880 [2022-04-15 06:45:09,941 INFO L913 BasicCegarLoop]: 13 mSDtfsCounter, 48 mSDsluCounter, 207 mSDsCounter, 0 mSdLazyCounter, 3485 mSolverCounterSat, 44 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.5s 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-15 06:45:09,941 INFO L914 BasicCegarLoop]: 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-15 06:45:09,942 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 181 states. [2022-04-15 06:45:10,289 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 181 to 181. [2022-04-15 06:45:10,290 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 06:45:10,290 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-15 06:45:10,290 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-15 06:45:10,290 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-15 06:45:10,292 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:45:10,292 INFO L93 Difference]: Finished difference Result 181 states and 185 transitions. [2022-04-15 06:45:10,292 INFO L276 IsEmpty]: Start isEmpty. Operand 181 states and 185 transitions. [2022-04-15 06:45:10,292 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 06:45:10,292 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 06:45:10,292 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-15 06:45:10,293 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-15 06:45:10,294 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:45:10,294 INFO L93 Difference]: Finished difference Result 181 states and 185 transitions. [2022-04-15 06:45:10,294 INFO L276 IsEmpty]: Start isEmpty. Operand 181 states and 185 transitions. [2022-04-15 06:45:10,294 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 06:45:10,295 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 06:45:10,295 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 06:45:10,295 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 06:45:10,295 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-15 06:45:10,296 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 181 states to 181 states and 185 transitions. [2022-04-15 06:45:10,297 INFO L78 Accepts]: Start accepts. Automaton has 181 states and 185 transitions. Word has length 106 [2022-04-15 06:45:10,297 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 06:45:10,297 INFO L478 AbstractCegarLoop]: Abstraction has 181 states and 185 transitions. [2022-04-15 06:45:10,297 INFO L479 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-15 06:45:10,297 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 181 states and 185 transitions. [2022-04-15 06:45:10,459 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-15 06:45:10,459 INFO L276 IsEmpty]: Start isEmpty. Operand 181 states and 185 transitions. [2022-04-15 06:45:10,460 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2022-04-15 06:45:10,460 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 06:45:10,460 INFO L499 BasicCegarLoop]: trace histogram [38, 37, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 06:45:10,476 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (27)] Ended with exit code 0 [2022-04-15 06:45:10,660 WARN L460 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-15 06:45:10,661 INFO L403 AbstractCegarLoop]: === Iteration 30 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 06:45:10,661 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 06:45:10,661 INFO L85 PathProgramCache]: Analyzing trace with hash -642491661, now seen corresponding path program 27 times [2022-04-15 06:45:10,661 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 06:45:10,661 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1257295563] [2022-04-15 06:45:10,768 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-15 06:45:14,896 WARN L977 rdanLoopAcceleration]: Unable to prove correctness of quantifier elimination. [2022-04-15 06:45:15,005 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-15 06:45:15,007 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-15 06:45:15,009 INFO L85 PathProgramCache]: Analyzing trace with hash -702468031, now seen corresponding path program 1 times [2022-04-15 06:45:15,009 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 06:45:15,009 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [460246662] [2022-04-15 06:45:15,009 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 06:45:15,009 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 06:45:15,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:45:15,353 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 06:45:15,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:45:15,359 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-15 06:45:15,360 INFO L290 TraceCheckUtils]: 1: Hoare triple {24076#true} assume true; {24076#true} is VALID [2022-04-15 06:45:15,360 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {24076#true} {24076#true} #52#return; {24076#true} is VALID [2022-04-15 06:45:15,360 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-15 06:45:15,360 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-15 06:45:15,360 INFO L290 TraceCheckUtils]: 2: Hoare triple {24076#true} assume true; {24076#true} is VALID [2022-04-15 06:45:15,360 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {24076#true} {24076#true} #52#return; {24076#true} is VALID [2022-04-15 06:45:15,360 INFO L272 TraceCheckUtils]: 4: Hoare triple {24076#true} call #t~ret9 := main(); {24076#true} is VALID [2022-04-15 06:45:15,361 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-15 06:45:15,361 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-15 06:45:15,361 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-15 06:45:15,362 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-15 06:45:15,363 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-15 06:45:15,363 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-15 06:45:15,364 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-15 06:45:15,364 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-15 06:45:15,364 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-15 06:45:15,365 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-15 06:45:15,365 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-15 06:45:15,366 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-15 06:45:15,366 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-15 06:45:15,367 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-15 06:45:15,367 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-15 06:45:15,368 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-15 06:45:15,368 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-15 06:45:15,371 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-15 06:45:15,371 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-15 06:45:15,372 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-15 06:45:15,372 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-15 06:45:15,373 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-15 06:45:15,373 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-15 06:45:15,374 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-15 06:45:15,374 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-15 06:45:15,375 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-15 06:45:15,375 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-15 06:45:15,375 INFO L290 TraceCheckUtils]: 32: Hoare triple {24077#false} ~cond := #in~cond; {24077#false} is VALID [2022-04-15 06:45:15,375 INFO L290 TraceCheckUtils]: 33: Hoare triple {24077#false} assume 0 == ~cond; {24077#false} is VALID [2022-04-15 06:45:15,375 INFO L290 TraceCheckUtils]: 34: Hoare triple {24077#false} assume !false; {24077#false} is VALID [2022-04-15 06:45:15,375 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-15 06:45:15,375 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 06:45:15,375 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [460246662] [2022-04-15 06:45:15,375 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [460246662] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 06:45:15,375 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1795824578] [2022-04-15 06:45:15,376 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 06:45:15,376 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 06:45:15,376 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 06:45:15,376 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-15 06:45:15,377 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-15 06:45:15,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:45:15,416 INFO L263 TraceCheckSpWp]: Trace formula consists of 159 conjuncts, 24 conjunts are in the unsatisfiable core [2022-04-15 06:45:15,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:45:15,430 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 06:45:16,196 INFO L272 TraceCheckUtils]: 0: Hoare triple {24076#true} call ULTIMATE.init(); {24076#true} is VALID [2022-04-15 06:45:16,196 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-15 06:45:16,196 INFO L290 TraceCheckUtils]: 2: Hoare triple {24076#true} assume true; {24076#true} is VALID [2022-04-15 06:45:16,196 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {24076#true} {24076#true} #52#return; {24076#true} is VALID [2022-04-15 06:45:16,197 INFO L272 TraceCheckUtils]: 4: Hoare triple {24076#true} call #t~ret9 := main(); {24076#true} is VALID [2022-04-15 06:45:16,197 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-15 06:45:16,197 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-15 06:45:16,198 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-15 06:45:16,198 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-15 06:45:16,199 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-15 06:45:16,199 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-15 06:45:16,200 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-15 06:45:16,200 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-15 06:45:16,201 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-15 06:45:16,201 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-15 06:45:16,202 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-15 06:45:16,202 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-15 06:45:16,202 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-15 06:45:16,203 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-15 06:45:16,203 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-15 06:45:16,204 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-15 06:45:16,204 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-15 06:45:16,205 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-15 06:45:16,205 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-15 06:45:16,206 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-15 06:45:16,206 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-15 06:45:16,207 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-15 06:45:16,207 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-15 06:45:16,208 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-15 06:45:16,208 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-15 06:45:16,209 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-15 06:45:16,209 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-15 06:45:16,209 INFO L290 TraceCheckUtils]: 32: Hoare triple {24077#false} ~cond := #in~cond; {24077#false} is VALID [2022-04-15 06:45:16,209 INFO L290 TraceCheckUtils]: 33: Hoare triple {24077#false} assume 0 == ~cond; {24077#false} is VALID [2022-04-15 06:45:16,209 INFO L290 TraceCheckUtils]: 34: Hoare triple {24077#false} assume !false; {24077#false} is VALID [2022-04-15 06:45:16,209 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-15 06:45:16,209 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 06:45:17,219 INFO L290 TraceCheckUtils]: 34: Hoare triple {24077#false} assume !false; {24077#false} is VALID [2022-04-15 06:45:17,219 INFO L290 TraceCheckUtils]: 33: Hoare triple {24077#false} assume 0 == ~cond; {24077#false} is VALID [2022-04-15 06:45:17,219 INFO L290 TraceCheckUtils]: 32: Hoare triple {24077#false} ~cond := #in~cond; {24077#false} is VALID [2022-04-15 06:45:17,219 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-15 06:45:17,219 INFO L290 TraceCheckUtils]: 30: Hoare triple {24242#(< main_~z~0 main_~y~0)} assume !(~y~0 > ~z~0); {24077#false} is VALID [2022-04-15 06:45:17,220 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-15 06:45:17,220 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-15 06:45:17,221 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-15 06:45:17,221 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-15 06:45:17,222 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-15 06:45:17,222 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-15 06:45:17,223 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-15 06:45:17,223 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-15 06:45:17,224 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-15 06:45:17,224 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-15 06:45:17,224 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-15 06:45:17,225 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-15 06:45:17,225 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-15 06:45:17,226 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-15 06:45:17,226 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-15 06:45:17,227 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-15 06:45:17,227 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-15 06:45:17,228 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-15 06:45:17,228 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-15 06:45:17,228 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-15 06:45:17,229 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-15 06:45:17,230 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-15 06:45:17,230 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-15 06:45:17,230 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-15 06:45:17,231 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-15 06:45:17,231 INFO L272 TraceCheckUtils]: 4: Hoare triple {24076#true} call #t~ret9 := main(); {24076#true} is VALID [2022-04-15 06:45:17,231 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {24076#true} {24076#true} #52#return; {24076#true} is VALID [2022-04-15 06:45:17,231 INFO L290 TraceCheckUtils]: 2: Hoare triple {24076#true} assume true; {24076#true} is VALID [2022-04-15 06:45:17,231 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-15 06:45:17,231 INFO L272 TraceCheckUtils]: 0: Hoare triple {24076#true} call ULTIMATE.init(); {24076#true} is VALID [2022-04-15 06:45:17,231 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-15 06:45:17,231 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1795824578] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 06:45:17,231 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 06:45:17,232 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 23, 23] total 67 [2022-04-15 06:45:18,627 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 06:45:18,628 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1257295563] [2022-04-15 06:45:18,628 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1257295563] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 06:45:18,628 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 06:45:18,628 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [64] imperfect sequences [] total 64 [2022-04-15 06:45:18,628 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2049261619] [2022-04-15 06:45:18,628 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 06:45:18,628 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-15 06:45:18,628 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 06:45:18,629 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-15 06:45:18,714 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-15 06:45:18,714 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 64 states [2022-04-15 06:45:18,714 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 06:45:18,715 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 64 interpolants. [2022-04-15 06:45:18,715 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=4108, Invalid=7022, Unknown=0, NotChecked=0, Total=11130 [2022-04-15 06:45:18,716 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-15 06:45:25,464 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:45:25,465 INFO L93 Difference]: Finished difference Result 288 states and 303 transitions. [2022-04-15 06:45:25,465 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 64 states. [2022-04-15 06:45:25,465 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-15 06:45:25,465 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 06:45:25,465 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-15 06:45:25,466 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 134 transitions. [2022-04-15 06:45:25,466 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-15 06:45:25,467 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 134 transitions. [2022-04-15 06:45:25,467 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 64 states and 134 transitions. [2022-04-15 06:45:25,594 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-15 06:45:25,596 INFO L225 Difference]: With dead ends: 288 [2022-04-15 06:45:25,596 INFO L226 Difference]: Without dead ends: 189 [2022-04-15 06:45:25,598 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 238 GetRequests, 71 SyntacticMatches, 2 SemanticMatches, 165 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8758 ImplicationChecksByTransitivity, 4.1s TimeCoverageRelationStatistics Valid=8517, Invalid=19205, Unknown=0, NotChecked=0, Total=27722 [2022-04-15 06:45:25,598 INFO L913 BasicCegarLoop]: 12 mSDtfsCounter, 212 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 3051 mSolverCounterSat, 277 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.4s 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.4s IncrementalHoareTripleChecker+Time [2022-04-15 06:45:25,598 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [212 Valid, 34 Invalid, 3328 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [277 Valid, 3051 Invalid, 0 Unknown, 0 Unchecked, 2.4s Time] [2022-04-15 06:45:25,599 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 189 states. [2022-04-15 06:45:25,795 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 189 to 115. [2022-04-15 06:45:25,795 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 06:45:25,795 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-15 06:45:25,795 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-15 06:45:25,795 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-15 06:45:25,800 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:45:25,801 INFO L93 Difference]: Finished difference Result 189 states and 193 transitions. [2022-04-15 06:45:25,801 INFO L276 IsEmpty]: Start isEmpty. Operand 189 states and 193 transitions. [2022-04-15 06:45:25,801 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 06:45:25,801 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 06:45:25,801 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-15 06:45:25,801 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-15 06:45:25,803 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:45:25,803 INFO L93 Difference]: Finished difference Result 189 states and 193 transitions. [2022-04-15 06:45:25,803 INFO L276 IsEmpty]: Start isEmpty. Operand 189 states and 193 transitions. [2022-04-15 06:45:25,803 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 06:45:25,803 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 06:45:25,803 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 06:45:25,803 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 06:45:25,803 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-15 06:45:25,804 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 115 states and 118 transitions. [2022-04-15 06:45:25,804 INFO L78 Accepts]: Start accepts. Automaton has 115 states and 118 transitions. Word has length 108 [2022-04-15 06:45:25,804 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 06:45:25,805 INFO L478 AbstractCegarLoop]: Abstraction has 115 states and 118 transitions. [2022-04-15 06:45:25,805 INFO L479 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-15 06:45:25,805 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 115 states and 118 transitions. [2022-04-15 06:45:25,906 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-15 06:45:25,906 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 118 transitions. [2022-04-15 06:45:25,907 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2022-04-15 06:45:25,907 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 06:45:25,907 INFO L499 BasicCegarLoop]: trace histogram [40, 39, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 06:45:25,922 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-15 06:45:26,107 WARN L460 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-15 06:45:26,107 INFO L403 AbstractCegarLoop]: === Iteration 31 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 06:45:26,107 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 06:45:26,107 INFO L85 PathProgramCache]: Analyzing trace with hash -218952995, now seen corresponding path program 28 times [2022-04-15 06:45:26,108 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 06:45:26,108 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1980217525] [2022-04-15 06:45:26,192 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-15 06:45:30,313 WARN L977 rdanLoopAcceleration]: Unable to prove correctness of quantifier elimination. [2022-04-15 06:45:30,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-15 06:45:30,424 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-15 06:45:30,426 INFO L85 PathProgramCache]: Analyzing trace with hash -717746335, now seen corresponding path program 1 times [2022-04-15 06:45:30,426 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 06:45:30,426 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [71358354] [2022-04-15 06:45:30,426 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 06:45:30,426 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 06:45:30,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:45:30,864 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 06:45:30,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:45:30,867 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-15 06:45:30,867 INFO L290 TraceCheckUtils]: 1: Hoare triple {25700#true} assume true; {25700#true} is VALID [2022-04-15 06:45:30,867 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {25700#true} {25700#true} #52#return; {25700#true} is VALID [2022-04-15 06:45:30,868 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-15 06:45:30,868 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-15 06:45:30,868 INFO L290 TraceCheckUtils]: 2: Hoare triple {25700#true} assume true; {25700#true} is VALID [2022-04-15 06:45:30,868 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {25700#true} {25700#true} #52#return; {25700#true} is VALID [2022-04-15 06:45:30,868 INFO L272 TraceCheckUtils]: 4: Hoare triple {25700#true} call #t~ret9 := main(); {25700#true} is VALID [2022-04-15 06:45:30,868 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-15 06:45:30,869 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-15 06:45:30,869 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-15 06:45:30,870 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-15 06:45:30,870 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-15 06:45:30,871 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-15 06:45:30,871 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-15 06:45:30,872 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-15 06:45:30,872 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-15 06:45:30,873 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-15 06:45:30,873 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-15 06:45:30,874 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-15 06:45:30,874 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-15 06:45:30,874 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-15 06:45:30,875 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-15 06:45:30,875 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-15 06:45:30,876 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-15 06:45:30,876 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-15 06:45:30,877 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-15 06:45:30,877 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-15 06:45:30,881 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-15 06:45:30,882 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-15 06:45:30,882 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-15 06:45:30,883 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-15 06:45:30,883 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-15 06:45:30,883 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-15 06:45:30,884 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-15 06:45:30,884 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-15 06:45:30,884 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-15 06:45:30,884 INFO L290 TraceCheckUtils]: 34: Hoare triple {25701#false} ~cond := #in~cond; {25701#false} is VALID [2022-04-15 06:45:30,884 INFO L290 TraceCheckUtils]: 35: Hoare triple {25701#false} assume 0 == ~cond; {25701#false} is VALID [2022-04-15 06:45:30,885 INFO L290 TraceCheckUtils]: 36: Hoare triple {25701#false} assume !false; {25701#false} is VALID [2022-04-15 06:45:30,885 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-15 06:45:30,885 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 06:45:30,885 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [71358354] [2022-04-15 06:45:30,885 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [71358354] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 06:45:30,885 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [617212764] [2022-04-15 06:45:30,885 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 06:45:30,885 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 06:45:30,885 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 06:45:30,886 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-15 06:45:30,887 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-15 06:45:30,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:45:30,929 INFO L263 TraceCheckSpWp]: Trace formula consists of 169 conjuncts, 26 conjunts are in the unsatisfiable core [2022-04-15 06:45:30,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:45:30,944 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 06:45:31,878 INFO L272 TraceCheckUtils]: 0: Hoare triple {25700#true} call ULTIMATE.init(); {25700#true} is VALID [2022-04-15 06:45:31,879 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-15 06:45:31,879 INFO L290 TraceCheckUtils]: 2: Hoare triple {25700#true} assume true; {25700#true} is VALID [2022-04-15 06:45:31,879 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {25700#true} {25700#true} #52#return; {25700#true} is VALID [2022-04-15 06:45:31,879 INFO L272 TraceCheckUtils]: 4: Hoare triple {25700#true} call #t~ret9 := main(); {25700#true} is VALID [2022-04-15 06:45:31,879 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-15 06:45:31,880 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-15 06:45:31,880 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-15 06:45:31,881 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-15 06:45:31,881 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-15 06:45:31,882 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-15 06:45:31,882 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-15 06:45:31,883 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-15 06:45:31,883 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-15 06:45:31,884 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-15 06:45:31,884 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-15 06:45:31,884 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-15 06:45:31,885 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-15 06:45:31,885 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-15 06:45:31,886 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-15 06:45:31,886 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-15 06:45:31,887 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-15 06:45:31,887 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-15 06:45:31,888 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-15 06:45:31,888 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-15 06:45:31,889 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-15 06:45:31,889 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-15 06:45:31,890 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-15 06:45:31,890 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-15 06:45:31,891 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-15 06:45:31,891 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-15 06:45:31,892 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-15 06:45:31,892 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-15 06:45:31,892 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-15 06:45:31,892 INFO L290 TraceCheckUtils]: 34: Hoare triple {25701#false} ~cond := #in~cond; {25701#false} is VALID [2022-04-15 06:45:31,892 INFO L290 TraceCheckUtils]: 35: Hoare triple {25701#false} assume 0 == ~cond; {25701#false} is VALID [2022-04-15 06:45:31,892 INFO L290 TraceCheckUtils]: 36: Hoare triple {25701#false} assume !false; {25701#false} is VALID [2022-04-15 06:45:31,892 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-15 06:45:31,893 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 06:45:33,217 INFO L290 TraceCheckUtils]: 36: Hoare triple {25701#false} assume !false; {25701#false} is VALID [2022-04-15 06:45:33,217 INFO L290 TraceCheckUtils]: 35: Hoare triple {25701#false} assume 0 == ~cond; {25701#false} is VALID [2022-04-15 06:45:33,217 INFO L290 TraceCheckUtils]: 34: Hoare triple {25701#false} ~cond := #in~cond; {25701#false} is VALID [2022-04-15 06:45:33,217 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-15 06:45:33,218 INFO L290 TraceCheckUtils]: 32: Hoare triple {25878#(< main_~z~0 main_~y~0)} assume !(~y~0 > ~z~0); {25701#false} is VALID [2022-04-15 06:45:33,218 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-15 06:45:33,218 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-15 06:45:33,219 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-15 06:45:33,219 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-15 06:45:33,220 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-15 06:45:33,220 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-15 06:45:33,221 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-15 06:45:33,221 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-15 06:45:33,222 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-15 06:45:33,222 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-15 06:45:33,223 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-15 06:45:33,223 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-15 06:45:33,223 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-15 06:45:33,224 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-15 06:45:33,224 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-15 06:45:33,225 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-15 06:45:33,225 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-15 06:45:33,226 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-15 06:45:33,226 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-15 06:45:33,227 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-15 06:45:33,227 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-15 06:45:33,228 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-15 06:45:33,228 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-15 06:45:33,229 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-15 06:45:33,234 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-15 06:45:33,235 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-15 06:45:33,235 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-15 06:45:33,236 INFO L272 TraceCheckUtils]: 4: Hoare triple {25700#true} call #t~ret9 := main(); {25700#true} is VALID [2022-04-15 06:45:33,236 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {25700#true} {25700#true} #52#return; {25700#true} is VALID [2022-04-15 06:45:33,236 INFO L290 TraceCheckUtils]: 2: Hoare triple {25700#true} assume true; {25700#true} is VALID [2022-04-15 06:45:33,236 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-15 06:45:33,236 INFO L272 TraceCheckUtils]: 0: Hoare triple {25700#true} call ULTIMATE.init(); {25700#true} is VALID [2022-04-15 06:45:33,236 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-15 06:45:33,236 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [617212764] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 06:45:33,236 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 06:45:33,236 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [29, 25, 25] total 75 [2022-04-15 06:45:34,787 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 06:45:34,787 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1980217525] [2022-04-15 06:45:34,788 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1980217525] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 06:45:34,788 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 06:45:34,788 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [67] imperfect sequences [] total 67 [2022-04-15 06:45:34,788 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [641882862] [2022-04-15 06:45:34,788 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 06:45:34,788 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-15 06:45:34,788 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 06:45:34,788 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-15 06:45:34,866 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-15 06:45:34,866 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 67 states [2022-04-15 06:45:34,866 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 06:45:34,867 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 67 interpolants. [2022-04-15 06:45:34,868 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5356, Invalid=7984, Unknown=0, NotChecked=0, Total=13340 [2022-04-15 06:45:34,868 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-15 06:45:42,099 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:45:42,099 INFO L93 Difference]: Finished difference Result 303 states and 314 transitions. [2022-04-15 06:45:42,099 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 67 states. [2022-04-15 06:45:42,100 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-15 06:45:42,100 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 06:45:42,100 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-15 06:45:42,101 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 136 transitions. [2022-04-15 06:45:42,101 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-15 06:45:42,101 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 136 transitions. [2022-04-15 06:45:42,102 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 67 states and 136 transitions. [2022-04-15 06:45:42,203 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-15 06:45:42,205 INFO L225 Difference]: With dead ends: 303 [2022-04-15 06:45:42,205 INFO L226 Difference]: Without dead ends: 196 [2022-04-15 06:45:42,207 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 253 GetRequests, 73 SyntacticMatches, 2 SemanticMatches, 178 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9339 ImplicationChecksByTransitivity, 4.8s TimeCoverageRelationStatistics Valid=10759, Invalid=21461, Unknown=0, NotChecked=0, Total=32220 [2022-04-15 06:45:42,207 INFO L913 BasicCegarLoop]: 13 mSDtfsCounter, 180 mSDsluCounter, 27 mSDsCounter, 0 mSdLazyCounter, 3439 mSolverCounterSat, 203 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.6s 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.6s IncrementalHoareTripleChecker+Time [2022-04-15 06:45:42,207 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [180 Valid, 40 Invalid, 3642 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [203 Valid, 3439 Invalid, 0 Unknown, 0 Unchecked, 2.6s Time] [2022-04-15 06:45:42,208 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 196 states. [2022-04-15 06:45:42,582 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 196 to 196. [2022-04-15 06:45:42,582 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 06:45:42,583 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-15 06:45:42,583 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-15 06:45:42,588 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-15 06:45:42,590 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:45:42,590 INFO L93 Difference]: Finished difference Result 196 states and 200 transitions. [2022-04-15 06:45:42,590 INFO L276 IsEmpty]: Start isEmpty. Operand 196 states and 200 transitions. [2022-04-15 06:45:42,590 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 06:45:42,590 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 06:45:42,590 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-15 06:45:42,590 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-15 06:45:42,592 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:45:42,592 INFO L93 Difference]: Finished difference Result 196 states and 200 transitions. [2022-04-15 06:45:42,592 INFO L276 IsEmpty]: Start isEmpty. Operand 196 states and 200 transitions. [2022-04-15 06:45:42,592 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 06:45:42,593 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 06:45:42,593 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 06:45:42,593 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 06:45:42,593 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-15 06:45:42,595 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 196 states to 196 states and 200 transitions. [2022-04-15 06:45:42,595 INFO L78 Accepts]: Start accepts. Automaton has 196 states and 200 transitions. Word has length 114 [2022-04-15 06:45:42,595 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 06:45:42,595 INFO L478 AbstractCegarLoop]: Abstraction has 196 states and 200 transitions. [2022-04-15 06:45:42,595 INFO L479 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-15 06:45:42,595 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 196 states and 200 transitions. [2022-04-15 06:45:42,772 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-15 06:45:42,772 INFO L276 IsEmpty]: Start isEmpty. Operand 196 states and 200 transitions. [2022-04-15 06:45:42,773 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2022-04-15 06:45:42,773 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 06:45:42,773 INFO L499 BasicCegarLoop]: trace histogram [41, 40, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 06:45:42,788 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-15 06:45:42,977 WARN L460 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-15 06:45:42,977 INFO L403 AbstractCegarLoop]: === Iteration 32 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 06:45:42,978 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 06:45:42,978 INFO L85 PathProgramCache]: Analyzing trace with hash -1857282431, now seen corresponding path program 29 times [2022-04-15 06:45:42,978 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 06:45:42,978 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [86897214] [2022-04-15 06:45:47,038 WARN L977 rdanLoopAcceleration]: Unable to prove correctness of quantifier elimination. [2022-04-15 06:45:47,081 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-15 06:45:47,312 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-15 06:45:47,313 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-15 06:45:47,315 INFO L85 PathProgramCache]: Analyzing trace with hash -264339166, now seen corresponding path program 1 times [2022-04-15 06:45:47,315 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 06:45:47,315 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1533347552] [2022-04-15 06:45:47,315 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 06:45:47,315 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 06:45:47,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:45:47,704 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 06:45:47,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:45:47,716 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-15 06:45:47,716 INFO L290 TraceCheckUtils]: 1: Hoare triple {27558#true} assume true; {27558#true} is VALID [2022-04-15 06:45:47,716 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {27558#true} {27558#true} #52#return; {27558#true} is VALID [2022-04-15 06:45:47,716 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-15 06:45:47,717 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-15 06:45:47,717 INFO L290 TraceCheckUtils]: 2: Hoare triple {27558#true} assume true; {27558#true} is VALID [2022-04-15 06:45:47,717 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {27558#true} {27558#true} #52#return; {27558#true} is VALID [2022-04-15 06:45:47,717 INFO L272 TraceCheckUtils]: 4: Hoare triple {27558#true} call #t~ret9 := main(); {27558#true} is VALID [2022-04-15 06:45:47,717 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-15 06:45:47,718 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-15 06:45:47,718 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-15 06:45:47,719 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-15 06:45:47,720 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-15 06:45:47,720 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-15 06:45:47,721 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-15 06:45:47,721 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-15 06:45:47,722 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-15 06:45:47,722 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-15 06:45:47,723 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-15 06:45:47,723 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-15 06:45:47,724 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-15 06:45:47,724 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-15 06:45:47,725 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-15 06:45:47,725 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-15 06:45:47,726 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-15 06:45:47,726 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-15 06:45:47,726 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-15 06:45:47,727 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-15 06:45:47,727 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-15 06:45:47,728 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-15 06:45:47,728 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-15 06:45:47,729 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-15 06:45:47,729 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-15 06:45:47,730 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-15 06:45:47,730 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-15 06:45:47,731 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-15 06:45:47,731 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-15 06:45:47,731 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-15 06:45:47,731 INFO L290 TraceCheckUtils]: 35: Hoare triple {27559#false} ~cond := #in~cond; {27559#false} is VALID [2022-04-15 06:45:47,732 INFO L290 TraceCheckUtils]: 36: Hoare triple {27559#false} assume 0 == ~cond; {27559#false} is VALID [2022-04-15 06:45:47,732 INFO L290 TraceCheckUtils]: 37: Hoare triple {27559#false} assume !false; {27559#false} is VALID [2022-04-15 06:45:47,732 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-15 06:45:47,732 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 06:45:47,732 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1533347552] [2022-04-15 06:45:47,732 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1533347552] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 06:45:47,732 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1357647526] [2022-04-15 06:45:47,732 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 06:45:47,732 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 06:45:47,733 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 06:45:47,733 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-15 06:45:47,734 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-15 06:45:47,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:45:47,786 INFO L263 TraceCheckSpWp]: Trace formula consists of 174 conjuncts, 27 conjunts are in the unsatisfiable core [2022-04-15 06:45:47,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:45:47,802 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 06:45:48,741 INFO L272 TraceCheckUtils]: 0: Hoare triple {27558#true} call ULTIMATE.init(); {27558#true} is VALID [2022-04-15 06:45:48,741 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-15 06:45:48,741 INFO L290 TraceCheckUtils]: 2: Hoare triple {27558#true} assume true; {27558#true} is VALID [2022-04-15 06:45:48,741 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {27558#true} {27558#true} #52#return; {27558#true} is VALID [2022-04-15 06:45:48,741 INFO L272 TraceCheckUtils]: 4: Hoare triple {27558#true} call #t~ret9 := main(); {27558#true} is VALID [2022-04-15 06:45:48,741 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-15 06:45:48,742 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-15 06:45:48,742 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-15 06:45:48,743 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-15 06:45:48,743 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-15 06:45:48,744 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-15 06:45:48,744 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-15 06:45:48,745 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-15 06:45:48,745 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-15 06:45:48,746 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-15 06:45:48,746 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-15 06:45:48,747 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-15 06:45:48,747 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-15 06:45:48,748 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-15 06:45:48,748 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-15 06:45:48,748 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-15 06:45:48,749 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-15 06:45:48,749 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-15 06:45:48,750 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-15 06:45:48,750 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-15 06:45:48,751 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-15 06:45:48,751 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-15 06:45:48,752 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-15 06:45:48,752 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-15 06:45:48,753 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-15 06:45:48,753 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-15 06:45:48,754 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-15 06:45:48,754 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-15 06:45:48,754 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-15 06:45:48,754 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-15 06:45:48,755 INFO L290 TraceCheckUtils]: 35: Hoare triple {27559#false} ~cond := #in~cond; {27559#false} is VALID [2022-04-15 06:45:48,755 INFO L290 TraceCheckUtils]: 36: Hoare triple {27559#false} assume 0 == ~cond; {27559#false} is VALID [2022-04-15 06:45:48,755 INFO L290 TraceCheckUtils]: 37: Hoare triple {27559#false} assume !false; {27559#false} is VALID [2022-04-15 06:45:48,755 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-15 06:45:48,755 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 06:45:50,129 INFO L290 TraceCheckUtils]: 37: Hoare triple {27559#false} assume !false; {27559#false} is VALID [2022-04-15 06:45:50,130 INFO L290 TraceCheckUtils]: 36: Hoare triple {27559#false} assume 0 == ~cond; {27559#false} is VALID [2022-04-15 06:45:50,130 INFO L290 TraceCheckUtils]: 35: Hoare triple {27559#false} ~cond := #in~cond; {27559#false} is VALID [2022-04-15 06:45:50,130 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-15 06:45:50,130 INFO L290 TraceCheckUtils]: 33: Hoare triple {27738#(< main_~z~0 main_~y~0)} assume !(~y~0 > ~z~0); {27559#false} is VALID [2022-04-15 06:45:50,130 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-15 06:45:50,131 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-15 06:45:50,131 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-15 06:45:50,132 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-15 06:45:50,132 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-15 06:45:50,133 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-15 06:45:50,133 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-15 06:45:50,134 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-15 06:45:50,134 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-15 06:45:50,135 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-15 06:45:50,135 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-15 06:45:50,135 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-15 06:45:50,136 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-15 06:45:50,136 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-15 06:45:50,137 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-15 06:45:50,137 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-15 06:45:50,138 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-15 06:45:50,138 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-15 06:45:50,139 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-15 06:45:50,139 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-15 06:45:50,140 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-15 06:45:50,140 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-15 06:45:50,140 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-15 06:45:50,141 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-15 06:45:50,142 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-15 06:45:50,142 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-15 06:45:50,142 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-15 06:45:50,142 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-15 06:45:50,143 INFO L272 TraceCheckUtils]: 4: Hoare triple {27558#true} call #t~ret9 := main(); {27558#true} is VALID [2022-04-15 06:45:50,143 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {27558#true} {27558#true} #52#return; {27558#true} is VALID [2022-04-15 06:45:50,143 INFO L290 TraceCheckUtils]: 2: Hoare triple {27558#true} assume true; {27558#true} is VALID [2022-04-15 06:45:50,143 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-15 06:45:50,143 INFO L272 TraceCheckUtils]: 0: Hoare triple {27558#true} call ULTIMATE.init(); {27558#true} is VALID [2022-04-15 06:45:50,143 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-15 06:45:50,143 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1357647526] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 06:45:50,143 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 06:45:50,143 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 26, 26] total 75 [2022-04-15 06:45:51,692 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 06:45:51,692 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [86897214] [2022-04-15 06:45:51,692 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [86897214] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 06:45:51,692 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 06:45:51,692 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [69] imperfect sequences [] total 69 [2022-04-15 06:45:51,692 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [85567437] [2022-04-15 06:45:51,692 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 06:45:51,693 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-15 06:45:51,693 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 06:45:51,693 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-15 06:45:51,770 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-15 06:45:51,770 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 69 states [2022-04-15 06:45:51,770 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 06:45:51,771 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 69 interpolants. [2022-04-15 06:45:51,772 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5576, Invalid=7996, Unknown=0, NotChecked=0, Total=13572 [2022-04-15 06:45:51,772 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-15 06:45:59,150 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:45:59,150 INFO L93 Difference]: Finished difference Result 311 states and 325 transitions. [2022-04-15 06:45:59,150 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 69 states. [2022-04-15 06:45:59,150 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-15 06:45:59,151 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 06:45:59,151 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-15 06:45:59,152 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 141 transitions. [2022-04-15 06:45:59,152 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-15 06:45:59,152 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 141 transitions. [2022-04-15 06:45:59,153 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 69 states and 141 transitions. [2022-04-15 06:45:59,257 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-15 06:45:59,259 INFO L225 Difference]: With dead ends: 311 [2022-04-15 06:45:59,259 INFO L226 Difference]: Without dead ends: 203 [2022-04-15 06:45:59,261 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 258 GetRequests, 75 SyntacticMatches, 2 SemanticMatches, 181 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9534 ImplicationChecksByTransitivity, 4.8s TimeCoverageRelationStatistics Valid=11382, Invalid=21924, Unknown=0, NotChecked=0, Total=33306 [2022-04-15 06:45:59,261 INFO L913 BasicCegarLoop]: 12 mSDtfsCounter, 227 mSDsluCounter, 27 mSDsCounter, 0 mSdLazyCounter, 3502 mSolverCounterSat, 124 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.6s 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.7s IncrementalHoareTripleChecker+Time [2022-04-15 06:45:59,262 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [227 Valid, 39 Invalid, 3626 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [124 Valid, 3502 Invalid, 0 Unknown, 0 Unchecked, 2.7s Time] [2022-04-15 06:45:59,262 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 203 states. [2022-04-15 06:45:59,507 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 203 to 123. [2022-04-15 06:45:59,507 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 06:45:59,508 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-15 06:45:59,508 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-15 06:45:59,508 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-15 06:45:59,510 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:45:59,510 INFO L93 Difference]: Finished difference Result 203 states and 207 transitions. [2022-04-15 06:45:59,510 INFO L276 IsEmpty]: Start isEmpty. Operand 203 states and 207 transitions. [2022-04-15 06:45:59,510 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 06:45:59,510 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 06:45:59,510 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-15 06:45:59,510 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-15 06:45:59,512 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:45:59,512 INFO L93 Difference]: Finished difference Result 203 states and 207 transitions. [2022-04-15 06:45:59,512 INFO L276 IsEmpty]: Start isEmpty. Operand 203 states and 207 transitions. [2022-04-15 06:45:59,513 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 06:45:59,513 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 06:45:59,513 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 06:45:59,513 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 06:45:59,513 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-15 06:45:59,514 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 123 states to 123 states and 126 transitions. [2022-04-15 06:45:59,514 INFO L78 Accepts]: Start accepts. Automaton has 123 states and 126 transitions. Word has length 117 [2022-04-15 06:45:59,514 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 06:45:59,514 INFO L478 AbstractCegarLoop]: Abstraction has 123 states and 126 transitions. [2022-04-15 06:45:59,514 INFO L479 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-15 06:45:59,514 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 123 states and 126 transitions. [2022-04-15 06:45:59,660 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-15 06:45:59,660 INFO L276 IsEmpty]: Start isEmpty. Operand 123 states and 126 transitions. [2022-04-15 06:45:59,661 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2022-04-15 06:45:59,661 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 06:45:59,661 INFO L499 BasicCegarLoop]: trace histogram [43, 42, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 06:45:59,679 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-15 06:45:59,877 WARN L460 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-15 06:45:59,877 INFO L403 AbstractCegarLoop]: === Iteration 33 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 06:45:59,877 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 06:45:59,878 INFO L85 PathProgramCache]: Analyzing trace with hash 483082060, now seen corresponding path program 30 times [2022-04-15 06:45:59,878 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 06:45:59,878 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1090135310] [2022-04-15 06:46:02,034 WARN L977 rdanLoopAcceleration]: Unable to prove correctness of quantifier elimination. [2022-04-15 06:46:02,086 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-15 06:46:02,295 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-15 06:46:02,296 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-15 06:46:02,298 INFO L85 PathProgramCache]: Analyzing trace with hash -2010798719, now seen corresponding path program 1 times [2022-04-15 06:46:02,298 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 06:46:02,298 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [599215536] [2022-04-15 06:46:02,298 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 06:46:02,298 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 06:46:02,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:46:02,787 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 06:46:02,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:46:02,797 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-15 06:46:02,798 INFO L290 TraceCheckUtils]: 1: Hoare triple {29311#true} assume true; {29311#true} is VALID [2022-04-15 06:46:02,798 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {29311#true} {29311#true} #52#return; {29311#true} is VALID [2022-04-15 06:46:02,798 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-15 06:46:02,798 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-15 06:46:02,798 INFO L290 TraceCheckUtils]: 2: Hoare triple {29311#true} assume true; {29311#true} is VALID [2022-04-15 06:46:02,798 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {29311#true} {29311#true} #52#return; {29311#true} is VALID [2022-04-15 06:46:02,798 INFO L272 TraceCheckUtils]: 4: Hoare triple {29311#true} call #t~ret9 := main(); {29311#true} is VALID [2022-04-15 06:46:02,799 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-15 06:46:02,799 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-15 06:46:02,800 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-15 06:46:02,801 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-15 06:46:02,801 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-15 06:46:02,802 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-15 06:46:02,802 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-15 06:46:02,802 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-15 06:46:02,803 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-15 06:46:02,803 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-15 06:46:02,804 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-15 06:46:02,804 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-15 06:46:02,805 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-15 06:46:02,805 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-15 06:46:02,806 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-15 06:46:02,806 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-15 06:46:02,807 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-15 06:46:02,807 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-15 06:46:02,808 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-15 06:46:02,808 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-15 06:46:02,809 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-15 06:46:02,809 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-15 06:46:02,810 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-15 06:46:02,810 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-15 06:46:02,810 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-15 06:46:02,811 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-15 06:46:02,811 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-15 06:46:02,812 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-15 06:46:02,812 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-15 06:46:02,813 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-15 06:46:02,813 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-15 06:46:02,813 INFO L290 TraceCheckUtils]: 36: Hoare triple {29312#false} ~cond := #in~cond; {29312#false} is VALID [2022-04-15 06:46:02,813 INFO L290 TraceCheckUtils]: 37: Hoare triple {29312#false} assume 0 == ~cond; {29312#false} is VALID [2022-04-15 06:46:02,813 INFO L290 TraceCheckUtils]: 38: Hoare triple {29312#false} assume !false; {29312#false} is VALID [2022-04-15 06:46:02,813 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-15 06:46:02,813 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 06:46:02,813 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [599215536] [2022-04-15 06:46:02,814 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [599215536] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 06:46:02,814 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1608151865] [2022-04-15 06:46:02,814 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 06:46:02,814 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 06:46:02,814 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 06:46:02,815 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-15 06:46:02,816 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-15 06:46:02,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:46:02,870 INFO L263 TraceCheckSpWp]: Trace formula consists of 179 conjuncts, 28 conjunts are in the unsatisfiable core [2022-04-15 06:46:02,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:46:02,886 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 06:46:03,938 INFO L272 TraceCheckUtils]: 0: Hoare triple {29311#true} call ULTIMATE.init(); {29311#true} is VALID [2022-04-15 06:46:03,938 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-15 06:46:03,938 INFO L290 TraceCheckUtils]: 2: Hoare triple {29311#true} assume true; {29311#true} is VALID [2022-04-15 06:46:03,938 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {29311#true} {29311#true} #52#return; {29311#true} is VALID [2022-04-15 06:46:03,938 INFO L272 TraceCheckUtils]: 4: Hoare triple {29311#true} call #t~ret9 := main(); {29311#true} is VALID [2022-04-15 06:46:03,938 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-15 06:46:03,939 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-15 06:46:03,939 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-15 06:46:03,940 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-15 06:46:03,940 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-15 06:46:03,941 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-15 06:46:03,941 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-15 06:46:03,942 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-15 06:46:03,942 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-15 06:46:03,943 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-15 06:46:03,943 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-15 06:46:03,944 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-15 06:46:03,944 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-15 06:46:03,945 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-15 06:46:03,945 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-15 06:46:03,946 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-15 06:46:03,946 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-15 06:46:03,946 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-15 06:46:03,947 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-15 06:46:03,947 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-15 06:46:03,948 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-15 06:46:03,948 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-15 06:46:03,949 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-15 06:46:03,949 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-15 06:46:03,950 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-15 06:46:03,950 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-15 06:46:03,951 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-15 06:46:03,951 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-15 06:46:03,952 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-15 06:46:03,952 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-15 06:46:03,952 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-15 06:46:03,952 INFO L290 TraceCheckUtils]: 36: Hoare triple {29312#false} ~cond := #in~cond; {29312#false} is VALID [2022-04-15 06:46:03,952 INFO L290 TraceCheckUtils]: 37: Hoare triple {29312#false} assume 0 == ~cond; {29312#false} is VALID [2022-04-15 06:46:03,952 INFO L290 TraceCheckUtils]: 38: Hoare triple {29312#false} assume !false; {29312#false} is VALID [2022-04-15 06:46:03,953 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-15 06:46:03,953 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 06:46:05,450 INFO L290 TraceCheckUtils]: 38: Hoare triple {29312#false} assume !false; {29312#false} is VALID [2022-04-15 06:46:05,450 INFO L290 TraceCheckUtils]: 37: Hoare triple {29312#false} assume 0 == ~cond; {29312#false} is VALID [2022-04-15 06:46:05,451 INFO L290 TraceCheckUtils]: 36: Hoare triple {29312#false} ~cond := #in~cond; {29312#false} is VALID [2022-04-15 06:46:05,451 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-15 06:46:05,451 INFO L290 TraceCheckUtils]: 34: Hoare triple {29499#(< main_~z~0 main_~y~0)} assume !(~y~0 > ~z~0); {29312#false} is VALID [2022-04-15 06:46:05,452 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-15 06:46:05,452 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-15 06:46:05,453 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-15 06:46:05,453 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-15 06:46:05,454 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-15 06:46:05,454 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-15 06:46:05,455 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-15 06:46:05,455 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-15 06:46:05,456 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-15 06:46:05,461 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-15 06:46:05,461 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-15 06:46:05,462 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-15 06:46:05,462 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-15 06:46:05,463 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-15 06:46:05,463 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-15 06:46:05,464 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-15 06:46:05,464 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-15 06:46:05,465 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-15 06:46:05,465 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-15 06:46:05,466 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-15 06:46:05,466 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-15 06:46:05,467 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-15 06:46:05,467 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-15 06:46:05,468 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-15 06:46:05,468 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-15 06:46:05,469 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-15 06:46:05,469 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-15 06:46:05,470 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-15 06:46:05,470 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-15 06:46:05,470 INFO L272 TraceCheckUtils]: 4: Hoare triple {29311#true} call #t~ret9 := main(); {29311#true} is VALID [2022-04-15 06:46:05,470 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {29311#true} {29311#true} #52#return; {29311#true} is VALID [2022-04-15 06:46:05,470 INFO L290 TraceCheckUtils]: 2: Hoare triple {29311#true} assume true; {29311#true} is VALID [2022-04-15 06:46:05,470 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-15 06:46:05,470 INFO L272 TraceCheckUtils]: 0: Hoare triple {29311#true} call ULTIMATE.init(); {29311#true} is VALID [2022-04-15 06:46:05,471 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-15 06:46:05,471 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1608151865] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 06:46:05,471 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 06:46:05,471 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [31, 27, 27] total 81 [2022-04-15 06:46:07,212 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 06:46:07,212 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1090135310] [2022-04-15 06:46:07,212 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1090135310] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 06:46:07,212 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 06:46:07,212 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [72] imperfect sequences [] total 72 [2022-04-15 06:46:07,212 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [116349436] [2022-04-15 06:46:07,212 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 06:46:07,213 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-15 06:46:07,219 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 06:46:07,219 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-15 06:46:07,320 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-15 06:46:07,321 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 72 states [2022-04-15 06:46:07,321 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 06:46:07,321 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 72 interpolants. [2022-04-15 06:46:07,322 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6244, Invalid=9256, Unknown=0, NotChecked=0, Total=15500 [2022-04-15 06:46:07,323 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-15 06:46:15,928 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:46:15,929 INFO L93 Difference]: Finished difference Result 325 states and 336 transitions. [2022-04-15 06:46:15,929 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 72 states. [2022-04-15 06:46:15,929 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-15 06:46:15,929 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 06:46:15,929 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-15 06:46:15,930 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 144 transitions. [2022-04-15 06:46:15,930 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-15 06:46:15,931 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 144 transitions. [2022-04-15 06:46:15,931 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 72 states and 144 transitions. [2022-04-15 06:46:16,037 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-15 06:46:16,040 INFO L225 Difference]: With dead ends: 325 [2022-04-15 06:46:16,040 INFO L226 Difference]: Without dead ends: 210 [2022-04-15 06:46:16,042 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 270 GetRequests, 76 SyntacticMatches, 2 SemanticMatches, 192 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10853 ImplicationChecksByTransitivity, 5.4s TimeCoverageRelationStatistics Valid=12539, Invalid=24903, Unknown=0, NotChecked=0, Total=37442 [2022-04-15 06:46:16,042 INFO L913 BasicCegarLoop]: 13 mSDtfsCounter, 326 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 4033 mSolverCounterSat, 350 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.2s 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.2s IncrementalHoareTripleChecker+Time [2022-04-15 06:46:16,042 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [326 Valid, 35 Invalid, 4383 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [350 Valid, 4033 Invalid, 0 Unknown, 0 Unchecked, 3.2s Time] [2022-04-15 06:46:16,042 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 210 states. [2022-04-15 06:46:16,457 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 210 to 210. [2022-04-15 06:46:16,457 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 06:46:16,457 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-15 06:46:16,458 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-15 06:46:16,458 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-15 06:46:16,460 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:46:16,460 INFO L93 Difference]: Finished difference Result 210 states and 214 transitions. [2022-04-15 06:46:16,460 INFO L276 IsEmpty]: Start isEmpty. Operand 210 states and 214 transitions. [2022-04-15 06:46:16,460 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 06:46:16,460 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 06:46:16,460 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-15 06:46:16,460 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-15 06:46:16,462 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:46:16,463 INFO L93 Difference]: Finished difference Result 210 states and 214 transitions. [2022-04-15 06:46:16,463 INFO L276 IsEmpty]: Start isEmpty. Operand 210 states and 214 transitions. [2022-04-15 06:46:16,463 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 06:46:16,463 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 06:46:16,463 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 06:46:16,463 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 06:46:16,463 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-15 06:46:16,465 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 210 states to 210 states and 214 transitions. [2022-04-15 06:46:16,466 INFO L78 Accepts]: Start accepts. Automaton has 210 states and 214 transitions. Word has length 122 [2022-04-15 06:46:16,466 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 06:46:16,466 INFO L478 AbstractCegarLoop]: Abstraction has 210 states and 214 transitions. [2022-04-15 06:46:16,466 INFO L479 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-15 06:46:16,466 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 210 states and 214 transitions. [2022-04-15 06:46:16,666 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-15 06:46:16,667 INFO L276 IsEmpty]: Start isEmpty. Operand 210 states and 214 transitions. [2022-04-15 06:46:16,667 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2022-04-15 06:46:16,667 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 06:46:16,667 INFO L499 BasicCegarLoop]: trace histogram [44, 43, 25, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 06:46:16,683 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-15 06:46:16,877 WARN L460 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-15 06:46:16,878 INFO L403 AbstractCegarLoop]: === Iteration 34 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 06:46:16,878 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 06:46:16,878 INFO L85 PathProgramCache]: Analyzing trace with hash 195292402, now seen corresponding path program 31 times [2022-04-15 06:46:16,878 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 06:46:16,878 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [724360038] [2022-04-15 06:46:20,937 WARN L977 rdanLoopAcceleration]: Unable to prove correctness of quantifier elimination. [2022-04-15 06:46:20,982 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-15 06:46:24,828 WARN L977 rdanLoopAcceleration]: Unable to prove correctness of quantifier elimination. [2022-04-15 06:46:24,951 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-15 06:46:24,952 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-15 06:46:24,954 INFO L85 PathProgramCache]: Analyzing trace with hash -554733822, now seen corresponding path program 1 times [2022-04-15 06:46:24,954 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 06:46:24,954 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1963178708] [2022-04-15 06:46:24,955 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 06:46:24,955 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 06:46:24,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:46:25,516 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 06:46:25,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:46:25,522 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-15 06:46:25,522 INFO L290 TraceCheckUtils]: 1: Hoare triple {31300#true} assume true; {31300#true} is VALID [2022-04-15 06:46:25,522 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {31300#true} {31300#true} #52#return; {31300#true} is VALID [2022-04-15 06:46:25,523 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-15 06:46:25,523 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-15 06:46:25,523 INFO L290 TraceCheckUtils]: 2: Hoare triple {31300#true} assume true; {31300#true} is VALID [2022-04-15 06:46:25,523 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {31300#true} {31300#true} #52#return; {31300#true} is VALID [2022-04-15 06:46:25,523 INFO L272 TraceCheckUtils]: 4: Hoare triple {31300#true} call #t~ret9 := main(); {31300#true} is VALID [2022-04-15 06:46:25,524 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-15 06:46:25,524 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-15 06:46:25,525 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-15 06:46:25,526 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-15 06:46:25,526 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-15 06:46:25,527 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-15 06:46:25,527 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-15 06:46:25,528 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-15 06:46:25,528 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-15 06:46:25,529 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-15 06:46:25,529 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-15 06:46:25,530 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-15 06:46:25,530 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-15 06:46:25,531 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-15 06:46:25,531 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-15 06:46:25,532 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-15 06:46:25,532 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-15 06:46:25,533 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-15 06:46:25,533 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-15 06:46:25,534 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-15 06:46:25,534 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-15 06:46:25,535 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-15 06:46:25,535 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-15 06:46:25,536 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-15 06:46:25,536 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-15 06:46:25,537 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-15 06:46:25,537 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-15 06:46:25,538 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-15 06:46:25,538 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-15 06:46:25,539 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-15 06:46:25,539 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-15 06:46:25,539 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-15 06:46:25,540 INFO L290 TraceCheckUtils]: 37: Hoare triple {31301#false} ~cond := #in~cond; {31301#false} is VALID [2022-04-15 06:46:25,540 INFO L290 TraceCheckUtils]: 38: Hoare triple {31301#false} assume 0 == ~cond; {31301#false} is VALID [2022-04-15 06:46:25,540 INFO L290 TraceCheckUtils]: 39: Hoare triple {31301#false} assume !false; {31301#false} is VALID [2022-04-15 06:46:25,540 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-15 06:46:25,540 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 06:46:25,540 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1963178708] [2022-04-15 06:46:25,540 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1963178708] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 06:46:25,540 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1437056275] [2022-04-15 06:46:25,540 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 06:46:25,541 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 06:46:25,541 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 06:46:25,541 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-15 06:46:25,542 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-15 06:46:25,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:46:25,591 INFO L263 TraceCheckSpWp]: Trace formula consists of 184 conjuncts, 32 conjunts are in the unsatisfiable core [2022-04-15 06:46:25,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:46:25,614 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 06:46:26,941 INFO L272 TraceCheckUtils]: 0: Hoare triple {31300#true} call ULTIMATE.init(); {31300#true} is VALID [2022-04-15 06:46:26,941 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-15 06:46:26,941 INFO L290 TraceCheckUtils]: 2: Hoare triple {31300#true} assume true; {31300#true} is VALID [2022-04-15 06:46:26,941 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {31300#true} {31300#true} #52#return; {31300#true} is VALID [2022-04-15 06:46:26,941 INFO L272 TraceCheckUtils]: 4: Hoare triple {31300#true} call #t~ret9 := main(); {31300#true} is VALID [2022-04-15 06:46:26,942 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-15 06:46:26,942 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-15 06:46:26,942 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-15 06:46:26,943 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-15 06:46:26,944 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-15 06:46:26,944 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-15 06:46:26,945 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-15 06:46:26,945 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-15 06:46:26,946 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-15 06:46:26,946 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-15 06:46:26,947 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-15 06:46:26,947 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-15 06:46:26,948 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-15 06:46:26,948 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-15 06:46:26,948 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-15 06:46:26,949 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-15 06:46:26,949 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-15 06:46:26,950 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-15 06:46:26,950 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-15 06:46:26,951 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-15 06:46:26,951 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-15 06:46:26,952 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-15 06:46:26,952 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-15 06:46:26,953 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-15 06:46:26,953 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-15 06:46:26,954 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-15 06:46:26,954 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-15 06:46:26,955 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-15 06:46:26,955 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-15 06:46:26,955 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-15 06:46:26,956 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-15 06:46:26,956 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-15 06:46:26,956 INFO L290 TraceCheckUtils]: 37: Hoare triple {31301#false} ~cond := #in~cond; {31301#false} is VALID [2022-04-15 06:46:26,956 INFO L290 TraceCheckUtils]: 38: Hoare triple {31301#false} assume 0 == ~cond; {31301#false} is VALID [2022-04-15 06:46:26,956 INFO L290 TraceCheckUtils]: 39: Hoare triple {31301#false} assume !false; {31301#false} is VALID [2022-04-15 06:46:26,956 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-15 06:46:26,957 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 06:46:28,944 INFO L290 TraceCheckUtils]: 39: Hoare triple {31301#false} assume !false; {31301#false} is VALID [2022-04-15 06:46:28,945 INFO L290 TraceCheckUtils]: 38: Hoare triple {31301#false} assume 0 == ~cond; {31301#false} is VALID [2022-04-15 06:46:28,945 INFO L290 TraceCheckUtils]: 37: Hoare triple {31301#false} ~cond := #in~cond; {31301#false} is VALID [2022-04-15 06:46:28,945 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-15 06:46:28,945 INFO L290 TraceCheckUtils]: 35: Hoare triple {31496#(< main_~z~0 main_~y~0)} assume !(~y~0 > ~z~0); {31301#false} is VALID [2022-04-15 06:46:28,946 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-15 06:46:28,946 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-15 06:46:28,946 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-15 06:46:28,947 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-15 06:46:28,947 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-15 06:46:28,948 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-15 06:46:28,948 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-15 06:46:28,949 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-15 06:46:28,949 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-15 06:46:28,950 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-15 06:46:28,950 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-15 06:46:28,951 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-15 06:46:28,953 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-15 06:46:28,953 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-15 06:46:28,954 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-15 06:46:28,954 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-15 06:46:28,955 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-15 06:46:28,955 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-15 06:46:28,956 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-15 06:46:28,956 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-15 06:46:28,957 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-15 06:46:28,957 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-15 06:46:28,957 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-15 06:46:28,958 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-15 06:46:28,958 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-15 06:46:28,959 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-15 06:46:28,960 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-15 06:46:28,960 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-15 06:46:28,961 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-15 06:46:28,961 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-15 06:46:28,961 INFO L272 TraceCheckUtils]: 4: Hoare triple {31300#true} call #t~ret9 := main(); {31300#true} is VALID [2022-04-15 06:46:28,961 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {31300#true} {31300#true} #52#return; {31300#true} is VALID [2022-04-15 06:46:28,961 INFO L290 TraceCheckUtils]: 2: Hoare triple {31300#true} assume true; {31300#true} is VALID [2022-04-15 06:46:28,961 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-15 06:46:28,962 INFO L272 TraceCheckUtils]: 0: Hoare triple {31300#true} call ULTIMATE.init(); {31300#true} is VALID [2022-04-15 06:46:28,962 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-15 06:46:28,962 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1437056275] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 06:46:28,962 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 06:46:28,962 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [32, 31, 31] total 90 [2022-04-15 06:46:31,708 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 06:46:31,709 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [724360038] [2022-04-15 06:46:31,709 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [724360038] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 06:46:31,709 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 06:46:31,709 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [74] imperfect sequences [] total 74 [2022-04-15 06:46:31,709 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1452362575] [2022-04-15 06:46:31,709 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 06:46:31,709 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-15 06:46:31,710 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 06:46:31,710 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-15 06:46:31,792 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-15 06:46:31,792 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 74 states [2022-04-15 06:46:31,793 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 06:46:31,793 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 74 interpolants. [2022-04-15 06:46:31,794 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=4639, Invalid=13451, Unknown=0, NotChecked=0, Total=18090 [2022-04-15 06:46:31,794 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-15 06:46:41,229 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:46:41,229 INFO L93 Difference]: Finished difference Result 328 states and 337 transitions. [2022-04-15 06:46:41,229 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2022-04-15 06:46:41,229 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-15 06:46:41,229 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 06:46:41,229 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-15 06:46:41,230 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 119 transitions. [2022-04-15 06:46:41,230 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-15 06:46:41,231 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 119 transitions. [2022-04-15 06:46:41,231 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 48 states and 119 transitions. [2022-04-15 06:46:41,320 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-15 06:46:41,323 INFO L225 Difference]: With dead ends: 328 [2022-04-15 06:46:41,323 INFO L226 Difference]: Without dead ends: 212 [2022-04-15 06:46:41,324 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 251 GetRequests, 71 SyntacticMatches, 2 SemanticMatches, 178 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7346 ImplicationChecksByTransitivity, 7.1s TimeCoverageRelationStatistics Valid=6220, Invalid=26000, Unknown=0, NotChecked=0, Total=32220 [2022-04-15 06:46:41,331 INFO L913 BasicCegarLoop]: 13 mSDtfsCounter, 55 mSDsluCounter, 242 mSDsCounter, 0 mSdLazyCounter, 4752 mSolverCounterSat, 50 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.5s 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.6s IncrementalHoareTripleChecker+Time [2022-04-15 06:46:41,331 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [55 Valid, 255 Invalid, 4802 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [50 Valid, 4752 Invalid, 0 Unknown, 0 Unchecked, 3.6s Time] [2022-04-15 06:46:41,332 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 212 states. [2022-04-15 06:46:41,735 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 212 to 212. [2022-04-15 06:46:41,735 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 06:46:41,736 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-15 06:46:41,736 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-15 06:46:41,736 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-15 06:46:41,738 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:46:41,738 INFO L93 Difference]: Finished difference Result 212 states and 216 transitions. [2022-04-15 06:46:41,738 INFO L276 IsEmpty]: Start isEmpty. Operand 212 states and 216 transitions. [2022-04-15 06:46:41,738 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 06:46:41,738 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 06:46:41,738 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-15 06:46:41,739 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-15 06:46:41,741 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:46:41,741 INFO L93 Difference]: Finished difference Result 212 states and 216 transitions. [2022-04-15 06:46:41,741 INFO L276 IsEmpty]: Start isEmpty. Operand 212 states and 216 transitions. [2022-04-15 06:46:41,741 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 06:46:41,741 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 06:46:41,741 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 06:46:41,741 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 06:46:41,741 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-15 06:46:41,743 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 212 states to 212 states and 216 transitions. [2022-04-15 06:46:41,744 INFO L78 Accepts]: Start accepts. Automaton has 212 states and 216 transitions. Word has length 125 [2022-04-15 06:46:41,744 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 06:46:41,744 INFO L478 AbstractCegarLoop]: Abstraction has 212 states and 216 transitions. [2022-04-15 06:46:41,744 INFO L479 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-15 06:46:41,744 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 212 states and 216 transitions. [2022-04-15 06:46:41,963 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-15 06:46:41,963 INFO L276 IsEmpty]: Start isEmpty. Operand 212 states and 216 transitions. [2022-04-15 06:46:41,964 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2022-04-15 06:46:41,964 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 06:46:41,964 INFO L499 BasicCegarLoop]: trace histogram [45, 44, 25, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 06:46:41,982 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-15 06:46:42,164 WARN L460 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-15 06:46:42,164 INFO L403 AbstractCegarLoop]: === Iteration 35 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 06:46:42,165 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 06:46:42,165 INFO L85 PathProgramCache]: Analyzing trace with hash 38437261, now seen corresponding path program 32 times [2022-04-15 06:46:42,165 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 06:46:42,165 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [37059505] [2022-04-15 06:46:46,229 WARN L977 rdanLoopAcceleration]: Unable to prove correctness of quantifier elimination. [2022-04-15 06:46:46,286 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-15 06:46:46,527 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-15 06:46:46,528 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-15 06:46:46,532 INFO L85 PathProgramCache]: Analyzing trace with hash 1060212738, now seen corresponding path program 1 times [2022-04-15 06:46:46,532 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 06:46:46,532 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [228805192] [2022-04-15 06:46:46,532 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 06:46:46,532 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 06:46:46,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:46:47,097 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 06:46:47,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:46:47,099 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-15 06:46:47,099 INFO L290 TraceCheckUtils]: 1: Hoare triple {33271#true} assume true; {33271#true} is VALID [2022-04-15 06:46:47,099 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {33271#true} {33271#true} #52#return; {33271#true} is VALID [2022-04-15 06:46:47,100 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-15 06:46:47,100 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-15 06:46:47,100 INFO L290 TraceCheckUtils]: 2: Hoare triple {33271#true} assume true; {33271#true} is VALID [2022-04-15 06:46:47,100 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {33271#true} {33271#true} #52#return; {33271#true} is VALID [2022-04-15 06:46:47,100 INFO L272 TraceCheckUtils]: 4: Hoare triple {33271#true} call #t~ret9 := main(); {33271#true} is VALID [2022-04-15 06:46:47,100 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-15 06:46:47,101 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-15 06:46:47,101 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-15 06:46:47,102 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-15 06:46:47,102 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-15 06:46:47,103 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-15 06:46:47,103 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-15 06:46:47,104 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-15 06:46:47,104 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-15 06:46:47,105 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-15 06:46:47,105 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-15 06:46:47,106 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-15 06:46:47,106 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-15 06:46:47,107 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-15 06:46:47,107 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-15 06:46:47,108 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-15 06:46:47,108 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-15 06:46:47,108 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-15 06:46:47,109 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-15 06:46:47,109 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-15 06:46:47,110 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-15 06:46:47,110 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-15 06:46:47,111 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-15 06:46:47,111 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-15 06:46:47,112 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-15 06:46:47,112 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-15 06:46:47,113 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-15 06:46:47,113 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-15 06:46:47,113 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-15 06:46:47,114 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-15 06:46:47,114 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-15 06:46:47,114 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-15 06:46:47,114 INFO L290 TraceCheckUtils]: 37: Hoare triple {33272#false} ~cond := #in~cond; {33272#false} is VALID [2022-04-15 06:46:47,114 INFO L290 TraceCheckUtils]: 38: Hoare triple {33272#false} assume 0 == ~cond; {33272#false} is VALID [2022-04-15 06:46:47,115 INFO L290 TraceCheckUtils]: 39: Hoare triple {33272#false} assume !false; {33272#false} is VALID [2022-04-15 06:46:47,115 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-15 06:46:47,115 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 06:46:47,115 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [228805192] [2022-04-15 06:46:47,115 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [228805192] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 06:46:47,115 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [785726312] [2022-04-15 06:46:47,115 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 06:46:47,115 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 06:46:47,115 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 06:46:47,116 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-15 06:46:47,117 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-15 06:46:47,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:46:47,160 INFO L263 TraceCheckSpWp]: Trace formula consists of 184 conjuncts, 29 conjunts are in the unsatisfiable core [2022-04-15 06:46:47,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:46:47,190 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 06:46:48,303 INFO L272 TraceCheckUtils]: 0: Hoare triple {33271#true} call ULTIMATE.init(); {33271#true} is VALID [2022-04-15 06:46:48,303 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-15 06:46:48,303 INFO L290 TraceCheckUtils]: 2: Hoare triple {33271#true} assume true; {33271#true} is VALID [2022-04-15 06:46:48,303 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {33271#true} {33271#true} #52#return; {33271#true} is VALID [2022-04-15 06:46:48,304 INFO L272 TraceCheckUtils]: 4: Hoare triple {33271#true} call #t~ret9 := main(); {33271#true} is VALID [2022-04-15 06:46:48,304 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-15 06:46:48,304 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-15 06:46:48,305 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-15 06:46:48,305 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-15 06:46:48,306 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-15 06:46:48,306 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-15 06:46:48,307 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-15 06:46:48,310 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-15 06:46:48,312 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-15 06:46:48,312 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-15 06:46:48,313 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-15 06:46:48,314 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-15 06:46:48,314 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-15 06:46:48,315 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-15 06:46:48,315 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-15 06:46:48,316 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-15 06:46:48,316 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-15 06:46:48,317 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-15 06:46:48,317 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-15 06:46:48,319 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-15 06:46:48,320 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-15 06:46:48,320 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-15 06:46:48,321 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-15 06:46:48,321 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-15 06:46:48,322 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-15 06:46:48,322 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-15 06:46:48,323 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-15 06:46:48,323 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-15 06:46:48,324 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-15 06:46:48,324 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-15 06:46:48,325 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-15 06:46:48,325 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-15 06:46:48,325 INFO L290 TraceCheckUtils]: 37: Hoare triple {33272#false} ~cond := #in~cond; {33272#false} is VALID [2022-04-15 06:46:48,325 INFO L290 TraceCheckUtils]: 38: Hoare triple {33272#false} assume 0 == ~cond; {33272#false} is VALID [2022-04-15 06:46:48,325 INFO L290 TraceCheckUtils]: 39: Hoare triple {33272#false} assume !false; {33272#false} is VALID [2022-04-15 06:46:48,325 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-15 06:46:48,325 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 06:46:49,880 INFO L290 TraceCheckUtils]: 39: Hoare triple {33272#false} assume !false; {33272#false} is VALID [2022-04-15 06:46:49,881 INFO L290 TraceCheckUtils]: 38: Hoare triple {33272#false} assume 0 == ~cond; {33272#false} is VALID [2022-04-15 06:46:49,897 INFO L290 TraceCheckUtils]: 37: Hoare triple {33272#false} ~cond := #in~cond; {33272#false} is VALID [2022-04-15 06:46:49,897 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-15 06:46:49,897 INFO L290 TraceCheckUtils]: 35: Hoare triple {33464#(< main_~z~0 main_~y~0)} assume !(~y~0 > ~z~0); {33272#false} is VALID [2022-04-15 06:46:49,898 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-15 06:46:49,898 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-15 06:46:49,899 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-15 06:46:49,899 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-15 06:46:49,900 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-15 06:46:49,900 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-15 06:46:49,901 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-15 06:46:49,901 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-15 06:46:49,901 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-15 06:46:49,902 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-15 06:46:49,902 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-15 06:46:49,903 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-15 06:46:49,903 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-15 06:46:49,915 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-15 06:46:49,915 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-15 06:46:49,916 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-15 06:46:49,916 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-15 06:46:49,916 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-15 06:46:49,917 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-15 06:46:49,917 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-15 06:46:49,918 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-15 06:46:49,918 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-15 06:46:49,919 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-15 06:46:49,919 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-15 06:46:49,920 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-15 06:46:49,920 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-15 06:46:49,921 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-15 06:46:49,922 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-15 06:46:49,922 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-15 06:46:49,923 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-15 06:46:49,923 INFO L272 TraceCheckUtils]: 4: Hoare triple {33271#true} call #t~ret9 := main(); {33271#true} is VALID [2022-04-15 06:46:49,923 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {33271#true} {33271#true} #52#return; {33271#true} is VALID [2022-04-15 06:46:49,923 INFO L290 TraceCheckUtils]: 2: Hoare triple {33271#true} assume true; {33271#true} is VALID [2022-04-15 06:46:49,923 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-15 06:46:49,923 INFO L272 TraceCheckUtils]: 0: Hoare triple {33271#true} call ULTIMATE.init(); {33271#true} is VALID [2022-04-15 06:46:49,923 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-15 06:46:49,923 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [785726312] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 06:46:49,924 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 06:46:49,924 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [32, 28, 28] total 84 [2022-04-15 06:46:51,764 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 06:46:51,764 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [37059505] [2022-04-15 06:46:51,764 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [37059505] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 06:46:51,764 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 06:46:51,764 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [75] imperfect sequences [] total 75 [2022-04-15 06:46:51,764 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [585709298] [2022-04-15 06:46:51,764 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 06:46:51,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-15 06:46:51,765 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 06:46:51,765 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-15 06:46:51,849 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-15 06:46:51,850 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 75 states [2022-04-15 06:46:51,850 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 06:46:51,850 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 75 interpolants. [2022-04-15 06:46:51,851 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6754, Invalid=10016, Unknown=0, NotChecked=0, Total=16770 [2022-04-15 06:46:51,851 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-15 06:47:01,287 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:47:01,287 INFO L93 Difference]: Finished difference Result 331 states and 341 transitions. [2022-04-15 06:47:01,287 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 75 states. [2022-04-15 06:47:01,287 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-15 06:47:01,288 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 06:47:01,288 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-15 06:47:01,289 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 148 transitions. [2022-04-15 06:47:01,289 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-15 06:47:01,289 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 148 transitions. [2022-04-15 06:47:01,290 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 75 states and 148 transitions. [2022-04-15 06:47:01,415 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-15 06:47:01,417 INFO L225 Difference]: With dead ends: 331 [2022-04-15 06:47:01,417 INFO L226 Difference]: Without dead ends: 215 [2022-04-15 06:47:01,428 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 280 GetRequests, 78 SyntacticMatches, 2 SemanticMatches, 200 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11782 ImplicationChecksByTransitivity, 5.8s TimeCoverageRelationStatistics Valid=13575, Invalid=27027, Unknown=0, NotChecked=0, Total=40602 [2022-04-15 06:47:01,428 INFO L913 BasicCegarLoop]: 13 mSDtfsCounter, 390 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 4470 mSolverCounterSat, 412 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.5s 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.6s IncrementalHoareTripleChecker+Time [2022-04-15 06:47:01,428 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [390 Valid, 35 Invalid, 4882 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [412 Valid, 4470 Invalid, 0 Unknown, 0 Unchecked, 3.6s Time] [2022-04-15 06:47:01,428 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 215 states. [2022-04-15 06:47:01,857 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 215 to 215. [2022-04-15 06:47:01,857 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 06:47:01,857 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-15 06:47:01,857 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-15 06:47:01,857 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-15 06:47:01,859 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:47:01,859 INFO L93 Difference]: Finished difference Result 215 states and 219 transitions. [2022-04-15 06:47:01,860 INFO L276 IsEmpty]: Start isEmpty. Operand 215 states and 219 transitions. [2022-04-15 06:47:01,860 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 06:47:01,860 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 06:47:01,860 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-15 06:47:01,860 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-15 06:47:01,862 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:47:01,862 INFO L93 Difference]: Finished difference Result 215 states and 219 transitions. [2022-04-15 06:47:01,862 INFO L276 IsEmpty]: Start isEmpty. Operand 215 states and 219 transitions. [2022-04-15 06:47:01,862 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 06:47:01,862 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 06:47:01,862 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 06:47:01,862 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 06:47:01,863 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-15 06:47:01,865 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 215 states to 215 states and 219 transitions. [2022-04-15 06:47:01,865 INFO L78 Accepts]: Start accepts. Automaton has 215 states and 219 transitions. Word has length 127 [2022-04-15 06:47:01,865 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 06:47:01,865 INFO L478 AbstractCegarLoop]: Abstraction has 215 states and 219 transitions. [2022-04-15 06:47:01,865 INFO L479 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-15 06:47:01,865 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 215 states and 219 transitions. [2022-04-15 06:47:02,060 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-15 06:47:02,061 INFO L276 IsEmpty]: Start isEmpty. Operand 215 states and 219 transitions. [2022-04-15 06:47:02,061 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2022-04-15 06:47:02,061 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 06:47:02,061 INFO L499 BasicCegarLoop]: trace histogram [46, 45, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 06:47:02,077 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (33)] Forceful destruction successful, exit code 0 [2022-04-15 06:47:02,261 WARN L460 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-15 06:47:02,262 INFO L403 AbstractCegarLoop]: === Iteration 36 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 06:47:02,262 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 06:47:02,262 INFO L85 PathProgramCache]: Analyzing trace with hash 1280005371, now seen corresponding path program 33 times [2022-04-15 06:47:02,262 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 06:47:02,262 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1661879652] [2022-04-15 06:47:06,325 WARN L977 rdanLoopAcceleration]: Unable to prove correctness of quantifier elimination. [2022-04-15 06:47:06,374 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-15 06:47:10,489 WARN L977 rdanLoopAcceleration]: Unable to prove correctness of quantifier elimination. [2022-04-15 06:47:10,586 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-15 06:47:10,587 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-15 06:47:10,589 INFO L85 PathProgramCache]: Analyzing trace with hash 1361097377, now seen corresponding path program 1 times [2022-04-15 06:47:10,590 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 06:47:10,590 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1505801963] [2022-04-15 06:47:10,590 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 06:47:10,590 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 06:47:10,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:47:11,114 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 06:47:11,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:47:11,117 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-15 06:47:11,117 INFO L290 TraceCheckUtils]: 1: Hoare triple {35309#true} assume true; {35309#true} is VALID [2022-04-15 06:47:11,117 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {35309#true} {35309#true} #52#return; {35309#true} is VALID [2022-04-15 06:47:11,119 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-15 06:47:11,119 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-15 06:47:11,119 INFO L290 TraceCheckUtils]: 2: Hoare triple {35309#true} assume true; {35309#true} is VALID [2022-04-15 06:47:11,119 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {35309#true} {35309#true} #52#return; {35309#true} is VALID [2022-04-15 06:47:11,119 INFO L272 TraceCheckUtils]: 4: Hoare triple {35309#true} call #t~ret9 := main(); {35309#true} is VALID [2022-04-15 06:47:11,120 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-15 06:47:11,120 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-15 06:47:11,121 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-15 06:47:11,121 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-15 06:47:11,122 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-15 06:47:11,122 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-15 06:47:11,123 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-15 06:47:11,123 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-15 06:47:11,124 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-15 06:47:11,124 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-15 06:47:11,125 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-15 06:47:11,125 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-15 06:47:11,126 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-15 06:47:11,126 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-15 06:47:11,126 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-15 06:47:11,127 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-15 06:47:11,127 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-15 06:47:11,128 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-15 06:47:11,128 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-15 06:47:11,129 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-15 06:47:11,129 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-15 06:47:11,130 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-15 06:47:11,130 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-15 06:47:11,131 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-15 06:47:11,131 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-15 06:47:11,131 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-15 06:47:11,132 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-15 06:47:11,132 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-15 06:47:11,133 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-15 06:47:11,133 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-15 06:47:11,134 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-15 06:47:11,134 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-15 06:47:11,134 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-15 06:47:11,134 INFO L290 TraceCheckUtils]: 38: Hoare triple {35310#false} ~cond := #in~cond; {35310#false} is VALID [2022-04-15 06:47:11,134 INFO L290 TraceCheckUtils]: 39: Hoare triple {35310#false} assume 0 == ~cond; {35310#false} is VALID [2022-04-15 06:47:11,134 INFO L290 TraceCheckUtils]: 40: Hoare triple {35310#false} assume !false; {35310#false} is VALID [2022-04-15 06:47:11,135 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-15 06:47:11,135 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 06:47:11,135 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1505801963] [2022-04-15 06:47:11,135 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1505801963] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 06:47:11,135 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [556017378] [2022-04-15 06:47:11,135 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 06:47:11,135 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 06:47:11,135 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 06:47:11,136 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-15 06:47:11,137 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-15 06:47:11,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:47:11,187 INFO L263 TraceCheckSpWp]: Trace formula consists of 189 conjuncts, 30 conjunts are in the unsatisfiable core [2022-04-15 06:47:11,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:47:11,204 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 06:47:12,373 INFO L272 TraceCheckUtils]: 0: Hoare triple {35309#true} call ULTIMATE.init(); {35309#true} is VALID [2022-04-15 06:47:12,373 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-15 06:47:12,373 INFO L290 TraceCheckUtils]: 2: Hoare triple {35309#true} assume true; {35309#true} is VALID [2022-04-15 06:47:12,373 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {35309#true} {35309#true} #52#return; {35309#true} is VALID [2022-04-15 06:47:12,373 INFO L272 TraceCheckUtils]: 4: Hoare triple {35309#true} call #t~ret9 := main(); {35309#true} is VALID [2022-04-15 06:47:12,374 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-15 06:47:12,374 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-15 06:47:12,374 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-15 06:47:12,375 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-15 06:47:12,376 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-15 06:47:12,376 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-15 06:47:12,376 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-15 06:47:12,377 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-15 06:47:12,377 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-15 06:47:12,378 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-15 06:47:12,378 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-15 06:47:12,379 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-15 06:47:12,379 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-15 06:47:12,380 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-15 06:47:12,380 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-15 06:47:12,381 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-15 06:47:12,381 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-15 06:47:12,382 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-15 06:47:12,382 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-15 06:47:12,383 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-15 06:47:12,383 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-15 06:47:12,383 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-15 06:47:12,384 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-15 06:47:12,384 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-15 06:47:12,385 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-15 06:47:12,385 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-15 06:47:12,386 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-15 06:47:12,386 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-15 06:47:12,387 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-15 06:47:12,387 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-15 06:47:12,388 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-15 06:47:12,388 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-15 06:47:12,388 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-15 06:47:12,388 INFO L290 TraceCheckUtils]: 38: Hoare triple {35310#false} ~cond := #in~cond; {35310#false} is VALID [2022-04-15 06:47:12,388 INFO L290 TraceCheckUtils]: 39: Hoare triple {35310#false} assume 0 == ~cond; {35310#false} is VALID [2022-04-15 06:47:12,388 INFO L290 TraceCheckUtils]: 40: Hoare triple {35310#false} assume !false; {35310#false} is VALID [2022-04-15 06:47:12,389 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-15 06:47:12,389 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 06:47:14,079 INFO L290 TraceCheckUtils]: 40: Hoare triple {35310#false} assume !false; {35310#false} is VALID [2022-04-15 06:47:14,080 INFO L290 TraceCheckUtils]: 39: Hoare triple {35310#false} assume 0 == ~cond; {35310#false} is VALID [2022-04-15 06:47:14,080 INFO L290 TraceCheckUtils]: 38: Hoare triple {35310#false} ~cond := #in~cond; {35310#false} is VALID [2022-04-15 06:47:14,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-15 06:47:14,080 INFO L290 TraceCheckUtils]: 36: Hoare triple {35507#(< main_~z~0 main_~y~0)} assume !(~y~0 > ~z~0); {35310#false} is VALID [2022-04-15 06:47:14,081 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-15 06:47:14,081 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-15 06:47:14,081 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-15 06:47:14,082 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-15 06:47:14,082 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-15 06:47:14,083 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-15 06:47:14,083 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-15 06:47:14,084 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-15 06:47:14,084 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-15 06:47:14,085 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-15 06:47:14,085 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-15 06:47:14,085 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-15 06:47:14,086 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-15 06:47:14,086 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-15 06:47:14,087 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-15 06:47:14,087 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-15 06:47:14,088 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-15 06:47:14,088 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-15 06:47:14,089 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-15 06:47:14,089 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-15 06:47:14,089 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-15 06:47:14,090 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-15 06:47:14,090 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-15 06:47:14,091 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-15 06:47:14,091 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-15 06:47:14,092 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-15 06:47:14,092 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-15 06:47:14,093 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-15 06:47:14,093 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-15 06:47:14,093 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-15 06:47:14,094 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-15 06:47:14,094 INFO L272 TraceCheckUtils]: 4: Hoare triple {35309#true} call #t~ret9 := main(); {35309#true} is VALID [2022-04-15 06:47:14,094 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {35309#true} {35309#true} #52#return; {35309#true} is VALID [2022-04-15 06:47:14,094 INFO L290 TraceCheckUtils]: 2: Hoare triple {35309#true} assume true; {35309#true} is VALID [2022-04-15 06:47:14,094 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-15 06:47:14,094 INFO L272 TraceCheckUtils]: 0: Hoare triple {35309#true} call ULTIMATE.init(); {35309#true} is VALID [2022-04-15 06:47:14,094 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-15 06:47:14,094 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [556017378] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 06:47:14,095 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 06:47:14,095 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [33, 29, 29] total 87 [2022-04-15 06:47:15,978 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 06:47:15,978 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1661879652] [2022-04-15 06:47:15,978 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1661879652] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 06:47:15,978 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 06:47:15,978 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [77] imperfect sequences [] total 77 [2022-04-15 06:47:15,978 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1622756359] [2022-04-15 06:47:15,978 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 06:47:15,978 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-15 06:47:15,979 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 06:47:15,979 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-15 06:47:16,066 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-15 06:47:16,066 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 77 states [2022-04-15 06:47:16,066 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 06:47:16,066 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 77 interpolants. [2022-04-15 06:47:16,067 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7200, Invalid=10622, Unknown=0, NotChecked=0, Total=17822 [2022-04-15 06:47:16,068 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-15 06:47:25,813 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:47:25,813 INFO L93 Difference]: Finished difference Result 335 states and 345 transitions. [2022-04-15 06:47:25,813 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 77 states. [2022-04-15 06:47:25,814 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-15 06:47:25,814 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 06:47:25,814 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-15 06:47:25,815 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 151 transitions. [2022-04-15 06:47:25,815 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-15 06:47:25,816 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 151 transitions. [2022-04-15 06:47:25,816 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 77 states and 151 transitions. [2022-04-15 06:47:25,933 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-15 06:47:25,936 INFO L225 Difference]: With dead ends: 335 [2022-04-15 06:47:25,936 INFO L226 Difference]: Without dead ends: 218 [2022-04-15 06:47:25,938 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 287 GetRequests, 79 SyntacticMatches, 2 SemanticMatches, 206 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12480 ImplicationChecksByTransitivity, 6.3s TimeCoverageRelationStatistics Valid=14455, Invalid=28601, Unknown=0, NotChecked=0, Total=43056 [2022-04-15 06:47:25,938 INFO L913 BasicCegarLoop]: 13 mSDtfsCounter, 200 mSDsluCounter, 42 mSDsCounter, 0 mSdLazyCounter, 4606 mSolverCounterSat, 226 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.6s 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.6s IncrementalHoareTripleChecker+Time [2022-04-15 06:47:25,938 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [200 Valid, 55 Invalid, 4832 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [226 Valid, 4606 Invalid, 0 Unknown, 0 Unchecked, 3.6s Time] [2022-04-15 06:47:25,939 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 218 states. [2022-04-15 06:47:26,374 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 218 to 218. [2022-04-15 06:47:26,375 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 06:47:26,375 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-15 06:47:26,375 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-15 06:47:26,375 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-15 06:47:26,377 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:47:26,377 INFO L93 Difference]: Finished difference Result 218 states and 222 transitions. [2022-04-15 06:47:26,377 INFO L276 IsEmpty]: Start isEmpty. Operand 218 states and 222 transitions. [2022-04-15 06:47:26,378 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 06:47:26,378 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 06:47:26,378 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-15 06:47:26,378 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-15 06:47:26,380 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:47:26,380 INFO L93 Difference]: Finished difference Result 218 states and 222 transitions. [2022-04-15 06:47:26,380 INFO L276 IsEmpty]: Start isEmpty. Operand 218 states and 222 transitions. [2022-04-15 06:47:26,380 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 06:47:26,380 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 06:47:26,380 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 06:47:26,380 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 06:47:26,381 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-15 06:47:26,383 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 218 states to 218 states and 222 transitions. [2022-04-15 06:47:26,383 INFO L78 Accepts]: Start accepts. Automaton has 218 states and 222 transitions. Word has length 130 [2022-04-15 06:47:26,383 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 06:47:26,383 INFO L478 AbstractCegarLoop]: Abstraction has 218 states and 222 transitions. [2022-04-15 06:47:26,383 INFO L479 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-15 06:47:26,383 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 218 states and 222 transitions. [2022-04-15 06:47:26,573 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-15 06:47:26,573 INFO L276 IsEmpty]: Start isEmpty. Operand 218 states and 222 transitions. [2022-04-15 06:47:26,574 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2022-04-15 06:47:26,574 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 06:47:26,574 INFO L499 BasicCegarLoop]: trace histogram [47, 46, 27, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 06:47:26,591 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-15 06:47:26,774 WARN L460 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-15 06:47:26,774 INFO L403 AbstractCegarLoop]: === Iteration 37 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 06:47:26,775 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 06:47:26,775 INFO L85 PathProgramCache]: Analyzing trace with hash 1124794915, now seen corresponding path program 34 times [2022-04-15 06:47:26,775 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 06:47:26,775 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [872235509] [2022-04-15 06:47:26,872 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-15 06:47:27,056 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-15 06:47:27,057 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-15 06:47:27,059 INFO L85 PathProgramCache]: Analyzing trace with hash 760333794, now seen corresponding path program 1 times [2022-04-15 06:47:27,059 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 06:47:27,059 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1924114908] [2022-04-15 06:47:27,059 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 06:47:27,059 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 06:47:27,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:47:27,561 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 06:47:27,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:47:27,564 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-15 06:47:27,564 INFO L290 TraceCheckUtils]: 1: Hoare triple {37381#true} assume true; {37381#true} is VALID [2022-04-15 06:47:27,564 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {37381#true} {37381#true} #52#return; {37381#true} is VALID [2022-04-15 06:47:27,565 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-15 06:47:27,565 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-15 06:47:27,565 INFO L290 TraceCheckUtils]: 2: Hoare triple {37381#true} assume true; {37381#true} is VALID [2022-04-15 06:47:27,565 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {37381#true} {37381#true} #52#return; {37381#true} is VALID [2022-04-15 06:47:27,565 INFO L272 TraceCheckUtils]: 4: Hoare triple {37381#true} call #t~ret9 := main(); {37381#true} is VALID [2022-04-15 06:47:27,565 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-15 06:47:27,566 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-15 06:47:27,566 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-15 06:47:27,567 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-15 06:47:27,567 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-15 06:47:27,568 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-15 06:47:27,568 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-15 06:47:27,568 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-15 06:47:27,569 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-15 06:47:27,569 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-15 06:47:27,570 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-15 06:47:27,570 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-15 06:47:27,571 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-15 06:47:27,571 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-15 06:47:27,572 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-15 06:47:27,572 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-15 06:47:27,573 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-15 06:47:27,573 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-15 06:47:27,573 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-15 06:47:27,574 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-15 06:47:27,574 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-15 06:47:27,575 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-15 06:47:27,575 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-15 06:47:27,576 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-15 06:47:27,576 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-15 06:47:27,577 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-15 06:47:27,577 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-15 06:47:27,578 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-15 06:47:27,578 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-15 06:47:27,579 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-15 06:47:27,579 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-15 06:47:27,579 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-15 06:47:27,580 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-15 06:47:27,580 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-15 06:47:27,580 INFO L290 TraceCheckUtils]: 39: Hoare triple {37382#false} ~cond := #in~cond; {37382#false} is VALID [2022-04-15 06:47:27,580 INFO L290 TraceCheckUtils]: 40: Hoare triple {37382#false} assume 0 == ~cond; {37382#false} is VALID [2022-04-15 06:47:27,580 INFO L290 TraceCheckUtils]: 41: Hoare triple {37382#false} assume !false; {37382#false} is VALID [2022-04-15 06:47:27,580 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-15 06:47:27,580 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 06:47:27,580 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1924114908] [2022-04-15 06:47:27,581 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1924114908] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 06:47:27,581 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1075737809] [2022-04-15 06:47:27,581 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 06:47:27,581 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 06:47:27,581 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 06:47:27,582 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-15 06:47:27,582 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-15 06:47:27,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:47:27,635 INFO L263 TraceCheckSpWp]: Trace formula consists of 194 conjuncts, 31 conjunts are in the unsatisfiable core [2022-04-15 06:47:27,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:47:27,654 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 06:47:28,835 INFO L272 TraceCheckUtils]: 0: Hoare triple {37381#true} call ULTIMATE.init(); {37381#true} is VALID [2022-04-15 06:47:28,835 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-15 06:47:28,835 INFO L290 TraceCheckUtils]: 2: Hoare triple {37381#true} assume true; {37381#true} is VALID [2022-04-15 06:47:28,835 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {37381#true} {37381#true} #52#return; {37381#true} is VALID [2022-04-15 06:47:28,835 INFO L272 TraceCheckUtils]: 4: Hoare triple {37381#true} call #t~ret9 := main(); {37381#true} is VALID [2022-04-15 06:47:28,836 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-15 06:47:28,836 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-15 06:47:28,836 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-15 06:47:28,837 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-15 06:47:28,837 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-15 06:47:28,838 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-15 06:47:28,838 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-15 06:47:28,839 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-15 06:47:28,839 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-15 06:47:28,840 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-15 06:47:28,840 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-15 06:47:28,841 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-15 06:47:28,841 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-15 06:47:28,842 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-15 06:47:28,842 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-15 06:47:28,843 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-15 06:47:28,843 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-15 06:47:28,843 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-15 06:47:28,844 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-15 06:47:28,844 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-15 06:47:28,845 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-15 06:47:28,845 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-15 06:47:28,846 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-15 06:47:28,846 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-15 06:47:28,847 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-15 06:47:28,847 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-15 06:47:28,848 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-15 06:47:28,848 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-15 06:47:28,848 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-15 06:47:28,849 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-15 06:47:28,849 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-15 06:47:28,850 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-15 06:47:28,850 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-15 06:47:28,850 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-15 06:47:28,850 INFO L290 TraceCheckUtils]: 39: Hoare triple {37382#false} ~cond := #in~cond; {37382#false} is VALID [2022-04-15 06:47:28,850 INFO L290 TraceCheckUtils]: 40: Hoare triple {37382#false} assume 0 == ~cond; {37382#false} is VALID [2022-04-15 06:47:28,851 INFO L290 TraceCheckUtils]: 41: Hoare triple {37382#false} assume !false; {37382#false} is VALID [2022-04-15 06:47:28,851 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-15 06:47:28,851 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 06:47:30,548 INFO L290 TraceCheckUtils]: 41: Hoare triple {37382#false} assume !false; {37382#false} is VALID [2022-04-15 06:47:30,549 INFO L290 TraceCheckUtils]: 40: Hoare triple {37382#false} assume 0 == ~cond; {37382#false} is VALID [2022-04-15 06:47:30,549 INFO L290 TraceCheckUtils]: 39: Hoare triple {37382#false} ~cond := #in~cond; {37382#false} is VALID [2022-04-15 06:47:30,549 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-15 06:47:30,549 INFO L290 TraceCheckUtils]: 37: Hoare triple {37581#(< main_~z~0 main_~y~0)} assume !(~y~0 > ~z~0); {37382#false} is VALID [2022-04-15 06:47:30,550 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-15 06:47:30,550 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-15 06:47:30,551 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-15 06:47:30,551 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-15 06:47:30,552 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-15 06:47:30,552 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-15 06:47:30,553 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-15 06:47:30,553 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-15 06:47:30,553 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-15 06:47:30,554 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-15 06:47:30,554 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-15 06:47:30,555 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-15 06:47:30,555 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-15 06:47:30,556 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-15 06:47:30,556 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-15 06:47:30,557 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-15 06:47:30,557 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-15 06:47:30,557 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-15 06:47:30,558 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-15 06:47:30,558 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-15 06:47:30,559 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-15 06:47:30,559 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-15 06:47:30,560 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-15 06:47:30,560 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-15 06:47:30,561 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-15 06:47:30,561 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-15 06:47:30,562 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-15 06:47:30,562 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-15 06:47:30,563 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-15 06:47:30,563 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-15 06:47:30,563 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-15 06:47:30,563 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-15 06:47:30,564 INFO L272 TraceCheckUtils]: 4: Hoare triple {37381#true} call #t~ret9 := main(); {37381#true} is VALID [2022-04-15 06:47:30,564 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {37381#true} {37381#true} #52#return; {37381#true} is VALID [2022-04-15 06:47:30,564 INFO L290 TraceCheckUtils]: 2: Hoare triple {37381#true} assume true; {37381#true} is VALID [2022-04-15 06:47:30,564 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-15 06:47:30,564 INFO L272 TraceCheckUtils]: 0: Hoare triple {37381#true} call ULTIMATE.init(); {37381#true} is VALID [2022-04-15 06:47:30,564 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-15 06:47:30,564 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1075737809] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 06:47:30,564 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 06:47:30,564 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [31, 30, 30] total 87 [2022-04-15 06:47:32,515 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 06:47:32,515 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [872235509] [2022-04-15 06:47:32,515 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [872235509] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 06:47:32,515 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 06:47:32,515 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [79] imperfect sequences [] total 79 [2022-04-15 06:47:32,515 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [285562403] [2022-04-15 06:47:32,515 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 06:47:32,516 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-15 06:47:32,516 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 06:47:32,516 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-15 06:47:32,604 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-15 06:47:32,604 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 79 states [2022-04-15 06:47:32,604 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 06:47:32,605 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 79 interpolants. [2022-04-15 06:47:32,606 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7454, Invalid=10636, Unknown=0, NotChecked=0, Total=18090 [2022-04-15 06:47:32,606 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-15 06:47:42,301 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:47:42,301 INFO L93 Difference]: Finished difference Result 349 states and 369 transitions. [2022-04-15 06:47:42,302 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 79 states. [2022-04-15 06:47:42,302 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-15 06:47:42,302 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 06:47:42,302 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-15 06:47:42,304 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 163 transitions. [2022-04-15 06:47:42,304 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-15 06:47:42,305 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 163 transitions. [2022-04-15 06:47:42,305 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 79 states and 163 transitions. [2022-04-15 06:47:42,442 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-15 06:47:42,445 INFO L225 Difference]: With dead ends: 349 [2022-04-15 06:47:42,445 INFO L226 Difference]: Without dead ends: 231 [2022-04-15 06:47:42,447 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 292 GetRequests, 81 SyntacticMatches, 2 SemanticMatches, 209 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12705 ImplicationChecksByTransitivity, 6.4s TimeCoverageRelationStatistics Valid=15174, Invalid=29136, Unknown=0, NotChecked=0, Total=44310 [2022-04-15 06:47:42,447 INFO L913 BasicCegarLoop]: 12 mSDtfsCounter, 107 mSDsluCounter, 27 mSDsCounter, 0 mSdLazyCounter, 4591 mSolverCounterSat, 192 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.5s 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.6s IncrementalHoareTripleChecker+Time [2022-04-15 06:47:42,448 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [107 Valid, 39 Invalid, 4783 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [192 Valid, 4591 Invalid, 0 Unknown, 0 Unchecked, 3.6s Time] [2022-04-15 06:47:42,448 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 231 states. [2022-04-15 06:47:42,693 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 231 to 139. [2022-04-15 06:47:42,694 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 06:47:42,694 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-15 06:47:42,694 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-15 06:47:42,694 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-15 06:47:42,697 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:47:42,697 INFO L93 Difference]: Finished difference Result 231 states and 235 transitions. [2022-04-15 06:47:42,697 INFO L276 IsEmpty]: Start isEmpty. Operand 231 states and 235 transitions. [2022-04-15 06:47:42,697 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 06:47:42,697 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 06:47:42,697 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-15 06:47:42,697 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-15 06:47:42,699 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:47:42,699 INFO L93 Difference]: Finished difference Result 231 states and 235 transitions. [2022-04-15 06:47:42,699 INFO L276 IsEmpty]: Start isEmpty. Operand 231 states and 235 transitions. [2022-04-15 06:47:42,700 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 06:47:42,700 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 06:47:42,700 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 06:47:42,700 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 06:47:42,700 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-15 06:47:42,701 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 139 states to 139 states and 142 transitions. [2022-04-15 06:47:42,701 INFO L78 Accepts]: Start accepts. Automaton has 139 states and 142 transitions. Word has length 133 [2022-04-15 06:47:42,701 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 06:47:42,701 INFO L478 AbstractCegarLoop]: Abstraction has 139 states and 142 transitions. [2022-04-15 06:47:42,701 INFO L479 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-15 06:47:42,702 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 139 states and 142 transitions. [2022-04-15 06:47:42,829 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-15 06:47:42,830 INFO L276 IsEmpty]: Start isEmpty. Operand 139 states and 142 transitions. [2022-04-15 06:47:42,830 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2022-04-15 06:47:42,830 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 06:47:42,830 INFO L499 BasicCegarLoop]: trace histogram [49, 48, 28, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 06:47:42,848 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (35)] Forceful destruction successful, exit code 0 [2022-04-15 06:47:43,030 WARN L460 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-15 06:47:43,031 INFO L403 AbstractCegarLoop]: === Iteration 38 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 06:47:43,031 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 06:47:43,031 INFO L85 PathProgramCache]: Analyzing trace with hash -2077295638, now seen corresponding path program 35 times [2022-04-15 06:47:43,031 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 06:47:43,031 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [691145738] [2022-04-15 06:47:45,295 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-15 06:47:45,499 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-15 06:47:45,500 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-15 06:47:45,502 INFO L85 PathProgramCache]: Analyzing trace with hash 780368065, now seen corresponding path program 1 times [2022-04-15 06:47:45,502 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 06:47:45,502 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1354735534] [2022-04-15 06:47:45,502 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 06:47:45,502 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 06:47:45,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:47:46,169 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 06:47:46,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:47:46,173 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-15 06:47:46,173 INFO L290 TraceCheckUtils]: 1: Hoare triple {39360#true} assume true; {39360#true} is VALID [2022-04-15 06:47:46,173 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {39360#true} {39360#true} #52#return; {39360#true} is VALID [2022-04-15 06:47:46,173 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-15 06:47:46,174 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-15 06:47:46,174 INFO L290 TraceCheckUtils]: 2: Hoare triple {39360#true} assume true; {39360#true} is VALID [2022-04-15 06:47:46,174 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {39360#true} {39360#true} #52#return; {39360#true} is VALID [2022-04-15 06:47:46,174 INFO L272 TraceCheckUtils]: 4: Hoare triple {39360#true} call #t~ret9 := main(); {39360#true} is VALID [2022-04-15 06:47:46,174 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-15 06:47:46,175 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-15 06:47:46,175 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-15 06:47:46,176 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-15 06:47:46,177 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-15 06:47:46,177 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-15 06:47:46,178 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-15 06:47:46,178 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-15 06:47:46,179 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-15 06:47:46,179 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-15 06:47:46,180 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-15 06:47:46,180 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-15 06:47:46,181 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-15 06:47:46,181 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-15 06:47:46,182 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-15 06:47:46,182 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-15 06:47:46,183 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-15 06:47:46,183 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-15 06:47:46,184 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-15 06:47:46,185 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-15 06:47:46,185 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-15 06:47:46,186 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-15 06:47:46,186 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-15 06:47:46,187 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-15 06:47:46,192 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-15 06:47:46,193 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-15 06:47:46,193 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-15 06:47:46,194 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-15 06:47:46,195 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-15 06:47:46,195 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-15 06:47:46,196 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-15 06:47:46,196 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-15 06:47:46,197 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-15 06:47:46,197 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-15 06:47:46,197 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-15 06:47:46,197 INFO L290 TraceCheckUtils]: 40: Hoare triple {39361#false} ~cond := #in~cond; {39361#false} is VALID [2022-04-15 06:47:46,197 INFO L290 TraceCheckUtils]: 41: Hoare triple {39361#false} assume 0 == ~cond; {39361#false} is VALID [2022-04-15 06:47:46,197 INFO L290 TraceCheckUtils]: 42: Hoare triple {39361#false} assume !false; {39361#false} is VALID [2022-04-15 06:47:46,198 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-15 06:47:46,198 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 06:47:46,198 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1354735534] [2022-04-15 06:47:46,198 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1354735534] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 06:47:46,198 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1896793965] [2022-04-15 06:47:46,198 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 06:47:46,198 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 06:47:46,198 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 06:47:46,199 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-15 06:47:46,202 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-15 06:47:46,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:47:46,254 INFO L263 TraceCheckSpWp]: Trace formula consists of 199 conjuncts, 35 conjunts are in the unsatisfiable core [2022-04-15 06:47:46,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:47:46,287 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 06:47:47,682 INFO L272 TraceCheckUtils]: 0: Hoare triple {39360#true} call ULTIMATE.init(); {39360#true} is VALID [2022-04-15 06:47:47,682 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-15 06:47:47,682 INFO L290 TraceCheckUtils]: 2: Hoare triple {39360#true} assume true; {39360#true} is VALID [2022-04-15 06:47:47,682 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {39360#true} {39360#true} #52#return; {39360#true} is VALID [2022-04-15 06:47:47,682 INFO L272 TraceCheckUtils]: 4: Hoare triple {39360#true} call #t~ret9 := main(); {39360#true} is VALID [2022-04-15 06:47:47,683 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-15 06:47:47,683 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-15 06:47:47,684 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-15 06:47:47,684 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-15 06:47:47,685 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-15 06:47:47,685 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-15 06:47:47,686 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-15 06:47:47,686 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-15 06:47:47,687 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-15 06:47:47,687 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-15 06:47:47,688 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-15 06:47:47,688 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-15 06:47:47,689 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-15 06:47:47,689 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-15 06:47:47,690 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-15 06:47:47,690 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-15 06:47:47,691 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-15 06:47:47,691 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-15 06:47:47,691 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-15 06:47:47,692 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-15 06:47:47,692 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-15 06:47:47,693 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-15 06:47:47,693 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-15 06:47:47,694 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-15 06:47:47,694 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-15 06:47:47,695 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-15 06:47:47,695 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-15 06:47:47,696 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-15 06:47:47,696 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-15 06:47:47,697 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-15 06:47:47,697 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-15 06:47:47,697 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-15 06:47:47,698 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-15 06:47:47,698 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-15 06:47:47,698 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-15 06:47:47,698 INFO L290 TraceCheckUtils]: 40: Hoare triple {39361#false} ~cond := #in~cond; {39361#false} is VALID [2022-04-15 06:47:47,699 INFO L290 TraceCheckUtils]: 41: Hoare triple {39361#false} assume 0 == ~cond; {39361#false} is VALID [2022-04-15 06:47:47,699 INFO L290 TraceCheckUtils]: 42: Hoare triple {39361#false} assume !false; {39361#false} is VALID [2022-04-15 06:47:47,699 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-15 06:47:47,699 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 06:47:49,735 INFO L290 TraceCheckUtils]: 42: Hoare triple {39361#false} assume !false; {39361#false} is VALID [2022-04-15 06:47:49,735 INFO L290 TraceCheckUtils]: 41: Hoare triple {39361#false} assume 0 == ~cond; {39361#false} is VALID [2022-04-15 06:47:49,735 INFO L290 TraceCheckUtils]: 40: Hoare triple {39361#false} ~cond := #in~cond; {39361#false} is VALID [2022-04-15 06:47:49,735 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-15 06:47:49,735 INFO L290 TraceCheckUtils]: 38: Hoare triple {39571#(< main_~z~0 main_~y~0)} assume !(~y~0 > ~z~0); {39361#false} is VALID [2022-04-15 06:47:49,736 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-15 06:47:49,736 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-15 06:47:49,737 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-15 06:47:49,737 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-15 06:47:49,738 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-15 06:47:49,738 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-15 06:47:49,739 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-15 06:47:49,739 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-15 06:47:49,740 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-15 06:47:49,740 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-15 06:47:49,740 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-15 06:47:49,741 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-15 06:47:49,741 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-15 06:47:49,742 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-15 06:47:49,742 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-15 06:47:49,743 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-15 06:47:49,743 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-15 06:47:49,744 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-15 06:47:49,744 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-15 06:47:49,744 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-15 06:47:49,745 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-15 06:47:49,745 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-15 06:47:49,746 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-15 06:47:49,746 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-15 06:47:49,747 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-15 06:47:49,747 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-15 06:47:49,748 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-15 06:47:49,748 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-15 06:47:49,748 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-15 06:47:49,749 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-15 06:47:49,750 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-15 06:47:49,750 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-15 06:47:49,751 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-15 06:47:49,751 INFO L272 TraceCheckUtils]: 4: Hoare triple {39360#true} call #t~ret9 := main(); {39360#true} is VALID [2022-04-15 06:47:49,751 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {39360#true} {39360#true} #52#return; {39360#true} is VALID [2022-04-15 06:47:49,751 INFO L290 TraceCheckUtils]: 2: Hoare triple {39360#true} assume true; {39360#true} is VALID [2022-04-15 06:47:49,751 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-15 06:47:49,751 INFO L272 TraceCheckUtils]: 0: Hoare triple {39360#true} call ULTIMATE.init(); {39360#true} is VALID [2022-04-15 06:47:49,751 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-15 06:47:49,752 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1896793965] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 06:47:49,752 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 06:47:49,752 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [35, 34, 34] total 99 [2022-04-15 06:47:52,415 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 06:47:52,415 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [691145738] [2022-04-15 06:47:52,415 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [691145738] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 06:47:52,415 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 06:47:52,415 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [82] imperfect sequences [] total 82 [2022-04-15 06:47:52,415 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1201065158] [2022-04-15 06:47:52,415 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 06:47:52,416 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-15 06:47:52,416 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 06:47:52,416 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-15 06:47:52,517 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-15 06:47:52,517 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 82 states [2022-04-15 06:47:52,517 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 06:47:52,518 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 82 interpolants. [2022-04-15 06:47:52,518 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6319, Invalid=15733, Unknown=0, NotChecked=0, Total=22052 [2022-04-15 06:47:52,519 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-15 06:48:04,226 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:48:04,227 INFO L93 Difference]: Finished difference Result 369 states and 380 transitions. [2022-04-15 06:48:04,227 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 82 states. [2022-04-15 06:48:04,227 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-15 06:48:04,227 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 06:48:04,227 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-15 06:48:04,228 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 160 transitions. [2022-04-15 06:48:04,228 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-15 06:48:04,229 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 160 transitions. [2022-04-15 06:48:04,229 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 82 states and 160 transitions. [2022-04-15 06:48:04,348 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-15 06:48:04,351 INFO L225 Difference]: With dead ends: 369 [2022-04-15 06:48:04,351 INFO L226 Difference]: Without dead ends: 238 [2022-04-15 06:48:04,353 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 304 GetRequests, 76 SyntacticMatches, 2 SemanticMatches, 226 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15454 ImplicationChecksByTransitivity, 8.4s TimeCoverageRelationStatistics Valid=12540, Invalid=39216, Unknown=0, NotChecked=0, Total=51756 [2022-04-15 06:48:04,353 INFO L913 BasicCegarLoop]: 12 mSDtfsCounter, 367 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 5124 mSolverCounterSat, 394 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.0s 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.0s IncrementalHoareTripleChecker+Time [2022-04-15 06:48:04,354 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [367 Valid, 24 Invalid, 5518 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [394 Valid, 5124 Invalid, 0 Unknown, 0 Unchecked, 4.0s Time] [2022-04-15 06:48:04,354 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 238 states. [2022-04-15 06:48:04,879 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 238 to 238. [2022-04-15 06:48:04,880 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 06:48:04,880 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-15 06:48:04,880 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-15 06:48:04,880 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-15 06:48:04,883 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:48:04,883 INFO L93 Difference]: Finished difference Result 238 states and 242 transitions. [2022-04-15 06:48:04,883 INFO L276 IsEmpty]: Start isEmpty. Operand 238 states and 242 transitions. [2022-04-15 06:48:04,883 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 06:48:04,883 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 06:48:04,883 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-15 06:48:04,884 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-15 06:48:04,886 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:48:04,886 INFO L93 Difference]: Finished difference Result 238 states and 242 transitions. [2022-04-15 06:48:04,886 INFO L276 IsEmpty]: Start isEmpty. Operand 238 states and 242 transitions. [2022-04-15 06:48:04,886 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 06:48:04,886 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 06:48:04,886 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 06:48:04,886 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 06:48:04,886 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-15 06:48:04,889 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 238 states to 238 states and 242 transitions. [2022-04-15 06:48:04,889 INFO L78 Accepts]: Start accepts. Automaton has 238 states and 242 transitions. Word has length 138 [2022-04-15 06:48:04,889 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 06:48:04,889 INFO L478 AbstractCegarLoop]: Abstraction has 238 states and 242 transitions. [2022-04-15 06:48:04,890 INFO L479 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-15 06:48:04,890 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 238 states and 242 transitions. [2022-04-15 06:48:05,107 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-15 06:48:05,107 INFO L276 IsEmpty]: Start isEmpty. Operand 238 states and 242 transitions. [2022-04-15 06:48:05,107 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2022-04-15 06:48:05,107 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 06:48:05,107 INFO L499 BasicCegarLoop]: trace histogram [50, 49, 29, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 06:48:05,123 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-15 06:48:05,308 WARN L460 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-15 06:48:05,308 INFO L403 AbstractCegarLoop]: === Iteration 39 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 06:48:05,308 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 06:48:05,308 INFO L85 PathProgramCache]: Analyzing trace with hash -1589924332, now seen corresponding path program 36 times [2022-04-15 06:48:05,308 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 06:48:05,308 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1236184677] [2022-04-15 06:48:07,364 WARN L977 rdanLoopAcceleration]: Unable to prove correctness of quantifier elimination. [2022-04-15 06:48:07,407 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-15 06:48:11,518 WARN L977 rdanLoopAcceleration]: Unable to prove correctness of quantifier elimination. [2022-04-15 06:48:11,633 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-15 06:48:11,634 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-15 06:48:11,636 INFO L85 PathProgramCache]: Analyzing trace with hash -464288830, now seen corresponding path program 1 times [2022-04-15 06:48:11,636 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 06:48:11,636 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [296441046] [2022-04-15 06:48:11,636 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 06:48:11,637 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 06:48:11,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:48:12,260 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 06:48:12,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:48:12,264 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-15 06:48:12,264 INFO L290 TraceCheckUtils]: 1: Hoare triple {41617#true} assume true; {41617#true} is VALID [2022-04-15 06:48:12,264 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {41617#true} {41617#true} #52#return; {41617#true} is VALID [2022-04-15 06:48:12,265 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-15 06:48:12,265 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-15 06:48:12,265 INFO L290 TraceCheckUtils]: 2: Hoare triple {41617#true} assume true; {41617#true} is VALID [2022-04-15 06:48:12,265 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {41617#true} {41617#true} #52#return; {41617#true} is VALID [2022-04-15 06:48:12,265 INFO L272 TraceCheckUtils]: 4: Hoare triple {41617#true} call #t~ret9 := main(); {41617#true} is VALID [2022-04-15 06:48:12,265 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-15 06:48:12,266 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-15 06:48:12,266 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-15 06:48:12,267 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-15 06:48:12,267 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-15 06:48:12,268 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-15 06:48:12,268 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-15 06:48:12,271 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-15 06:48:12,272 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-15 06:48:12,272 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-15 06:48:12,273 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-15 06:48:12,273 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-15 06:48:12,274 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-15 06:48:12,274 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-15 06:48:12,275 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-15 06:48:12,276 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-15 06:48:12,276 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-15 06:48:12,276 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-15 06:48:12,277 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-15 06:48:12,277 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-15 06:48:12,278 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-15 06:48:12,278 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-15 06:48:12,279 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-15 06:48:12,279 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-15 06:48:12,280 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-15 06:48:12,280 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-15 06:48:12,281 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-15 06:48:12,281 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-15 06:48:12,282 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-15 06:48:12,282 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-15 06:48:12,283 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-15 06:48:12,283 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-15 06:48:12,284 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-15 06:48:12,284 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-15 06:48:12,285 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-15 06:48:12,285 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-15 06:48:12,285 INFO L290 TraceCheckUtils]: 41: Hoare triple {41618#false} ~cond := #in~cond; {41618#false} is VALID [2022-04-15 06:48:12,285 INFO L290 TraceCheckUtils]: 42: Hoare triple {41618#false} assume 0 == ~cond; {41618#false} is VALID [2022-04-15 06:48:12,285 INFO L290 TraceCheckUtils]: 43: Hoare triple {41618#false} assume !false; {41618#false} is VALID [2022-04-15 06:48:12,285 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-15 06:48:12,285 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 06:48:12,285 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [296441046] [2022-04-15 06:48:12,286 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [296441046] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 06:48:12,286 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [127974781] [2022-04-15 06:48:12,286 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 06:48:12,286 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 06:48:12,286 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 06:48:12,287 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-15 06:48:12,288 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-15 06:48:12,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:48:12,334 INFO L263 TraceCheckSpWp]: Trace formula consists of 204 conjuncts, 36 conjunts are in the unsatisfiable core [2022-04-15 06:48:12,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:48:12,354 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 06:48:13,989 INFO L272 TraceCheckUtils]: 0: Hoare triple {41617#true} call ULTIMATE.init(); {41617#true} is VALID [2022-04-15 06:48:13,989 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-15 06:48:13,989 INFO L290 TraceCheckUtils]: 2: Hoare triple {41617#true} assume true; {41617#true} is VALID [2022-04-15 06:48:13,989 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {41617#true} {41617#true} #52#return; {41617#true} is VALID [2022-04-15 06:48:13,989 INFO L272 TraceCheckUtils]: 4: Hoare triple {41617#true} call #t~ret9 := main(); {41617#true} is VALID [2022-04-15 06:48:13,989 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-15 06:48:13,990 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-15 06:48:13,990 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-15 06:48:13,991 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-15 06:48:13,992 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-15 06:48:13,992 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-15 06:48:13,993 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-15 06:48:13,993 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-15 06:48:13,994 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-15 06:48:13,994 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-15 06:48:13,994 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-15 06:48:13,995 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-15 06:48:13,995 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-15 06:48:13,996 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-15 06:48:13,996 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-15 06:48:13,997 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-15 06:48:13,997 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-15 06:48:13,998 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-15 06:48:13,998 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-15 06:48:13,999 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-15 06:48:13,999 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-15 06:48:14,000 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-15 06:48:14,000 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-15 06:48:14,001 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-15 06:48:14,001 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-15 06:48:14,001 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-15 06:48:14,002 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-15 06:48:14,002 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-15 06:48:14,003 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-15 06:48:14,003 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-15 06:48:14,004 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-15 06:48:14,004 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-15 06:48:14,005 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-15 06:48:14,005 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-15 06:48:14,005 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-15 06:48:14,006 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-15 06:48:14,006 INFO L290 TraceCheckUtils]: 41: Hoare triple {41618#false} ~cond := #in~cond; {41618#false} is VALID [2022-04-15 06:48:14,006 INFO L290 TraceCheckUtils]: 42: Hoare triple {41618#false} assume 0 == ~cond; {41618#false} is VALID [2022-04-15 06:48:14,006 INFO L290 TraceCheckUtils]: 43: Hoare triple {41618#false} assume !false; {41618#false} is VALID [2022-04-15 06:48:14,006 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-15 06:48:14,006 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 06:48:16,428 INFO L290 TraceCheckUtils]: 43: Hoare triple {41618#false} assume !false; {41618#false} is VALID [2022-04-15 06:48:16,428 INFO L290 TraceCheckUtils]: 42: Hoare triple {41618#false} assume 0 == ~cond; {41618#false} is VALID [2022-04-15 06:48:16,428 INFO L290 TraceCheckUtils]: 41: Hoare triple {41618#false} ~cond := #in~cond; {41618#false} is VALID [2022-04-15 06:48:16,428 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-15 06:48:16,428 INFO L290 TraceCheckUtils]: 39: Hoare triple {41833#(< main_~z~0 main_~y~0)} assume !(~y~0 > ~z~0); {41618#false} is VALID [2022-04-15 06:48:16,429 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-15 06:48:16,429 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-15 06:48:16,430 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-15 06:48:16,430 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-15 06:48:16,431 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-15 06:48:16,431 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-15 06:48:16,432 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-15 06:48:16,432 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-15 06:48:16,432 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-15 06:48:16,433 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-15 06:48:16,433 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-15 06:48:16,434 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-15 06:48:16,434 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-15 06:48:16,435 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-15 06:48:16,435 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-15 06:48:16,436 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-15 06:48:16,436 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-15 06:48:16,436 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-15 06:48:16,437 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-15 06:48:16,437 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-15 06:48:16,438 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-15 06:48:16,438 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-15 06:48:16,439 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-15 06:48:16,439 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-15 06:48:16,440 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-15 06:48:16,440 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-15 06:48:16,440 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-15 06:48:16,441 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-15 06:48:16,441 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-15 06:48:16,442 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-15 06:48:16,442 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-15 06:48:16,443 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-15 06:48:16,444 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-15 06:48:16,444 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-15 06:48:16,444 INFO L272 TraceCheckUtils]: 4: Hoare triple {41617#true} call #t~ret9 := main(); {41617#true} is VALID [2022-04-15 06:48:16,444 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {41617#true} {41617#true} #52#return; {41617#true} is VALID [2022-04-15 06:48:16,444 INFO L290 TraceCheckUtils]: 2: Hoare triple {41617#true} assume true; {41617#true} is VALID [2022-04-15 06:48:16,444 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-15 06:48:16,444 INFO L272 TraceCheckUtils]: 0: Hoare triple {41617#true} call ULTIMATE.init(); {41617#true} is VALID [2022-04-15 06:48:16,445 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-15 06:48:16,445 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [127974781] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 06:48:16,445 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 06:48:16,445 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [36, 35, 35] total 102 [2022-04-15 06:48:19,831 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 06:48:19,831 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1236184677] [2022-04-15 06:48:19,831 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1236184677] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 06:48:19,831 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 06:48:19,831 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [84] imperfect sequences [] total 84 [2022-04-15 06:48:19,831 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1098574213] [2022-04-15 06:48:19,831 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 06:48:19,832 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-15 06:48:19,832 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 06:48:19,832 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-15 06:48:19,932 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-15 06:48:19,932 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 84 states [2022-04-15 06:48:19,932 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 06:48:19,932 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 84 interpolants. [2022-04-15 06:48:19,933 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5994, Invalid=17262, Unknown=0, NotChecked=0, Total=23256 [2022-04-15 06:48:19,933 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-15 06:48:31,680 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:48:31,680 INFO L93 Difference]: Finished difference Result 372 states and 381 transitions. [2022-04-15 06:48:31,680 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 54 states. [2022-04-15 06:48:31,681 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-15 06:48:31,681 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 06:48:31,681 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-15 06:48:31,681 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 131 transitions. [2022-04-15 06:48:31,682 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-15 06:48:31,682 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 131 transitions. [2022-04-15 06:48:31,682 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 54 states and 131 transitions. [2022-04-15 06:48:31,780 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-15 06:48:31,783 INFO L225 Difference]: With dead ends: 372 [2022-04-15 06:48:31,783 INFO L226 Difference]: Without dead ends: 240 [2022-04-15 06:48:31,785 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 281 GetRequests, 77 SyntacticMatches, 2 SemanticMatches, 202 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9140 ImplicationChecksByTransitivity, 9.0s TimeCoverageRelationStatistics Valid=7989, Invalid=33423, Unknown=0, NotChecked=0, Total=41412 [2022-04-15 06:48:31,786 INFO L913 BasicCegarLoop]: 13 mSDtfsCounter, 61 mSDsluCounter, 272 mSDsCounter, 0 mSdLazyCounter, 5998 mSolverCounterSat, 56 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.4s 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.4s IncrementalHoareTripleChecker+Time [2022-04-15 06:48:31,786 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [61 Valid, 285 Invalid, 6054 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [56 Valid, 5998 Invalid, 0 Unknown, 0 Unchecked, 4.4s Time] [2022-04-15 06:48:31,786 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 240 states. [2022-04-15 06:48:32,372 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 240 to 240. [2022-04-15 06:48:32,372 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 06:48:32,373 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-15 06:48:32,373 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-15 06:48:32,373 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-15 06:48:32,376 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:48:32,376 INFO L93 Difference]: Finished difference Result 240 states and 244 transitions. [2022-04-15 06:48:32,376 INFO L276 IsEmpty]: Start isEmpty. Operand 240 states and 244 transitions. [2022-04-15 06:48:32,376 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 06:48:32,376 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 06:48:32,376 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-15 06:48:32,376 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-15 06:48:32,378 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:48:32,379 INFO L93 Difference]: Finished difference Result 240 states and 244 transitions. [2022-04-15 06:48:32,379 INFO L276 IsEmpty]: Start isEmpty. Operand 240 states and 244 transitions. [2022-04-15 06:48:32,379 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 06:48:32,379 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 06:48:32,379 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 06:48:32,379 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 06:48:32,379 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-15 06:48:32,382 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 240 states to 240 states and 244 transitions. [2022-04-15 06:48:32,382 INFO L78 Accepts]: Start accepts. Automaton has 240 states and 244 transitions. Word has length 141 [2022-04-15 06:48:32,382 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 06:48:32,382 INFO L478 AbstractCegarLoop]: Abstraction has 240 states and 244 transitions. [2022-04-15 06:48:32,382 INFO L479 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-15 06:48:32,382 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 240 states and 244 transitions. [2022-04-15 06:48:32,613 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-15 06:48:32,614 INFO L276 IsEmpty]: Start isEmpty. Operand 240 states and 244 transitions. [2022-04-15 06:48:32,614 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2022-04-15 06:48:32,614 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 06:48:32,614 INFO L499 BasicCegarLoop]: trace histogram [51, 50, 29, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 06:48:32,637 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-15 06:48:32,815 WARN L460 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-15 06:48:32,815 INFO L403 AbstractCegarLoop]: === Iteration 40 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 06:48:32,815 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 06:48:32,816 INFO L85 PathProgramCache]: Analyzing trace with hash -1760318289, now seen corresponding path program 37 times [2022-04-15 06:48:32,816 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 06:48:32,816 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [540727728] [2022-04-15 06:48:36,878 WARN L977 rdanLoopAcceleration]: Unable to prove correctness of quantifier elimination. [2022-04-15 06:48:36,921 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-15 06:48:37,131 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-15 06:48:37,132 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-15 06:48:37,134 INFO L85 PathProgramCache]: Analyzing trace with hash 614278338, now seen corresponding path program 1 times [2022-04-15 06:48:37,134 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 06:48:37,134 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [942102367] [2022-04-15 06:48:37,134 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 06:48:37,135 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 06:48:37,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:48:37,761 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 06:48:37,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:48:37,767 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-15 06:48:37,767 INFO L290 TraceCheckUtils]: 1: Hoare triple {43842#true} assume true; {43842#true} is VALID [2022-04-15 06:48:37,767 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {43842#true} {43842#true} #52#return; {43842#true} is VALID [2022-04-15 06:48:37,768 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-15 06:48:37,768 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-15 06:48:37,768 INFO L290 TraceCheckUtils]: 2: Hoare triple {43842#true} assume true; {43842#true} is VALID [2022-04-15 06:48:37,768 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {43842#true} {43842#true} #52#return; {43842#true} is VALID [2022-04-15 06:48:37,768 INFO L272 TraceCheckUtils]: 4: Hoare triple {43842#true} call #t~ret9 := main(); {43842#true} is VALID [2022-04-15 06:48:37,778 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-15 06:48:37,779 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-15 06:48:37,779 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-15 06:48:37,780 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-15 06:48:37,780 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-15 06:48:37,781 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-15 06:48:37,781 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-15 06:48:37,782 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-15 06:48:37,782 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-15 06:48:37,783 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-15 06:48:37,783 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-15 06:48:37,784 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-15 06:48:37,784 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-15 06:48:37,785 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-15 06:48:37,785 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-15 06:48:37,786 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-15 06:48:37,786 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-15 06:48:37,787 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-15 06:48:37,787 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-15 06:48:37,788 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-15 06:48:37,788 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-15 06:48:37,789 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-15 06:48:37,789 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-15 06:48:37,790 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-15 06:48:37,790 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-15 06:48:37,791 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-15 06:48:37,791 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-15 06:48:37,792 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-15 06:48:37,792 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-15 06:48:37,793 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-15 06:48:37,793 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-15 06:48:37,794 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-15 06:48:37,794 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-15 06:48:37,795 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-15 06:48:37,795 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-15 06:48:37,795 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-15 06:48:37,795 INFO L290 TraceCheckUtils]: 41: Hoare triple {43843#false} ~cond := #in~cond; {43843#false} is VALID [2022-04-15 06:48:37,795 INFO L290 TraceCheckUtils]: 42: Hoare triple {43843#false} assume 0 == ~cond; {43843#false} is VALID [2022-04-15 06:48:37,795 INFO L290 TraceCheckUtils]: 43: Hoare triple {43843#false} assume !false; {43843#false} is VALID [2022-04-15 06:48:37,796 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-15 06:48:37,796 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 06:48:37,796 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [942102367] [2022-04-15 06:48:37,796 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [942102367] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 06:48:37,796 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1142031916] [2022-04-15 06:48:37,796 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 06:48:37,796 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 06:48:37,796 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 06:48:37,797 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-15 06:48:37,798 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-15 06:48:37,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:48:37,849 INFO L263 TraceCheckSpWp]: Trace formula consists of 204 conjuncts, 33 conjunts are in the unsatisfiable core [2022-04-15 06:48:37,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:48:37,868 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 06:48:39,422 INFO L272 TraceCheckUtils]: 0: Hoare triple {43842#true} call ULTIMATE.init(); {43842#true} is VALID [2022-04-15 06:48:39,423 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-15 06:48:39,423 INFO L290 TraceCheckUtils]: 2: Hoare triple {43842#true} assume true; {43842#true} is VALID [2022-04-15 06:48:39,423 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {43842#true} {43842#true} #52#return; {43842#true} is VALID [2022-04-15 06:48:39,423 INFO L272 TraceCheckUtils]: 4: Hoare triple {43842#true} call #t~ret9 := main(); {43842#true} is VALID [2022-04-15 06:48:39,423 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-15 06:48:39,424 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-15 06:48:39,424 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-15 06:48:39,425 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-15 06:48:39,425 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-15 06:48:39,426 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-15 06:48:39,426 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-15 06:48:39,427 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-15 06:48:39,427 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-15 06:48:39,428 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-15 06:48:39,428 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-15 06:48:39,428 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-15 06:48:39,429 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-15 06:48:39,429 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-15 06:48:39,430 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-15 06:48:39,430 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-15 06:48:39,431 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-15 06:48:39,431 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-15 06:48:39,432 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-15 06:48:39,432 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-15 06:48:39,433 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-15 06:48:39,433 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-15 06:48:39,434 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-15 06:48:39,434 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-15 06:48:39,435 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-15 06:48:39,435 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-15 06:48:39,435 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-15 06:48:39,436 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-15 06:48:39,436 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-15 06:48:39,437 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-15 06:48:39,437 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-15 06:48:39,438 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-15 06:48:39,438 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-15 06:48:39,439 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-15 06:48:39,439 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-15 06:48:39,439 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-15 06:48:39,439 INFO L290 TraceCheckUtils]: 41: Hoare triple {43843#false} ~cond := #in~cond; {43843#false} is VALID [2022-04-15 06:48:39,439 INFO L290 TraceCheckUtils]: 42: Hoare triple {43843#false} assume 0 == ~cond; {43843#false} is VALID [2022-04-15 06:48:39,439 INFO L290 TraceCheckUtils]: 43: Hoare triple {43843#false} assume !false; {43843#false} is VALID [2022-04-15 06:48:39,440 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-15 06:48:39,440 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 06:48:41,416 INFO L290 TraceCheckUtils]: 43: Hoare triple {43843#false} assume !false; {43843#false} is VALID [2022-04-15 06:48:41,417 INFO L290 TraceCheckUtils]: 42: Hoare triple {43843#false} assume 0 == ~cond; {43843#false} is VALID [2022-04-15 06:48:41,417 INFO L290 TraceCheckUtils]: 41: Hoare triple {43843#false} ~cond := #in~cond; {43843#false} is VALID [2022-04-15 06:48:41,417 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-15 06:48:41,417 INFO L290 TraceCheckUtils]: 39: Hoare triple {44055#(< main_~z~0 main_~y~0)} assume !(~y~0 > ~z~0); {43843#false} is VALID [2022-04-15 06:48:41,418 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-15 06:48:41,418 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-15 06:48:41,419 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-15 06:48:41,419 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-15 06:48:41,420 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-15 06:48:41,420 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-15 06:48:41,421 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-15 06:48:41,421 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-15 06:48:41,422 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-15 06:48:41,422 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-15 06:48:41,422 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-15 06:48:41,423 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-15 06:48:41,423 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-15 06:48:41,424 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-15 06:48:41,424 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-15 06:48:41,425 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-15 06:48:41,425 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-15 06:48:41,426 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-15 06:48:41,426 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-15 06:48:41,427 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-15 06:48:41,427 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-15 06:48:41,427 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-15 06:48:41,428 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-15 06:48:41,428 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-15 06:48:41,429 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-15 06:48:41,429 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-15 06:48:41,430 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-15 06:48:41,430 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-15 06:48:41,431 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-15 06:48:41,431 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-15 06:48:41,432 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-15 06:48:41,432 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-15 06:48:41,432 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-15 06:48:41,433 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-15 06:48:41,433 INFO L272 TraceCheckUtils]: 4: Hoare triple {43842#true} call #t~ret9 := main(); {43842#true} is VALID [2022-04-15 06:48:41,433 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {43842#true} {43842#true} #52#return; {43842#true} is VALID [2022-04-15 06:48:41,433 INFO L290 TraceCheckUtils]: 2: Hoare triple {43842#true} assume true; {43842#true} is VALID [2022-04-15 06:48:41,433 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-15 06:48:41,433 INFO L272 TraceCheckUtils]: 0: Hoare triple {43842#true} call ULTIMATE.init(); {43842#true} is VALID [2022-04-15 06:48:41,433 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-15 06:48:41,434 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1142031916] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 06:48:41,434 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 06:48:41,434 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [36, 32, 32] total 96 [2022-04-15 06:48:44,298 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 06:48:44,298 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [540727728] [2022-04-15 06:48:44,298 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [540727728] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 06:48:44,298 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 06:48:44,298 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [85] imperfect sequences [] total 85 [2022-04-15 06:48:44,298 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1282973532] [2022-04-15 06:48:44,298 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 06:48:44,299 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-15 06:48:44,299 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 06:48:44,299 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-15 06:48:44,394 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-15 06:48:44,395 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 85 states [2022-04-15 06:48:44,395 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 06:48:44,395 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 85 interpolants. [2022-04-15 06:48:44,396 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7537, Invalid=14219, Unknown=0, NotChecked=0, Total=21756 [2022-04-15 06:48:44,396 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-15 06:48:56,017 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:48:56,017 INFO L93 Difference]: Finished difference Result 374 states and 383 transitions. [2022-04-15 06:48:56,017 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 55 states. [2022-04-15 06:48:56,018 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-15 06:48:56,018 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 06:48:56,018 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-15 06:48:56,018 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 133 transitions. [2022-04-15 06:48:56,019 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-15 06:48:56,019 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 133 transitions. [2022-04-15 06:48:56,019 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 55 states and 133 transitions. [2022-04-15 06:48:56,122 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-15 06:48:56,124 INFO L225 Difference]: With dead ends: 374 [2022-04-15 06:48:56,125 INFO L226 Difference]: Without dead ends: 242 [2022-04-15 06:48:56,126 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 284 GetRequests, 84 SyntacticMatches, 2 SemanticMatches, 198 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9678 ImplicationChecksByTransitivity, 7.7s TimeCoverageRelationStatistics Valid=10921, Invalid=28879, Unknown=0, NotChecked=0, Total=39800 [2022-04-15 06:48:56,130 INFO L913 BasicCegarLoop]: 13 mSDtfsCounter, 62 mSDsluCounter, 282 mSDsCounter, 0 mSdLazyCounter, 6328 mSolverCounterSat, 57 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.6s 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.6s IncrementalHoareTripleChecker+Time [2022-04-15 06:48:56,130 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [62 Valid, 295 Invalid, 6385 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [57 Valid, 6328 Invalid, 0 Unknown, 0 Unchecked, 4.6s Time] [2022-04-15 06:48:56,130 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 242 states. [2022-04-15 06:48:56,650 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 242 to 242. [2022-04-15 06:48:56,650 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 06:48:56,651 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-15 06:48:56,651 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-15 06:48:56,651 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-15 06:48:56,653 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:48:56,653 INFO L93 Difference]: Finished difference Result 242 states and 246 transitions. [2022-04-15 06:48:56,653 INFO L276 IsEmpty]: Start isEmpty. Operand 242 states and 246 transitions. [2022-04-15 06:48:56,654 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 06:48:56,654 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 06:48:56,654 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-15 06:48:56,654 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-15 06:48:56,656 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:48:56,656 INFO L93 Difference]: Finished difference Result 242 states and 246 transitions. [2022-04-15 06:48:56,656 INFO L276 IsEmpty]: Start isEmpty. Operand 242 states and 246 transitions. [2022-04-15 06:48:56,656 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 06:48:56,656 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 06:48:56,656 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 06:48:56,656 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 06:48:56,657 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-15 06:48:56,659 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 242 states to 242 states and 246 transitions. [2022-04-15 06:48:56,659 INFO L78 Accepts]: Start accepts. Automaton has 242 states and 246 transitions. Word has length 143 [2022-04-15 06:48:56,659 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 06:48:56,659 INFO L478 AbstractCegarLoop]: Abstraction has 242 states and 246 transitions. [2022-04-15 06:48:56,660 INFO L479 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-15 06:48:56,660 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 242 states and 246 transitions. [2022-04-15 06:48:56,874 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-15 06:48:56,874 INFO L276 IsEmpty]: Start isEmpty. Operand 242 states and 246 transitions. [2022-04-15 06:48:56,875 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2022-04-15 06:48:56,875 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 06:48:56,875 INFO L499 BasicCegarLoop]: trace histogram [52, 51, 29, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 06:48:56,894 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-15 06:48:57,075 WARN L460 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-15 06:48:57,076 INFO L403 AbstractCegarLoop]: === Iteration 41 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 06:48:57,076 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 06:48:57,076 INFO L85 PathProgramCache]: Analyzing trace with hash 1994813578, now seen corresponding path program 38 times [2022-04-15 06:48:57,076 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 06:48:57,076 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1351634506] [2022-04-15 06:48:57,158 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-15 06:48:57,371 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-15 06:48:57,372 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-15 06:48:57,374 INFO L85 PathProgramCache]: Analyzing trace with hash 1692845506, now seen corresponding path program 1 times [2022-04-15 06:48:57,374 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 06:48:57,375 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [501528525] [2022-04-15 06:48:57,375 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 06:48:57,375 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 06:48:57,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:48:58,057 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 06:48:58,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:48:58,060 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-15 06:48:58,060 INFO L290 TraceCheckUtils]: 1: Hoare triple {46076#true} assume true; {46076#true} is VALID [2022-04-15 06:48:58,061 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {46076#true} {46076#true} #52#return; {46076#true} is VALID [2022-04-15 06:48:58,063 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-15 06:48:58,063 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-15 06:48:58,063 INFO L290 TraceCheckUtils]: 2: Hoare triple {46076#true} assume true; {46076#true} is VALID [2022-04-15 06:48:58,063 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {46076#true} {46076#true} #52#return; {46076#true} is VALID [2022-04-15 06:48:58,063 INFO L272 TraceCheckUtils]: 4: Hoare triple {46076#true} call #t~ret9 := main(); {46076#true} is VALID [2022-04-15 06:48:58,064 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-15 06:48:58,065 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-15 06:48:58,065 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-15 06:48:58,066 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-15 06:48:58,066 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-15 06:48:58,067 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-15 06:48:58,068 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-15 06:48:58,068 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-15 06:48:58,069 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-15 06:48:58,069 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-15 06:48:58,070 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-15 06:48:58,070 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-15 06:48:58,071 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-15 06:48:58,071 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-15 06:48:58,072 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-15 06:48:58,072 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-15 06:48:58,073 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-15 06:48:58,073 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-15 06:48:58,074 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-15 06:48:58,075 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-15 06:48:58,075 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-15 06:48:58,076 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-15 06:48:58,076 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-15 06:48:58,077 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-15 06:48:58,077 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-15 06:48:58,078 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-15 06:48:58,078 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-15 06:48:58,079 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-15 06:48:58,079 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-15 06:48:58,080 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-15 06:48:58,080 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-15 06:48:58,081 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-15 06:48:58,081 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-15 06:48:58,082 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-15 06:48:58,082 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-15 06:48:58,083 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-15 06:48:58,083 INFO L290 TraceCheckUtils]: 41: Hoare triple {46077#false} ~cond := #in~cond; {46077#false} is VALID [2022-04-15 06:48:58,083 INFO L290 TraceCheckUtils]: 42: Hoare triple {46077#false} assume 0 == ~cond; {46077#false} is VALID [2022-04-15 06:48:58,083 INFO L290 TraceCheckUtils]: 43: Hoare triple {46077#false} assume !false; {46077#false} is VALID [2022-04-15 06:48:58,083 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-15 06:48:58,083 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 06:48:58,083 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [501528525] [2022-04-15 06:48:58,083 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [501528525] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 06:48:58,083 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [451178445] [2022-04-15 06:48:58,083 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 06:48:58,084 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 06:48:58,084 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 06:48:58,084 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-15 06:48:58,085 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-15 06:48:58,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:48:58,139 INFO L263 TraceCheckSpWp]: Trace formula consists of 204 conjuncts, 36 conjunts are in the unsatisfiable core [2022-04-15 06:48:58,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:48:58,161 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 06:48:59,732 INFO L272 TraceCheckUtils]: 0: Hoare triple {46076#true} call ULTIMATE.init(); {46076#true} is VALID [2022-04-15 06:48:59,732 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-15 06:48:59,732 INFO L290 TraceCheckUtils]: 2: Hoare triple {46076#true} assume true; {46076#true} is VALID [2022-04-15 06:48:59,732 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {46076#true} {46076#true} #52#return; {46076#true} is VALID [2022-04-15 06:48:59,732 INFO L272 TraceCheckUtils]: 4: Hoare triple {46076#true} call #t~ret9 := main(); {46076#true} is VALID [2022-04-15 06:48:59,732 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-15 06:48:59,733 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-15 06:48:59,733 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-15 06:48:59,734 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-15 06:48:59,735 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-15 06:48:59,735 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-15 06:48:59,736 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-15 06:48:59,736 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-15 06:48:59,736 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-15 06:48:59,737 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-15 06:48:59,737 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-15 06:48:59,738 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-15 06:48:59,738 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-15 06:48:59,739 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-15 06:48:59,739 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-15 06:48:59,740 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-15 06:48:59,740 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-15 06:48:59,741 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-15 06:48:59,741 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-15 06:48:59,742 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-15 06:48:59,742 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-15 06:48:59,742 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-15 06:48:59,743 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-15 06:48:59,743 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-15 06:48:59,744 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-15 06:48:59,744 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-15 06:48:59,745 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-15 06:48:59,745 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-15 06:48:59,746 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-15 06:48:59,746 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-15 06:48:59,747 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-15 06:48:59,747 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-15 06:48:59,747 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-15 06:48:59,748 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-15 06:48:59,748 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-15 06:48:59,748 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-15 06:48:59,748 INFO L290 TraceCheckUtils]: 41: Hoare triple {46077#false} ~cond := #in~cond; {46077#false} is VALID [2022-04-15 06:48:59,749 INFO L290 TraceCheckUtils]: 42: Hoare triple {46077#false} assume 0 == ~cond; {46077#false} is VALID [2022-04-15 06:48:59,749 INFO L290 TraceCheckUtils]: 43: Hoare triple {46077#false} assume !false; {46077#false} is VALID [2022-04-15 06:48:59,749 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-15 06:48:59,749 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 06:49:02,215 INFO L290 TraceCheckUtils]: 43: Hoare triple {46077#false} assume !false; {46077#false} is VALID [2022-04-15 06:49:02,215 INFO L290 TraceCheckUtils]: 42: Hoare triple {46077#false} assume 0 == ~cond; {46077#false} is VALID [2022-04-15 06:49:02,215 INFO L290 TraceCheckUtils]: 41: Hoare triple {46077#false} ~cond := #in~cond; {46077#false} is VALID [2022-04-15 06:49:02,216 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-15 06:49:02,216 INFO L290 TraceCheckUtils]: 39: Hoare triple {46292#(< main_~z~0 main_~y~0)} assume !(~y~0 > ~z~0); {46077#false} is VALID [2022-04-15 06:49:02,216 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-15 06:49:02,217 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-15 06:49:02,217 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-15 06:49:02,218 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-15 06:49:02,218 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-15 06:49:02,219 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-15 06:49:02,219 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-15 06:49:02,220 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-15 06:49:02,220 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-15 06:49:02,221 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-15 06:49:02,221 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-15 06:49:02,222 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-15 06:49:02,222 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-15 06:49:02,223 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-15 06:49:02,224 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-15 06:49:02,224 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-15 06:49:02,225 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-15 06:49:02,225 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-15 06:49:02,226 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-15 06:49:02,226 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-15 06:49:02,227 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-15 06:49:02,227 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-15 06:49:02,228 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-15 06:49:02,228 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-15 06:49:02,229 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-15 06:49:02,229 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-15 06:49:02,230 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-15 06:49:02,230 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-15 06:49:02,231 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-15 06:49:02,231 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-15 06:49:02,232 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-15 06:49:02,233 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-15 06:49:02,233 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-15 06:49:02,234 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-15 06:49:02,234 INFO L272 TraceCheckUtils]: 4: Hoare triple {46076#true} call #t~ret9 := main(); {46076#true} is VALID [2022-04-15 06:49:02,234 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {46076#true} {46076#true} #52#return; {46076#true} is VALID [2022-04-15 06:49:02,234 INFO L290 TraceCheckUtils]: 2: Hoare triple {46076#true} assume true; {46076#true} is VALID [2022-04-15 06:49:02,234 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-15 06:49:02,234 INFO L272 TraceCheckUtils]: 0: Hoare triple {46076#true} call ULTIMATE.init(); {46076#true} is VALID [2022-04-15 06:49:02,234 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-15 06:49:02,235 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [451178445] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 06:49:02,235 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 06:49:02,235 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [36, 35, 35] total 102 [2022-04-15 06:49:05,804 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 06:49:05,804 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1351634506] [2022-04-15 06:49:05,804 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1351634506] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 06:49:05,804 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 06:49:05,804 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [86] imperfect sequences [] total 86 [2022-04-15 06:49:05,805 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [130547972] [2022-04-15 06:49:05,805 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 06:49:05,805 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-15 06:49:05,805 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 06:49:05,805 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-15 06:49:05,914 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-15 06:49:05,914 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 86 states [2022-04-15 06:49:05,914 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 06:49:05,914 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 86 interpolants. [2022-04-15 06:49:05,915 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6070, Invalid=17800, Unknown=0, NotChecked=0, Total=23870 [2022-04-15 06:49:05,915 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-15 06:49:18,832 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:49:18,832 INFO L93 Difference]: Finished difference Result 376 states and 385 transitions. [2022-04-15 06:49:18,832 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 56 states. [2022-04-15 06:49:18,832 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-15 06:49:18,833 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 06:49:18,833 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-15 06:49:18,834 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 135 transitions. [2022-04-15 06:49:18,834 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-15 06:49:18,835 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 135 transitions. [2022-04-15 06:49:18,835 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 56 states and 135 transitions. [2022-04-15 06:49:18,953 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-15 06:49:18,956 INFO L225 Difference]: With dead ends: 376 [2022-04-15 06:49:18,956 INFO L226 Difference]: Without dead ends: 244 [2022-04-15 06:49:18,957 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 287 GetRequests, 79 SyntacticMatches, 2 SemanticMatches, 206 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9643 ImplicationChecksByTransitivity, 9.3s TimeCoverageRelationStatistics Valid=8143, Invalid=34913, Unknown=0, NotChecked=0, Total=43056 [2022-04-15 06:49:18,958 INFO L913 BasicCegarLoop]: 13 mSDtfsCounter, 63 mSDsluCounter, 292 mSDsCounter, 0 mSdLazyCounter, 6674 mSolverCounterSat, 58 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.9s 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, 4.9s IncrementalHoareTripleChecker+Time [2022-04-15 06:49:18,958 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [63 Valid, 305 Invalid, 6732 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [58 Valid, 6674 Invalid, 0 Unknown, 0 Unchecked, 4.9s Time] [2022-04-15 06:49:18,958 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 244 states. [2022-04-15 06:49:19,500 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 244 to 244. [2022-04-15 06:49:19,500 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 06:49:19,501 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-15 06:49:19,501 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-15 06:49:19,501 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-15 06:49:19,503 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:49:19,503 INFO L93 Difference]: Finished difference Result 244 states and 248 transitions. [2022-04-15 06:49:19,503 INFO L276 IsEmpty]: Start isEmpty. Operand 244 states and 248 transitions. [2022-04-15 06:49:19,504 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 06:49:19,504 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 06:49:19,504 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-15 06:49:19,504 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-15 06:49:19,506 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:49:19,506 INFO L93 Difference]: Finished difference Result 244 states and 248 transitions. [2022-04-15 06:49:19,506 INFO L276 IsEmpty]: Start isEmpty. Operand 244 states and 248 transitions. [2022-04-15 06:49:19,506 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 06:49:19,507 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 06:49:19,507 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 06:49:19,507 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 06:49:19,507 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-15 06:49:19,509 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 244 states to 244 states and 248 transitions. [2022-04-15 06:49:19,510 INFO L78 Accepts]: Start accepts. Automaton has 244 states and 248 transitions. Word has length 145 [2022-04-15 06:49:19,510 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 06:49:19,510 INFO L478 AbstractCegarLoop]: Abstraction has 244 states and 248 transitions. [2022-04-15 06:49:19,510 INFO L479 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-15 06:49:19,510 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 244 states and 248 transitions. [2022-04-15 06:49:19,726 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-15 06:49:19,726 INFO L276 IsEmpty]: Start isEmpty. Operand 244 states and 248 transitions. [2022-04-15 06:49:19,727 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2022-04-15 06:49:19,727 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 06:49:19,727 INFO L499 BasicCegarLoop]: trace histogram [53, 52, 29, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 06:49:19,743 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (39)] Forceful destruction successful, exit code 0 [2022-04-15 06:49:19,927 WARN L460 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-15 06:49:19,928 INFO L403 AbstractCegarLoop]: === Iteration 42 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 06:49:19,928 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 06:49:19,928 INFO L85 PathProgramCache]: Analyzing trace with hash -1390958171, now seen corresponding path program 39 times [2022-04-15 06:49:19,928 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 06:49:19,928 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [645136826] [2022-04-15 06:49:22,128 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-15 06:49:22,322 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-15 06:49:22,323 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-15 06:49:22,325 INFO L85 PathProgramCache]: Analyzing trace with hash -1523554622, now seen corresponding path program 1 times [2022-04-15 06:49:22,325 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 06:49:22,325 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [163103328] [2022-04-15 06:49:22,325 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 06:49:22,325 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 06:49:22,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:49:22,947 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 06:49:22,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:49:22,950 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-15 06:49:22,950 INFO L290 TraceCheckUtils]: 1: Hoare triple {48331#true} assume true; {48331#true} is VALID [2022-04-15 06:49:22,951 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {48331#true} {48331#true} #52#return; {48331#true} is VALID [2022-04-15 06:49:22,951 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-15 06:49:22,951 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-15 06:49:22,951 INFO L290 TraceCheckUtils]: 2: Hoare triple {48331#true} assume true; {48331#true} is VALID [2022-04-15 06:49:22,951 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {48331#true} {48331#true} #52#return; {48331#true} is VALID [2022-04-15 06:49:22,951 INFO L272 TraceCheckUtils]: 4: Hoare triple {48331#true} call #t~ret9 := main(); {48331#true} is VALID [2022-04-15 06:49:22,952 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-15 06:49:22,952 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-15 06:49:22,953 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-15 06:49:22,953 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-15 06:49:22,954 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-15 06:49:22,954 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-15 06:49:22,955 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-15 06:49:22,955 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-15 06:49:22,956 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-15 06:49:22,956 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-15 06:49:22,957 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-15 06:49:22,957 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-15 06:49:22,957 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-15 06:49:22,958 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-15 06:49:22,958 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-15 06:49:22,959 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-15 06:49:22,959 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-15 06:49:22,960 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-15 06:49:22,960 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-15 06:49:22,961 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-15 06:49:22,961 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-15 06:49:22,962 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-15 06:49:22,962 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-15 06:49:22,963 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-15 06:49:22,963 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-15 06:49:22,963 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-15 06:49:22,964 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-15 06:49:22,964 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-15 06:49:22,965 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-15 06:49:22,965 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-15 06:49:22,966 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-15 06:49:22,966 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-15 06:49:22,967 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-15 06:49:22,967 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-15 06:49:22,967 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-15 06:49:22,968 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-15 06:49:22,968 INFO L290 TraceCheckUtils]: 41: Hoare triple {48332#false} ~cond := #in~cond; {48332#false} is VALID [2022-04-15 06:49:22,968 INFO L290 TraceCheckUtils]: 42: Hoare triple {48332#false} assume 0 == ~cond; {48332#false} is VALID [2022-04-15 06:49:22,968 INFO L290 TraceCheckUtils]: 43: Hoare triple {48332#false} assume !false; {48332#false} is VALID [2022-04-15 06:49:22,968 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-15 06:49:22,968 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 06:49:22,968 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [163103328] [2022-04-15 06:49:22,968 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [163103328] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 06:49:22,968 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1020248681] [2022-04-15 06:49:22,968 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 06:49:22,969 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 06:49:22,969 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 06:49:22,969 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-15 06:49:22,970 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-15 06:49:23,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:49:23,029 INFO L263 TraceCheckSpWp]: Trace formula consists of 204 conjuncts, 33 conjunts are in the unsatisfiable core [2022-04-15 06:49:23,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:49:23,049 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 06:49:24,553 INFO L272 TraceCheckUtils]: 0: Hoare triple {48331#true} call ULTIMATE.init(); {48331#true} is VALID [2022-04-15 06:49:24,554 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-15 06:49:24,554 INFO L290 TraceCheckUtils]: 2: Hoare triple {48331#true} assume true; {48331#true} is VALID [2022-04-15 06:49:24,554 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {48331#true} {48331#true} #52#return; {48331#true} is VALID [2022-04-15 06:49:24,554 INFO L272 TraceCheckUtils]: 4: Hoare triple {48331#true} call #t~ret9 := main(); {48331#true} is VALID [2022-04-15 06:49:24,554 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-15 06:49:24,554 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-15 06:49:24,555 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-15 06:49:24,556 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-15 06:49:24,556 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-15 06:49:24,556 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-15 06:49:24,557 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-15 06:49:24,557 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-15 06:49:24,558 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-15 06:49:24,558 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-15 06:49:24,559 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-15 06:49:24,559 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-15 06:49:24,560 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-15 06:49:24,560 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-15 06:49:24,561 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-15 06:49:24,561 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-15 06:49:24,561 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-15 06:49:24,562 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-15 06:49:24,562 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-15 06:49:24,563 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-15 06:49:24,563 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-15 06:49:24,564 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-15 06:49:24,564 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-15 06:49:24,565 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-15 06:49:24,565 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-15 06:49:24,566 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-15 06:49:24,566 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-15 06:49:24,567 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-15 06:49:24,567 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-15 06:49:24,567 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-15 06:49:24,568 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-15 06:49:24,568 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-15 06:49:24,569 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-15 06:49:24,569 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-15 06:49:24,570 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-15 06:49:24,570 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-15 06:49:24,570 INFO L290 TraceCheckUtils]: 41: Hoare triple {48332#false} ~cond := #in~cond; {48332#false} is VALID [2022-04-15 06:49:24,570 INFO L290 TraceCheckUtils]: 42: Hoare triple {48332#false} assume 0 == ~cond; {48332#false} is VALID [2022-04-15 06:49:24,570 INFO L290 TraceCheckUtils]: 43: Hoare triple {48332#false} assume !false; {48332#false} is VALID [2022-04-15 06:49:24,570 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-15 06:49:24,570 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 06:49:26,575 INFO L290 TraceCheckUtils]: 43: Hoare triple {48332#false} assume !false; {48332#false} is VALID [2022-04-15 06:49:26,575 INFO L290 TraceCheckUtils]: 42: Hoare triple {48332#false} assume 0 == ~cond; {48332#false} is VALID [2022-04-15 06:49:26,575 INFO L290 TraceCheckUtils]: 41: Hoare triple {48332#false} ~cond := #in~cond; {48332#false} is VALID [2022-04-15 06:49:26,575 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-15 06:49:26,576 INFO L290 TraceCheckUtils]: 39: Hoare triple {48544#(< main_~z~0 main_~y~0)} assume !(~y~0 > ~z~0); {48332#false} is VALID [2022-04-15 06:49:26,576 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-15 06:49:26,577 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-15 06:49:26,577 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-15 06:49:26,578 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-15 06:49:26,578 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-15 06:49:26,579 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-15 06:49:26,579 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-15 06:49:26,579 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-15 06:49:26,580 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-15 06:49:26,580 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-15 06:49:26,581 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-15 06:49:26,581 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-15 06:49:26,582 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-15 06:49:26,582 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-15 06:49:26,583 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-15 06:49:26,583 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-15 06:49:26,583 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-15 06:49:26,584 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-15 06:49:26,584 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-15 06:49:26,585 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-15 06:49:26,585 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-15 06:49:26,586 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-15 06:49:26,586 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-15 06:49:26,587 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-15 06:49:26,587 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-15 06:49:26,587 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-15 06:49:26,588 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-15 06:49:26,588 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-15 06:49:26,589 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-15 06:49:26,589 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-15 06:49:26,590 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-15 06:49:26,590 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-15 06:49:26,590 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-15 06:49:26,591 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-15 06:49:26,591 INFO L272 TraceCheckUtils]: 4: Hoare triple {48331#true} call #t~ret9 := main(); {48331#true} is VALID [2022-04-15 06:49:26,591 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {48331#true} {48331#true} #52#return; {48331#true} is VALID [2022-04-15 06:49:26,591 INFO L290 TraceCheckUtils]: 2: Hoare triple {48331#true} assume true; {48331#true} is VALID [2022-04-15 06:49:26,591 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-15 06:49:26,591 INFO L272 TraceCheckUtils]: 0: Hoare triple {48331#true} call ULTIMATE.init(); {48331#true} is VALID [2022-04-15 06:49:26,591 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-15 06:49:26,591 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1020248681] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 06:49:26,592 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 06:49:26,592 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [36, 32, 32] total 96 [2022-04-15 06:49:29,633 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 06:49:29,633 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [645136826] [2022-04-15 06:49:29,634 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [645136826] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 06:49:29,634 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 06:49:29,634 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [87] imperfect sequences [] total 87 [2022-04-15 06:49:29,634 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1556521703] [2022-04-15 06:49:29,634 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 06:49:29,634 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-15 06:49:29,635 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 06:49:29,635 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-15 06:49:29,749 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-15 06:49:29,749 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 87 states [2022-04-15 06:49:29,750 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 06:49:29,750 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 87 interpolants. [2022-04-15 06:49:29,751 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7663, Invalid=14687, Unknown=0, NotChecked=0, Total=22350 [2022-04-15 06:49:29,751 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-15 06:49:41,897 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:49:41,897 INFO L93 Difference]: Finished difference Result 378 states and 387 transitions. [2022-04-15 06:49:41,898 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 57 states. [2022-04-15 06:49:41,898 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-15 06:49:41,898 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 06:49:41,898 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-15 06:49:41,899 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 137 transitions. [2022-04-15 06:49:41,899 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-15 06:49:41,899 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 137 transitions. [2022-04-15 06:49:41,899 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 57 states and 137 transitions. [2022-04-15 06:49:42,003 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-15 06:49:42,006 INFO L225 Difference]: With dead ends: 378 [2022-04-15 06:49:42,006 INFO L226 Difference]: Without dead ends: 246 [2022-04-15 06:49:42,007 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 290 GetRequests, 86 SyntacticMatches, 2 SemanticMatches, 202 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10093 ImplicationChecksByTransitivity, 8.0s TimeCoverageRelationStatistics Valid=11177, Invalid=30235, Unknown=0, NotChecked=0, Total=41412 [2022-04-15 06:49:42,008 INFO L913 BasicCegarLoop]: 13 mSDtfsCounter, 64 mSDsluCounter, 282 mSDsCounter, 0 mSdLazyCounter, 6556 mSolverCounterSat, 59 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.9s 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, 4.9s IncrementalHoareTripleChecker+Time [2022-04-15 06:49:42,008 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [64 Valid, 295 Invalid, 6615 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [59 Valid, 6556 Invalid, 0 Unknown, 0 Unchecked, 4.9s Time] [2022-04-15 06:49:42,008 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 246 states. [2022-04-15 06:49:42,567 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 246 to 246. [2022-04-15 06:49:42,568 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 06:49:42,568 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-15 06:49:42,568 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-15 06:49:42,568 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-15 06:49:42,571 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:49:42,571 INFO L93 Difference]: Finished difference Result 246 states and 250 transitions. [2022-04-15 06:49:42,571 INFO L276 IsEmpty]: Start isEmpty. Operand 246 states and 250 transitions. [2022-04-15 06:49:42,571 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 06:49:42,571 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 06:49:42,571 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-15 06:49:42,571 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-15 06:49:42,573 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:49:42,574 INFO L93 Difference]: Finished difference Result 246 states and 250 transitions. [2022-04-15 06:49:42,574 INFO L276 IsEmpty]: Start isEmpty. Operand 246 states and 250 transitions. [2022-04-15 06:49:42,574 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 06:49:42,574 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 06:49:42,574 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 06:49:42,574 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 06:49:42,574 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-15 06:49:42,577 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 246 states to 246 states and 250 transitions. [2022-04-15 06:49:42,577 INFO L78 Accepts]: Start accepts. Automaton has 246 states and 250 transitions. Word has length 147 [2022-04-15 06:49:42,577 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 06:49:42,577 INFO L478 AbstractCegarLoop]: Abstraction has 246 states and 250 transitions. [2022-04-15 06:49:42,577 INFO L479 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-15 06:49:42,577 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 246 states and 250 transitions. [2022-04-15 06:49:42,792 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-15 06:49:42,792 INFO L276 IsEmpty]: Start isEmpty. Operand 246 states and 250 transitions. [2022-04-15 06:49:42,793 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 150 [2022-04-15 06:49:42,793 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 06:49:42,793 INFO L499 BasicCegarLoop]: trace histogram [54, 53, 29, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 06:49:42,811 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-15 06:49:43,007 WARN L460 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-15 06:49:43,007 INFO L403 AbstractCegarLoop]: === Iteration 43 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 06:49:43,007 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 06:49:43,008 INFO L85 PathProgramCache]: Analyzing trace with hash 467601408, now seen corresponding path program 40 times [2022-04-15 06:49:43,008 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 06:49:43,008 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [583112700] [2022-04-15 06:49:43,091 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-15 06:49:43,320 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-15 06:49:43,321 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-15 06:49:43,323 INFO L85 PathProgramCache]: Analyzing trace with hash -444987454, now seen corresponding path program 1 times [2022-04-15 06:49:43,323 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 06:49:43,323 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1491942306] [2022-04-15 06:49:43,323 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 06:49:43,323 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 06:49:43,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:49:43,893 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 06:49:43,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:49:43,896 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-15 06:49:43,897 INFO L290 TraceCheckUtils]: 1: Hoare triple {50595#true} assume true; {50595#true} is VALID [2022-04-15 06:49:43,897 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {50595#true} {50595#true} #52#return; {50595#true} is VALID [2022-04-15 06:49:43,897 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-15 06:49:43,897 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-15 06:49:43,897 INFO L290 TraceCheckUtils]: 2: Hoare triple {50595#true} assume true; {50595#true} is VALID [2022-04-15 06:49:43,897 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {50595#true} {50595#true} #52#return; {50595#true} is VALID [2022-04-15 06:49:43,898 INFO L272 TraceCheckUtils]: 4: Hoare triple {50595#true} call #t~ret9 := main(); {50595#true} is VALID [2022-04-15 06:49:43,898 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-15 06:49:43,898 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-15 06:49:43,899 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-15 06:49:43,899 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-15 06:49:43,900 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-15 06:49:43,900 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-15 06:49:43,901 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-15 06:49:43,901 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-15 06:49:43,902 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-15 06:49:43,902 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-15 06:49:43,903 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-15 06:49:43,903 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-15 06:49:43,903 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-15 06:49:43,904 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-15 06:49:43,904 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-15 06:49:43,905 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-15 06:49:43,905 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-15 06:49:43,906 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-15 06:49:43,906 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-15 06:49:43,907 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-15 06:49:43,907 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-15 06:49:43,908 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-15 06:49:43,908 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-15 06:49:43,909 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-15 06:49:43,909 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-15 06:49:43,909 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-15 06:49:43,910 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-15 06:49:43,910 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-15 06:49:43,911 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-15 06:49:43,911 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-15 06:49:43,912 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-15 06:49:43,912 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-15 06:49:43,913 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-15 06:49:43,913 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-15 06:49:43,913 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-15 06:49:43,913 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-15 06:49:43,914 INFO L290 TraceCheckUtils]: 41: Hoare triple {50596#false} ~cond := #in~cond; {50596#false} is VALID [2022-04-15 06:49:43,914 INFO L290 TraceCheckUtils]: 42: Hoare triple {50596#false} assume 0 == ~cond; {50596#false} is VALID [2022-04-15 06:49:43,914 INFO L290 TraceCheckUtils]: 43: Hoare triple {50596#false} assume !false; {50596#false} is VALID [2022-04-15 06:49:43,914 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-15 06:49:43,914 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 06:49:43,914 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1491942306] [2022-04-15 06:49:43,914 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1491942306] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 06:49:43,914 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [361125984] [2022-04-15 06:49:43,914 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 06:49:43,915 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 06:49:43,915 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 06:49:43,915 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-15 06:49:43,916 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-15 06:49:43,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:49:43,966 INFO L263 TraceCheckSpWp]: Trace formula consists of 204 conjuncts, 33 conjunts are in the unsatisfiable core [2022-04-15 06:49:43,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:49:43,985 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 06:49:45,211 INFO L272 TraceCheckUtils]: 0: Hoare triple {50595#true} call ULTIMATE.init(); {50595#true} is VALID [2022-04-15 06:49:45,212 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-15 06:49:45,212 INFO L290 TraceCheckUtils]: 2: Hoare triple {50595#true} assume true; {50595#true} is VALID [2022-04-15 06:49:45,212 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {50595#true} {50595#true} #52#return; {50595#true} is VALID [2022-04-15 06:49:45,212 INFO L272 TraceCheckUtils]: 4: Hoare triple {50595#true} call #t~ret9 := main(); {50595#true} is VALID [2022-04-15 06:49:45,212 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-15 06:49:45,213 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-15 06:49:45,213 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-15 06:49:45,214 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-15 06:49:45,214 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-15 06:49:45,215 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-15 06:49:45,215 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-15 06:49:45,216 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-15 06:49:45,216 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-15 06:49:45,216 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-15 06:49:45,217 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-15 06:49:45,217 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-15 06:49:45,218 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-15 06:49:45,218 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-15 06:49:45,219 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-15 06:49:45,219 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-15 06:49:45,220 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-15 06:49:45,220 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-15 06:49:45,221 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-15 06:49:45,221 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-15 06:49:45,222 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-15 06:49:45,222 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-15 06:49:45,222 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-15 06:49:45,223 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-15 06:49:45,223 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-15 06:49:45,224 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-15 06:49:45,224 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-15 06:49:45,225 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-15 06:49:45,225 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-15 06:49:45,226 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-15 06:49:45,226 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-15 06:49:45,227 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-15 06:49:45,227 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-15 06:49:45,228 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-15 06:49:45,228 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-15 06:49:45,228 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-15 06:49:45,228 INFO L290 TraceCheckUtils]: 41: Hoare triple {50596#false} ~cond := #in~cond; {50596#false} is VALID [2022-04-15 06:49:45,228 INFO L290 TraceCheckUtils]: 42: Hoare triple {50596#false} assume 0 == ~cond; {50596#false} is VALID [2022-04-15 06:49:45,228 INFO L290 TraceCheckUtils]: 43: Hoare triple {50596#false} assume !false; {50596#false} is VALID [2022-04-15 06:49:45,228 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-15 06:49:45,229 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 06:49:46,894 INFO L290 TraceCheckUtils]: 43: Hoare triple {50596#false} assume !false; {50596#false} is VALID [2022-04-15 06:49:46,895 INFO L290 TraceCheckUtils]: 42: Hoare triple {50596#false} assume 0 == ~cond; {50596#false} is VALID [2022-04-15 06:49:46,895 INFO L290 TraceCheckUtils]: 41: Hoare triple {50596#false} ~cond := #in~cond; {50596#false} is VALID [2022-04-15 06:49:46,895 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-15 06:49:46,895 INFO L290 TraceCheckUtils]: 39: Hoare triple {50806#(< main_~z~0 main_~y~0)} assume !(~y~0 > ~z~0); {50596#false} is VALID [2022-04-15 06:49:46,896 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-15 06:49:46,896 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-15 06:49:46,897 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-15 06:49:46,897 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-15 06:49:46,897 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-15 06:49:46,898 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-15 06:49:46,898 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-15 06:49:46,899 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-15 06:49:46,899 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-15 06:49:46,900 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-15 06:49:46,900 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-15 06:49:46,901 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-15 06:49:46,901 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-15 06:49:46,901 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-15 06:49:46,902 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-15 06:49:46,902 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-15 06:49:46,903 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-15 06:49:46,903 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-15 06:49:46,904 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-15 06:49:46,904 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-15 06:49:46,905 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-15 06:49:46,905 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-15 06:49:46,906 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-15 06:49:46,906 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-15 06:49:46,906 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-15 06:49:46,907 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-15 06:49:46,907 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-15 06:49:46,908 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-15 06:49:46,908 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-15 06:49:46,908 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-15 06:49:46,909 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-15 06:49:46,909 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-15 06:49:46,910 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-15 06:49:46,910 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-15 06:49:46,910 INFO L272 TraceCheckUtils]: 4: Hoare triple {50595#true} call #t~ret9 := main(); {50595#true} is VALID [2022-04-15 06:49:46,910 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {50595#true} {50595#true} #52#return; {50595#true} is VALID [2022-04-15 06:49:46,910 INFO L290 TraceCheckUtils]: 2: Hoare triple {50595#true} assume true; {50595#true} is VALID [2022-04-15 06:49:46,910 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-15 06:49:46,910 INFO L272 TraceCheckUtils]: 0: Hoare triple {50595#true} call ULTIMATE.init(); {50595#true} is VALID [2022-04-15 06:49:46,911 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-15 06:49:46,911 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [361125984] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 06:49:46,911 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 06:49:46,911 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [34, 32, 32] total 94 [2022-04-15 06:49:49,305 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 06:49:49,305 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [583112700] [2022-04-15 06:49:49,305 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [583112700] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 06:49:49,305 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 06:49:49,305 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [89] imperfect sequences [] total 89 [2022-04-15 06:49:49,305 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [456921735] [2022-04-15 06:49:49,305 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 06:49:49,306 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-15 06:49:49,306 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 06:49:49,306 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-15 06:49:49,406 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-15 06:49:49,406 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 89 states [2022-04-15 06:49:49,406 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 06:49:49,407 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 89 interpolants. [2022-04-15 06:49:49,408 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8114, Invalid=13938, Unknown=0, NotChecked=0, Total=22052 [2022-04-15 06:49:49,408 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-15 06:50:02,596 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:50:02,597 INFO L93 Difference]: Finished difference Result 394 states and 417 transitions. [2022-04-15 06:50:02,597 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 89 states. [2022-04-15 06:50:02,597 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-15 06:50:02,597 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 06:50:02,597 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-15 06:50:02,598 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 183 transitions. [2022-04-15 06:50:02,598 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-15 06:50:02,599 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 183 transitions. [2022-04-15 06:50:02,599 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 89 states and 183 transitions. [2022-04-15 06:50:02,756 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-15 06:50:02,760 INFO L225 Difference]: With dead ends: 394 [2022-04-15 06:50:02,760 INFO L226 Difference]: Without dead ends: 262 [2022-04-15 06:50:02,762 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 322 GetRequests, 87 SyntacticMatches, 2 SemanticMatches, 233 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17586 ImplicationChecksByTransitivity, 7.7s TimeCoverageRelationStatistics Valid=16731, Invalid=38259, Unknown=0, NotChecked=0, Total=54990 [2022-04-15 06:50:02,762 INFO L913 BasicCegarLoop]: 12 mSDtfsCounter, 235 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 6040 mSolverCounterSat, 330 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.8s 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, 4.8s IncrementalHoareTripleChecker+Time [2022-04-15 06:50:02,762 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [235 Valid, 34 Invalid, 6370 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [330 Valid, 6040 Invalid, 0 Unknown, 0 Unchecked, 4.8s Time] [2022-04-15 06:50:02,763 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 262 states. [2022-04-15 06:50:03,109 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 262 to 156. [2022-04-15 06:50:03,109 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 06:50:03,109 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-15 06:50:03,109 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-15 06:50:03,111 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-15 06:50:03,114 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:50:03,114 INFO L93 Difference]: Finished difference Result 262 states and 266 transitions. [2022-04-15 06:50:03,114 INFO L276 IsEmpty]: Start isEmpty. Operand 262 states and 266 transitions. [2022-04-15 06:50:03,114 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 06:50:03,114 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 06:50:03,114 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-15 06:50:03,114 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-15 06:50:03,117 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:50:03,117 INFO L93 Difference]: Finished difference Result 262 states and 266 transitions. [2022-04-15 06:50:03,117 INFO L276 IsEmpty]: Start isEmpty. Operand 262 states and 266 transitions. [2022-04-15 06:50:03,117 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 06:50:03,117 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 06:50:03,117 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 06:50:03,118 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 06:50:03,118 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-15 06:50:03,119 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 156 states to 156 states and 159 transitions. [2022-04-15 06:50:03,119 INFO L78 Accepts]: Start accepts. Automaton has 156 states and 159 transitions. Word has length 149 [2022-04-15 06:50:03,119 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 06:50:03,119 INFO L478 AbstractCegarLoop]: Abstraction has 156 states and 159 transitions. [2022-04-15 06:50:03,120 INFO L479 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-15 06:50:03,120 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 156 states and 159 transitions. [2022-04-15 06:50:03,278 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-15 06:50:03,278 INFO L276 IsEmpty]: Start isEmpty. Operand 156 states and 159 transitions. [2022-04-15 06:50:03,279 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2022-04-15 06:50:03,279 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 06:50:03,279 INFO L499 BasicCegarLoop]: trace histogram [56, 55, 31, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 06:50:03,295 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-15 06:50:03,479 WARN L460 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-15 06:50:03,479 INFO L403 AbstractCegarLoop]: === Iteration 44 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 06:50:03,479 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 06:50:03,480 INFO L85 PathProgramCache]: Analyzing trace with hash 504372054, now seen corresponding path program 41 times [2022-04-15 06:50:03,480 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 06:50:03,480 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [462604333] [2022-04-15 06:50:05,608 WARN L977 rdanLoopAcceleration]: Unable to prove correctness of quantifier elimination. [2022-04-15 06:50:05,651 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-15 06:50:05,845 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-15 06:50:05,846 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-15 06:50:05,848 INFO L85 PathProgramCache]: Analyzing trace with hash 121957538, now seen corresponding path program 1 times [2022-04-15 06:50:05,848 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 06:50:05,848 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [280911702] [2022-04-15 06:50:05,849 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 06:50:05,849 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 06:50:05,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:50:06,535 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 06:50:06,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:50:06,556 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-15 06:50:06,556 INFO L290 TraceCheckUtils]: 1: Hoare triple {52806#true} assume true; {52806#true} is VALID [2022-04-15 06:50:06,556 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {52806#true} {52806#true} #52#return; {52806#true} is VALID [2022-04-15 06:50:06,556 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-15 06:50:06,557 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-15 06:50:06,557 INFO L290 TraceCheckUtils]: 2: Hoare triple {52806#true} assume true; {52806#true} is VALID [2022-04-15 06:50:06,557 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {52806#true} {52806#true} #52#return; {52806#true} is VALID [2022-04-15 06:50:06,557 INFO L272 TraceCheckUtils]: 4: Hoare triple {52806#true} call #t~ret9 := main(); {52806#true} is VALID [2022-04-15 06:50:06,557 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-15 06:50:06,558 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-15 06:50:06,558 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-15 06:50:06,559 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-15 06:50:06,559 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-15 06:50:06,560 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-15 06:50:06,560 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-15 06:50:06,561 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-15 06:50:06,561 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-15 06:50:06,562 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-15 06:50:06,562 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-15 06:50:06,563 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-15 06:50:06,563 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-15 06:50:06,564 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-15 06:50:06,564 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-15 06:50:06,565 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-15 06:50:06,565 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-15 06:50:06,566 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-15 06:50:06,566 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-15 06:50:06,566 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-15 06:50:06,567 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-15 06:50:06,567 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-15 06:50:06,568 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-15 06:50:06,568 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-15 06:50:06,569 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-15 06:50:06,569 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-15 06:50:06,570 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-15 06:50:06,570 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-15 06:50:06,571 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-15 06:50:06,571 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-15 06:50:06,571 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-15 06:50:06,572 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-15 06:50:06,572 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-15 06:50:06,573 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-15 06:50:06,573 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-15 06:50:06,574 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-15 06:50:06,574 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-15 06:50:06,574 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-15 06:50:06,574 INFO L290 TraceCheckUtils]: 43: Hoare triple {52807#false} ~cond := #in~cond; {52807#false} is VALID [2022-04-15 06:50:06,574 INFO L290 TraceCheckUtils]: 44: Hoare triple {52807#false} assume 0 == ~cond; {52807#false} is VALID [2022-04-15 06:50:06,574 INFO L290 TraceCheckUtils]: 45: Hoare triple {52807#false} assume !false; {52807#false} is VALID [2022-04-15 06:50:06,575 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-15 06:50:06,575 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 06:50:06,575 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [280911702] [2022-04-15 06:50:06,575 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [280911702] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 06:50:06,575 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [674467916] [2022-04-15 06:50:06,575 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 06:50:06,575 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 06:50:06,575 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 06:50:06,576 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-15 06:50:06,577 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-15 06:50:06,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:50:06,626 INFO L263 TraceCheckSpWp]: Trace formula consists of 214 conjuncts, 35 conjunts are in the unsatisfiable core [2022-04-15 06:50:06,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:50:06,646 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 06:50:08,359 INFO L272 TraceCheckUtils]: 0: Hoare triple {52806#true} call ULTIMATE.init(); {52806#true} is VALID [2022-04-15 06:50:08,359 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-15 06:50:08,359 INFO L290 TraceCheckUtils]: 2: Hoare triple {52806#true} assume true; {52806#true} is VALID [2022-04-15 06:50:08,360 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {52806#true} {52806#true} #52#return; {52806#true} is VALID [2022-04-15 06:50:08,360 INFO L272 TraceCheckUtils]: 4: Hoare triple {52806#true} call #t~ret9 := main(); {52806#true} is VALID [2022-04-15 06:50:08,360 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-15 06:50:08,361 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-15 06:50:08,361 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-15 06:50:08,362 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-15 06:50:08,362 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-15 06:50:08,363 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-15 06:50:08,363 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-15 06:50:08,364 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-15 06:50:08,364 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-15 06:50:08,365 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-15 06:50:08,365 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-15 06:50:08,366 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-15 06:50:08,366 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-15 06:50:08,367 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-15 06:50:08,367 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-15 06:50:08,368 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-15 06:50:08,368 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-15 06:50:08,369 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-15 06:50:08,369 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-15 06:50:08,369 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-15 06:50:08,370 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-15 06:50:08,370 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-15 06:50:08,371 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-15 06:50:08,371 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-15 06:50:08,372 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-15 06:50:08,372 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-15 06:50:08,373 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-15 06:50:08,373 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-15 06:50:08,374 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-15 06:50:08,374 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-15 06:50:08,375 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-15 06:50:08,375 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-15 06:50:08,376 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-15 06:50:08,376 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-15 06:50:08,377 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-15 06:50:08,377 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-15 06:50:08,377 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-15 06:50:08,377 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-15 06:50:08,378 INFO L290 TraceCheckUtils]: 43: Hoare triple {52807#false} ~cond := #in~cond; {52807#false} is VALID [2022-04-15 06:50:08,378 INFO L290 TraceCheckUtils]: 44: Hoare triple {52807#false} assume 0 == ~cond; {52807#false} is VALID [2022-04-15 06:50:08,378 INFO L290 TraceCheckUtils]: 45: Hoare triple {52807#false} assume !false; {52807#false} is VALID [2022-04-15 06:50:08,378 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-15 06:50:08,378 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 06:50:10,616 INFO L290 TraceCheckUtils]: 45: Hoare triple {52807#false} assume !false; {52807#false} is VALID [2022-04-15 06:50:10,617 INFO L290 TraceCheckUtils]: 44: Hoare triple {52807#false} assume 0 == ~cond; {52807#false} is VALID [2022-04-15 06:50:10,617 INFO L290 TraceCheckUtils]: 43: Hoare triple {52807#false} ~cond := #in~cond; {52807#false} is VALID [2022-04-15 06:50:10,617 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-15 06:50:10,617 INFO L290 TraceCheckUtils]: 41: Hoare triple {53029#(< main_~z~0 main_~y~0)} assume !(~y~0 > ~z~0); {52807#false} is VALID [2022-04-15 06:50:10,618 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-15 06:50:10,618 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-15 06:50:10,619 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-15 06:50:10,619 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-15 06:50:10,620 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-15 06:50:10,620 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-15 06:50:10,621 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-15 06:50:10,622 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-15 06:50:10,622 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-15 06:50:10,623 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-15 06:50:10,623 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-15 06:50:10,624 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-15 06:50:10,624 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-15 06:50:10,625 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-15 06:50:10,625 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-15 06:50:10,626 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-15 06:50:10,626 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-15 06:50:10,627 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-15 06:50:10,627 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-15 06:50:10,628 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-15 06:50:10,628 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-15 06:50:10,629 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-15 06:50:10,629 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-15 06:50:10,630 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-15 06:50:10,630 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-15 06:50:10,631 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-15 06:50:10,631 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-15 06:50:10,632 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-15 06:50:10,632 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-15 06:50:10,633 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-15 06:50:10,633 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-15 06:50:10,634 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-15 06:50:10,634 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-15 06:50:10,635 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-15 06:50:10,635 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-15 06:50:10,636 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-15 06:50:10,636 INFO L272 TraceCheckUtils]: 4: Hoare triple {52806#true} call #t~ret9 := main(); {52806#true} is VALID [2022-04-15 06:50:10,636 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {52806#true} {52806#true} #52#return; {52806#true} is VALID [2022-04-15 06:50:10,636 INFO L290 TraceCheckUtils]: 2: Hoare triple {52806#true} assume true; {52806#true} is VALID [2022-04-15 06:50:10,636 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-15 06:50:10,636 INFO L272 TraceCheckUtils]: 0: Hoare triple {52806#true} call ULTIMATE.init(); {52806#true} is VALID [2022-04-15 06:50:10,636 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-15 06:50:10,637 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [674467916] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 06:50:10,637 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 06:50:10,637 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [38, 34, 34] total 102 [2022-04-15 06:50:13,967 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 06:50:13,968 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [462604333] [2022-04-15 06:50:13,968 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [462604333] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 06:50:13,968 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 06:50:13,968 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [92] imperfect sequences [] total 92 [2022-04-15 06:50:13,968 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1044328863] [2022-04-15 06:50:13,968 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 06:50:13,968 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-15 06:50:13,968 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 06:50:13,969 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-15 06:50:14,074 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-15 06:50:14,074 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 92 states [2022-04-15 06:50:14,075 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 06:50:14,075 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 92 interpolants. [2022-04-15 06:50:14,076 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8651, Invalid=16471, Unknown=0, NotChecked=0, Total=25122 [2022-04-15 06:50:14,076 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-15 06:50:27,704 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:50:27,704 INFO L93 Difference]: Finished difference Result 416 states and 426 transitions. [2022-04-15 06:50:27,704 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 60 states. [2022-04-15 06:50:27,704 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-15 06:50:27,704 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 06:50:27,705 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-15 06:50:27,705 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 144 transitions. [2022-04-15 06:50:27,705 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-15 06:50:27,706 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 144 transitions. [2022-04-15 06:50:27,706 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 60 states and 144 transitions. [2022-04-15 06:50:27,817 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-15 06:50:27,820 INFO L225 Difference]: With dead ends: 416 [2022-04-15 06:50:27,820 INFO L226 Difference]: Without dead ends: 268 [2022-04-15 06:50:27,822 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 305 GetRequests, 89 SyntacticMatches, 2 SemanticMatches, 214 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11313 ImplicationChecksByTransitivity, 9.0s TimeCoverageRelationStatistics Valid=12588, Invalid=33852, Unknown=0, NotChecked=0, Total=46440 [2022-04-15 06:50:27,822 INFO L913 BasicCegarLoop]: 13 mSDtfsCounter, 67 mSDsluCounter, 302 mSDsCounter, 0 mSdLazyCounter, 7384 mSolverCounterSat, 63 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.4s 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.4s IncrementalHoareTripleChecker+Time [2022-04-15 06:50:27,822 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [67 Valid, 315 Invalid, 7447 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [63 Valid, 7384 Invalid, 0 Unknown, 0 Unchecked, 5.4s Time] [2022-04-15 06:50:27,822 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 268 states. [2022-04-15 06:50:28,494 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 268 to 268. [2022-04-15 06:50:28,494 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 06:50:28,494 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-15 06:50:28,494 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-15 06:50:28,494 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-15 06:50:28,497 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:50:28,497 INFO L93 Difference]: Finished difference Result 268 states and 272 transitions. [2022-04-15 06:50:28,497 INFO L276 IsEmpty]: Start isEmpty. Operand 268 states and 272 transitions. [2022-04-15 06:50:28,497 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 06:50:28,497 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 06:50:28,498 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-15 06:50:28,498 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-15 06:50:28,500 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:50:28,500 INFO L93 Difference]: Finished difference Result 268 states and 272 transitions. [2022-04-15 06:50:28,500 INFO L276 IsEmpty]: Start isEmpty. Operand 268 states and 272 transitions. [2022-04-15 06:50:28,500 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 06:50:28,500 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 06:50:28,501 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 06:50:28,501 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 06:50:28,501 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-15 06:50:28,504 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 268 states to 268 states and 272 transitions. [2022-04-15 06:50:28,504 INFO L78 Accepts]: Start accepts. Automaton has 268 states and 272 transitions. Word has length 155 [2022-04-15 06:50:28,504 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 06:50:28,504 INFO L478 AbstractCegarLoop]: Abstraction has 268 states and 272 transitions. [2022-04-15 06:50:28,504 INFO L479 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-15 06:50:28,504 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 268 states and 272 transitions. [2022-04-15 06:50:28,772 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-15 06:50:28,772 INFO L276 IsEmpty]: Start isEmpty. Operand 268 states and 272 transitions. [2022-04-15 06:50:28,773 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 158 [2022-04-15 06:50:28,773 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 06:50:28,773 INFO L499 BasicCegarLoop]: trace histogram [57, 56, 31, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 06:50:28,789 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-15 06:50:28,978 WARN L460 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-15 06:50:28,978 INFO L403 AbstractCegarLoop]: === Iteration 45 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 06:50:28,979 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 06:50:28,979 INFO L85 PathProgramCache]: Analyzing trace with hash -1427312975, now seen corresponding path program 42 times [2022-04-15 06:50:28,979 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 06:50:28,979 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1998787863] [2022-04-15 06:50:31,049 WARN L977 rdanLoopAcceleration]: Unable to prove correctness of quantifier elimination. [2022-04-15 06:50:31,099 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-15 06:50:35,219 WARN L977 rdanLoopAcceleration]: Unable to prove correctness of quantifier elimination. [2022-04-15 06:50:35,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-15 06:50:35,331 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-15 06:50:35,332 INFO L85 PathProgramCache]: Analyzing trace with hash 1537887650, now seen corresponding path program 1 times [2022-04-15 06:50:35,333 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 06:50:35,333 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2113931814] [2022-04-15 06:50:35,333 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 06:50:35,333 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 06:50:35,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:50:35,997 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 06:50:35,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:50:36,000 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-15 06:50:36,000 INFO L290 TraceCheckUtils]: 1: Hoare triple {55261#true} assume true; {55261#true} is VALID [2022-04-15 06:50:36,000 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {55261#true} {55261#true} #52#return; {55261#true} is VALID [2022-04-15 06:50:36,001 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-15 06:50:36,001 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-15 06:50:36,001 INFO L290 TraceCheckUtils]: 2: Hoare triple {55261#true} assume true; {55261#true} is VALID [2022-04-15 06:50:36,001 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {55261#true} {55261#true} #52#return; {55261#true} is VALID [2022-04-15 06:50:36,001 INFO L272 TraceCheckUtils]: 4: Hoare triple {55261#true} call #t~ret9 := main(); {55261#true} is VALID [2022-04-15 06:50:36,001 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-15 06:50:36,002 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-15 06:50:36,002 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-15 06:50:36,003 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-15 06:50:36,004 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-15 06:50:36,004 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-15 06:50:36,004 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-15 06:50:36,005 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-15 06:50:36,005 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-15 06:50:36,006 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-15 06:50:36,006 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-15 06:50:36,007 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-15 06:50:36,007 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-15 06:50:36,008 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-15 06:50:36,008 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-15 06:50:36,009 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-15 06:50:36,009 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-15 06:50:36,009 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-15 06:50:36,010 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-15 06:50:36,010 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-15 06:50:36,011 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-15 06:50:36,011 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-15 06:50:36,012 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-15 06:50:36,012 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-15 06:50:36,013 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-15 06:50:36,013 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-15 06:50:36,014 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-15 06:50:36,014 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-15 06:50:36,014 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-15 06:50:36,015 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-15 06:50:36,015 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-15 06:50:36,016 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-15 06:50:36,016 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-15 06:50:36,017 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-15 06:50:36,017 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-15 06:50:36,018 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-15 06:50:36,018 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-15 06:50:36,018 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-15 06:50:36,018 INFO L290 TraceCheckUtils]: 43: Hoare triple {55262#false} ~cond := #in~cond; {55262#false} is VALID [2022-04-15 06:50:36,018 INFO L290 TraceCheckUtils]: 44: Hoare triple {55262#false} assume 0 == ~cond; {55262#false} is VALID [2022-04-15 06:50:36,018 INFO L290 TraceCheckUtils]: 45: Hoare triple {55262#false} assume !false; {55262#false} is VALID [2022-04-15 06:50:36,019 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-15 06:50:36,019 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 06:50:36,019 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2113931814] [2022-04-15 06:50:36,019 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2113931814] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 06:50:36,019 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [25013798] [2022-04-15 06:50:36,019 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 06:50:36,019 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 06:50:36,019 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 06:50:36,020 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-15 06:50:36,021 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-15 06:50:36,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:50:36,082 INFO L263 TraceCheckSpWp]: Trace formula consists of 214 conjuncts, 35 conjunts are in the unsatisfiable core [2022-04-15 06:50:36,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:50:36,104 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 06:50:37,819 INFO L272 TraceCheckUtils]: 0: Hoare triple {55261#true} call ULTIMATE.init(); {55261#true} is VALID [2022-04-15 06:50:37,820 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-15 06:50:37,820 INFO L290 TraceCheckUtils]: 2: Hoare triple {55261#true} assume true; {55261#true} is VALID [2022-04-15 06:50:37,820 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {55261#true} {55261#true} #52#return; {55261#true} is VALID [2022-04-15 06:50:37,820 INFO L272 TraceCheckUtils]: 4: Hoare triple {55261#true} call #t~ret9 := main(); {55261#true} is VALID [2022-04-15 06:50:37,820 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-15 06:50:37,821 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-15 06:50:37,821 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-15 06:50:37,822 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-15 06:50:37,822 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-15 06:50:37,822 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-15 06:50:37,823 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-15 06:50:37,823 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-15 06:50:37,824 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-15 06:50:37,824 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-15 06:50:37,825 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-15 06:50:37,825 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-15 06:50:37,826 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-15 06:50:37,826 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-15 06:50:37,827 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-15 06:50:37,827 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-15 06:50:37,827 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-15 06:50:37,828 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-15 06:50:37,828 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-15 06:50:37,829 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-15 06:50:37,829 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-15 06:50:37,830 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-15 06:50:37,830 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-15 06:50:37,831 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-15 06:50:37,831 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-15 06:50:37,832 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-15 06:50:37,832 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-15 06:50:37,833 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-15 06:50:37,833 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-15 06:50:37,833 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-15 06:50:37,834 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-15 06:50:37,834 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-15 06:50:37,835 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-15 06:50:37,835 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-15 06:50:37,836 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-15 06:50:37,836 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-15 06:50:37,837 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-15 06:50:37,837 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-15 06:50:37,837 INFO L290 TraceCheckUtils]: 43: Hoare triple {55262#false} ~cond := #in~cond; {55262#false} is VALID [2022-04-15 06:50:37,837 INFO L290 TraceCheckUtils]: 44: Hoare triple {55262#false} assume 0 == ~cond; {55262#false} is VALID [2022-04-15 06:50:37,837 INFO L290 TraceCheckUtils]: 45: Hoare triple {55262#false} assume !false; {55262#false} is VALID [2022-04-15 06:50:37,837 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-15 06:50:37,837 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 06:50:40,133 INFO L290 TraceCheckUtils]: 45: Hoare triple {55262#false} assume !false; {55262#false} is VALID [2022-04-15 06:50:40,133 INFO L290 TraceCheckUtils]: 44: Hoare triple {55262#false} assume 0 == ~cond; {55262#false} is VALID [2022-04-15 06:50:40,133 INFO L290 TraceCheckUtils]: 43: Hoare triple {55262#false} ~cond := #in~cond; {55262#false} is VALID [2022-04-15 06:50:40,134 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-15 06:50:40,134 INFO L290 TraceCheckUtils]: 41: Hoare triple {55484#(< main_~z~0 main_~y~0)} assume !(~y~0 > ~z~0); {55262#false} is VALID [2022-04-15 06:50:40,134 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-15 06:50:40,135 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-15 06:50:40,135 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-15 06:50:40,136 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-15 06:50:40,136 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-15 06:50:40,137 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-15 06:50:40,137 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-15 06:50:40,138 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-15 06:50:40,139 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-15 06:50:40,139 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-15 06:50:40,140 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-15 06:50:40,140 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-15 06:50:40,141 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-15 06:50:40,141 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-15 06:50:40,142 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-15 06:50:40,142 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-15 06:50:40,143 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-15 06:50:40,143 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-15 06:50:40,144 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-15 06:50:40,144 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-15 06:50:40,145 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-15 06:50:40,145 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-15 06:50:40,146 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-15 06:50:40,146 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-15 06:50:40,147 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-15 06:50:40,147 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-15 06:50:40,148 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-15 06:50:40,148 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-15 06:50:40,149 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-15 06:50:40,149 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-15 06:50:40,150 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-15 06:50:40,150 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-15 06:50:40,151 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-15 06:50:40,151 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-15 06:50:40,152 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-15 06:50:40,152 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-15 06:50:40,152 INFO L272 TraceCheckUtils]: 4: Hoare triple {55261#true} call #t~ret9 := main(); {55261#true} is VALID [2022-04-15 06:50:40,152 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {55261#true} {55261#true} #52#return; {55261#true} is VALID [2022-04-15 06:50:40,152 INFO L290 TraceCheckUtils]: 2: Hoare triple {55261#true} assume true; {55261#true} is VALID [2022-04-15 06:50:40,152 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-15 06:50:40,152 INFO L272 TraceCheckUtils]: 0: Hoare triple {55261#true} call ULTIMATE.init(); {55261#true} is VALID [2022-04-15 06:50:40,153 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-15 06:50:40,153 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [25013798] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 06:50:40,153 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 06:50:40,153 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [38, 34, 34] total 102 [2022-04-15 06:50:43,639 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 06:50:43,639 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1998787863] [2022-04-15 06:50:43,639 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1998787863] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 06:50:43,639 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 06:50:43,639 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [93] imperfect sequences [] total 93 [2022-04-15 06:50:43,640 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [536864636] [2022-04-15 06:50:43,640 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 06:50:43,640 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-15 06:50:43,640 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 06:50:43,640 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-15 06:50:43,746 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-15 06:50:43,746 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 93 states [2022-04-15 06:50:43,746 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 06:50:43,747 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 93 interpolants. [2022-04-15 06:50:43,748 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8718, Invalid=16722, Unknown=0, NotChecked=0, Total=25440 [2022-04-15 06:50:43,748 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-15 06:50:58,024 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:50:58,024 INFO L93 Difference]: Finished difference Result 418 states and 427 transitions. [2022-04-15 06:50:58,024 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 61 states. [2022-04-15 06:50:58,024 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-15 06:50:58,025 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 06:50:58,025 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-15 06:50:58,025 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 145 transitions. [2022-04-15 06:50:58,025 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-15 06:50:58,026 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 145 transitions. [2022-04-15 06:50:58,026 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 61 states and 145 transitions. [2022-04-15 06:50:58,136 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-15 06:50:58,140 INFO L225 Difference]: With dead ends: 418 [2022-04-15 06:50:58,140 INFO L226 Difference]: Without dead ends: 270 [2022-04-15 06:50:58,142 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 308 GetRequests, 90 SyntacticMatches, 2 SemanticMatches, 216 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11535 ImplicationChecksByTransitivity, 9.1s TimeCoverageRelationStatistics Valid=12724, Invalid=34582, Unknown=0, NotChecked=0, Total=47306 [2022-04-15 06:50:58,142 INFO L913 BasicCegarLoop]: 13 mSDtfsCounter, 68 mSDsluCounter, 312 mSDsCounter, 0 mSdLazyCounter, 7754 mSolverCounterSat, 63 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.7s 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, 5.8s IncrementalHoareTripleChecker+Time [2022-04-15 06:50:58,142 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [68 Valid, 325 Invalid, 7817 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [63 Valid, 7754 Invalid, 0 Unknown, 0 Unchecked, 5.8s Time] [2022-04-15 06:50:58,142 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 270 states. [2022-04-15 06:50:58,793 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 270 to 270. [2022-04-15 06:50:58,793 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 06:50:58,793 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-15 06:50:58,793 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-15 06:50:58,794 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-15 06:50:58,796 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:50:58,796 INFO L93 Difference]: Finished difference Result 270 states and 274 transitions. [2022-04-15 06:50:58,796 INFO L276 IsEmpty]: Start isEmpty. Operand 270 states and 274 transitions. [2022-04-15 06:50:58,797 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 06:50:58,797 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 06:50:58,797 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-15 06:50:58,797 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-15 06:50:58,800 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:50:58,800 INFO L93 Difference]: Finished difference Result 270 states and 274 transitions. [2022-04-15 06:50:58,800 INFO L276 IsEmpty]: Start isEmpty. Operand 270 states and 274 transitions. [2022-04-15 06:50:58,800 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 06:50:58,800 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 06:50:58,800 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 06:50:58,800 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 06:50:58,800 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-15 06:50:58,803 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 270 states to 270 states and 274 transitions. [2022-04-15 06:50:58,803 INFO L78 Accepts]: Start accepts. Automaton has 270 states and 274 transitions. Word has length 157 [2022-04-15 06:50:58,803 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 06:50:58,804 INFO L478 AbstractCegarLoop]: Abstraction has 270 states and 274 transitions. [2022-04-15 06:50:58,804 INFO L479 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-15 06:50:58,804 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 270 states and 274 transitions. [2022-04-15 06:50:59,068 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-15 06:50:59,068 INFO L276 IsEmpty]: Start isEmpty. Operand 270 states and 274 transitions. [2022-04-15 06:50:59,069 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 160 [2022-04-15 06:50:59,069 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 06:50:59,069 INFO L499 BasicCegarLoop]: trace histogram [58, 57, 31, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 06:50:59,087 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-15 06:50:59,269 WARN L460 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-15 06:50:59,269 INFO L403 AbstractCegarLoop]: === Iteration 46 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 06:50:59,269 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 06:50:59,270 INFO L85 PathProgramCache]: Analyzing trace with hash 1944213324, now seen corresponding path program 43 times [2022-04-15 06:50:59,270 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 06:50:59,270 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [619876456] [2022-04-15 06:50:59,371 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-15 06:50:59,574 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-15 06:50:59,575 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-15 06:50:59,577 INFO L85 PathProgramCache]: Analyzing trace with hash -1341149534, now seen corresponding path program 1 times [2022-04-15 06:50:59,577 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 06:50:59,577 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [251513626] [2022-04-15 06:50:59,577 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 06:50:59,577 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 06:50:59,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:51:00,234 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 06:51:00,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:51:00,237 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-15 06:51:00,237 INFO L290 TraceCheckUtils]: 1: Hoare triple {57731#true} assume true; {57731#true} is VALID [2022-04-15 06:51:00,237 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {57731#true} {57731#true} #52#return; {57731#true} is VALID [2022-04-15 06:51:00,238 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-15 06:51:00,238 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-15 06:51:00,238 INFO L290 TraceCheckUtils]: 2: Hoare triple {57731#true} assume true; {57731#true} is VALID [2022-04-15 06:51:00,238 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {57731#true} {57731#true} #52#return; {57731#true} is VALID [2022-04-15 06:51:00,238 INFO L272 TraceCheckUtils]: 4: Hoare triple {57731#true} call #t~ret9 := main(); {57731#true} is VALID [2022-04-15 06:51:00,238 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-15 06:51:00,239 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-15 06:51:00,239 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-15 06:51:00,240 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-15 06:51:00,241 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-15 06:51:00,241 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-15 06:51:00,242 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-15 06:51:00,242 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-15 06:51:00,243 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-15 06:51:00,243 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-15 06:51:00,244 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-15 06:51:00,244 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-15 06:51:00,245 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-15 06:51:00,245 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-15 06:51:00,246 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-15 06:51:00,246 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-15 06:51:00,247 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-15 06:51:00,247 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-15 06:51:00,248 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-15 06:51:00,248 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-15 06:51:00,248 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-15 06:51:00,249 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-15 06:51:00,249 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-15 06:51:00,250 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-15 06:51:00,250 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-15 06:51:00,251 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-15 06:51:00,251 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-15 06:51:00,252 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-15 06:51:00,252 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-15 06:51:00,253 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-15 06:51:00,253 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-15 06:51:00,254 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-15 06:51:00,254 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-15 06:51:00,255 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-15 06:51:00,255 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-15 06:51:00,256 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-15 06:51:00,256 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-15 06:51:00,256 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-15 06:51:00,256 INFO L290 TraceCheckUtils]: 43: Hoare triple {57732#false} ~cond := #in~cond; {57732#false} is VALID [2022-04-15 06:51:00,256 INFO L290 TraceCheckUtils]: 44: Hoare triple {57732#false} assume 0 == ~cond; {57732#false} is VALID [2022-04-15 06:51:00,256 INFO L290 TraceCheckUtils]: 45: Hoare triple {57732#false} assume !false; {57732#false} is VALID [2022-04-15 06:51:00,257 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-15 06:51:00,257 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 06:51:00,257 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [251513626] [2022-04-15 06:51:00,257 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [251513626] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 06:51:00,257 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1329495106] [2022-04-15 06:51:00,257 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 06:51:00,257 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 06:51:00,257 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 06:51:00,258 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-15 06:51:00,259 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-15 06:51:00,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:51:00,313 INFO L263 TraceCheckSpWp]: Trace formula consists of 214 conjuncts, 35 conjunts are in the unsatisfiable core [2022-04-15 06:51:00,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:51:00,333 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 06:51:01,931 INFO L272 TraceCheckUtils]: 0: Hoare triple {57731#true} call ULTIMATE.init(); {57731#true} is VALID [2022-04-15 06:51:01,931 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-15 06:51:01,932 INFO L290 TraceCheckUtils]: 2: Hoare triple {57731#true} assume true; {57731#true} is VALID [2022-04-15 06:51:01,932 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {57731#true} {57731#true} #52#return; {57731#true} is VALID [2022-04-15 06:51:01,932 INFO L272 TraceCheckUtils]: 4: Hoare triple {57731#true} call #t~ret9 := main(); {57731#true} is VALID [2022-04-15 06:51:01,932 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-15 06:51:01,932 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-15 06:51:01,933 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-15 06:51:01,934 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-15 06:51:01,934 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-15 06:51:01,934 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-15 06:51:01,935 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-15 06:51:01,935 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-15 06:51:01,936 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-15 06:51:01,936 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-15 06:51:01,937 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-15 06:51:01,937 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-15 06:51:01,938 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-15 06:51:01,938 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-15 06:51:01,939 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-15 06:51:01,939 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-15 06:51:01,940 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-15 06:51:01,940 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-15 06:51:01,941 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-15 06:51:01,941 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-15 06:51:01,941 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-15 06:51:01,942 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-15 06:51:01,942 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-15 06:51:01,943 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-15 06:51:01,943 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-15 06:51:01,944 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-15 06:51:01,944 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-15 06:51:01,945 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-15 06:51:01,945 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-15 06:51:01,946 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-15 06:51:01,946 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-15 06:51:01,947 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-15 06:51:01,947 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-15 06:51:01,947 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-15 06:51:01,948 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-15 06:51:01,948 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-15 06:51:01,949 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-15 06:51:01,949 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-15 06:51:01,949 INFO L290 TraceCheckUtils]: 43: Hoare triple {57732#false} ~cond := #in~cond; {57732#false} is VALID [2022-04-15 06:51:01,949 INFO L290 TraceCheckUtils]: 44: Hoare triple {57732#false} assume 0 == ~cond; {57732#false} is VALID [2022-04-15 06:51:01,949 INFO L290 TraceCheckUtils]: 45: Hoare triple {57732#false} assume !false; {57732#false} is VALID [2022-04-15 06:51:01,949 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-15 06:51:01,949 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 06:51:04,196 INFO L290 TraceCheckUtils]: 45: Hoare triple {57732#false} assume !false; {57732#false} is VALID [2022-04-15 06:51:04,197 INFO L290 TraceCheckUtils]: 44: Hoare triple {57732#false} assume 0 == ~cond; {57732#false} is VALID [2022-04-15 06:51:04,197 INFO L290 TraceCheckUtils]: 43: Hoare triple {57732#false} ~cond := #in~cond; {57732#false} is VALID [2022-04-15 06:51:04,197 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-15 06:51:04,197 INFO L290 TraceCheckUtils]: 41: Hoare triple {57954#(< main_~z~0 main_~y~0)} assume !(~y~0 > ~z~0); {57732#false} is VALID [2022-04-15 06:51:04,198 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-15 06:51:04,198 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-15 06:51:04,199 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-15 06:51:04,199 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-15 06:51:04,199 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-15 06:51:04,200 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-15 06:51:04,200 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-15 06:51:04,201 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-15 06:51:04,201 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-15 06:51:04,202 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-15 06:51:04,202 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-15 06:51:04,203 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-15 06:51:04,203 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-15 06:51:04,204 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-15 06:51:04,204 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-15 06:51:04,204 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-15 06:51:04,205 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-15 06:51:04,205 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-15 06:51:04,206 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-15 06:51:04,206 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-15 06:51:04,207 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-15 06:51:04,207 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-15 06:51:04,208 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-15 06:51:04,208 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-15 06:51:04,208 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-15 06:51:04,225 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-15 06:51:04,226 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-15 06:51:04,227 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-15 06:51:04,227 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-15 06:51:04,228 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-15 06:51:04,228 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-15 06:51:04,228 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-15 06:51:04,229 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-15 06:51:04,230 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-15 06:51:04,230 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-15 06:51:04,230 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-15 06:51:04,230 INFO L272 TraceCheckUtils]: 4: Hoare triple {57731#true} call #t~ret9 := main(); {57731#true} is VALID [2022-04-15 06:51:04,230 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {57731#true} {57731#true} #52#return; {57731#true} is VALID [2022-04-15 06:51:04,230 INFO L290 TraceCheckUtils]: 2: Hoare triple {57731#true} assume true; {57731#true} is VALID [2022-04-15 06:51:04,231 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-15 06:51:04,231 INFO L272 TraceCheckUtils]: 0: Hoare triple {57731#true} call ULTIMATE.init(); {57731#true} is VALID [2022-04-15 06:51:04,231 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-15 06:51:04,231 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1329495106] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 06:51:04,231 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 06:51:04,231 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [38, 34, 34] total 102 [2022-04-15 06:51:06,973 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 06:51:06,973 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [619876456] [2022-04-15 06:51:06,973 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [619876456] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 06:51:06,973 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 06:51:06,973 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [94] imperfect sequences [] total 94 [2022-04-15 06:51:06,974 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [208510021] [2022-04-15 06:51:06,974 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 06:51:06,974 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-15 06:51:06,974 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 06:51:06,974 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-15 06:51:07,089 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-15 06:51:07,089 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 94 states [2022-04-15 06:51:07,089 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 06:51:07,090 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 94 interpolants. [2022-04-15 06:51:07,090 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10333, Invalid=15427, Unknown=0, NotChecked=0, Total=25760 [2022-04-15 06:51:07,091 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-15 06:51:22,336 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:51:22,336 INFO L93 Difference]: Finished difference Result 421 states and 431 transitions. [2022-04-15 06:51:22,336 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 94 states. [2022-04-15 06:51:22,337 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-15 06:51:22,337 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 06:51:22,337 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-15 06:51:22,338 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 180 transitions. [2022-04-15 06:51:22,339 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-15 06:51:22,340 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 180 transitions. [2022-04-15 06:51:22,340 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 94 states and 180 transitions. [2022-04-15 06:51:22,511 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-15 06:51:22,514 INFO L225 Difference]: With dead ends: 421 [2022-04-15 06:51:22,514 INFO L226 Difference]: Without dead ends: 273 [2022-04-15 06:51:22,517 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 343 GetRequests, 91 SyntacticMatches, 2 SemanticMatches, 250 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18474 ImplicationChecksByTransitivity, 9.0s TimeCoverageRelationStatistics Valid=20884, Invalid=42368, Unknown=0, NotChecked=0, Total=63252 [2022-04-15 06:51:22,518 INFO L913 BasicCegarLoop]: 13 mSDtfsCounter, 549 mSDsluCounter, 27 mSDsCounter, 0 mSdLazyCounter, 7200 mSolverCounterSat, 577 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.8s 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, 5.8s IncrementalHoareTripleChecker+Time [2022-04-15 06:51:22,518 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [549 Valid, 40 Invalid, 7777 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [577 Valid, 7200 Invalid, 0 Unknown, 0 Unchecked, 5.8s Time] [2022-04-15 06:51:22,518 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 273 states. [2022-04-15 06:51:23,200 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 273 to 273. [2022-04-15 06:51:23,201 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 06:51:23,201 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-15 06:51:23,201 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-15 06:51:23,201 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-15 06:51:23,204 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:51:23,204 INFO L93 Difference]: Finished difference Result 273 states and 277 transitions. [2022-04-15 06:51:23,204 INFO L276 IsEmpty]: Start isEmpty. Operand 273 states and 277 transitions. [2022-04-15 06:51:23,205 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 06:51:23,205 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 06:51:23,205 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-15 06:51:23,205 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-15 06:51:23,208 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:51:23,208 INFO L93 Difference]: Finished difference Result 273 states and 277 transitions. [2022-04-15 06:51:23,208 INFO L276 IsEmpty]: Start isEmpty. Operand 273 states and 277 transitions. [2022-04-15 06:51:23,208 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 06:51:23,208 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 06:51:23,208 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 06:51:23,208 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 06:51:23,208 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-15 06:51:23,211 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 273 states to 273 states and 277 transitions. [2022-04-15 06:51:23,212 INFO L78 Accepts]: Start accepts. Automaton has 273 states and 277 transitions. Word has length 159 [2022-04-15 06:51:23,212 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 06:51:23,212 INFO L478 AbstractCegarLoop]: Abstraction has 273 states and 277 transitions. [2022-04-15 06:51:23,212 INFO L479 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-15 06:51:23,212 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 273 states and 277 transitions. [2022-04-15 06:51:23,492 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-15 06:51:23,492 INFO L276 IsEmpty]: Start isEmpty. Operand 273 states and 277 transitions. [2022-04-15 06:51:23,492 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 163 [2022-04-15 06:51:23,492 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 06:51:23,492 INFO L499 BasicCegarLoop]: trace histogram [59, 58, 32, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 06:51:23,509 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-15 06:51:23,693 WARN L460 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-15 06:51:23,693 INFO L403 AbstractCegarLoop]: === Iteration 47 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 06:51:23,693 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 06:51:23,693 INFO L85 PathProgramCache]: Analyzing trace with hash -788602084, now seen corresponding path program 44 times [2022-04-15 06:51:23,693 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 06:51:23,694 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1235278155] [2022-04-15 06:51:27,768 WARN L977 rdanLoopAcceleration]: Unable to prove correctness of quantifier elimination. [2022-04-15 06:51:27,818 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-15 06:51:31,947 WARN L977 rdanLoopAcceleration]: Unable to prove correctness of quantifier elimination. [2022-04-15 06:51:32,062 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-15 06:51:32,063 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-15 06:51:32,065 INFO L85 PathProgramCache]: Analyzing trace with hash -1941231615, now seen corresponding path program 1 times [2022-04-15 06:51:32,066 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 06:51:32,066 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1016317439] [2022-04-15 06:51:32,066 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 06:51:32,066 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 06:51:32,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:51:32,768 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 06:51:32,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:51:32,771 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-15 06:51:32,771 INFO L290 TraceCheckUtils]: 1: Hoare triple {60286#true} assume true; {60286#true} is VALID [2022-04-15 06:51:32,771 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {60286#true} {60286#true} #52#return; {60286#true} is VALID [2022-04-15 06:51:32,771 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-15 06:51:32,771 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-15 06:51:32,771 INFO L290 TraceCheckUtils]: 2: Hoare triple {60286#true} assume true; {60286#true} is VALID [2022-04-15 06:51:32,771 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {60286#true} {60286#true} #52#return; {60286#true} is VALID [2022-04-15 06:51:32,772 INFO L272 TraceCheckUtils]: 4: Hoare triple {60286#true} call #t~ret9 := main(); {60286#true} is VALID [2022-04-15 06:51:32,772 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-15 06:51:32,773 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-15 06:51:32,773 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-15 06:51:32,774 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-15 06:51:32,774 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-15 06:51:32,775 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-15 06:51:32,775 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-15 06:51:32,776 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-15 06:51:32,776 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-15 06:51:32,777 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-15 06:51:32,777 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-15 06:51:32,777 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-15 06:51:32,778 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-15 06:51:32,778 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-15 06:51:32,779 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-15 06:51:32,779 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-15 06:51:32,780 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-15 06:51:32,780 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-15 06:51:32,781 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-15 06:51:32,781 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-15 06:51:32,782 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-15 06:51:32,782 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-15 06:51:32,782 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-15 06:51:32,783 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-15 06:51:32,783 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-15 06:51:32,784 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-15 06:51:32,784 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-15 06:51:32,785 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-15 06:51:32,785 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-15 06:51:32,786 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-15 06:51:32,786 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-15 06:51:32,787 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-15 06:51:32,787 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-15 06:51:32,787 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-15 06:51:32,788 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-15 06:51:32,788 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-15 06:51:32,789 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-15 06:51:32,789 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-15 06:51:32,789 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-15 06:51:32,789 INFO L290 TraceCheckUtils]: 44: Hoare triple {60287#false} ~cond := #in~cond; {60287#false} is VALID [2022-04-15 06:51:32,789 INFO L290 TraceCheckUtils]: 45: Hoare triple {60287#false} assume 0 == ~cond; {60287#false} is VALID [2022-04-15 06:51:32,789 INFO L290 TraceCheckUtils]: 46: Hoare triple {60287#false} assume !false; {60287#false} is VALID [2022-04-15 06:51:32,790 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-15 06:51:32,790 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 06:51:32,790 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1016317439] [2022-04-15 06:51:32,790 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1016317439] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 06:51:32,790 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2010887474] [2022-04-15 06:51:32,790 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 06:51:32,790 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 06:51:32,790 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 06:51:32,791 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-15 06:51:32,792 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-15 06:51:32,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:51:32,842 INFO L263 TraceCheckSpWp]: Trace formula consists of 219 conjuncts, 36 conjunts are in the unsatisfiable core [2022-04-15 06:51:32,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:51:32,896 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 06:51:34,630 INFO L272 TraceCheckUtils]: 0: Hoare triple {60286#true} call ULTIMATE.init(); {60286#true} is VALID [2022-04-15 06:51:34,631 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-15 06:51:34,631 INFO L290 TraceCheckUtils]: 2: Hoare triple {60286#true} assume true; {60286#true} is VALID [2022-04-15 06:51:34,631 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {60286#true} {60286#true} #52#return; {60286#true} is VALID [2022-04-15 06:51:34,631 INFO L272 TraceCheckUtils]: 4: Hoare triple {60286#true} call #t~ret9 := main(); {60286#true} is VALID [2022-04-15 06:51:34,631 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-15 06:51:34,632 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-15 06:51:34,632 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-15 06:51:34,633 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-15 06:51:34,633 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-15 06:51:34,633 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-15 06:51:34,634 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-15 06:51:34,634 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-15 06:51:34,635 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-15 06:51:34,635 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-15 06:51:34,636 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-15 06:51:34,636 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-15 06:51:34,637 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-15 06:51:34,637 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-15 06:51:34,638 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-15 06:51:34,638 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-15 06:51:34,639 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-15 06:51:34,639 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-15 06:51:34,639 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-15 06:51:34,640 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-15 06:51:34,640 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-15 06:51:34,641 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-15 06:51:34,641 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-15 06:51:34,642 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-15 06:51:34,642 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-15 06:51:34,643 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-15 06:51:34,643 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-15 06:51:34,644 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-15 06:51:34,644 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-15 06:51:34,645 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-15 06:51:34,645 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-15 06:51:34,646 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-15 06:51:34,646 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-15 06:51:34,647 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-15 06:51:34,647 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-15 06:51:34,647 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-15 06:51:34,648 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-15 06:51:34,648 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-15 06:51:34,648 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-15 06:51:34,648 INFO L290 TraceCheckUtils]: 44: Hoare triple {60287#false} ~cond := #in~cond; {60287#false} is VALID [2022-04-15 06:51:34,649 INFO L290 TraceCheckUtils]: 45: Hoare triple {60287#false} assume 0 == ~cond; {60287#false} is VALID [2022-04-15 06:51:34,649 INFO L290 TraceCheckUtils]: 46: Hoare triple {60287#false} assume !false; {60287#false} is VALID [2022-04-15 06:51:34,649 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-15 06:51:34,649 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 06:51:37,105 INFO L290 TraceCheckUtils]: 46: Hoare triple {60287#false} assume !false; {60287#false} is VALID [2022-04-15 06:51:37,105 INFO L290 TraceCheckUtils]: 45: Hoare triple {60287#false} assume 0 == ~cond; {60287#false} is VALID [2022-04-15 06:51:37,105 INFO L290 TraceCheckUtils]: 44: Hoare triple {60287#false} ~cond := #in~cond; {60287#false} is VALID [2022-04-15 06:51:37,106 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-15 06:51:37,106 INFO L290 TraceCheckUtils]: 42: Hoare triple {60514#(< main_~z~0 main_~y~0)} assume !(~y~0 > ~z~0); {60287#false} is VALID [2022-04-15 06:51:37,106 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-15 06:51:37,107 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-15 06:51:37,107 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-15 06:51:37,108 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-15 06:51:37,108 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-15 06:51:37,109 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-15 06:51:37,109 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-15 06:51:37,110 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-15 06:51:37,110 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-15 06:51:37,110 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-15 06:51:37,111 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-15 06:51:37,111 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-15 06:51:37,112 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-15 06:51:37,112 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-15 06:51:37,113 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-15 06:51:37,113 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-15 06:51:37,114 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-15 06:51:37,114 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-15 06:51:37,114 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-15 06:51:37,115 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-15 06:51:37,115 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-15 06:51:37,116 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-15 06:51:37,116 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-15 06:51:37,117 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-15 06:51:37,117 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-15 06:51:37,118 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-15 06:51:37,118 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-15 06:51:37,118 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-15 06:51:37,119 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-15 06:51:37,119 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-15 06:51:37,120 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-15 06:51:37,120 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-15 06:51:37,121 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-15 06:51:37,121 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-15 06:51:37,122 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-15 06:51:37,122 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-15 06:51:37,122 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-15 06:51:37,122 INFO L272 TraceCheckUtils]: 4: Hoare triple {60286#true} call #t~ret9 := main(); {60286#true} is VALID [2022-04-15 06:51:37,122 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {60286#true} {60286#true} #52#return; {60286#true} is VALID [2022-04-15 06:51:37,122 INFO L290 TraceCheckUtils]: 2: Hoare triple {60286#true} assume true; {60286#true} is VALID [2022-04-15 06:51:37,122 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-15 06:51:37,123 INFO L272 TraceCheckUtils]: 0: Hoare triple {60286#true} call ULTIMATE.init(); {60286#true} is VALID [2022-04-15 06:51:37,123 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-15 06:51:37,123 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2010887474] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 06:51:37,123 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 06:51:37,123 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [39, 35, 35] total 105 [2022-04-15 06:51:40,709 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 06:51:40,709 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1235278155] [2022-04-15 06:51:40,709 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1235278155] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 06:51:40,709 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 06:51:40,709 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [96] imperfect sequences [] total 96 [2022-04-15 06:51:40,709 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1738578909] [2022-04-15 06:51:40,710 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 06:51:40,710 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-15 06:51:40,710 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 06:51:40,710 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-15 06:51:40,825 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-15 06:51:40,825 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 96 states [2022-04-15 06:51:40,825 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 06:51:40,826 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 96 interpolants. [2022-04-15 06:51:40,827 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9271, Invalid=17789, Unknown=0, NotChecked=0, Total=27060 [2022-04-15 06:51:40,827 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-15 06:51:56,757 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:51:56,757 INFO L93 Difference]: Finished difference Result 424 states and 433 transitions. [2022-04-15 06:51:56,757 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 63 states. [2022-04-15 06:51:56,757 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-15 06:51:56,757 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 06:51:56,758 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-15 06:51:56,758 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 149 transitions. [2022-04-15 06:51:56,759 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-15 06:51:56,759 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 149 transitions. [2022-04-15 06:51:56,759 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 63 states and 149 transitions. [2022-04-15 06:51:56,873 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-15 06:51:56,877 INFO L225 Difference]: With dead ends: 424 [2022-04-15 06:51:56,877 INFO L226 Difference]: Without dead ends: 275 [2022-04-15 06:51:56,879 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 317 GetRequests, 92 SyntacticMatches, 2 SemanticMatches, 223 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12292 ImplicationChecksByTransitivity, 9.7s TimeCoverageRelationStatistics Valid=13535, Invalid=36865, Unknown=0, NotChecked=0, Total=50400 [2022-04-15 06:51:56,880 INFO L913 BasicCegarLoop]: 13 mSDtfsCounter, 70 mSDsluCounter, 337 mSDsCounter, 0 mSdLazyCounter, 8643 mSolverCounterSat, 65 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.5s 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, 6.5s IncrementalHoareTripleChecker+Time [2022-04-15 06:51:56,880 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [70 Valid, 350 Invalid, 8708 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [65 Valid, 8643 Invalid, 0 Unknown, 0 Unchecked, 6.5s Time] [2022-04-15 06:51:56,880 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 275 states. [2022-04-15 06:51:57,536 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 275 to 275. [2022-04-15 06:51:57,537 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 06:51:57,537 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-15 06:51:57,537 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-15 06:51:57,537 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-15 06:51:57,540 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:51:57,540 INFO L93 Difference]: Finished difference Result 275 states and 279 transitions. [2022-04-15 06:51:57,540 INFO L276 IsEmpty]: Start isEmpty. Operand 275 states and 279 transitions. [2022-04-15 06:51:57,541 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 06:51:57,541 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 06:51:57,541 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-15 06:51:57,541 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-15 06:51:57,544 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:51:57,544 INFO L93 Difference]: Finished difference Result 275 states and 279 transitions. [2022-04-15 06:51:57,544 INFO L276 IsEmpty]: Start isEmpty. Operand 275 states and 279 transitions. [2022-04-15 06:51:57,544 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 06:51:57,544 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 06:51:57,544 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 06:51:57,544 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 06:51:57,544 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-15 06:51:57,548 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 275 states to 275 states and 279 transitions. [2022-04-15 06:51:57,548 INFO L78 Accepts]: Start accepts. Automaton has 275 states and 279 transitions. Word has length 162 [2022-04-15 06:51:57,548 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 06:51:57,548 INFO L478 AbstractCegarLoop]: Abstraction has 275 states and 279 transitions. [2022-04-15 06:51:57,548 INFO L479 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-15 06:51:57,548 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 275 states and 279 transitions. [2022-04-15 06:51:57,861 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-15 06:51:57,862 INFO L276 IsEmpty]: Start isEmpty. Operand 275 states and 279 transitions. [2022-04-15 06:51:57,862 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 165 [2022-04-15 06:51:57,862 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 06:51:57,862 INFO L499 BasicCegarLoop]: trace histogram [60, 59, 32, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 06:51:57,878 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-15 06:51:58,063 WARN L460 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-15 06:51:58,063 INFO L403 AbstractCegarLoop]: === Iteration 48 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 06:51:58,063 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 06:51:58,063 INFO L85 PathProgramCache]: Analyzing trace with hash -643194015, now seen corresponding path program 45 times [2022-04-15 06:51:58,063 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 06:51:58,064 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [646274608] [2022-04-15 06:52:02,126 WARN L977 rdanLoopAcceleration]: Unable to prove correctness of quantifier elimination. [2022-04-15 06:52:02,168 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-15 06:52:02,373 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-15 06:52:02,374 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-15 06:52:02,376 INFO L85 PathProgramCache]: Analyzing trace with hash -997071103, now seen corresponding path program 1 times [2022-04-15 06:52:02,376 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 06:52:02,376 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [93245190] [2022-04-15 06:52:02,377 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 06:52:02,377 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 06:52:02,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:52:03,103 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 06:52:03,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:52:03,106 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-15 06:52:03,106 INFO L290 TraceCheckUtils]: 1: Hoare triple {62803#true} assume true; {62803#true} is VALID [2022-04-15 06:52:03,106 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {62803#true} {62803#true} #52#return; {62803#true} is VALID [2022-04-15 06:52:03,107 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-15 06:52:03,107 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-15 06:52:03,107 INFO L290 TraceCheckUtils]: 2: Hoare triple {62803#true} assume true; {62803#true} is VALID [2022-04-15 06:52:03,107 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {62803#true} {62803#true} #52#return; {62803#true} is VALID [2022-04-15 06:52:03,107 INFO L272 TraceCheckUtils]: 4: Hoare triple {62803#true} call #t~ret9 := main(); {62803#true} is VALID [2022-04-15 06:52:03,108 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-15 06:52:03,108 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-15 06:52:03,109 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-15 06:52:03,110 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-15 06:52:03,110 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-15 06:52:03,111 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-15 06:52:03,111 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-15 06:52:03,112 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-15 06:52:03,112 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-15 06:52:03,113 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-15 06:52:03,113 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-15 06:52:03,114 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-15 06:52:03,114 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-15 06:52:03,115 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-15 06:52:03,115 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-15 06:52:03,116 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-15 06:52:03,116 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-15 06:52:03,117 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-15 06:52:03,117 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-15 06:52:03,118 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-15 06:52:03,118 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-15 06:52:03,119 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-15 06:52:03,119 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-15 06:52:03,120 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-15 06:52:03,120 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-15 06:52:03,121 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-15 06:52:03,121 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-15 06:52:03,122 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-15 06:52:03,122 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-15 06:52:03,123 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-15 06:52:03,123 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-15 06:52:03,124 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-15 06:52:03,124 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-15 06:52:03,125 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-15 06:52:03,125 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-15 06:52:03,126 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-15 06:52:03,126 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-15 06:52:03,127 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-15 06:52:03,127 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-15 06:52:03,127 INFO L290 TraceCheckUtils]: 44: Hoare triple {62804#false} ~cond := #in~cond; {62804#false} is VALID [2022-04-15 06:52:03,127 INFO L290 TraceCheckUtils]: 45: Hoare triple {62804#false} assume 0 == ~cond; {62804#false} is VALID [2022-04-15 06:52:03,127 INFO L290 TraceCheckUtils]: 46: Hoare triple {62804#false} assume !false; {62804#false} is VALID [2022-04-15 06:52:03,127 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-15 06:52:03,127 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 06:52:03,127 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [93245190] [2022-04-15 06:52:03,128 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [93245190] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 06:52:03,128 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1191216823] [2022-04-15 06:52:03,128 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 06:52:03,128 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 06:52:03,128 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 06:52:03,129 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-15 06:52:03,129 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-15 06:52:03,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:52:03,183 INFO L263 TraceCheckSpWp]: Trace formula consists of 219 conjuncts, 39 conjunts are in the unsatisfiable core [2022-04-15 06:52:03,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:52:03,215 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 06:52:05,084 INFO L272 TraceCheckUtils]: 0: Hoare triple {62803#true} call ULTIMATE.init(); {62803#true} is VALID [2022-04-15 06:52:05,084 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-15 06:52:05,084 INFO L290 TraceCheckUtils]: 2: Hoare triple {62803#true} assume true; {62803#true} is VALID [2022-04-15 06:52:05,085 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {62803#true} {62803#true} #52#return; {62803#true} is VALID [2022-04-15 06:52:05,085 INFO L272 TraceCheckUtils]: 4: Hoare triple {62803#true} call #t~ret9 := main(); {62803#true} is VALID [2022-04-15 06:52:05,085 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-15 06:52:05,086 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-15 06:52:05,086 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-15 06:52:05,087 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-15 06:52:05,087 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-15 06:52:05,088 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-15 06:52:05,088 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-15 06:52:05,089 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-15 06:52:05,089 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-15 06:52:05,090 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-15 06:52:05,090 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-15 06:52:05,091 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-15 06:52:05,091 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-15 06:52:05,092 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-15 06:52:05,092 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-15 06:52:05,093 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-15 06:52:05,093 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-15 06:52:05,094 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-15 06:52:05,094 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-15 06:52:05,094 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-15 06:52:05,095 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-15 06:52:05,095 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-15 06:52:05,096 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-15 06:52:05,096 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-15 06:52:05,097 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-15 06:52:05,097 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-15 06:52:05,098 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-15 06:52:05,098 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-15 06:52:05,099 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-15 06:52:05,099 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-15 06:52:05,100 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-15 06:52:05,100 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-15 06:52:05,101 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-15 06:52:05,101 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-15 06:52:05,102 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-15 06:52:05,102 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-15 06:52:05,102 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-15 06:52:05,103 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-15 06:52:05,103 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-15 06:52:05,103 INFO L290 TraceCheckUtils]: 44: Hoare triple {62804#false} ~cond := #in~cond; {62804#false} is VALID [2022-04-15 06:52:05,103 INFO L290 TraceCheckUtils]: 45: Hoare triple {62804#false} assume 0 == ~cond; {62804#false} is VALID [2022-04-15 06:52:05,103 INFO L290 TraceCheckUtils]: 46: Hoare triple {62804#false} assume !false; {62804#false} is VALID [2022-04-15 06:52:05,103 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-15 06:52:05,103 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 06:52:08,020 INFO L290 TraceCheckUtils]: 46: Hoare triple {62804#false} assume !false; {62804#false} is VALID [2022-04-15 06:52:08,020 INFO L290 TraceCheckUtils]: 45: Hoare triple {62804#false} assume 0 == ~cond; {62804#false} is VALID [2022-04-15 06:52:08,021 INFO L290 TraceCheckUtils]: 44: Hoare triple {62804#false} ~cond := #in~cond; {62804#false} is VALID [2022-04-15 06:52:08,021 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-15 06:52:08,021 INFO L290 TraceCheckUtils]: 42: Hoare triple {63034#(< main_~z~0 main_~y~0)} assume !(~y~0 > ~z~0); {62804#false} is VALID [2022-04-15 06:52:08,021 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-15 06:52:08,022 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-15 06:52:08,022 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-15 06:52:08,023 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-15 06:52:08,023 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-15 06:52:08,024 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-15 06:52:08,024 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-15 06:52:08,025 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-15 06:52:08,025 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-15 06:52:08,025 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-15 06:52:08,026 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-15 06:52:08,026 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-15 06:52:08,027 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-15 06:52:08,027 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-15 06:52:08,028 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-15 06:52:08,028 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-15 06:52:08,029 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-15 06:52:08,029 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-15 06:52:08,029 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-15 06:52:08,030 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-15 06:52:08,030 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-15 06:52:08,031 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-15 06:52:08,031 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-15 06:52:08,032 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-15 06:52:08,032 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-15 06:52:08,033 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-15 06:52:08,033 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-15 06:52:08,033 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-15 06:52:08,034 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-15 06:52:08,034 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-15 06:52:08,035 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-15 06:52:08,035 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-15 06:52:08,036 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-15 06:52:08,036 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-15 06:52:08,037 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-15 06:52:08,038 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-15 06:52:08,038 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-15 06:52:08,038 INFO L272 TraceCheckUtils]: 4: Hoare triple {62803#true} call #t~ret9 := main(); {62803#true} is VALID [2022-04-15 06:52:08,038 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {62803#true} {62803#true} #52#return; {62803#true} is VALID [2022-04-15 06:52:08,038 INFO L290 TraceCheckUtils]: 2: Hoare triple {62803#true} assume true; {62803#true} is VALID [2022-04-15 06:52:08,038 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-15 06:52:08,038 INFO L272 TraceCheckUtils]: 0: Hoare triple {62803#true} call ULTIMATE.init(); {62803#true} is VALID [2022-04-15 06:52:08,039 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-15 06:52:08,039 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1191216823] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 06:52:08,039 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 06:52:08,039 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [39, 38, 38] total 111 [2022-04-15 06:52:12,532 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 06:52:12,532 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [646274608] [2022-04-15 06:52:12,532 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [646274608] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 06:52:12,532 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 06:52:12,532 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [97] imperfect sequences [] total 97 [2022-04-15 06:52:12,533 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1303021342] [2022-04-15 06:52:12,533 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 06:52:12,533 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-15 06:52:12,533 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 06:52:12,533 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-15 06:52:12,647 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-15 06:52:12,647 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 97 states [2022-04-15 06:52:12,647 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 06:52:12,648 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 97 interpolants. [2022-04-15 06:52:12,649 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7348, Invalid=22064, Unknown=0, NotChecked=0, Total=29412 [2022-04-15 06:52:12,649 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-15 06:52:29,425 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:52:29,425 INFO L93 Difference]: Finished difference Result 426 states and 435 transitions. [2022-04-15 06:52:29,425 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 64 states. [2022-04-15 06:52:29,426 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-15 06:52:29,426 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 06:52:29,426 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-15 06:52:29,427 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 151 transitions. [2022-04-15 06:52:29,427 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-15 06:52:29,427 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 151 transitions. [2022-04-15 06:52:29,427 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 64 states and 151 transitions. [2022-04-15 06:52:29,541 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-15 06:52:29,545 INFO L225 Difference]: With dead ends: 426 [2022-04-15 06:52:29,545 INFO L226 Difference]: Without dead ends: 277 [2022-04-15 06:52:29,547 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 320 GetRequests, 87 SyntacticMatches, 2 SemanticMatches, 231 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11924 ImplicationChecksByTransitivity, 11.7s TimeCoverageRelationStatistics Valid=9916, Invalid=44140, Unknown=0, NotChecked=0, Total=54056 [2022-04-15 06:52:29,547 INFO L913 BasicCegarLoop]: 13 mSDtfsCounter, 71 mSDsluCounter, 332 mSDsCounter, 0 mSdLazyCounter, 8650 mSolverCounterSat, 66 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.4s 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.5s IncrementalHoareTripleChecker+Time [2022-04-15 06:52:29,548 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [71 Valid, 345 Invalid, 8716 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [66 Valid, 8650 Invalid, 0 Unknown, 0 Unchecked, 6.5s Time] [2022-04-15 06:52:29,548 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 277 states. [2022-04-15 06:52:30,212 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 277 to 277. [2022-04-15 06:52:30,212 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 06:52:30,212 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-15 06:52:30,212 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-15 06:52:30,213 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-15 06:52:30,215 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:52:30,216 INFO L93 Difference]: Finished difference Result 277 states and 281 transitions. [2022-04-15 06:52:30,216 INFO L276 IsEmpty]: Start isEmpty. Operand 277 states and 281 transitions. [2022-04-15 06:52:30,216 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 06:52:30,216 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 06:52:30,216 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-15 06:52:30,216 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-15 06:52:30,219 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:52:30,219 INFO L93 Difference]: Finished difference Result 277 states and 281 transitions. [2022-04-15 06:52:30,219 INFO L276 IsEmpty]: Start isEmpty. Operand 277 states and 281 transitions. [2022-04-15 06:52:30,219 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 06:52:30,219 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 06:52:30,219 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 06:52:30,219 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 06:52:30,219 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-15 06:52:30,223 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 277 states to 277 states and 281 transitions. [2022-04-15 06:52:30,223 INFO L78 Accepts]: Start accepts. Automaton has 277 states and 281 transitions. Word has length 164 [2022-04-15 06:52:30,223 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 06:52:30,223 INFO L478 AbstractCegarLoop]: Abstraction has 277 states and 281 transitions. [2022-04-15 06:52:30,223 INFO L479 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-15 06:52:30,223 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 277 states and 281 transitions. [2022-04-15 06:52:30,500 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-15 06:52:30,500 INFO L276 IsEmpty]: Start isEmpty. Operand 277 states and 281 transitions. [2022-04-15 06:52:30,500 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 167 [2022-04-15 06:52:30,500 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 06:52:30,500 INFO L499 BasicCegarLoop]: trace histogram [61, 60, 32, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 06:52:30,518 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-15 06:52:30,701 WARN L460 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-15 06:52:30,701 INFO L403 AbstractCegarLoop]: === Iteration 49 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 06:52:30,701 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 06:52:30,701 INFO L85 PathProgramCache]: Analyzing trace with hash 1655006822, now seen corresponding path program 46 times [2022-04-15 06:52:30,702 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 06:52:30,702 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [983655011] [2022-04-15 06:52:30,804 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-15 06:52:34,920 WARN L977 rdanLoopAcceleration]: Unable to prove correctness of quantifier elimination. [2022-04-15 06:52:35,025 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-15 06:52:35,026 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-15 06:52:35,028 INFO L85 PathProgramCache]: Analyzing trace with hash -52910591, now seen corresponding path program 1 times [2022-04-15 06:52:35,028 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 06:52:35,028 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1462841504] [2022-04-15 06:52:35,028 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 06:52:35,029 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 06:52:35,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:52:35,692 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 06:52:35,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:52:35,694 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-15 06:52:35,694 INFO L290 TraceCheckUtils]: 1: Hoare triple {65341#true} assume true; {65341#true} is VALID [2022-04-15 06:52:35,695 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {65341#true} {65341#true} #52#return; {65341#true} is VALID [2022-04-15 06:52:35,695 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-15 06:52:35,695 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-15 06:52:35,695 INFO L290 TraceCheckUtils]: 2: Hoare triple {65341#true} assume true; {65341#true} is VALID [2022-04-15 06:52:35,695 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {65341#true} {65341#true} #52#return; {65341#true} is VALID [2022-04-15 06:52:35,695 INFO L272 TraceCheckUtils]: 4: Hoare triple {65341#true} call #t~ret9 := main(); {65341#true} is VALID [2022-04-15 06:52:35,696 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-15 06:52:35,696 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-15 06:52:35,696 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-15 06:52:35,697 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-15 06:52:35,698 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-15 06:52:35,698 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-15 06:52:35,698 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-15 06:52:35,699 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-15 06:52:35,699 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-15 06:52:35,700 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-15 06:52:35,700 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-15 06:52:35,701 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-15 06:52:35,701 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-15 06:52:35,702 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-15 06:52:35,702 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-15 06:52:35,703 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-15 06:52:35,703 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-15 06:52:35,703 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-15 06:52:35,704 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-15 06:52:35,704 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-15 06:52:35,705 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-15 06:52:35,705 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-15 06:52:35,706 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-15 06:52:35,706 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-15 06:52:35,707 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-15 06:52:35,707 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-15 06:52:35,708 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-15 06:52:35,708 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-15 06:52:35,709 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-15 06:52:35,709 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-15 06:52:35,709 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-15 06:52:35,710 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-15 06:52:35,710 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-15 06:52:35,711 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-15 06:52:35,711 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-15 06:52:35,712 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-15 06:52:35,712 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-15 06:52:35,713 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-15 06:52:35,713 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-15 06:52:35,713 INFO L290 TraceCheckUtils]: 44: Hoare triple {65342#false} ~cond := #in~cond; {65342#false} is VALID [2022-04-15 06:52:35,713 INFO L290 TraceCheckUtils]: 45: Hoare triple {65342#false} assume 0 == ~cond; {65342#false} is VALID [2022-04-15 06:52:35,713 INFO L290 TraceCheckUtils]: 46: Hoare triple {65342#false} assume !false; {65342#false} is VALID [2022-04-15 06:52:35,713 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-15 06:52:35,713 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 06:52:35,713 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1462841504] [2022-04-15 06:52:35,713 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1462841504] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 06:52:35,713 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [190380560] [2022-04-15 06:52:35,713 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 06:52:35,714 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 06:52:35,714 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 06:52:35,715 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-15 06:52:35,715 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-15 06:52:35,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:52:35,766 INFO L263 TraceCheckSpWp]: Trace formula consists of 219 conjuncts, 36 conjunts are in the unsatisfiable core [2022-04-15 06:52:35,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:52:35,791 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 06:52:37,368 INFO L272 TraceCheckUtils]: 0: Hoare triple {65341#true} call ULTIMATE.init(); {65341#true} is VALID [2022-04-15 06:52:37,368 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-15 06:52:37,368 INFO L290 TraceCheckUtils]: 2: Hoare triple {65341#true} assume true; {65341#true} is VALID [2022-04-15 06:52:37,368 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {65341#true} {65341#true} #52#return; {65341#true} is VALID [2022-04-15 06:52:37,368 INFO L272 TraceCheckUtils]: 4: Hoare triple {65341#true} call #t~ret9 := main(); {65341#true} is VALID [2022-04-15 06:52:37,369 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-15 06:52:37,369 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-15 06:52:37,369 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-15 06:52:37,370 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-15 06:52:37,371 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-15 06:52:37,371 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-15 06:52:37,371 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-15 06:52:37,372 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-15 06:52:37,372 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-15 06:52:37,373 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-15 06:52:37,373 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-15 06:52:37,374 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-15 06:52:37,374 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-15 06:52:37,375 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-15 06:52:37,375 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-15 06:52:37,376 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-15 06:52:37,376 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-15 06:52:37,377 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-15 06:52:37,377 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-15 06:52:37,378 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-15 06:52:37,378 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-15 06:52:37,379 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-15 06:52:37,379 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-15 06:52:37,379 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-15 06:52:37,380 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-15 06:52:37,380 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-15 06:52:37,381 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-15 06:52:37,381 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-15 06:52:37,382 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-15 06:52:37,382 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-15 06:52:37,383 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-15 06:52:37,383 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-15 06:52:37,384 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-15 06:52:37,384 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-15 06:52:37,385 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-15 06:52:37,385 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-15 06:52:37,386 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-15 06:52:37,386 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-15 06:52:37,386 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-15 06:52:37,386 INFO L290 TraceCheckUtils]: 44: Hoare triple {65342#false} ~cond := #in~cond; {65342#false} is VALID [2022-04-15 06:52:37,386 INFO L290 TraceCheckUtils]: 45: Hoare triple {65342#false} assume 0 == ~cond; {65342#false} is VALID [2022-04-15 06:52:37,386 INFO L290 TraceCheckUtils]: 46: Hoare triple {65342#false} assume !false; {65342#false} is VALID [2022-04-15 06:52:37,386 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-15 06:52:37,386 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 06:52:39,668 INFO L290 TraceCheckUtils]: 46: Hoare triple {65342#false} assume !false; {65342#false} is VALID [2022-04-15 06:52:39,668 INFO L290 TraceCheckUtils]: 45: Hoare triple {65342#false} assume 0 == ~cond; {65342#false} is VALID [2022-04-15 06:52:39,668 INFO L290 TraceCheckUtils]: 44: Hoare triple {65342#false} ~cond := #in~cond; {65342#false} is VALID [2022-04-15 06:52:39,668 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-15 06:52:39,669 INFO L290 TraceCheckUtils]: 42: Hoare triple {65566#(< main_~z~0 main_~y~0)} assume !(~y~0 > ~z~0); {65342#false} is VALID [2022-04-15 06:52:39,669 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-15 06:52:39,670 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-15 06:52:39,670 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-15 06:52:39,670 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-15 06:52:39,671 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-15 06:52:39,671 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-15 06:52:39,672 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-15 06:52:39,672 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-15 06:52:39,673 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-15 06:52:39,673 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-15 06:52:39,674 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-15 06:52:39,674 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-15 06:52:39,674 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-15 06:52:39,675 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-15 06:52:39,675 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-15 06:52:39,676 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-15 06:52:39,676 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-15 06:52:39,677 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-15 06:52:39,677 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-15 06:52:39,678 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-15 06:52:39,678 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-15 06:52:39,679 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-15 06:52:39,679 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-15 06:52:39,680 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-15 06:52:39,680 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-15 06:52:39,680 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-15 06:52:39,681 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-15 06:52:39,681 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-15 06:52:39,682 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-15 06:52:39,682 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-15 06:52:39,683 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-15 06:52:39,683 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-15 06:52:39,683 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-15 06:52:39,684 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-15 06:52:39,684 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-15 06:52:39,685 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-15 06:52:39,685 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-15 06:52:39,685 INFO L272 TraceCheckUtils]: 4: Hoare triple {65341#true} call #t~ret9 := main(); {65341#true} is VALID [2022-04-15 06:52:39,685 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {65341#true} {65341#true} #52#return; {65341#true} is VALID [2022-04-15 06:52:39,685 INFO L290 TraceCheckUtils]: 2: Hoare triple {65341#true} assume true; {65341#true} is VALID [2022-04-15 06:52:39,685 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-15 06:52:39,685 INFO L272 TraceCheckUtils]: 0: Hoare triple {65341#true} call ULTIMATE.init(); {65341#true} is VALID [2022-04-15 06:52:39,686 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-15 06:52:39,686 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [190380560] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 06:52:39,686 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 06:52:39,686 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [36, 35, 35] total 102 [2022-04-15 06:52:42,580 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 06:52:42,580 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [983655011] [2022-04-15 06:52:42,580 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [983655011] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 06:52:42,580 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 06:52:42,580 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [98] imperfect sequences [] total 98 [2022-04-15 06:52:42,581 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1212577599] [2022-04-15 06:52:42,581 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 06:52:42,581 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-15 06:52:42,581 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 06:52:42,581 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-15 06:52:42,695 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-15 06:52:42,695 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 98 states [2022-04-15 06:52:42,695 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 06:52:42,696 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 98 interpolants. [2022-04-15 06:52:42,697 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10847, Invalid=15885, Unknown=0, NotChecked=0, Total=26732 [2022-04-15 06:52:42,697 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-15 06:52:58,757 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:52:58,757 INFO L93 Difference]: Finished difference Result 441 states and 463 transitions. [2022-04-15 06:52:58,757 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 98 states. [2022-04-15 06:52:58,757 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-15 06:52:58,758 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 06:52:58,758 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-15 06:52:58,759 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 198 transitions. [2022-04-15 06:52:58,759 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-15 06:52:58,761 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 198 transitions. [2022-04-15 06:52:58,761 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 98 states and 198 transitions. [2022-04-15 06:52:58,948 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-15 06:52:58,952 INFO L225 Difference]: With dead ends: 441 [2022-04-15 06:52:58,952 INFO L226 Difference]: Without dead ends: 292 [2022-04-15 06:52:58,955 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 354 GetRequests, 95 SyntacticMatches, 2 SemanticMatches, 257 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19386 ImplicationChecksByTransitivity, 9.5s TimeCoverageRelationStatistics Valid=22239, Invalid=44583, Unknown=0, NotChecked=0, Total=66822 [2022-04-15 06:52:58,955 INFO L913 BasicCegarLoop]: 12 mSDtfsCounter, 389 mSDsluCounter, 32 mSDsCounter, 0 mSdLazyCounter, 7752 mSolverCounterSat, 496 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.0s 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.1s IncrementalHoareTripleChecker+Time [2022-04-15 06:52:58,955 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [389 Valid, 44 Invalid, 8248 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [496 Valid, 7752 Invalid, 0 Unknown, 0 Unchecked, 6.1s Time] [2022-04-15 06:52:58,955 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 292 states. [2022-04-15 06:52:59,361 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 292 to 172. [2022-04-15 06:52:59,361 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 06:52:59,361 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-15 06:52:59,361 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-15 06:52:59,362 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-15 06:52:59,365 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:52:59,365 INFO L93 Difference]: Finished difference Result 292 states and 296 transitions. [2022-04-15 06:52:59,365 INFO L276 IsEmpty]: Start isEmpty. Operand 292 states and 296 transitions. [2022-04-15 06:52:59,365 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 06:52:59,365 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 06:52:59,365 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-15 06:52:59,365 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-15 06:52:59,368 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:52:59,368 INFO L93 Difference]: Finished difference Result 292 states and 296 transitions. [2022-04-15 06:52:59,368 INFO L276 IsEmpty]: Start isEmpty. Operand 292 states and 296 transitions. [2022-04-15 06:52:59,368 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 06:52:59,369 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 06:52:59,369 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 06:52:59,369 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 06:52:59,369 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-15 06:52:59,370 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 172 states to 172 states and 175 transitions. [2022-04-15 06:52:59,370 INFO L78 Accepts]: Start accepts. Automaton has 172 states and 175 transitions. Word has length 166 [2022-04-15 06:52:59,371 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 06:52:59,371 INFO L478 AbstractCegarLoop]: Abstraction has 172 states and 175 transitions. [2022-04-15 06:52:59,371 INFO L479 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-15 06:52:59,371 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 172 states and 175 transitions. [2022-04-15 06:52:59,552 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-15 06:52:59,552 INFO L276 IsEmpty]: Start isEmpty. Operand 172 states and 175 transitions. [2022-04-15 06:52:59,552 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 172 [2022-04-15 06:52:59,552 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 06:52:59,552 INFO L499 BasicCegarLoop]: trace histogram [63, 62, 33, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 06:52:59,568 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-15 06:52:59,753 WARN L460 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-15 06:52:59,753 INFO L403 AbstractCegarLoop]: === Iteration 50 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 06:52:59,753 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 06:52:59,753 INFO L85 PathProgramCache]: Analyzing trace with hash -2090883917, now seen corresponding path program 47 times [2022-04-15 06:52:59,753 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 06:52:59,753 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1169135943] [2022-04-15 06:53:02,457 WARN L977 rdanLoopAcceleration]: Unable to prove correctness of quantifier elimination. [2022-04-15 06:53:02,506 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-15 06:53:02,698 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-15 06:53:02,699 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-15 06:53:02,700 INFO L85 PathProgramCache]: Analyzing trace with hash 1894481538, now seen corresponding path program 1 times [2022-04-15 06:53:02,701 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 06:53:02,701 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [534648671] [2022-04-15 06:53:02,701 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 06:53:02,701 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 06:53:02,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:53:03,485 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 06:53:03,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:53:03,493 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-15 06:53:03,494 INFO L290 TraceCheckUtils]: 1: Hoare triple {67789#true} assume true; {67789#true} is VALID [2022-04-15 06:53:03,494 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {67789#true} {67789#true} #52#return; {67789#true} is VALID [2022-04-15 06:53:03,494 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-15 06:53:03,494 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-15 06:53:03,494 INFO L290 TraceCheckUtils]: 2: Hoare triple {67789#true} assume true; {67789#true} is VALID [2022-04-15 06:53:03,494 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {67789#true} {67789#true} #52#return; {67789#true} is VALID [2022-04-15 06:53:03,494 INFO L272 TraceCheckUtils]: 4: Hoare triple {67789#true} call #t~ret9 := main(); {67789#true} is VALID [2022-04-15 06:53:03,495 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-15 06:53:03,496 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-15 06:53:03,496 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-15 06:53:03,497 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-15 06:53:03,497 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-15 06:53:03,498 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-15 06:53:03,499 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-15 06:53:03,499 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-15 06:53:03,500 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-15 06:53:03,500 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-15 06:53:03,501 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-15 06:53:03,501 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-15 06:53:03,502 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-15 06:53:03,502 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-15 06:53:03,503 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-15 06:53:03,503 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-15 06:53:03,504 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-15 06:53:03,504 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-15 06:53:03,504 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-15 06:53:03,505 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-15 06:53:03,505 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-15 06:53:03,506 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-15 06:53:03,506 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-15 06:53:03,507 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-15 06:53:03,507 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-15 06:53:03,508 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-15 06:53:03,508 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-15 06:53:03,509 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-15 06:53:03,509 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-15 06:53:03,509 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-15 06:53:03,510 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-15 06:53:03,510 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-15 06:53:03,511 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-15 06:53:03,511 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-15 06:53:03,512 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-15 06:53:03,512 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-15 06:53:03,513 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-15 06:53:03,513 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-15 06:53:03,513 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-15 06:53:03,514 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-15 06:53:03,514 INFO L290 TraceCheckUtils]: 45: Hoare triple {67790#false} ~cond := #in~cond; {67790#false} is VALID [2022-04-15 06:53:03,514 INFO L290 TraceCheckUtils]: 46: Hoare triple {67790#false} assume 0 == ~cond; {67790#false} is VALID [2022-04-15 06:53:03,514 INFO L290 TraceCheckUtils]: 47: Hoare triple {67790#false} assume !false; {67790#false} is VALID [2022-04-15 06:53:03,514 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-15 06:53:03,514 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 06:53:03,514 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [534648671] [2022-04-15 06:53:03,514 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [534648671] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 06:53:03,514 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [180833685] [2022-04-15 06:53:03,514 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 06:53:03,515 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 06:53:03,515 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 06:53:03,516 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-15 06:53:03,527 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-15 06:53:03,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:53:03,573 INFO L263 TraceCheckSpWp]: Trace formula consists of 224 conjuncts, 40 conjunts are in the unsatisfiable core [2022-04-15 06:53:03,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:53:03,594 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 06:53:05,208 INFO L272 TraceCheckUtils]: 0: Hoare triple {67789#true} call ULTIMATE.init(); {67789#true} is VALID [2022-04-15 06:53:05,209 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-15 06:53:05,209 INFO L290 TraceCheckUtils]: 2: Hoare triple {67789#true} assume true; {67789#true} is VALID [2022-04-15 06:53:05,209 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {67789#true} {67789#true} #52#return; {67789#true} is VALID [2022-04-15 06:53:05,209 INFO L272 TraceCheckUtils]: 4: Hoare triple {67789#true} call #t~ret9 := main(); {67789#true} is VALID [2022-04-15 06:53:05,209 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-15 06:53:05,210 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-15 06:53:05,210 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-15 06:53:05,211 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-15 06:53:05,211 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-15 06:53:05,212 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-15 06:53:05,212 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-15 06:53:05,213 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-15 06:53:05,213 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-15 06:53:05,214 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-15 06:53:05,214 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-15 06:53:05,215 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-15 06:53:05,215 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-15 06:53:05,216 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-15 06:53:05,216 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-15 06:53:05,217 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-15 06:53:05,217 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-15 06:53:05,217 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-15 06:53:05,218 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-15 06:53:05,218 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-15 06:53:05,219 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-15 06:53:05,219 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-15 06:53:05,220 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-15 06:53:05,220 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-15 06:53:05,221 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-15 06:53:05,221 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-15 06:53:05,222 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-15 06:53:05,222 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-15 06:53:05,222 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-15 06:53:05,223 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-15 06:53:05,223 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-15 06:53:05,224 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-15 06:53:05,224 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-15 06:53:05,225 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-15 06:53:05,225 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-15 06:53:05,226 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-15 06:53:05,226 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-15 06:53:05,227 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-15 06:53:05,227 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-15 06:53:05,227 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-15 06:53:05,227 INFO L290 TraceCheckUtils]: 45: Hoare triple {67790#false} ~cond := #in~cond; {67790#false} is VALID [2022-04-15 06:53:05,227 INFO L290 TraceCheckUtils]: 46: Hoare triple {67790#false} assume 0 == ~cond; {67790#false} is VALID [2022-04-15 06:53:05,227 INFO L290 TraceCheckUtils]: 47: Hoare triple {67790#false} assume !false; {67790#false} is VALID [2022-04-15 06:53:05,227 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-15 06:53:05,228 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 06:53:07,826 INFO L290 TraceCheckUtils]: 47: Hoare triple {67790#false} assume !false; {67790#false} is VALID [2022-04-15 06:53:07,827 INFO L290 TraceCheckUtils]: 46: Hoare triple {67790#false} assume 0 == ~cond; {67790#false} is VALID [2022-04-15 06:53:07,827 INFO L290 TraceCheckUtils]: 45: Hoare triple {67790#false} ~cond := #in~cond; {67790#false} is VALID [2022-04-15 06:53:07,827 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-15 06:53:07,827 INFO L290 TraceCheckUtils]: 43: Hoare triple {68025#(< main_~z~0 main_~y~0)} assume !(~y~0 > ~z~0); {67790#false} is VALID [2022-04-15 06:53:07,828 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-15 06:53:07,828 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-15 06:53:07,829 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-15 06:53:07,829 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-15 06:53:07,830 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-15 06:53:07,831 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-15 06:53:07,831 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-15 06:53:07,832 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-15 06:53:07,832 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-15 06:53:07,833 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-15 06:53:07,833 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-15 06:53:07,834 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-15 06:53:07,834 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-15 06:53:07,835 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-15 06:53:07,835 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-15 06:53:07,836 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-15 06:53:07,836 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-15 06:53:07,837 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-15 06:53:07,837 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-15 06:53:07,838 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-15 06:53:07,838 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-15 06:53:07,839 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-15 06:53:07,839 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-15 06:53:07,840 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-15 06:53:07,840 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-15 06:53:07,841 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-15 06:53:07,841 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-15 06:53:07,842 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-15 06:53:07,842 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-15 06:53:07,843 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-15 06:53:07,843 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-15 06:53:07,844 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-15 06:53:07,844 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-15 06:53:07,845 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-15 06:53:07,846 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-15 06:53:07,846 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-15 06:53:07,847 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-15 06:53:07,848 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-15 06:53:07,848 INFO L272 TraceCheckUtils]: 4: Hoare triple {67789#true} call #t~ret9 := main(); {67789#true} is VALID [2022-04-15 06:53:07,848 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {67789#true} {67789#true} #52#return; {67789#true} is VALID [2022-04-15 06:53:07,848 INFO L290 TraceCheckUtils]: 2: Hoare triple {67789#true} assume true; {67789#true} is VALID [2022-04-15 06:53:07,848 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-15 06:53:07,848 INFO L272 TraceCheckUtils]: 0: Hoare triple {67789#true} call ULTIMATE.init(); {67789#true} is VALID [2022-04-15 06:53:07,848 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-15 06:53:07,848 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [180833685] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 06:53:07,848 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 06:53:07,848 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [40, 39, 39] total 114 [2022-04-15 06:53:11,798 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 06:53:11,799 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1169135943] [2022-04-15 06:53:11,799 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1169135943] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 06:53:11,799 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 06:53:11,799 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [101] imperfect sequences [] total 101 [2022-04-15 06:53:11,799 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [682616578] [2022-04-15 06:53:11,799 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 06:53:11,800 INFO L78 Accepts]: Start accepts. Automaton has has 101 states, 101 states have (on average 1.6534653465346534) internal successors, (167), 100 states have internal predecessors, (167), 2 states have call successors, (3), 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 171 [2022-04-15 06:53:11,800 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 06:53:11,800 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 101 states, 101 states have (on average 1.6534653465346534) internal successors, (167), 100 states have internal predecessors, (167), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:53:11,931 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 171 edges. 171 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 06:53:11,931 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 101 states [2022-04-15 06:53:11,931 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 06:53:11,931 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 101 interpolants. [2022-04-15 06:53:11,933 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8903, Invalid=22603, Unknown=0, NotChecked=0, Total=31506 [2022-04-15 06:53:11,933 INFO L87 Difference]: Start difference. First operand 172 states and 175 transitions. Second operand has 101 states, 101 states have (on average 1.6534653465346534) internal successors, (167), 100 states have internal predecessors, (167), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:53:30,340 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:53:30,340 INFO L93 Difference]: Finished difference Result 463 states and 474 transitions. [2022-04-15 06:53:30,340 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 101 states. [2022-04-15 06:53:30,340 INFO L78 Accepts]: Start accepts. Automaton has has 101 states, 101 states have (on average 1.6534653465346534) internal successors, (167), 100 states have internal predecessors, (167), 2 states have call successors, (3), 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 171 [2022-04-15 06:53:30,340 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 06:53:30,340 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 101 states, 101 states have (on average 1.6534653465346534) internal successors, (167), 100 states have internal predecessors, (167), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:53:30,342 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 193 transitions. [2022-04-15 06:53:30,342 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 101 states, 101 states have (on average 1.6534653465346534) internal successors, (167), 100 states have internal predecessors, (167), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:53:30,343 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 193 transitions. [2022-04-15 06:53:30,343 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 101 states and 193 transitions. [2022-04-15 06:53:30,489 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 193 edges. 193 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 06:53:30,492 INFO L225 Difference]: With dead ends: 463 [2022-04-15 06:53:30,493 INFO L226 Difference]: Without dead ends: 299 [2022-04-15 06:53:30,496 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 366 GetRequests, 90 SyntacticMatches, 2 SemanticMatches, 274 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22626 ImplicationChecksByTransitivity, 12.1s TimeCoverageRelationStatistics Valid=17932, Invalid=57968, Unknown=0, NotChecked=0, Total=75900 [2022-04-15 06:53:30,496 INFO L913 BasicCegarLoop]: 12 mSDtfsCounter, 336 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 8494 mSolverCounterSat, 369 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 336 SdHoareTripleChecker+Valid, 34 SdHoareTripleChecker+Invalid, 8863 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 369 IncrementalHoareTripleChecker+Valid, 8494 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6.6s IncrementalHoareTripleChecker+Time [2022-04-15 06:53:30,496 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [336 Valid, 34 Invalid, 8863 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [369 Valid, 8494 Invalid, 0 Unknown, 0 Unchecked, 6.6s Time] [2022-04-15 06:53:30,497 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 299 states. [2022-04-15 06:53:31,262 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 299 to 299. [2022-04-15 06:53:31,262 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 06:53:31,263 INFO L82 GeneralOperation]: Start isEquivalent. First operand 299 states. Second operand has 299 states, 294 states have (on average 1.0170068027210883) internal successors, (299), 294 states have internal predecessors, (299), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:53:31,263 INFO L74 IsIncluded]: Start isIncluded. First operand 299 states. Second operand has 299 states, 294 states have (on average 1.0170068027210883) internal successors, (299), 294 states have internal predecessors, (299), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:53:31,263 INFO L87 Difference]: Start difference. First operand 299 states. Second operand has 299 states, 294 states have (on average 1.0170068027210883) internal successors, (299), 294 states have internal predecessors, (299), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:53:31,266 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:53:31,266 INFO L93 Difference]: Finished difference Result 299 states and 303 transitions. [2022-04-15 06:53:31,266 INFO L276 IsEmpty]: Start isEmpty. Operand 299 states and 303 transitions. [2022-04-15 06:53:31,266 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 06:53:31,266 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 06:53:31,267 INFO L74 IsIncluded]: Start isIncluded. First operand has 299 states, 294 states have (on average 1.0170068027210883) internal successors, (299), 294 states have internal predecessors, (299), 3 states have call successors, (3), 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 299 states. [2022-04-15 06:53:31,267 INFO L87 Difference]: Start difference. First operand has 299 states, 294 states have (on average 1.0170068027210883) internal successors, (299), 294 states have internal predecessors, (299), 3 states have call successors, (3), 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 299 states. [2022-04-15 06:53:31,270 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:53:31,270 INFO L93 Difference]: Finished difference Result 299 states and 303 transitions. [2022-04-15 06:53:31,270 INFO L276 IsEmpty]: Start isEmpty. Operand 299 states and 303 transitions. [2022-04-15 06:53:31,270 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 06:53:31,270 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 06:53:31,270 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 06:53:31,270 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 06:53:31,270 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 299 states, 294 states have (on average 1.0170068027210883) internal successors, (299), 294 states have internal predecessors, (299), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:53:31,274 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 299 states to 299 states and 303 transitions. [2022-04-15 06:53:31,274 INFO L78 Accepts]: Start accepts. Automaton has 299 states and 303 transitions. Word has length 171 [2022-04-15 06:53:31,274 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 06:53:31,274 INFO L478 AbstractCegarLoop]: Abstraction has 299 states and 303 transitions. [2022-04-15 06:53:31,274 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 101 states, 101 states have (on average 1.6534653465346534) internal successors, (167), 100 states have internal predecessors, (167), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:53:31,275 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 299 states and 303 transitions. [2022-04-15 06:53:31,587 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 303 edges. 303 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 06:53:31,587 INFO L276 IsEmpty]: Start isEmpty. Operand 299 states and 303 transitions. [2022-04-15 06:53:31,587 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 175 [2022-04-15 06:53:31,587 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 06:53:31,587 INFO L499 BasicCegarLoop]: trace histogram [64, 63, 34, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 06:53:31,605 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (48)] Forceful destruction successful, exit code 0 [2022-04-15 06:53:31,788 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 48 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable49 [2022-04-15 06:53:31,788 INFO L403 AbstractCegarLoop]: === Iteration 51 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 06:53:31,788 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 06:53:31,788 INFO L85 PathProgramCache]: Analyzing trace with hash 1318200085, now seen corresponding path program 48 times [2022-04-15 06:53:31,788 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 06:53:31,788 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [554157613] [2022-04-15 06:53:35,852 WARN L977 rdanLoopAcceleration]: Unable to prove correctness of quantifier elimination. [2022-04-15 06:53:35,914 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-15 06:53:40,025 WARN L977 rdanLoopAcceleration]: Unable to prove correctness of quantifier elimination. [2022-04-15 06:53:40,127 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-15 06:53:40,128 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-15 06:53:40,130 INFO L85 PathProgramCache]: Analyzing trace with hash -264924127, now seen corresponding path program 1 times [2022-04-15 06:53:40,130 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 06:53:40,130 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [315932205] [2022-04-15 06:53:40,130 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 06:53:40,130 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 06:53:40,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:53:40,819 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 06:53:40,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:53:40,821 INFO L290 TraceCheckUtils]: 0: Hoare triple {70615#(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); {70575#true} is VALID [2022-04-15 06:53:40,821 INFO L290 TraceCheckUtils]: 1: Hoare triple {70575#true} assume true; {70575#true} is VALID [2022-04-15 06:53:40,821 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {70575#true} {70575#true} #52#return; {70575#true} is VALID [2022-04-15 06:53:40,822 INFO L272 TraceCheckUtils]: 0: Hoare triple {70575#true} call ULTIMATE.init(); {70615#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 06:53:40,822 INFO L290 TraceCheckUtils]: 1: Hoare triple {70615#(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); {70575#true} is VALID [2022-04-15 06:53:40,822 INFO L290 TraceCheckUtils]: 2: Hoare triple {70575#true} assume true; {70575#true} is VALID [2022-04-15 06:53:40,822 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {70575#true} {70575#true} #52#return; {70575#true} is VALID [2022-04-15 06:53:40,822 INFO L272 TraceCheckUtils]: 4: Hoare triple {70575#true} call #t~ret9 := main(); {70575#true} is VALID [2022-04-15 06:53:40,822 INFO L290 TraceCheckUtils]: 5: Hoare triple {70575#true} ~x~0 := 0;~y~0 := 50000;~z~0 := 0;~x~0 := 0; {70580#(and (= main_~z~0 0) (<= 50000 main_~y~0))} is VALID [2022-04-15 06:53:40,823 INFO L290 TraceCheckUtils]: 6: Hoare triple {70580#(and (= main_~z~0 0) (<= 50000 main_~y~0))} [248] L11-2-->L18-1_primed: Formula: (let ((.cse0 (= v_main_~x~0_3181 v_main_~x~0_3180)) (.cse1 (= |v_main_#t~post4_299| |v_main_#t~post4_298|))) (or (and .cse0 .cse1) (and (< v_main_~x~0_3181 v_main_~x~0_3180) (< v_main_~x~0_3180 50001)) (and (<= 50000 v_main_~x~0_3181) .cse0 .cse1))) InVars {main_~x~0=v_main_~x~0_3181, main_#t~post4=|v_main_#t~post4_299|} OutVars{main_~x~0=v_main_~x~0_3180, main_#t~post4=|v_main_#t~post4_298|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {70580#(and (= main_~z~0 0) (<= 50000 main_~y~0))} is VALID [2022-04-15 06:53:40,823 INFO L290 TraceCheckUtils]: 7: Hoare triple {70580#(and (= main_~z~0 0) (<= 50000 main_~y~0))} [249] L18-1_primed-->L11-2: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {70580#(and (= main_~z~0 0) (<= 50000 main_~y~0))} is VALID [2022-04-15 06:53:40,824 INFO L290 TraceCheckUtils]: 8: Hoare triple {70580#(and (= main_~z~0 0) (<= 50000 main_~y~0))} [250] L11-2-->L18-1_primed: Formula: (let ((.cse0 (= v_main_~y~0_3619 v_main_~y~0_3618)) (.cse1 (= |v_main_#t~post6_333| |v_main_#t~post6_332|)) (.cse2 (= |v_main_#t~post5_333| |v_main_#t~post5_332|)) (.cse3 (= v_main_~x~0_3183 v_main_~x~0_3182)) (.cse5 (<= 50000 v_main_~x~0_3183))) (or (and .cse0 .cse1 .cse2 .cse3) (let ((.cse4 (+ v_main_~x~0_3183 v_main_~y~0_3618))) (and (= .cse4 (+ v_main_~x~0_3182 v_main_~y~0_3619)) (< .cse4 (+ 1000001 v_main_~y~0_3619)) (< v_main_~y~0_3619 v_main_~y~0_3618) .cse5)) (and .cse0 .cse1 .cse2 .cse3 (or (not .cse5) (not (< v_main_~x~0_3183 1000000)))))) InVars {main_~y~0=v_main_~y~0_3619, main_#t~post5=|v_main_#t~post5_333|, main_~x~0=v_main_~x~0_3183, main_#t~post6=|v_main_#t~post6_333|} OutVars{main_~y~0=v_main_~y~0_3618, main_#t~post5=|v_main_#t~post5_332|, main_~x~0=v_main_~x~0_3182, main_#t~post6=|v_main_#t~post6_332|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {70580#(and (= main_~z~0 0) (<= 50000 main_~y~0))} is VALID [2022-04-15 06:53:40,824 INFO L290 TraceCheckUtils]: 9: Hoare triple {70580#(and (= main_~z~0 0) (<= 50000 main_~y~0))} [247] 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[] {70580#(and (= main_~z~0 0) (<= 50000 main_~y~0))} is VALID [2022-04-15 06:53:40,825 INFO L290 TraceCheckUtils]: 10: Hoare triple {70580#(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; {70581#(and (= main_~z~0 0) (<= 49999 main_~y~0))} is VALID [2022-04-15 06:53:40,825 INFO L290 TraceCheckUtils]: 11: Hoare triple {70581#(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; {70582#(and (<= 49998 main_~y~0) (= main_~z~0 0))} is VALID [2022-04-15 06:53:40,826 INFO L290 TraceCheckUtils]: 12: Hoare triple {70582#(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; {70583#(and (= main_~z~0 0) (<= 49997 main_~y~0))} is VALID [2022-04-15 06:53:40,826 INFO L290 TraceCheckUtils]: 13: Hoare triple {70583#(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; {70584#(and (= main_~z~0 0) (<= 49996 main_~y~0))} is VALID [2022-04-15 06:53:40,827 INFO L290 TraceCheckUtils]: 14: Hoare triple {70584#(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; {70585#(and (= main_~z~0 0) (<= 49995 main_~y~0))} is VALID [2022-04-15 06:53:40,827 INFO L290 TraceCheckUtils]: 15: Hoare triple {70585#(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; {70586#(and (= main_~z~0 0) (<= 49994 main_~y~0))} is VALID [2022-04-15 06:53:40,828 INFO L290 TraceCheckUtils]: 16: Hoare triple {70586#(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; {70587#(and (= main_~z~0 0) (<= 49993 main_~y~0))} is VALID [2022-04-15 06:53:40,828 INFO L290 TraceCheckUtils]: 17: Hoare triple {70587#(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; {70588#(and (= main_~z~0 0) (<= 49992 main_~y~0))} is VALID [2022-04-15 06:53:40,828 INFO L290 TraceCheckUtils]: 18: Hoare triple {70588#(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; {70589#(and (= main_~z~0 0) (<= 49991 main_~y~0))} is VALID [2022-04-15 06:53:40,829 INFO L290 TraceCheckUtils]: 19: Hoare triple {70589#(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; {70590#(and (<= 49990 main_~y~0) (= main_~z~0 0))} is VALID [2022-04-15 06:53:40,829 INFO L290 TraceCheckUtils]: 20: Hoare triple {70590#(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; {70591#(and (= main_~z~0 0) (<= 49989 main_~y~0))} is VALID [2022-04-15 06:53:40,830 INFO L290 TraceCheckUtils]: 21: Hoare triple {70591#(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; {70592#(and (= main_~z~0 0) (<= 49988 main_~y~0))} is VALID [2022-04-15 06:53:40,830 INFO L290 TraceCheckUtils]: 22: Hoare triple {70592#(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; {70593#(and (= main_~z~0 0) (<= 49987 main_~y~0))} is VALID [2022-04-15 06:53:40,831 INFO L290 TraceCheckUtils]: 23: Hoare triple {70593#(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; {70594#(and (= main_~z~0 0) (<= 49986 main_~y~0))} is VALID [2022-04-15 06:53:40,831 INFO L290 TraceCheckUtils]: 24: Hoare triple {70594#(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; {70595#(and (= main_~z~0 0) (<= 49985 main_~y~0))} is VALID [2022-04-15 06:53:40,832 INFO L290 TraceCheckUtils]: 25: Hoare triple {70595#(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; {70596#(and (= main_~z~0 0) (<= 49984 main_~y~0))} is VALID [2022-04-15 06:53:40,832 INFO L290 TraceCheckUtils]: 26: Hoare triple {70596#(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; {70597#(and (= main_~z~0 0) (<= 49983 main_~y~0))} is VALID [2022-04-15 06:53:40,832 INFO L290 TraceCheckUtils]: 27: Hoare triple {70597#(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; {70598#(and (= main_~z~0 0) (<= 49982 main_~y~0))} is VALID [2022-04-15 06:53:40,833 INFO L290 TraceCheckUtils]: 28: Hoare triple {70598#(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; {70599#(and (<= 49981 main_~y~0) (= main_~z~0 0))} is VALID [2022-04-15 06:53:40,833 INFO L290 TraceCheckUtils]: 29: Hoare triple {70599#(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; {70600#(and (= main_~z~0 0) (<= 49980 main_~y~0))} is VALID [2022-04-15 06:53:40,834 INFO L290 TraceCheckUtils]: 30: Hoare triple {70600#(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; {70601#(and (= main_~z~0 0) (<= 49979 main_~y~0))} is VALID [2022-04-15 06:53:40,834 INFO L290 TraceCheckUtils]: 31: Hoare triple {70601#(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; {70602#(and (= main_~z~0 0) (<= 49978 main_~y~0))} is VALID [2022-04-15 06:53:40,835 INFO L290 TraceCheckUtils]: 32: Hoare triple {70602#(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; {70603#(and (= main_~z~0 0) (<= 49977 main_~y~0))} is VALID [2022-04-15 06:53:40,835 INFO L290 TraceCheckUtils]: 33: Hoare triple {70603#(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; {70604#(and (= main_~z~0 0) (<= 49976 main_~y~0))} is VALID [2022-04-15 06:53:40,836 INFO L290 TraceCheckUtils]: 34: Hoare triple {70604#(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; {70605#(and (= main_~z~0 0) (<= 49975 main_~y~0))} is VALID [2022-04-15 06:53:40,836 INFO L290 TraceCheckUtils]: 35: Hoare triple {70605#(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; {70606#(and (= main_~z~0 0) (<= 49974 main_~y~0))} is VALID [2022-04-15 06:53:40,837 INFO L290 TraceCheckUtils]: 36: Hoare triple {70606#(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; {70607#(and (= main_~z~0 0) (<= 49973 main_~y~0))} is VALID [2022-04-15 06:53:40,837 INFO L290 TraceCheckUtils]: 37: Hoare triple {70607#(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; {70608#(and (= main_~z~0 0) (<= 49972 main_~y~0))} is VALID [2022-04-15 06:53:40,837 INFO L290 TraceCheckUtils]: 38: Hoare triple {70608#(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; {70609#(and (= main_~z~0 0) (<= 49971 main_~y~0))} is VALID [2022-04-15 06:53:40,838 INFO L290 TraceCheckUtils]: 39: Hoare triple {70609#(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; {70610#(and (= main_~z~0 0) (<= 49970 main_~y~0))} is VALID [2022-04-15 06:53:40,838 INFO L290 TraceCheckUtils]: 40: Hoare triple {70610#(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; {70611#(and (= main_~z~0 0) (<= 49969 main_~y~0))} is VALID [2022-04-15 06:53:40,839 INFO L290 TraceCheckUtils]: 41: Hoare triple {70611#(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; {70612#(and (= main_~z~0 0) (<= 49968 main_~y~0))} is VALID [2022-04-15 06:53:40,839 INFO L290 TraceCheckUtils]: 42: Hoare triple {70612#(and (= main_~z~0 0) (<= 49968 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {70613#(and (= main_~z~0 0) (<= 49967 main_~y~0))} is VALID [2022-04-15 06:53:40,840 INFO L290 TraceCheckUtils]: 43: Hoare triple {70613#(and (= main_~z~0 0) (<= 49967 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {70614#(and (= main_~z~0 0) (<= 49966 main_~y~0))} is VALID [2022-04-15 06:53:40,840 INFO L290 TraceCheckUtils]: 44: Hoare triple {70614#(and (= main_~z~0 0) (<= 49966 main_~y~0))} assume !(~y~0 > ~z~0); {70576#false} is VALID [2022-04-15 06:53:40,840 INFO L272 TraceCheckUtils]: 45: Hoare triple {70576#false} call __VERIFIER_assert((if ~x~0 == ~z~0 then 1 else 0)); {70576#false} is VALID [2022-04-15 06:53:40,840 INFO L290 TraceCheckUtils]: 46: Hoare triple {70576#false} ~cond := #in~cond; {70576#false} is VALID [2022-04-15 06:53:40,840 INFO L290 TraceCheckUtils]: 47: Hoare triple {70576#false} assume 0 == ~cond; {70576#false} is VALID [2022-04-15 06:53:40,840 INFO L290 TraceCheckUtils]: 48: Hoare triple {70576#false} assume !false; {70576#false} is VALID [2022-04-15 06:53:40,841 INFO L134 CoverageAnalysis]: Checked inductivity of 597 backedges. 0 proven. 595 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-04-15 06:53:40,841 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 06:53:40,841 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [315932205] [2022-04-15 06:53:40,841 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [315932205] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 06:53:40,841 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1545277009] [2022-04-15 06:53:40,841 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 06:53:40,841 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 06:53:40,841 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 06:53:40,842 INFO L229 MonitoredProcess]: Starting monitored process 49 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-15 06:53:40,842 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (49)] Waiting until timeout for monitored process [2022-04-15 06:53:40,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:53:40,895 INFO L263 TraceCheckSpWp]: Trace formula consists of 229 conjuncts, 38 conjunts are in the unsatisfiable core [2022-04-15 06:53:40,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:53:40,916 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 06:53:42,680 INFO L272 TraceCheckUtils]: 0: Hoare triple {70575#true} call ULTIMATE.init(); {70575#true} is VALID [2022-04-15 06:53:42,681 INFO L290 TraceCheckUtils]: 1: Hoare triple {70575#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); {70575#true} is VALID [2022-04-15 06:53:42,681 INFO L290 TraceCheckUtils]: 2: Hoare triple {70575#true} assume true; {70575#true} is VALID [2022-04-15 06:53:42,681 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {70575#true} {70575#true} #52#return; {70575#true} is VALID [2022-04-15 06:53:42,681 INFO L272 TraceCheckUtils]: 4: Hoare triple {70575#true} call #t~ret9 := main(); {70575#true} is VALID [2022-04-15 06:53:42,681 INFO L290 TraceCheckUtils]: 5: Hoare triple {70575#true} ~x~0 := 0;~y~0 := 50000;~z~0 := 0;~x~0 := 0; {70634#(and (<= main_~z~0 0) (<= 50000 main_~y~0))} is VALID [2022-04-15 06:53:42,682 INFO L290 TraceCheckUtils]: 6: Hoare triple {70634#(and (<= main_~z~0 0) (<= 50000 main_~y~0))} [248] L11-2-->L18-1_primed: Formula: (let ((.cse0 (= v_main_~x~0_3181 v_main_~x~0_3180)) (.cse1 (= |v_main_#t~post4_299| |v_main_#t~post4_298|))) (or (and .cse0 .cse1) (and (< v_main_~x~0_3181 v_main_~x~0_3180) (< v_main_~x~0_3180 50001)) (and (<= 50000 v_main_~x~0_3181) .cse0 .cse1))) InVars {main_~x~0=v_main_~x~0_3181, main_#t~post4=|v_main_#t~post4_299|} OutVars{main_~x~0=v_main_~x~0_3180, main_#t~post4=|v_main_#t~post4_298|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {70634#(and (<= main_~z~0 0) (<= 50000 main_~y~0))} is VALID [2022-04-15 06:53:42,682 INFO L290 TraceCheckUtils]: 7: Hoare triple {70634#(and (<= main_~z~0 0) (<= 50000 main_~y~0))} [249] L18-1_primed-->L11-2: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {70634#(and (<= main_~z~0 0) (<= 50000 main_~y~0))} is VALID [2022-04-15 06:53:42,683 INFO L290 TraceCheckUtils]: 8: Hoare triple {70634#(and (<= main_~z~0 0) (<= 50000 main_~y~0))} [250] L11-2-->L18-1_primed: Formula: (let ((.cse0 (= v_main_~y~0_3619 v_main_~y~0_3618)) (.cse1 (= |v_main_#t~post6_333| |v_main_#t~post6_332|)) (.cse2 (= |v_main_#t~post5_333| |v_main_#t~post5_332|)) (.cse3 (= v_main_~x~0_3183 v_main_~x~0_3182)) (.cse5 (<= 50000 v_main_~x~0_3183))) (or (and .cse0 .cse1 .cse2 .cse3) (let ((.cse4 (+ v_main_~x~0_3183 v_main_~y~0_3618))) (and (= .cse4 (+ v_main_~x~0_3182 v_main_~y~0_3619)) (< .cse4 (+ 1000001 v_main_~y~0_3619)) (< v_main_~y~0_3619 v_main_~y~0_3618) .cse5)) (and .cse0 .cse1 .cse2 .cse3 (or (not .cse5) (not (< v_main_~x~0_3183 1000000)))))) InVars {main_~y~0=v_main_~y~0_3619, main_#t~post5=|v_main_#t~post5_333|, main_~x~0=v_main_~x~0_3183, main_#t~post6=|v_main_#t~post6_333|} OutVars{main_~y~0=v_main_~y~0_3618, main_#t~post5=|v_main_#t~post5_332|, main_~x~0=v_main_~x~0_3182, main_#t~post6=|v_main_#t~post6_332|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {70634#(and (<= main_~z~0 0) (<= 50000 main_~y~0))} is VALID [2022-04-15 06:53:42,683 INFO L290 TraceCheckUtils]: 9: Hoare triple {70634#(and (<= main_~z~0 0) (<= 50000 main_~y~0))} [247] 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[] {70634#(and (<= main_~z~0 0) (<= 50000 main_~y~0))} is VALID [2022-04-15 06:53:42,684 INFO L290 TraceCheckUtils]: 10: Hoare triple {70634#(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; {70650#(and (<= main_~z~0 0) (<= 49999 main_~y~0))} is VALID [2022-04-15 06:53:42,684 INFO L290 TraceCheckUtils]: 11: Hoare triple {70650#(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; {70654#(and (<= main_~z~0 0) (<= 49998 main_~y~0))} is VALID [2022-04-15 06:53:42,685 INFO L290 TraceCheckUtils]: 12: Hoare triple {70654#(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; {70658#(and (<= main_~z~0 0) (<= 49997 main_~y~0))} is VALID [2022-04-15 06:53:42,685 INFO L290 TraceCheckUtils]: 13: Hoare triple {70658#(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; {70662#(and (<= main_~z~0 0) (<= 49996 main_~y~0))} is VALID [2022-04-15 06:53:42,685 INFO L290 TraceCheckUtils]: 14: Hoare triple {70662#(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; {70666#(and (<= main_~z~0 0) (<= 49995 main_~y~0))} is VALID [2022-04-15 06:53:42,686 INFO L290 TraceCheckUtils]: 15: Hoare triple {70666#(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; {70670#(and (<= main_~z~0 0) (<= 49994 main_~y~0))} is VALID [2022-04-15 06:53:42,686 INFO L290 TraceCheckUtils]: 16: Hoare triple {70670#(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; {70674#(and (<= main_~z~0 0) (<= 49993 main_~y~0))} is VALID [2022-04-15 06:53:42,687 INFO L290 TraceCheckUtils]: 17: Hoare triple {70674#(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; {70678#(and (<= main_~z~0 0) (<= 49992 main_~y~0))} is VALID [2022-04-15 06:53:42,687 INFO L290 TraceCheckUtils]: 18: Hoare triple {70678#(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; {70682#(and (<= main_~z~0 0) (<= 49991 main_~y~0))} is VALID [2022-04-15 06:53:42,688 INFO L290 TraceCheckUtils]: 19: Hoare triple {70682#(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; {70686#(and (<= main_~z~0 0) (<= 49990 main_~y~0))} is VALID [2022-04-15 06:53:42,688 INFO L290 TraceCheckUtils]: 20: Hoare triple {70686#(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; {70690#(and (<= main_~z~0 0) (<= 49989 main_~y~0))} is VALID [2022-04-15 06:53:42,689 INFO L290 TraceCheckUtils]: 21: Hoare triple {70690#(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; {70694#(and (<= main_~z~0 0) (<= 49988 main_~y~0))} is VALID [2022-04-15 06:53:42,689 INFO L290 TraceCheckUtils]: 22: Hoare triple {70694#(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; {70698#(and (<= main_~z~0 0) (<= 49987 main_~y~0))} is VALID [2022-04-15 06:53:42,690 INFO L290 TraceCheckUtils]: 23: Hoare triple {70698#(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; {70702#(and (<= main_~z~0 0) (<= 49986 main_~y~0))} is VALID [2022-04-15 06:53:42,690 INFO L290 TraceCheckUtils]: 24: Hoare triple {70702#(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; {70706#(and (<= main_~z~0 0) (<= 49985 main_~y~0))} is VALID [2022-04-15 06:53:42,691 INFO L290 TraceCheckUtils]: 25: Hoare triple {70706#(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; {70710#(and (<= main_~z~0 0) (<= 49984 main_~y~0))} is VALID [2022-04-15 06:53:42,691 INFO L290 TraceCheckUtils]: 26: Hoare triple {70710#(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; {70714#(and (<= main_~z~0 0) (<= 49983 main_~y~0))} is VALID [2022-04-15 06:53:42,692 INFO L290 TraceCheckUtils]: 27: Hoare triple {70714#(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; {70718#(and (<= main_~z~0 0) (<= 49982 main_~y~0))} is VALID [2022-04-15 06:53:42,692 INFO L290 TraceCheckUtils]: 28: Hoare triple {70718#(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; {70722#(and (<= main_~z~0 0) (<= 49981 main_~y~0))} is VALID [2022-04-15 06:53:42,693 INFO L290 TraceCheckUtils]: 29: Hoare triple {70722#(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; {70726#(and (<= main_~z~0 0) (<= 49980 main_~y~0))} is VALID [2022-04-15 06:53:42,693 INFO L290 TraceCheckUtils]: 30: Hoare triple {70726#(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; {70730#(and (<= main_~z~0 0) (<= 49979 main_~y~0))} is VALID [2022-04-15 06:53:42,693 INFO L290 TraceCheckUtils]: 31: Hoare triple {70730#(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; {70734#(and (<= main_~z~0 0) (<= 49978 main_~y~0))} is VALID [2022-04-15 06:53:42,694 INFO L290 TraceCheckUtils]: 32: Hoare triple {70734#(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; {70738#(and (<= main_~z~0 0) (<= 49977 main_~y~0))} is VALID [2022-04-15 06:53:42,694 INFO L290 TraceCheckUtils]: 33: Hoare triple {70738#(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; {70742#(and (<= main_~z~0 0) (<= 49976 main_~y~0))} is VALID [2022-04-15 06:53:42,695 INFO L290 TraceCheckUtils]: 34: Hoare triple {70742#(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; {70746#(and (<= main_~z~0 0) (<= 49975 main_~y~0))} is VALID [2022-04-15 06:53:42,695 INFO L290 TraceCheckUtils]: 35: Hoare triple {70746#(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; {70750#(and (<= main_~z~0 0) (<= 49974 main_~y~0))} is VALID [2022-04-15 06:53:42,696 INFO L290 TraceCheckUtils]: 36: Hoare triple {70750#(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; {70754#(and (<= main_~z~0 0) (<= 49973 main_~y~0))} is VALID [2022-04-15 06:53:42,696 INFO L290 TraceCheckUtils]: 37: Hoare triple {70754#(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; {70758#(and (<= main_~z~0 0) (<= 49972 main_~y~0))} is VALID [2022-04-15 06:53:42,697 INFO L290 TraceCheckUtils]: 38: Hoare triple {70758#(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; {70762#(and (<= main_~z~0 0) (<= 49971 main_~y~0))} is VALID [2022-04-15 06:53:42,697 INFO L290 TraceCheckUtils]: 39: Hoare triple {70762#(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; {70766#(and (<= main_~z~0 0) (<= 49970 main_~y~0))} is VALID [2022-04-15 06:53:42,698 INFO L290 TraceCheckUtils]: 40: Hoare triple {70766#(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; {70770#(and (<= main_~z~0 0) (<= 49969 main_~y~0))} is VALID [2022-04-15 06:53:42,698 INFO L290 TraceCheckUtils]: 41: Hoare triple {70770#(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; {70774#(and (<= main_~z~0 0) (<= 49968 main_~y~0))} is VALID [2022-04-15 06:53:42,699 INFO L290 TraceCheckUtils]: 42: Hoare triple {70774#(and (<= main_~z~0 0) (<= 49968 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {70778#(and (<= main_~z~0 0) (<= 49967 main_~y~0))} is VALID [2022-04-15 06:53:42,699 INFO L290 TraceCheckUtils]: 43: Hoare triple {70778#(and (<= main_~z~0 0) (<= 49967 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {70782#(and (<= main_~z~0 0) (<= 49966 main_~y~0))} is VALID [2022-04-15 06:53:42,699 INFO L290 TraceCheckUtils]: 44: Hoare triple {70782#(and (<= main_~z~0 0) (<= 49966 main_~y~0))} assume !(~y~0 > ~z~0); {70576#false} is VALID [2022-04-15 06:53:42,700 INFO L272 TraceCheckUtils]: 45: Hoare triple {70576#false} call __VERIFIER_assert((if ~x~0 == ~z~0 then 1 else 0)); {70576#false} is VALID [2022-04-15 06:53:42,700 INFO L290 TraceCheckUtils]: 46: Hoare triple {70576#false} ~cond := #in~cond; {70576#false} is VALID [2022-04-15 06:53:42,700 INFO L290 TraceCheckUtils]: 47: Hoare triple {70576#false} assume 0 == ~cond; {70576#false} is VALID [2022-04-15 06:53:42,700 INFO L290 TraceCheckUtils]: 48: Hoare triple {70576#false} assume !false; {70576#false} is VALID [2022-04-15 06:53:42,700 INFO L134 CoverageAnalysis]: Checked inductivity of 597 backedges. 0 proven. 595 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-04-15 06:53:42,700 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 06:53:45,196 INFO L290 TraceCheckUtils]: 48: Hoare triple {70576#false} assume !false; {70576#false} is VALID [2022-04-15 06:53:45,196 INFO L290 TraceCheckUtils]: 47: Hoare triple {70576#false} assume 0 == ~cond; {70576#false} is VALID [2022-04-15 06:53:45,196 INFO L290 TraceCheckUtils]: 46: Hoare triple {70576#false} ~cond := #in~cond; {70576#false} is VALID [2022-04-15 06:53:45,196 INFO L272 TraceCheckUtils]: 45: Hoare triple {70576#false} call __VERIFIER_assert((if ~x~0 == ~z~0 then 1 else 0)); {70576#false} is VALID [2022-04-15 06:53:45,196 INFO L290 TraceCheckUtils]: 44: Hoare triple {70810#(< main_~z~0 main_~y~0)} assume !(~y~0 > ~z~0); {70576#false} is VALID [2022-04-15 06:53:45,197 INFO L290 TraceCheckUtils]: 43: Hoare triple {70814#(< (+ 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; {70810#(< main_~z~0 main_~y~0)} is VALID [2022-04-15 06:53:45,197 INFO L290 TraceCheckUtils]: 42: Hoare triple {70818#(< (+ 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; {70814#(< (+ main_~z~0 1) main_~y~0)} is VALID [2022-04-15 06:53:45,198 INFO L290 TraceCheckUtils]: 41: Hoare triple {70822#(< (+ 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; {70818#(< (+ main_~z~0 2) main_~y~0)} is VALID [2022-04-15 06:53:45,198 INFO L290 TraceCheckUtils]: 40: Hoare triple {70826#(< (+ 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; {70822#(< (+ main_~z~0 3) main_~y~0)} is VALID [2022-04-15 06:53:45,199 INFO L290 TraceCheckUtils]: 39: Hoare triple {70830#(< (+ 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; {70826#(< (+ main_~z~0 4) main_~y~0)} is VALID [2022-04-15 06:53:45,199 INFO L290 TraceCheckUtils]: 38: Hoare triple {70834#(< (+ 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; {70830#(< (+ 5 main_~z~0) main_~y~0)} is VALID [2022-04-15 06:53:45,199 INFO L290 TraceCheckUtils]: 37: Hoare triple {70838#(< (+ 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; {70834#(< (+ main_~z~0 6) main_~y~0)} is VALID [2022-04-15 06:53:45,200 INFO L290 TraceCheckUtils]: 36: Hoare triple {70842#(< (+ 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; {70838#(< (+ 7 main_~z~0) main_~y~0)} is VALID [2022-04-15 06:53:45,200 INFO L290 TraceCheckUtils]: 35: Hoare triple {70846#(< (+ 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; {70842#(< (+ main_~z~0 8) main_~y~0)} is VALID [2022-04-15 06:53:45,201 INFO L290 TraceCheckUtils]: 34: Hoare triple {70850#(< (+ 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; {70846#(< (+ main_~z~0 9) main_~y~0)} is VALID [2022-04-15 06:53:45,201 INFO L290 TraceCheckUtils]: 33: Hoare triple {70854#(< (+ 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; {70850#(< (+ main_~z~0 10) main_~y~0)} is VALID [2022-04-15 06:53:45,202 INFO L290 TraceCheckUtils]: 32: Hoare triple {70858#(< (+ 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; {70854#(< (+ main_~z~0 11) main_~y~0)} is VALID [2022-04-15 06:53:45,202 INFO L290 TraceCheckUtils]: 31: Hoare triple {70862#(< (+ 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; {70858#(< (+ main_~z~0 12) main_~y~0)} is VALID [2022-04-15 06:53:45,203 INFO L290 TraceCheckUtils]: 30: Hoare triple {70866#(< (+ 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; {70862#(< (+ main_~z~0 13) main_~y~0)} is VALID [2022-04-15 06:53:45,203 INFO L290 TraceCheckUtils]: 29: Hoare triple {70870#(< (+ 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; {70866#(< (+ main_~z~0 14) main_~y~0)} is VALID [2022-04-15 06:53:45,203 INFO L290 TraceCheckUtils]: 28: Hoare triple {70874#(< (+ 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; {70870#(< (+ main_~z~0 15) main_~y~0)} is VALID [2022-04-15 06:53:45,204 INFO L290 TraceCheckUtils]: 27: Hoare triple {70878#(< (+ 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; {70874#(< (+ main_~z~0 16) main_~y~0)} is VALID [2022-04-15 06:53:45,204 INFO L290 TraceCheckUtils]: 26: Hoare triple {70882#(< (+ 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; {70878#(< (+ main_~z~0 17) main_~y~0)} is VALID [2022-04-15 06:53:45,205 INFO L290 TraceCheckUtils]: 25: Hoare triple {70886#(< (+ 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; {70882#(< (+ main_~z~0 18) main_~y~0)} is VALID [2022-04-15 06:53:45,205 INFO L290 TraceCheckUtils]: 24: Hoare triple {70890#(< (+ 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; {70886#(< (+ 19 main_~z~0) main_~y~0)} is VALID [2022-04-15 06:53:45,206 INFO L290 TraceCheckUtils]: 23: Hoare triple {70894#(< (+ 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; {70890#(< (+ main_~z~0 20) main_~y~0)} is VALID [2022-04-15 06:53:45,206 INFO L290 TraceCheckUtils]: 22: Hoare triple {70898#(< (+ 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; {70894#(< (+ main_~z~0 21) main_~y~0)} is VALID [2022-04-15 06:53:45,207 INFO L290 TraceCheckUtils]: 21: Hoare triple {70902#(< (+ 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; {70898#(< (+ main_~z~0 22) main_~y~0)} is VALID [2022-04-15 06:53:45,207 INFO L290 TraceCheckUtils]: 20: Hoare triple {70906#(< (+ 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; {70902#(< (+ 23 main_~z~0) main_~y~0)} is VALID [2022-04-15 06:53:45,207 INFO L290 TraceCheckUtils]: 19: Hoare triple {70910#(< (+ 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; {70906#(< (+ main_~z~0 24) main_~y~0)} is VALID [2022-04-15 06:53:45,208 INFO L290 TraceCheckUtils]: 18: Hoare triple {70914#(< (+ 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; {70910#(< (+ main_~z~0 25) main_~y~0)} is VALID [2022-04-15 06:53:45,208 INFO L290 TraceCheckUtils]: 17: Hoare triple {70918#(< (+ 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; {70914#(< (+ main_~z~0 26) main_~y~0)} is VALID [2022-04-15 06:53:45,209 INFO L290 TraceCheckUtils]: 16: Hoare triple {70922#(< (+ 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; {70918#(< (+ main_~z~0 27) main_~y~0)} is VALID [2022-04-15 06:53:45,209 INFO L290 TraceCheckUtils]: 15: Hoare triple {70926#(< (+ 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; {70922#(< (+ main_~z~0 28) main_~y~0)} is VALID [2022-04-15 06:53:45,210 INFO L290 TraceCheckUtils]: 14: Hoare triple {70930#(< (+ 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; {70926#(< (+ 29 main_~z~0) main_~y~0)} is VALID [2022-04-15 06:53:45,210 INFO L290 TraceCheckUtils]: 13: Hoare triple {70934#(< (+ 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; {70930#(< (+ 30 main_~z~0) main_~y~0)} is VALID [2022-04-15 06:53:45,211 INFO L290 TraceCheckUtils]: 12: Hoare triple {70938#(< (+ 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; {70934#(< (+ main_~z~0 31) main_~y~0)} is VALID [2022-04-15 06:53:45,211 INFO L290 TraceCheckUtils]: 11: Hoare triple {70942#(< (+ 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; {70938#(< (+ 32 main_~z~0) main_~y~0)} is VALID [2022-04-15 06:53:45,211 INFO L290 TraceCheckUtils]: 10: Hoare triple {70946#(< (+ main_~z~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; {70942#(< (+ main_~z~0 33) main_~y~0)} is VALID [2022-04-15 06:53:45,212 INFO L290 TraceCheckUtils]: 9: Hoare triple {70946#(< (+ main_~z~0 34) main_~y~0)} [247] 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[] {70946#(< (+ main_~z~0 34) main_~y~0)} is VALID [2022-04-15 06:53:45,213 INFO L290 TraceCheckUtils]: 8: Hoare triple {70946#(< (+ main_~z~0 34) main_~y~0)} [250] L11-2-->L18-1_primed: Formula: (let ((.cse0 (= v_main_~y~0_3619 v_main_~y~0_3618)) (.cse1 (= |v_main_#t~post6_333| |v_main_#t~post6_332|)) (.cse2 (= |v_main_#t~post5_333| |v_main_#t~post5_332|)) (.cse3 (= v_main_~x~0_3183 v_main_~x~0_3182)) (.cse5 (<= 50000 v_main_~x~0_3183))) (or (and .cse0 .cse1 .cse2 .cse3) (let ((.cse4 (+ v_main_~x~0_3183 v_main_~y~0_3618))) (and (= .cse4 (+ v_main_~x~0_3182 v_main_~y~0_3619)) (< .cse4 (+ 1000001 v_main_~y~0_3619)) (< v_main_~y~0_3619 v_main_~y~0_3618) .cse5)) (and .cse0 .cse1 .cse2 .cse3 (or (not .cse5) (not (< v_main_~x~0_3183 1000000)))))) InVars {main_~y~0=v_main_~y~0_3619, main_#t~post5=|v_main_#t~post5_333|, main_~x~0=v_main_~x~0_3183, main_#t~post6=|v_main_#t~post6_333|} OutVars{main_~y~0=v_main_~y~0_3618, main_#t~post5=|v_main_#t~post5_332|, main_~x~0=v_main_~x~0_3182, main_#t~post6=|v_main_#t~post6_332|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {70946#(< (+ main_~z~0 34) main_~y~0)} is VALID [2022-04-15 06:53:45,213 INFO L290 TraceCheckUtils]: 7: Hoare triple {70946#(< (+ main_~z~0 34) main_~y~0)} [249] L18-1_primed-->L11-2: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {70946#(< (+ main_~z~0 34) main_~y~0)} is VALID [2022-04-15 06:53:45,213 INFO L290 TraceCheckUtils]: 6: Hoare triple {70946#(< (+ main_~z~0 34) main_~y~0)} [248] L11-2-->L18-1_primed: Formula: (let ((.cse0 (= v_main_~x~0_3181 v_main_~x~0_3180)) (.cse1 (= |v_main_#t~post4_299| |v_main_#t~post4_298|))) (or (and .cse0 .cse1) (and (< v_main_~x~0_3181 v_main_~x~0_3180) (< v_main_~x~0_3180 50001)) (and (<= 50000 v_main_~x~0_3181) .cse0 .cse1))) InVars {main_~x~0=v_main_~x~0_3181, main_#t~post4=|v_main_#t~post4_299|} OutVars{main_~x~0=v_main_~x~0_3180, main_#t~post4=|v_main_#t~post4_298|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {70946#(< (+ main_~z~0 34) main_~y~0)} is VALID [2022-04-15 06:53:45,214 INFO L290 TraceCheckUtils]: 5: Hoare triple {70575#true} ~x~0 := 0;~y~0 := 50000;~z~0 := 0;~x~0 := 0; {70946#(< (+ main_~z~0 34) main_~y~0)} is VALID [2022-04-15 06:53:45,214 INFO L272 TraceCheckUtils]: 4: Hoare triple {70575#true} call #t~ret9 := main(); {70575#true} is VALID [2022-04-15 06:53:45,214 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {70575#true} {70575#true} #52#return; {70575#true} is VALID [2022-04-15 06:53:45,214 INFO L290 TraceCheckUtils]: 2: Hoare triple {70575#true} assume true; {70575#true} is VALID [2022-04-15 06:53:45,214 INFO L290 TraceCheckUtils]: 1: Hoare triple {70575#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); {70575#true} is VALID [2022-04-15 06:53:45,214 INFO L272 TraceCheckUtils]: 0: Hoare triple {70575#true} call ULTIMATE.init(); {70575#true} is VALID [2022-04-15 06:53:45,214 INFO L134 CoverageAnalysis]: Checked inductivity of 597 backedges. 0 proven. 595 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-04-15 06:53:45,214 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1545277009] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 06:53:45,214 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 06:53:45,214 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [38, 37, 37] total 108 [2022-04-15 06:53:48,365 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 06:53:48,366 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [554157613] [2022-04-15 06:53:48,366 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [554157613] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 06:53:48,366 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 06:53:48,366 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [103] imperfect sequences [] total 103 [2022-04-15 06:53:48,366 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1240867204] [2022-04-15 06:53:48,366 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 06:53:48,366 INFO L78 Accepts]: Start accepts. Automaton has has 103 states, 103 states have (on average 1.6504854368932038) internal successors, (170), 102 states have internal predecessors, (170), 2 states have call successors, (3), 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 174 [2022-04-15 06:53:48,367 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 06:53:48,367 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 103 states, 103 states have (on average 1.6504854368932038) internal successors, (170), 102 states have internal predecessors, (170), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:53:48,486 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 174 edges. 174 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 06:53:48,486 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 103 states [2022-04-15 06:53:48,486 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 06:53:48,487 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 103 interpolants. [2022-04-15 06:53:48,488 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12097, Invalid=17659, Unknown=0, NotChecked=0, Total=29756 [2022-04-15 06:53:48,488 INFO L87 Difference]: Start difference. First operand 299 states and 303 transitions. Second operand has 103 states, 103 states have (on average 1.6504854368932038) internal successors, (170), 102 states have internal predecessors, (170), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:54:05,912 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:54:05,912 INFO L93 Difference]: Finished difference Result 471 states and 485 transitions. [2022-04-15 06:54:05,912 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 103 states. [2022-04-15 06:54:05,912 INFO L78 Accepts]: Start accepts. Automaton has has 103 states, 103 states have (on average 1.6504854368932038) internal successors, (170), 102 states have internal predecessors, (170), 2 states have call successors, (3), 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 174 [2022-04-15 06:54:05,912 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 06:54:05,913 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 103 states, 103 states have (on average 1.6504854368932038) internal successors, (170), 102 states have internal predecessors, (170), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:54:05,914 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 198 transitions. [2022-04-15 06:54:05,914 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 103 states, 103 states have (on average 1.6504854368932038) internal successors, (170), 102 states have internal predecessors, (170), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:54:05,916 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 198 transitions. [2022-04-15 06:54:05,916 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 103 states and 198 transitions. [2022-04-15 06:54:06,075 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-15 06:54:06,079 INFO L225 Difference]: With dead ends: 471 [2022-04-15 06:54:06,079 INFO L226 Difference]: Without dead ends: 306 [2022-04-15 06:54:06,084 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 371 GetRequests, 98 SyntacticMatches, 2 SemanticMatches, 271 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21547 ImplicationChecksByTransitivity, 10.5s TimeCoverageRelationStatistics Valid=24770, Invalid=49486, Unknown=0, NotChecked=0, Total=74256 [2022-04-15 06:54:06,084 INFO L913 BasicCegarLoop]: 12 mSDtfsCounter, 342 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 8405 mSolverCounterSat, 448 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 342 SdHoareTripleChecker+Valid, 29 SdHoareTripleChecker+Invalid, 8853 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 448 IncrementalHoareTripleChecker+Valid, 8405 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6.6s IncrementalHoareTripleChecker+Time [2022-04-15 06:54:06,085 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [342 Valid, 29 Invalid, 8853 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [448 Valid, 8405 Invalid, 0 Unknown, 0 Unchecked, 6.6s Time] [2022-04-15 06:54:06,085 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 306 states. [2022-04-15 06:54:06,592 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 306 to 180. [2022-04-15 06:54:06,592 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 06:54:06,592 INFO L82 GeneralOperation]: Start isEquivalent. First operand 306 states. Second operand has 180 states, 175 states have (on average 1.022857142857143) internal successors, (179), 175 states have internal predecessors, (179), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:54:06,592 INFO L74 IsIncluded]: Start isIncluded. First operand 306 states. Second operand has 180 states, 175 states have (on average 1.022857142857143) internal successors, (179), 175 states have internal predecessors, (179), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:54:06,592 INFO L87 Difference]: Start difference. First operand 306 states. Second operand has 180 states, 175 states have (on average 1.022857142857143) internal successors, (179), 175 states have internal predecessors, (179), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:54:06,595 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:54:06,596 INFO L93 Difference]: Finished difference Result 306 states and 310 transitions. [2022-04-15 06:54:06,596 INFO L276 IsEmpty]: Start isEmpty. Operand 306 states and 310 transitions. [2022-04-15 06:54:06,596 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 06:54:06,596 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 06:54:06,596 INFO L74 IsIncluded]: Start isIncluded. First operand has 180 states, 175 states have (on average 1.022857142857143) internal successors, (179), 175 states have internal predecessors, (179), 3 states have call successors, (3), 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 306 states. [2022-04-15 06:54:06,596 INFO L87 Difference]: Start difference. First operand has 180 states, 175 states have (on average 1.022857142857143) internal successors, (179), 175 states have internal predecessors, (179), 3 states have call successors, (3), 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 306 states. [2022-04-15 06:54:06,599 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:54:06,599 INFO L93 Difference]: Finished difference Result 306 states and 310 transitions. [2022-04-15 06:54:06,599 INFO L276 IsEmpty]: Start isEmpty. Operand 306 states and 310 transitions. [2022-04-15 06:54:06,600 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 06:54:06,600 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 06:54:06,600 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 06:54:06,600 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 06:54:06,600 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 180 states, 175 states have (on average 1.022857142857143) internal successors, (179), 175 states have internal predecessors, (179), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:54:06,602 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 180 states to 180 states and 183 transitions. [2022-04-15 06:54:06,602 INFO L78 Accepts]: Start accepts. Automaton has 180 states and 183 transitions. Word has length 174 [2022-04-15 06:54:06,602 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 06:54:06,602 INFO L478 AbstractCegarLoop]: Abstraction has 180 states and 183 transitions. [2022-04-15 06:54:06,602 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 103 states, 103 states have (on average 1.6504854368932038) internal successors, (170), 102 states have internal predecessors, (170), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:54:06,602 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 180 states and 183 transitions. [2022-04-15 06:54:06,828 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-15 06:54:06,828 INFO L276 IsEmpty]: Start isEmpty. Operand 180 states and 183 transitions. [2022-04-15 06:54:06,829 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 180 [2022-04-15 06:54:06,829 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 06:54:06,829 INFO L499 BasicCegarLoop]: trace histogram [66, 65, 35, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 06:54:06,845 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (49)] Forceful destruction successful, exit code 0 [2022-04-15 06:54:07,030 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable50,49 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 06:54:07,030 INFO L403 AbstractCegarLoop]: === Iteration 52 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 06:54:07,030 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 06:54:07,030 INFO L85 PathProgramCache]: Analyzing trace with hash 439560164, now seen corresponding path program 49 times [2022-04-15 06:54:07,030 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 06:54:07,030 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1852257364] [2022-04-15 06:54:11,093 WARN L977 rdanLoopAcceleration]: Unable to prove correctness of quantifier elimination. [2022-04-15 06:54:11,140 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-15 06:54:11,337 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-15 06:54:11,338 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-15 06:54:11,340 INFO L85 PathProgramCache]: Analyzing trace with hash 157815906, now seen corresponding path program 1 times [2022-04-15 06:54:11,340 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 06:54:11,340 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [106110229] [2022-04-15 06:54:11,340 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 06:54:11,340 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 06:54:11,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:54:12,189 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 06:54:12,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:54:12,196 INFO L290 TraceCheckUtils]: 0: Hoare triple {73199#(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); {73158#true} is VALID [2022-04-15 06:54:12,196 INFO L290 TraceCheckUtils]: 1: Hoare triple {73158#true} assume true; {73158#true} is VALID [2022-04-15 06:54:12,196 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {73158#true} {73158#true} #52#return; {73158#true} is VALID [2022-04-15 06:54:12,196 INFO L272 TraceCheckUtils]: 0: Hoare triple {73158#true} call ULTIMATE.init(); {73199#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 06:54:12,197 INFO L290 TraceCheckUtils]: 1: Hoare triple {73199#(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); {73158#true} is VALID [2022-04-15 06:54:12,197 INFO L290 TraceCheckUtils]: 2: Hoare triple {73158#true} assume true; {73158#true} is VALID [2022-04-15 06:54:12,197 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {73158#true} {73158#true} #52#return; {73158#true} is VALID [2022-04-15 06:54:12,197 INFO L272 TraceCheckUtils]: 4: Hoare triple {73158#true} call #t~ret9 := main(); {73158#true} is VALID [2022-04-15 06:54:12,197 INFO L290 TraceCheckUtils]: 5: Hoare triple {73158#true} ~x~0 := 0;~y~0 := 50000;~z~0 := 0;~x~0 := 0; {73163#(and (= main_~z~0 0) (<= 50000 main_~y~0))} is VALID [2022-04-15 06:54:12,198 INFO L290 TraceCheckUtils]: 6: Hoare triple {73163#(and (= main_~z~0 0) (<= 50000 main_~y~0))} [252] L11-2-->L18-1_primed: Formula: (let ((.cse0 (= v_main_~x~0_3295 v_main_~x~0_3294)) (.cse1 (= |v_main_#t~post4_305| |v_main_#t~post4_304|))) (or (and (<= 50000 v_main_~x~0_3295) .cse0 .cse1) (and (< v_main_~x~0_3294 50001) (< v_main_~x~0_3295 v_main_~x~0_3294)) (and .cse0 .cse1))) InVars {main_~x~0=v_main_~x~0_3295, main_#t~post4=|v_main_#t~post4_305|} OutVars{main_~x~0=v_main_~x~0_3294, main_#t~post4=|v_main_#t~post4_304|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {73163#(and (= main_~z~0 0) (<= 50000 main_~y~0))} is VALID [2022-04-15 06:54:12,198 INFO L290 TraceCheckUtils]: 7: Hoare triple {73163#(and (= main_~z~0 0) (<= 50000 main_~y~0))} [253] L18-1_primed-->L11-2: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {73163#(and (= main_~z~0 0) (<= 50000 main_~y~0))} is VALID [2022-04-15 06:54:12,199 INFO L290 TraceCheckUtils]: 8: Hoare triple {73163#(and (= main_~z~0 0) (<= 50000 main_~y~0))} [254] L11-2-->L18-1_primed: Formula: (let ((.cse0 (= v_main_~x~0_3297 v_main_~x~0_3296)) (.cse1 (= v_main_~y~0_3759 v_main_~y~0_3758)) (.cse2 (<= 50000 v_main_~x~0_3297))) (or (and .cse0 (= |v_main_#t~post6_340| |v_main_#t~post6_339|) (= |v_main_#t~post5_340| |v_main_#t~post5_339|) .cse1) (and (= |v_main_#t~post5_339| |v_main_#t~post5_340|) .cse0 (= |v_main_#t~post6_339| |v_main_#t~post6_340|) (or (not (< v_main_~x~0_3297 1000000)) (not .cse2)) .cse1) (let ((.cse3 (+ v_main_~x~0_3297 v_main_~y~0_3758))) (and .cse2 (= (+ v_main_~x~0_3296 v_main_~y~0_3759) .cse3) (< v_main_~y~0_3759 v_main_~y~0_3758) (< .cse3 (+ 1000001 v_main_~y~0_3759)))))) InVars {main_~y~0=v_main_~y~0_3759, main_#t~post5=|v_main_#t~post5_340|, main_~x~0=v_main_~x~0_3297, main_#t~post6=|v_main_#t~post6_340|} OutVars{main_~y~0=v_main_~y~0_3758, main_#t~post5=|v_main_#t~post5_339|, main_~x~0=v_main_~x~0_3296, main_#t~post6=|v_main_#t~post6_339|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {73163#(and (= main_~z~0 0) (<= 50000 main_~y~0))} is VALID [2022-04-15 06:54:12,199 INFO L290 TraceCheckUtils]: 9: Hoare triple {73163#(and (= main_~z~0 0) (<= 50000 main_~y~0))} [251] 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[] {73163#(and (= main_~z~0 0) (<= 50000 main_~y~0))} is VALID [2022-04-15 06:54:12,200 INFO L290 TraceCheckUtils]: 10: Hoare triple {73163#(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; {73164#(and (= main_~z~0 0) (<= 49999 main_~y~0))} is VALID [2022-04-15 06:54:12,200 INFO L290 TraceCheckUtils]: 11: Hoare triple {73164#(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; {73165#(and (<= 49998 main_~y~0) (= main_~z~0 0))} is VALID [2022-04-15 06:54:12,201 INFO L290 TraceCheckUtils]: 12: Hoare triple {73165#(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; {73166#(and (= main_~z~0 0) (<= 49997 main_~y~0))} is VALID [2022-04-15 06:54:12,201 INFO L290 TraceCheckUtils]: 13: Hoare triple {73166#(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; {73167#(and (= main_~z~0 0) (<= 49996 main_~y~0))} is VALID [2022-04-15 06:54:12,202 INFO L290 TraceCheckUtils]: 14: Hoare triple {73167#(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; {73168#(and (= main_~z~0 0) (<= 49995 main_~y~0))} is VALID [2022-04-15 06:54:12,202 INFO L290 TraceCheckUtils]: 15: Hoare triple {73168#(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; {73169#(and (= main_~z~0 0) (<= 49994 main_~y~0))} is VALID [2022-04-15 06:54:12,203 INFO L290 TraceCheckUtils]: 16: Hoare triple {73169#(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; {73170#(and (= main_~z~0 0) (<= 49993 main_~y~0))} is VALID [2022-04-15 06:54:12,204 INFO L290 TraceCheckUtils]: 17: Hoare triple {73170#(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; {73171#(and (= main_~z~0 0) (<= 49992 main_~y~0))} is VALID [2022-04-15 06:54:12,204 INFO L290 TraceCheckUtils]: 18: Hoare triple {73171#(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; {73172#(and (= main_~z~0 0) (<= 49991 main_~y~0))} is VALID [2022-04-15 06:54:12,205 INFO L290 TraceCheckUtils]: 19: Hoare triple {73172#(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; {73173#(and (<= 49990 main_~y~0) (= main_~z~0 0))} is VALID [2022-04-15 06:54:12,205 INFO L290 TraceCheckUtils]: 20: Hoare triple {73173#(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; {73174#(and (= main_~z~0 0) (<= 49989 main_~y~0))} is VALID [2022-04-15 06:54:12,206 INFO L290 TraceCheckUtils]: 21: Hoare triple {73174#(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; {73175#(and (= main_~z~0 0) (<= 49988 main_~y~0))} is VALID [2022-04-15 06:54:12,206 INFO L290 TraceCheckUtils]: 22: Hoare triple {73175#(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; {73176#(and (= main_~z~0 0) (<= 49987 main_~y~0))} is VALID [2022-04-15 06:54:12,207 INFO L290 TraceCheckUtils]: 23: Hoare triple {73176#(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; {73177#(and (= main_~z~0 0) (<= 49986 main_~y~0))} is VALID [2022-04-15 06:54:12,207 INFO L290 TraceCheckUtils]: 24: Hoare triple {73177#(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; {73178#(and (= main_~z~0 0) (<= 49985 main_~y~0))} is VALID [2022-04-15 06:54:12,208 INFO L290 TraceCheckUtils]: 25: Hoare triple {73178#(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; {73179#(and (= main_~z~0 0) (<= 49984 main_~y~0))} is VALID [2022-04-15 06:54:12,208 INFO L290 TraceCheckUtils]: 26: Hoare triple {73179#(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; {73180#(and (= main_~z~0 0) (<= 49983 main_~y~0))} is VALID [2022-04-15 06:54:12,209 INFO L290 TraceCheckUtils]: 27: Hoare triple {73180#(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; {73181#(and (= main_~z~0 0) (<= 49982 main_~y~0))} is VALID [2022-04-15 06:54:12,209 INFO L290 TraceCheckUtils]: 28: Hoare triple {73181#(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; {73182#(and (<= 49981 main_~y~0) (= main_~z~0 0))} is VALID [2022-04-15 06:54:12,210 INFO L290 TraceCheckUtils]: 29: Hoare triple {73182#(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; {73183#(and (= main_~z~0 0) (<= 49980 main_~y~0))} is VALID [2022-04-15 06:54:12,210 INFO L290 TraceCheckUtils]: 30: Hoare triple {73183#(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; {73184#(and (= main_~z~0 0) (<= 49979 main_~y~0))} is VALID [2022-04-15 06:54:12,211 INFO L290 TraceCheckUtils]: 31: Hoare triple {73184#(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; {73185#(and (= main_~z~0 0) (<= 49978 main_~y~0))} is VALID [2022-04-15 06:54:12,211 INFO L290 TraceCheckUtils]: 32: Hoare triple {73185#(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; {73186#(and (= main_~z~0 0) (<= 49977 main_~y~0))} is VALID [2022-04-15 06:54:12,212 INFO L290 TraceCheckUtils]: 33: Hoare triple {73186#(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; {73187#(and (= main_~z~0 0) (<= 49976 main_~y~0))} is VALID [2022-04-15 06:54:12,213 INFO L290 TraceCheckUtils]: 34: Hoare triple {73187#(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; {73188#(and (= main_~z~0 0) (<= 49975 main_~y~0))} is VALID [2022-04-15 06:54:12,213 INFO L290 TraceCheckUtils]: 35: Hoare triple {73188#(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; {73189#(and (= main_~z~0 0) (<= 49974 main_~y~0))} is VALID [2022-04-15 06:54:12,214 INFO L290 TraceCheckUtils]: 36: Hoare triple {73189#(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; {73190#(and (= main_~z~0 0) (<= 49973 main_~y~0))} is VALID [2022-04-15 06:54:12,214 INFO L290 TraceCheckUtils]: 37: Hoare triple {73190#(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; {73191#(and (= main_~z~0 0) (<= 49972 main_~y~0))} is VALID [2022-04-15 06:54:12,215 INFO L290 TraceCheckUtils]: 38: Hoare triple {73191#(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; {73192#(and (= main_~z~0 0) (<= 49971 main_~y~0))} is VALID [2022-04-15 06:54:12,215 INFO L290 TraceCheckUtils]: 39: Hoare triple {73192#(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; {73193#(and (= main_~z~0 0) (<= 49970 main_~y~0))} is VALID [2022-04-15 06:54:12,216 INFO L290 TraceCheckUtils]: 40: Hoare triple {73193#(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; {73194#(and (= main_~z~0 0) (<= 49969 main_~y~0))} is VALID [2022-04-15 06:54:12,216 INFO L290 TraceCheckUtils]: 41: Hoare triple {73194#(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; {73195#(and (= main_~z~0 0) (<= 49968 main_~y~0))} is VALID [2022-04-15 06:54:12,217 INFO L290 TraceCheckUtils]: 42: Hoare triple {73195#(and (= main_~z~0 0) (<= 49968 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {73196#(and (= main_~z~0 0) (<= 49967 main_~y~0))} is VALID [2022-04-15 06:54:12,217 INFO L290 TraceCheckUtils]: 43: Hoare triple {73196#(and (= main_~z~0 0) (<= 49967 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {73197#(and (= main_~z~0 0) (<= 49966 main_~y~0))} is VALID [2022-04-15 06:54:12,218 INFO L290 TraceCheckUtils]: 44: Hoare triple {73197#(and (= main_~z~0 0) (<= 49966 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {73198#(and (= main_~z~0 0) (<= 49965 main_~y~0))} is VALID [2022-04-15 06:54:12,218 INFO L290 TraceCheckUtils]: 45: Hoare triple {73198#(and (= main_~z~0 0) (<= 49965 main_~y~0))} assume !(~y~0 > ~z~0); {73159#false} is VALID [2022-04-15 06:54:12,218 INFO L272 TraceCheckUtils]: 46: Hoare triple {73159#false} call __VERIFIER_assert((if ~x~0 == ~z~0 then 1 else 0)); {73159#false} is VALID [2022-04-15 06:54:12,218 INFO L290 TraceCheckUtils]: 47: Hoare triple {73159#false} ~cond := #in~cond; {73159#false} is VALID [2022-04-15 06:54:12,218 INFO L290 TraceCheckUtils]: 48: Hoare triple {73159#false} assume 0 == ~cond; {73159#false} is VALID [2022-04-15 06:54:12,219 INFO L290 TraceCheckUtils]: 49: Hoare triple {73159#false} assume !false; {73159#false} is VALID [2022-04-15 06:54:12,219 INFO L134 CoverageAnalysis]: Checked inductivity of 632 backedges. 0 proven. 630 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-04-15 06:54:12,219 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 06:54:12,219 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [106110229] [2022-04-15 06:54:12,219 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [106110229] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 06:54:12,219 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [397708630] [2022-04-15 06:54:12,219 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 06:54:12,219 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 06:54:12,220 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 06:54:12,220 INFO L229 MonitoredProcess]: Starting monitored process 50 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-15 06:54:12,221 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (50)] Waiting until timeout for monitored process [2022-04-15 06:54:12,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:54:12,280 INFO L263 TraceCheckSpWp]: Trace formula consists of 234 conjuncts, 39 conjunts are in the unsatisfiable core [2022-04-15 06:54:12,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:54:12,304 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 06:54:14,137 INFO L272 TraceCheckUtils]: 0: Hoare triple {73158#true} call ULTIMATE.init(); {73158#true} is VALID [2022-04-15 06:54:14,137 INFO L290 TraceCheckUtils]: 1: Hoare triple {73158#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); {73158#true} is VALID [2022-04-15 06:54:14,137 INFO L290 TraceCheckUtils]: 2: Hoare triple {73158#true} assume true; {73158#true} is VALID [2022-04-15 06:54:14,138 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {73158#true} {73158#true} #52#return; {73158#true} is VALID [2022-04-15 06:54:14,138 INFO L272 TraceCheckUtils]: 4: Hoare triple {73158#true} call #t~ret9 := main(); {73158#true} is VALID [2022-04-15 06:54:14,138 INFO L290 TraceCheckUtils]: 5: Hoare triple {73158#true} ~x~0 := 0;~y~0 := 50000;~z~0 := 0;~x~0 := 0; {73218#(and (<= main_~z~0 0) (<= 50000 main_~y~0))} is VALID [2022-04-15 06:54:14,138 INFO L290 TraceCheckUtils]: 6: Hoare triple {73218#(and (<= main_~z~0 0) (<= 50000 main_~y~0))} [252] L11-2-->L18-1_primed: Formula: (let ((.cse0 (= v_main_~x~0_3295 v_main_~x~0_3294)) (.cse1 (= |v_main_#t~post4_305| |v_main_#t~post4_304|))) (or (and (<= 50000 v_main_~x~0_3295) .cse0 .cse1) (and (< v_main_~x~0_3294 50001) (< v_main_~x~0_3295 v_main_~x~0_3294)) (and .cse0 .cse1))) InVars {main_~x~0=v_main_~x~0_3295, main_#t~post4=|v_main_#t~post4_305|} OutVars{main_~x~0=v_main_~x~0_3294, main_#t~post4=|v_main_#t~post4_304|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {73218#(and (<= main_~z~0 0) (<= 50000 main_~y~0))} is VALID [2022-04-15 06:54:14,139 INFO L290 TraceCheckUtils]: 7: Hoare triple {73218#(and (<= main_~z~0 0) (<= 50000 main_~y~0))} [253] L18-1_primed-->L11-2: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {73218#(and (<= main_~z~0 0) (<= 50000 main_~y~0))} is VALID [2022-04-15 06:54:14,139 INFO L290 TraceCheckUtils]: 8: Hoare triple {73218#(and (<= main_~z~0 0) (<= 50000 main_~y~0))} [254] L11-2-->L18-1_primed: Formula: (let ((.cse0 (= v_main_~x~0_3297 v_main_~x~0_3296)) (.cse1 (= v_main_~y~0_3759 v_main_~y~0_3758)) (.cse2 (<= 50000 v_main_~x~0_3297))) (or (and .cse0 (= |v_main_#t~post6_340| |v_main_#t~post6_339|) (= |v_main_#t~post5_340| |v_main_#t~post5_339|) .cse1) (and (= |v_main_#t~post5_339| |v_main_#t~post5_340|) .cse0 (= |v_main_#t~post6_339| |v_main_#t~post6_340|) (or (not (< v_main_~x~0_3297 1000000)) (not .cse2)) .cse1) (let ((.cse3 (+ v_main_~x~0_3297 v_main_~y~0_3758))) (and .cse2 (= (+ v_main_~x~0_3296 v_main_~y~0_3759) .cse3) (< v_main_~y~0_3759 v_main_~y~0_3758) (< .cse3 (+ 1000001 v_main_~y~0_3759)))))) InVars {main_~y~0=v_main_~y~0_3759, main_#t~post5=|v_main_#t~post5_340|, main_~x~0=v_main_~x~0_3297, main_#t~post6=|v_main_#t~post6_340|} OutVars{main_~y~0=v_main_~y~0_3758, main_#t~post5=|v_main_#t~post5_339|, main_~x~0=v_main_~x~0_3296, main_#t~post6=|v_main_#t~post6_339|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {73218#(and (<= main_~z~0 0) (<= 50000 main_~y~0))} is VALID [2022-04-15 06:54:14,140 INFO L290 TraceCheckUtils]: 9: Hoare triple {73218#(and (<= main_~z~0 0) (<= 50000 main_~y~0))} [251] 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[] {73218#(and (<= main_~z~0 0) (<= 50000 main_~y~0))} is VALID [2022-04-15 06:54:14,140 INFO L290 TraceCheckUtils]: 10: Hoare triple {73218#(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; {73234#(and (<= main_~z~0 0) (<= 49999 main_~y~0))} is VALID [2022-04-15 06:54:14,141 INFO L290 TraceCheckUtils]: 11: Hoare triple {73234#(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; {73238#(and (<= main_~z~0 0) (<= 49998 main_~y~0))} is VALID [2022-04-15 06:54:14,141 INFO L290 TraceCheckUtils]: 12: Hoare triple {73238#(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; {73242#(and (<= main_~z~0 0) (<= 49997 main_~y~0))} is VALID [2022-04-15 06:54:14,142 INFO L290 TraceCheckUtils]: 13: Hoare triple {73242#(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; {73246#(and (<= main_~z~0 0) (<= 49996 main_~y~0))} is VALID [2022-04-15 06:54:14,142 INFO L290 TraceCheckUtils]: 14: Hoare triple {73246#(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; {73250#(and (<= main_~z~0 0) (<= 49995 main_~y~0))} is VALID [2022-04-15 06:54:14,143 INFO L290 TraceCheckUtils]: 15: Hoare triple {73250#(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; {73254#(and (<= main_~z~0 0) (<= 49994 main_~y~0))} is VALID [2022-04-15 06:54:14,143 INFO L290 TraceCheckUtils]: 16: Hoare triple {73254#(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; {73258#(and (<= main_~z~0 0) (<= 49993 main_~y~0))} is VALID [2022-04-15 06:54:14,143 INFO L290 TraceCheckUtils]: 17: Hoare triple {73258#(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; {73262#(and (<= main_~z~0 0) (<= 49992 main_~y~0))} is VALID [2022-04-15 06:54:14,144 INFO L290 TraceCheckUtils]: 18: Hoare triple {73262#(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; {73266#(and (<= main_~z~0 0) (<= 49991 main_~y~0))} is VALID [2022-04-15 06:54:14,144 INFO L290 TraceCheckUtils]: 19: Hoare triple {73266#(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; {73270#(and (<= main_~z~0 0) (<= 49990 main_~y~0))} is VALID [2022-04-15 06:54:14,145 INFO L290 TraceCheckUtils]: 20: Hoare triple {73270#(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; {73274#(and (<= main_~z~0 0) (<= 49989 main_~y~0))} is VALID [2022-04-15 06:54:14,145 INFO L290 TraceCheckUtils]: 21: Hoare triple {73274#(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; {73278#(and (<= main_~z~0 0) (<= 49988 main_~y~0))} is VALID [2022-04-15 06:54:14,146 INFO L290 TraceCheckUtils]: 22: Hoare triple {73278#(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; {73282#(and (<= main_~z~0 0) (<= 49987 main_~y~0))} is VALID [2022-04-15 06:54:14,146 INFO L290 TraceCheckUtils]: 23: Hoare triple {73282#(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; {73286#(and (<= main_~z~0 0) (<= 49986 main_~y~0))} is VALID [2022-04-15 06:54:14,147 INFO L290 TraceCheckUtils]: 24: Hoare triple {73286#(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; {73290#(and (<= main_~z~0 0) (<= 49985 main_~y~0))} is VALID [2022-04-15 06:54:14,147 INFO L290 TraceCheckUtils]: 25: Hoare triple {73290#(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; {73294#(and (<= main_~z~0 0) (<= 49984 main_~y~0))} is VALID [2022-04-15 06:54:14,148 INFO L290 TraceCheckUtils]: 26: Hoare triple {73294#(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; {73298#(and (<= main_~z~0 0) (<= 49983 main_~y~0))} is VALID [2022-04-15 06:54:14,148 INFO L290 TraceCheckUtils]: 27: Hoare triple {73298#(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; {73302#(and (<= main_~z~0 0) (<= 49982 main_~y~0))} is VALID [2022-04-15 06:54:14,149 INFO L290 TraceCheckUtils]: 28: Hoare triple {73302#(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; {73306#(and (<= main_~z~0 0) (<= 49981 main_~y~0))} is VALID [2022-04-15 06:54:14,149 INFO L290 TraceCheckUtils]: 29: Hoare triple {73306#(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; {73310#(and (<= main_~z~0 0) (<= 49980 main_~y~0))} is VALID [2022-04-15 06:54:14,149 INFO L290 TraceCheckUtils]: 30: Hoare triple {73310#(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; {73314#(and (<= main_~z~0 0) (<= 49979 main_~y~0))} is VALID [2022-04-15 06:54:14,150 INFO L290 TraceCheckUtils]: 31: Hoare triple {73314#(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; {73318#(and (<= main_~z~0 0) (<= 49978 main_~y~0))} is VALID [2022-04-15 06:54:14,150 INFO L290 TraceCheckUtils]: 32: Hoare triple {73318#(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; {73322#(and (<= main_~z~0 0) (<= 49977 main_~y~0))} is VALID [2022-04-15 06:54:14,151 INFO L290 TraceCheckUtils]: 33: Hoare triple {73322#(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; {73326#(and (<= main_~z~0 0) (<= 49976 main_~y~0))} is VALID [2022-04-15 06:54:14,151 INFO L290 TraceCheckUtils]: 34: Hoare triple {73326#(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; {73330#(and (<= main_~z~0 0) (<= 49975 main_~y~0))} is VALID [2022-04-15 06:54:14,152 INFO L290 TraceCheckUtils]: 35: Hoare triple {73330#(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; {73334#(and (<= main_~z~0 0) (<= 49974 main_~y~0))} is VALID [2022-04-15 06:54:14,152 INFO L290 TraceCheckUtils]: 36: Hoare triple {73334#(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; {73338#(and (<= main_~z~0 0) (<= 49973 main_~y~0))} is VALID [2022-04-15 06:54:14,153 INFO L290 TraceCheckUtils]: 37: Hoare triple {73338#(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; {73342#(and (<= main_~z~0 0) (<= 49972 main_~y~0))} is VALID [2022-04-15 06:54:14,153 INFO L290 TraceCheckUtils]: 38: Hoare triple {73342#(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; {73346#(and (<= main_~z~0 0) (<= 49971 main_~y~0))} is VALID [2022-04-15 06:54:14,154 INFO L290 TraceCheckUtils]: 39: Hoare triple {73346#(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; {73350#(and (<= main_~z~0 0) (<= 49970 main_~y~0))} is VALID [2022-04-15 06:54:14,154 INFO L290 TraceCheckUtils]: 40: Hoare triple {73350#(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; {73354#(and (<= main_~z~0 0) (<= 49969 main_~y~0))} is VALID [2022-04-15 06:54:14,155 INFO L290 TraceCheckUtils]: 41: Hoare triple {73354#(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; {73358#(and (<= main_~z~0 0) (<= 49968 main_~y~0))} is VALID [2022-04-15 06:54:14,155 INFO L290 TraceCheckUtils]: 42: Hoare triple {73358#(and (<= main_~z~0 0) (<= 49968 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {73362#(and (<= main_~z~0 0) (<= 49967 main_~y~0))} is VALID [2022-04-15 06:54:14,156 INFO L290 TraceCheckUtils]: 43: Hoare triple {73362#(and (<= main_~z~0 0) (<= 49967 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {73366#(and (<= main_~z~0 0) (<= 49966 main_~y~0))} is VALID [2022-04-15 06:54:14,156 INFO L290 TraceCheckUtils]: 44: Hoare triple {73366#(and (<= main_~z~0 0) (<= 49966 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post7 := ~y~0;~y~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~x~0;~x~0 := #t~post8 - 1;havoc #t~post8; {73370#(and (<= main_~z~0 0) (<= 49965 main_~y~0))} is VALID [2022-04-15 06:54:14,156 INFO L290 TraceCheckUtils]: 45: Hoare triple {73370#(and (<= main_~z~0 0) (<= 49965 main_~y~0))} assume !(~y~0 > ~z~0); {73159#false} is VALID [2022-04-15 06:54:14,156 INFO L272 TraceCheckUtils]: 46: Hoare triple {73159#false} call __VERIFIER_assert((if ~x~0 == ~z~0 then 1 else 0)); {73159#false} is VALID [2022-04-15 06:54:14,157 INFO L290 TraceCheckUtils]: 47: Hoare triple {73159#false} ~cond := #in~cond; {73159#false} is VALID [2022-04-15 06:54:14,157 INFO L290 TraceCheckUtils]: 48: Hoare triple {73159#false} assume 0 == ~cond; {73159#false} is VALID [2022-04-15 06:54:14,157 INFO L290 TraceCheckUtils]: 49: Hoare triple {73159#false} assume !false; {73159#false} is VALID [2022-04-15 06:54:14,157 INFO L134 CoverageAnalysis]: Checked inductivity of 632 backedges. 0 proven. 630 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-04-15 06:54:14,157 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 06:54:16,833 INFO L290 TraceCheckUtils]: 49: Hoare triple {73159#false} assume !false; {73159#false} is VALID [2022-04-15 06:54:16,834 INFO L290 TraceCheckUtils]: 48: Hoare triple {73159#false} assume 0 == ~cond; {73159#false} is VALID [2022-04-15 06:54:16,834 INFO L290 TraceCheckUtils]: 47: Hoare triple {73159#false} ~cond := #in~cond; {73159#false} is VALID [2022-04-15 06:54:16,834 INFO L272 TraceCheckUtils]: 46: Hoare triple {73159#false} call __VERIFIER_assert((if ~x~0 == ~z~0 then 1 else 0)); {73159#false} is VALID [2022-04-15 06:54:16,834 INFO L290 TraceCheckUtils]: 45: Hoare triple {73398#(< main_~z~0 main_~y~0)} assume !(~y~0 > ~z~0); {73159#false} is VALID [2022-04-15 06:54:16,835 INFO L290 TraceCheckUtils]: 44: Hoare triple {73402#(< (+ 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; {73398#(< main_~z~0 main_~y~0)} is VALID [2022-04-15 06:54:16,835 INFO L290 TraceCheckUtils]: 43: Hoare triple {73406#(< (+ 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; {73402#(< (+ main_~z~0 1) main_~y~0)} is VALID [2022-04-15 06:54:16,835 INFO L290 TraceCheckUtils]: 42: Hoare triple {73410#(< (+ 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; {73406#(< (+ main_~z~0 2) main_~y~0)} is VALID [2022-04-15 06:54:16,836 INFO L290 TraceCheckUtils]: 41: Hoare triple {73414#(< (+ 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; {73410#(< (+ main_~z~0 3) main_~y~0)} is VALID [2022-04-15 06:54:16,836 INFO L290 TraceCheckUtils]: 40: Hoare triple {73418#(< (+ 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; {73414#(< (+ main_~z~0 4) main_~y~0)} is VALID [2022-04-15 06:54:16,837 INFO L290 TraceCheckUtils]: 39: Hoare triple {73422#(< (+ 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; {73418#(< (+ 5 main_~z~0) main_~y~0)} is VALID [2022-04-15 06:54:16,837 INFO L290 TraceCheckUtils]: 38: Hoare triple {73426#(< (+ 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; {73422#(< (+ main_~z~0 6) main_~y~0)} is VALID [2022-04-15 06:54:16,838 INFO L290 TraceCheckUtils]: 37: Hoare triple {73430#(< (+ 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; {73426#(< (+ 7 main_~z~0) main_~y~0)} is VALID [2022-04-15 06:54:16,838 INFO L290 TraceCheckUtils]: 36: Hoare triple {73434#(< (+ 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; {73430#(< (+ main_~z~0 8) main_~y~0)} is VALID [2022-04-15 06:54:16,839 INFO L290 TraceCheckUtils]: 35: Hoare triple {73438#(< (+ 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; {73434#(< (+ main_~z~0 9) main_~y~0)} is VALID [2022-04-15 06:54:16,839 INFO L290 TraceCheckUtils]: 34: Hoare triple {73442#(< (+ 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; {73438#(< (+ main_~z~0 10) main_~y~0)} is VALID [2022-04-15 06:54:16,840 INFO L290 TraceCheckUtils]: 33: Hoare triple {73446#(< (+ 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; {73442#(< (+ main_~z~0 11) main_~y~0)} is VALID [2022-04-15 06:54:16,840 INFO L290 TraceCheckUtils]: 32: Hoare triple {73450#(< (+ 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; {73446#(< (+ main_~z~0 12) main_~y~0)} is VALID [2022-04-15 06:54:16,840 INFO L290 TraceCheckUtils]: 31: Hoare triple {73454#(< (+ 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; {73450#(< (+ main_~z~0 13) main_~y~0)} is VALID [2022-04-15 06:54:16,841 INFO L290 TraceCheckUtils]: 30: Hoare triple {73458#(< (+ 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; {73454#(< (+ main_~z~0 14) main_~y~0)} is VALID [2022-04-15 06:54:16,841 INFO L290 TraceCheckUtils]: 29: Hoare triple {73462#(< (+ 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; {73458#(< (+ main_~z~0 15) main_~y~0)} is VALID [2022-04-15 06:54:16,842 INFO L290 TraceCheckUtils]: 28: Hoare triple {73466#(< (+ 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; {73462#(< (+ main_~z~0 16) main_~y~0)} is VALID [2022-04-15 06:54:16,842 INFO L290 TraceCheckUtils]: 27: Hoare triple {73470#(< (+ 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; {73466#(< (+ main_~z~0 17) main_~y~0)} is VALID [2022-04-15 06:54:16,843 INFO L290 TraceCheckUtils]: 26: Hoare triple {73474#(< (+ 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; {73470#(< (+ main_~z~0 18) main_~y~0)} is VALID [2022-04-15 06:54:16,843 INFO L290 TraceCheckUtils]: 25: Hoare triple {73478#(< (+ 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; {73474#(< (+ 19 main_~z~0) main_~y~0)} is VALID [2022-04-15 06:54:16,844 INFO L290 TraceCheckUtils]: 24: Hoare triple {73482#(< (+ 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; {73478#(< (+ main_~z~0 20) main_~y~0)} is VALID [2022-04-15 06:54:16,844 INFO L290 TraceCheckUtils]: 23: Hoare triple {73486#(< (+ 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; {73482#(< (+ main_~z~0 21) main_~y~0)} is VALID [2022-04-15 06:54:16,844 INFO L290 TraceCheckUtils]: 22: Hoare triple {73490#(< (+ 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; {73486#(< (+ main_~z~0 22) main_~y~0)} is VALID [2022-04-15 06:54:16,845 INFO L290 TraceCheckUtils]: 21: Hoare triple {73494#(< (+ 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; {73490#(< (+ 23 main_~z~0) main_~y~0)} is VALID [2022-04-15 06:54:16,845 INFO L290 TraceCheckUtils]: 20: Hoare triple {73498#(< (+ 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; {73494#(< (+ main_~z~0 24) main_~y~0)} is VALID [2022-04-15 06:54:16,846 INFO L290 TraceCheckUtils]: 19: Hoare triple {73502#(< (+ 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; {73498#(< (+ main_~z~0 25) main_~y~0)} is VALID [2022-04-15 06:54:16,846 INFO L290 TraceCheckUtils]: 18: Hoare triple {73506#(< (+ 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; {73502#(< (+ main_~z~0 26) main_~y~0)} is VALID [2022-04-15 06:54:16,847 INFO L290 TraceCheckUtils]: 17: Hoare triple {73510#(< (+ 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; {73506#(< (+ main_~z~0 27) main_~y~0)} is VALID [2022-04-15 06:54:16,847 INFO L290 TraceCheckUtils]: 16: Hoare triple {73514#(< (+ 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; {73510#(< (+ main_~z~0 28) main_~y~0)} is VALID [2022-04-15 06:54:16,848 INFO L290 TraceCheckUtils]: 15: Hoare triple {73518#(< (+ 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; {73514#(< (+ 29 main_~z~0) main_~y~0)} is VALID [2022-04-15 06:54:16,848 INFO L290 TraceCheckUtils]: 14: Hoare triple {73522#(< (+ 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; {73518#(< (+ 30 main_~z~0) main_~y~0)} is VALID [2022-04-15 06:54:16,848 INFO L290 TraceCheckUtils]: 13: Hoare triple {73526#(< (+ 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; {73522#(< (+ main_~z~0 31) main_~y~0)} is VALID [2022-04-15 06:54:16,849 INFO L290 TraceCheckUtils]: 12: Hoare triple {73530#(< (+ 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; {73526#(< (+ 32 main_~z~0) main_~y~0)} is VALID [2022-04-15 06:54:16,849 INFO L290 TraceCheckUtils]: 11: Hoare triple {73534#(< (+ main_~z~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; {73530#(< (+ main_~z~0 33) main_~y~0)} is VALID [2022-04-15 06:54:16,850 INFO L290 TraceCheckUtils]: 10: Hoare triple {73538#(< (+ 35 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; {73534#(< (+ main_~z~0 34) main_~y~0)} is VALID [2022-04-15 06:54:16,850 INFO L290 TraceCheckUtils]: 9: Hoare triple {73538#(< (+ 35 main_~z~0) main_~y~0)} [251] 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[] {73538#(< (+ 35 main_~z~0) main_~y~0)} is VALID [2022-04-15 06:54:16,851 INFO L290 TraceCheckUtils]: 8: Hoare triple {73538#(< (+ 35 main_~z~0) main_~y~0)} [254] L11-2-->L18-1_primed: Formula: (let ((.cse0 (= v_main_~x~0_3297 v_main_~x~0_3296)) (.cse1 (= v_main_~y~0_3759 v_main_~y~0_3758)) (.cse2 (<= 50000 v_main_~x~0_3297))) (or (and .cse0 (= |v_main_#t~post6_340| |v_main_#t~post6_339|) (= |v_main_#t~post5_340| |v_main_#t~post5_339|) .cse1) (and (= |v_main_#t~post5_339| |v_main_#t~post5_340|) .cse0 (= |v_main_#t~post6_339| |v_main_#t~post6_340|) (or (not (< v_main_~x~0_3297 1000000)) (not .cse2)) .cse1) (let ((.cse3 (+ v_main_~x~0_3297 v_main_~y~0_3758))) (and .cse2 (= (+ v_main_~x~0_3296 v_main_~y~0_3759) .cse3) (< v_main_~y~0_3759 v_main_~y~0_3758) (< .cse3 (+ 1000001 v_main_~y~0_3759)))))) InVars {main_~y~0=v_main_~y~0_3759, main_#t~post5=|v_main_#t~post5_340|, main_~x~0=v_main_~x~0_3297, main_#t~post6=|v_main_#t~post6_340|} OutVars{main_~y~0=v_main_~y~0_3758, main_#t~post5=|v_main_#t~post5_339|, main_~x~0=v_main_~x~0_3296, main_#t~post6=|v_main_#t~post6_339|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {73538#(< (+ 35 main_~z~0) main_~y~0)} is VALID [2022-04-15 06:54:16,851 INFO L290 TraceCheckUtils]: 7: Hoare triple {73538#(< (+ 35 main_~z~0) main_~y~0)} [253] L18-1_primed-->L11-2: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {73538#(< (+ 35 main_~z~0) main_~y~0)} is VALID [2022-04-15 06:54:16,851 INFO L290 TraceCheckUtils]: 6: Hoare triple {73538#(< (+ 35 main_~z~0) main_~y~0)} [252] L11-2-->L18-1_primed: Formula: (let ((.cse0 (= v_main_~x~0_3295 v_main_~x~0_3294)) (.cse1 (= |v_main_#t~post4_305| |v_main_#t~post4_304|))) (or (and (<= 50000 v_main_~x~0_3295) .cse0 .cse1) (and (< v_main_~x~0_3294 50001) (< v_main_~x~0_3295 v_main_~x~0_3294)) (and .cse0 .cse1))) InVars {main_~x~0=v_main_~x~0_3295, main_#t~post4=|v_main_#t~post4_305|} OutVars{main_~x~0=v_main_~x~0_3294, main_#t~post4=|v_main_#t~post4_304|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {73538#(< (+ 35 main_~z~0) main_~y~0)} is VALID [2022-04-15 06:54:16,852 INFO L290 TraceCheckUtils]: 5: Hoare triple {73158#true} ~x~0 := 0;~y~0 := 50000;~z~0 := 0;~x~0 := 0; {73538#(< (+ 35 main_~z~0) main_~y~0)} is VALID [2022-04-15 06:54:16,852 INFO L272 TraceCheckUtils]: 4: Hoare triple {73158#true} call #t~ret9 := main(); {73158#true} is VALID [2022-04-15 06:54:16,852 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {73158#true} {73158#true} #52#return; {73158#true} is VALID [2022-04-15 06:54:16,852 INFO L290 TraceCheckUtils]: 2: Hoare triple {73158#true} assume true; {73158#true} is VALID [2022-04-15 06:54:16,852 INFO L290 TraceCheckUtils]: 1: Hoare triple {73158#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); {73158#true} is VALID [2022-04-15 06:54:16,852 INFO L272 TraceCheckUtils]: 0: Hoare triple {73158#true} call ULTIMATE.init(); {73158#true} is VALID [2022-04-15 06:54:16,852 INFO L134 CoverageAnalysis]: Checked inductivity of 632 backedges. 0 proven. 630 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-04-15 06:54:16,853 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [397708630] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 06:54:16,853 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 06:54:16,853 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [39, 38, 38] total 111