/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_7.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-fb4f59a-m [2022-04-28 03:50:06,897 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-04-28 03:50:06,898 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-04-28 03:50:06,927 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-04-28 03:50:06,927 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-04-28 03:50:06,928 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-04-28 03:50:06,929 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-04-28 03:50:06,944 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-04-28 03:50:06,947 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-04-28 03:50:06,951 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-04-28 03:50:06,952 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-04-28 03:50:06,954 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-04-28 03:50:06,954 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-04-28 03:50:06,955 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-04-28 03:50:06,956 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-04-28 03:50:06,956 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-04-28 03:50:06,957 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-04-28 03:50:06,957 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-04-28 03:50:06,958 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-04-28 03:50:06,960 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-04-28 03:50:06,961 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-04-28 03:50:06,963 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-04-28 03:50:06,964 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-04-28 03:50:06,966 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-04-28 03:50:06,975 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-04-28 03:50:06,977 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-04-28 03:50:06,977 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-04-28 03:50:06,977 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-04-28 03:50:06,977 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-04-28 03:50:06,978 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-04-28 03:50:06,978 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-04-28 03:50:06,978 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-04-28 03:50:06,979 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-04-28 03:50:06,979 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-04-28 03:50:06,980 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-04-28 03:50:06,980 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-04-28 03:50:06,980 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-04-28 03:50:06,981 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-04-28 03:50:06,981 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-04-28 03:50:06,981 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-04-28 03:50:06,981 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-04-28 03:50:06,982 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-04-28 03:50:06,983 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationJordan_32.epf [2022-04-28 03:50:06,989 INFO L113 SettingsManager]: Loading preferences was successful [2022-04-28 03:50:06,989 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-04-28 03:50:06,990 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-04-28 03:50:06,990 INFO L138 SettingsManager]: * sizeof long=4 [2022-04-28 03:50:06,991 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-04-28 03:50:06,991 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-04-28 03:50:06,991 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-04-28 03:50:06,991 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-04-28 03:50:06,991 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-04-28 03:50:06,991 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-04-28 03:50:06,992 INFO L138 SettingsManager]: * sizeof long double=12 [2022-04-28 03:50:06,992 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-04-28 03:50:06,992 INFO L138 SettingsManager]: * Use constant arrays=true [2022-04-28 03:50:06,992 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-04-28 03:50:06,992 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-04-28 03:50:06,992 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-04-28 03:50:06,993 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-04-28 03:50:06,993 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-04-28 03:50:06,993 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-28 03:50:06,993 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-04-28 03:50:06,993 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_NestedInterpolation [2022-04-28 03:50:06,993 INFO L138 SettingsManager]: * Trace refinement strategy=ACCELERATED_INTERPOLATION [2022-04-28 03:50:06,994 INFO L138 SettingsManager]: * Trace refinement strategy used in Accelerated Interpolation=CAMEL [2022-04-28 03:50:06,994 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-04-28 03:50:06,994 INFO L138 SettingsManager]: * Loop acceleration method that is used by accelerated interpolation=JORDAN [2022-04-28 03:50:06,994 INFO L138 SettingsManager]: * Use separate solver for trace checks=false WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.core: Log level for class -> de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=WARN; [2022-04-28 03:50:07,171 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-04-28 03:50:07,189 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-04-28 03:50:07,191 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-04-28 03:50:07,191 INFO L271 PluginConnector]: Initializing CDTParser... [2022-04-28 03:50:07,192 INFO L275 PluginConnector]: CDTParser initialized [2022-04-28 03:50:07,192 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/loops-crafted-1/mono-crafted_7.c [2022-04-28 03:50:07,231 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5b2371f37/e38d283f13174677ab7722a8b7d2b632/FLAG72ec30eff [2022-04-28 03:50:07,558 INFO L306 CDTParser]: Found 1 translation units. [2022-04-28 03:50:07,558 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loops-crafted-1/mono-crafted_7.c [2022-04-28 03:50:07,564 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5b2371f37/e38d283f13174677ab7722a8b7d2b632/FLAG72ec30eff [2022-04-28 03:50:08,000 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5b2371f37/e38d283f13174677ab7722a8b7d2b632 [2022-04-28 03:50:08,002 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-04-28 03:50:08,002 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2022-04-28 03:50:08,004 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-04-28 03:50:08,004 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-04-28 03:50:08,007 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-04-28 03:50:08,007 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.04 03:50:08" (1/1) ... [2022-04-28 03:50:08,009 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3735f97 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 03:50:08, skipping insertion in model container [2022-04-28 03:50:08,009 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.04 03:50:08" (1/1) ... [2022-04-28 03:50:08,013 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-04-28 03:50:08,022 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-04-28 03:50:08,183 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_7.c[318,331] [2022-04-28 03:50:08,201 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-28 03:50:08,210 INFO L203 MainTranslator]: Completed pre-run [2022-04-28 03:50:08,218 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_7.c[318,331] [2022-04-28 03:50:08,221 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-28 03:50:08,231 INFO L208 MainTranslator]: Completed translation [2022-04-28 03:50:08,232 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 03:50:08 WrapperNode [2022-04-28 03:50:08,232 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-04-28 03:50:08,233 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-04-28 03:50:08,233 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-04-28 03:50:08,233 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-04-28 03:50:08,239 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 03:50:08" (1/1) ... [2022-04-28 03:50:08,240 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 03:50:08" (1/1) ... [2022-04-28 03:50:08,245 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 03:50:08" (1/1) ... [2022-04-28 03:50:08,246 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 03:50:08" (1/1) ... [2022-04-28 03:50:08,254 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 03:50:08" (1/1) ... [2022-04-28 03:50:08,258 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 03:50:08" (1/1) ... [2022-04-28 03:50:08,261 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 03:50:08" (1/1) ... [2022-04-28 03:50:08,269 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-04-28 03:50:08,270 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-04-28 03:50:08,270 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-04-28 03:50:08,271 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-04-28 03:50:08,271 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 03:50:08" (1/1) ... [2022-04-28 03:50:08,276 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-28 03:50:08,284 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 03:50:08,305 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-04-28 03:50:08,322 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-04-28 03:50:08,338 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-04-28 03:50:08,338 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-04-28 03:50:08,339 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-04-28 03:50:08,339 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-04-28 03:50:08,339 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-04-28 03:50:08,339 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-04-28 03:50:08,339 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-04-28 03:50:08,339 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-04-28 03:50:08,339 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-04-28 03:50:08,340 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-04-28 03:50:08,340 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-04-28 03:50:08,340 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-04-28 03:50:08,341 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-04-28 03:50:08,341 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-04-28 03:50:08,341 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-04-28 03:50:08,341 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-04-28 03:50:08,341 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-04-28 03:50:08,386 INFO L234 CfgBuilder]: Building ICFG [2022-04-28 03:50:08,387 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-04-28 03:50:08,513 INFO L275 CfgBuilder]: Performing block encoding [2022-04-28 03:50:08,518 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-04-28 03:50:08,519 INFO L299 CfgBuilder]: Removed 2 assume(true) statements. [2022-04-28 03:50:08,520 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.04 03:50:08 BoogieIcfgContainer [2022-04-28 03:50:08,520 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-04-28 03:50:08,521 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-04-28 03:50:08,522 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-04-28 03:50:08,541 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-04-28 03:50:08,544 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.04 03:50:08" (1/3) ... [2022-04-28 03:50:08,545 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2f43d906 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.04 03:50:08, skipping insertion in model container [2022-04-28 03:50:08,545 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 03:50:08" (2/3) ... [2022-04-28 03:50:08,545 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2f43d906 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.04 03:50:08, skipping insertion in model container [2022-04-28 03:50:08,545 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.04 03:50:08" (3/3) ... [2022-04-28 03:50:08,546 INFO L111 eAbstractionObserver]: Analyzing ICFG mono-crafted_7.c [2022-04-28 03:50:08,558 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2022-04-28 03:50:08,559 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-04-28 03:50:08,600 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-04-28 03:50:08,604 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=Craig_NestedInterpolation, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=FINITE_AUTOMATA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=All, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@6d7647a, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@2c34934c [2022-04-28 03:50:08,605 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-04-28 03:50:08,611 INFO L276 IsEmpty]: Start isEmpty. Operand has 21 states, 13 states have (on average 1.5384615384615385) internal successors, (20), 14 states have internal predecessors, (20), 3 states have call successors, (3), 3 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-28 03:50:08,616 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-04-28 03:50:08,616 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 03:50:08,617 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 03:50:08,617 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 03:50:08,621 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 03:50:08,621 INFO L85 PathProgramCache]: Analyzing trace with hash -1168619535, now seen corresponding path program 1 times [2022-04-28 03:50:08,628 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 03:50:08,628 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1856753732] [2022-04-28 03:50:08,636 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 03:50:08,637 INFO L85 PathProgramCache]: Analyzing trace with hash -1168619535, now seen corresponding path program 2 times [2022-04-28 03:50:08,639 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 03:50:08,640 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1257425767] [2022-04-28 03:50:08,640 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:50:08,640 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 03:50:08,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:50:08,780 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 03:50:08,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:50:08,799 INFO L290 TraceCheckUtils]: 0: Hoare triple {29#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(17, 2);call #Ultimate.allocInit(12, 3); {24#true} is VALID [2022-04-28 03:50:08,799 INFO L290 TraceCheckUtils]: 1: Hoare triple {24#true} assume true; {24#true} is VALID [2022-04-28 03:50:08,799 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {24#true} {24#true} #52#return; {24#true} is VALID [2022-04-28 03:50:08,802 INFO L272 TraceCheckUtils]: 0: Hoare triple {24#true} call ULTIMATE.init(); {29#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 03:50:08,802 INFO L290 TraceCheckUtils]: 1: Hoare triple {29#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(17, 2);call #Ultimate.allocInit(12, 3); {24#true} is VALID [2022-04-28 03:50:08,802 INFO L290 TraceCheckUtils]: 2: Hoare triple {24#true} assume true; {24#true} is VALID [2022-04-28 03:50:08,802 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {24#true} {24#true} #52#return; {24#true} is VALID [2022-04-28 03:50:08,803 INFO L272 TraceCheckUtils]: 4: Hoare triple {24#true} call #t~ret7 := main(); {24#true} is VALID [2022-04-28 03:50:08,803 INFO L290 TraceCheckUtils]: 5: Hoare triple {24#true} ~x~0 := 0;~y~0 := 50000;~z~0 := 0;~x~0 := 0; {24#true} is VALID [2022-04-28 03:50:08,804 INFO L290 TraceCheckUtils]: 6: Hoare triple {24#true} assume !true; {25#false} is VALID [2022-04-28 03:50:08,804 INFO L290 TraceCheckUtils]: 7: Hoare triple {25#false} assume !true; {25#false} is VALID [2022-04-28 03:50:08,804 INFO L272 TraceCheckUtils]: 8: Hoare triple {25#false} call __VERIFIER_assert((if ~z~0 == ~x~0 then 1 else 0)); {25#false} is VALID [2022-04-28 03:50:08,804 INFO L290 TraceCheckUtils]: 9: Hoare triple {25#false} ~cond := #in~cond; {25#false} is VALID [2022-04-28 03:50:08,804 INFO L290 TraceCheckUtils]: 10: Hoare triple {25#false} assume 0 == ~cond; {25#false} is VALID [2022-04-28 03:50:08,805 INFO L290 TraceCheckUtils]: 11: Hoare triple {25#false} assume !false; {25#false} is VALID [2022-04-28 03:50:08,805 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 03:50:08,806 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 03:50:08,806 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1257425767] [2022-04-28 03:50:08,807 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1257425767] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 03:50:08,807 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 03:50:08,807 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-04-28 03:50:08,809 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 03:50:08,809 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1856753732] [2022-04-28 03:50:08,809 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1856753732] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 03:50:08,809 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 03:50:08,810 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-04-28 03:50:08,810 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1668002028] [2022-04-28 03:50:08,810 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 03:50:08,813 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 2 states have internal predecessors, (8), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 12 [2022-04-28 03:50:08,814 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 03:50:08,816 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 2 states have internal predecessors, (8), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:50:08,837 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 12 edges. 12 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 03:50:08,837 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-04-28 03:50:08,837 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 03:50:08,857 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-04-28 03:50:08,858 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-28 03:50:08,860 INFO L87 Difference]: Start difference. First operand has 21 states, 13 states have (on average 1.5384615384615385) internal successors, (20), 14 states have internal predecessors, (20), 3 states have call successors, (3), 3 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 2 states have internal predecessors, (8), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:50:08,946 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:50:08,946 INFO L93 Difference]: Finished difference Result 34 states and 42 transitions. [2022-04-28 03:50:08,946 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-04-28 03:50:08,947 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 2 states have internal predecessors, (8), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 12 [2022-04-28 03:50:08,947 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 03:50:08,948 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 2 states have internal predecessors, (8), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:50:08,956 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 42 transitions. [2022-04-28 03:50:08,957 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 2 states have internal predecessors, (8), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:50:08,960 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 42 transitions. [2022-04-28 03:50:08,961 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 3 states and 42 transitions. [2022-04-28 03:50:09,039 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 42 edges. 42 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 03:50:09,045 INFO L225 Difference]: With dead ends: 34 [2022-04-28 03:50:09,045 INFO L226 Difference]: Without dead ends: 14 [2022-04-28 03:50:09,047 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-28 03:50:09,050 INFO L413 NwaCegarLoop]: 22 mSDtfsCounter, 14 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 25 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-28 03:50:09,050 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [15 Valid, 25 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-28 03:50:09,064 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14 states. [2022-04-28 03:50:09,082 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14 to 14. [2022-04-28 03:50:09,082 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 03:50:09,083 INFO L82 GeneralOperation]: Start isEquivalent. First operand 14 states. Second operand has 14 states, 9 states have (on average 1.3333333333333333) internal successors, (12), 9 states have internal predecessors, (12), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:50:09,084 INFO L74 IsIncluded]: Start isIncluded. First operand 14 states. Second operand has 14 states, 9 states have (on average 1.3333333333333333) internal successors, (12), 9 states have internal predecessors, (12), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:50:09,085 INFO L87 Difference]: Start difference. First operand 14 states. Second operand has 14 states, 9 states have (on average 1.3333333333333333) internal successors, (12), 9 states have internal predecessors, (12), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:50:09,088 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:50:09,088 INFO L93 Difference]: Finished difference Result 14 states and 16 transitions. [2022-04-28 03:50:09,089 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 16 transitions. [2022-04-28 03:50:09,089 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:50:09,089 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:50:09,090 INFO L74 IsIncluded]: Start isIncluded. First operand has 14 states, 9 states have (on average 1.3333333333333333) internal successors, (12), 9 states have internal predecessors, (12), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 14 states. [2022-04-28 03:50:09,090 INFO L87 Difference]: Start difference. First operand has 14 states, 9 states have (on average 1.3333333333333333) internal successors, (12), 9 states have internal predecessors, (12), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 14 states. [2022-04-28 03:50:09,093 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:50:09,093 INFO L93 Difference]: Finished difference Result 14 states and 16 transitions. [2022-04-28 03:50:09,094 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 16 transitions. [2022-04-28 03:50:09,094 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:50:09,094 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:50:09,094 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 03:50:09,094 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 03:50:09,095 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 9 states have (on average 1.3333333333333333) internal successors, (12), 9 states have internal predecessors, (12), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:50:09,101 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 16 transitions. [2022-04-28 03:50:09,103 INFO L78 Accepts]: Start accepts. Automaton has 14 states and 16 transitions. Word has length 12 [2022-04-28 03:50:09,103 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 03:50:09,103 INFO L495 AbstractCegarLoop]: Abstraction has 14 states and 16 transitions. [2022-04-28 03:50:09,104 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 2 states have internal predecessors, (8), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:50:09,104 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 14 states and 16 transitions. [2022-04-28 03:50:09,127 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 16 edges. 16 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 03:50:09,128 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 16 transitions. [2022-04-28 03:50:09,130 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-04-28 03:50:09,131 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 03:50:09,135 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 03:50:09,136 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-04-28 03:50:09,136 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 03:50:09,137 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 03:50:09,137 INFO L85 PathProgramCache]: Analyzing trace with hash -1458605129, now seen corresponding path program 1 times [2022-04-28 03:50:09,137 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 03:50:09,138 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1397718015] [2022-04-28 03:50:09,142 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 03:50:09,142 INFO L85 PathProgramCache]: Analyzing trace with hash -1458605129, now seen corresponding path program 2 times [2022-04-28 03:50:09,143 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 03:50:09,145 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [422240515] [2022-04-28 03:50:09,145 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:50:09,146 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 03:50:09,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:50:09,236 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 03:50:09,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:50:09,253 INFO L290 TraceCheckUtils]: 0: Hoare triple {162#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(17, 2);call #Ultimate.allocInit(12, 3); {156#true} is VALID [2022-04-28 03:50:09,253 INFO L290 TraceCheckUtils]: 1: Hoare triple {156#true} assume true; {156#true} is VALID [2022-04-28 03:50:09,253 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {156#true} {156#true} #52#return; {156#true} is VALID [2022-04-28 03:50:09,254 INFO L272 TraceCheckUtils]: 0: Hoare triple {156#true} call ULTIMATE.init(); {162#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 03:50:09,254 INFO L290 TraceCheckUtils]: 1: Hoare triple {162#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(17, 2);call #Ultimate.allocInit(12, 3); {156#true} is VALID [2022-04-28 03:50:09,254 INFO L290 TraceCheckUtils]: 2: Hoare triple {156#true} assume true; {156#true} is VALID [2022-04-28 03:50:09,254 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {156#true} {156#true} #52#return; {156#true} is VALID [2022-04-28 03:50:09,255 INFO L272 TraceCheckUtils]: 4: Hoare triple {156#true} call #t~ret7 := main(); {156#true} is VALID [2022-04-28 03:50:09,255 INFO L290 TraceCheckUtils]: 5: Hoare triple {156#true} ~x~0 := 0;~y~0 := 50000;~z~0 := 0;~x~0 := 0; {161#(= main_~x~0 0)} is VALID [2022-04-28 03:50:09,256 INFO L290 TraceCheckUtils]: 6: Hoare triple {161#(= main_~x~0 0)} assume !(~x~0 < 1000000); {157#false} is VALID [2022-04-28 03:50:09,256 INFO L290 TraceCheckUtils]: 7: Hoare triple {157#false} assume !(~y~0 > 0); {157#false} is VALID [2022-04-28 03:50:09,256 INFO L272 TraceCheckUtils]: 8: Hoare triple {157#false} call __VERIFIER_assert((if ~z~0 == ~x~0 then 1 else 0)); {157#false} is VALID [2022-04-28 03:50:09,256 INFO L290 TraceCheckUtils]: 9: Hoare triple {157#false} ~cond := #in~cond; {157#false} is VALID [2022-04-28 03:50:09,256 INFO L290 TraceCheckUtils]: 10: Hoare triple {157#false} assume 0 == ~cond; {157#false} is VALID [2022-04-28 03:50:09,256 INFO L290 TraceCheckUtils]: 11: Hoare triple {157#false} assume !false; {157#false} is VALID [2022-04-28 03:50:09,257 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 03:50:09,257 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 03:50:09,257 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [422240515] [2022-04-28 03:50:09,257 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [422240515] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 03:50:09,257 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 03:50:09,257 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-28 03:50:09,258 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 03:50:09,258 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1397718015] [2022-04-28 03:50:09,258 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1397718015] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 03:50:09,258 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 03:50:09,258 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-28 03:50:09,258 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1247922841] [2022-04-28 03:50:09,258 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 03:50:09,259 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.0) internal successors, (8), 3 states have internal predecessors, (8), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 12 [2022-04-28 03:50:09,259 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 03:50:09,259 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 2.0) internal successors, (8), 3 states have internal predecessors, (8), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:50:09,269 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 12 edges. 12 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 03:50:09,269 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-28 03:50:09,269 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 03:50:09,270 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-28 03:50:09,270 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-28 03:50:09,270 INFO L87 Difference]: Start difference. First operand 14 states and 16 transitions. Second operand has 4 states, 4 states have (on average 2.0) internal successors, (8), 3 states have internal predecessors, (8), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:50:09,332 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:50:09,332 INFO L93 Difference]: Finished difference Result 24 states and 30 transitions. [2022-04-28 03:50:09,332 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-28 03:50:09,332 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.0) internal successors, (8), 3 states have internal predecessors, (8), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 12 [2022-04-28 03:50:09,332 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 03:50:09,333 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 2.0) internal successors, (8), 3 states have internal predecessors, (8), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:50:09,334 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 30 transitions. [2022-04-28 03:50:09,334 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 2.0) internal successors, (8), 3 states have internal predecessors, (8), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:50:09,335 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 30 transitions. [2022-04-28 03:50:09,335 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 30 transitions. [2022-04-28 03:50:09,360 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 30 edges. 30 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 03:50:09,361 INFO L225 Difference]: With dead ends: 24 [2022-04-28 03:50:09,361 INFO L226 Difference]: Without dead ends: 16 [2022-04-28 03:50:09,361 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-04-28 03:50:09,362 INFO L413 NwaCegarLoop]: 14 mSDtfsCounter, 12 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 21 SdHoareTripleChecker+Invalid, 17 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-28 03:50:09,363 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 21 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-28 03:50:09,364 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states. [2022-04-28 03:50:09,366 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 16. [2022-04-28 03:50:09,366 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 03:50:09,367 INFO L82 GeneralOperation]: Start isEquivalent. First operand 16 states. Second operand has 16 states, 11 states have (on average 1.2727272727272727) internal successors, (14), 11 states have internal predecessors, (14), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:50:09,367 INFO L74 IsIncluded]: Start isIncluded. First operand 16 states. Second operand has 16 states, 11 states have (on average 1.2727272727272727) internal successors, (14), 11 states have internal predecessors, (14), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:50:09,367 INFO L87 Difference]: Start difference. First operand 16 states. Second operand has 16 states, 11 states have (on average 1.2727272727272727) internal successors, (14), 11 states have internal predecessors, (14), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:50:09,368 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:50:09,368 INFO L93 Difference]: Finished difference Result 16 states and 18 transitions. [2022-04-28 03:50:09,368 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 18 transitions. [2022-04-28 03:50:09,369 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:50:09,369 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:50:09,369 INFO L74 IsIncluded]: Start isIncluded. First operand has 16 states, 11 states have (on average 1.2727272727272727) internal successors, (14), 11 states have internal predecessors, (14), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 16 states. [2022-04-28 03:50:09,369 INFO L87 Difference]: Start difference. First operand has 16 states, 11 states have (on average 1.2727272727272727) internal successors, (14), 11 states have internal predecessors, (14), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 16 states. [2022-04-28 03:50:09,370 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:50:09,371 INFO L93 Difference]: Finished difference Result 16 states and 18 transitions. [2022-04-28 03:50:09,371 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 18 transitions. [2022-04-28 03:50:09,371 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:50:09,371 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:50:09,371 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 03:50:09,371 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 03:50:09,372 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16 states, 11 states have (on average 1.2727272727272727) internal successors, (14), 11 states have internal predecessors, (14), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:50:09,373 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 18 transitions. [2022-04-28 03:50:09,373 INFO L78 Accepts]: Start accepts. Automaton has 16 states and 18 transitions. Word has length 12 [2022-04-28 03:50:09,373 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 03:50:09,373 INFO L495 AbstractCegarLoop]: Abstraction has 16 states and 18 transitions. [2022-04-28 03:50:09,373 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.0) internal successors, (8), 3 states have internal predecessors, (8), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:50:09,374 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 16 states and 18 transitions. [2022-04-28 03:50:09,394 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 18 edges. 18 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 03:50:09,394 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 18 transitions. [2022-04-28 03:50:09,395 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-04-28 03:50:09,395 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 03:50:09,395 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 03:50:09,395 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-04-28 03:50:09,397 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 03:50:09,398 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 03:50:09,398 INFO L85 PathProgramCache]: Analyzing trace with hash -1316432198, now seen corresponding path program 1 times [2022-04-28 03:50:09,398 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 03:50:09,400 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1583655709] [2022-04-28 03:50:13,567 WARN L977 rdanLoopAcceleration]: Unable to prove correctness of quantifier elimination. [2022-04-28 03:50:13,695 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 1 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 03:50:13,697 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-28 03:50:13,700 INFO L85 PathProgramCache]: Analyzing trace with hash -1148992352, now seen corresponding path program 1 times [2022-04-28 03:50:13,700 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 03:50:13,700 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1462206049] [2022-04-28 03:50:13,700 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:50:13,700 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 03:50:13,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:50:13,733 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 03:50:13,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:50:13,743 INFO L290 TraceCheckUtils]: 0: Hoare triple {285#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(17, 2);call #Ultimate.allocInit(12, 3); {279#true} is VALID [2022-04-28 03:50:13,743 INFO L290 TraceCheckUtils]: 1: Hoare triple {279#true} assume true; {279#true} is VALID [2022-04-28 03:50:13,743 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {279#true} {279#true} #52#return; {279#true} is VALID [2022-04-28 03:50:13,744 INFO L272 TraceCheckUtils]: 0: Hoare triple {279#true} call ULTIMATE.init(); {285#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 03:50:13,744 INFO L290 TraceCheckUtils]: 1: Hoare triple {285#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(17, 2);call #Ultimate.allocInit(12, 3); {279#true} is VALID [2022-04-28 03:50:13,744 INFO L290 TraceCheckUtils]: 2: Hoare triple {279#true} assume true; {279#true} is VALID [2022-04-28 03:50:13,745 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {279#true} {279#true} #52#return; {279#true} is VALID [2022-04-28 03:50:13,747 INFO L272 TraceCheckUtils]: 4: Hoare triple {279#true} call #t~ret7 := main(); {279#true} is VALID [2022-04-28 03:50:13,748 INFO L290 TraceCheckUtils]: 5: Hoare triple {279#true} ~x~0 := 0;~y~0 := 50000;~z~0 := 0;~x~0 := 0; {284#(<= 50000 main_~y~0)} is VALID [2022-04-28 03:50:13,750 INFO L290 TraceCheckUtils]: 6: Hoare triple {284#(<= 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#(<= 50000 main_~y~0)} is VALID [2022-04-28 03:50:13,751 INFO L290 TraceCheckUtils]: 7: Hoare triple {284#(<= 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#(<= 50000 main_~y~0)} is VALID [2022-04-28 03:50:13,752 INFO L290 TraceCheckUtils]: 8: Hoare triple {284#(<= 50000 main_~y~0)} assume !(~y~0 > 0); {280#false} is VALID [2022-04-28 03:50:13,752 INFO L272 TraceCheckUtils]: 9: Hoare triple {280#false} call __VERIFIER_assert((if ~z~0 == ~x~0 then 1 else 0)); {280#false} is VALID [2022-04-28 03:50:13,752 INFO L290 TraceCheckUtils]: 10: Hoare triple {280#false} ~cond := #in~cond; {280#false} is VALID [2022-04-28 03:50:13,752 INFO L290 TraceCheckUtils]: 11: Hoare triple {280#false} assume 0 == ~cond; {280#false} is VALID [2022-04-28 03:50:13,753 INFO L290 TraceCheckUtils]: 12: Hoare triple {280#false} assume !false; {280#false} is VALID [2022-04-28 03:50:13,753 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 03:50:13,753 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 03:50:13,753 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1462206049] [2022-04-28 03:50:13,753 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1462206049] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 03:50:13,753 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 03:50:13,753 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-28 03:50:13,803 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 03:50:13,804 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1583655709] [2022-04-28 03:50:13,804 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1583655709] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 03:50:13,804 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 03:50:13,804 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-28 03:50:13,804 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [701603710] [2022-04-28 03:50:13,804 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 03:50:13,805 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 1.6666666666666667) internal successors, (10), 5 states have internal predecessors, (10), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 14 [2022-04-28 03:50:13,805 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 03:50:13,805 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 6 states, 6 states have (on average 1.6666666666666667) internal successors, (10), 5 states have internal predecessors, (10), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:50:13,814 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 14 edges. 14 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 03:50:13,814 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-28 03:50:13,814 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 03:50:13,815 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-28 03:50:13,815 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2022-04-28 03:50:13,815 INFO L87 Difference]: Start difference. First operand 16 states and 18 transitions. Second operand has 6 states, 6 states have (on average 1.6666666666666667) internal successors, (10), 5 states have internal predecessors, (10), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:50:13,927 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:50:13,927 INFO L93 Difference]: Finished difference Result 26 states and 32 transitions. [2022-04-28 03:50:13,928 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-04-28 03:50:13,928 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 1.6666666666666667) internal successors, (10), 5 states have internal predecessors, (10), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 14 [2022-04-28 03:50:13,928 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 03:50:13,928 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 1.6666666666666667) internal successors, (10), 5 states have internal predecessors, (10), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:50:13,929 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 30 transitions. [2022-04-28 03:50:13,929 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 1.6666666666666667) internal successors, (10), 5 states have internal predecessors, (10), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:50:13,930 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 30 transitions. [2022-04-28 03:50:13,930 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 6 states and 30 transitions. [2022-04-28 03:50:13,953 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 30 edges. 30 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 03:50:13,954 INFO L225 Difference]: With dead ends: 26 [2022-04-28 03:50:13,954 INFO L226 Difference]: Without dead ends: 20 [2022-04-28 03:50:13,954 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2022-04-28 03:50:13,955 INFO L413 NwaCegarLoop]: 12 mSDtfsCounter, 15 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 24 SdHoareTripleChecker+Invalid, 36 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 21 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-28 03:50:13,955 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [15 Valid, 24 Invalid, 36 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-28 03:50:13,955 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2022-04-28 03:50:13,965 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 20. [2022-04-28 03:50:13,965 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 03:50:13,965 INFO L82 GeneralOperation]: Start isEquivalent. First operand 20 states. Second operand has 20 states, 15 states have (on average 1.2666666666666666) internal successors, (19), 15 states have internal predecessors, (19), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:50:13,965 INFO L74 IsIncluded]: Start isIncluded. First operand 20 states. Second operand has 20 states, 15 states have (on average 1.2666666666666666) internal successors, (19), 15 states have internal predecessors, (19), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:50:13,966 INFO L87 Difference]: Start difference. First operand 20 states. Second operand has 20 states, 15 states have (on average 1.2666666666666666) internal successors, (19), 15 states have internal predecessors, (19), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:50:13,966 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:50:13,967 INFO L93 Difference]: Finished difference Result 20 states and 23 transitions. [2022-04-28 03:50:13,967 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 23 transitions. [2022-04-28 03:50:13,967 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:50:13,967 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:50:13,967 INFO L74 IsIncluded]: Start isIncluded. First operand has 20 states, 15 states have (on average 1.2666666666666666) internal successors, (19), 15 states have internal predecessors, (19), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 20 states. [2022-04-28 03:50:13,967 INFO L87 Difference]: Start difference. First operand has 20 states, 15 states have (on average 1.2666666666666666) internal successors, (19), 15 states have internal predecessors, (19), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 20 states. [2022-04-28 03:50:13,968 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:50:13,968 INFO L93 Difference]: Finished difference Result 20 states and 23 transitions. [2022-04-28 03:50:13,968 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 23 transitions. [2022-04-28 03:50:13,968 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:50:13,968 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:50:13,969 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 03:50:13,969 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 03:50:13,969 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20 states, 15 states have (on average 1.2666666666666666) internal successors, (19), 15 states have internal predecessors, (19), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:50:13,969 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 23 transitions. [2022-04-28 03:50:13,970 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 23 transitions. Word has length 14 [2022-04-28 03:50:13,970 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 03:50:13,970 INFO L495 AbstractCegarLoop]: Abstraction has 20 states and 23 transitions. [2022-04-28 03:50:13,970 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 1.6666666666666667) internal successors, (10), 5 states have internal predecessors, (10), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:50:13,970 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 20 states and 23 transitions. [2022-04-28 03:50:13,988 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 23 edges. 23 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 03:50:13,988 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 23 transitions. [2022-04-28 03:50:13,989 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-04-28 03:50:13,989 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 03:50:13,989 INFO L195 NwaCegarLoop]: trace histogram [3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 03:50:13,989 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-04-28 03:50:13,991 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 03:50:13,992 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 03:50:13,992 INFO L85 PathProgramCache]: Analyzing trace with hash -1342594849, now seen corresponding path program 1 times [2022-04-28 03:50:13,992 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 03:50:13,992 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [993384369] [2022-04-28 03:50:18,079 WARN L977 rdanLoopAcceleration]: Unable to prove correctness of quantifier elimination. [2022-04-28 03:50:18,183 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 1 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 03:50:18,502 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={1=1, 2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 03:50:18,503 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-28 03:50:18,506 INFO L85 PathProgramCache]: Analyzing trace with hash -538275198, now seen corresponding path program 1 times [2022-04-28 03:50:18,506 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 03:50:18,506 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [127394916] [2022-04-28 03:50:18,506 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:50:18,506 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 03:50:18,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:50:18,550 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 03:50:18,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:50:18,555 INFO L290 TraceCheckUtils]: 0: Hoare triple {435#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(17, 2);call #Ultimate.allocInit(12, 3); {428#true} is VALID [2022-04-28 03:50:18,555 INFO L290 TraceCheckUtils]: 1: Hoare triple {428#true} assume true; {428#true} is VALID [2022-04-28 03:50:18,555 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {428#true} {428#true} #52#return; {428#true} is VALID [2022-04-28 03:50:18,556 INFO L272 TraceCheckUtils]: 0: Hoare triple {428#true} call ULTIMATE.init(); {435#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 03:50:18,556 INFO L290 TraceCheckUtils]: 1: Hoare triple {435#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(17, 2);call #Ultimate.allocInit(12, 3); {428#true} is VALID [2022-04-28 03:50:18,556 INFO L290 TraceCheckUtils]: 2: Hoare triple {428#true} assume true; {428#true} is VALID [2022-04-28 03:50:18,556 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {428#true} {428#true} #52#return; {428#true} is VALID [2022-04-28 03:50:18,556 INFO L272 TraceCheckUtils]: 4: Hoare triple {428#true} call #t~ret7 := main(); {428#true} is VALID [2022-04-28 03:50:18,557 INFO L290 TraceCheckUtils]: 5: Hoare triple {428#true} ~x~0 := 0;~y~0 := 50000;~z~0 := 0;~x~0 := 0; {433#(<= 50000 main_~y~0)} is VALID [2022-04-28 03:50:18,557 INFO L290 TraceCheckUtils]: 6: Hoare triple {433#(<= 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] {433#(<= 50000 main_~y~0)} is VALID [2022-04-28 03:50:18,557 INFO L290 TraceCheckUtils]: 7: Hoare triple {433#(<= 50000 main_~y~0)} [61] L18-1_primed-->L11-2: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {433#(<= 50000 main_~y~0)} is VALID [2022-04-28 03:50:18,558 INFO L290 TraceCheckUtils]: 8: Hoare triple {433#(<= 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] {433#(<= 50000 main_~y~0)} is VALID [2022-04-28 03:50:18,559 INFO L290 TraceCheckUtils]: 9: Hoare triple {433#(<= 50000 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[] {433#(<= 50000 main_~y~0)} is VALID [2022-04-28 03:50:18,559 INFO L290 TraceCheckUtils]: 10: Hoare triple {433#(<= 50000 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {434#(<= 49998 main_~y~0)} is VALID [2022-04-28 03:50:18,560 INFO L290 TraceCheckUtils]: 11: Hoare triple {434#(<= 49998 main_~y~0)} assume !(~y~0 > 0); {429#false} is VALID [2022-04-28 03:50:18,560 INFO L272 TraceCheckUtils]: 12: Hoare triple {429#false} call __VERIFIER_assert((if ~z~0 == ~x~0 then 1 else 0)); {429#false} is VALID [2022-04-28 03:50:18,560 INFO L290 TraceCheckUtils]: 13: Hoare triple {429#false} ~cond := #in~cond; {429#false} is VALID [2022-04-28 03:50:18,560 INFO L290 TraceCheckUtils]: 14: Hoare triple {429#false} assume 0 == ~cond; {429#false} is VALID [2022-04-28 03:50:18,560 INFO L290 TraceCheckUtils]: 15: Hoare triple {429#false} assume !false; {429#false} is VALID [2022-04-28 03:50:18,560 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-04-28 03:50:18,561 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 03:50:18,561 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [127394916] [2022-04-28 03:50:18,561 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [127394916] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 03:50:18,561 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1525489196] [2022-04-28 03:50:18,561 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:50:18,561 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 03:50:18,561 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 03:50:18,562 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 03:50:18,566 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-04-28 03:50:18,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:50:18,611 INFO L263 TraceCheckSpWp]: Trace formula consists of 64 conjuncts, 4 conjunts are in the unsatisfiable core [2022-04-28 03:50:18,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:50:18,636 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 03:50:18,906 INFO L272 TraceCheckUtils]: 0: Hoare triple {428#true} call ULTIMATE.init(); {428#true} is VALID [2022-04-28 03:50:18,906 INFO L290 TraceCheckUtils]: 1: Hoare triple {428#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(17, 2);call #Ultimate.allocInit(12, 3); {428#true} is VALID [2022-04-28 03:50:18,906 INFO L290 TraceCheckUtils]: 2: Hoare triple {428#true} assume true; {428#true} is VALID [2022-04-28 03:50:18,906 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {428#true} {428#true} #52#return; {428#true} is VALID [2022-04-28 03:50:18,906 INFO L272 TraceCheckUtils]: 4: Hoare triple {428#true} call #t~ret7 := main(); {428#true} is VALID [2022-04-28 03:50:18,907 INFO L290 TraceCheckUtils]: 5: Hoare triple {428#true} ~x~0 := 0;~y~0 := 50000;~z~0 := 0;~x~0 := 0; {433#(<= 50000 main_~y~0)} is VALID [2022-04-28 03:50:18,907 INFO L290 TraceCheckUtils]: 6: Hoare triple {433#(<= 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] {433#(<= 50000 main_~y~0)} is VALID [2022-04-28 03:50:18,907 INFO L290 TraceCheckUtils]: 7: Hoare triple {433#(<= 50000 main_~y~0)} [61] L18-1_primed-->L11-2: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {433#(<= 50000 main_~y~0)} is VALID [2022-04-28 03:50:18,908 INFO L290 TraceCheckUtils]: 8: Hoare triple {433#(<= 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] {433#(<= 50000 main_~y~0)} is VALID [2022-04-28 03:50:18,909 INFO L290 TraceCheckUtils]: 9: Hoare triple {433#(<= 50000 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[] {433#(<= 50000 main_~y~0)} is VALID [2022-04-28 03:50:18,910 INFO L290 TraceCheckUtils]: 10: Hoare triple {433#(<= 50000 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {434#(<= 49998 main_~y~0)} is VALID [2022-04-28 03:50:18,910 INFO L290 TraceCheckUtils]: 11: Hoare triple {434#(<= 49998 main_~y~0)} assume !(~y~0 > 0); {429#false} is VALID [2022-04-28 03:50:18,910 INFO L272 TraceCheckUtils]: 12: Hoare triple {429#false} call __VERIFIER_assert((if ~z~0 == ~x~0 then 1 else 0)); {429#false} is VALID [2022-04-28 03:50:18,910 INFO L290 TraceCheckUtils]: 13: Hoare triple {429#false} ~cond := #in~cond; {429#false} is VALID [2022-04-28 03:50:18,911 INFO L290 TraceCheckUtils]: 14: Hoare triple {429#false} assume 0 == ~cond; {429#false} is VALID [2022-04-28 03:50:18,911 INFO L290 TraceCheckUtils]: 15: Hoare triple {429#false} assume !false; {429#false} is VALID [2022-04-28 03:50:18,911 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-04-28 03:50:18,911 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 03:50:19,187 INFO L290 TraceCheckUtils]: 15: Hoare triple {429#false} assume !false; {429#false} is VALID [2022-04-28 03:50:19,188 INFO L290 TraceCheckUtils]: 14: Hoare triple {429#false} assume 0 == ~cond; {429#false} is VALID [2022-04-28 03:50:19,188 INFO L290 TraceCheckUtils]: 13: Hoare triple {429#false} ~cond := #in~cond; {429#false} is VALID [2022-04-28 03:50:19,188 INFO L272 TraceCheckUtils]: 12: Hoare triple {429#false} call __VERIFIER_assert((if ~z~0 == ~x~0 then 1 else 0)); {429#false} is VALID [2022-04-28 03:50:19,190 INFO L290 TraceCheckUtils]: 11: Hoare triple {496#(< 0 main_~y~0)} assume !(~y~0 > 0); {429#false} is VALID [2022-04-28 03:50:19,191 INFO L290 TraceCheckUtils]: 10: Hoare triple {500#(< 2 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {496#(< 0 main_~y~0)} is VALID [2022-04-28 03:50:19,191 INFO L290 TraceCheckUtils]: 9: Hoare triple {500#(< 2 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[] {500#(< 2 main_~y~0)} is VALID [2022-04-28 03:50:19,192 INFO L290 TraceCheckUtils]: 8: Hoare triple {500#(< 2 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] {500#(< 2 main_~y~0)} is VALID [2022-04-28 03:50:19,192 INFO L290 TraceCheckUtils]: 7: Hoare triple {500#(< 2 main_~y~0)} [61] L18-1_primed-->L11-2: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {500#(< 2 main_~y~0)} is VALID [2022-04-28 03:50:19,193 INFO L290 TraceCheckUtils]: 6: Hoare triple {500#(< 2 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] {500#(< 2 main_~y~0)} is VALID [2022-04-28 03:50:19,193 INFO L290 TraceCheckUtils]: 5: Hoare triple {428#true} ~x~0 := 0;~y~0 := 50000;~z~0 := 0;~x~0 := 0; {500#(< 2 main_~y~0)} is VALID [2022-04-28 03:50:19,193 INFO L272 TraceCheckUtils]: 4: Hoare triple {428#true} call #t~ret7 := main(); {428#true} is VALID [2022-04-28 03:50:19,193 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {428#true} {428#true} #52#return; {428#true} is VALID [2022-04-28 03:50:19,193 INFO L290 TraceCheckUtils]: 2: Hoare triple {428#true} assume true; {428#true} is VALID [2022-04-28 03:50:19,193 INFO L290 TraceCheckUtils]: 1: Hoare triple {428#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(17, 2);call #Ultimate.allocInit(12, 3); {428#true} is VALID [2022-04-28 03:50:19,194 INFO L272 TraceCheckUtils]: 0: Hoare triple {428#true} call ULTIMATE.init(); {428#true} is VALID [2022-04-28 03:50:19,194 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-04-28 03:50:19,194 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1525489196] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 03:50:19,194 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 03:50:19,194 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4, 4] total 7 [2022-04-28 03:50:19,310 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 03:50:19,310 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [993384369] [2022-04-28 03:50:19,310 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [993384369] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 03:50:19,310 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 03:50:19,310 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-04-28 03:50:19,310 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1263386760] [2022-04-28 03:50:19,310 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 03:50:19,311 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 1.6666666666666667) internal successors, (15), 8 states have internal predecessors, (15), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 19 [2022-04-28 03:50:19,311 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 03:50:19,311 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 9 states, 9 states have (on average 1.6666666666666667) internal successors, (15), 8 states have internal predecessors, (15), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:50:19,328 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 19 edges. 19 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 03:50:19,328 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-04-28 03:50:19,328 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 03:50:19,328 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-04-28 03:50:19,328 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=66, Unknown=0, NotChecked=0, Total=110 [2022-04-28 03:50:19,329 INFO L87 Difference]: Start difference. First operand 20 states and 23 transitions. Second operand has 9 states, 9 states have (on average 1.6666666666666667) internal successors, (15), 8 states have internal predecessors, (15), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:50:19,541 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:50:19,541 INFO L93 Difference]: Finished difference Result 37 states and 48 transitions. [2022-04-28 03:50:19,541 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-04-28 03:50:19,541 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 1.6666666666666667) internal successors, (15), 8 states have internal predecessors, (15), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 19 [2022-04-28 03:50:19,541 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 03:50:19,541 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 9 states have (on average 1.6666666666666667) internal successors, (15), 8 states have internal predecessors, (15), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:50:19,542 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 41 transitions. [2022-04-28 03:50:19,543 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 9 states have (on average 1.6666666666666667) internal successors, (15), 8 states have internal predecessors, (15), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:50:19,543 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 41 transitions. [2022-04-28 03:50:19,544 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 9 states and 41 transitions. [2022-04-28 03:50:19,580 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 41 edges. 41 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 03:50:19,581 INFO L225 Difference]: With dead ends: 37 [2022-04-28 03:50:19,581 INFO L226 Difference]: Without dead ends: 25 [2022-04-28 03:50:19,581 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 39 SyntacticMatches, 1 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 53 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=104, Invalid=168, Unknown=0, NotChecked=0, Total=272 [2022-04-28 03:50:19,582 INFO L413 NwaCegarLoop]: 12 mSDtfsCounter, 19 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 43 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 24 SdHoareTripleChecker+Invalid, 69 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 43 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-28 03:50:19,582 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [19 Valid, 24 Invalid, 69 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 43 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-28 03:50:19,582 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2022-04-28 03:50:19,602 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 25. [2022-04-28 03:50:19,602 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 03:50:19,603 INFO L82 GeneralOperation]: Start isEquivalent. First operand 25 states. Second operand has 25 states, 20 states have (on average 1.2) internal successors, (24), 20 states have internal predecessors, (24), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:50:19,604 INFO L74 IsIncluded]: Start isIncluded. First operand 25 states. Second operand has 25 states, 20 states have (on average 1.2) internal successors, (24), 20 states have internal predecessors, (24), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:50:19,604 INFO L87 Difference]: Start difference. First operand 25 states. Second operand has 25 states, 20 states have (on average 1.2) internal successors, (24), 20 states have internal predecessors, (24), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:50:19,608 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:50:19,609 INFO L93 Difference]: Finished difference Result 25 states and 28 transitions. [2022-04-28 03:50:19,609 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 28 transitions. [2022-04-28 03:50:19,609 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:50:19,609 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:50:19,609 INFO L74 IsIncluded]: Start isIncluded. First operand has 25 states, 20 states have (on average 1.2) internal successors, (24), 20 states have internal predecessors, (24), 3 states have call successors, (3), 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 25 states. [2022-04-28 03:50:19,609 INFO L87 Difference]: Start difference. First operand has 25 states, 20 states have (on average 1.2) internal successors, (24), 20 states have internal predecessors, (24), 3 states have call successors, (3), 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 25 states. [2022-04-28 03:50:19,611 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:50:19,612 INFO L93 Difference]: Finished difference Result 25 states and 28 transitions. [2022-04-28 03:50:19,612 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 28 transitions. [2022-04-28 03:50:19,613 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:50:19,613 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:50:19,613 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 03:50:19,613 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 03:50:19,613 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25 states, 20 states have (on average 1.2) internal successors, (24), 20 states have internal predecessors, (24), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:50:19,617 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 28 transitions. [2022-04-28 03:50:19,617 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 28 transitions. Word has length 19 [2022-04-28 03:50:19,617 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 03:50:19,617 INFO L495 AbstractCegarLoop]: Abstraction has 25 states and 28 transitions. [2022-04-28 03:50:19,617 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 1.6666666666666667) internal successors, (15), 8 states have internal predecessors, (15), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:50:19,617 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 25 states and 28 transitions. [2022-04-28 03:50:19,643 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 28 edges. 28 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 03:50:19,644 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 28 transitions. [2022-04-28 03:50:19,644 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-04-28 03:50:19,644 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 03:50:19,645 INFO L195 NwaCegarLoop]: trace histogram [5, 4, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 03:50:19,675 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-04-28 03:50:19,859 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 03:50:19,859 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 03:50:19,860 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 03:50:19,860 INFO L85 PathProgramCache]: Analyzing trace with hash 1246825262, now seen corresponding path program 2 times [2022-04-28 03:50:19,860 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 03:50:19,860 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1598407761] [2022-04-28 03:50:23,925 WARN L977 rdanLoopAcceleration]: Unable to prove correctness of quantifier elimination. [2022-04-28 03:50:23,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-28 03:50:24,284 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={1=1, 2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 03:50:24,288 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-28 03:50:24,290 INFO L85 PathProgramCache]: Analyzing trace with hash 886374433, now seen corresponding path program 1 times [2022-04-28 03:50:24,291 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 03:50:24,291 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1820170041] [2022-04-28 03:50:24,291 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:50:24,291 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 03:50:24,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:50:24,379 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 03:50:24,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:50:24,397 INFO L290 TraceCheckUtils]: 0: Hoare triple {734#(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); {723#true} is VALID [2022-04-28 03:50:24,397 INFO L290 TraceCheckUtils]: 1: Hoare triple {723#true} assume true; {723#true} is VALID [2022-04-28 03:50:24,397 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {723#true} {723#true} #52#return; {723#true} is VALID [2022-04-28 03:50:24,398 INFO L272 TraceCheckUtils]: 0: Hoare triple {723#true} call ULTIMATE.init(); {734#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 03:50:24,398 INFO L290 TraceCheckUtils]: 1: Hoare triple {734#(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); {723#true} is VALID [2022-04-28 03:50:24,400 INFO L290 TraceCheckUtils]: 2: Hoare triple {723#true} assume true; {723#true} is VALID [2022-04-28 03:50:24,400 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {723#true} {723#true} #52#return; {723#true} is VALID [2022-04-28 03:50:24,400 INFO L272 TraceCheckUtils]: 4: Hoare triple {723#true} call #t~ret7 := main(); {723#true} is VALID [2022-04-28 03:50:24,401 INFO L290 TraceCheckUtils]: 5: Hoare triple {723#true} ~x~0 := 0;~y~0 := 50000;~z~0 := 0;~x~0 := 0; {728#(and (= main_~x~0 0) (<= 50000 main_~y~0))} is VALID [2022-04-28 03:50:24,401 INFO L290 TraceCheckUtils]: 6: Hoare triple {728#(and (= main_~x~0 0) (<= 50000 main_~y~0))} [64] L11-2-->L18-1_primed: Formula: (let ((.cse0 (= v_main_~x~0_41 v_main_~x~0_40)) (.cse1 (= |v_main_#t~post4_15| |v_main_#t~post4_14|))) (or (and (< v_main_~x~0_41 v_main_~x~0_40) (< v_main_~x~0_40 50001)) (and .cse0 .cse1 (<= 50000 v_main_~x~0_41)) (and .cse0 .cse1))) InVars {main_~x~0=v_main_~x~0_41, main_#t~post4=|v_main_#t~post4_15|} OutVars{main_~x~0=v_main_~x~0_40, main_#t~post4=|v_main_#t~post4_14|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {729#(and (<= main_~x~0 main_~y~0) (<= 50000 main_~y~0))} is VALID [2022-04-28 03:50:24,402 INFO L290 TraceCheckUtils]: 7: Hoare triple {729#(and (<= main_~x~0 main_~y~0) (<= 50000 main_~y~0))} [65] L18-1_primed-->L11-2: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {729#(and (<= main_~x~0 main_~y~0) (<= 50000 main_~y~0))} is VALID [2022-04-28 03:50:24,402 INFO L290 TraceCheckUtils]: 8: Hoare triple {729#(and (<= main_~x~0 main_~y~0) (<= 50000 main_~y~0))} [66] L11-2-->L18-1_primed: Formula: (let ((.cse0 (<= 50000 v_main_~x~0_43)) (.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_#t~post6_11| |v_main_#t~post6_10|)) (.cse4 (= v_main_~x~0_43 v_main_~x~0_42))) (or (and (< v_main_~x~0_42 1000001) (= (+ v_main_~x~0_43 v_main_~y~0_20) (+ v_main_~x~0_42 v_main_~y~0_21)) (< v_main_~x~0_43 v_main_~x~0_42) .cse0) (and .cse1 .cse2 (or (not .cse0) (not (< v_main_~x~0_43 1000000))) .cse3 .cse4) (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_43, 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_42, main_#t~post6=|v_main_#t~post6_10|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {730#(or (<= main_~x~0 main_~y~0) (<= 50000 main_~y~0))} is VALID [2022-04-28 03:50:24,403 INFO L290 TraceCheckUtils]: 9: Hoare triple {730#(or (<= main_~x~0 main_~y~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[] {731#(<= 50000 main_~y~0)} is VALID [2022-04-28 03:50:24,403 INFO L290 TraceCheckUtils]: 10: Hoare triple {731#(<= 50000 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {732#(<= 49998 main_~y~0)} is VALID [2022-04-28 03:50:24,405 INFO L290 TraceCheckUtils]: 11: Hoare triple {732#(<= 49998 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {733#(<= 49996 main_~y~0)} is VALID [2022-04-28 03:50:24,405 INFO L290 TraceCheckUtils]: 12: Hoare triple {733#(<= 49996 main_~y~0)} assume !(~y~0 > 0); {724#false} is VALID [2022-04-28 03:50:24,406 INFO L272 TraceCheckUtils]: 13: Hoare triple {724#false} call __VERIFIER_assert((if ~z~0 == ~x~0 then 1 else 0)); {724#false} is VALID [2022-04-28 03:50:24,407 INFO L290 TraceCheckUtils]: 14: Hoare triple {724#false} ~cond := #in~cond; {724#false} is VALID [2022-04-28 03:50:24,407 INFO L290 TraceCheckUtils]: 15: Hoare triple {724#false} assume 0 == ~cond; {724#false} is VALID [2022-04-28 03:50:24,415 INFO L290 TraceCheckUtils]: 16: Hoare triple {724#false} assume !false; {724#false} is VALID [2022-04-28 03:50:24,415 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 03:50:24,415 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 03:50:24,416 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1820170041] [2022-04-28 03:50:24,416 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1820170041] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 03:50:24,416 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1801622730] [2022-04-28 03:50:24,416 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:50:24,416 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 03:50:24,416 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 03:50:24,417 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 03:50:24,417 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-04-28 03:50:24,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:50:24,453 INFO L263 TraceCheckSpWp]: Trace formula consists of 69 conjuncts, 5 conjunts are in the unsatisfiable core [2022-04-28 03:50:24,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:50:24,460 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 03:50:24,686 INFO L272 TraceCheckUtils]: 0: Hoare triple {723#true} call ULTIMATE.init(); {723#true} is VALID [2022-04-28 03:50:24,686 INFO L290 TraceCheckUtils]: 1: Hoare triple {723#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); {723#true} is VALID [2022-04-28 03:50:24,686 INFO L290 TraceCheckUtils]: 2: Hoare triple {723#true} assume true; {723#true} is VALID [2022-04-28 03:50:24,686 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {723#true} {723#true} #52#return; {723#true} is VALID [2022-04-28 03:50:24,687 INFO L272 TraceCheckUtils]: 4: Hoare triple {723#true} call #t~ret7 := main(); {723#true} is VALID [2022-04-28 03:50:24,688 INFO L290 TraceCheckUtils]: 5: Hoare triple {723#true} ~x~0 := 0;~y~0 := 50000;~z~0 := 0;~x~0 := 0; {731#(<= 50000 main_~y~0)} is VALID [2022-04-28 03:50:24,688 INFO L290 TraceCheckUtils]: 6: Hoare triple {731#(<= 50000 main_~y~0)} [64] L11-2-->L18-1_primed: Formula: (let ((.cse0 (= v_main_~x~0_41 v_main_~x~0_40)) (.cse1 (= |v_main_#t~post4_15| |v_main_#t~post4_14|))) (or (and (< v_main_~x~0_41 v_main_~x~0_40) (< v_main_~x~0_40 50001)) (and .cse0 .cse1 (<= 50000 v_main_~x~0_41)) (and .cse0 .cse1))) InVars {main_~x~0=v_main_~x~0_41, main_#t~post4=|v_main_#t~post4_15|} OutVars{main_~x~0=v_main_~x~0_40, main_#t~post4=|v_main_#t~post4_14|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {731#(<= 50000 main_~y~0)} is VALID [2022-04-28 03:50:24,688 INFO L290 TraceCheckUtils]: 7: Hoare triple {731#(<= 50000 main_~y~0)} [65] L18-1_primed-->L11-2: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {731#(<= 50000 main_~y~0)} is VALID [2022-04-28 03:50:24,689 INFO L290 TraceCheckUtils]: 8: Hoare triple {731#(<= 50000 main_~y~0)} [66] L11-2-->L18-1_primed: Formula: (let ((.cse0 (<= 50000 v_main_~x~0_43)) (.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_#t~post6_11| |v_main_#t~post6_10|)) (.cse4 (= v_main_~x~0_43 v_main_~x~0_42))) (or (and (< v_main_~x~0_42 1000001) (= (+ v_main_~x~0_43 v_main_~y~0_20) (+ v_main_~x~0_42 v_main_~y~0_21)) (< v_main_~x~0_43 v_main_~x~0_42) .cse0) (and .cse1 .cse2 (or (not .cse0) (not (< v_main_~x~0_43 1000000))) .cse3 .cse4) (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_43, 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_42, main_#t~post6=|v_main_#t~post6_10|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {731#(<= 50000 main_~y~0)} is VALID [2022-04-28 03:50:24,690 INFO L290 TraceCheckUtils]: 9: Hoare triple {731#(<= 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[] {731#(<= 50000 main_~y~0)} is VALID [2022-04-28 03:50:24,690 INFO L290 TraceCheckUtils]: 10: Hoare triple {731#(<= 50000 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {732#(<= 49998 main_~y~0)} is VALID [2022-04-28 03:50:24,691 INFO L290 TraceCheckUtils]: 11: Hoare triple {732#(<= 49998 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {733#(<= 49996 main_~y~0)} is VALID [2022-04-28 03:50:24,691 INFO L290 TraceCheckUtils]: 12: Hoare triple {733#(<= 49996 main_~y~0)} assume !(~y~0 > 0); {724#false} is VALID [2022-04-28 03:50:24,691 INFO L272 TraceCheckUtils]: 13: Hoare triple {724#false} call __VERIFIER_assert((if ~z~0 == ~x~0 then 1 else 0)); {724#false} is VALID [2022-04-28 03:50:24,691 INFO L290 TraceCheckUtils]: 14: Hoare triple {724#false} ~cond := #in~cond; {724#false} is VALID [2022-04-28 03:50:24,691 INFO L290 TraceCheckUtils]: 15: Hoare triple {724#false} assume 0 == ~cond; {724#false} is VALID [2022-04-28 03:50:24,692 INFO L290 TraceCheckUtils]: 16: Hoare triple {724#false} assume !false; {724#false} is VALID [2022-04-28 03:50:24,692 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-04-28 03:50:24,692 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 03:50:24,943 INFO L290 TraceCheckUtils]: 16: Hoare triple {724#false} assume !false; {724#false} is VALID [2022-04-28 03:50:24,943 INFO L290 TraceCheckUtils]: 15: Hoare triple {724#false} assume 0 == ~cond; {724#false} is VALID [2022-04-28 03:50:24,943 INFO L290 TraceCheckUtils]: 14: Hoare triple {724#false} ~cond := #in~cond; {724#false} is VALID [2022-04-28 03:50:24,944 INFO L272 TraceCheckUtils]: 13: Hoare triple {724#false} call __VERIFIER_assert((if ~z~0 == ~x~0 then 1 else 0)); {724#false} is VALID [2022-04-28 03:50:24,944 INFO L290 TraceCheckUtils]: 12: Hoare triple {798#(< 0 main_~y~0)} assume !(~y~0 > 0); {724#false} is VALID [2022-04-28 03:50:24,945 INFO L290 TraceCheckUtils]: 11: Hoare triple {802#(< 2 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {798#(< 0 main_~y~0)} is VALID [2022-04-28 03:50:24,945 INFO L290 TraceCheckUtils]: 10: Hoare triple {806#(< 4 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {802#(< 2 main_~y~0)} is VALID [2022-04-28 03:50:24,946 INFO L290 TraceCheckUtils]: 9: Hoare triple {806#(< 4 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[] {806#(< 4 main_~y~0)} is VALID [2022-04-28 03:50:24,947 INFO L290 TraceCheckUtils]: 8: Hoare triple {806#(< 4 main_~y~0)} [66] L11-2-->L18-1_primed: Formula: (let ((.cse0 (<= 50000 v_main_~x~0_43)) (.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_#t~post6_11| |v_main_#t~post6_10|)) (.cse4 (= v_main_~x~0_43 v_main_~x~0_42))) (or (and (< v_main_~x~0_42 1000001) (= (+ v_main_~x~0_43 v_main_~y~0_20) (+ v_main_~x~0_42 v_main_~y~0_21)) (< v_main_~x~0_43 v_main_~x~0_42) .cse0) (and .cse1 .cse2 (or (not .cse0) (not (< v_main_~x~0_43 1000000))) .cse3 .cse4) (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_43, 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_42, main_#t~post6=|v_main_#t~post6_10|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {806#(< 4 main_~y~0)} is VALID [2022-04-28 03:50:24,948 INFO L290 TraceCheckUtils]: 7: Hoare triple {806#(< 4 main_~y~0)} [65] L18-1_primed-->L11-2: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {806#(< 4 main_~y~0)} is VALID [2022-04-28 03:50:24,948 INFO L290 TraceCheckUtils]: 6: Hoare triple {806#(< 4 main_~y~0)} [64] L11-2-->L18-1_primed: Formula: (let ((.cse0 (= v_main_~x~0_41 v_main_~x~0_40)) (.cse1 (= |v_main_#t~post4_15| |v_main_#t~post4_14|))) (or (and (< v_main_~x~0_41 v_main_~x~0_40) (< v_main_~x~0_40 50001)) (and .cse0 .cse1 (<= 50000 v_main_~x~0_41)) (and .cse0 .cse1))) InVars {main_~x~0=v_main_~x~0_41, main_#t~post4=|v_main_#t~post4_15|} OutVars{main_~x~0=v_main_~x~0_40, main_#t~post4=|v_main_#t~post4_14|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {806#(< 4 main_~y~0)} is VALID [2022-04-28 03:50:24,949 INFO L290 TraceCheckUtils]: 5: Hoare triple {723#true} ~x~0 := 0;~y~0 := 50000;~z~0 := 0;~x~0 := 0; {806#(< 4 main_~y~0)} is VALID [2022-04-28 03:50:24,949 INFO L272 TraceCheckUtils]: 4: Hoare triple {723#true} call #t~ret7 := main(); {723#true} is VALID [2022-04-28 03:50:24,949 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {723#true} {723#true} #52#return; {723#true} is VALID [2022-04-28 03:50:24,949 INFO L290 TraceCheckUtils]: 2: Hoare triple {723#true} assume true; {723#true} is VALID [2022-04-28 03:50:24,949 INFO L290 TraceCheckUtils]: 1: Hoare triple {723#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); {723#true} is VALID [2022-04-28 03:50:24,949 INFO L272 TraceCheckUtils]: 0: Hoare triple {723#true} call ULTIMATE.init(); {723#true} is VALID [2022-04-28 03:50:24,950 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-04-28 03:50:24,950 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1801622730] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 03:50:24,950 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 03:50:24,950 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 5, 5] total 12 [2022-04-28 03:50:25,173 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 03:50:25,174 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1598407761] [2022-04-28 03:50:25,174 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1598407761] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 03:50:25,174 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 03:50:25,174 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2022-04-28 03:50:25,174 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [316360564] [2022-04-28 03:50:25,174 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 03:50:25,174 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 1.6666666666666667) internal successors, (20), 11 states have internal predecessors, (20), 2 states have call successors, (3), 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 24 [2022-04-28 03:50:25,175 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 03:50:25,175 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 12 states, 12 states have (on average 1.6666666666666667) internal successors, (20), 11 states have internal predecessors, (20), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:50:25,193 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 24 edges. 24 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 03:50:25,193 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-04-28 03:50:25,193 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 03:50:25,194 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-04-28 03:50:25,194 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=114, Invalid=192, Unknown=0, NotChecked=0, Total=306 [2022-04-28 03:50:25,194 INFO L87 Difference]: Start difference. First operand 25 states and 28 transitions. Second operand has 12 states, 12 states have (on average 1.6666666666666667) internal successors, (20), 11 states have internal predecessors, (20), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:50:25,555 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:50:25,555 INFO L93 Difference]: Finished difference Result 53 states and 64 transitions. [2022-04-28 03:50:25,555 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-04-28 03:50:25,555 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 1.6666666666666667) internal successors, (20), 11 states have internal predecessors, (20), 2 states have call successors, (3), 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 24 [2022-04-28 03:50:25,555 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 03:50:25,555 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12 states, 12 states have (on average 1.6666666666666667) internal successors, (20), 11 states have internal predecessors, (20), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:50:25,556 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 46 transitions. [2022-04-28 03:50:25,557 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12 states, 12 states have (on average 1.6666666666666667) internal successors, (20), 11 states have internal predecessors, (20), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:50:25,557 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 46 transitions. [2022-04-28 03:50:25,557 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 12 states and 46 transitions. [2022-04-28 03:50:25,595 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 46 edges. 46 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 03:50:25,596 INFO L225 Difference]: With dead ends: 53 [2022-04-28 03:50:25,597 INFO L226 Difference]: Without dead ends: 36 [2022-04-28 03:50:25,597 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 41 SyntacticMatches, 1 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 185 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=234, Invalid=468, Unknown=0, NotChecked=0, Total=702 [2022-04-28 03:50:25,597 INFO L413 NwaCegarLoop]: 12 mSDtfsCounter, 30 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 108 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 34 SdHoareTripleChecker+Invalid, 138 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 108 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-28 03:50:25,598 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [30 Valid, 34 Invalid, 138 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 108 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-28 03:50:25,598 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2022-04-28 03:50:25,640 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 36. [2022-04-28 03:50:25,640 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 03:50:25,640 INFO L82 GeneralOperation]: Start isEquivalent. First operand 36 states. Second operand has 36 states, 31 states have (on average 1.1612903225806452) internal successors, (36), 31 states have internal predecessors, (36), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:50:25,640 INFO L74 IsIncluded]: Start isIncluded. First operand 36 states. Second operand has 36 states, 31 states have (on average 1.1612903225806452) internal successors, (36), 31 states have internal predecessors, (36), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:50:25,640 INFO L87 Difference]: Start difference. First operand 36 states. Second operand has 36 states, 31 states have (on average 1.1612903225806452) internal successors, (36), 31 states have internal predecessors, (36), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:50:25,641 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:50:25,641 INFO L93 Difference]: Finished difference Result 36 states and 40 transitions. [2022-04-28 03:50:25,641 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 40 transitions. [2022-04-28 03:50:25,642 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:50:25,642 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:50:25,642 INFO L74 IsIncluded]: Start isIncluded. First operand has 36 states, 31 states have (on average 1.1612903225806452) internal successors, (36), 31 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 36 states. [2022-04-28 03:50:25,642 INFO L87 Difference]: Start difference. First operand has 36 states, 31 states have (on average 1.1612903225806452) internal successors, (36), 31 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 36 states. [2022-04-28 03:50:25,643 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:50:25,643 INFO L93 Difference]: Finished difference Result 36 states and 40 transitions. [2022-04-28 03:50:25,643 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 40 transitions. [2022-04-28 03:50:25,643 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:50:25,643 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:50:25,643 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 03:50:25,643 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 03:50:25,643 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 36 states, 31 states have (on average 1.1612903225806452) internal successors, (36), 31 states have internal predecessors, (36), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:50:25,644 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 40 transitions. [2022-04-28 03:50:25,644 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 40 transitions. Word has length 24 [2022-04-28 03:50:25,644 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 03:50:25,644 INFO L495 AbstractCegarLoop]: Abstraction has 36 states and 40 transitions. [2022-04-28 03:50:25,644 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 1.6666666666666667) internal successors, (20), 11 states have internal predecessors, (20), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:50:25,645 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 36 states and 40 transitions. [2022-04-28 03:50:25,680 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 40 edges. 40 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 03:50:25,680 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 40 transitions. [2022-04-28 03:50:25,680 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2022-04-28 03:50:25,680 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 03:50:25,681 INFO L195 NwaCegarLoop]: trace histogram [6, 5, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 03:50:25,697 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-04-28 03:50:25,881 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 03:50:25,881 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 03:50:25,882 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 03:50:25,882 INFO L85 PathProgramCache]: Analyzing trace with hash 969620496, now seen corresponding path program 3 times [2022-04-28 03:50:25,882 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 03:50:25,882 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [998459084] [2022-04-28 03:50:25,990 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 1 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 03:50:30,124 WARN L977 rdanLoopAcceleration]: Unable to prove correctness of quantifier elimination. [2022-04-28 03:50:30,254 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={1=1, 2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 03:50:30,255 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-28 03:50:30,257 INFO L85 PathProgramCache]: Analyzing trace with hash -59103134, now seen corresponding path program 1 times [2022-04-28 03:50:30,257 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 03:50:30,258 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1502908998] [2022-04-28 03:50:30,258 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:50:30,258 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 03:50:30,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:50:30,319 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 03:50:30,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:50:30,324 INFO L290 TraceCheckUtils]: 0: Hoare triple {1122#(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); {1113#true} is VALID [2022-04-28 03:50:30,324 INFO L290 TraceCheckUtils]: 1: Hoare triple {1113#true} assume true; {1113#true} is VALID [2022-04-28 03:50:30,324 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {1113#true} {1113#true} #52#return; {1113#true} is VALID [2022-04-28 03:50:30,324 INFO L272 TraceCheckUtils]: 0: Hoare triple {1113#true} call ULTIMATE.init(); {1122#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 03:50:30,324 INFO L290 TraceCheckUtils]: 1: Hoare triple {1122#(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); {1113#true} is VALID [2022-04-28 03:50:30,325 INFO L290 TraceCheckUtils]: 2: Hoare triple {1113#true} assume true; {1113#true} is VALID [2022-04-28 03:50:30,325 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1113#true} {1113#true} #52#return; {1113#true} is VALID [2022-04-28 03:50:30,325 INFO L272 TraceCheckUtils]: 4: Hoare triple {1113#true} call #t~ret7 := main(); {1113#true} is VALID [2022-04-28 03:50:30,325 INFO L290 TraceCheckUtils]: 5: Hoare triple {1113#true} ~x~0 := 0;~y~0 := 50000;~z~0 := 0;~x~0 := 0; {1118#(<= 50000 main_~y~0)} is VALID [2022-04-28 03:50:30,325 INFO L290 TraceCheckUtils]: 6: Hoare triple {1118#(<= 50000 main_~y~0)} [68] L11-2-->L18-1_primed: Formula: (let ((.cse0 (= v_main_~x~0_64 v_main_~x~0_63)) (.cse1 (= |v_main_#t~post4_21| |v_main_#t~post4_20|))) (or (and (< v_main_~x~0_64 v_main_~x~0_63) (< v_main_~x~0_63 50001)) (and .cse0 .cse1) (and (not (< v_main_~x~0_64 50000)) .cse0 .cse1))) InVars {main_~x~0=v_main_~x~0_64, main_#t~post4=|v_main_#t~post4_21|} OutVars{main_~x~0=v_main_~x~0_63, main_#t~post4=|v_main_#t~post4_20|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {1118#(<= 50000 main_~y~0)} is VALID [2022-04-28 03:50:30,326 INFO L290 TraceCheckUtils]: 7: Hoare triple {1118#(<= 50000 main_~y~0)} [69] L18-1_primed-->L11-2: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1118#(<= 50000 main_~y~0)} is VALID [2022-04-28 03:50:30,327 INFO L290 TraceCheckUtils]: 8: Hoare triple {1118#(<= 50000 main_~y~0)} [70] L11-2-->L18-1_primed: Formula: (let ((.cse2 (= |v_main_#t~post5_18| |v_main_#t~post5_17|)) (.cse3 (= v_main_~y~0_38 v_main_~y~0_37)) (.cse4 (= v_main_~x~0_66 v_main_~x~0_65)) (.cse1 (<= 50000 v_main_~x~0_66)) (.cse5 (= |v_main_#t~post6_18| |v_main_#t~post6_17|))) (or (let ((.cse0 (+ v_main_~x~0_66 v_main_~y~0_37))) (and (= .cse0 (+ v_main_~x~0_65 v_main_~y~0_38)) (< .cse0 (+ v_main_~y~0_38 1000001)) .cse1 (< v_main_~y~0_38 v_main_~y~0_37))) (and .cse2 .cse3 .cse4 .cse5) (and .cse2 .cse3 .cse4 (or (not (< v_main_~x~0_66 1000000)) (not .cse1)) .cse5))) InVars {main_~y~0=v_main_~y~0_38, main_#t~post5=|v_main_#t~post5_18|, main_~x~0=v_main_~x~0_66, main_#t~post6=|v_main_#t~post6_18|} OutVars{main_~y~0=v_main_~y~0_37, main_#t~post5=|v_main_#t~post5_17|, main_~x~0=v_main_~x~0_65, main_#t~post6=|v_main_#t~post6_17|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {1118#(<= 50000 main_~y~0)} is VALID [2022-04-28 03:50:30,327 INFO L290 TraceCheckUtils]: 9: Hoare triple {1118#(<= 50000 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[] {1118#(<= 50000 main_~y~0)} is VALID [2022-04-28 03:50:30,328 INFO L290 TraceCheckUtils]: 10: Hoare triple {1118#(<= 50000 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {1119#(<= 49998 main_~y~0)} is VALID [2022-04-28 03:50:30,328 INFO L290 TraceCheckUtils]: 11: Hoare triple {1119#(<= 49998 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {1120#(<= 49996 main_~y~0)} is VALID [2022-04-28 03:50:30,328 INFO L290 TraceCheckUtils]: 12: Hoare triple {1120#(<= 49996 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {1121#(<= 49994 main_~y~0)} is VALID [2022-04-28 03:50:30,329 INFO L290 TraceCheckUtils]: 13: Hoare triple {1121#(<= 49994 main_~y~0)} assume !(~y~0 > 0); {1114#false} is VALID [2022-04-28 03:50:30,329 INFO L272 TraceCheckUtils]: 14: Hoare triple {1114#false} call __VERIFIER_assert((if ~z~0 == ~x~0 then 1 else 0)); {1114#false} is VALID [2022-04-28 03:50:30,329 INFO L290 TraceCheckUtils]: 15: Hoare triple {1114#false} ~cond := #in~cond; {1114#false} is VALID [2022-04-28 03:50:30,329 INFO L290 TraceCheckUtils]: 16: Hoare triple {1114#false} assume 0 == ~cond; {1114#false} is VALID [2022-04-28 03:50:30,329 INFO L290 TraceCheckUtils]: 17: Hoare triple {1114#false} assume !false; {1114#false} is VALID [2022-04-28 03:50:30,329 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-04-28 03:50:30,329 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 03:50:30,329 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1502908998] [2022-04-28 03:50:30,329 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1502908998] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 03:50:30,330 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [631100847] [2022-04-28 03:50:30,330 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:50:30,330 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 03:50:30,330 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 03:50:30,331 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 03:50:30,335 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-04-28 03:50:30,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:50:30,364 INFO L263 TraceCheckSpWp]: Trace formula consists of 74 conjuncts, 6 conjunts are in the unsatisfiable core [2022-04-28 03:50:30,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:50:30,370 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 03:50:30,605 INFO L272 TraceCheckUtils]: 0: Hoare triple {1113#true} call ULTIMATE.init(); {1113#true} is VALID [2022-04-28 03:50:30,605 INFO L290 TraceCheckUtils]: 1: Hoare triple {1113#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); {1113#true} is VALID [2022-04-28 03:50:30,605 INFO L290 TraceCheckUtils]: 2: Hoare triple {1113#true} assume true; {1113#true} is VALID [2022-04-28 03:50:30,605 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1113#true} {1113#true} #52#return; {1113#true} is VALID [2022-04-28 03:50:30,605 INFO L272 TraceCheckUtils]: 4: Hoare triple {1113#true} call #t~ret7 := main(); {1113#true} is VALID [2022-04-28 03:50:30,616 INFO L290 TraceCheckUtils]: 5: Hoare triple {1113#true} ~x~0 := 0;~y~0 := 50000;~z~0 := 0;~x~0 := 0; {1118#(<= 50000 main_~y~0)} is VALID [2022-04-28 03:50:30,617 INFO L290 TraceCheckUtils]: 6: Hoare triple {1118#(<= 50000 main_~y~0)} [68] L11-2-->L18-1_primed: Formula: (let ((.cse0 (= v_main_~x~0_64 v_main_~x~0_63)) (.cse1 (= |v_main_#t~post4_21| |v_main_#t~post4_20|))) (or (and (< v_main_~x~0_64 v_main_~x~0_63) (< v_main_~x~0_63 50001)) (and .cse0 .cse1) (and (not (< v_main_~x~0_64 50000)) .cse0 .cse1))) InVars {main_~x~0=v_main_~x~0_64, main_#t~post4=|v_main_#t~post4_21|} OutVars{main_~x~0=v_main_~x~0_63, main_#t~post4=|v_main_#t~post4_20|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {1118#(<= 50000 main_~y~0)} is VALID [2022-04-28 03:50:30,617 INFO L290 TraceCheckUtils]: 7: Hoare triple {1118#(<= 50000 main_~y~0)} [69] L18-1_primed-->L11-2: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1118#(<= 50000 main_~y~0)} is VALID [2022-04-28 03:50:30,618 INFO L290 TraceCheckUtils]: 8: Hoare triple {1118#(<= 50000 main_~y~0)} [70] L11-2-->L18-1_primed: Formula: (let ((.cse2 (= |v_main_#t~post5_18| |v_main_#t~post5_17|)) (.cse3 (= v_main_~y~0_38 v_main_~y~0_37)) (.cse4 (= v_main_~x~0_66 v_main_~x~0_65)) (.cse1 (<= 50000 v_main_~x~0_66)) (.cse5 (= |v_main_#t~post6_18| |v_main_#t~post6_17|))) (or (let ((.cse0 (+ v_main_~x~0_66 v_main_~y~0_37))) (and (= .cse0 (+ v_main_~x~0_65 v_main_~y~0_38)) (< .cse0 (+ v_main_~y~0_38 1000001)) .cse1 (< v_main_~y~0_38 v_main_~y~0_37))) (and .cse2 .cse3 .cse4 .cse5) (and .cse2 .cse3 .cse4 (or (not (< v_main_~x~0_66 1000000)) (not .cse1)) .cse5))) InVars {main_~y~0=v_main_~y~0_38, main_#t~post5=|v_main_#t~post5_18|, main_~x~0=v_main_~x~0_66, main_#t~post6=|v_main_#t~post6_18|} OutVars{main_~y~0=v_main_~y~0_37, main_#t~post5=|v_main_#t~post5_17|, main_~x~0=v_main_~x~0_65, main_#t~post6=|v_main_#t~post6_17|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {1118#(<= 50000 main_~y~0)} is VALID [2022-04-28 03:50:30,618 INFO L290 TraceCheckUtils]: 9: Hoare triple {1118#(<= 50000 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[] {1118#(<= 50000 main_~y~0)} is VALID [2022-04-28 03:50:30,619 INFO L290 TraceCheckUtils]: 10: Hoare triple {1118#(<= 50000 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {1119#(<= 49998 main_~y~0)} is VALID [2022-04-28 03:50:30,619 INFO L290 TraceCheckUtils]: 11: Hoare triple {1119#(<= 49998 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {1120#(<= 49996 main_~y~0)} is VALID [2022-04-28 03:50:30,620 INFO L290 TraceCheckUtils]: 12: Hoare triple {1120#(<= 49996 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {1121#(<= 49994 main_~y~0)} is VALID [2022-04-28 03:50:30,620 INFO L290 TraceCheckUtils]: 13: Hoare triple {1121#(<= 49994 main_~y~0)} assume !(~y~0 > 0); {1114#false} is VALID [2022-04-28 03:50:30,620 INFO L272 TraceCheckUtils]: 14: Hoare triple {1114#false} call __VERIFIER_assert((if ~z~0 == ~x~0 then 1 else 0)); {1114#false} is VALID [2022-04-28 03:50:30,621 INFO L290 TraceCheckUtils]: 15: Hoare triple {1114#false} ~cond := #in~cond; {1114#false} is VALID [2022-04-28 03:50:30,621 INFO L290 TraceCheckUtils]: 16: Hoare triple {1114#false} assume 0 == ~cond; {1114#false} is VALID [2022-04-28 03:50:30,621 INFO L290 TraceCheckUtils]: 17: Hoare triple {1114#false} assume !false; {1114#false} is VALID [2022-04-28 03:50:30,621 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-04-28 03:50:30,621 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 03:50:30,862 INFO L290 TraceCheckUtils]: 17: Hoare triple {1114#false} assume !false; {1114#false} is VALID [2022-04-28 03:50:30,862 INFO L290 TraceCheckUtils]: 16: Hoare triple {1114#false} assume 0 == ~cond; {1114#false} is VALID [2022-04-28 03:50:30,862 INFO L290 TraceCheckUtils]: 15: Hoare triple {1114#false} ~cond := #in~cond; {1114#false} is VALID [2022-04-28 03:50:30,862 INFO L272 TraceCheckUtils]: 14: Hoare triple {1114#false} call __VERIFIER_assert((if ~z~0 == ~x~0 then 1 else 0)); {1114#false} is VALID [2022-04-28 03:50:30,862 INFO L290 TraceCheckUtils]: 13: Hoare triple {1189#(< 0 main_~y~0)} assume !(~y~0 > 0); {1114#false} is VALID [2022-04-28 03:50:30,863 INFO L290 TraceCheckUtils]: 12: Hoare triple {1193#(< 2 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {1189#(< 0 main_~y~0)} is VALID [2022-04-28 03:50:30,863 INFO L290 TraceCheckUtils]: 11: Hoare triple {1197#(< 4 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {1193#(< 2 main_~y~0)} is VALID [2022-04-28 03:50:30,864 INFO L290 TraceCheckUtils]: 10: Hoare triple {1201#(< 6 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {1197#(< 4 main_~y~0)} is VALID [2022-04-28 03:50:30,864 INFO L290 TraceCheckUtils]: 9: Hoare triple {1201#(< 6 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[] {1201#(< 6 main_~y~0)} is VALID [2022-04-28 03:50:30,865 INFO L290 TraceCheckUtils]: 8: Hoare triple {1201#(< 6 main_~y~0)} [70] L11-2-->L18-1_primed: Formula: (let ((.cse2 (= |v_main_#t~post5_18| |v_main_#t~post5_17|)) (.cse3 (= v_main_~y~0_38 v_main_~y~0_37)) (.cse4 (= v_main_~x~0_66 v_main_~x~0_65)) (.cse1 (<= 50000 v_main_~x~0_66)) (.cse5 (= |v_main_#t~post6_18| |v_main_#t~post6_17|))) (or (let ((.cse0 (+ v_main_~x~0_66 v_main_~y~0_37))) (and (= .cse0 (+ v_main_~x~0_65 v_main_~y~0_38)) (< .cse0 (+ v_main_~y~0_38 1000001)) .cse1 (< v_main_~y~0_38 v_main_~y~0_37))) (and .cse2 .cse3 .cse4 .cse5) (and .cse2 .cse3 .cse4 (or (not (< v_main_~x~0_66 1000000)) (not .cse1)) .cse5))) InVars {main_~y~0=v_main_~y~0_38, main_#t~post5=|v_main_#t~post5_18|, main_~x~0=v_main_~x~0_66, main_#t~post6=|v_main_#t~post6_18|} OutVars{main_~y~0=v_main_~y~0_37, main_#t~post5=|v_main_#t~post5_17|, main_~x~0=v_main_~x~0_65, main_#t~post6=|v_main_#t~post6_17|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {1201#(< 6 main_~y~0)} is VALID [2022-04-28 03:50:30,865 INFO L290 TraceCheckUtils]: 7: Hoare triple {1201#(< 6 main_~y~0)} [69] L18-1_primed-->L11-2: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1201#(< 6 main_~y~0)} is VALID [2022-04-28 03:50:30,868 INFO L290 TraceCheckUtils]: 6: Hoare triple {1201#(< 6 main_~y~0)} [68] L11-2-->L18-1_primed: Formula: (let ((.cse0 (= v_main_~x~0_64 v_main_~x~0_63)) (.cse1 (= |v_main_#t~post4_21| |v_main_#t~post4_20|))) (or (and (< v_main_~x~0_64 v_main_~x~0_63) (< v_main_~x~0_63 50001)) (and .cse0 .cse1) (and (not (< v_main_~x~0_64 50000)) .cse0 .cse1))) InVars {main_~x~0=v_main_~x~0_64, main_#t~post4=|v_main_#t~post4_21|} OutVars{main_~x~0=v_main_~x~0_63, main_#t~post4=|v_main_#t~post4_20|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {1201#(< 6 main_~y~0)} is VALID [2022-04-28 03:50:30,869 INFO L290 TraceCheckUtils]: 5: Hoare triple {1113#true} ~x~0 := 0;~y~0 := 50000;~z~0 := 0;~x~0 := 0; {1201#(< 6 main_~y~0)} is VALID [2022-04-28 03:50:30,869 INFO L272 TraceCheckUtils]: 4: Hoare triple {1113#true} call #t~ret7 := main(); {1113#true} is VALID [2022-04-28 03:50:30,869 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1113#true} {1113#true} #52#return; {1113#true} is VALID [2022-04-28 03:50:30,869 INFO L290 TraceCheckUtils]: 2: Hoare triple {1113#true} assume true; {1113#true} is VALID [2022-04-28 03:50:30,869 INFO L290 TraceCheckUtils]: 1: Hoare triple {1113#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); {1113#true} is VALID [2022-04-28 03:50:30,869 INFO L272 TraceCheckUtils]: 0: Hoare triple {1113#true} call ULTIMATE.init(); {1113#true} is VALID [2022-04-28 03:50:30,869 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-04-28 03:50:30,869 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [631100847] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 03:50:30,870 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 03:50:30,870 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6, 6] total 11 [2022-04-28 03:50:31,044 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 03:50:31,044 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [998459084] [2022-04-28 03:50:31,044 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [998459084] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 03:50:31,044 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 03:50:31,044 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2022-04-28 03:50:31,044 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1009890793] [2022-04-28 03:50:31,044 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 03:50:31,045 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 1.6428571428571428) internal successors, (23), 13 states have internal predecessors, (23), 2 states have call successors, (3), 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 27 [2022-04-28 03:50:31,045 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 03:50:31,045 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 14 states, 14 states have (on average 1.6428571428571428) internal successors, (23), 13 states have internal predecessors, (23), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:50:31,067 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 27 edges. 27 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 03:50:31,068 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-04-28 03:50:31,068 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 03:50:31,068 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-04-28 03:50:31,068 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=123, Invalid=183, Unknown=0, NotChecked=0, Total=306 [2022-04-28 03:50:31,068 INFO L87 Difference]: Start difference. First operand 36 states and 40 transitions. Second operand has 14 states, 14 states have (on average 1.6428571428571428) internal successors, (23), 13 states have internal predecessors, (23), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:50:31,472 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:50:31,472 INFO L93 Difference]: Finished difference Result 61 states and 75 transitions. [2022-04-28 03:50:31,472 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-04-28 03:50:31,472 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 1.6428571428571428) internal successors, (23), 13 states have internal predecessors, (23), 2 states have call successors, (3), 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 27 [2022-04-28 03:50:31,472 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 03:50:31,472 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 14 states have (on average 1.6428571428571428) internal successors, (23), 13 states have internal predecessors, (23), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:50:31,473 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 51 transitions. [2022-04-28 03:50:31,473 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 14 states have (on average 1.6428571428571428) internal successors, (23), 13 states have internal predecessors, (23), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:50:31,474 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 51 transitions. [2022-04-28 03:50:31,474 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 14 states and 51 transitions. [2022-04-28 03:50:31,512 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 51 edges. 51 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 03:50:31,513 INFO L225 Difference]: With dead ends: 61 [2022-04-28 03:50:31,513 INFO L226 Difference]: Without dead ends: 43 [2022-04-28 03:50:31,514 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 44 SyntacticMatches, 1 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 197 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=291, Invalid=521, Unknown=0, NotChecked=0, Total=812 [2022-04-28 03:50:31,514 INFO L413 NwaCegarLoop]: 12 mSDtfsCounter, 33 mSDsluCounter, 27 mSDsCounter, 0 mSdLazyCounter, 128 mSolverCounterSat, 40 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 33 SdHoareTripleChecker+Valid, 39 SdHoareTripleChecker+Invalid, 168 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 40 IncrementalHoareTripleChecker+Valid, 128 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-28 03:50:31,514 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [33 Valid, 39 Invalid, 168 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [40 Valid, 128 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-28 03:50:31,515 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2022-04-28 03:50:31,555 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 33. [2022-04-28 03:50:31,555 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 03:50:31,555 INFO L82 GeneralOperation]: Start isEquivalent. First operand 43 states. Second operand has 33 states, 28 states have (on average 1.1428571428571428) internal successors, (32), 28 states have internal predecessors, (32), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:50:31,556 INFO L74 IsIncluded]: Start isIncluded. First operand 43 states. Second operand has 33 states, 28 states have (on average 1.1428571428571428) internal successors, (32), 28 states have internal predecessors, (32), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:50:31,556 INFO L87 Difference]: Start difference. First operand 43 states. Second operand has 33 states, 28 states have (on average 1.1428571428571428) internal successors, (32), 28 states have internal predecessors, (32), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:50:31,558 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:50:31,558 INFO L93 Difference]: Finished difference Result 43 states and 47 transitions. [2022-04-28 03:50:31,558 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 47 transitions. [2022-04-28 03:50:31,559 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:50:31,559 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:50:31,559 INFO L74 IsIncluded]: Start isIncluded. First operand has 33 states, 28 states have (on average 1.1428571428571428) internal successors, (32), 28 states have internal predecessors, (32), 3 states have call successors, (3), 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 43 states. [2022-04-28 03:50:31,559 INFO L87 Difference]: Start difference. First operand has 33 states, 28 states have (on average 1.1428571428571428) internal successors, (32), 28 states have internal predecessors, (32), 3 states have call successors, (3), 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 43 states. [2022-04-28 03:50:31,560 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:50:31,560 INFO L93 Difference]: Finished difference Result 43 states and 47 transitions. [2022-04-28 03:50:31,560 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 47 transitions. [2022-04-28 03:50:31,560 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:50:31,560 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:50:31,560 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 03:50:31,560 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 03:50:31,560 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33 states, 28 states have (on average 1.1428571428571428) internal successors, (32), 28 states have internal predecessors, (32), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:50:31,561 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 36 transitions. [2022-04-28 03:50:31,561 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 36 transitions. Word has length 27 [2022-04-28 03:50:31,561 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 03:50:31,561 INFO L495 AbstractCegarLoop]: Abstraction has 33 states and 36 transitions. [2022-04-28 03:50:31,561 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 1.6428571428571428) internal successors, (23), 13 states have internal predecessors, (23), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:50:31,562 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 33 states and 36 transitions. [2022-04-28 03:50:31,598 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 36 edges. 36 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 03:50:31,598 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 36 transitions. [2022-04-28 03:50:31,598 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2022-04-28 03:50:31,598 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 03:50:31,598 INFO L195 NwaCegarLoop]: trace histogram [8, 7, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 03:50:31,617 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-04-28 03:50:31,799 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 03:50:31,799 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 03:50:31,799 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 03:50:31,800 INFO L85 PathProgramCache]: Analyzing trace with hash -777622499, now seen corresponding path program 4 times [2022-04-28 03:50:31,800 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 03:50:31,800 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1389768846] [2022-04-28 03:50:35,867 WARN L977 rdanLoopAcceleration]: Unable to prove correctness of quantifier elimination. [2022-04-28 03:50:35,919 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 1 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 03:50:36,153 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={1=1, 2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 03:50:36,154 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-28 03:50:36,156 INFO L85 PathProgramCache]: Analyzing trace with hash -1837865407, now seen corresponding path program 1 times [2022-04-28 03:50:36,156 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 03:50:36,157 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1170678864] [2022-04-28 03:50:36,157 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:50:36,157 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 03:50:36,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:50:36,216 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 03:50:36,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:50:36,224 INFO L290 TraceCheckUtils]: 0: Hoare triple {1547#(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); {1537#true} is VALID [2022-04-28 03:50:36,224 INFO L290 TraceCheckUtils]: 1: Hoare triple {1537#true} assume true; {1537#true} is VALID [2022-04-28 03:50:36,225 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {1537#true} {1537#true} #52#return; {1537#true} is VALID [2022-04-28 03:50:36,225 INFO L272 TraceCheckUtils]: 0: Hoare triple {1537#true} call ULTIMATE.init(); {1547#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 03:50:36,225 INFO L290 TraceCheckUtils]: 1: Hoare triple {1547#(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); {1537#true} is VALID [2022-04-28 03:50:36,225 INFO L290 TraceCheckUtils]: 2: Hoare triple {1537#true} assume true; {1537#true} is VALID [2022-04-28 03:50:36,225 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1537#true} {1537#true} #52#return; {1537#true} is VALID [2022-04-28 03:50:36,225 INFO L272 TraceCheckUtils]: 4: Hoare triple {1537#true} call #t~ret7 := main(); {1537#true} is VALID [2022-04-28 03:50:36,226 INFO L290 TraceCheckUtils]: 5: Hoare triple {1537#true} ~x~0 := 0;~y~0 := 50000;~z~0 := 0;~x~0 := 0; {1542#(<= 50000 main_~y~0)} is VALID [2022-04-28 03:50:36,226 INFO L290 TraceCheckUtils]: 6: Hoare triple {1542#(<= 50000 main_~y~0)} [72] L11-2-->L18-1_primed: Formula: (let ((.cse0 (= v_main_~x~0_89 v_main_~x~0_88))) (or (and (= |v_main_#t~post4_27| |v_main_#t~post4_26|) .cse0) (and (= |v_main_#t~post4_26| |v_main_#t~post4_27|) (not (< v_main_~x~0_89 50000)) .cse0) (and (< v_main_~x~0_89 v_main_~x~0_88) (< v_main_~x~0_88 50001)))) InVars {main_~x~0=v_main_~x~0_89, main_#t~post4=|v_main_#t~post4_27|} OutVars{main_~x~0=v_main_~x~0_88, main_#t~post4=|v_main_#t~post4_26|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {1542#(<= 50000 main_~y~0)} is VALID [2022-04-28 03:50:36,226 INFO L290 TraceCheckUtils]: 7: Hoare triple {1542#(<= 50000 main_~y~0)} [73] L18-1_primed-->L11-2: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1542#(<= 50000 main_~y~0)} is VALID [2022-04-28 03:50:36,227 INFO L290 TraceCheckUtils]: 8: Hoare triple {1542#(<= 50000 main_~y~0)} [74] L11-2-->L18-1_primed: Formula: (let ((.cse0 (<= 50000 v_main_~x~0_91)) (.cse1 (= |v_main_#t~post5_25| |v_main_#t~post5_24|)) (.cse2 (= v_main_~x~0_91 v_main_~x~0_90)) (.cse3 (= v_main_~y~0_58 v_main_~y~0_57)) (.cse4 (= |v_main_#t~post6_25| |v_main_#t~post6_24|))) (or (and .cse0 (< v_main_~x~0_91 v_main_~x~0_90) (= (+ v_main_~x~0_91 v_main_~y~0_57) (+ v_main_~x~0_90 v_main_~y~0_58)) (< v_main_~x~0_90 1000001)) (and .cse1 (or (not .cse0) (not (< v_main_~x~0_91 1000000))) .cse2 .cse3 .cse4) (and .cse1 .cse2 .cse3 .cse4))) InVars {main_~y~0=v_main_~y~0_58, main_#t~post5=|v_main_#t~post5_25|, main_~x~0=v_main_~x~0_91, main_#t~post6=|v_main_#t~post6_25|} OutVars{main_~y~0=v_main_~y~0_57, main_#t~post5=|v_main_#t~post5_24|, main_~x~0=v_main_~x~0_90, main_#t~post6=|v_main_#t~post6_24|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {1542#(<= 50000 main_~y~0)} is VALID [2022-04-28 03:50:36,228 INFO L290 TraceCheckUtils]: 9: Hoare triple {1542#(<= 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[] {1542#(<= 50000 main_~y~0)} is VALID [2022-04-28 03:50:36,228 INFO L290 TraceCheckUtils]: 10: Hoare triple {1542#(<= 50000 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {1543#(<= 49998 main_~y~0)} is VALID [2022-04-28 03:50:36,228 INFO L290 TraceCheckUtils]: 11: Hoare triple {1543#(<= 49998 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {1544#(<= 49996 main_~y~0)} is VALID [2022-04-28 03:50:36,229 INFO L290 TraceCheckUtils]: 12: Hoare triple {1544#(<= 49996 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {1545#(<= 49994 main_~y~0)} is VALID [2022-04-28 03:50:36,229 INFO L290 TraceCheckUtils]: 13: Hoare triple {1545#(<= 49994 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {1546#(<= 49992 main_~y~0)} is VALID [2022-04-28 03:50:36,230 INFO L290 TraceCheckUtils]: 14: Hoare triple {1546#(<= 49992 main_~y~0)} assume !(~y~0 > 0); {1538#false} is VALID [2022-04-28 03:50:36,230 INFO L272 TraceCheckUtils]: 15: Hoare triple {1538#false} call __VERIFIER_assert((if ~z~0 == ~x~0 then 1 else 0)); {1538#false} is VALID [2022-04-28 03:50:36,230 INFO L290 TraceCheckUtils]: 16: Hoare triple {1538#false} ~cond := #in~cond; {1538#false} is VALID [2022-04-28 03:50:36,230 INFO L290 TraceCheckUtils]: 17: Hoare triple {1538#false} assume 0 == ~cond; {1538#false} is VALID [2022-04-28 03:50:36,230 INFO L290 TraceCheckUtils]: 18: Hoare triple {1538#false} assume !false; {1538#false} is VALID [2022-04-28 03:50:36,230 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-04-28 03:50:36,231 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 03:50:36,232 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1170678864] [2022-04-28 03:50:36,232 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1170678864] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 03:50:36,232 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1989516980] [2022-04-28 03:50:36,232 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:50:36,232 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 03:50:36,232 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 03:50:36,233 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 03:50:36,234 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-04-28 03:50:36,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:50:36,265 INFO L263 TraceCheckSpWp]: Trace formula consists of 79 conjuncts, 10 conjunts are in the unsatisfiable core [2022-04-28 03:50:36,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:50:36,280 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 03:50:36,662 INFO L272 TraceCheckUtils]: 0: Hoare triple {1537#true} call ULTIMATE.init(); {1537#true} is VALID [2022-04-28 03:50:36,663 INFO L290 TraceCheckUtils]: 1: Hoare triple {1537#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); {1537#true} is VALID [2022-04-28 03:50:36,663 INFO L290 TraceCheckUtils]: 2: Hoare triple {1537#true} assume true; {1537#true} is VALID [2022-04-28 03:50:36,663 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1537#true} {1537#true} #52#return; {1537#true} is VALID [2022-04-28 03:50:36,663 INFO L272 TraceCheckUtils]: 4: Hoare triple {1537#true} call #t~ret7 := main(); {1537#true} is VALID [2022-04-28 03:50:36,663 INFO L290 TraceCheckUtils]: 5: Hoare triple {1537#true} ~x~0 := 0;~y~0 := 50000;~z~0 := 0;~x~0 := 0; {1566#(and (<= main_~x~0 0) (<= 50000 main_~y~0))} is VALID [2022-04-28 03:50:36,664 INFO L290 TraceCheckUtils]: 6: Hoare triple {1566#(and (<= main_~x~0 0) (<= 50000 main_~y~0))} [72] L11-2-->L18-1_primed: Formula: (let ((.cse0 (= v_main_~x~0_89 v_main_~x~0_88))) (or (and (= |v_main_#t~post4_27| |v_main_#t~post4_26|) .cse0) (and (= |v_main_#t~post4_26| |v_main_#t~post4_27|) (not (< v_main_~x~0_89 50000)) .cse0) (and (< v_main_~x~0_89 v_main_~x~0_88) (< v_main_~x~0_88 50001)))) InVars {main_~x~0=v_main_~x~0_89, main_#t~post4=|v_main_#t~post4_27|} OutVars{main_~x~0=v_main_~x~0_88, main_#t~post4=|v_main_#t~post4_26|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {1570#(and (< main_~x~0 50001) (<= 50000 main_~y~0))} is VALID [2022-04-28 03:50:36,664 INFO L290 TraceCheckUtils]: 7: Hoare triple {1570#(and (< main_~x~0 50001) (<= 50000 main_~y~0))} [73] L18-1_primed-->L11-2: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1570#(and (< main_~x~0 50001) (<= 50000 main_~y~0))} is VALID [2022-04-28 03:50:36,665 INFO L290 TraceCheckUtils]: 8: Hoare triple {1570#(and (< main_~x~0 50001) (<= 50000 main_~y~0))} [74] L11-2-->L18-1_primed: Formula: (let ((.cse0 (<= 50000 v_main_~x~0_91)) (.cse1 (= |v_main_#t~post5_25| |v_main_#t~post5_24|)) (.cse2 (= v_main_~x~0_91 v_main_~x~0_90)) (.cse3 (= v_main_~y~0_58 v_main_~y~0_57)) (.cse4 (= |v_main_#t~post6_25| |v_main_#t~post6_24|))) (or (and .cse0 (< v_main_~x~0_91 v_main_~x~0_90) (= (+ v_main_~x~0_91 v_main_~y~0_57) (+ v_main_~x~0_90 v_main_~y~0_58)) (< v_main_~x~0_90 1000001)) (and .cse1 (or (not .cse0) (not (< v_main_~x~0_91 1000000))) .cse2 .cse3 .cse4) (and .cse1 .cse2 .cse3 .cse4))) InVars {main_~y~0=v_main_~y~0_58, main_#t~post5=|v_main_#t~post5_25|, main_~x~0=v_main_~x~0_91, main_#t~post6=|v_main_#t~post6_25|} OutVars{main_~y~0=v_main_~y~0_57, main_#t~post5=|v_main_#t~post5_24|, main_~x~0=v_main_~x~0_90, main_#t~post6=|v_main_#t~post6_24|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {1577#(or (and (< main_~x~0 50001) (<= 50000 main_~y~0)) (and (< main_~x~0 (+ main_~y~0 1)) (< main_~x~0 1000001) (< 50000 main_~x~0)))} is VALID [2022-04-28 03:50:36,666 INFO L290 TraceCheckUtils]: 9: Hoare triple {1577#(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)))} [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[] {1581#(< 999999 main_~y~0)} is VALID [2022-04-28 03:50:36,670 INFO L290 TraceCheckUtils]: 10: Hoare triple {1581#(< 999999 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {1585#(< 999997 main_~y~0)} is VALID [2022-04-28 03:50:36,671 INFO L290 TraceCheckUtils]: 11: Hoare triple {1585#(< 999997 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {1589#(< 999995 main_~y~0)} is VALID [2022-04-28 03:50:36,671 INFO L290 TraceCheckUtils]: 12: Hoare triple {1589#(< 999995 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {1593#(< 999993 main_~y~0)} is VALID [2022-04-28 03:50:36,672 INFO L290 TraceCheckUtils]: 13: Hoare triple {1593#(< 999993 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {1597#(< 999991 main_~y~0)} is VALID [2022-04-28 03:50:36,672 INFO L290 TraceCheckUtils]: 14: Hoare triple {1597#(< 999991 main_~y~0)} assume !(~y~0 > 0); {1538#false} is VALID [2022-04-28 03:50:36,672 INFO L272 TraceCheckUtils]: 15: Hoare triple {1538#false} call __VERIFIER_assert((if ~z~0 == ~x~0 then 1 else 0)); {1538#false} is VALID [2022-04-28 03:50:36,672 INFO L290 TraceCheckUtils]: 16: Hoare triple {1538#false} ~cond := #in~cond; {1538#false} is VALID [2022-04-28 03:50:36,672 INFO L290 TraceCheckUtils]: 17: Hoare triple {1538#false} assume 0 == ~cond; {1538#false} is VALID [2022-04-28 03:50:36,673 INFO L290 TraceCheckUtils]: 18: Hoare triple {1538#false} assume !false; {1538#false} is VALID [2022-04-28 03:50:36,673 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 03:50:36,673 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 03:50:37,138 INFO L290 TraceCheckUtils]: 18: Hoare triple {1538#false} assume !false; {1538#false} is VALID [2022-04-28 03:50:37,138 INFO L290 TraceCheckUtils]: 17: Hoare triple {1538#false} assume 0 == ~cond; {1538#false} is VALID [2022-04-28 03:50:37,138 INFO L290 TraceCheckUtils]: 16: Hoare triple {1538#false} ~cond := #in~cond; {1538#false} is VALID [2022-04-28 03:50:37,138 INFO L272 TraceCheckUtils]: 15: Hoare triple {1538#false} call __VERIFIER_assert((if ~z~0 == ~x~0 then 1 else 0)); {1538#false} is VALID [2022-04-28 03:50:37,139 INFO L290 TraceCheckUtils]: 14: Hoare triple {1625#(< 0 main_~y~0)} assume !(~y~0 > 0); {1538#false} is VALID [2022-04-28 03:50:37,139 INFO L290 TraceCheckUtils]: 13: Hoare triple {1629#(< 2 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {1625#(< 0 main_~y~0)} is VALID [2022-04-28 03:50:37,142 INFO L290 TraceCheckUtils]: 12: Hoare triple {1633#(< 4 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {1629#(< 2 main_~y~0)} is VALID [2022-04-28 03:50:37,142 INFO L290 TraceCheckUtils]: 11: Hoare triple {1637#(< 6 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {1633#(< 4 main_~y~0)} is VALID [2022-04-28 03:50:37,143 INFO L290 TraceCheckUtils]: 10: Hoare triple {1641#(< 8 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {1637#(< 6 main_~y~0)} is VALID [2022-04-28 03:50:37,143 INFO L290 TraceCheckUtils]: 9: Hoare triple {1645#(or (< main_~x~0 1000000) (< 8 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[] {1641#(< 8 main_~y~0)} is VALID [2022-04-28 03:50:37,144 INFO L290 TraceCheckUtils]: 8: Hoare triple {1649#(and (or (< main_~x~0 (+ 999992 main_~y~0)) (<= 8 main_~y~0) (not (<= 50000 main_~x~0))) (or (< main_~x~0 1000000) (< 8 main_~y~0)))} [74] L11-2-->L18-1_primed: Formula: (let ((.cse0 (<= 50000 v_main_~x~0_91)) (.cse1 (= |v_main_#t~post5_25| |v_main_#t~post5_24|)) (.cse2 (= v_main_~x~0_91 v_main_~x~0_90)) (.cse3 (= v_main_~y~0_58 v_main_~y~0_57)) (.cse4 (= |v_main_#t~post6_25| |v_main_#t~post6_24|))) (or (and .cse0 (< v_main_~x~0_91 v_main_~x~0_90) (= (+ v_main_~x~0_91 v_main_~y~0_57) (+ v_main_~x~0_90 v_main_~y~0_58)) (< v_main_~x~0_90 1000001)) (and .cse1 (or (not .cse0) (not (< v_main_~x~0_91 1000000))) .cse2 .cse3 .cse4) (and .cse1 .cse2 .cse3 .cse4))) InVars {main_~y~0=v_main_~y~0_58, main_#t~post5=|v_main_#t~post5_25|, main_~x~0=v_main_~x~0_91, main_#t~post6=|v_main_#t~post6_25|} OutVars{main_~y~0=v_main_~y~0_57, main_#t~post5=|v_main_#t~post5_24|, main_~x~0=v_main_~x~0_90, main_#t~post6=|v_main_#t~post6_24|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {1645#(or (< main_~x~0 1000000) (< 8 main_~y~0))} is VALID [2022-04-28 03:50:37,144 INFO L290 TraceCheckUtils]: 7: Hoare triple {1649#(and (or (< main_~x~0 (+ 999992 main_~y~0)) (<= 8 main_~y~0) (not (<= 50000 main_~x~0))) (or (< main_~x~0 1000000) (< 8 main_~y~0)))} [73] L18-1_primed-->L11-2: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1649#(and (or (< main_~x~0 (+ 999992 main_~y~0)) (<= 8 main_~y~0) (not (<= 50000 main_~x~0))) (or (< main_~x~0 1000000) (< 8 main_~y~0)))} is VALID [2022-04-28 03:50:37,145 INFO L290 TraceCheckUtils]: 6: Hoare triple {1656#(and (or (and (<= 0 (+ 949991 main_~y~0)) (< main_~x~0 (+ 999992 main_~y~0))) (<= 8 main_~y~0)) (or (< main_~x~0 1000000) (< 8 main_~y~0)))} [72] L11-2-->L18-1_primed: Formula: (let ((.cse0 (= v_main_~x~0_89 v_main_~x~0_88))) (or (and (= |v_main_#t~post4_27| |v_main_#t~post4_26|) .cse0) (and (= |v_main_#t~post4_26| |v_main_#t~post4_27|) (not (< v_main_~x~0_89 50000)) .cse0) (and (< v_main_~x~0_89 v_main_~x~0_88) (< v_main_~x~0_88 50001)))) InVars {main_~x~0=v_main_~x~0_89, main_#t~post4=|v_main_#t~post4_27|} OutVars{main_~x~0=v_main_~x~0_88, main_#t~post4=|v_main_#t~post4_26|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {1649#(and (or (< main_~x~0 (+ 999992 main_~y~0)) (<= 8 main_~y~0) (not (<= 50000 main_~x~0))) (or (< main_~x~0 1000000) (< 8 main_~y~0)))} is VALID [2022-04-28 03:50:37,146 INFO L290 TraceCheckUtils]: 5: Hoare triple {1537#true} ~x~0 := 0;~y~0 := 50000;~z~0 := 0;~x~0 := 0; {1656#(and (or (and (<= 0 (+ 949991 main_~y~0)) (< main_~x~0 (+ 999992 main_~y~0))) (<= 8 main_~y~0)) (or (< main_~x~0 1000000) (< 8 main_~y~0)))} is VALID [2022-04-28 03:50:37,146 INFO L272 TraceCheckUtils]: 4: Hoare triple {1537#true} call #t~ret7 := main(); {1537#true} is VALID [2022-04-28 03:50:37,146 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1537#true} {1537#true} #52#return; {1537#true} is VALID [2022-04-28 03:50:37,146 INFO L290 TraceCheckUtils]: 2: Hoare triple {1537#true} assume true; {1537#true} is VALID [2022-04-28 03:50:37,146 INFO L290 TraceCheckUtils]: 1: Hoare triple {1537#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); {1537#true} is VALID [2022-04-28 03:50:37,146 INFO L272 TraceCheckUtils]: 0: Hoare triple {1537#true} call ULTIMATE.init(); {1537#true} is VALID [2022-04-28 03:50:37,146 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 03:50:37,146 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1989516980] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 03:50:37,146 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 03:50:37,146 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 10, 10] total 24 [2022-04-28 03:50:37,413 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 03:50:37,413 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1389768846] [2022-04-28 03:50:37,413 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1389768846] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 03:50:37,413 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 03:50:37,413 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2022-04-28 03:50:37,413 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1566574048] [2022-04-28 03:50:37,414 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 03:50:37,414 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 1.6470588235294117) internal successors, (28), 16 states have internal predecessors, (28), 2 states have call successors, (3), 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 32 [2022-04-28 03:50:37,414 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 03:50:37,414 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 17 states, 17 states have (on average 1.6470588235294117) internal successors, (28), 16 states have internal predecessors, (28), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:50:37,448 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 32 edges. 32 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 03:50:37,449 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2022-04-28 03:50:37,449 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 03:50:37,449 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2022-04-28 03:50:37,449 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=364, Invalid=628, Unknown=0, NotChecked=0, Total=992 [2022-04-28 03:50:37,450 INFO L87 Difference]: Start difference. First operand 33 states and 36 transitions. Second operand has 17 states, 17 states have (on average 1.6470588235294117) internal successors, (28), 16 states have internal predecessors, (28), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:50:38,019 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:50:38,019 INFO L93 Difference]: Finished difference Result 63 states and 74 transitions. [2022-04-28 03:50:38,019 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-04-28 03:50:38,020 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 1.6470588235294117) internal successors, (28), 16 states have internal predecessors, (28), 2 states have call successors, (3), 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 32 [2022-04-28 03:50:38,020 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 03:50:38,020 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17 states, 17 states have (on average 1.6470588235294117) internal successors, (28), 16 states have internal predecessors, (28), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:50:38,021 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 54 transitions. [2022-04-28 03:50:38,021 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17 states, 17 states have (on average 1.6470588235294117) internal successors, (28), 16 states have internal predecessors, (28), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:50:38,022 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 54 transitions. [2022-04-28 03:50:38,022 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 17 states and 54 transitions. [2022-04-28 03:50:38,070 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 54 edges. 54 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 03:50:38,071 INFO L225 Difference]: With dead ends: 63 [2022-04-28 03:50:38,071 INFO L226 Difference]: Without dead ends: 38 [2022-04-28 03:50:38,072 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 82 GetRequests, 37 SyntacticMatches, 1 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 663 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=666, Invalid=1404, Unknown=0, NotChecked=0, Total=2070 [2022-04-28 03:50:38,072 INFO L413 NwaCegarLoop]: 12 mSDtfsCounter, 39 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 186 mSolverCounterSat, 56 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 39 SdHoareTripleChecker+Valid, 34 SdHoareTripleChecker+Invalid, 242 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 56 IncrementalHoareTripleChecker+Valid, 186 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-04-28 03:50:38,072 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [39 Valid, 34 Invalid, 242 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [56 Valid, 186 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-04-28 03:50:38,073 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2022-04-28 03:50:38,117 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 38. [2022-04-28 03:50:38,117 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 03:50:38,117 INFO L82 GeneralOperation]: Start isEquivalent. First operand 38 states. Second operand has 38 states, 33 states have (on average 1.121212121212121) internal successors, (37), 33 states have internal predecessors, (37), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:50:38,118 INFO L74 IsIncluded]: Start isIncluded. First operand 38 states. Second operand has 38 states, 33 states have (on average 1.121212121212121) internal successors, (37), 33 states have internal predecessors, (37), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:50:38,118 INFO L87 Difference]: Start difference. First operand 38 states. Second operand has 38 states, 33 states have (on average 1.121212121212121) internal successors, (37), 33 states have internal predecessors, (37), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:50:38,119 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:50:38,119 INFO L93 Difference]: Finished difference Result 38 states and 41 transitions. [2022-04-28 03:50:38,119 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 41 transitions. [2022-04-28 03:50:38,119 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:50:38,119 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:50:38,119 INFO L74 IsIncluded]: Start isIncluded. First operand has 38 states, 33 states have (on average 1.121212121212121) internal successors, (37), 33 states have internal predecessors, (37), 3 states have call successors, (3), 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 38 states. [2022-04-28 03:50:38,119 INFO L87 Difference]: Start difference. First operand has 38 states, 33 states have (on average 1.121212121212121) internal successors, (37), 33 states have internal predecessors, (37), 3 states have call successors, (3), 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 38 states. [2022-04-28 03:50:38,120 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:50:38,120 INFO L93 Difference]: Finished difference Result 38 states and 41 transitions. [2022-04-28 03:50:38,120 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 41 transitions. [2022-04-28 03:50:38,120 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:50:38,120 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:50:38,120 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 03:50:38,120 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 03:50:38,120 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 38 states, 33 states have (on average 1.121212121212121) internal successors, (37), 33 states have internal predecessors, (37), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:50:38,121 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 41 transitions. [2022-04-28 03:50:38,121 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 41 transitions. Word has length 32 [2022-04-28 03:50:38,121 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 03:50:38,121 INFO L495 AbstractCegarLoop]: Abstraction has 38 states and 41 transitions. [2022-04-28 03:50:38,122 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 1.6470588235294117) internal successors, (28), 16 states have internal predecessors, (28), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:50:38,122 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 38 states and 41 transitions. [2022-04-28 03:50:38,160 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 41 edges. 41 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 03:50:38,160 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 41 transitions. [2022-04-28 03:50:38,161 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2022-04-28 03:50:38,161 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 03:50:38,161 INFO L195 NwaCegarLoop]: trace histogram [10, 9, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 03:50:38,177 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2022-04-28 03:50:38,361 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 03:50:38,361 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 03:50:38,362 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 03:50:38,362 INFO L85 PathProgramCache]: Analyzing trace with hash -802576804, now seen corresponding path program 5 times [2022-04-28 03:50:38,362 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 03:50:38,362 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [2113750126] [2022-04-28 03:50:38,478 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 1 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 03:50:42,623 WARN L977 rdanLoopAcceleration]: Unable to prove correctness of quantifier elimination. [2022-04-28 03:50:42,752 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={1=1, 2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 03:50:42,754 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-28 03:50:42,756 INFO L85 PathProgramCache]: Analyzing trace with hash 1913865794, now seen corresponding path program 1 times [2022-04-28 03:50:42,757 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 03:50:42,757 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [619119119] [2022-04-28 03:50:42,757 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:50:42,757 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 03:50:42,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:50:42,834 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 03:50:42,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:50:42,839 INFO L290 TraceCheckUtils]: 0: Hoare triple {2002#(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); {1991#true} is VALID [2022-04-28 03:50:42,839 INFO L290 TraceCheckUtils]: 1: Hoare triple {1991#true} assume true; {1991#true} is VALID [2022-04-28 03:50:42,839 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {1991#true} {1991#true} #52#return; {1991#true} is VALID [2022-04-28 03:50:42,840 INFO L272 TraceCheckUtils]: 0: Hoare triple {1991#true} call ULTIMATE.init(); {2002#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 03:50:42,840 INFO L290 TraceCheckUtils]: 1: Hoare triple {2002#(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); {1991#true} is VALID [2022-04-28 03:50:42,840 INFO L290 TraceCheckUtils]: 2: Hoare triple {1991#true} assume true; {1991#true} is VALID [2022-04-28 03:50:42,840 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1991#true} {1991#true} #52#return; {1991#true} is VALID [2022-04-28 03:50:42,840 INFO L272 TraceCheckUtils]: 4: Hoare triple {1991#true} call #t~ret7 := main(); {1991#true} is VALID [2022-04-28 03:50:42,840 INFO L290 TraceCheckUtils]: 5: Hoare triple {1991#true} ~x~0 := 0;~y~0 := 50000;~z~0 := 0;~x~0 := 0; {1996#(<= 50000 main_~y~0)} is VALID [2022-04-28 03:50:42,841 INFO L290 TraceCheckUtils]: 6: Hoare triple {1996#(<= 50000 main_~y~0)} [76] L11-2-->L18-1_primed: Formula: (let ((.cse0 (= |v_main_#t~post4_34| |v_main_#t~post4_33|)) (.cse1 (= v_main_~x~0_118 v_main_~x~0_117))) (or (and .cse0 .cse1) (and .cse0 .cse1 (<= 50000 v_main_~x~0_118)) (and (< v_main_~x~0_118 v_main_~x~0_117) (< v_main_~x~0_117 50001)))) InVars {main_~x~0=v_main_~x~0_118, main_#t~post4=|v_main_#t~post4_34|} OutVars{main_~x~0=v_main_~x~0_117, main_#t~post4=|v_main_#t~post4_33|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {1996#(<= 50000 main_~y~0)} is VALID [2022-04-28 03:50:42,841 INFO L290 TraceCheckUtils]: 7: Hoare triple {1996#(<= 50000 main_~y~0)} [77] L18-1_primed-->L11-2: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1996#(<= 50000 main_~y~0)} is VALID [2022-04-28 03:50:42,842 INFO L290 TraceCheckUtils]: 8: Hoare triple {1996#(<= 50000 main_~y~0)} [78] L11-2-->L18-1_primed: Formula: (let ((.cse0 (<= 50000 v_main_~x~0_120)) (.cse1 (= v_main_~y~0_82 v_main_~y~0_81)) (.cse2 (= |v_main_#t~post6_32| |v_main_#t~post6_31|)) (.cse3 (= |v_main_#t~post5_32| |v_main_#t~post5_31|))) (or (and (< v_main_~x~0_120 v_main_~x~0_119) (= (+ v_main_~x~0_119 v_main_~y~0_82) (+ v_main_~x~0_120 v_main_~y~0_81)) (< v_main_~x~0_119 1000001) .cse0) (and (= v_main_~x~0_119 v_main_~x~0_120) .cse1 .cse2 .cse3 (or (not (< v_main_~x~0_120 1000000)) (not .cse0))) (and (= v_main_~x~0_120 v_main_~x~0_119) .cse1 .cse2 .cse3))) InVars {main_~y~0=v_main_~y~0_82, main_#t~post5=|v_main_#t~post5_32|, main_~x~0=v_main_~x~0_120, main_#t~post6=|v_main_#t~post6_32|} OutVars{main_~y~0=v_main_~y~0_81, main_#t~post5=|v_main_#t~post5_31|, main_~x~0=v_main_~x~0_119, main_#t~post6=|v_main_#t~post6_31|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {1996#(<= 50000 main_~y~0)} is VALID [2022-04-28 03:50:42,842 INFO L290 TraceCheckUtils]: 9: Hoare triple {1996#(<= 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[] {1996#(<= 50000 main_~y~0)} is VALID [2022-04-28 03:50:42,843 INFO L290 TraceCheckUtils]: 10: Hoare triple {1996#(<= 50000 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {1997#(<= 49998 main_~y~0)} is VALID [2022-04-28 03:50:42,843 INFO L290 TraceCheckUtils]: 11: Hoare triple {1997#(<= 49998 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {1998#(<= 49996 main_~y~0)} is VALID [2022-04-28 03:50:42,844 INFO L290 TraceCheckUtils]: 12: Hoare triple {1998#(<= 49996 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {1999#(<= 49994 main_~y~0)} is VALID [2022-04-28 03:50:42,845 INFO L290 TraceCheckUtils]: 13: Hoare triple {1999#(<= 49994 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {2000#(<= 49992 main_~y~0)} is VALID [2022-04-28 03:50:42,845 INFO L290 TraceCheckUtils]: 14: Hoare triple {2000#(<= 49992 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {2001#(<= 49990 main_~y~0)} is VALID [2022-04-28 03:50:42,846 INFO L290 TraceCheckUtils]: 15: Hoare triple {2001#(<= 49990 main_~y~0)} assume !(~y~0 > 0); {1992#false} is VALID [2022-04-28 03:50:42,846 INFO L272 TraceCheckUtils]: 16: Hoare triple {1992#false} call __VERIFIER_assert((if ~z~0 == ~x~0 then 1 else 0)); {1992#false} is VALID [2022-04-28 03:50:42,846 INFO L290 TraceCheckUtils]: 17: Hoare triple {1992#false} ~cond := #in~cond; {1992#false} is VALID [2022-04-28 03:50:42,846 INFO L290 TraceCheckUtils]: 18: Hoare triple {1992#false} assume 0 == ~cond; {1992#false} is VALID [2022-04-28 03:50:42,846 INFO L290 TraceCheckUtils]: 19: Hoare triple {1992#false} assume !false; {1992#false} is VALID [2022-04-28 03:50:42,846 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-04-28 03:50:42,846 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 03:50:42,846 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [619119119] [2022-04-28 03:50:42,847 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [619119119] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 03:50:42,847 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1278663539] [2022-04-28 03:50:42,847 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:50:42,847 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 03:50:42,847 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 03:50:42,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-28 03:50:42,864 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-04-28 03:50:42,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:50:42,885 INFO L263 TraceCheckSpWp]: Trace formula consists of 84 conjuncts, 11 conjunts are in the unsatisfiable core [2022-04-28 03:50:42,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:50:42,895 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 03:50:43,310 INFO L272 TraceCheckUtils]: 0: Hoare triple {1991#true} call ULTIMATE.init(); {1991#true} is VALID [2022-04-28 03:50:43,311 INFO L290 TraceCheckUtils]: 1: Hoare triple {1991#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); {1991#true} is VALID [2022-04-28 03:50:43,311 INFO L290 TraceCheckUtils]: 2: Hoare triple {1991#true} assume true; {1991#true} is VALID [2022-04-28 03:50:43,311 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1991#true} {1991#true} #52#return; {1991#true} is VALID [2022-04-28 03:50:43,311 INFO L272 TraceCheckUtils]: 4: Hoare triple {1991#true} call #t~ret7 := main(); {1991#true} is VALID [2022-04-28 03:50:43,311 INFO L290 TraceCheckUtils]: 5: Hoare triple {1991#true} ~x~0 := 0;~y~0 := 50000;~z~0 := 0;~x~0 := 0; {2021#(and (<= main_~x~0 0) (<= 50000 main_~y~0))} is VALID [2022-04-28 03:50:43,312 INFO L290 TraceCheckUtils]: 6: Hoare triple {2021#(and (<= main_~x~0 0) (<= 50000 main_~y~0))} [76] L11-2-->L18-1_primed: Formula: (let ((.cse0 (= |v_main_#t~post4_34| |v_main_#t~post4_33|)) (.cse1 (= v_main_~x~0_118 v_main_~x~0_117))) (or (and .cse0 .cse1) (and .cse0 .cse1 (<= 50000 v_main_~x~0_118)) (and (< v_main_~x~0_118 v_main_~x~0_117) (< v_main_~x~0_117 50001)))) InVars {main_~x~0=v_main_~x~0_118, main_#t~post4=|v_main_#t~post4_34|} OutVars{main_~x~0=v_main_~x~0_117, main_#t~post4=|v_main_#t~post4_33|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {2025#(and (< main_~x~0 50001) (<= 50000 main_~y~0))} is VALID [2022-04-28 03:50:43,314 INFO L290 TraceCheckUtils]: 7: Hoare triple {2025#(and (< main_~x~0 50001) (<= 50000 main_~y~0))} [77] L18-1_primed-->L11-2: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2025#(and (< main_~x~0 50001) (<= 50000 main_~y~0))} is VALID [2022-04-28 03:50:43,315 INFO L290 TraceCheckUtils]: 8: Hoare triple {2025#(and (< main_~x~0 50001) (<= 50000 main_~y~0))} [78] L11-2-->L18-1_primed: Formula: (let ((.cse0 (<= 50000 v_main_~x~0_120)) (.cse1 (= v_main_~y~0_82 v_main_~y~0_81)) (.cse2 (= |v_main_#t~post6_32| |v_main_#t~post6_31|)) (.cse3 (= |v_main_#t~post5_32| |v_main_#t~post5_31|))) (or (and (< v_main_~x~0_120 v_main_~x~0_119) (= (+ v_main_~x~0_119 v_main_~y~0_82) (+ v_main_~x~0_120 v_main_~y~0_81)) (< v_main_~x~0_119 1000001) .cse0) (and (= v_main_~x~0_119 v_main_~x~0_120) .cse1 .cse2 .cse3 (or (not (< v_main_~x~0_120 1000000)) (not .cse0))) (and (= v_main_~x~0_120 v_main_~x~0_119) .cse1 .cse2 .cse3))) InVars {main_~y~0=v_main_~y~0_82, main_#t~post5=|v_main_#t~post5_32|, main_~x~0=v_main_~x~0_120, main_#t~post6=|v_main_#t~post6_32|} OutVars{main_~y~0=v_main_~y~0_81, main_#t~post5=|v_main_#t~post5_31|, main_~x~0=v_main_~x~0_119, main_#t~post6=|v_main_#t~post6_31|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {2032#(or (and (< main_~x~0 50001) (<= 50000 main_~y~0)) (and (< main_~x~0 (+ main_~y~0 1)) (< main_~x~0 1000001) (< 50000 main_~x~0)))} is VALID [2022-04-28 03:50:43,316 INFO L290 TraceCheckUtils]: 9: Hoare triple {2032#(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)))} [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[] {2036#(< 999999 main_~y~0)} is VALID [2022-04-28 03:50:43,316 INFO L290 TraceCheckUtils]: 10: Hoare triple {2036#(< 999999 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {2040#(< 999997 main_~y~0)} is VALID [2022-04-28 03:50:43,317 INFO L290 TraceCheckUtils]: 11: Hoare triple {2040#(< 999997 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {2044#(< 999995 main_~y~0)} is VALID [2022-04-28 03:50:43,318 INFO L290 TraceCheckUtils]: 12: Hoare triple {2044#(< 999995 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {2048#(< 999993 main_~y~0)} is VALID [2022-04-28 03:50:43,318 INFO L290 TraceCheckUtils]: 13: Hoare triple {2048#(< 999993 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {2052#(< 999991 main_~y~0)} is VALID [2022-04-28 03:50:43,319 INFO L290 TraceCheckUtils]: 14: Hoare triple {2052#(< 999991 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {2056#(< 999989 main_~y~0)} is VALID [2022-04-28 03:50:43,319 INFO L290 TraceCheckUtils]: 15: Hoare triple {2056#(< 999989 main_~y~0)} assume !(~y~0 > 0); {1992#false} is VALID [2022-04-28 03:50:43,320 INFO L272 TraceCheckUtils]: 16: Hoare triple {1992#false} call __VERIFIER_assert((if ~z~0 == ~x~0 then 1 else 0)); {1992#false} is VALID [2022-04-28 03:50:43,320 INFO L290 TraceCheckUtils]: 17: Hoare triple {1992#false} ~cond := #in~cond; {1992#false} is VALID [2022-04-28 03:50:43,320 INFO L290 TraceCheckUtils]: 18: Hoare triple {1992#false} assume 0 == ~cond; {1992#false} is VALID [2022-04-28 03:50:43,320 INFO L290 TraceCheckUtils]: 19: Hoare triple {1992#false} assume !false; {1992#false} is VALID [2022-04-28 03:50:43,320 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 17 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 03:50:43,320 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 03:50:43,897 INFO L290 TraceCheckUtils]: 19: Hoare triple {1992#false} assume !false; {1992#false} is VALID [2022-04-28 03:50:43,897 INFO L290 TraceCheckUtils]: 18: Hoare triple {1992#false} assume 0 == ~cond; {1992#false} is VALID [2022-04-28 03:50:43,897 INFO L290 TraceCheckUtils]: 17: Hoare triple {1992#false} ~cond := #in~cond; {1992#false} is VALID [2022-04-28 03:50:43,897 INFO L272 TraceCheckUtils]: 16: Hoare triple {1992#false} call __VERIFIER_assert((if ~z~0 == ~x~0 then 1 else 0)); {1992#false} is VALID [2022-04-28 03:50:43,897 INFO L290 TraceCheckUtils]: 15: Hoare triple {2084#(< 0 main_~y~0)} assume !(~y~0 > 0); {1992#false} is VALID [2022-04-28 03:50:43,898 INFO L290 TraceCheckUtils]: 14: Hoare triple {2088#(< 2 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {2084#(< 0 main_~y~0)} is VALID [2022-04-28 03:50:43,899 INFO L290 TraceCheckUtils]: 13: Hoare triple {2092#(< 4 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {2088#(< 2 main_~y~0)} is VALID [2022-04-28 03:50:43,899 INFO L290 TraceCheckUtils]: 12: Hoare triple {2096#(< 6 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {2092#(< 4 main_~y~0)} is VALID [2022-04-28 03:50:43,900 INFO L290 TraceCheckUtils]: 11: Hoare triple {2100#(< 8 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {2096#(< 6 main_~y~0)} is VALID [2022-04-28 03:50:43,900 INFO L290 TraceCheckUtils]: 10: Hoare triple {2104#(< 10 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {2100#(< 8 main_~y~0)} is VALID [2022-04-28 03:50:43,901 INFO L290 TraceCheckUtils]: 9: Hoare triple {2108#(or (< main_~x~0 1000000) (< 10 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[] {2104#(< 10 main_~y~0)} is VALID [2022-04-28 03:50:43,902 INFO L290 TraceCheckUtils]: 8: Hoare triple {2112#(and (or (< main_~x~0 1000000) (< 10 main_~y~0)) (or (<= 1000000 main_~x~0) (not (<= 50000 main_~x~0)) (< main_~x~0 (+ main_~y~0 999990))))} [78] L11-2-->L18-1_primed: Formula: (let ((.cse0 (<= 50000 v_main_~x~0_120)) (.cse1 (= v_main_~y~0_82 v_main_~y~0_81)) (.cse2 (= |v_main_#t~post6_32| |v_main_#t~post6_31|)) (.cse3 (= |v_main_#t~post5_32| |v_main_#t~post5_31|))) (or (and (< v_main_~x~0_120 v_main_~x~0_119) (= (+ v_main_~x~0_119 v_main_~y~0_82) (+ v_main_~x~0_120 v_main_~y~0_81)) (< v_main_~x~0_119 1000001) .cse0) (and (= v_main_~x~0_119 v_main_~x~0_120) .cse1 .cse2 .cse3 (or (not (< v_main_~x~0_120 1000000)) (not .cse0))) (and (= v_main_~x~0_120 v_main_~x~0_119) .cse1 .cse2 .cse3))) InVars {main_~y~0=v_main_~y~0_82, main_#t~post5=|v_main_#t~post5_32|, main_~x~0=v_main_~x~0_120, main_#t~post6=|v_main_#t~post6_32|} OutVars{main_~y~0=v_main_~y~0_81, main_#t~post5=|v_main_#t~post5_31|, main_~x~0=v_main_~x~0_119, main_#t~post6=|v_main_#t~post6_31|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {2108#(or (< main_~x~0 1000000) (< 10 main_~y~0))} is VALID [2022-04-28 03:50:43,902 INFO L290 TraceCheckUtils]: 7: Hoare triple {2112#(and (or (< main_~x~0 1000000) (< 10 main_~y~0)) (or (<= 1000000 main_~x~0) (not (<= 50000 main_~x~0)) (< main_~x~0 (+ main_~y~0 999990))))} [77] L18-1_primed-->L11-2: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2112#(and (or (< main_~x~0 1000000) (< 10 main_~y~0)) (or (<= 1000000 main_~x~0) (not (<= 50000 main_~x~0)) (< main_~x~0 (+ main_~y~0 999990))))} is VALID [2022-04-28 03:50:43,903 INFO L290 TraceCheckUtils]: 6: Hoare triple {2119#(and (or (< main_~x~0 1000000) (< 10 main_~y~0)) (<= 0 (+ 949989 main_~y~0)) (or (<= 1000000 main_~x~0) (< main_~x~0 (+ main_~y~0 999990))))} [76] L11-2-->L18-1_primed: Formula: (let ((.cse0 (= |v_main_#t~post4_34| |v_main_#t~post4_33|)) (.cse1 (= v_main_~x~0_118 v_main_~x~0_117))) (or (and .cse0 .cse1) (and .cse0 .cse1 (<= 50000 v_main_~x~0_118)) (and (< v_main_~x~0_118 v_main_~x~0_117) (< v_main_~x~0_117 50001)))) InVars {main_~x~0=v_main_~x~0_118, main_#t~post4=|v_main_#t~post4_34|} OutVars{main_~x~0=v_main_~x~0_117, main_#t~post4=|v_main_#t~post4_33|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {2112#(and (or (< main_~x~0 1000000) (< 10 main_~y~0)) (or (<= 1000000 main_~x~0) (not (<= 50000 main_~x~0)) (< main_~x~0 (+ main_~y~0 999990))))} is VALID [2022-04-28 03:50:43,904 INFO L290 TraceCheckUtils]: 5: Hoare triple {1991#true} ~x~0 := 0;~y~0 := 50000;~z~0 := 0;~x~0 := 0; {2119#(and (or (< main_~x~0 1000000) (< 10 main_~y~0)) (<= 0 (+ 949989 main_~y~0)) (or (<= 1000000 main_~x~0) (< main_~x~0 (+ main_~y~0 999990))))} is VALID [2022-04-28 03:50:43,904 INFO L272 TraceCheckUtils]: 4: Hoare triple {1991#true} call #t~ret7 := main(); {1991#true} is VALID [2022-04-28 03:50:43,904 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1991#true} {1991#true} #52#return; {1991#true} is VALID [2022-04-28 03:50:43,904 INFO L290 TraceCheckUtils]: 2: Hoare triple {1991#true} assume true; {1991#true} is VALID [2022-04-28 03:50:43,904 INFO L290 TraceCheckUtils]: 1: Hoare triple {1991#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); {1991#true} is VALID [2022-04-28 03:50:43,904 INFO L272 TraceCheckUtils]: 0: Hoare triple {1991#true} call ULTIMATE.init(); {1991#true} is VALID [2022-04-28 03:50:43,904 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 17 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 03:50:43,905 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1278663539] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 03:50:43,905 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 03:50:43,905 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 11, 11] total 27 [2022-04-28 03:50:44,286 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 03:50:44,287 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [2113750126] [2022-04-28 03:50:44,287 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [2113750126] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 03:50:44,287 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 03:50:44,287 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [20] imperfect sequences [] total 20 [2022-04-28 03:50:44,287 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1611419895] [2022-04-28 03:50:44,287 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 03:50:44,288 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 20 states have (on average 1.65) internal successors, (33), 19 states have internal predecessors, (33), 2 states have call successors, (3), 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 37 [2022-04-28 03:50:44,288 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 03:50:44,288 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 20 states, 20 states have (on average 1.65) internal successors, (33), 19 states have internal predecessors, (33), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:50:44,324 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 37 edges. 37 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 03:50:44,324 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2022-04-28 03:50:44,324 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 03:50:44,325 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2022-04-28 03:50:44,325 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=484, Invalid=848, Unknown=0, NotChecked=0, Total=1332 [2022-04-28 03:50:44,325 INFO L87 Difference]: Start difference. First operand 38 states and 41 transitions. Second operand has 20 states, 20 states have (on average 1.65) internal successors, (33), 19 states have internal predecessors, (33), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:50:45,106 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:50:45,106 INFO L93 Difference]: Finished difference Result 73 states and 84 transitions. [2022-04-28 03:50:45,106 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2022-04-28 03:50:45,106 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 20 states have (on average 1.65) internal successors, (33), 19 states have internal predecessors, (33), 2 states have call successors, (3), 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 37 [2022-04-28 03:50:45,106 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 03:50:45,106 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20 states, 20 states have (on average 1.65) internal successors, (33), 19 states have internal predecessors, (33), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:50:45,107 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 59 transitions. [2022-04-28 03:50:45,107 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20 states, 20 states have (on average 1.65) internal successors, (33), 19 states have internal predecessors, (33), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:50:45,108 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 59 transitions. [2022-04-28 03:50:45,108 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 20 states and 59 transitions. [2022-04-28 03:50:45,153 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 59 edges. 59 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 03:50:45,154 INFO L225 Difference]: With dead ends: 73 [2022-04-28 03:50:45,154 INFO L226 Difference]: Without dead ends: 43 [2022-04-28 03:50:45,155 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 92 GetRequests, 39 SyntacticMatches, 1 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 926 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=897, Invalid=1965, Unknown=0, NotChecked=0, Total=2862 [2022-04-28 03:50:45,155 INFO L413 NwaCegarLoop]: 12 mSDtfsCounter, 58 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 243 mSolverCounterSat, 68 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 58 SdHoareTripleChecker+Valid, 24 SdHoareTripleChecker+Invalid, 311 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 68 IncrementalHoareTripleChecker+Valid, 243 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-04-28 03:50:45,155 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [58 Valid, 24 Invalid, 311 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [68 Valid, 243 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-04-28 03:50:45,156 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2022-04-28 03:50:45,205 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 43. [2022-04-28 03:50:45,206 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 03:50:45,206 INFO L82 GeneralOperation]: Start isEquivalent. First operand 43 states. Second operand has 43 states, 38 states have (on average 1.105263157894737) internal successors, (42), 38 states have internal predecessors, (42), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:50:45,206 INFO L74 IsIncluded]: Start isIncluded. First operand 43 states. Second operand has 43 states, 38 states have (on average 1.105263157894737) internal successors, (42), 38 states have internal predecessors, (42), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:50:45,207 INFO L87 Difference]: Start difference. First operand 43 states. Second operand has 43 states, 38 states have (on average 1.105263157894737) internal successors, (42), 38 states have internal predecessors, (42), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:50:45,208 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:50:45,209 INFO L93 Difference]: Finished difference Result 43 states and 46 transitions. [2022-04-28 03:50:45,209 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 46 transitions. [2022-04-28 03:50:45,209 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:50:45,209 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:50:45,209 INFO L74 IsIncluded]: Start isIncluded. First operand has 43 states, 38 states have (on average 1.105263157894737) internal successors, (42), 38 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 43 states. [2022-04-28 03:50:45,210 INFO L87 Difference]: Start difference. First operand has 43 states, 38 states have (on average 1.105263157894737) internal successors, (42), 38 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 43 states. [2022-04-28 03:50:45,211 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:50:45,211 INFO L93 Difference]: Finished difference Result 43 states and 46 transitions. [2022-04-28 03:50:45,211 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 46 transitions. [2022-04-28 03:50:45,211 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:50:45,211 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:50:45,211 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 03:50:45,211 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 03:50:45,212 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 43 states, 38 states have (on average 1.105263157894737) internal successors, (42), 38 states have internal predecessors, (42), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:50:45,212 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 46 transitions. [2022-04-28 03:50:45,213 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 46 transitions. Word has length 37 [2022-04-28 03:50:45,213 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 03:50:45,213 INFO L495 AbstractCegarLoop]: Abstraction has 43 states and 46 transitions. [2022-04-28 03:50:45,218 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 1.65) internal successors, (33), 19 states have internal predecessors, (33), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:50:45,218 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 43 states and 46 transitions. [2022-04-28 03:50:45,253 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 46 edges. 46 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 03:50:45,253 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 46 transitions. [2022-04-28 03:50:45,254 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2022-04-28 03:50:45,254 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 03:50:45,254 INFO L195 NwaCegarLoop]: trace histogram [12, 11, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 03:50:45,269 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2022-04-28 03:50:45,454 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 03:50:45,454 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 03:50:45,454 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 03:50:45,455 INFO L85 PathProgramCache]: Analyzing trace with hash -1080568111, now seen corresponding path program 6 times [2022-04-28 03:50:45,455 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 03:50:45,455 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [113403324] [2022-04-28 03:50:48,083 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 1 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 03:50:48,319 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={1=1, 2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 03:50:48,320 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-28 03:50:48,323 INFO L85 PathProgramCache]: Analyzing trace with hash -1708440479, now seen corresponding path program 1 times [2022-04-28 03:50:48,323 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 03:50:48,323 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [235517605] [2022-04-28 03:50:48,323 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:50:48,323 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 03:50:48,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:50:48,459 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 03:50:48,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:50:48,467 INFO L290 TraceCheckUtils]: 0: Hoare triple {2517#(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); {2502#true} is VALID [2022-04-28 03:50:48,467 INFO L290 TraceCheckUtils]: 1: Hoare triple {2502#true} assume true; {2502#true} is VALID [2022-04-28 03:50:48,467 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {2502#true} {2502#true} #52#return; {2502#true} is VALID [2022-04-28 03:50:48,469 INFO L272 TraceCheckUtils]: 0: Hoare triple {2502#true} call ULTIMATE.init(); {2517#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 03:50:48,469 INFO L290 TraceCheckUtils]: 1: Hoare triple {2517#(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); {2502#true} is VALID [2022-04-28 03:50:48,469 INFO L290 TraceCheckUtils]: 2: Hoare triple {2502#true} assume true; {2502#true} is VALID [2022-04-28 03:50:48,469 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2502#true} {2502#true} #52#return; {2502#true} is VALID [2022-04-28 03:50:48,469 INFO L272 TraceCheckUtils]: 4: Hoare triple {2502#true} call #t~ret7 := main(); {2502#true} is VALID [2022-04-28 03:50:48,470 INFO L290 TraceCheckUtils]: 5: Hoare triple {2502#true} ~x~0 := 0;~y~0 := 50000;~z~0 := 0;~x~0 := 0; {2507#(and (= main_~x~0 0) (<= 50000 main_~y~0))} is VALID [2022-04-28 03:50:48,470 INFO L290 TraceCheckUtils]: 6: Hoare triple {2507#(and (= 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_149 50001) (< v_main_~x~0_150 v_main_~x~0_149)) (and (not (< v_main_~x~0_150 50000)) (= v_main_~x~0_149 v_main_~x~0_150) .cse0) (and (= v_main_~x~0_150 v_main_~x~0_149) .cse0))) InVars {main_~x~0=v_main_~x~0_150, main_#t~post4=|v_main_#t~post4_41|} OutVars{main_~x~0=v_main_~x~0_149, main_#t~post4=|v_main_#t~post4_40|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {2508#(and (<= main_~x~0 main_~y~0) (<= 50000 main_~y~0))} is VALID [2022-04-28 03:50:48,471 INFO L290 TraceCheckUtils]: 7: Hoare triple {2508#(and (<= main_~x~0 main_~y~0) (<= 50000 main_~y~0))} [81] L18-1_primed-->L11-2: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2508#(and (<= main_~x~0 main_~y~0) (<= 50000 main_~y~0))} is VALID [2022-04-28 03:50:48,472 INFO L290 TraceCheckUtils]: 8: Hoare triple {2508#(and (<= main_~x~0 main_~y~0) (<= 50000 main_~y~0))} [82] L11-2-->L18-1_primed: Formula: (let ((.cse0 (<= 50000 v_main_~x~0_152)) (.cse1 (= |v_main_#t~post6_39| |v_main_#t~post6_38|)) (.cse2 (= v_main_~x~0_152 v_main_~x~0_151))) (or (and .cse0 (< v_main_~x~0_152 v_main_~x~0_151) (= (+ v_main_~x~0_151 v_main_~y~0_110) (+ v_main_~x~0_152 v_main_~y~0_109)) (< v_main_~x~0_151 1000001)) (and (= |v_main_#t~post5_38| |v_main_#t~post5_39|) .cse1 (or (not .cse0) (not (< v_main_~x~0_152 1000000))) .cse2 (= v_main_~y~0_109 v_main_~y~0_110)) (and .cse1 (= |v_main_#t~post5_39| |v_main_#t~post5_38|) .cse2 (= v_main_~y~0_110 v_main_~y~0_109)))) InVars {main_~y~0=v_main_~y~0_110, main_#t~post5=|v_main_#t~post5_39|, main_~x~0=v_main_~x~0_152, main_#t~post6=|v_main_#t~post6_39|} OutVars{main_~y~0=v_main_~y~0_109, main_#t~post5=|v_main_#t~post5_38|, main_~x~0=v_main_~x~0_151, main_#t~post6=|v_main_#t~post6_38|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {2509#(or (<= main_~x~0 main_~y~0) (<= 50000 main_~y~0))} is VALID [2022-04-28 03:50:48,472 INFO L290 TraceCheckUtils]: 9: Hoare triple {2509#(or (<= main_~x~0 main_~y~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[] {2510#(<= 50000 main_~y~0)} is VALID [2022-04-28 03:50:48,472 INFO L290 TraceCheckUtils]: 10: Hoare triple {2510#(<= 50000 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {2511#(<= 49998 main_~y~0)} is VALID [2022-04-28 03:50:48,473 INFO L290 TraceCheckUtils]: 11: Hoare triple {2511#(<= 49998 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {2512#(<= 49996 main_~y~0)} is VALID [2022-04-28 03:50:48,473 INFO L290 TraceCheckUtils]: 12: Hoare triple {2512#(<= 49996 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {2513#(<= 49994 main_~y~0)} is VALID [2022-04-28 03:50:48,474 INFO L290 TraceCheckUtils]: 13: Hoare triple {2513#(<= 49994 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {2514#(<= 49992 main_~y~0)} is VALID [2022-04-28 03:50:48,474 INFO L290 TraceCheckUtils]: 14: Hoare triple {2514#(<= 49992 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {2515#(<= 49990 main_~y~0)} is VALID [2022-04-28 03:50:48,475 INFO L290 TraceCheckUtils]: 15: Hoare triple {2515#(<= 49990 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {2516#(<= 49988 main_~y~0)} is VALID [2022-04-28 03:50:48,475 INFO L290 TraceCheckUtils]: 16: Hoare triple {2516#(<= 49988 main_~y~0)} assume !(~y~0 > 0); {2503#false} is VALID [2022-04-28 03:50:48,475 INFO L272 TraceCheckUtils]: 17: Hoare triple {2503#false} call __VERIFIER_assert((if ~z~0 == ~x~0 then 1 else 0)); {2503#false} is VALID [2022-04-28 03:50:48,475 INFO L290 TraceCheckUtils]: 18: Hoare triple {2503#false} ~cond := #in~cond; {2503#false} is VALID [2022-04-28 03:50:48,475 INFO L290 TraceCheckUtils]: 19: Hoare triple {2503#false} assume 0 == ~cond; {2503#false} is VALID [2022-04-28 03:50:48,475 INFO L290 TraceCheckUtils]: 20: Hoare triple {2503#false} assume !false; {2503#false} is VALID [2022-04-28 03:50:48,475 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 0 proven. 23 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 03:50:48,475 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 03:50:48,475 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [235517605] [2022-04-28 03:50:48,476 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [235517605] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 03:50:48,476 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1964303867] [2022-04-28 03:50:48,476 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:50:48,476 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 03:50:48,476 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 03:50:48,477 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 03:50:48,477 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2022-04-28 03:50:48,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:50:48,517 INFO L263 TraceCheckSpWp]: Trace formula consists of 89 conjuncts, 9 conjunts are in the unsatisfiable core [2022-04-28 03:50:48,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:50:48,525 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 03:50:48,791 INFO L272 TraceCheckUtils]: 0: Hoare triple {2502#true} call ULTIMATE.init(); {2502#true} is VALID [2022-04-28 03:50:48,792 INFO L290 TraceCheckUtils]: 1: Hoare triple {2502#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); {2502#true} is VALID [2022-04-28 03:50:48,792 INFO L290 TraceCheckUtils]: 2: Hoare triple {2502#true} assume true; {2502#true} is VALID [2022-04-28 03:50:48,792 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2502#true} {2502#true} #52#return; {2502#true} is VALID [2022-04-28 03:50:48,792 INFO L272 TraceCheckUtils]: 4: Hoare triple {2502#true} call #t~ret7 := main(); {2502#true} is VALID [2022-04-28 03:50:48,792 INFO L290 TraceCheckUtils]: 5: Hoare triple {2502#true} ~x~0 := 0;~y~0 := 50000;~z~0 := 0;~x~0 := 0; {2510#(<= 50000 main_~y~0)} is VALID [2022-04-28 03:50:48,792 INFO L290 TraceCheckUtils]: 6: Hoare triple {2510#(<= 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_149 50001) (< v_main_~x~0_150 v_main_~x~0_149)) (and (not (< v_main_~x~0_150 50000)) (= v_main_~x~0_149 v_main_~x~0_150) .cse0) (and (= v_main_~x~0_150 v_main_~x~0_149) .cse0))) InVars {main_~x~0=v_main_~x~0_150, main_#t~post4=|v_main_#t~post4_41|} OutVars{main_~x~0=v_main_~x~0_149, main_#t~post4=|v_main_#t~post4_40|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {2510#(<= 50000 main_~y~0)} is VALID [2022-04-28 03:50:48,793 INFO L290 TraceCheckUtils]: 7: Hoare triple {2510#(<= 50000 main_~y~0)} [81] L18-1_primed-->L11-2: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2510#(<= 50000 main_~y~0)} is VALID [2022-04-28 03:50:48,793 INFO L290 TraceCheckUtils]: 8: Hoare triple {2510#(<= 50000 main_~y~0)} [82] L11-2-->L18-1_primed: Formula: (let ((.cse0 (<= 50000 v_main_~x~0_152)) (.cse1 (= |v_main_#t~post6_39| |v_main_#t~post6_38|)) (.cse2 (= v_main_~x~0_152 v_main_~x~0_151))) (or (and .cse0 (< v_main_~x~0_152 v_main_~x~0_151) (= (+ v_main_~x~0_151 v_main_~y~0_110) (+ v_main_~x~0_152 v_main_~y~0_109)) (< v_main_~x~0_151 1000001)) (and (= |v_main_#t~post5_38| |v_main_#t~post5_39|) .cse1 (or (not .cse0) (not (< v_main_~x~0_152 1000000))) .cse2 (= v_main_~y~0_109 v_main_~y~0_110)) (and .cse1 (= |v_main_#t~post5_39| |v_main_#t~post5_38|) .cse2 (= v_main_~y~0_110 v_main_~y~0_109)))) InVars {main_~y~0=v_main_~y~0_110, main_#t~post5=|v_main_#t~post5_39|, main_~x~0=v_main_~x~0_152, main_#t~post6=|v_main_#t~post6_39|} OutVars{main_~y~0=v_main_~y~0_109, main_#t~post5=|v_main_#t~post5_38|, main_~x~0=v_main_~x~0_151, main_#t~post6=|v_main_#t~post6_38|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {2510#(<= 50000 main_~y~0)} is VALID [2022-04-28 03:50:48,794 INFO L290 TraceCheckUtils]: 9: Hoare triple {2510#(<= 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[] {2510#(<= 50000 main_~y~0)} is VALID [2022-04-28 03:50:48,794 INFO L290 TraceCheckUtils]: 10: Hoare triple {2510#(<= 50000 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {2511#(<= 49998 main_~y~0)} is VALID [2022-04-28 03:50:48,795 INFO L290 TraceCheckUtils]: 11: Hoare triple {2511#(<= 49998 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {2512#(<= 49996 main_~y~0)} is VALID [2022-04-28 03:50:48,796 INFO L290 TraceCheckUtils]: 12: Hoare triple {2512#(<= 49996 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {2513#(<= 49994 main_~y~0)} is VALID [2022-04-28 03:50:48,796 INFO L290 TraceCheckUtils]: 13: Hoare triple {2513#(<= 49994 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {2514#(<= 49992 main_~y~0)} is VALID [2022-04-28 03:50:48,797 INFO L290 TraceCheckUtils]: 14: Hoare triple {2514#(<= 49992 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {2515#(<= 49990 main_~y~0)} is VALID [2022-04-28 03:50:48,798 INFO L290 TraceCheckUtils]: 15: Hoare triple {2515#(<= 49990 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {2516#(<= 49988 main_~y~0)} is VALID [2022-04-28 03:50:48,798 INFO L290 TraceCheckUtils]: 16: Hoare triple {2516#(<= 49988 main_~y~0)} assume !(~y~0 > 0); {2503#false} is VALID [2022-04-28 03:50:48,798 INFO L272 TraceCheckUtils]: 17: Hoare triple {2503#false} call __VERIFIER_assert((if ~z~0 == ~x~0 then 1 else 0)); {2503#false} is VALID [2022-04-28 03:50:48,798 INFO L290 TraceCheckUtils]: 18: Hoare triple {2503#false} ~cond := #in~cond; {2503#false} is VALID [2022-04-28 03:50:48,798 INFO L290 TraceCheckUtils]: 19: Hoare triple {2503#false} assume 0 == ~cond; {2503#false} is VALID [2022-04-28 03:50:48,798 INFO L290 TraceCheckUtils]: 20: Hoare triple {2503#false} assume !false; {2503#false} is VALID [2022-04-28 03:50:48,799 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-04-28 03:50:48,799 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 03:50:49,128 INFO L290 TraceCheckUtils]: 20: Hoare triple {2503#false} assume !false; {2503#false} is VALID [2022-04-28 03:50:49,129 INFO L290 TraceCheckUtils]: 19: Hoare triple {2503#false} assume 0 == ~cond; {2503#false} is VALID [2022-04-28 03:50:49,129 INFO L290 TraceCheckUtils]: 18: Hoare triple {2503#false} ~cond := #in~cond; {2503#false} is VALID [2022-04-28 03:50:49,129 INFO L272 TraceCheckUtils]: 17: Hoare triple {2503#false} call __VERIFIER_assert((if ~z~0 == ~x~0 then 1 else 0)); {2503#false} is VALID [2022-04-28 03:50:49,129 INFO L290 TraceCheckUtils]: 16: Hoare triple {2593#(< 0 main_~y~0)} assume !(~y~0 > 0); {2503#false} is VALID [2022-04-28 03:50:49,130 INFO L290 TraceCheckUtils]: 15: Hoare triple {2597#(< 2 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {2593#(< 0 main_~y~0)} is VALID [2022-04-28 03:50:49,130 INFO L290 TraceCheckUtils]: 14: Hoare triple {2601#(< 4 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {2597#(< 2 main_~y~0)} is VALID [2022-04-28 03:50:49,131 INFO L290 TraceCheckUtils]: 13: Hoare triple {2605#(< 6 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {2601#(< 4 main_~y~0)} is VALID [2022-04-28 03:50:49,131 INFO L290 TraceCheckUtils]: 12: Hoare triple {2609#(< 8 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {2605#(< 6 main_~y~0)} is VALID [2022-04-28 03:50:49,132 INFO L290 TraceCheckUtils]: 11: Hoare triple {2613#(< 10 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {2609#(< 8 main_~y~0)} is VALID [2022-04-28 03:50:49,132 INFO L290 TraceCheckUtils]: 10: Hoare triple {2617#(< 12 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {2613#(< 10 main_~y~0)} is VALID [2022-04-28 03:50:49,132 INFO L290 TraceCheckUtils]: 9: Hoare triple {2617#(< 12 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[] {2617#(< 12 main_~y~0)} is VALID [2022-04-28 03:50:49,133 INFO L290 TraceCheckUtils]: 8: Hoare triple {2617#(< 12 main_~y~0)} [82] L11-2-->L18-1_primed: Formula: (let ((.cse0 (<= 50000 v_main_~x~0_152)) (.cse1 (= |v_main_#t~post6_39| |v_main_#t~post6_38|)) (.cse2 (= v_main_~x~0_152 v_main_~x~0_151))) (or (and .cse0 (< v_main_~x~0_152 v_main_~x~0_151) (= (+ v_main_~x~0_151 v_main_~y~0_110) (+ v_main_~x~0_152 v_main_~y~0_109)) (< v_main_~x~0_151 1000001)) (and (= |v_main_#t~post5_38| |v_main_#t~post5_39|) .cse1 (or (not .cse0) (not (< v_main_~x~0_152 1000000))) .cse2 (= v_main_~y~0_109 v_main_~y~0_110)) (and .cse1 (= |v_main_#t~post5_39| |v_main_#t~post5_38|) .cse2 (= v_main_~y~0_110 v_main_~y~0_109)))) InVars {main_~y~0=v_main_~y~0_110, main_#t~post5=|v_main_#t~post5_39|, main_~x~0=v_main_~x~0_152, main_#t~post6=|v_main_#t~post6_39|} OutVars{main_~y~0=v_main_~y~0_109, main_#t~post5=|v_main_#t~post5_38|, main_~x~0=v_main_~x~0_151, main_#t~post6=|v_main_#t~post6_38|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {2617#(< 12 main_~y~0)} is VALID [2022-04-28 03:50:49,133 INFO L290 TraceCheckUtils]: 7: Hoare triple {2617#(< 12 main_~y~0)} [81] L18-1_primed-->L11-2: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2617#(< 12 main_~y~0)} is VALID [2022-04-28 03:50:49,134 INFO L290 TraceCheckUtils]: 6: Hoare triple {2617#(< 12 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_149 50001) (< v_main_~x~0_150 v_main_~x~0_149)) (and (not (< v_main_~x~0_150 50000)) (= v_main_~x~0_149 v_main_~x~0_150) .cse0) (and (= v_main_~x~0_150 v_main_~x~0_149) .cse0))) InVars {main_~x~0=v_main_~x~0_150, main_#t~post4=|v_main_#t~post4_41|} OutVars{main_~x~0=v_main_~x~0_149, main_#t~post4=|v_main_#t~post4_40|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {2617#(< 12 main_~y~0)} is VALID [2022-04-28 03:50:49,134 INFO L290 TraceCheckUtils]: 5: Hoare triple {2502#true} ~x~0 := 0;~y~0 := 50000;~z~0 := 0;~x~0 := 0; {2617#(< 12 main_~y~0)} is VALID [2022-04-28 03:50:49,134 INFO L272 TraceCheckUtils]: 4: Hoare triple {2502#true} call #t~ret7 := main(); {2502#true} is VALID [2022-04-28 03:50:49,134 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2502#true} {2502#true} #52#return; {2502#true} is VALID [2022-04-28 03:50:49,134 INFO L290 TraceCheckUtils]: 2: Hoare triple {2502#true} assume true; {2502#true} is VALID [2022-04-28 03:50:49,134 INFO L290 TraceCheckUtils]: 1: Hoare triple {2502#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); {2502#true} is VALID [2022-04-28 03:50:49,134 INFO L272 TraceCheckUtils]: 0: Hoare triple {2502#true} call ULTIMATE.init(); {2502#true} is VALID [2022-04-28 03:50:49,134 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-04-28 03:50:49,135 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1964303867] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 03:50:49,135 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 03:50:49,135 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 9, 9] total 20 [2022-04-28 03:50:49,492 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 03:50:49,492 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [113403324] [2022-04-28 03:50:49,493 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [113403324] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 03:50:49,493 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 03:50:49,493 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [23] imperfect sequences [] total 23 [2022-04-28 03:50:49,493 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [847299924] [2022-04-28 03:50:49,493 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 03:50:49,494 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 23 states have (on average 1.6521739130434783) internal successors, (38), 22 states have internal predecessors, (38), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 42 [2022-04-28 03:50:49,494 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 03:50:49,494 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 23 states, 23 states have (on average 1.6521739130434783) internal successors, (38), 22 states have internal predecessors, (38), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:50:49,521 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 42 edges. 42 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 03:50:49,522 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2022-04-28 03:50:49,522 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 03:50:49,522 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2022-04-28 03:50:49,522 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=396, Invalid=660, Unknown=0, NotChecked=0, Total=1056 [2022-04-28 03:50:49,523 INFO L87 Difference]: Start difference. First operand 43 states and 46 transitions. Second operand has 23 states, 23 states have (on average 1.6521739130434783) internal successors, (38), 22 states have internal predecessors, (38), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:50:50,595 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:50:50,595 INFO L93 Difference]: Finished difference Result 103 states and 114 transitions. [2022-04-28 03:50:50,595 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2022-04-28 03:50:50,595 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 23 states have (on average 1.6521739130434783) internal successors, (38), 22 states have internal predecessors, (38), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 42 [2022-04-28 03:50:50,596 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 03:50:50,596 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23 states, 23 states have (on average 1.6521739130434783) internal successors, (38), 22 states have internal predecessors, (38), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:50:50,597 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 64 transitions. [2022-04-28 03:50:50,597 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23 states, 23 states have (on average 1.6521739130434783) internal successors, (38), 22 states have internal predecessors, (38), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:50:50,598 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 64 transitions. [2022-04-28 03:50:50,598 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 23 states and 64 transitions. [2022-04-28 03:50:50,651 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 64 edges. 64 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 03:50:50,652 INFO L225 Difference]: With dead ends: 103 [2022-04-28 03:50:50,652 INFO L226 Difference]: Without dead ends: 68 [2022-04-28 03:50:50,653 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 104 GetRequests, 52 SyntacticMatches, 1 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 782 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=869, Invalid=1887, Unknown=0, NotChecked=0, Total=2756 [2022-04-28 03:50:50,654 INFO L413 NwaCegarLoop]: 12 mSDtfsCounter, 51 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 407 mSolverCounterSat, 57 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 51 SdHoareTripleChecker+Valid, 29 SdHoareTripleChecker+Invalid, 464 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 57 IncrementalHoareTripleChecker+Valid, 407 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-04-28 03:50:50,654 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [51 Valid, 29 Invalid, 464 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [57 Valid, 407 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-04-28 03:50:50,654 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2022-04-28 03:50:50,751 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 68. [2022-04-28 03:50:50,751 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 03:50:50,751 INFO L82 GeneralOperation]: Start isEquivalent. First operand 68 states. Second operand has 68 states, 63 states have (on average 1.0793650793650793) internal successors, (68), 63 states have internal predecessors, (68), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:50:50,751 INFO L74 IsIncluded]: Start isIncluded. First operand 68 states. Second operand has 68 states, 63 states have (on average 1.0793650793650793) internal successors, (68), 63 states have internal predecessors, (68), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:50:50,751 INFO L87 Difference]: Start difference. First operand 68 states. Second operand has 68 states, 63 states have (on average 1.0793650793650793) internal successors, (68), 63 states have internal predecessors, (68), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:50:50,753 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:50:50,753 INFO L93 Difference]: Finished difference Result 68 states and 72 transitions. [2022-04-28 03:50:50,753 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 72 transitions. [2022-04-28 03:50:50,753 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:50:50,753 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:50:50,753 INFO L74 IsIncluded]: Start isIncluded. First operand has 68 states, 63 states have (on average 1.0793650793650793) internal successors, (68), 63 states have internal predecessors, (68), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 68 states. [2022-04-28 03:50:50,753 INFO L87 Difference]: Start difference. First operand has 68 states, 63 states have (on average 1.0793650793650793) internal successors, (68), 63 states have internal predecessors, (68), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 68 states. [2022-04-28 03:50:50,754 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:50:50,754 INFO L93 Difference]: Finished difference Result 68 states and 72 transitions. [2022-04-28 03:50:50,754 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 72 transitions. [2022-04-28 03:50:50,755 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:50:50,755 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:50:50,755 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 03:50:50,755 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 03:50:50,755 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 68 states, 63 states have (on average 1.0793650793650793) internal successors, (68), 63 states have internal predecessors, (68), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:50:50,756 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 72 transitions. [2022-04-28 03:50:50,756 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 72 transitions. Word has length 42 [2022-04-28 03:50:50,756 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 03:50:50,756 INFO L495 AbstractCegarLoop]: Abstraction has 68 states and 72 transitions. [2022-04-28 03:50:50,756 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 1.6521739130434783) internal successors, (38), 22 states have internal predecessors, (38), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:50:50,756 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 68 states and 72 transitions. [2022-04-28 03:50:50,820 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 72 edges. 72 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 03:50:50,820 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 72 transitions. [2022-04-28 03:50:50,820 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2022-04-28 03:50:50,820 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 03:50:50,820 INFO L195 NwaCegarLoop]: trace histogram [13, 12, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 03:50:50,836 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2022-04-28 03:50:51,029 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 03:50:51,029 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 03:50:51,030 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 03:50:51,030 INFO L85 PathProgramCache]: Analyzing trace with hash -2018855923, now seen corresponding path program 7 times [2022-04-28 03:50:51,030 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 03:50:51,030 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [785740301] [2022-04-28 03:50:51,162 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 1 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 03:50:55,291 WARN L977 rdanLoopAcceleration]: Unable to prove correctness of quantifier elimination. [2022-04-28 03:50:55,390 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={1=1, 2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 03:50:55,391 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-28 03:50:55,396 INFO L85 PathProgramCache]: Analyzing trace with hash -594285534, now seen corresponding path program 1 times [2022-04-28 03:50:55,397 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 03:50:55,397 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1076192636] [2022-04-28 03:50:55,397 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:50:55,397 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 03:50:55,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:50:55,495 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 03:50:55,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:50:55,499 INFO L290 TraceCheckUtils]: 0: Hoare triple {3194#(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); {3181#true} is VALID [2022-04-28 03:50:55,499 INFO L290 TraceCheckUtils]: 1: Hoare triple {3181#true} assume true; {3181#true} is VALID [2022-04-28 03:50:55,499 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {3181#true} {3181#true} #52#return; {3181#true} is VALID [2022-04-28 03:50:55,500 INFO L272 TraceCheckUtils]: 0: Hoare triple {3181#true} call ULTIMATE.init(); {3194#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 03:50:55,500 INFO L290 TraceCheckUtils]: 1: Hoare triple {3194#(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); {3181#true} is VALID [2022-04-28 03:50:55,500 INFO L290 TraceCheckUtils]: 2: Hoare triple {3181#true} assume true; {3181#true} is VALID [2022-04-28 03:50:55,500 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3181#true} {3181#true} #52#return; {3181#true} is VALID [2022-04-28 03:50:55,500 INFO L272 TraceCheckUtils]: 4: Hoare triple {3181#true} call #t~ret7 := main(); {3181#true} is VALID [2022-04-28 03:50:55,500 INFO L290 TraceCheckUtils]: 5: Hoare triple {3181#true} ~x~0 := 0;~y~0 := 50000;~z~0 := 0;~x~0 := 0; {3186#(<= 50000 main_~y~0)} is VALID [2022-04-28 03:50:55,501 INFO L290 TraceCheckUtils]: 6: Hoare triple {3186#(<= 50000 main_~y~0)} [84] L11-2-->L18-1_primed: Formula: (let ((.cse0 (= |v_main_#t~post4_47| |v_main_#t~post4_46|)) (.cse1 (= v_main_~x~0_184 v_main_~x~0_183))) (or (and .cse0 (<= 50000 v_main_~x~0_184) .cse1) (and .cse0 .cse1) (and (< v_main_~x~0_183 50001) (< v_main_~x~0_184 v_main_~x~0_183)))) InVars {main_~x~0=v_main_~x~0_184, main_#t~post4=|v_main_#t~post4_47|} OutVars{main_~x~0=v_main_~x~0_183, main_#t~post4=|v_main_#t~post4_46|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {3186#(<= 50000 main_~y~0)} is VALID [2022-04-28 03:50:55,501 INFO L290 TraceCheckUtils]: 7: Hoare triple {3186#(<= 50000 main_~y~0)} [85] L18-1_primed-->L11-2: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {3186#(<= 50000 main_~y~0)} is VALID [2022-04-28 03:50:55,502 INFO L290 TraceCheckUtils]: 8: Hoare triple {3186#(<= 50000 main_~y~0)} [86] L11-2-->L18-1_primed: Formula: (let ((.cse1 (<= 50000 v_main_~x~0_186)) (.cse0 (= v_main_~x~0_186 v_main_~x~0_185)) (.cse2 (= |v_main_#t~post5_46| |v_main_#t~post5_45|)) (.cse3 (= v_main_~y~0_142 v_main_~y~0_141)) (.cse4 (= |v_main_#t~post6_46| |v_main_#t~post6_45|))) (or (and .cse0 (or (not (< v_main_~x~0_186 1000000)) (not .cse1)) .cse2 .cse3 .cse4) (let ((.cse5 (+ v_main_~x~0_186 v_main_~y~0_141))) (and .cse1 (< v_main_~y~0_142 v_main_~y~0_141) (< .cse5 (+ v_main_~y~0_142 1000001)) (= .cse5 (+ v_main_~x~0_185 v_main_~y~0_142)))) (and .cse0 .cse2 .cse3 .cse4))) InVars {main_~y~0=v_main_~y~0_142, main_#t~post5=|v_main_#t~post5_46|, main_~x~0=v_main_~x~0_186, main_#t~post6=|v_main_#t~post6_46|} OutVars{main_~y~0=v_main_~y~0_141, main_#t~post5=|v_main_#t~post5_45|, main_~x~0=v_main_~x~0_185, main_#t~post6=|v_main_#t~post6_45|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {3186#(<= 50000 main_~y~0)} is VALID [2022-04-28 03:50:55,502 INFO L290 TraceCheckUtils]: 9: Hoare triple {3186#(<= 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[] {3186#(<= 50000 main_~y~0)} is VALID [2022-04-28 03:50:55,502 INFO L290 TraceCheckUtils]: 10: Hoare triple {3186#(<= 50000 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {3187#(<= 49998 main_~y~0)} is VALID [2022-04-28 03:50:55,503 INFO L290 TraceCheckUtils]: 11: Hoare triple {3187#(<= 49998 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {3188#(<= 49996 main_~y~0)} is VALID [2022-04-28 03:50:55,503 INFO L290 TraceCheckUtils]: 12: Hoare triple {3188#(<= 49996 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {3189#(<= 49994 main_~y~0)} is VALID [2022-04-28 03:50:55,504 INFO L290 TraceCheckUtils]: 13: Hoare triple {3189#(<= 49994 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {3190#(<= 49992 main_~y~0)} is VALID [2022-04-28 03:50:55,504 INFO L290 TraceCheckUtils]: 14: Hoare triple {3190#(<= 49992 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {3191#(<= 49990 main_~y~0)} is VALID [2022-04-28 03:50:55,505 INFO L290 TraceCheckUtils]: 15: Hoare triple {3191#(<= 49990 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {3192#(<= 49988 main_~y~0)} is VALID [2022-04-28 03:50:55,505 INFO L290 TraceCheckUtils]: 16: Hoare triple {3192#(<= 49988 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {3193#(<= 49986 main_~y~0)} is VALID [2022-04-28 03:50:55,506 INFO L290 TraceCheckUtils]: 17: Hoare triple {3193#(<= 49986 main_~y~0)} assume !(~y~0 > 0); {3182#false} is VALID [2022-04-28 03:50:55,506 INFO L272 TraceCheckUtils]: 18: Hoare triple {3182#false} call __VERIFIER_assert((if ~z~0 == ~x~0 then 1 else 0)); {3182#false} is VALID [2022-04-28 03:50:55,506 INFO L290 TraceCheckUtils]: 19: Hoare triple {3182#false} ~cond := #in~cond; {3182#false} is VALID [2022-04-28 03:50:55,506 INFO L290 TraceCheckUtils]: 20: Hoare triple {3182#false} assume 0 == ~cond; {3182#false} is VALID [2022-04-28 03:50:55,506 INFO L290 TraceCheckUtils]: 21: Hoare triple {3182#false} assume !false; {3182#false} is VALID [2022-04-28 03:50:55,506 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-04-28 03:50:55,506 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 03:50:55,506 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1076192636] [2022-04-28 03:50:55,506 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1076192636] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 03:50:55,506 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1329260625] [2022-04-28 03:50:55,506 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:50:55,507 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 03:50:55,507 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 03:50:55,510 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 03:50:55,510 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2022-04-28 03:50:55,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:50:55,539 INFO L263 TraceCheckSpWp]: Trace formula consists of 94 conjuncts, 10 conjunts are in the unsatisfiable core [2022-04-28 03:50:55,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:50:55,548 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 03:50:55,806 INFO L272 TraceCheckUtils]: 0: Hoare triple {3181#true} call ULTIMATE.init(); {3181#true} is VALID [2022-04-28 03:50:55,806 INFO L290 TraceCheckUtils]: 1: Hoare triple {3181#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); {3181#true} is VALID [2022-04-28 03:50:55,807 INFO L290 TraceCheckUtils]: 2: Hoare triple {3181#true} assume true; {3181#true} is VALID [2022-04-28 03:50:55,807 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3181#true} {3181#true} #52#return; {3181#true} is VALID [2022-04-28 03:50:55,807 INFO L272 TraceCheckUtils]: 4: Hoare triple {3181#true} call #t~ret7 := main(); {3181#true} is VALID [2022-04-28 03:50:55,808 INFO L290 TraceCheckUtils]: 5: Hoare triple {3181#true} ~x~0 := 0;~y~0 := 50000;~z~0 := 0;~x~0 := 0; {3186#(<= 50000 main_~y~0)} is VALID [2022-04-28 03:50:55,808 INFO L290 TraceCheckUtils]: 6: Hoare triple {3186#(<= 50000 main_~y~0)} [84] L11-2-->L18-1_primed: Formula: (let ((.cse0 (= |v_main_#t~post4_47| |v_main_#t~post4_46|)) (.cse1 (= v_main_~x~0_184 v_main_~x~0_183))) (or (and .cse0 (<= 50000 v_main_~x~0_184) .cse1) (and .cse0 .cse1) (and (< v_main_~x~0_183 50001) (< v_main_~x~0_184 v_main_~x~0_183)))) InVars {main_~x~0=v_main_~x~0_184, main_#t~post4=|v_main_#t~post4_47|} OutVars{main_~x~0=v_main_~x~0_183, main_#t~post4=|v_main_#t~post4_46|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {3186#(<= 50000 main_~y~0)} is VALID [2022-04-28 03:50:55,808 INFO L290 TraceCheckUtils]: 7: Hoare triple {3186#(<= 50000 main_~y~0)} [85] L18-1_primed-->L11-2: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {3186#(<= 50000 main_~y~0)} is VALID [2022-04-28 03:50:55,809 INFO L290 TraceCheckUtils]: 8: Hoare triple {3186#(<= 50000 main_~y~0)} [86] L11-2-->L18-1_primed: Formula: (let ((.cse1 (<= 50000 v_main_~x~0_186)) (.cse0 (= v_main_~x~0_186 v_main_~x~0_185)) (.cse2 (= |v_main_#t~post5_46| |v_main_#t~post5_45|)) (.cse3 (= v_main_~y~0_142 v_main_~y~0_141)) (.cse4 (= |v_main_#t~post6_46| |v_main_#t~post6_45|))) (or (and .cse0 (or (not (< v_main_~x~0_186 1000000)) (not .cse1)) .cse2 .cse3 .cse4) (let ((.cse5 (+ v_main_~x~0_186 v_main_~y~0_141))) (and .cse1 (< v_main_~y~0_142 v_main_~y~0_141) (< .cse5 (+ v_main_~y~0_142 1000001)) (= .cse5 (+ v_main_~x~0_185 v_main_~y~0_142)))) (and .cse0 .cse2 .cse3 .cse4))) InVars {main_~y~0=v_main_~y~0_142, main_#t~post5=|v_main_#t~post5_46|, main_~x~0=v_main_~x~0_186, main_#t~post6=|v_main_#t~post6_46|} OutVars{main_~y~0=v_main_~y~0_141, main_#t~post5=|v_main_#t~post5_45|, main_~x~0=v_main_~x~0_185, main_#t~post6=|v_main_#t~post6_45|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {3186#(<= 50000 main_~y~0)} is VALID [2022-04-28 03:50:55,810 INFO L290 TraceCheckUtils]: 9: Hoare triple {3186#(<= 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[] {3186#(<= 50000 main_~y~0)} is VALID [2022-04-28 03:50:55,810 INFO L290 TraceCheckUtils]: 10: Hoare triple {3186#(<= 50000 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {3187#(<= 49998 main_~y~0)} is VALID [2022-04-28 03:50:55,810 INFO L290 TraceCheckUtils]: 11: Hoare triple {3187#(<= 49998 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {3188#(<= 49996 main_~y~0)} is VALID [2022-04-28 03:50:55,811 INFO L290 TraceCheckUtils]: 12: Hoare triple {3188#(<= 49996 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {3189#(<= 49994 main_~y~0)} is VALID [2022-04-28 03:50:55,812 INFO L290 TraceCheckUtils]: 13: Hoare triple {3189#(<= 49994 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {3190#(<= 49992 main_~y~0)} is VALID [2022-04-28 03:50:55,812 INFO L290 TraceCheckUtils]: 14: Hoare triple {3190#(<= 49992 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {3191#(<= 49990 main_~y~0)} is VALID [2022-04-28 03:50:55,813 INFO L290 TraceCheckUtils]: 15: Hoare triple {3191#(<= 49990 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {3192#(<= 49988 main_~y~0)} is VALID [2022-04-28 03:50:55,814 INFO L290 TraceCheckUtils]: 16: Hoare triple {3192#(<= 49988 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {3193#(<= 49986 main_~y~0)} is VALID [2022-04-28 03:50:55,815 INFO L290 TraceCheckUtils]: 17: Hoare triple {3193#(<= 49986 main_~y~0)} assume !(~y~0 > 0); {3182#false} is VALID [2022-04-28 03:50:55,815 INFO L272 TraceCheckUtils]: 18: Hoare triple {3182#false} call __VERIFIER_assert((if ~z~0 == ~x~0 then 1 else 0)); {3182#false} is VALID [2022-04-28 03:50:55,815 INFO L290 TraceCheckUtils]: 19: Hoare triple {3182#false} ~cond := #in~cond; {3182#false} is VALID [2022-04-28 03:50:55,815 INFO L290 TraceCheckUtils]: 20: Hoare triple {3182#false} assume 0 == ~cond; {3182#false} is VALID [2022-04-28 03:50:55,815 INFO L290 TraceCheckUtils]: 21: Hoare triple {3182#false} assume !false; {3182#false} is VALID [2022-04-28 03:50:55,815 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-04-28 03:50:55,815 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 03:50:56,138 INFO L290 TraceCheckUtils]: 21: Hoare triple {3182#false} assume !false; {3182#false} is VALID [2022-04-28 03:50:56,138 INFO L290 TraceCheckUtils]: 20: Hoare triple {3182#false} assume 0 == ~cond; {3182#false} is VALID [2022-04-28 03:50:56,139 INFO L290 TraceCheckUtils]: 19: Hoare triple {3182#false} ~cond := #in~cond; {3182#false} is VALID [2022-04-28 03:50:56,139 INFO L272 TraceCheckUtils]: 18: Hoare triple {3182#false} call __VERIFIER_assert((if ~z~0 == ~x~0 then 1 else 0)); {3182#false} is VALID [2022-04-28 03:50:56,139 INFO L290 TraceCheckUtils]: 17: Hoare triple {3273#(< 0 main_~y~0)} assume !(~y~0 > 0); {3182#false} is VALID [2022-04-28 03:50:56,139 INFO L290 TraceCheckUtils]: 16: Hoare triple {3277#(< 2 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {3273#(< 0 main_~y~0)} is VALID [2022-04-28 03:50:56,140 INFO L290 TraceCheckUtils]: 15: Hoare triple {3281#(< 4 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {3277#(< 2 main_~y~0)} is VALID [2022-04-28 03:50:56,140 INFO L290 TraceCheckUtils]: 14: Hoare triple {3285#(< 6 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {3281#(< 4 main_~y~0)} is VALID [2022-04-28 03:50:56,141 INFO L290 TraceCheckUtils]: 13: Hoare triple {3289#(< 8 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {3285#(< 6 main_~y~0)} is VALID [2022-04-28 03:50:56,141 INFO L290 TraceCheckUtils]: 12: Hoare triple {3293#(< 10 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {3289#(< 8 main_~y~0)} is VALID [2022-04-28 03:50:56,142 INFO L290 TraceCheckUtils]: 11: Hoare triple {3297#(< 12 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {3293#(< 10 main_~y~0)} is VALID [2022-04-28 03:50:56,142 INFO L290 TraceCheckUtils]: 10: Hoare triple {3301#(< 14 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {3297#(< 12 main_~y~0)} is VALID [2022-04-28 03:50:56,142 INFO L290 TraceCheckUtils]: 9: Hoare triple {3301#(< 14 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[] {3301#(< 14 main_~y~0)} is VALID [2022-04-28 03:50:56,143 INFO L290 TraceCheckUtils]: 8: Hoare triple {3301#(< 14 main_~y~0)} [86] L11-2-->L18-1_primed: Formula: (let ((.cse1 (<= 50000 v_main_~x~0_186)) (.cse0 (= v_main_~x~0_186 v_main_~x~0_185)) (.cse2 (= |v_main_#t~post5_46| |v_main_#t~post5_45|)) (.cse3 (= v_main_~y~0_142 v_main_~y~0_141)) (.cse4 (= |v_main_#t~post6_46| |v_main_#t~post6_45|))) (or (and .cse0 (or (not (< v_main_~x~0_186 1000000)) (not .cse1)) .cse2 .cse3 .cse4) (let ((.cse5 (+ v_main_~x~0_186 v_main_~y~0_141))) (and .cse1 (< v_main_~y~0_142 v_main_~y~0_141) (< .cse5 (+ v_main_~y~0_142 1000001)) (= .cse5 (+ v_main_~x~0_185 v_main_~y~0_142)))) (and .cse0 .cse2 .cse3 .cse4))) InVars {main_~y~0=v_main_~y~0_142, main_#t~post5=|v_main_#t~post5_46|, main_~x~0=v_main_~x~0_186, main_#t~post6=|v_main_#t~post6_46|} OutVars{main_~y~0=v_main_~y~0_141, main_#t~post5=|v_main_#t~post5_45|, main_~x~0=v_main_~x~0_185, main_#t~post6=|v_main_#t~post6_45|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {3301#(< 14 main_~y~0)} is VALID [2022-04-28 03:50:56,143 INFO L290 TraceCheckUtils]: 7: Hoare triple {3301#(< 14 main_~y~0)} [85] L18-1_primed-->L11-2: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {3301#(< 14 main_~y~0)} is VALID [2022-04-28 03:50:56,144 INFO L290 TraceCheckUtils]: 6: Hoare triple {3301#(< 14 main_~y~0)} [84] L11-2-->L18-1_primed: Formula: (let ((.cse0 (= |v_main_#t~post4_47| |v_main_#t~post4_46|)) (.cse1 (= v_main_~x~0_184 v_main_~x~0_183))) (or (and .cse0 (<= 50000 v_main_~x~0_184) .cse1) (and .cse0 .cse1) (and (< v_main_~x~0_183 50001) (< v_main_~x~0_184 v_main_~x~0_183)))) InVars {main_~x~0=v_main_~x~0_184, main_#t~post4=|v_main_#t~post4_47|} OutVars{main_~x~0=v_main_~x~0_183, main_#t~post4=|v_main_#t~post4_46|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {3301#(< 14 main_~y~0)} is VALID [2022-04-28 03:50:56,144 INFO L290 TraceCheckUtils]: 5: Hoare triple {3181#true} ~x~0 := 0;~y~0 := 50000;~z~0 := 0;~x~0 := 0; {3301#(< 14 main_~y~0)} is VALID [2022-04-28 03:50:56,144 INFO L272 TraceCheckUtils]: 4: Hoare triple {3181#true} call #t~ret7 := main(); {3181#true} is VALID [2022-04-28 03:50:56,144 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3181#true} {3181#true} #52#return; {3181#true} is VALID [2022-04-28 03:50:56,144 INFO L290 TraceCheckUtils]: 2: Hoare triple {3181#true} assume true; {3181#true} is VALID [2022-04-28 03:50:56,144 INFO L290 TraceCheckUtils]: 1: Hoare triple {3181#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); {3181#true} is VALID [2022-04-28 03:50:56,144 INFO L272 TraceCheckUtils]: 0: Hoare triple {3181#true} call ULTIMATE.init(); {3181#true} is VALID [2022-04-28 03:50:56,144 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-04-28 03:50:56,145 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1329260625] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 03:50:56,145 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 03:50:56,145 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10, 10] total 19 [2022-04-28 03:50:56,549 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 03:50:56,549 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [785740301] [2022-04-28 03:50:56,549 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [785740301] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 03:50:56,549 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 03:50:56,549 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [25] imperfect sequences [] total 25 [2022-04-28 03:50:56,549 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1680715212] [2022-04-28 03:50:56,549 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 03:50:56,550 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 25 states have (on average 1.64) internal successors, (41), 24 states have internal predecessors, (41), 2 states have call successors, (3), 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 45 [2022-04-28 03:50:56,550 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 03:50:56,550 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 25 states, 25 states have (on average 1.64) internal successors, (41), 24 states have internal predecessors, (41), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:50:56,584 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 45 edges. 45 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 03:50:56,584 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2022-04-28 03:50:56,584 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 03:50:56,585 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2022-04-28 03:50:56,585 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=420, Invalid=636, Unknown=0, NotChecked=0, Total=1056 [2022-04-28 03:50:56,585 INFO L87 Difference]: Start difference. First operand 68 states and 72 transitions. Second operand has 25 states, 25 states have (on average 1.64) internal successors, (41), 24 states have internal predecessors, (41), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:50:57,647 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:50:57,648 INFO L93 Difference]: Finished difference Result 111 states and 125 transitions. [2022-04-28 03:50:57,648 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2022-04-28 03:50:57,648 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 25 states have (on average 1.64) internal successors, (41), 24 states have internal predecessors, (41), 2 states have call successors, (3), 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 45 [2022-04-28 03:50:57,648 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 03:50:57,648 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25 states, 25 states have (on average 1.64) internal successors, (41), 24 states have internal predecessors, (41), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:50:57,649 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 69 transitions. [2022-04-28 03:50:57,649 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25 states, 25 states have (on average 1.64) internal successors, (41), 24 states have internal predecessors, (41), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:50:57,650 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 69 transitions. [2022-04-28 03:50:57,650 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 25 states and 69 transitions. [2022-04-28 03:50:57,706 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 69 edges. 69 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 03:50:57,707 INFO L225 Difference]: With dead ends: 111 [2022-04-28 03:50:57,707 INFO L226 Difference]: Without dead ends: 75 [2022-04-28 03:50:57,708 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 109 GetRequests, 55 SyntacticMatches, 1 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 799 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=990, Invalid=1980, Unknown=0, NotChecked=0, Total=2970 [2022-04-28 03:50:57,709 INFO L413 NwaCegarLoop]: 12 mSDtfsCounter, 55 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 393 mSolverCounterSat, 80 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 55 SdHoareTripleChecker+Valid, 24 SdHoareTripleChecker+Invalid, 473 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 80 IncrementalHoareTripleChecker+Valid, 393 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-04-28 03:50:57,709 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [55 Valid, 24 Invalid, 473 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [80 Valid, 393 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-04-28 03:50:57,709 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2022-04-28 03:50:57,787 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 51. [2022-04-28 03:50:57,787 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 03:50:57,787 INFO L82 GeneralOperation]: Start isEquivalent. First operand 75 states. Second operand has 51 states, 46 states have (on average 1.0869565217391304) internal successors, (50), 46 states have internal predecessors, (50), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:50:57,788 INFO L74 IsIncluded]: Start isIncluded. First operand 75 states. Second operand has 51 states, 46 states have (on average 1.0869565217391304) internal successors, (50), 46 states have internal predecessors, (50), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:50:57,788 INFO L87 Difference]: Start difference. First operand 75 states. Second operand has 51 states, 46 states have (on average 1.0869565217391304) internal successors, (50), 46 states have internal predecessors, (50), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:50:57,789 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:50:57,789 INFO L93 Difference]: Finished difference Result 75 states and 79 transitions. [2022-04-28 03:50:57,789 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 79 transitions. [2022-04-28 03:50:57,789 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:50:57,790 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:50:57,790 INFO L74 IsIncluded]: Start isIncluded. First operand has 51 states, 46 states have (on average 1.0869565217391304) internal successors, (50), 46 states have internal predecessors, (50), 3 states have call successors, (3), 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 75 states. [2022-04-28 03:50:57,790 INFO L87 Difference]: Start difference. First operand has 51 states, 46 states have (on average 1.0869565217391304) internal successors, (50), 46 states have internal predecessors, (50), 3 states have call successors, (3), 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 75 states. [2022-04-28 03:50:57,791 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:50:57,791 INFO L93 Difference]: Finished difference Result 75 states and 79 transitions. [2022-04-28 03:50:57,791 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 79 transitions. [2022-04-28 03:50:57,791 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:50:57,791 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:50:57,791 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 03:50:57,791 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 03:50:57,791 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 51 states, 46 states have (on average 1.0869565217391304) internal successors, (50), 46 states have internal predecessors, (50), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:50:57,792 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 54 transitions. [2022-04-28 03:50:57,792 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 54 transitions. Word has length 45 [2022-04-28 03:50:57,792 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 03:50:57,792 INFO L495 AbstractCegarLoop]: Abstraction has 51 states and 54 transitions. [2022-04-28 03:50:57,792 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 25 states have (on average 1.64) internal successors, (41), 24 states have internal predecessors, (41), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:50:57,792 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 51 states and 54 transitions. [2022-04-28 03:50:57,844 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 54 edges. 54 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 03:50:57,844 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 54 transitions. [2022-04-28 03:50:57,845 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2022-04-28 03:50:57,845 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 03:50:57,845 INFO L195 NwaCegarLoop]: trace histogram [15, 14, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 03:50:57,865 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2022-04-28 03:50:58,047 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 03:50:58,048 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 03:50:58,049 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 03:50:58,049 INFO L85 PathProgramCache]: Analyzing trace with hash -307063488, now seen corresponding path program 8 times [2022-04-28 03:50:58,049 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 03:50:58,049 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [2001865583] [2022-04-28 03:50:58,215 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 1 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 03:50:58,415 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={1=1, 2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 03:50:58,416 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-28 03:50:58,418 INFO L85 PathProgramCache]: Analyzing trace with hash 1876662913, now seen corresponding path program 1 times [2022-04-28 03:50:58,418 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 03:50:58,418 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [911705454] [2022-04-28 03:50:58,418 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:50:58,418 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 03:50:58,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:50:58,558 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 03:50:58,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:50:58,563 INFO L290 TraceCheckUtils]: 0: Hoare triple {3880#(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); {3866#true} is VALID [2022-04-28 03:50:58,564 INFO L290 TraceCheckUtils]: 1: Hoare triple {3866#true} assume true; {3866#true} is VALID [2022-04-28 03:50:58,564 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {3866#true} {3866#true} #52#return; {3866#true} is VALID [2022-04-28 03:50:58,564 INFO L272 TraceCheckUtils]: 0: Hoare triple {3866#true} call ULTIMATE.init(); {3880#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 03:50:58,564 INFO L290 TraceCheckUtils]: 1: Hoare triple {3880#(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); {3866#true} is VALID [2022-04-28 03:50:58,564 INFO L290 TraceCheckUtils]: 2: Hoare triple {3866#true} assume true; {3866#true} is VALID [2022-04-28 03:50:58,564 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3866#true} {3866#true} #52#return; {3866#true} is VALID [2022-04-28 03:50:58,564 INFO L272 TraceCheckUtils]: 4: Hoare triple {3866#true} call #t~ret7 := main(); {3866#true} is VALID [2022-04-28 03:50:58,565 INFO L290 TraceCheckUtils]: 5: Hoare triple {3866#true} ~x~0 := 0;~y~0 := 50000;~z~0 := 0;~x~0 := 0; {3871#(<= 50000 main_~y~0)} is VALID [2022-04-28 03:50:58,565 INFO L290 TraceCheckUtils]: 6: Hoare triple {3871#(<= 50000 main_~y~0)} [88] L11-2-->L18-1_primed: Formula: (let ((.cse0 (= |v_main_#t~post4_53| |v_main_#t~post4_52|))) (or (and (not (< v_main_~x~0_220 50000)) (= v_main_~x~0_219 v_main_~x~0_220) .cse0) (and (= v_main_~x~0_220 v_main_~x~0_219) .cse0) (and (< v_main_~x~0_220 v_main_~x~0_219) (< v_main_~x~0_219 50001)))) InVars {main_~x~0=v_main_~x~0_220, main_#t~post4=|v_main_#t~post4_53|} OutVars{main_~x~0=v_main_~x~0_219, main_#t~post4=|v_main_#t~post4_52|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {3871#(<= 50000 main_~y~0)} is VALID [2022-04-28 03:50:58,565 INFO L290 TraceCheckUtils]: 7: Hoare triple {3871#(<= 50000 main_~y~0)} [89] L18-1_primed-->L11-2: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {3871#(<= 50000 main_~y~0)} is VALID [2022-04-28 03:50:58,566 INFO L290 TraceCheckUtils]: 8: Hoare triple {3871#(<= 50000 main_~y~0)} [90] L11-2-->L18-1_primed: Formula: (let ((.cse5 (<= 50000 v_main_~x~0_222)) (.cse0 (= |v_main_#t~post5_53| |v_main_#t~post5_52|)) (.cse1 (= |v_main_#t~post6_53| |v_main_#t~post6_52|)) (.cse2 (= v_main_~x~0_222 v_main_~x~0_221)) (.cse3 (= v_main_~y~0_177 v_main_~y~0_176))) (or (and .cse0 .cse1 .cse2 .cse3) (let ((.cse4 (+ v_main_~x~0_222 v_main_~y~0_176))) (and (= .cse4 (+ v_main_~x~0_221 v_main_~y~0_177)) .cse5 (< v_main_~y~0_177 v_main_~y~0_176) (< .cse4 (+ v_main_~y~0_177 1000001)))) (and (or (not .cse5) (not (< v_main_~x~0_222 1000000))) .cse0 .cse1 .cse2 .cse3))) InVars {main_~y~0=v_main_~y~0_177, main_#t~post5=|v_main_#t~post5_53|, main_~x~0=v_main_~x~0_222, main_#t~post6=|v_main_#t~post6_53|} OutVars{main_~y~0=v_main_~y~0_176, main_#t~post5=|v_main_#t~post5_52|, main_~x~0=v_main_~x~0_221, main_#t~post6=|v_main_#t~post6_52|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {3871#(<= 50000 main_~y~0)} is VALID [2022-04-28 03:50:58,566 INFO L290 TraceCheckUtils]: 9: Hoare triple {3871#(<= 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[] {3871#(<= 50000 main_~y~0)} is VALID [2022-04-28 03:50:58,567 INFO L290 TraceCheckUtils]: 10: Hoare triple {3871#(<= 50000 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {3872#(<= 49998 main_~y~0)} is VALID [2022-04-28 03:50:58,567 INFO L290 TraceCheckUtils]: 11: Hoare triple {3872#(<= 49998 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {3873#(<= 49996 main_~y~0)} is VALID [2022-04-28 03:50:58,568 INFO L290 TraceCheckUtils]: 12: Hoare triple {3873#(<= 49996 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {3874#(<= 49994 main_~y~0)} is VALID [2022-04-28 03:50:58,568 INFO L290 TraceCheckUtils]: 13: Hoare triple {3874#(<= 49994 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {3875#(<= 49992 main_~y~0)} is VALID [2022-04-28 03:50:58,569 INFO L290 TraceCheckUtils]: 14: Hoare triple {3875#(<= 49992 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {3876#(<= 49990 main_~y~0)} is VALID [2022-04-28 03:50:58,569 INFO L290 TraceCheckUtils]: 15: Hoare triple {3876#(<= 49990 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {3877#(<= 49988 main_~y~0)} is VALID [2022-04-28 03:50:58,570 INFO L290 TraceCheckUtils]: 16: Hoare triple {3877#(<= 49988 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {3878#(<= 49986 main_~y~0)} is VALID [2022-04-28 03:50:58,570 INFO L290 TraceCheckUtils]: 17: Hoare triple {3878#(<= 49986 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {3879#(<= 49984 main_~y~0)} is VALID [2022-04-28 03:50:58,570 INFO L290 TraceCheckUtils]: 18: Hoare triple {3879#(<= 49984 main_~y~0)} assume !(~y~0 > 0); {3867#false} is VALID [2022-04-28 03:50:58,570 INFO L272 TraceCheckUtils]: 19: Hoare triple {3867#false} call __VERIFIER_assert((if ~z~0 == ~x~0 then 1 else 0)); {3867#false} is VALID [2022-04-28 03:50:58,571 INFO L290 TraceCheckUtils]: 20: Hoare triple {3867#false} ~cond := #in~cond; {3867#false} is VALID [2022-04-28 03:50:58,571 INFO L290 TraceCheckUtils]: 21: Hoare triple {3867#false} assume 0 == ~cond; {3867#false} is VALID [2022-04-28 03:50:58,571 INFO L290 TraceCheckUtils]: 22: Hoare triple {3867#false} assume !false; {3867#false} is VALID [2022-04-28 03:50:58,571 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-04-28 03:50:58,571 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 03:50:58,571 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [911705454] [2022-04-28 03:50:58,571 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [911705454] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 03:50:58,571 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [154619048] [2022-04-28 03:50:58,571 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:50:58,571 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 03:50:58,571 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 03:50:58,572 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 03:50:58,573 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2022-04-28 03:50:58,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:50:58,607 INFO L263 TraceCheckSpWp]: Trace formula consists of 99 conjuncts, 11 conjunts are in the unsatisfiable core [2022-04-28 03:50:58,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:50:58,632 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 03:50:58,902 INFO L272 TraceCheckUtils]: 0: Hoare triple {3866#true} call ULTIMATE.init(); {3866#true} is VALID [2022-04-28 03:50:58,902 INFO L290 TraceCheckUtils]: 1: Hoare triple {3866#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); {3866#true} is VALID [2022-04-28 03:50:58,902 INFO L290 TraceCheckUtils]: 2: Hoare triple {3866#true} assume true; {3866#true} is VALID [2022-04-28 03:50:58,902 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3866#true} {3866#true} #52#return; {3866#true} is VALID [2022-04-28 03:50:58,902 INFO L272 TraceCheckUtils]: 4: Hoare triple {3866#true} call #t~ret7 := main(); {3866#true} is VALID [2022-04-28 03:50:58,903 INFO L290 TraceCheckUtils]: 5: Hoare triple {3866#true} ~x~0 := 0;~y~0 := 50000;~z~0 := 0;~x~0 := 0; {3871#(<= 50000 main_~y~0)} is VALID [2022-04-28 03:50:58,903 INFO L290 TraceCheckUtils]: 6: Hoare triple {3871#(<= 50000 main_~y~0)} [88] L11-2-->L18-1_primed: Formula: (let ((.cse0 (= |v_main_#t~post4_53| |v_main_#t~post4_52|))) (or (and (not (< v_main_~x~0_220 50000)) (= v_main_~x~0_219 v_main_~x~0_220) .cse0) (and (= v_main_~x~0_220 v_main_~x~0_219) .cse0) (and (< v_main_~x~0_220 v_main_~x~0_219) (< v_main_~x~0_219 50001)))) InVars {main_~x~0=v_main_~x~0_220, main_#t~post4=|v_main_#t~post4_53|} OutVars{main_~x~0=v_main_~x~0_219, main_#t~post4=|v_main_#t~post4_52|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {3871#(<= 50000 main_~y~0)} is VALID [2022-04-28 03:50:58,904 INFO L290 TraceCheckUtils]: 7: Hoare triple {3871#(<= 50000 main_~y~0)} [89] L18-1_primed-->L11-2: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {3871#(<= 50000 main_~y~0)} is VALID [2022-04-28 03:50:58,905 INFO L290 TraceCheckUtils]: 8: Hoare triple {3871#(<= 50000 main_~y~0)} [90] L11-2-->L18-1_primed: Formula: (let ((.cse5 (<= 50000 v_main_~x~0_222)) (.cse0 (= |v_main_#t~post5_53| |v_main_#t~post5_52|)) (.cse1 (= |v_main_#t~post6_53| |v_main_#t~post6_52|)) (.cse2 (= v_main_~x~0_222 v_main_~x~0_221)) (.cse3 (= v_main_~y~0_177 v_main_~y~0_176))) (or (and .cse0 .cse1 .cse2 .cse3) (let ((.cse4 (+ v_main_~x~0_222 v_main_~y~0_176))) (and (= .cse4 (+ v_main_~x~0_221 v_main_~y~0_177)) .cse5 (< v_main_~y~0_177 v_main_~y~0_176) (< .cse4 (+ v_main_~y~0_177 1000001)))) (and (or (not .cse5) (not (< v_main_~x~0_222 1000000))) .cse0 .cse1 .cse2 .cse3))) InVars {main_~y~0=v_main_~y~0_177, main_#t~post5=|v_main_#t~post5_53|, main_~x~0=v_main_~x~0_222, main_#t~post6=|v_main_#t~post6_53|} OutVars{main_~y~0=v_main_~y~0_176, main_#t~post5=|v_main_#t~post5_52|, main_~x~0=v_main_~x~0_221, main_#t~post6=|v_main_#t~post6_52|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {3871#(<= 50000 main_~y~0)} is VALID [2022-04-28 03:50:58,905 INFO L290 TraceCheckUtils]: 9: Hoare triple {3871#(<= 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[] {3871#(<= 50000 main_~y~0)} is VALID [2022-04-28 03:50:58,907 INFO L290 TraceCheckUtils]: 10: Hoare triple {3871#(<= 50000 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {3872#(<= 49998 main_~y~0)} is VALID [2022-04-28 03:50:58,908 INFO L290 TraceCheckUtils]: 11: Hoare triple {3872#(<= 49998 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {3873#(<= 49996 main_~y~0)} is VALID [2022-04-28 03:50:58,908 INFO L290 TraceCheckUtils]: 12: Hoare triple {3873#(<= 49996 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {3874#(<= 49994 main_~y~0)} is VALID [2022-04-28 03:50:58,909 INFO L290 TraceCheckUtils]: 13: Hoare triple {3874#(<= 49994 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {3875#(<= 49992 main_~y~0)} is VALID [2022-04-28 03:50:58,909 INFO L290 TraceCheckUtils]: 14: Hoare triple {3875#(<= 49992 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {3876#(<= 49990 main_~y~0)} is VALID [2022-04-28 03:50:58,910 INFO L290 TraceCheckUtils]: 15: Hoare triple {3876#(<= 49990 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {3877#(<= 49988 main_~y~0)} is VALID [2022-04-28 03:50:58,910 INFO L290 TraceCheckUtils]: 16: Hoare triple {3877#(<= 49988 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {3878#(<= 49986 main_~y~0)} is VALID [2022-04-28 03:50:58,911 INFO L290 TraceCheckUtils]: 17: Hoare triple {3878#(<= 49986 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {3879#(<= 49984 main_~y~0)} is VALID [2022-04-28 03:50:58,911 INFO L290 TraceCheckUtils]: 18: Hoare triple {3879#(<= 49984 main_~y~0)} assume !(~y~0 > 0); {3867#false} is VALID [2022-04-28 03:50:58,911 INFO L272 TraceCheckUtils]: 19: Hoare triple {3867#false} call __VERIFIER_assert((if ~z~0 == ~x~0 then 1 else 0)); {3867#false} is VALID [2022-04-28 03:50:58,911 INFO L290 TraceCheckUtils]: 20: Hoare triple {3867#false} ~cond := #in~cond; {3867#false} is VALID [2022-04-28 03:50:58,911 INFO L290 TraceCheckUtils]: 21: Hoare triple {3867#false} assume 0 == ~cond; {3867#false} is VALID [2022-04-28 03:50:58,911 INFO L290 TraceCheckUtils]: 22: Hoare triple {3867#false} assume !false; {3867#false} is VALID [2022-04-28 03:50:58,911 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-04-28 03:50:58,911 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 03:50:59,245 INFO L290 TraceCheckUtils]: 22: Hoare triple {3867#false} assume !false; {3867#false} is VALID [2022-04-28 03:50:59,245 INFO L290 TraceCheckUtils]: 21: Hoare triple {3867#false} assume 0 == ~cond; {3867#false} is VALID [2022-04-28 03:50:59,245 INFO L290 TraceCheckUtils]: 20: Hoare triple {3867#false} ~cond := #in~cond; {3867#false} is VALID [2022-04-28 03:50:59,245 INFO L272 TraceCheckUtils]: 19: Hoare triple {3867#false} call __VERIFIER_assert((if ~z~0 == ~x~0 then 1 else 0)); {3867#false} is VALID [2022-04-28 03:50:59,246 INFO L290 TraceCheckUtils]: 18: Hoare triple {3962#(< 0 main_~y~0)} assume !(~y~0 > 0); {3867#false} is VALID [2022-04-28 03:50:59,246 INFO L290 TraceCheckUtils]: 17: Hoare triple {3966#(< 2 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {3962#(< 0 main_~y~0)} is VALID [2022-04-28 03:50:59,247 INFO L290 TraceCheckUtils]: 16: Hoare triple {3970#(< 4 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {3966#(< 2 main_~y~0)} is VALID [2022-04-28 03:50:59,247 INFO L290 TraceCheckUtils]: 15: Hoare triple {3974#(< 6 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {3970#(< 4 main_~y~0)} is VALID [2022-04-28 03:50:59,247 INFO L290 TraceCheckUtils]: 14: Hoare triple {3978#(< 8 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {3974#(< 6 main_~y~0)} is VALID [2022-04-28 03:50:59,248 INFO L290 TraceCheckUtils]: 13: Hoare triple {3982#(< 10 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {3978#(< 8 main_~y~0)} is VALID [2022-04-28 03:50:59,248 INFO L290 TraceCheckUtils]: 12: Hoare triple {3986#(< 12 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {3982#(< 10 main_~y~0)} is VALID [2022-04-28 03:50:59,249 INFO L290 TraceCheckUtils]: 11: Hoare triple {3990#(< 14 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {3986#(< 12 main_~y~0)} is VALID [2022-04-28 03:50:59,249 INFO L290 TraceCheckUtils]: 10: Hoare triple {3994#(< 16 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {3990#(< 14 main_~y~0)} is VALID [2022-04-28 03:50:59,250 INFO L290 TraceCheckUtils]: 9: Hoare triple {3994#(< 16 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[] {3994#(< 16 main_~y~0)} is VALID [2022-04-28 03:50:59,250 INFO L290 TraceCheckUtils]: 8: Hoare triple {3994#(< 16 main_~y~0)} [90] L11-2-->L18-1_primed: Formula: (let ((.cse5 (<= 50000 v_main_~x~0_222)) (.cse0 (= |v_main_#t~post5_53| |v_main_#t~post5_52|)) (.cse1 (= |v_main_#t~post6_53| |v_main_#t~post6_52|)) (.cse2 (= v_main_~x~0_222 v_main_~x~0_221)) (.cse3 (= v_main_~y~0_177 v_main_~y~0_176))) (or (and .cse0 .cse1 .cse2 .cse3) (let ((.cse4 (+ v_main_~x~0_222 v_main_~y~0_176))) (and (= .cse4 (+ v_main_~x~0_221 v_main_~y~0_177)) .cse5 (< v_main_~y~0_177 v_main_~y~0_176) (< .cse4 (+ v_main_~y~0_177 1000001)))) (and (or (not .cse5) (not (< v_main_~x~0_222 1000000))) .cse0 .cse1 .cse2 .cse3))) InVars {main_~y~0=v_main_~y~0_177, main_#t~post5=|v_main_#t~post5_53|, main_~x~0=v_main_~x~0_222, main_#t~post6=|v_main_#t~post6_53|} OutVars{main_~y~0=v_main_~y~0_176, main_#t~post5=|v_main_#t~post5_52|, main_~x~0=v_main_~x~0_221, main_#t~post6=|v_main_#t~post6_52|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {3994#(< 16 main_~y~0)} is VALID [2022-04-28 03:50:59,251 INFO L290 TraceCheckUtils]: 7: Hoare triple {3994#(< 16 main_~y~0)} [89] L18-1_primed-->L11-2: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {3994#(< 16 main_~y~0)} is VALID [2022-04-28 03:50:59,251 INFO L290 TraceCheckUtils]: 6: Hoare triple {3994#(< 16 main_~y~0)} [88] L11-2-->L18-1_primed: Formula: (let ((.cse0 (= |v_main_#t~post4_53| |v_main_#t~post4_52|))) (or (and (not (< v_main_~x~0_220 50000)) (= v_main_~x~0_219 v_main_~x~0_220) .cse0) (and (= v_main_~x~0_220 v_main_~x~0_219) .cse0) (and (< v_main_~x~0_220 v_main_~x~0_219) (< v_main_~x~0_219 50001)))) InVars {main_~x~0=v_main_~x~0_220, main_#t~post4=|v_main_#t~post4_53|} OutVars{main_~x~0=v_main_~x~0_219, main_#t~post4=|v_main_#t~post4_52|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {3994#(< 16 main_~y~0)} is VALID [2022-04-28 03:50:59,251 INFO L290 TraceCheckUtils]: 5: Hoare triple {3866#true} ~x~0 := 0;~y~0 := 50000;~z~0 := 0;~x~0 := 0; {3994#(< 16 main_~y~0)} is VALID [2022-04-28 03:50:59,251 INFO L272 TraceCheckUtils]: 4: Hoare triple {3866#true} call #t~ret7 := main(); {3866#true} is VALID [2022-04-28 03:50:59,251 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3866#true} {3866#true} #52#return; {3866#true} is VALID [2022-04-28 03:50:59,251 INFO L290 TraceCheckUtils]: 2: Hoare triple {3866#true} assume true; {3866#true} is VALID [2022-04-28 03:50:59,252 INFO L290 TraceCheckUtils]: 1: Hoare triple {3866#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); {3866#true} is VALID [2022-04-28 03:50:59,252 INFO L272 TraceCheckUtils]: 0: Hoare triple {3866#true} call ULTIMATE.init(); {3866#true} is VALID [2022-04-28 03:50:59,252 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-04-28 03:50:59,252 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [154619048] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 03:50:59,253 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 03:50:59,253 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 11, 11] total 21 [2022-04-28 03:50:59,649 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 03:50:59,650 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [2001865583] [2022-04-28 03:50:59,650 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [2001865583] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 03:50:59,650 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 03:50:59,650 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [28] imperfect sequences [] total 28 [2022-04-28 03:50:59,650 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1444291395] [2022-04-28 03:50:59,650 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 03:50:59,650 INFO L78 Accepts]: Start accepts. Automaton has has 28 states, 28 states have (on average 1.6428571428571428) internal successors, (46), 27 states have internal predecessors, (46), 2 states have call successors, (3), 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 50 [2022-04-28 03:50:59,651 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 03:50:59,651 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 28 states, 28 states have (on average 1.6428571428571428) internal successors, (46), 27 states have internal predecessors, (46), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:50:59,688 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 50 edges. 50 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 03:50:59,688 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2022-04-28 03:50:59,688 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 03:50:59,688 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2022-04-28 03:50:59,688 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=527, Invalid=805, Unknown=0, NotChecked=0, Total=1332 [2022-04-28 03:50:59,689 INFO L87 Difference]: Start difference. First operand 51 states and 54 transitions. Second operand has 28 states, 28 states have (on average 1.6428571428571428) internal successors, (46), 27 states have internal predecessors, (46), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:51:01,077 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:51:01,077 INFO L93 Difference]: Finished difference Result 99 states and 110 transitions. [2022-04-28 03:51:01,077 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2022-04-28 03:51:01,077 INFO L78 Accepts]: Start accepts. Automaton has has 28 states, 28 states have (on average 1.6428571428571428) internal successors, (46), 27 states have internal predecessors, (46), 2 states have call successors, (3), 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 50 [2022-04-28 03:51:01,077 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 03:51:01,077 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28 states, 28 states have (on average 1.6428571428571428) internal successors, (46), 27 states have internal predecessors, (46), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:51:01,078 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 72 transitions. [2022-04-28 03:51:01,078 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28 states, 28 states have (on average 1.6428571428571428) internal successors, (46), 27 states have internal predecessors, (46), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:51:01,079 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 72 transitions. [2022-04-28 03:51:01,079 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 28 states and 72 transitions. [2022-04-28 03:51:01,136 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 72 edges. 72 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 03:51:01,137 INFO L225 Difference]: With dead ends: 99 [2022-04-28 03:51:01,137 INFO L226 Difference]: Without dead ends: 56 [2022-04-28 03:51:01,138 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 119 GetRequests, 58 SyntacticMatches, 1 SemanticMatches, 60 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1029 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=1242, Invalid=2540, Unknown=0, NotChecked=0, Total=3782 [2022-04-28 03:51:01,139 INFO L413 NwaCegarLoop]: 12 mSDtfsCounter, 93 mSDsluCounter, 42 mSDsCounter, 0 mSdLazyCounter, 556 mSolverCounterSat, 107 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 93 SdHoareTripleChecker+Valid, 54 SdHoareTripleChecker+Invalid, 663 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 107 IncrementalHoareTripleChecker+Valid, 556 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-04-28 03:51:01,139 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [93 Valid, 54 Invalid, 663 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [107 Valid, 556 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-04-28 03:51:01,139 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2022-04-28 03:51:01,212 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 56. [2022-04-28 03:51:01,212 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 03:51:01,212 INFO L82 GeneralOperation]: Start isEquivalent. First operand 56 states. Second operand has 56 states, 51 states have (on average 1.0784313725490196) internal successors, (55), 51 states have internal predecessors, (55), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:51:01,213 INFO L74 IsIncluded]: Start isIncluded. First operand 56 states. Second operand has 56 states, 51 states have (on average 1.0784313725490196) internal successors, (55), 51 states have internal predecessors, (55), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:51:01,213 INFO L87 Difference]: Start difference. First operand 56 states. Second operand has 56 states, 51 states have (on average 1.0784313725490196) internal successors, (55), 51 states have internal predecessors, (55), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:51:01,214 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:51:01,214 INFO L93 Difference]: Finished difference Result 56 states and 59 transitions. [2022-04-28 03:51:01,214 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 59 transitions. [2022-04-28 03:51:01,214 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:51:01,214 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:51:01,214 INFO L74 IsIncluded]: Start isIncluded. First operand has 56 states, 51 states have (on average 1.0784313725490196) internal successors, (55), 51 states have internal predecessors, (55), 3 states have call successors, (3), 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 56 states. [2022-04-28 03:51:01,214 INFO L87 Difference]: Start difference. First operand has 56 states, 51 states have (on average 1.0784313725490196) internal successors, (55), 51 states have internal predecessors, (55), 3 states have call successors, (3), 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 56 states. [2022-04-28 03:51:01,215 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:51:01,215 INFO L93 Difference]: Finished difference Result 56 states and 59 transitions. [2022-04-28 03:51:01,215 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 59 transitions. [2022-04-28 03:51:01,215 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:51:01,215 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:51:01,215 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 03:51:01,215 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 03:51:01,215 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 56 states, 51 states have (on average 1.0784313725490196) internal successors, (55), 51 states have internal predecessors, (55), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:51:01,216 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 59 transitions. [2022-04-28 03:51:01,216 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 59 transitions. Word has length 50 [2022-04-28 03:51:01,216 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 03:51:01,216 INFO L495 AbstractCegarLoop]: Abstraction has 56 states and 59 transitions. [2022-04-28 03:51:01,216 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 28 states have (on average 1.6428571428571428) internal successors, (46), 27 states have internal predecessors, (46), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:51:01,216 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 56 states and 59 transitions. [2022-04-28 03:51:01,270 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 59 edges. 59 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 03:51:01,271 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 59 transitions. [2022-04-28 03:51:01,271 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2022-04-28 03:51:01,271 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 03:51:01,271 INFO L195 NwaCegarLoop]: trace histogram [17, 16, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 03:51:01,287 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2022-04-28 03:51:01,471 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2022-04-28 03:51:01,472 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 03:51:01,472 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 03:51:01,472 INFO L85 PathProgramCache]: Analyzing trace with hash 2077159449, now seen corresponding path program 9 times [2022-04-28 03:51:01,472 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 03:51:01,472 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [832446196] [2022-04-28 03:51:05,546 WARN L977 rdanLoopAcceleration]: Unable to prove correctness of quantifier elimination. [2022-04-28 03:51:05,597 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 1 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 03:51:05,834 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={1=1, 2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 03:51:05,835 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-28 03:51:05,837 INFO L85 PathProgramCache]: Analyzing trace with hash -799401470, now seen corresponding path program 1 times [2022-04-28 03:51:05,837 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 03:51:05,837 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2006210521] [2022-04-28 03:51:05,837 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:51:05,837 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 03:51:05,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:51:05,959 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 03:51:05,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:51:05,963 INFO L290 TraceCheckUtils]: 0: Hoare triple {4530#(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); {4515#true} is VALID [2022-04-28 03:51:05,963 INFO L290 TraceCheckUtils]: 1: Hoare triple {4515#true} assume true; {4515#true} is VALID [2022-04-28 03:51:05,963 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {4515#true} {4515#true} #52#return; {4515#true} is VALID [2022-04-28 03:51:05,964 INFO L272 TraceCheckUtils]: 0: Hoare triple {4515#true} call ULTIMATE.init(); {4530#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 03:51:05,964 INFO L290 TraceCheckUtils]: 1: Hoare triple {4530#(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); {4515#true} is VALID [2022-04-28 03:51:05,964 INFO L290 TraceCheckUtils]: 2: Hoare triple {4515#true} assume true; {4515#true} is VALID [2022-04-28 03:51:05,964 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {4515#true} {4515#true} #52#return; {4515#true} is VALID [2022-04-28 03:51:05,964 INFO L272 TraceCheckUtils]: 4: Hoare triple {4515#true} call #t~ret7 := main(); {4515#true} is VALID [2022-04-28 03:51:05,964 INFO L290 TraceCheckUtils]: 5: Hoare triple {4515#true} ~x~0 := 0;~y~0 := 50000;~z~0 := 0;~x~0 := 0; {4520#(<= 50000 main_~y~0)} is VALID [2022-04-28 03:51:05,964 INFO L290 TraceCheckUtils]: 6: Hoare triple {4520#(<= 50000 main_~y~0)} [92] L11-2-->L18-1_primed: Formula: (let ((.cse0 (= v_main_~x~0_259 v_main_~x~0_258)) (.cse1 (= |v_main_#t~post4_59| |v_main_#t~post4_58|))) (or (and .cse0 .cse1) (and .cse0 .cse1 (<= 50000 v_main_~x~0_259)) (and (< v_main_~x~0_258 50001) (< v_main_~x~0_259 v_main_~x~0_258)))) InVars {main_~x~0=v_main_~x~0_259, main_#t~post4=|v_main_#t~post4_59|} OutVars{main_~x~0=v_main_~x~0_258, main_#t~post4=|v_main_#t~post4_58|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {4520#(<= 50000 main_~y~0)} is VALID [2022-04-28 03:51:05,965 INFO L290 TraceCheckUtils]: 7: Hoare triple {4520#(<= 50000 main_~y~0)} [93] L18-1_primed-->L11-2: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {4520#(<= 50000 main_~y~0)} is VALID [2022-04-28 03:51:05,965 INFO L290 TraceCheckUtils]: 8: Hoare triple {4520#(<= 50000 main_~y~0)} [94] L11-2-->L18-1_primed: Formula: (let ((.cse0 (= |v_main_#t~post6_60| |v_main_#t~post6_59|)) (.cse1 (= v_main_~x~0_261 v_main_~x~0_260)) (.cse3 (<= 50000 v_main_~x~0_261)) (.cse2 (= v_main_~y~0_216 v_main_~y~0_215))) (or (and (= |v_main_#t~post5_60| |v_main_#t~post5_59|) .cse0 .cse1 .cse2) (and .cse3 (= (+ v_main_~x~0_260 v_main_~y~0_216) (+ v_main_~x~0_261 v_main_~y~0_215)) (< v_main_~x~0_260 1000001) (< v_main_~x~0_261 v_main_~x~0_260)) (and .cse0 .cse1 (or (not (< v_main_~x~0_261 1000000)) (not .cse3)) (= |v_main_#t~post5_59| |v_main_#t~post5_60|) .cse2))) InVars {main_~y~0=v_main_~y~0_216, main_#t~post5=|v_main_#t~post5_60|, main_~x~0=v_main_~x~0_261, main_#t~post6=|v_main_#t~post6_60|} OutVars{main_~y~0=v_main_~y~0_215, main_#t~post5=|v_main_#t~post5_59|, main_~x~0=v_main_~x~0_260, main_#t~post6=|v_main_#t~post6_59|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {4520#(<= 50000 main_~y~0)} is VALID [2022-04-28 03:51:05,966 INFO L290 TraceCheckUtils]: 9: Hoare triple {4520#(<= 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[] {4520#(<= 50000 main_~y~0)} is VALID [2022-04-28 03:51:05,966 INFO L290 TraceCheckUtils]: 10: Hoare triple {4520#(<= 50000 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {4521#(<= 49998 main_~y~0)} is VALID [2022-04-28 03:51:05,967 INFO L290 TraceCheckUtils]: 11: Hoare triple {4521#(<= 49998 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {4522#(<= 49996 main_~y~0)} is VALID [2022-04-28 03:51:05,967 INFO L290 TraceCheckUtils]: 12: Hoare triple {4522#(<= 49996 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {4523#(<= 49994 main_~y~0)} is VALID [2022-04-28 03:51:05,967 INFO L290 TraceCheckUtils]: 13: Hoare triple {4523#(<= 49994 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {4524#(<= 49992 main_~y~0)} is VALID [2022-04-28 03:51:05,968 INFO L290 TraceCheckUtils]: 14: Hoare triple {4524#(<= 49992 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {4525#(<= 49990 main_~y~0)} is VALID [2022-04-28 03:51:05,968 INFO L290 TraceCheckUtils]: 15: Hoare triple {4525#(<= 49990 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {4526#(<= 49988 main_~y~0)} is VALID [2022-04-28 03:51:05,969 INFO L290 TraceCheckUtils]: 16: Hoare triple {4526#(<= 49988 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {4527#(<= 49986 main_~y~0)} is VALID [2022-04-28 03:51:05,969 INFO L290 TraceCheckUtils]: 17: Hoare triple {4527#(<= 49986 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {4528#(<= 49984 main_~y~0)} is VALID [2022-04-28 03:51:05,970 INFO L290 TraceCheckUtils]: 18: Hoare triple {4528#(<= 49984 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {4529#(<= 49982 main_~y~0)} is VALID [2022-04-28 03:51:05,970 INFO L290 TraceCheckUtils]: 19: Hoare triple {4529#(<= 49982 main_~y~0)} assume !(~y~0 > 0); {4516#false} is VALID [2022-04-28 03:51:05,970 INFO L272 TraceCheckUtils]: 20: Hoare triple {4516#false} call __VERIFIER_assert((if ~z~0 == ~x~0 then 1 else 0)); {4516#false} is VALID [2022-04-28 03:51:05,970 INFO L290 TraceCheckUtils]: 21: Hoare triple {4516#false} ~cond := #in~cond; {4516#false} is VALID [2022-04-28 03:51:05,970 INFO L290 TraceCheckUtils]: 22: Hoare triple {4516#false} assume 0 == ~cond; {4516#false} is VALID [2022-04-28 03:51:05,970 INFO L290 TraceCheckUtils]: 23: Hoare triple {4516#false} assume !false; {4516#false} is VALID [2022-04-28 03:51:05,970 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 0 proven. 45 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-04-28 03:51:05,970 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 03:51:05,971 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2006210521] [2022-04-28 03:51:05,971 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2006210521] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 03:51:05,971 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [50645408] [2022-04-28 03:51:05,971 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:51:05,971 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 03:51:05,971 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 03:51:05,972 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 03:51:05,972 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2022-04-28 03:51:06,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:51:06,004 INFO L263 TraceCheckSpWp]: Trace formula consists of 104 conjuncts, 12 conjunts are in the unsatisfiable core [2022-04-28 03:51:06,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:51:06,012 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 03:51:06,258 INFO L272 TraceCheckUtils]: 0: Hoare triple {4515#true} call ULTIMATE.init(); {4515#true} is VALID [2022-04-28 03:51:06,258 INFO L290 TraceCheckUtils]: 1: Hoare triple {4515#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); {4515#true} is VALID [2022-04-28 03:51:06,258 INFO L290 TraceCheckUtils]: 2: Hoare triple {4515#true} assume true; {4515#true} is VALID [2022-04-28 03:51:06,258 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {4515#true} {4515#true} #52#return; {4515#true} is VALID [2022-04-28 03:51:06,258 INFO L272 TraceCheckUtils]: 4: Hoare triple {4515#true} call #t~ret7 := main(); {4515#true} is VALID [2022-04-28 03:51:06,259 INFO L290 TraceCheckUtils]: 5: Hoare triple {4515#true} ~x~0 := 0;~y~0 := 50000;~z~0 := 0;~x~0 := 0; {4520#(<= 50000 main_~y~0)} is VALID [2022-04-28 03:51:06,259 INFO L290 TraceCheckUtils]: 6: Hoare triple {4520#(<= 50000 main_~y~0)} [92] L11-2-->L18-1_primed: Formula: (let ((.cse0 (= v_main_~x~0_259 v_main_~x~0_258)) (.cse1 (= |v_main_#t~post4_59| |v_main_#t~post4_58|))) (or (and .cse0 .cse1) (and .cse0 .cse1 (<= 50000 v_main_~x~0_259)) (and (< v_main_~x~0_258 50001) (< v_main_~x~0_259 v_main_~x~0_258)))) InVars {main_~x~0=v_main_~x~0_259, main_#t~post4=|v_main_#t~post4_59|} OutVars{main_~x~0=v_main_~x~0_258, main_#t~post4=|v_main_#t~post4_58|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {4520#(<= 50000 main_~y~0)} is VALID [2022-04-28 03:51:06,259 INFO L290 TraceCheckUtils]: 7: Hoare triple {4520#(<= 50000 main_~y~0)} [93] L18-1_primed-->L11-2: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {4520#(<= 50000 main_~y~0)} is VALID [2022-04-28 03:51:06,260 INFO L290 TraceCheckUtils]: 8: Hoare triple {4520#(<= 50000 main_~y~0)} [94] L11-2-->L18-1_primed: Formula: (let ((.cse0 (= |v_main_#t~post6_60| |v_main_#t~post6_59|)) (.cse1 (= v_main_~x~0_261 v_main_~x~0_260)) (.cse3 (<= 50000 v_main_~x~0_261)) (.cse2 (= v_main_~y~0_216 v_main_~y~0_215))) (or (and (= |v_main_#t~post5_60| |v_main_#t~post5_59|) .cse0 .cse1 .cse2) (and .cse3 (= (+ v_main_~x~0_260 v_main_~y~0_216) (+ v_main_~x~0_261 v_main_~y~0_215)) (< v_main_~x~0_260 1000001) (< v_main_~x~0_261 v_main_~x~0_260)) (and .cse0 .cse1 (or (not (< v_main_~x~0_261 1000000)) (not .cse3)) (= |v_main_#t~post5_59| |v_main_#t~post5_60|) .cse2))) InVars {main_~y~0=v_main_~y~0_216, main_#t~post5=|v_main_#t~post5_60|, main_~x~0=v_main_~x~0_261, main_#t~post6=|v_main_#t~post6_60|} OutVars{main_~y~0=v_main_~y~0_215, main_#t~post5=|v_main_#t~post5_59|, main_~x~0=v_main_~x~0_260, main_#t~post6=|v_main_#t~post6_59|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {4520#(<= 50000 main_~y~0)} is VALID [2022-04-28 03:51:06,261 INFO L290 TraceCheckUtils]: 9: Hoare triple {4520#(<= 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[] {4520#(<= 50000 main_~y~0)} is VALID [2022-04-28 03:51:06,261 INFO L290 TraceCheckUtils]: 10: Hoare triple {4520#(<= 50000 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {4521#(<= 49998 main_~y~0)} is VALID [2022-04-28 03:51:06,261 INFO L290 TraceCheckUtils]: 11: Hoare triple {4521#(<= 49998 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {4522#(<= 49996 main_~y~0)} is VALID [2022-04-28 03:51:06,262 INFO L290 TraceCheckUtils]: 12: Hoare triple {4522#(<= 49996 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {4523#(<= 49994 main_~y~0)} is VALID [2022-04-28 03:51:06,262 INFO L290 TraceCheckUtils]: 13: Hoare triple {4523#(<= 49994 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {4524#(<= 49992 main_~y~0)} is VALID [2022-04-28 03:51:06,263 INFO L290 TraceCheckUtils]: 14: Hoare triple {4524#(<= 49992 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {4525#(<= 49990 main_~y~0)} is VALID [2022-04-28 03:51:06,263 INFO L290 TraceCheckUtils]: 15: Hoare triple {4525#(<= 49990 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {4526#(<= 49988 main_~y~0)} is VALID [2022-04-28 03:51:06,264 INFO L290 TraceCheckUtils]: 16: Hoare triple {4526#(<= 49988 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {4527#(<= 49986 main_~y~0)} is VALID [2022-04-28 03:51:06,264 INFO L290 TraceCheckUtils]: 17: Hoare triple {4527#(<= 49986 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {4528#(<= 49984 main_~y~0)} is VALID [2022-04-28 03:51:06,264 INFO L290 TraceCheckUtils]: 18: Hoare triple {4528#(<= 49984 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {4529#(<= 49982 main_~y~0)} is VALID [2022-04-28 03:51:06,265 INFO L290 TraceCheckUtils]: 19: Hoare triple {4529#(<= 49982 main_~y~0)} assume !(~y~0 > 0); {4516#false} is VALID [2022-04-28 03:51:06,265 INFO L272 TraceCheckUtils]: 20: Hoare triple {4516#false} call __VERIFIER_assert((if ~z~0 == ~x~0 then 1 else 0)); {4516#false} is VALID [2022-04-28 03:51:06,265 INFO L290 TraceCheckUtils]: 21: Hoare triple {4516#false} ~cond := #in~cond; {4516#false} is VALID [2022-04-28 03:51:06,265 INFO L290 TraceCheckUtils]: 22: Hoare triple {4516#false} assume 0 == ~cond; {4516#false} is VALID [2022-04-28 03:51:06,265 INFO L290 TraceCheckUtils]: 23: Hoare triple {4516#false} assume !false; {4516#false} is VALID [2022-04-28 03:51:06,265 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 0 proven. 45 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-04-28 03:51:06,265 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 03:51:06,621 INFO L290 TraceCheckUtils]: 23: Hoare triple {4516#false} assume !false; {4516#false} is VALID [2022-04-28 03:51:06,621 INFO L290 TraceCheckUtils]: 22: Hoare triple {4516#false} assume 0 == ~cond; {4516#false} is VALID [2022-04-28 03:51:06,621 INFO L290 TraceCheckUtils]: 21: Hoare triple {4516#false} ~cond := #in~cond; {4516#false} is VALID [2022-04-28 03:51:06,621 INFO L272 TraceCheckUtils]: 20: Hoare triple {4516#false} call __VERIFIER_assert((if ~z~0 == ~x~0 then 1 else 0)); {4516#false} is VALID [2022-04-28 03:51:06,622 INFO L290 TraceCheckUtils]: 19: Hoare triple {4615#(< 0 main_~y~0)} assume !(~y~0 > 0); {4516#false} is VALID [2022-04-28 03:51:06,622 INFO L290 TraceCheckUtils]: 18: Hoare triple {4619#(< 2 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {4615#(< 0 main_~y~0)} is VALID [2022-04-28 03:51:06,623 INFO L290 TraceCheckUtils]: 17: Hoare triple {4623#(< 4 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {4619#(< 2 main_~y~0)} is VALID [2022-04-28 03:51:06,623 INFO L290 TraceCheckUtils]: 16: Hoare triple {4627#(< 6 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {4623#(< 4 main_~y~0)} is VALID [2022-04-28 03:51:06,624 INFO L290 TraceCheckUtils]: 15: Hoare triple {4631#(< 8 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {4627#(< 6 main_~y~0)} is VALID [2022-04-28 03:51:06,624 INFO L290 TraceCheckUtils]: 14: Hoare triple {4635#(< 10 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {4631#(< 8 main_~y~0)} is VALID [2022-04-28 03:51:06,624 INFO L290 TraceCheckUtils]: 13: Hoare triple {4639#(< 12 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {4635#(< 10 main_~y~0)} is VALID [2022-04-28 03:51:06,625 INFO L290 TraceCheckUtils]: 12: Hoare triple {4643#(< 14 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {4639#(< 12 main_~y~0)} is VALID [2022-04-28 03:51:06,625 INFO L290 TraceCheckUtils]: 11: Hoare triple {4647#(< 16 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {4643#(< 14 main_~y~0)} is VALID [2022-04-28 03:51:06,626 INFO L290 TraceCheckUtils]: 10: Hoare triple {4651#(< 18 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {4647#(< 16 main_~y~0)} is VALID [2022-04-28 03:51:06,626 INFO L290 TraceCheckUtils]: 9: Hoare triple {4651#(< 18 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[] {4651#(< 18 main_~y~0)} is VALID [2022-04-28 03:51:06,627 INFO L290 TraceCheckUtils]: 8: Hoare triple {4651#(< 18 main_~y~0)} [94] L11-2-->L18-1_primed: Formula: (let ((.cse0 (= |v_main_#t~post6_60| |v_main_#t~post6_59|)) (.cse1 (= v_main_~x~0_261 v_main_~x~0_260)) (.cse3 (<= 50000 v_main_~x~0_261)) (.cse2 (= v_main_~y~0_216 v_main_~y~0_215))) (or (and (= |v_main_#t~post5_60| |v_main_#t~post5_59|) .cse0 .cse1 .cse2) (and .cse3 (= (+ v_main_~x~0_260 v_main_~y~0_216) (+ v_main_~x~0_261 v_main_~y~0_215)) (< v_main_~x~0_260 1000001) (< v_main_~x~0_261 v_main_~x~0_260)) (and .cse0 .cse1 (or (not (< v_main_~x~0_261 1000000)) (not .cse3)) (= |v_main_#t~post5_59| |v_main_#t~post5_60|) .cse2))) InVars {main_~y~0=v_main_~y~0_216, main_#t~post5=|v_main_#t~post5_60|, main_~x~0=v_main_~x~0_261, main_#t~post6=|v_main_#t~post6_60|} OutVars{main_~y~0=v_main_~y~0_215, main_#t~post5=|v_main_#t~post5_59|, main_~x~0=v_main_~x~0_260, main_#t~post6=|v_main_#t~post6_59|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {4651#(< 18 main_~y~0)} is VALID [2022-04-28 03:51:06,627 INFO L290 TraceCheckUtils]: 7: Hoare triple {4651#(< 18 main_~y~0)} [93] L18-1_primed-->L11-2: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {4651#(< 18 main_~y~0)} is VALID [2022-04-28 03:51:06,627 INFO L290 TraceCheckUtils]: 6: Hoare triple {4651#(< 18 main_~y~0)} [92] L11-2-->L18-1_primed: Formula: (let ((.cse0 (= v_main_~x~0_259 v_main_~x~0_258)) (.cse1 (= |v_main_#t~post4_59| |v_main_#t~post4_58|))) (or (and .cse0 .cse1) (and .cse0 .cse1 (<= 50000 v_main_~x~0_259)) (and (< v_main_~x~0_258 50001) (< v_main_~x~0_259 v_main_~x~0_258)))) InVars {main_~x~0=v_main_~x~0_259, main_#t~post4=|v_main_#t~post4_59|} OutVars{main_~x~0=v_main_~x~0_258, main_#t~post4=|v_main_#t~post4_58|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {4651#(< 18 main_~y~0)} is VALID [2022-04-28 03:51:06,628 INFO L290 TraceCheckUtils]: 5: Hoare triple {4515#true} ~x~0 := 0;~y~0 := 50000;~z~0 := 0;~x~0 := 0; {4651#(< 18 main_~y~0)} is VALID [2022-04-28 03:51:06,628 INFO L272 TraceCheckUtils]: 4: Hoare triple {4515#true} call #t~ret7 := main(); {4515#true} is VALID [2022-04-28 03:51:06,628 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {4515#true} {4515#true} #52#return; {4515#true} is VALID [2022-04-28 03:51:06,628 INFO L290 TraceCheckUtils]: 2: Hoare triple {4515#true} assume true; {4515#true} is VALID [2022-04-28 03:51:06,628 INFO L290 TraceCheckUtils]: 1: Hoare triple {4515#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); {4515#true} is VALID [2022-04-28 03:51:06,628 INFO L272 TraceCheckUtils]: 0: Hoare triple {4515#true} call ULTIMATE.init(); {4515#true} is VALID [2022-04-28 03:51:06,628 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 0 proven. 45 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-04-28 03:51:06,628 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [50645408] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 03:51:06,628 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 03:51:06,628 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 12, 12] total 23 [2022-04-28 03:51:07,142 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 03:51:07,142 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [832446196] [2022-04-28 03:51:07,142 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [832446196] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 03:51:07,142 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 03:51:07,143 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [31] imperfect sequences [] total 31 [2022-04-28 03:51:07,143 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [276389738] [2022-04-28 03:51:07,143 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 03:51:07,143 INFO L78 Accepts]: Start accepts. Automaton has has 31 states, 31 states have (on average 1.6451612903225807) internal successors, (51), 30 states have internal predecessors, (51), 2 states have call successors, (3), 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 55 [2022-04-28 03:51:07,143 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 03:51:07,143 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 31 states, 31 states have (on average 1.6451612903225807) internal successors, (51), 30 states have internal predecessors, (51), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:51:07,182 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 55 edges. 55 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 03:51:07,182 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 31 states [2022-04-28 03:51:07,183 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 03:51:07,183 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2022-04-28 03:51:07,183 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=646, Invalid=994, Unknown=0, NotChecked=0, Total=1640 [2022-04-28 03:51:07,184 INFO L87 Difference]: Start difference. First operand 56 states and 59 transitions. Second operand has 31 states, 31 states have (on average 1.6451612903225807) internal successors, (51), 30 states have internal predecessors, (51), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:51:08,809 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:51:08,809 INFO L93 Difference]: Finished difference Result 109 states and 120 transitions. [2022-04-28 03:51:08,809 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2022-04-28 03:51:08,809 INFO L78 Accepts]: Start accepts. Automaton has has 31 states, 31 states have (on average 1.6451612903225807) internal successors, (51), 30 states have internal predecessors, (51), 2 states have call successors, (3), 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 55 [2022-04-28 03:51:08,809 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 03:51:08,810 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31 states, 31 states have (on average 1.6451612903225807) internal successors, (51), 30 states have internal predecessors, (51), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:51:08,811 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 77 transitions. [2022-04-28 03:51:08,811 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31 states, 31 states have (on average 1.6451612903225807) internal successors, (51), 30 states have internal predecessors, (51), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:51:08,812 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 77 transitions. [2022-04-28 03:51:08,812 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 31 states and 77 transitions. [2022-04-28 03:51:08,884 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 77 edges. 77 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 03:51:08,890 INFO L225 Difference]: With dead ends: 109 [2022-04-28 03:51:08,890 INFO L226 Difference]: Without dead ends: 61 [2022-04-28 03:51:08,891 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 129 GetRequests, 60 SyntacticMatches, 2 SemanticMatches, 67 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1307 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=1522, Invalid=3170, Unknown=0, NotChecked=0, Total=4692 [2022-04-28 03:51:08,892 INFO L413 NwaCegarLoop]: 12 mSDtfsCounter, 105 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 670 mSolverCounterSat, 139 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 105 SdHoareTripleChecker+Valid, 29 SdHoareTripleChecker+Invalid, 809 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 139 IncrementalHoareTripleChecker+Valid, 670 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-04-28 03:51:08,892 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [105 Valid, 29 Invalid, 809 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [139 Valid, 670 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-04-28 03:51:08,892 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2022-04-28 03:51:08,975 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 61. [2022-04-28 03:51:08,975 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 03:51:08,976 INFO L82 GeneralOperation]: Start isEquivalent. First operand 61 states. Second operand has 61 states, 56 states have (on average 1.0714285714285714) internal successors, (60), 56 states have internal predecessors, (60), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:51:08,976 INFO L74 IsIncluded]: Start isIncluded. First operand 61 states. Second operand has 61 states, 56 states have (on average 1.0714285714285714) internal successors, (60), 56 states have internal predecessors, (60), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:51:08,976 INFO L87 Difference]: Start difference. First operand 61 states. Second operand has 61 states, 56 states have (on average 1.0714285714285714) internal successors, (60), 56 states have internal predecessors, (60), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:51:08,977 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:51:08,977 INFO L93 Difference]: Finished difference Result 61 states and 64 transitions. [2022-04-28 03:51:08,977 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 64 transitions. [2022-04-28 03:51:08,977 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:51:08,977 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:51:08,978 INFO L74 IsIncluded]: Start isIncluded. First operand has 61 states, 56 states have (on average 1.0714285714285714) internal successors, (60), 56 states have internal predecessors, (60), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 61 states. [2022-04-28 03:51:08,978 INFO L87 Difference]: Start difference. First operand has 61 states, 56 states have (on average 1.0714285714285714) internal successors, (60), 56 states have internal predecessors, (60), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 61 states. [2022-04-28 03:51:08,979 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:51:08,979 INFO L93 Difference]: Finished difference Result 61 states and 64 transitions. [2022-04-28 03:51:08,979 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 64 transitions. [2022-04-28 03:51:08,979 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:51:08,979 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:51:08,979 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 03:51:08,979 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 03:51:08,979 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 61 states, 56 states have (on average 1.0714285714285714) internal successors, (60), 56 states have internal predecessors, (60), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:51:08,980 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 64 transitions. [2022-04-28 03:51:08,980 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 64 transitions. Word has length 55 [2022-04-28 03:51:08,980 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 03:51:08,980 INFO L495 AbstractCegarLoop]: Abstraction has 61 states and 64 transitions. [2022-04-28 03:51:08,981 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 31 states, 31 states have (on average 1.6451612903225807) internal successors, (51), 30 states have internal predecessors, (51), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:51:08,981 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 61 states and 64 transitions. [2022-04-28 03:51:09,037 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 64 edges. 64 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 03:51:09,038 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 64 transitions. [2022-04-28 03:51:09,038 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2022-04-28 03:51:09,038 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 03:51:09,038 INFO L195 NwaCegarLoop]: trace histogram [19, 18, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 03:51:09,054 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2022-04-28 03:51:09,239 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 03:51:09,240 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 03:51:09,240 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 03:51:09,240 INFO L85 PathProgramCache]: Analyzing trace with hash 844924468, now seen corresponding path program 10 times [2022-04-28 03:51:09,240 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 03:51:09,240 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [659710188] [2022-04-28 03:51:13,305 WARN L977 rdanLoopAcceleration]: Unable to prove correctness of quantifier elimination. [2022-04-28 03:51:13,357 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 1 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 03:51:13,543 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={1=1, 2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 03:51:13,544 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-28 03:51:13,546 INFO L85 PathProgramCache]: Analyzing trace with hash 1323788449, now seen corresponding path program 1 times [2022-04-28 03:51:13,546 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 03:51:13,546 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [725940363] [2022-04-28 03:51:13,546 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:51:13,546 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 03:51:13,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:51:13,689 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 03:51:13,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:51:13,704 INFO L290 TraceCheckUtils]: 0: Hoare triple {5236#(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); {5220#true} is VALID [2022-04-28 03:51:13,704 INFO L290 TraceCheckUtils]: 1: Hoare triple {5220#true} assume true; {5220#true} is VALID [2022-04-28 03:51:13,704 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {5220#true} {5220#true} #52#return; {5220#true} is VALID [2022-04-28 03:51:13,705 INFO L272 TraceCheckUtils]: 0: Hoare triple {5220#true} call ULTIMATE.init(); {5236#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 03:51:13,705 INFO L290 TraceCheckUtils]: 1: Hoare triple {5236#(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); {5220#true} is VALID [2022-04-28 03:51:13,705 INFO L290 TraceCheckUtils]: 2: Hoare triple {5220#true} assume true; {5220#true} is VALID [2022-04-28 03:51:13,705 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {5220#true} {5220#true} #52#return; {5220#true} is VALID [2022-04-28 03:51:13,705 INFO L272 TraceCheckUtils]: 4: Hoare triple {5220#true} call #t~ret7 := main(); {5220#true} is VALID [2022-04-28 03:51:13,705 INFO L290 TraceCheckUtils]: 5: Hoare triple {5220#true} ~x~0 := 0;~y~0 := 50000;~z~0 := 0;~x~0 := 0; {5225#(<= 50000 main_~y~0)} is VALID [2022-04-28 03:51:13,706 INFO L290 TraceCheckUtils]: 6: Hoare triple {5225#(<= 50000 main_~y~0)} [96] L11-2-->L18-1_primed: Formula: (let ((.cse0 (= |v_main_#t~post4_65| |v_main_#t~post4_64|)) (.cse1 (= v_main_~x~0_301 v_main_~x~0_300))) (or (and .cse0 .cse1 (<= 50000 v_main_~x~0_301)) (and .cse0 .cse1) (and (< v_main_~x~0_301 v_main_~x~0_300) (< v_main_~x~0_300 50001)))) InVars {main_~x~0=v_main_~x~0_301, main_#t~post4=|v_main_#t~post4_65|} OutVars{main_~x~0=v_main_~x~0_300, main_#t~post4=|v_main_#t~post4_64|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {5225#(<= 50000 main_~y~0)} is VALID [2022-04-28 03:51:13,706 INFO L290 TraceCheckUtils]: 7: Hoare triple {5225#(<= 50000 main_~y~0)} [97] L18-1_primed-->L11-2: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {5225#(<= 50000 main_~y~0)} is VALID [2022-04-28 03:51:13,707 INFO L290 TraceCheckUtils]: 8: Hoare triple {5225#(<= 50000 main_~y~0)} [98] L11-2-->L18-1_primed: Formula: (let ((.cse0 (= v_main_~y~0_259 v_main_~y~0_258)) (.cse3 (<= 50000 v_main_~x~0_303)) (.cse1 (= |v_main_#t~post6_67| |v_main_#t~post6_66|)) (.cse2 (= |v_main_#t~post5_67| |v_main_#t~post5_66|))) (or (and (= v_main_~x~0_303 v_main_~x~0_302) .cse0 .cse1 .cse2) (and (< v_main_~x~0_302 1000001) (< v_main_~x~0_303 v_main_~x~0_302) (= (+ v_main_~x~0_302 v_main_~y~0_259) (+ v_main_~x~0_303 v_main_~y~0_258)) .cse3) (and (= v_main_~x~0_302 v_main_~x~0_303) .cse0 (or (not .cse3) (not (< v_main_~x~0_303 1000000))) .cse1 .cse2))) InVars {main_~y~0=v_main_~y~0_259, main_#t~post5=|v_main_#t~post5_67|, main_~x~0=v_main_~x~0_303, main_#t~post6=|v_main_#t~post6_67|} OutVars{main_~y~0=v_main_~y~0_258, main_#t~post5=|v_main_#t~post5_66|, main_~x~0=v_main_~x~0_302, main_#t~post6=|v_main_#t~post6_66|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {5225#(<= 50000 main_~y~0)} is VALID [2022-04-28 03:51:13,707 INFO L290 TraceCheckUtils]: 9: Hoare triple {5225#(<= 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[] {5225#(<= 50000 main_~y~0)} is VALID [2022-04-28 03:51:13,708 INFO L290 TraceCheckUtils]: 10: Hoare triple {5225#(<= 50000 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {5226#(<= 49998 main_~y~0)} is VALID [2022-04-28 03:51:13,708 INFO L290 TraceCheckUtils]: 11: Hoare triple {5226#(<= 49998 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {5227#(<= 49996 main_~y~0)} is VALID [2022-04-28 03:51:13,709 INFO L290 TraceCheckUtils]: 12: Hoare triple {5227#(<= 49996 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {5228#(<= 49994 main_~y~0)} is VALID [2022-04-28 03:51:13,709 INFO L290 TraceCheckUtils]: 13: Hoare triple {5228#(<= 49994 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {5229#(<= 49992 main_~y~0)} is VALID [2022-04-28 03:51:13,710 INFO L290 TraceCheckUtils]: 14: Hoare triple {5229#(<= 49992 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {5230#(<= 49990 main_~y~0)} is VALID [2022-04-28 03:51:13,710 INFO L290 TraceCheckUtils]: 15: Hoare triple {5230#(<= 49990 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {5231#(<= 49988 main_~y~0)} is VALID [2022-04-28 03:51:13,711 INFO L290 TraceCheckUtils]: 16: Hoare triple {5231#(<= 49988 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {5232#(<= 49986 main_~y~0)} is VALID [2022-04-28 03:51:13,711 INFO L290 TraceCheckUtils]: 17: Hoare triple {5232#(<= 49986 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {5233#(<= 49984 main_~y~0)} is VALID [2022-04-28 03:51:13,712 INFO L290 TraceCheckUtils]: 18: Hoare triple {5233#(<= 49984 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {5234#(<= 49982 main_~y~0)} is VALID [2022-04-28 03:51:13,712 INFO L290 TraceCheckUtils]: 19: Hoare triple {5234#(<= 49982 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {5235#(<= 49980 main_~y~0)} is VALID [2022-04-28 03:51:13,712 INFO L290 TraceCheckUtils]: 20: Hoare triple {5235#(<= 49980 main_~y~0)} assume !(~y~0 > 0); {5221#false} is VALID [2022-04-28 03:51:13,712 INFO L272 TraceCheckUtils]: 21: Hoare triple {5221#false} call __VERIFIER_assert((if ~z~0 == ~x~0 then 1 else 0)); {5221#false} is VALID [2022-04-28 03:51:13,713 INFO L290 TraceCheckUtils]: 22: Hoare triple {5221#false} ~cond := #in~cond; {5221#false} is VALID [2022-04-28 03:51:13,713 INFO L290 TraceCheckUtils]: 23: Hoare triple {5221#false} assume 0 == ~cond; {5221#false} is VALID [2022-04-28 03:51:13,713 INFO L290 TraceCheckUtils]: 24: Hoare triple {5221#false} assume !false; {5221#false} is VALID [2022-04-28 03:51:13,713 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-04-28 03:51:13,713 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 03:51:13,713 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [725940363] [2022-04-28 03:51:13,713 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [725940363] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 03:51:13,713 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [42486927] [2022-04-28 03:51:13,713 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:51:13,713 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 03:51:13,714 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 03:51:13,714 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 03:51:13,716 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2022-04-28 03:51:13,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:51:13,747 INFO L263 TraceCheckSpWp]: Trace formula consists of 109 conjuncts, 16 conjunts are in the unsatisfiable core [2022-04-28 03:51:13,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:51:13,765 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 03:51:14,173 INFO L272 TraceCheckUtils]: 0: Hoare triple {5220#true} call ULTIMATE.init(); {5220#true} is VALID [2022-04-28 03:51:14,174 INFO L290 TraceCheckUtils]: 1: Hoare triple {5220#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); {5220#true} is VALID [2022-04-28 03:51:14,174 INFO L290 TraceCheckUtils]: 2: Hoare triple {5220#true} assume true; {5220#true} is VALID [2022-04-28 03:51:14,174 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {5220#true} {5220#true} #52#return; {5220#true} is VALID [2022-04-28 03:51:14,174 INFO L272 TraceCheckUtils]: 4: Hoare triple {5220#true} call #t~ret7 := main(); {5220#true} is VALID [2022-04-28 03:51:14,174 INFO L290 TraceCheckUtils]: 5: Hoare triple {5220#true} ~x~0 := 0;~y~0 := 50000;~z~0 := 0;~x~0 := 0; {5255#(and (<= main_~x~0 0) (<= 50000 main_~y~0))} is VALID [2022-04-28 03:51:14,175 INFO L290 TraceCheckUtils]: 6: Hoare triple {5255#(and (<= main_~x~0 0) (<= 50000 main_~y~0))} [96] L11-2-->L18-1_primed: Formula: (let ((.cse0 (= |v_main_#t~post4_65| |v_main_#t~post4_64|)) (.cse1 (= v_main_~x~0_301 v_main_~x~0_300))) (or (and .cse0 .cse1 (<= 50000 v_main_~x~0_301)) (and .cse0 .cse1) (and (< v_main_~x~0_301 v_main_~x~0_300) (< v_main_~x~0_300 50001)))) InVars {main_~x~0=v_main_~x~0_301, main_#t~post4=|v_main_#t~post4_65|} OutVars{main_~x~0=v_main_~x~0_300, main_#t~post4=|v_main_#t~post4_64|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {5259#(and (< main_~x~0 50001) (<= 50000 main_~y~0))} is VALID [2022-04-28 03:51:14,175 INFO L290 TraceCheckUtils]: 7: Hoare triple {5259#(and (< main_~x~0 50001) (<= 50000 main_~y~0))} [97] L18-1_primed-->L11-2: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {5259#(and (< main_~x~0 50001) (<= 50000 main_~y~0))} is VALID [2022-04-28 03:51:14,176 INFO L290 TraceCheckUtils]: 8: Hoare triple {5259#(and (< main_~x~0 50001) (<= 50000 main_~y~0))} [98] L11-2-->L18-1_primed: Formula: (let ((.cse0 (= v_main_~y~0_259 v_main_~y~0_258)) (.cse3 (<= 50000 v_main_~x~0_303)) (.cse1 (= |v_main_#t~post6_67| |v_main_#t~post6_66|)) (.cse2 (= |v_main_#t~post5_67| |v_main_#t~post5_66|))) (or (and (= v_main_~x~0_303 v_main_~x~0_302) .cse0 .cse1 .cse2) (and (< v_main_~x~0_302 1000001) (< v_main_~x~0_303 v_main_~x~0_302) (= (+ v_main_~x~0_302 v_main_~y~0_259) (+ v_main_~x~0_303 v_main_~y~0_258)) .cse3) (and (= v_main_~x~0_302 v_main_~x~0_303) .cse0 (or (not .cse3) (not (< v_main_~x~0_303 1000000))) .cse1 .cse2))) InVars {main_~y~0=v_main_~y~0_259, main_#t~post5=|v_main_#t~post5_67|, main_~x~0=v_main_~x~0_303, main_#t~post6=|v_main_#t~post6_67|} OutVars{main_~y~0=v_main_~y~0_258, main_#t~post5=|v_main_#t~post5_66|, main_~x~0=v_main_~x~0_302, main_#t~post6=|v_main_#t~post6_66|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {5266#(or (and (< main_~x~0 50001) (<= 50000 main_~y~0)) (and (< main_~x~0 (+ main_~y~0 1)) (< main_~x~0 1000001) (< 50000 main_~x~0)))} is VALID [2022-04-28 03:51:14,177 INFO L290 TraceCheckUtils]: 9: Hoare triple {5266#(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)))} [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[] {5270#(< 999999 main_~y~0)} is VALID [2022-04-28 03:51:14,177 INFO L290 TraceCheckUtils]: 10: Hoare triple {5270#(< 999999 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {5274#(< 999997 main_~y~0)} is VALID [2022-04-28 03:51:14,178 INFO L290 TraceCheckUtils]: 11: Hoare triple {5274#(< 999997 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {5278#(< 999995 main_~y~0)} is VALID [2022-04-28 03:51:14,178 INFO L290 TraceCheckUtils]: 12: Hoare triple {5278#(< 999995 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {5282#(< 999993 main_~y~0)} is VALID [2022-04-28 03:51:14,178 INFO L290 TraceCheckUtils]: 13: Hoare triple {5282#(< 999993 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {5286#(< 999991 main_~y~0)} is VALID [2022-04-28 03:51:14,179 INFO L290 TraceCheckUtils]: 14: Hoare triple {5286#(< 999991 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {5290#(< 999989 main_~y~0)} is VALID [2022-04-28 03:51:14,179 INFO L290 TraceCheckUtils]: 15: Hoare triple {5290#(< 999989 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {5294#(< 999987 main_~y~0)} is VALID [2022-04-28 03:51:14,180 INFO L290 TraceCheckUtils]: 16: Hoare triple {5294#(< 999987 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {5298#(< 999985 main_~y~0)} is VALID [2022-04-28 03:51:14,180 INFO L290 TraceCheckUtils]: 17: Hoare triple {5298#(< 999985 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {5302#(< 999983 main_~y~0)} is VALID [2022-04-28 03:51:14,180 INFO L290 TraceCheckUtils]: 18: Hoare triple {5302#(< 999983 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {5306#(< 999981 main_~y~0)} is VALID [2022-04-28 03:51:14,181 INFO L290 TraceCheckUtils]: 19: Hoare triple {5306#(< 999981 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {5310#(< 999979 main_~y~0)} is VALID [2022-04-28 03:51:14,181 INFO L290 TraceCheckUtils]: 20: Hoare triple {5310#(< 999979 main_~y~0)} assume !(~y~0 > 0); {5221#false} is VALID [2022-04-28 03:51:14,181 INFO L272 TraceCheckUtils]: 21: Hoare triple {5221#false} call __VERIFIER_assert((if ~z~0 == ~x~0 then 1 else 0)); {5221#false} is VALID [2022-04-28 03:51:14,181 INFO L290 TraceCheckUtils]: 22: Hoare triple {5221#false} ~cond := #in~cond; {5221#false} is VALID [2022-04-28 03:51:14,181 INFO L290 TraceCheckUtils]: 23: Hoare triple {5221#false} assume 0 == ~cond; {5221#false} is VALID [2022-04-28 03:51:14,182 INFO L290 TraceCheckUtils]: 24: Hoare triple {5221#false} assume !false; {5221#false} is VALID [2022-04-28 03:51:14,182 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 0 proven. 57 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 03:51:14,182 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 03:51:14,811 INFO L290 TraceCheckUtils]: 24: Hoare triple {5221#false} assume !false; {5221#false} is VALID [2022-04-28 03:51:14,811 INFO L290 TraceCheckUtils]: 23: Hoare triple {5221#false} assume 0 == ~cond; {5221#false} is VALID [2022-04-28 03:51:14,811 INFO L290 TraceCheckUtils]: 22: Hoare triple {5221#false} ~cond := #in~cond; {5221#false} is VALID [2022-04-28 03:51:14,811 INFO L272 TraceCheckUtils]: 21: Hoare triple {5221#false} call __VERIFIER_assert((if ~z~0 == ~x~0 then 1 else 0)); {5221#false} is VALID [2022-04-28 03:51:14,813 INFO L290 TraceCheckUtils]: 20: Hoare triple {5338#(< 0 main_~y~0)} assume !(~y~0 > 0); {5221#false} is VALID [2022-04-28 03:51:14,814 INFO L290 TraceCheckUtils]: 19: Hoare triple {5342#(< 2 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {5338#(< 0 main_~y~0)} is VALID [2022-04-28 03:51:14,814 INFO L290 TraceCheckUtils]: 18: Hoare triple {5346#(< 4 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {5342#(< 2 main_~y~0)} is VALID [2022-04-28 03:51:14,816 INFO L290 TraceCheckUtils]: 17: Hoare triple {5350#(< 6 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {5346#(< 4 main_~y~0)} is VALID [2022-04-28 03:51:14,816 INFO L290 TraceCheckUtils]: 16: Hoare triple {5354#(< 8 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {5350#(< 6 main_~y~0)} is VALID [2022-04-28 03:51:14,820 INFO L290 TraceCheckUtils]: 15: Hoare triple {5358#(< 10 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {5354#(< 8 main_~y~0)} is VALID [2022-04-28 03:51:14,821 INFO L290 TraceCheckUtils]: 14: Hoare triple {5362#(< 12 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {5358#(< 10 main_~y~0)} is VALID [2022-04-28 03:51:14,821 INFO L290 TraceCheckUtils]: 13: Hoare triple {5366#(< 14 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {5362#(< 12 main_~y~0)} is VALID [2022-04-28 03:51:14,821 INFO L290 TraceCheckUtils]: 12: Hoare triple {5370#(< 16 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {5366#(< 14 main_~y~0)} is VALID [2022-04-28 03:51:14,822 INFO L290 TraceCheckUtils]: 11: Hoare triple {5374#(< 18 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {5370#(< 16 main_~y~0)} is VALID [2022-04-28 03:51:14,822 INFO L290 TraceCheckUtils]: 10: Hoare triple {5378#(< 20 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {5374#(< 18 main_~y~0)} is VALID [2022-04-28 03:51:14,823 INFO L290 TraceCheckUtils]: 9: Hoare triple {5382#(or (< main_~x~0 1000000) (< 20 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[] {5378#(< 20 main_~y~0)} is VALID [2022-04-28 03:51:14,823 INFO L290 TraceCheckUtils]: 8: Hoare triple {5386#(and (or (< main_~x~0 1000000) (< 20 main_~y~0)) (or (< main_~x~0 (+ 999980 main_~y~0)) (<= 1000000 main_~x~0) (not (<= 50000 main_~x~0))))} [98] L11-2-->L18-1_primed: Formula: (let ((.cse0 (= v_main_~y~0_259 v_main_~y~0_258)) (.cse3 (<= 50000 v_main_~x~0_303)) (.cse1 (= |v_main_#t~post6_67| |v_main_#t~post6_66|)) (.cse2 (= |v_main_#t~post5_67| |v_main_#t~post5_66|))) (or (and (= v_main_~x~0_303 v_main_~x~0_302) .cse0 .cse1 .cse2) (and (< v_main_~x~0_302 1000001) (< v_main_~x~0_303 v_main_~x~0_302) (= (+ v_main_~x~0_302 v_main_~y~0_259) (+ v_main_~x~0_303 v_main_~y~0_258)) .cse3) (and (= v_main_~x~0_302 v_main_~x~0_303) .cse0 (or (not .cse3) (not (< v_main_~x~0_303 1000000))) .cse1 .cse2))) InVars {main_~y~0=v_main_~y~0_259, main_#t~post5=|v_main_#t~post5_67|, main_~x~0=v_main_~x~0_303, main_#t~post6=|v_main_#t~post6_67|} OutVars{main_~y~0=v_main_~y~0_258, main_#t~post5=|v_main_#t~post5_66|, main_~x~0=v_main_~x~0_302, main_#t~post6=|v_main_#t~post6_66|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {5382#(or (< main_~x~0 1000000) (< 20 main_~y~0))} is VALID [2022-04-28 03:51:14,824 INFO L290 TraceCheckUtils]: 7: Hoare triple {5386#(and (or (< main_~x~0 1000000) (< 20 main_~y~0)) (or (< main_~x~0 (+ 999980 main_~y~0)) (<= 1000000 main_~x~0) (not (<= 50000 main_~x~0))))} [97] L18-1_primed-->L11-2: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {5386#(and (or (< main_~x~0 1000000) (< 20 main_~y~0)) (or (< main_~x~0 (+ 999980 main_~y~0)) (<= 1000000 main_~x~0) (not (<= 50000 main_~x~0))))} is VALID [2022-04-28 03:51:14,825 INFO L290 TraceCheckUtils]: 6: Hoare triple {5393#(and (or (< main_~x~0 (+ 999980 main_~y~0)) (<= 1000000 main_~x~0)) (or (< main_~x~0 1000000) (< 20 main_~y~0)) (<= 0 (+ main_~y~0 949979)))} [96] L11-2-->L18-1_primed: Formula: (let ((.cse0 (= |v_main_#t~post4_65| |v_main_#t~post4_64|)) (.cse1 (= v_main_~x~0_301 v_main_~x~0_300))) (or (and .cse0 .cse1 (<= 50000 v_main_~x~0_301)) (and .cse0 .cse1) (and (< v_main_~x~0_301 v_main_~x~0_300) (< v_main_~x~0_300 50001)))) InVars {main_~x~0=v_main_~x~0_301, main_#t~post4=|v_main_#t~post4_65|} OutVars{main_~x~0=v_main_~x~0_300, main_#t~post4=|v_main_#t~post4_64|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {5386#(and (or (< main_~x~0 1000000) (< 20 main_~y~0)) (or (< main_~x~0 (+ 999980 main_~y~0)) (<= 1000000 main_~x~0) (not (<= 50000 main_~x~0))))} is VALID [2022-04-28 03:51:14,825 INFO L290 TraceCheckUtils]: 5: Hoare triple {5220#true} ~x~0 := 0;~y~0 := 50000;~z~0 := 0;~x~0 := 0; {5393#(and (or (< main_~x~0 (+ 999980 main_~y~0)) (<= 1000000 main_~x~0)) (or (< main_~x~0 1000000) (< 20 main_~y~0)) (<= 0 (+ main_~y~0 949979)))} is VALID [2022-04-28 03:51:14,825 INFO L272 TraceCheckUtils]: 4: Hoare triple {5220#true} call #t~ret7 := main(); {5220#true} is VALID [2022-04-28 03:51:14,825 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {5220#true} {5220#true} #52#return; {5220#true} is VALID [2022-04-28 03:51:14,825 INFO L290 TraceCheckUtils]: 2: Hoare triple {5220#true} assume true; {5220#true} is VALID [2022-04-28 03:51:14,825 INFO L290 TraceCheckUtils]: 1: Hoare triple {5220#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); {5220#true} is VALID [2022-04-28 03:51:14,825 INFO L272 TraceCheckUtils]: 0: Hoare triple {5220#true} call ULTIMATE.init(); {5220#true} is VALID [2022-04-28 03:51:14,825 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 0 proven. 57 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 03:51:14,826 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [42486927] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 03:51:14,826 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 03:51:14,826 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 16, 16] total 42 [2022-04-28 03:51:15,421 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 03:51:15,421 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [659710188] [2022-04-28 03:51:15,421 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [659710188] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 03:51:15,421 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 03:51:15,421 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [34] imperfect sequences [] total 34 [2022-04-28 03:51:15,421 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1299629144] [2022-04-28 03:51:15,421 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 03:51:15,422 INFO L78 Accepts]: Start accepts. Automaton has has 34 states, 34 states have (on average 1.6470588235294117) internal successors, (56), 33 states have internal predecessors, (56), 2 states have call successors, (3), 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 60 [2022-04-28 03:51:15,422 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 03:51:15,422 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 34 states, 34 states have (on average 1.6470588235294117) internal successors, (56), 33 states have internal predecessors, (56), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:51:15,461 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 60 edges. 60 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 03:51:15,461 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 34 states [2022-04-28 03:51:15,461 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 03:51:15,462 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2022-04-28 03:51:15,463 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1310, Invalid=2350, Unknown=0, NotChecked=0, Total=3660 [2022-04-28 03:51:15,463 INFO L87 Difference]: Start difference. First operand 61 states and 64 transitions. Second operand has 34 states, 34 states have (on average 1.6470588235294117) internal successors, (56), 33 states have internal predecessors, (56), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:51:17,339 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:51:17,339 INFO L93 Difference]: Finished difference Result 119 states and 130 transitions. [2022-04-28 03:51:17,339 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2022-04-28 03:51:17,339 INFO L78 Accepts]: Start accepts. Automaton has has 34 states, 34 states have (on average 1.6470588235294117) internal successors, (56), 33 states have internal predecessors, (56), 2 states have call successors, (3), 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 60 [2022-04-28 03:51:17,339 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 03:51:17,339 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34 states, 34 states have (on average 1.6470588235294117) internal successors, (56), 33 states have internal predecessors, (56), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:51:17,340 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 82 transitions. [2022-04-28 03:51:17,341 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34 states, 34 states have (on average 1.6470588235294117) internal successors, (56), 33 states have internal predecessors, (56), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:51:17,341 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 82 transitions. [2022-04-28 03:51:17,341 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 34 states and 82 transitions. [2022-04-28 03:51:17,409 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 82 edges. 82 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 03:51:17,410 INFO L225 Difference]: With dead ends: 119 [2022-04-28 03:51:17,410 INFO L226 Difference]: Without dead ends: 66 [2022-04-28 03:51:17,412 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 139 GetRequests, 48 SyntacticMatches, 1 SemanticMatches, 90 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2782 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=2475, Invalid=5897, Unknown=0, NotChecked=0, Total=8372 [2022-04-28 03:51:17,412 INFO L413 NwaCegarLoop]: 12 mSDtfsCounter, 115 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 786 mSolverCounterSat, 88 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 115 SdHoareTripleChecker+Valid, 24 SdHoareTripleChecker+Invalid, 874 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 88 IncrementalHoareTripleChecker+Valid, 786 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-04-28 03:51:17,412 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [115 Valid, 24 Invalid, 874 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [88 Valid, 786 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-04-28 03:51:17,412 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2022-04-28 03:51:17,506 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 66. [2022-04-28 03:51:17,506 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 03:51:17,506 INFO L82 GeneralOperation]: Start isEquivalent. First operand 66 states. Second operand has 66 states, 61 states have (on average 1.0655737704918034) internal successors, (65), 61 states have internal predecessors, (65), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:51:17,506 INFO L74 IsIncluded]: Start isIncluded. First operand 66 states. Second operand has 66 states, 61 states have (on average 1.0655737704918034) internal successors, (65), 61 states have internal predecessors, (65), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:51:17,506 INFO L87 Difference]: Start difference. First operand 66 states. Second operand has 66 states, 61 states have (on average 1.0655737704918034) internal successors, (65), 61 states have internal predecessors, (65), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:51:17,507 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:51:17,507 INFO L93 Difference]: Finished difference Result 66 states and 69 transitions. [2022-04-28 03:51:17,507 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 69 transitions. [2022-04-28 03:51:17,508 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:51:17,508 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:51:17,508 INFO L74 IsIncluded]: Start isIncluded. First operand has 66 states, 61 states have (on average 1.0655737704918034) internal successors, (65), 61 states have internal predecessors, (65), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 66 states. [2022-04-28 03:51:17,508 INFO L87 Difference]: Start difference. First operand has 66 states, 61 states have (on average 1.0655737704918034) internal successors, (65), 61 states have internal predecessors, (65), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 66 states. [2022-04-28 03:51:17,509 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:51:17,509 INFO L93 Difference]: Finished difference Result 66 states and 69 transitions. [2022-04-28 03:51:17,509 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 69 transitions. [2022-04-28 03:51:17,509 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:51:17,509 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:51:17,510 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 03:51:17,510 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 03:51:17,510 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 66 states, 61 states have (on average 1.0655737704918034) internal successors, (65), 61 states have internal predecessors, (65), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:51:17,510 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 69 transitions. [2022-04-28 03:51:17,510 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 69 transitions. Word has length 60 [2022-04-28 03:51:17,511 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 03:51:17,511 INFO L495 AbstractCegarLoop]: Abstraction has 66 states and 69 transitions. [2022-04-28 03:51:17,511 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 34 states, 34 states have (on average 1.6470588235294117) internal successors, (56), 33 states have internal predecessors, (56), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:51:17,511 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 66 states and 69 transitions. [2022-04-28 03:51:17,566 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 69 edges. 69 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 03:51:17,566 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 69 transitions. [2022-04-28 03:51:17,567 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2022-04-28 03:51:17,567 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 03:51:17,567 INFO L195 NwaCegarLoop]: trace histogram [21, 20, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 03:51:17,582 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2022-04-28 03:51:17,777 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2022-04-28 03:51:17,778 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 03:51:17,778 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 03:51:17,778 INFO L85 PathProgramCache]: Analyzing trace with hash 2063311397, now seen corresponding path program 11 times [2022-04-28 03:51:17,778 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 03:51:17,778 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1989808601] [2022-04-28 03:51:17,902 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 1 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 03:51:22,022 WARN L977 rdanLoopAcceleration]: Unable to prove correctness of quantifier elimination. [2022-04-28 03:51:22,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-28 03:51:22,132 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-28 03:51:22,134 INFO L85 PathProgramCache]: Analyzing trace with hash -1169960990, now seen corresponding path program 1 times [2022-04-28 03:51:22,134 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 03:51:22,134 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1821934830] [2022-04-28 03:51:22,134 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:51:22,135 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 03:51:22,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:51:22,264 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 03:51:22,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:51:22,276 INFO L290 TraceCheckUtils]: 0: Hoare triple {6014#(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); {5997#true} is VALID [2022-04-28 03:51:22,276 INFO L290 TraceCheckUtils]: 1: Hoare triple {5997#true} assume true; {5997#true} is VALID [2022-04-28 03:51:22,276 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {5997#true} {5997#true} #52#return; {5997#true} is VALID [2022-04-28 03:51:22,276 INFO L272 TraceCheckUtils]: 0: Hoare triple {5997#true} call ULTIMATE.init(); {6014#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 03:51:22,276 INFO L290 TraceCheckUtils]: 1: Hoare triple {6014#(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); {5997#true} is VALID [2022-04-28 03:51:22,277 INFO L290 TraceCheckUtils]: 2: Hoare triple {5997#true} assume true; {5997#true} is VALID [2022-04-28 03:51:22,277 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {5997#true} {5997#true} #52#return; {5997#true} is VALID [2022-04-28 03:51:22,277 INFO L272 TraceCheckUtils]: 4: Hoare triple {5997#true} call #t~ret7 := main(); {5997#true} is VALID [2022-04-28 03:51:22,277 INFO L290 TraceCheckUtils]: 5: Hoare triple {5997#true} ~x~0 := 0;~y~0 := 50000;~z~0 := 0;~x~0 := 0; {6002#(<= 50000 main_~y~0)} is VALID [2022-04-28 03:51:22,277 INFO L290 TraceCheckUtils]: 6: Hoare triple {6002#(<= 50000 main_~y~0)} [100] L11-2-->L18-1_primed: Formula: (let ((.cse0 (= |v_main_#t~post4_72| |v_main_#t~post4_71|))) (or (and (= v_main_~x~0_347 v_main_~x~0_346) .cse0) (and (= v_main_~x~0_346 v_main_~x~0_347) (not (< v_main_~x~0_347 50000)) .cse0) (and (< v_main_~x~0_347 v_main_~x~0_346) (< v_main_~x~0_346 50001)))) InVars {main_~x~0=v_main_~x~0_347, main_#t~post4=|v_main_#t~post4_72|} OutVars{main_~x~0=v_main_~x~0_346, main_#t~post4=|v_main_#t~post4_71|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {6002#(<= 50000 main_~y~0)} is VALID [2022-04-28 03:51:22,278 INFO L290 TraceCheckUtils]: 7: Hoare triple {6002#(<= 50000 main_~y~0)} [101] L18-1_primed-->L11-2: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {6002#(<= 50000 main_~y~0)} is VALID [2022-04-28 03:51:22,279 INFO L290 TraceCheckUtils]: 8: Hoare triple {6002#(<= 50000 main_~y~0)} [102] L11-2-->L18-1_primed: Formula: (let ((.cse0 (= v_main_~y~0_306 v_main_~y~0_305)) (.cse1 (= |v_main_#t~post6_74| |v_main_#t~post6_73|)) (.cse3 (= v_main_~x~0_349 v_main_~x~0_348)) (.cse4 (= |v_main_#t~post5_74| |v_main_#t~post5_73|)) (.cse2 (<= 50000 v_main_~x~0_349))) (or (and .cse0 .cse1 (or (not (< v_main_~x~0_349 1000000)) (not .cse2)) .cse3 .cse4) (and .cse0 .cse1 .cse3 .cse4) (let ((.cse5 (+ v_main_~x~0_349 v_main_~y~0_305))) (and (= (+ v_main_~x~0_348 v_main_~y~0_306) .cse5) (< v_main_~y~0_306 v_main_~y~0_305) (< .cse5 (+ v_main_~y~0_306 1000001)) .cse2)))) InVars {main_~y~0=v_main_~y~0_306, main_#t~post5=|v_main_#t~post5_74|, main_~x~0=v_main_~x~0_349, main_#t~post6=|v_main_#t~post6_74|} OutVars{main_~y~0=v_main_~y~0_305, main_#t~post5=|v_main_#t~post5_73|, main_~x~0=v_main_~x~0_348, main_#t~post6=|v_main_#t~post6_73|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {6002#(<= 50000 main_~y~0)} is VALID [2022-04-28 03:51:22,279 INFO L290 TraceCheckUtils]: 9: Hoare triple {6002#(<= 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[] {6002#(<= 50000 main_~y~0)} is VALID [2022-04-28 03:51:22,280 INFO L290 TraceCheckUtils]: 10: Hoare triple {6002#(<= 50000 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {6003#(<= 49998 main_~y~0)} is VALID [2022-04-28 03:51:22,280 INFO L290 TraceCheckUtils]: 11: Hoare triple {6003#(<= 49998 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {6004#(<= 49996 main_~y~0)} is VALID [2022-04-28 03:51:22,281 INFO L290 TraceCheckUtils]: 12: Hoare triple {6004#(<= 49996 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {6005#(<= 49994 main_~y~0)} is VALID [2022-04-28 03:51:22,281 INFO L290 TraceCheckUtils]: 13: Hoare triple {6005#(<= 49994 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {6006#(<= 49992 main_~y~0)} is VALID [2022-04-28 03:51:22,282 INFO L290 TraceCheckUtils]: 14: Hoare triple {6006#(<= 49992 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {6007#(<= 49990 main_~y~0)} is VALID [2022-04-28 03:51:22,282 INFO L290 TraceCheckUtils]: 15: Hoare triple {6007#(<= 49990 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {6008#(<= 49988 main_~y~0)} is VALID [2022-04-28 03:51:22,282 INFO L290 TraceCheckUtils]: 16: Hoare triple {6008#(<= 49988 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {6009#(<= 49986 main_~y~0)} is VALID [2022-04-28 03:51:22,283 INFO L290 TraceCheckUtils]: 17: Hoare triple {6009#(<= 49986 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {6010#(<= 49984 main_~y~0)} is VALID [2022-04-28 03:51:22,283 INFO L290 TraceCheckUtils]: 18: Hoare triple {6010#(<= 49984 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {6011#(<= 49982 main_~y~0)} is VALID [2022-04-28 03:51:22,284 INFO L290 TraceCheckUtils]: 19: Hoare triple {6011#(<= 49982 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {6012#(<= 49980 main_~y~0)} is VALID [2022-04-28 03:51:22,284 INFO L290 TraceCheckUtils]: 20: Hoare triple {6012#(<= 49980 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {6013#(<= 49978 main_~y~0)} is VALID [2022-04-28 03:51:22,285 INFO L290 TraceCheckUtils]: 21: Hoare triple {6013#(<= 49978 main_~y~0)} assume !(~y~0 > 0); {5998#false} is VALID [2022-04-28 03:51:22,286 INFO L272 TraceCheckUtils]: 22: Hoare triple {5998#false} call __VERIFIER_assert((if ~z~0 == ~x~0 then 1 else 0)); {5998#false} is VALID [2022-04-28 03:51:22,286 INFO L290 TraceCheckUtils]: 23: Hoare triple {5998#false} ~cond := #in~cond; {5998#false} is VALID [2022-04-28 03:51:22,286 INFO L290 TraceCheckUtils]: 24: Hoare triple {5998#false} assume 0 == ~cond; {5998#false} is VALID [2022-04-28 03:51:22,286 INFO L290 TraceCheckUtils]: 25: Hoare triple {5998#false} assume !false; {5998#false} is VALID [2022-04-28 03:51:22,286 INFO L134 CoverageAnalysis]: Checked inductivity of 68 backedges. 0 proven. 66 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-04-28 03:51:22,286 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 03:51:22,286 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1821934830] [2022-04-28 03:51:22,287 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1821934830] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 03:51:22,287 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [674365744] [2022-04-28 03:51:22,287 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:51:22,287 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 03:51:22,287 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 03:51:22,296 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 03:51:22,297 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2022-04-28 03:51:22,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:51:22,331 INFO L263 TraceCheckSpWp]: Trace formula consists of 114 conjuncts, 14 conjunts are in the unsatisfiable core [2022-04-28 03:51:22,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:51:22,342 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 03:51:22,583 INFO L272 TraceCheckUtils]: 0: Hoare triple {5997#true} call ULTIMATE.init(); {5997#true} is VALID [2022-04-28 03:51:22,583 INFO L290 TraceCheckUtils]: 1: Hoare triple {5997#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); {5997#true} is VALID [2022-04-28 03:51:22,583 INFO L290 TraceCheckUtils]: 2: Hoare triple {5997#true} assume true; {5997#true} is VALID [2022-04-28 03:51:22,583 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {5997#true} {5997#true} #52#return; {5997#true} is VALID [2022-04-28 03:51:22,583 INFO L272 TraceCheckUtils]: 4: Hoare triple {5997#true} call #t~ret7 := main(); {5997#true} is VALID [2022-04-28 03:51:22,584 INFO L290 TraceCheckUtils]: 5: Hoare triple {5997#true} ~x~0 := 0;~y~0 := 50000;~z~0 := 0;~x~0 := 0; {6002#(<= 50000 main_~y~0)} is VALID [2022-04-28 03:51:22,584 INFO L290 TraceCheckUtils]: 6: Hoare triple {6002#(<= 50000 main_~y~0)} [100] L11-2-->L18-1_primed: Formula: (let ((.cse0 (= |v_main_#t~post4_72| |v_main_#t~post4_71|))) (or (and (= v_main_~x~0_347 v_main_~x~0_346) .cse0) (and (= v_main_~x~0_346 v_main_~x~0_347) (not (< v_main_~x~0_347 50000)) .cse0) (and (< v_main_~x~0_347 v_main_~x~0_346) (< v_main_~x~0_346 50001)))) InVars {main_~x~0=v_main_~x~0_347, main_#t~post4=|v_main_#t~post4_72|} OutVars{main_~x~0=v_main_~x~0_346, main_#t~post4=|v_main_#t~post4_71|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {6002#(<= 50000 main_~y~0)} is VALID [2022-04-28 03:51:22,584 INFO L290 TraceCheckUtils]: 7: Hoare triple {6002#(<= 50000 main_~y~0)} [101] L18-1_primed-->L11-2: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {6002#(<= 50000 main_~y~0)} is VALID [2022-04-28 03:51:22,585 INFO L290 TraceCheckUtils]: 8: Hoare triple {6002#(<= 50000 main_~y~0)} [102] L11-2-->L18-1_primed: Formula: (let ((.cse0 (= v_main_~y~0_306 v_main_~y~0_305)) (.cse1 (= |v_main_#t~post6_74| |v_main_#t~post6_73|)) (.cse3 (= v_main_~x~0_349 v_main_~x~0_348)) (.cse4 (= |v_main_#t~post5_74| |v_main_#t~post5_73|)) (.cse2 (<= 50000 v_main_~x~0_349))) (or (and .cse0 .cse1 (or (not (< v_main_~x~0_349 1000000)) (not .cse2)) .cse3 .cse4) (and .cse0 .cse1 .cse3 .cse4) (let ((.cse5 (+ v_main_~x~0_349 v_main_~y~0_305))) (and (= (+ v_main_~x~0_348 v_main_~y~0_306) .cse5) (< v_main_~y~0_306 v_main_~y~0_305) (< .cse5 (+ v_main_~y~0_306 1000001)) .cse2)))) InVars {main_~y~0=v_main_~y~0_306, main_#t~post5=|v_main_#t~post5_74|, main_~x~0=v_main_~x~0_349, main_#t~post6=|v_main_#t~post6_74|} OutVars{main_~y~0=v_main_~y~0_305, main_#t~post5=|v_main_#t~post5_73|, main_~x~0=v_main_~x~0_348, main_#t~post6=|v_main_#t~post6_73|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {6002#(<= 50000 main_~y~0)} is VALID [2022-04-28 03:51:22,585 INFO L290 TraceCheckUtils]: 9: Hoare triple {6002#(<= 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[] {6002#(<= 50000 main_~y~0)} is VALID [2022-04-28 03:51:22,586 INFO L290 TraceCheckUtils]: 10: Hoare triple {6002#(<= 50000 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {6003#(<= 49998 main_~y~0)} is VALID [2022-04-28 03:51:22,586 INFO L290 TraceCheckUtils]: 11: Hoare triple {6003#(<= 49998 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {6004#(<= 49996 main_~y~0)} is VALID [2022-04-28 03:51:22,587 INFO L290 TraceCheckUtils]: 12: Hoare triple {6004#(<= 49996 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {6005#(<= 49994 main_~y~0)} is VALID [2022-04-28 03:51:22,587 INFO L290 TraceCheckUtils]: 13: Hoare triple {6005#(<= 49994 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {6006#(<= 49992 main_~y~0)} is VALID [2022-04-28 03:51:22,587 INFO L290 TraceCheckUtils]: 14: Hoare triple {6006#(<= 49992 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {6007#(<= 49990 main_~y~0)} is VALID [2022-04-28 03:51:22,588 INFO L290 TraceCheckUtils]: 15: Hoare triple {6007#(<= 49990 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {6008#(<= 49988 main_~y~0)} is VALID [2022-04-28 03:51:22,588 INFO L290 TraceCheckUtils]: 16: Hoare triple {6008#(<= 49988 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {6009#(<= 49986 main_~y~0)} is VALID [2022-04-28 03:51:22,589 INFO L290 TraceCheckUtils]: 17: Hoare triple {6009#(<= 49986 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {6010#(<= 49984 main_~y~0)} is VALID [2022-04-28 03:51:22,589 INFO L290 TraceCheckUtils]: 18: Hoare triple {6010#(<= 49984 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {6011#(<= 49982 main_~y~0)} is VALID [2022-04-28 03:51:22,589 INFO L290 TraceCheckUtils]: 19: Hoare triple {6011#(<= 49982 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {6012#(<= 49980 main_~y~0)} is VALID [2022-04-28 03:51:22,590 INFO L290 TraceCheckUtils]: 20: Hoare triple {6012#(<= 49980 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {6013#(<= 49978 main_~y~0)} is VALID [2022-04-28 03:51:22,590 INFO L290 TraceCheckUtils]: 21: Hoare triple {6013#(<= 49978 main_~y~0)} assume !(~y~0 > 0); {5998#false} is VALID [2022-04-28 03:51:22,590 INFO L272 TraceCheckUtils]: 22: Hoare triple {5998#false} call __VERIFIER_assert((if ~z~0 == ~x~0 then 1 else 0)); {5998#false} is VALID [2022-04-28 03:51:22,590 INFO L290 TraceCheckUtils]: 23: Hoare triple {5998#false} ~cond := #in~cond; {5998#false} is VALID [2022-04-28 03:51:22,590 INFO L290 TraceCheckUtils]: 24: Hoare triple {5998#false} assume 0 == ~cond; {5998#false} is VALID [2022-04-28 03:51:22,591 INFO L290 TraceCheckUtils]: 25: Hoare triple {5998#false} assume !false; {5998#false} is VALID [2022-04-28 03:51:22,591 INFO L134 CoverageAnalysis]: Checked inductivity of 68 backedges. 0 proven. 66 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-04-28 03:51:22,591 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 03:51:23,028 INFO L290 TraceCheckUtils]: 25: Hoare triple {5998#false} assume !false; {5998#false} is VALID [2022-04-28 03:51:23,028 INFO L290 TraceCheckUtils]: 24: Hoare triple {5998#false} assume 0 == ~cond; {5998#false} is VALID [2022-04-28 03:51:23,028 INFO L290 TraceCheckUtils]: 23: Hoare triple {5998#false} ~cond := #in~cond; {5998#false} is VALID [2022-04-28 03:51:23,028 INFO L272 TraceCheckUtils]: 22: Hoare triple {5998#false} call __VERIFIER_assert((if ~z~0 == ~x~0 then 1 else 0)); {5998#false} is VALID [2022-04-28 03:51:23,028 INFO L290 TraceCheckUtils]: 21: Hoare triple {6105#(< 0 main_~y~0)} assume !(~y~0 > 0); {5998#false} is VALID [2022-04-28 03:51:23,029 INFO L290 TraceCheckUtils]: 20: Hoare triple {6109#(< 2 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {6105#(< 0 main_~y~0)} is VALID [2022-04-28 03:51:23,029 INFO L290 TraceCheckUtils]: 19: Hoare triple {6113#(< 4 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {6109#(< 2 main_~y~0)} is VALID [2022-04-28 03:51:23,030 INFO L290 TraceCheckUtils]: 18: Hoare triple {6117#(< 6 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {6113#(< 4 main_~y~0)} is VALID [2022-04-28 03:51:23,030 INFO L290 TraceCheckUtils]: 17: Hoare triple {6121#(< 8 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {6117#(< 6 main_~y~0)} is VALID [2022-04-28 03:51:23,031 INFO L290 TraceCheckUtils]: 16: Hoare triple {6125#(< 10 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {6121#(< 8 main_~y~0)} is VALID [2022-04-28 03:51:23,031 INFO L290 TraceCheckUtils]: 15: Hoare triple {6129#(< 12 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {6125#(< 10 main_~y~0)} is VALID [2022-04-28 03:51:23,032 INFO L290 TraceCheckUtils]: 14: Hoare triple {6133#(< 14 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {6129#(< 12 main_~y~0)} is VALID [2022-04-28 03:51:23,032 INFO L290 TraceCheckUtils]: 13: Hoare triple {6137#(< 16 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {6133#(< 14 main_~y~0)} is VALID [2022-04-28 03:51:23,033 INFO L290 TraceCheckUtils]: 12: Hoare triple {6141#(< 18 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {6137#(< 16 main_~y~0)} is VALID [2022-04-28 03:51:23,033 INFO L290 TraceCheckUtils]: 11: Hoare triple {6145#(< 20 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {6141#(< 18 main_~y~0)} is VALID [2022-04-28 03:51:23,034 INFO L290 TraceCheckUtils]: 10: Hoare triple {6149#(< 22 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {6145#(< 20 main_~y~0)} is VALID [2022-04-28 03:51:23,034 INFO L290 TraceCheckUtils]: 9: Hoare triple {6149#(< 22 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[] {6149#(< 22 main_~y~0)} is VALID [2022-04-28 03:51:23,035 INFO L290 TraceCheckUtils]: 8: Hoare triple {6149#(< 22 main_~y~0)} [102] L11-2-->L18-1_primed: Formula: (let ((.cse0 (= v_main_~y~0_306 v_main_~y~0_305)) (.cse1 (= |v_main_#t~post6_74| |v_main_#t~post6_73|)) (.cse3 (= v_main_~x~0_349 v_main_~x~0_348)) (.cse4 (= |v_main_#t~post5_74| |v_main_#t~post5_73|)) (.cse2 (<= 50000 v_main_~x~0_349))) (or (and .cse0 .cse1 (or (not (< v_main_~x~0_349 1000000)) (not .cse2)) .cse3 .cse4) (and .cse0 .cse1 .cse3 .cse4) (let ((.cse5 (+ v_main_~x~0_349 v_main_~y~0_305))) (and (= (+ v_main_~x~0_348 v_main_~y~0_306) .cse5) (< v_main_~y~0_306 v_main_~y~0_305) (< .cse5 (+ v_main_~y~0_306 1000001)) .cse2)))) InVars {main_~y~0=v_main_~y~0_306, main_#t~post5=|v_main_#t~post5_74|, main_~x~0=v_main_~x~0_349, main_#t~post6=|v_main_#t~post6_74|} OutVars{main_~y~0=v_main_~y~0_305, main_#t~post5=|v_main_#t~post5_73|, main_~x~0=v_main_~x~0_348, main_#t~post6=|v_main_#t~post6_73|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {6149#(< 22 main_~y~0)} is VALID [2022-04-28 03:51:23,035 INFO L290 TraceCheckUtils]: 7: Hoare triple {6149#(< 22 main_~y~0)} [101] L18-1_primed-->L11-2: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {6149#(< 22 main_~y~0)} is VALID [2022-04-28 03:51:23,035 INFO L290 TraceCheckUtils]: 6: Hoare triple {6149#(< 22 main_~y~0)} [100] L11-2-->L18-1_primed: Formula: (let ((.cse0 (= |v_main_#t~post4_72| |v_main_#t~post4_71|))) (or (and (= v_main_~x~0_347 v_main_~x~0_346) .cse0) (and (= v_main_~x~0_346 v_main_~x~0_347) (not (< v_main_~x~0_347 50000)) .cse0) (and (< v_main_~x~0_347 v_main_~x~0_346) (< v_main_~x~0_346 50001)))) InVars {main_~x~0=v_main_~x~0_347, main_#t~post4=|v_main_#t~post4_72|} OutVars{main_~x~0=v_main_~x~0_346, main_#t~post4=|v_main_#t~post4_71|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {6149#(< 22 main_~y~0)} is VALID [2022-04-28 03:51:23,036 INFO L290 TraceCheckUtils]: 5: Hoare triple {5997#true} ~x~0 := 0;~y~0 := 50000;~z~0 := 0;~x~0 := 0; {6149#(< 22 main_~y~0)} is VALID [2022-04-28 03:51:23,036 INFO L272 TraceCheckUtils]: 4: Hoare triple {5997#true} call #t~ret7 := main(); {5997#true} is VALID [2022-04-28 03:51:23,036 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {5997#true} {5997#true} #52#return; {5997#true} is VALID [2022-04-28 03:51:23,036 INFO L290 TraceCheckUtils]: 2: Hoare triple {5997#true} assume true; {5997#true} is VALID [2022-04-28 03:51:23,036 INFO L290 TraceCheckUtils]: 1: Hoare triple {5997#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); {5997#true} is VALID [2022-04-28 03:51:23,036 INFO L272 TraceCheckUtils]: 0: Hoare triple {5997#true} call ULTIMATE.init(); {5997#true} is VALID [2022-04-28 03:51:23,036 INFO L134 CoverageAnalysis]: Checked inductivity of 68 backedges. 0 proven. 66 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-04-28 03:51:23,036 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [674365744] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 03:51:23,036 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 03:51:23,037 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 14, 14] total 27 [2022-04-28 03:51:23,635 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 03:51:23,635 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1989808601] [2022-04-28 03:51:23,636 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1989808601] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 03:51:23,636 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 03:51:23,636 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [37] imperfect sequences [] total 37 [2022-04-28 03:51:23,636 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [878129100] [2022-04-28 03:51:23,636 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 03:51:23,636 INFO L78 Accepts]: Start accepts. Automaton has has 37 states, 37 states have (on average 1.6486486486486487) internal successors, (61), 36 states have internal predecessors, (61), 2 states have call successors, (3), 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 65 [2022-04-28 03:51:23,636 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 03:51:23,636 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 37 states, 37 states have (on average 1.6486486486486487) internal successors, (61), 36 states have internal predecessors, (61), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:51:23,686 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 65 edges. 65 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 03:51:23,686 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 37 states [2022-04-28 03:51:23,686 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 03:51:23,687 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2022-04-28 03:51:23,688 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=920, Invalid=1432, Unknown=0, NotChecked=0, Total=2352 [2022-04-28 03:51:23,688 INFO L87 Difference]: Start difference. First operand 66 states and 69 transitions. Second operand has 37 states, 37 states have (on average 1.6486486486486487) internal successors, (61), 36 states have internal predecessors, (61), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:51:25,900 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:51:25,900 INFO L93 Difference]: Finished difference Result 129 states and 140 transitions. [2022-04-28 03:51:25,900 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2022-04-28 03:51:25,900 INFO L78 Accepts]: Start accepts. Automaton has has 37 states, 37 states have (on average 1.6486486486486487) internal successors, (61), 36 states have internal predecessors, (61), 2 states have call successors, (3), 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 65 [2022-04-28 03:51:25,901 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 03:51:25,901 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 37 states, 37 states have (on average 1.6486486486486487) internal successors, (61), 36 states have internal predecessors, (61), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:51:25,902 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 87 transitions. [2022-04-28 03:51:25,902 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 37 states, 37 states have (on average 1.6486486486486487) internal successors, (61), 36 states have internal predecessors, (61), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:51:25,903 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 87 transitions. [2022-04-28 03:51:25,904 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 37 states and 87 transitions. [2022-04-28 03:51:25,985 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 87 edges. 87 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 03:51:25,986 INFO L225 Difference]: With dead ends: 129 [2022-04-28 03:51:25,986 INFO L226 Difference]: Without dead ends: 71 [2022-04-28 03:51:25,988 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 149 GetRequests, 67 SyntacticMatches, 1 SemanticMatches, 81 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1893 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=2166, Invalid=4640, Unknown=0, NotChecked=0, Total=6806 [2022-04-28 03:51:25,988 INFO L413 NwaCegarLoop]: 12 mSDtfsCounter, 79 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 968 mSolverCounterSat, 117 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 79 SdHoareTripleChecker+Valid, 34 SdHoareTripleChecker+Invalid, 1085 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 117 IncrementalHoareTripleChecker+Valid, 968 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2022-04-28 03:51:25,988 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [79 Valid, 34 Invalid, 1085 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [117 Valid, 968 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2022-04-28 03:51:25,989 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2022-04-28 03:51:26,077 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 71. [2022-04-28 03:51:26,077 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 03:51:26,077 INFO L82 GeneralOperation]: Start isEquivalent. First operand 71 states. Second operand has 71 states, 66 states have (on average 1.0606060606060606) internal successors, (70), 66 states have internal predecessors, (70), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:51:26,077 INFO L74 IsIncluded]: Start isIncluded. First operand 71 states. Second operand has 71 states, 66 states have (on average 1.0606060606060606) internal successors, (70), 66 states have internal predecessors, (70), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:51:26,077 INFO L87 Difference]: Start difference. First operand 71 states. Second operand has 71 states, 66 states have (on average 1.0606060606060606) internal successors, (70), 66 states have internal predecessors, (70), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:51:26,078 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:51:26,078 INFO L93 Difference]: Finished difference Result 71 states and 74 transitions. [2022-04-28 03:51:26,078 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 74 transitions. [2022-04-28 03:51:26,079 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:51:26,079 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:51:26,079 INFO L74 IsIncluded]: Start isIncluded. First operand has 71 states, 66 states have (on average 1.0606060606060606) internal successors, (70), 66 states have internal predecessors, (70), 3 states have call successors, (3), 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 71 states. [2022-04-28 03:51:26,079 INFO L87 Difference]: Start difference. First operand has 71 states, 66 states have (on average 1.0606060606060606) internal successors, (70), 66 states have internal predecessors, (70), 3 states have call successors, (3), 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 71 states. [2022-04-28 03:51:26,080 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:51:26,080 INFO L93 Difference]: Finished difference Result 71 states and 74 transitions. [2022-04-28 03:51:26,080 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 74 transitions. [2022-04-28 03:51:26,080 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:51:26,080 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:51:26,080 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 03:51:26,080 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 03:51:26,080 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 71 states, 66 states have (on average 1.0606060606060606) internal successors, (70), 66 states have internal predecessors, (70), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:51:26,081 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 74 transitions. [2022-04-28 03:51:26,081 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 74 transitions. Word has length 65 [2022-04-28 03:51:26,081 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 03:51:26,081 INFO L495 AbstractCegarLoop]: Abstraction has 71 states and 74 transitions. [2022-04-28 03:51:26,081 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 37 states, 37 states have (on average 1.6486486486486487) internal successors, (61), 36 states have internal predecessors, (61), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:51:26,081 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 71 states and 74 transitions. [2022-04-28 03:51:26,140 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 74 edges. 74 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 03:51:26,140 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 74 transitions. [2022-04-28 03:51:26,140 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2022-04-28 03:51:26,140 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 03:51:26,141 INFO L195 NwaCegarLoop]: trace histogram [23, 22, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 03:51:26,156 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-28 03:51:26,341 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2022-04-28 03:51:26,341 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 03:51:26,341 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 03:51:26,341 INFO L85 PathProgramCache]: Analyzing trace with hash -481533656, now seen corresponding path program 12 times [2022-04-28 03:51:26,342 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 03:51:26,342 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [304244554] [2022-04-28 03:51:30,403 WARN L977 rdanLoopAcceleration]: Unable to prove correctness of quantifier elimination. [2022-04-28 03:51:30,452 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 1 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 03:51:30,652 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={1=1, 2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 03:51:30,653 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-28 03:51:30,655 INFO L85 PathProgramCache]: Analyzing trace with hash -1439650111, now seen corresponding path program 1 times [2022-04-28 03:51:30,655 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 03:51:30,655 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [563639439] [2022-04-28 03:51:30,656 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:51:30,656 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 03:51:30,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:51:30,809 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 03:51:30,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:51:30,815 INFO L290 TraceCheckUtils]: 0: Hoare triple {6832#(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); {6814#true} is VALID [2022-04-28 03:51:30,815 INFO L290 TraceCheckUtils]: 1: Hoare triple {6814#true} assume true; {6814#true} is VALID [2022-04-28 03:51:30,815 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {6814#true} {6814#true} #52#return; {6814#true} is VALID [2022-04-28 03:51:30,815 INFO L272 TraceCheckUtils]: 0: Hoare triple {6814#true} call ULTIMATE.init(); {6832#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 03:51:30,815 INFO L290 TraceCheckUtils]: 1: Hoare triple {6832#(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); {6814#true} is VALID [2022-04-28 03:51:30,815 INFO L290 TraceCheckUtils]: 2: Hoare triple {6814#true} assume true; {6814#true} is VALID [2022-04-28 03:51:30,815 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {6814#true} {6814#true} #52#return; {6814#true} is VALID [2022-04-28 03:51:30,816 INFO L272 TraceCheckUtils]: 4: Hoare triple {6814#true} call #t~ret7 := main(); {6814#true} is VALID [2022-04-28 03:51:30,816 INFO L290 TraceCheckUtils]: 5: Hoare triple {6814#true} ~x~0 := 0;~y~0 := 50000;~z~0 := 0;~x~0 := 0; {6819#(<= 50000 main_~y~0)} is VALID [2022-04-28 03:51:30,816 INFO L290 TraceCheckUtils]: 6: Hoare triple {6819#(<= 50000 main_~y~0)} [104] L11-2-->L18-1_primed: Formula: (let ((.cse0 (= |v_main_#t~post4_78| |v_main_#t~post4_77|)) (.cse1 (= v_main_~x~0_395 v_main_~x~0_394))) (or (and .cse0 .cse1) (and (< v_main_~x~0_395 v_main_~x~0_394) (< v_main_~x~0_394 50001)) (and (not (< v_main_~x~0_395 50000)) .cse0 .cse1))) InVars {main_~x~0=v_main_~x~0_395, main_#t~post4=|v_main_#t~post4_78|} OutVars{main_~x~0=v_main_~x~0_394, main_#t~post4=|v_main_#t~post4_77|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {6819#(<= 50000 main_~y~0)} is VALID [2022-04-28 03:51:30,816 INFO L290 TraceCheckUtils]: 7: Hoare triple {6819#(<= 50000 main_~y~0)} [105] L18-1_primed-->L11-2: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {6819#(<= 50000 main_~y~0)} is VALID [2022-04-28 03:51:30,817 INFO L290 TraceCheckUtils]: 8: Hoare triple {6819#(<= 50000 main_~y~0)} [106] L11-2-->L18-1_primed: Formula: (let ((.cse1 (= v_main_~x~0_397 v_main_~x~0_396)) (.cse2 (= |v_main_#t~post6_81| |v_main_#t~post6_80|)) (.cse3 (= v_main_~y~0_357 v_main_~y~0_356)) (.cse4 (= |v_main_#t~post5_81| |v_main_#t~post5_80|)) (.cse0 (<= 50000 v_main_~x~0_397))) (or (and (or (not (< v_main_~x~0_397 1000000)) (not .cse0)) .cse1 .cse2 .cse3 .cse4) (and .cse1 .cse2 .cse3 .cse4) (let ((.cse5 (+ v_main_~x~0_397 v_main_~y~0_356))) (and (= .cse5 (+ v_main_~x~0_396 v_main_~y~0_357)) (< v_main_~y~0_357 v_main_~y~0_356) .cse0 (< .cse5 (+ v_main_~y~0_357 1000001)))))) InVars {main_~y~0=v_main_~y~0_357, main_#t~post5=|v_main_#t~post5_81|, main_~x~0=v_main_~x~0_397, main_#t~post6=|v_main_#t~post6_81|} OutVars{main_~y~0=v_main_~y~0_356, main_#t~post5=|v_main_#t~post5_80|, main_~x~0=v_main_~x~0_396, main_#t~post6=|v_main_#t~post6_80|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {6819#(<= 50000 main_~y~0)} is VALID [2022-04-28 03:51:30,818 INFO L290 TraceCheckUtils]: 9: Hoare triple {6819#(<= 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[] {6819#(<= 50000 main_~y~0)} is VALID [2022-04-28 03:51:30,818 INFO L290 TraceCheckUtils]: 10: Hoare triple {6819#(<= 50000 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {6820#(<= 49998 main_~y~0)} is VALID [2022-04-28 03:51:30,818 INFO L290 TraceCheckUtils]: 11: Hoare triple {6820#(<= 49998 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {6821#(<= 49996 main_~y~0)} is VALID [2022-04-28 03:51:30,819 INFO L290 TraceCheckUtils]: 12: Hoare triple {6821#(<= 49996 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {6822#(<= 49994 main_~y~0)} is VALID [2022-04-28 03:51:30,819 INFO L290 TraceCheckUtils]: 13: Hoare triple {6822#(<= 49994 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {6823#(<= 49992 main_~y~0)} is VALID [2022-04-28 03:51:30,820 INFO L290 TraceCheckUtils]: 14: Hoare triple {6823#(<= 49992 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {6824#(<= 49990 main_~y~0)} is VALID [2022-04-28 03:51:30,820 INFO L290 TraceCheckUtils]: 15: Hoare triple {6824#(<= 49990 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {6825#(<= 49988 main_~y~0)} is VALID [2022-04-28 03:51:30,821 INFO L290 TraceCheckUtils]: 16: Hoare triple {6825#(<= 49988 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {6826#(<= 49986 main_~y~0)} is VALID [2022-04-28 03:51:30,821 INFO L290 TraceCheckUtils]: 17: Hoare triple {6826#(<= 49986 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {6827#(<= 49984 main_~y~0)} is VALID [2022-04-28 03:51:30,822 INFO L290 TraceCheckUtils]: 18: Hoare triple {6827#(<= 49984 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {6828#(<= 49982 main_~y~0)} is VALID [2022-04-28 03:51:30,822 INFO L290 TraceCheckUtils]: 19: Hoare triple {6828#(<= 49982 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {6829#(<= 49980 main_~y~0)} is VALID [2022-04-28 03:51:30,822 INFO L290 TraceCheckUtils]: 20: Hoare triple {6829#(<= 49980 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {6830#(<= 49978 main_~y~0)} is VALID [2022-04-28 03:51:30,823 INFO L290 TraceCheckUtils]: 21: Hoare triple {6830#(<= 49978 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {6831#(<= 49976 main_~y~0)} is VALID [2022-04-28 03:51:30,823 INFO L290 TraceCheckUtils]: 22: Hoare triple {6831#(<= 49976 main_~y~0)} assume !(~y~0 > 0); {6815#false} is VALID [2022-04-28 03:51:30,823 INFO L272 TraceCheckUtils]: 23: Hoare triple {6815#false} call __VERIFIER_assert((if ~z~0 == ~x~0 then 1 else 0)); {6815#false} is VALID [2022-04-28 03:51:30,823 INFO L290 TraceCheckUtils]: 24: Hoare triple {6815#false} ~cond := #in~cond; {6815#false} is VALID [2022-04-28 03:51:30,823 INFO L290 TraceCheckUtils]: 25: Hoare triple {6815#false} assume 0 == ~cond; {6815#false} is VALID [2022-04-28 03:51:30,824 INFO L290 TraceCheckUtils]: 26: Hoare triple {6815#false} assume !false; {6815#false} is VALID [2022-04-28 03:51:30,824 INFO L134 CoverageAnalysis]: Checked inductivity of 80 backedges. 0 proven. 78 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-04-28 03:51:30,824 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 03:51:30,824 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [563639439] [2022-04-28 03:51:30,824 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [563639439] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 03:51:30,824 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1585462881] [2022-04-28 03:51:30,824 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:51:30,824 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 03:51:30,824 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 03:51:30,825 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 03:51:30,826 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2022-04-28 03:51:30,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:51:30,862 INFO L263 TraceCheckSpWp]: Trace formula consists of 119 conjuncts, 15 conjunts are in the unsatisfiable core [2022-04-28 03:51:30,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:51:30,871 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 03:51:31,126 INFO L272 TraceCheckUtils]: 0: Hoare triple {6814#true} call ULTIMATE.init(); {6814#true} is VALID [2022-04-28 03:51:31,126 INFO L290 TraceCheckUtils]: 1: Hoare triple {6814#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); {6814#true} is VALID [2022-04-28 03:51:31,126 INFO L290 TraceCheckUtils]: 2: Hoare triple {6814#true} assume true; {6814#true} is VALID [2022-04-28 03:51:31,126 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {6814#true} {6814#true} #52#return; {6814#true} is VALID [2022-04-28 03:51:31,127 INFO L272 TraceCheckUtils]: 4: Hoare triple {6814#true} call #t~ret7 := main(); {6814#true} is VALID [2022-04-28 03:51:31,127 INFO L290 TraceCheckUtils]: 5: Hoare triple {6814#true} ~x~0 := 0;~y~0 := 50000;~z~0 := 0;~x~0 := 0; {6819#(<= 50000 main_~y~0)} is VALID [2022-04-28 03:51:31,127 INFO L290 TraceCheckUtils]: 6: Hoare triple {6819#(<= 50000 main_~y~0)} [104] L11-2-->L18-1_primed: Formula: (let ((.cse0 (= |v_main_#t~post4_78| |v_main_#t~post4_77|)) (.cse1 (= v_main_~x~0_395 v_main_~x~0_394))) (or (and .cse0 .cse1) (and (< v_main_~x~0_395 v_main_~x~0_394) (< v_main_~x~0_394 50001)) (and (not (< v_main_~x~0_395 50000)) .cse0 .cse1))) InVars {main_~x~0=v_main_~x~0_395, main_#t~post4=|v_main_#t~post4_78|} OutVars{main_~x~0=v_main_~x~0_394, main_#t~post4=|v_main_#t~post4_77|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {6819#(<= 50000 main_~y~0)} is VALID [2022-04-28 03:51:31,127 INFO L290 TraceCheckUtils]: 7: Hoare triple {6819#(<= 50000 main_~y~0)} [105] L18-1_primed-->L11-2: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {6819#(<= 50000 main_~y~0)} is VALID [2022-04-28 03:51:31,128 INFO L290 TraceCheckUtils]: 8: Hoare triple {6819#(<= 50000 main_~y~0)} [106] L11-2-->L18-1_primed: Formula: (let ((.cse1 (= v_main_~x~0_397 v_main_~x~0_396)) (.cse2 (= |v_main_#t~post6_81| |v_main_#t~post6_80|)) (.cse3 (= v_main_~y~0_357 v_main_~y~0_356)) (.cse4 (= |v_main_#t~post5_81| |v_main_#t~post5_80|)) (.cse0 (<= 50000 v_main_~x~0_397))) (or (and (or (not (< v_main_~x~0_397 1000000)) (not .cse0)) .cse1 .cse2 .cse3 .cse4) (and .cse1 .cse2 .cse3 .cse4) (let ((.cse5 (+ v_main_~x~0_397 v_main_~y~0_356))) (and (= .cse5 (+ v_main_~x~0_396 v_main_~y~0_357)) (< v_main_~y~0_357 v_main_~y~0_356) .cse0 (< .cse5 (+ v_main_~y~0_357 1000001)))))) InVars {main_~y~0=v_main_~y~0_357, main_#t~post5=|v_main_#t~post5_81|, main_~x~0=v_main_~x~0_397, main_#t~post6=|v_main_#t~post6_81|} OutVars{main_~y~0=v_main_~y~0_356, main_#t~post5=|v_main_#t~post5_80|, main_~x~0=v_main_~x~0_396, main_#t~post6=|v_main_#t~post6_80|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {6819#(<= 50000 main_~y~0)} is VALID [2022-04-28 03:51:31,128 INFO L290 TraceCheckUtils]: 9: Hoare triple {6819#(<= 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[] {6819#(<= 50000 main_~y~0)} is VALID [2022-04-28 03:51:31,129 INFO L290 TraceCheckUtils]: 10: Hoare triple {6819#(<= 50000 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {6820#(<= 49998 main_~y~0)} is VALID [2022-04-28 03:51:31,129 INFO L290 TraceCheckUtils]: 11: Hoare triple {6820#(<= 49998 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {6821#(<= 49996 main_~y~0)} is VALID [2022-04-28 03:51:31,130 INFO L290 TraceCheckUtils]: 12: Hoare triple {6821#(<= 49996 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {6822#(<= 49994 main_~y~0)} is VALID [2022-04-28 03:51:31,130 INFO L290 TraceCheckUtils]: 13: Hoare triple {6822#(<= 49994 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {6823#(<= 49992 main_~y~0)} is VALID [2022-04-28 03:51:31,131 INFO L290 TraceCheckUtils]: 14: Hoare triple {6823#(<= 49992 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {6824#(<= 49990 main_~y~0)} is VALID [2022-04-28 03:51:31,131 INFO L290 TraceCheckUtils]: 15: Hoare triple {6824#(<= 49990 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {6825#(<= 49988 main_~y~0)} is VALID [2022-04-28 03:51:31,132 INFO L290 TraceCheckUtils]: 16: Hoare triple {6825#(<= 49988 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {6826#(<= 49986 main_~y~0)} is VALID [2022-04-28 03:51:31,132 INFO L290 TraceCheckUtils]: 17: Hoare triple {6826#(<= 49986 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {6827#(<= 49984 main_~y~0)} is VALID [2022-04-28 03:51:31,132 INFO L290 TraceCheckUtils]: 18: Hoare triple {6827#(<= 49984 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {6828#(<= 49982 main_~y~0)} is VALID [2022-04-28 03:51:31,133 INFO L290 TraceCheckUtils]: 19: Hoare triple {6828#(<= 49982 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {6829#(<= 49980 main_~y~0)} is VALID [2022-04-28 03:51:31,133 INFO L290 TraceCheckUtils]: 20: Hoare triple {6829#(<= 49980 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {6830#(<= 49978 main_~y~0)} is VALID [2022-04-28 03:51:31,134 INFO L290 TraceCheckUtils]: 21: Hoare triple {6830#(<= 49978 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {6831#(<= 49976 main_~y~0)} is VALID [2022-04-28 03:51:31,134 INFO L290 TraceCheckUtils]: 22: Hoare triple {6831#(<= 49976 main_~y~0)} assume !(~y~0 > 0); {6815#false} is VALID [2022-04-28 03:51:31,134 INFO L272 TraceCheckUtils]: 23: Hoare triple {6815#false} call __VERIFIER_assert((if ~z~0 == ~x~0 then 1 else 0)); {6815#false} is VALID [2022-04-28 03:51:31,134 INFO L290 TraceCheckUtils]: 24: Hoare triple {6815#false} ~cond := #in~cond; {6815#false} is VALID [2022-04-28 03:51:31,134 INFO L290 TraceCheckUtils]: 25: Hoare triple {6815#false} assume 0 == ~cond; {6815#false} is VALID [2022-04-28 03:51:31,134 INFO L290 TraceCheckUtils]: 26: Hoare triple {6815#false} assume !false; {6815#false} is VALID [2022-04-28 03:51:31,134 INFO L134 CoverageAnalysis]: Checked inductivity of 80 backedges. 0 proven. 78 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-04-28 03:51:31,134 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 03:51:31,564 INFO L290 TraceCheckUtils]: 26: Hoare triple {6815#false} assume !false; {6815#false} is VALID [2022-04-28 03:51:31,564 INFO L290 TraceCheckUtils]: 25: Hoare triple {6815#false} assume 0 == ~cond; {6815#false} is VALID [2022-04-28 03:51:31,564 INFO L290 TraceCheckUtils]: 24: Hoare triple {6815#false} ~cond := #in~cond; {6815#false} is VALID [2022-04-28 03:51:31,564 INFO L272 TraceCheckUtils]: 23: Hoare triple {6815#false} call __VERIFIER_assert((if ~z~0 == ~x~0 then 1 else 0)); {6815#false} is VALID [2022-04-28 03:51:31,564 INFO L290 TraceCheckUtils]: 22: Hoare triple {6926#(< 0 main_~y~0)} assume !(~y~0 > 0); {6815#false} is VALID [2022-04-28 03:51:31,565 INFO L290 TraceCheckUtils]: 21: Hoare triple {6930#(< 2 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {6926#(< 0 main_~y~0)} is VALID [2022-04-28 03:51:31,565 INFO L290 TraceCheckUtils]: 20: Hoare triple {6934#(< 4 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {6930#(< 2 main_~y~0)} is VALID [2022-04-28 03:51:31,566 INFO L290 TraceCheckUtils]: 19: Hoare triple {6938#(< 6 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {6934#(< 4 main_~y~0)} is VALID [2022-04-28 03:51:31,566 INFO L290 TraceCheckUtils]: 18: Hoare triple {6942#(< 8 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {6938#(< 6 main_~y~0)} is VALID [2022-04-28 03:51:31,566 INFO L290 TraceCheckUtils]: 17: Hoare triple {6946#(< 10 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {6942#(< 8 main_~y~0)} is VALID [2022-04-28 03:51:31,567 INFO L290 TraceCheckUtils]: 16: Hoare triple {6950#(< 12 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {6946#(< 10 main_~y~0)} is VALID [2022-04-28 03:51:31,567 INFO L290 TraceCheckUtils]: 15: Hoare triple {6954#(< 14 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {6950#(< 12 main_~y~0)} is VALID [2022-04-28 03:51:31,568 INFO L290 TraceCheckUtils]: 14: Hoare triple {6958#(< 16 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {6954#(< 14 main_~y~0)} is VALID [2022-04-28 03:51:31,568 INFO L290 TraceCheckUtils]: 13: Hoare triple {6962#(< 18 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {6958#(< 16 main_~y~0)} is VALID [2022-04-28 03:51:31,568 INFO L290 TraceCheckUtils]: 12: Hoare triple {6966#(< 20 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {6962#(< 18 main_~y~0)} is VALID [2022-04-28 03:51:31,569 INFO L290 TraceCheckUtils]: 11: Hoare triple {6970#(< 22 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {6966#(< 20 main_~y~0)} is VALID [2022-04-28 03:51:31,569 INFO L290 TraceCheckUtils]: 10: Hoare triple {6974#(< 24 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {6970#(< 22 main_~y~0)} is VALID [2022-04-28 03:51:31,570 INFO L290 TraceCheckUtils]: 9: Hoare triple {6974#(< 24 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[] {6974#(< 24 main_~y~0)} is VALID [2022-04-28 03:51:31,571 INFO L290 TraceCheckUtils]: 8: Hoare triple {6974#(< 24 main_~y~0)} [106] L11-2-->L18-1_primed: Formula: (let ((.cse1 (= v_main_~x~0_397 v_main_~x~0_396)) (.cse2 (= |v_main_#t~post6_81| |v_main_#t~post6_80|)) (.cse3 (= v_main_~y~0_357 v_main_~y~0_356)) (.cse4 (= |v_main_#t~post5_81| |v_main_#t~post5_80|)) (.cse0 (<= 50000 v_main_~x~0_397))) (or (and (or (not (< v_main_~x~0_397 1000000)) (not .cse0)) .cse1 .cse2 .cse3 .cse4) (and .cse1 .cse2 .cse3 .cse4) (let ((.cse5 (+ v_main_~x~0_397 v_main_~y~0_356))) (and (= .cse5 (+ v_main_~x~0_396 v_main_~y~0_357)) (< v_main_~y~0_357 v_main_~y~0_356) .cse0 (< .cse5 (+ v_main_~y~0_357 1000001)))))) InVars {main_~y~0=v_main_~y~0_357, main_#t~post5=|v_main_#t~post5_81|, main_~x~0=v_main_~x~0_397, main_#t~post6=|v_main_#t~post6_81|} OutVars{main_~y~0=v_main_~y~0_356, main_#t~post5=|v_main_#t~post5_80|, main_~x~0=v_main_~x~0_396, main_#t~post6=|v_main_#t~post6_80|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {6974#(< 24 main_~y~0)} is VALID [2022-04-28 03:51:31,571 INFO L290 TraceCheckUtils]: 7: Hoare triple {6974#(< 24 main_~y~0)} [105] L18-1_primed-->L11-2: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {6974#(< 24 main_~y~0)} is VALID [2022-04-28 03:51:31,571 INFO L290 TraceCheckUtils]: 6: Hoare triple {6974#(< 24 main_~y~0)} [104] L11-2-->L18-1_primed: Formula: (let ((.cse0 (= |v_main_#t~post4_78| |v_main_#t~post4_77|)) (.cse1 (= v_main_~x~0_395 v_main_~x~0_394))) (or (and .cse0 .cse1) (and (< v_main_~x~0_395 v_main_~x~0_394) (< v_main_~x~0_394 50001)) (and (not (< v_main_~x~0_395 50000)) .cse0 .cse1))) InVars {main_~x~0=v_main_~x~0_395, main_#t~post4=|v_main_#t~post4_78|} OutVars{main_~x~0=v_main_~x~0_394, main_#t~post4=|v_main_#t~post4_77|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {6974#(< 24 main_~y~0)} is VALID [2022-04-28 03:51:31,572 INFO L290 TraceCheckUtils]: 5: Hoare triple {6814#true} ~x~0 := 0;~y~0 := 50000;~z~0 := 0;~x~0 := 0; {6974#(< 24 main_~y~0)} is VALID [2022-04-28 03:51:31,572 INFO L272 TraceCheckUtils]: 4: Hoare triple {6814#true} call #t~ret7 := main(); {6814#true} is VALID [2022-04-28 03:51:31,572 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {6814#true} {6814#true} #52#return; {6814#true} is VALID [2022-04-28 03:51:31,572 INFO L290 TraceCheckUtils]: 2: Hoare triple {6814#true} assume true; {6814#true} is VALID [2022-04-28 03:51:31,572 INFO L290 TraceCheckUtils]: 1: Hoare triple {6814#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); {6814#true} is VALID [2022-04-28 03:51:31,572 INFO L272 TraceCheckUtils]: 0: Hoare triple {6814#true} call ULTIMATE.init(); {6814#true} is VALID [2022-04-28 03:51:31,572 INFO L134 CoverageAnalysis]: Checked inductivity of 80 backedges. 0 proven. 78 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-04-28 03:51:31,572 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1585462881] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 03:51:31,572 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 03:51:31,572 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 15, 15] total 29 [2022-04-28 03:51:32,227 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 03:51:32,227 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [304244554] [2022-04-28 03:51:32,227 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [304244554] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 03:51:32,227 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 03:51:32,227 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [40] imperfect sequences [] total 40 [2022-04-28 03:51:32,227 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [780974388] [2022-04-28 03:51:32,227 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 03:51:32,228 INFO L78 Accepts]: Start accepts. Automaton has has 40 states, 40 states have (on average 1.65) internal successors, (66), 39 states have internal predecessors, (66), 2 states have call successors, (3), 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 70 [2022-04-28 03:51:32,228 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 03:51:32,228 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 40 states, 40 states have (on average 1.65) internal successors, (66), 39 states have internal predecessors, (66), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:51:32,283 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 70 edges. 70 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 03:51:32,283 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 40 states [2022-04-28 03:51:32,283 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 03:51:32,284 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2022-04-28 03:51:32,285 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1075, Invalid=1681, Unknown=0, NotChecked=0, Total=2756 [2022-04-28 03:51:32,285 INFO L87 Difference]: Start difference. First operand 71 states and 74 transitions. Second operand has 40 states, 40 states have (on average 1.65) internal successors, (66), 39 states have internal predecessors, (66), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:51:34,801 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:51:34,801 INFO L93 Difference]: Finished difference Result 139 states and 150 transitions. [2022-04-28 03:51:34,801 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2022-04-28 03:51:34,801 INFO L78 Accepts]: Start accepts. Automaton has has 40 states, 40 states have (on average 1.65) internal successors, (66), 39 states have internal predecessors, (66), 2 states have call successors, (3), 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 70 [2022-04-28 03:51:34,801 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 03:51:34,802 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 40 states, 40 states have (on average 1.65) internal successors, (66), 39 states have internal predecessors, (66), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:51:34,803 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 92 transitions. [2022-04-28 03:51:34,803 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 40 states, 40 states have (on average 1.65) internal successors, (66), 39 states have internal predecessors, (66), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:51:34,804 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 92 transitions. [2022-04-28 03:51:34,804 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 40 states and 92 transitions. [2022-04-28 03:51:34,913 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 92 edges. 92 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 03:51:34,914 INFO L225 Difference]: With dead ends: 139 [2022-04-28 03:51:34,914 INFO L226 Difference]: Without dead ends: 76 [2022-04-28 03:51:34,915 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 159 GetRequests, 70 SyntacticMatches, 1 SemanticMatches, 88 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2239 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=2530, Invalid=5480, Unknown=0, NotChecked=0, Total=8010 [2022-04-28 03:51:34,916 INFO L413 NwaCegarLoop]: 12 mSDtfsCounter, 85 mSDsluCounter, 27 mSDsCounter, 0 mSdLazyCounter, 1171 mSolverCounterSat, 124 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 85 SdHoareTripleChecker+Valid, 39 SdHoareTripleChecker+Invalid, 1295 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 124 IncrementalHoareTripleChecker+Valid, 1171 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2022-04-28 03:51:34,916 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [85 Valid, 39 Invalid, 1295 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [124 Valid, 1171 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2022-04-28 03:51:34,916 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2022-04-28 03:51:35,012 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 76. [2022-04-28 03:51:35,012 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 03:51:35,012 INFO L82 GeneralOperation]: Start isEquivalent. First operand 76 states. Second operand has 76 states, 71 states have (on average 1.056338028169014) internal successors, (75), 71 states have internal predecessors, (75), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:51:35,012 INFO L74 IsIncluded]: Start isIncluded. First operand 76 states. Second operand has 76 states, 71 states have (on average 1.056338028169014) internal successors, (75), 71 states have internal predecessors, (75), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:51:35,012 INFO L87 Difference]: Start difference. First operand 76 states. Second operand has 76 states, 71 states have (on average 1.056338028169014) internal successors, (75), 71 states have internal predecessors, (75), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:51:35,013 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:51:35,013 INFO L93 Difference]: Finished difference Result 76 states and 79 transitions. [2022-04-28 03:51:35,013 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 79 transitions. [2022-04-28 03:51:35,014 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:51:35,014 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:51:35,014 INFO L74 IsIncluded]: Start isIncluded. First operand has 76 states, 71 states have (on average 1.056338028169014) internal successors, (75), 71 states have internal predecessors, (75), 3 states have call successors, (3), 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 76 states. [2022-04-28 03:51:35,014 INFO L87 Difference]: Start difference. First operand has 76 states, 71 states have (on average 1.056338028169014) internal successors, (75), 71 states have internal predecessors, (75), 3 states have call successors, (3), 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 76 states. [2022-04-28 03:51:35,015 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:51:35,015 INFO L93 Difference]: Finished difference Result 76 states and 79 transitions. [2022-04-28 03:51:35,015 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 79 transitions. [2022-04-28 03:51:35,015 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:51:35,015 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:51:35,015 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 03:51:35,015 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 03:51:35,015 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 76 states, 71 states have (on average 1.056338028169014) internal successors, (75), 71 states have internal predecessors, (75), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:51:35,016 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 79 transitions. [2022-04-28 03:51:35,016 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 79 transitions. Word has length 70 [2022-04-28 03:51:35,016 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 03:51:35,016 INFO L495 AbstractCegarLoop]: Abstraction has 76 states and 79 transitions. [2022-04-28 03:51:35,016 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 40 states, 40 states have (on average 1.65) internal successors, (66), 39 states have internal predecessors, (66), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:51:35,016 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 76 states and 79 transitions. [2022-04-28 03:51:35,085 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 79 edges. 79 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 03:51:35,085 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 79 transitions. [2022-04-28 03:51:35,086 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2022-04-28 03:51:35,086 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 03:51:35,086 INFO L195 NwaCegarLoop]: trace histogram [25, 24, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 03:51:35,104 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Ended with exit code 0 [2022-04-28 03:51:35,286 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2022-04-28 03:51:35,287 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 03:51:35,287 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 03:51:35,287 INFO L85 PathProgramCache]: Analyzing trace with hash -1759245775, now seen corresponding path program 13 times [2022-04-28 03:51:35,287 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 03:51:35,287 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [291819025] [2022-04-28 03:51:35,395 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 1 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 03:51:35,582 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={1=1, 2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 03:51:35,583 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-28 03:51:35,585 INFO L85 PathProgramCache]: Analyzing trace with hash -1079046718, now seen corresponding path program 1 times [2022-04-28 03:51:35,586 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 03:51:35,586 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [864316054] [2022-04-28 03:51:35,586 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:51:35,586 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 03:51:35,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:51:35,733 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 03:51:35,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:51:35,738 INFO L290 TraceCheckUtils]: 0: Hoare triple {7706#(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); {7687#true} is VALID [2022-04-28 03:51:35,738 INFO L290 TraceCheckUtils]: 1: Hoare triple {7687#true} assume true; {7687#true} is VALID [2022-04-28 03:51:35,738 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {7687#true} {7687#true} #52#return; {7687#true} is VALID [2022-04-28 03:51:35,739 INFO L272 TraceCheckUtils]: 0: Hoare triple {7687#true} call ULTIMATE.init(); {7706#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 03:51:35,739 INFO L290 TraceCheckUtils]: 1: Hoare triple {7706#(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); {7687#true} is VALID [2022-04-28 03:51:35,739 INFO L290 TraceCheckUtils]: 2: Hoare triple {7687#true} assume true; {7687#true} is VALID [2022-04-28 03:51:35,739 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {7687#true} {7687#true} #52#return; {7687#true} is VALID [2022-04-28 03:51:35,739 INFO L272 TraceCheckUtils]: 4: Hoare triple {7687#true} call #t~ret7 := main(); {7687#true} is VALID [2022-04-28 03:51:35,739 INFO L290 TraceCheckUtils]: 5: Hoare triple {7687#true} ~x~0 := 0;~y~0 := 50000;~z~0 := 0;~x~0 := 0; {7692#(<= 50000 main_~y~0)} is VALID [2022-04-28 03:51:35,739 INFO L290 TraceCheckUtils]: 6: Hoare triple {7692#(<= 50000 main_~y~0)} [108] L11-2-->L18-1_primed: Formula: (let ((.cse0 (= |v_main_#t~post4_84| |v_main_#t~post4_83|))) (or (and (< v_main_~x~0_445 50001) (< v_main_~x~0_446 v_main_~x~0_445)) (and .cse0 (= v_main_~x~0_445 v_main_~x~0_446) (not (< v_main_~x~0_446 50000))) (and .cse0 (= v_main_~x~0_446 v_main_~x~0_445)))) InVars {main_~x~0=v_main_~x~0_446, main_#t~post4=|v_main_#t~post4_84|} OutVars{main_~x~0=v_main_~x~0_445, main_#t~post4=|v_main_#t~post4_83|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {7692#(<= 50000 main_~y~0)} is VALID [2022-04-28 03:51:35,740 INFO L290 TraceCheckUtils]: 7: Hoare triple {7692#(<= 50000 main_~y~0)} [109] L18-1_primed-->L11-2: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {7692#(<= 50000 main_~y~0)} is VALID [2022-04-28 03:51:35,741 INFO L290 TraceCheckUtils]: 8: Hoare triple {7692#(<= 50000 main_~y~0)} [110] L11-2-->L18-1_primed: Formula: (let ((.cse0 (= v_main_~y~0_412 v_main_~y~0_411)) (.cse1 (= |v_main_#t~post6_88| |v_main_#t~post6_87|)) (.cse5 (<= 50000 v_main_~x~0_448)) (.cse2 (= |v_main_#t~post5_88| |v_main_#t~post5_87|)) (.cse3 (= v_main_~x~0_448 v_main_~x~0_447))) (or (and .cse0 .cse1 .cse2 .cse3) (let ((.cse4 (+ v_main_~x~0_448 v_main_~y~0_411))) (and (= (+ v_main_~x~0_447 v_main_~y~0_412) .cse4) (< v_main_~y~0_412 v_main_~y~0_411) (< .cse4 (+ v_main_~y~0_412 1000001)) .cse5)) (and .cse0 .cse1 (or (not (< v_main_~x~0_448 1000000)) (not .cse5)) .cse2 .cse3))) InVars {main_~y~0=v_main_~y~0_412, main_#t~post5=|v_main_#t~post5_88|, main_~x~0=v_main_~x~0_448, main_#t~post6=|v_main_#t~post6_88|} OutVars{main_~y~0=v_main_~y~0_411, main_#t~post5=|v_main_#t~post5_87|, main_~x~0=v_main_~x~0_447, main_#t~post6=|v_main_#t~post6_87|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {7692#(<= 50000 main_~y~0)} is VALID [2022-04-28 03:51:35,741 INFO L290 TraceCheckUtils]: 9: Hoare triple {7692#(<= 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[] {7692#(<= 50000 main_~y~0)} is VALID [2022-04-28 03:51:35,741 INFO L290 TraceCheckUtils]: 10: Hoare triple {7692#(<= 50000 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {7693#(<= 49998 main_~y~0)} is VALID [2022-04-28 03:51:35,742 INFO L290 TraceCheckUtils]: 11: Hoare triple {7693#(<= 49998 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {7694#(<= 49996 main_~y~0)} is VALID [2022-04-28 03:51:35,742 INFO L290 TraceCheckUtils]: 12: Hoare triple {7694#(<= 49996 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {7695#(<= 49994 main_~y~0)} is VALID [2022-04-28 03:51:35,743 INFO L290 TraceCheckUtils]: 13: Hoare triple {7695#(<= 49994 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {7696#(<= 49992 main_~y~0)} is VALID [2022-04-28 03:51:35,743 INFO L290 TraceCheckUtils]: 14: Hoare triple {7696#(<= 49992 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {7697#(<= 49990 main_~y~0)} is VALID [2022-04-28 03:51:35,743 INFO L290 TraceCheckUtils]: 15: Hoare triple {7697#(<= 49990 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {7698#(<= 49988 main_~y~0)} is VALID [2022-04-28 03:51:35,744 INFO L290 TraceCheckUtils]: 16: Hoare triple {7698#(<= 49988 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {7699#(<= 49986 main_~y~0)} is VALID [2022-04-28 03:51:35,744 INFO L290 TraceCheckUtils]: 17: Hoare triple {7699#(<= 49986 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {7700#(<= 49984 main_~y~0)} is VALID [2022-04-28 03:51:35,745 INFO L290 TraceCheckUtils]: 18: Hoare triple {7700#(<= 49984 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {7701#(<= 49982 main_~y~0)} is VALID [2022-04-28 03:51:35,745 INFO L290 TraceCheckUtils]: 19: Hoare triple {7701#(<= 49982 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {7702#(<= 49980 main_~y~0)} is VALID [2022-04-28 03:51:35,746 INFO L290 TraceCheckUtils]: 20: Hoare triple {7702#(<= 49980 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {7703#(<= 49978 main_~y~0)} is VALID [2022-04-28 03:51:35,746 INFO L290 TraceCheckUtils]: 21: Hoare triple {7703#(<= 49978 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {7704#(<= 49976 main_~y~0)} is VALID [2022-04-28 03:51:35,746 INFO L290 TraceCheckUtils]: 22: Hoare triple {7704#(<= 49976 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {7705#(<= 49974 main_~y~0)} is VALID [2022-04-28 03:51:35,747 INFO L290 TraceCheckUtils]: 23: Hoare triple {7705#(<= 49974 main_~y~0)} assume !(~y~0 > 0); {7688#false} is VALID [2022-04-28 03:51:35,747 INFO L272 TraceCheckUtils]: 24: Hoare triple {7688#false} call __VERIFIER_assert((if ~z~0 == ~x~0 then 1 else 0)); {7688#false} is VALID [2022-04-28 03:51:35,747 INFO L290 TraceCheckUtils]: 25: Hoare triple {7688#false} ~cond := #in~cond; {7688#false} is VALID [2022-04-28 03:51:35,747 INFO L290 TraceCheckUtils]: 26: Hoare triple {7688#false} assume 0 == ~cond; {7688#false} is VALID [2022-04-28 03:51:35,747 INFO L290 TraceCheckUtils]: 27: Hoare triple {7688#false} assume !false; {7688#false} is VALID [2022-04-28 03:51:35,747 INFO L134 CoverageAnalysis]: Checked inductivity of 93 backedges. 0 proven. 91 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-04-28 03:51:35,747 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 03:51:35,747 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [864316054] [2022-04-28 03:51:35,747 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [864316054] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 03:51:35,747 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1970125818] [2022-04-28 03:51:35,748 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:51:35,748 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 03:51:35,748 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 03:51:35,748 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 03:51:35,749 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2022-04-28 03:51:35,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:51:35,781 INFO L263 TraceCheckSpWp]: Trace formula consists of 124 conjuncts, 16 conjunts are in the unsatisfiable core [2022-04-28 03:51:35,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:51:35,792 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 03:51:36,087 INFO L272 TraceCheckUtils]: 0: Hoare triple {7687#true} call ULTIMATE.init(); {7687#true} is VALID [2022-04-28 03:51:36,087 INFO L290 TraceCheckUtils]: 1: Hoare triple {7687#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); {7687#true} is VALID [2022-04-28 03:51:36,087 INFO L290 TraceCheckUtils]: 2: Hoare triple {7687#true} assume true; {7687#true} is VALID [2022-04-28 03:51:36,087 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {7687#true} {7687#true} #52#return; {7687#true} is VALID [2022-04-28 03:51:36,087 INFO L272 TraceCheckUtils]: 4: Hoare triple {7687#true} call #t~ret7 := main(); {7687#true} is VALID [2022-04-28 03:51:36,088 INFO L290 TraceCheckUtils]: 5: Hoare triple {7687#true} ~x~0 := 0;~y~0 := 50000;~z~0 := 0;~x~0 := 0; {7692#(<= 50000 main_~y~0)} is VALID [2022-04-28 03:51:36,088 INFO L290 TraceCheckUtils]: 6: Hoare triple {7692#(<= 50000 main_~y~0)} [108] L11-2-->L18-1_primed: Formula: (let ((.cse0 (= |v_main_#t~post4_84| |v_main_#t~post4_83|))) (or (and (< v_main_~x~0_445 50001) (< v_main_~x~0_446 v_main_~x~0_445)) (and .cse0 (= v_main_~x~0_445 v_main_~x~0_446) (not (< v_main_~x~0_446 50000))) (and .cse0 (= v_main_~x~0_446 v_main_~x~0_445)))) InVars {main_~x~0=v_main_~x~0_446, main_#t~post4=|v_main_#t~post4_84|} OutVars{main_~x~0=v_main_~x~0_445, main_#t~post4=|v_main_#t~post4_83|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {7692#(<= 50000 main_~y~0)} is VALID [2022-04-28 03:51:36,088 INFO L290 TraceCheckUtils]: 7: Hoare triple {7692#(<= 50000 main_~y~0)} [109] L18-1_primed-->L11-2: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {7692#(<= 50000 main_~y~0)} is VALID [2022-04-28 03:51:36,089 INFO L290 TraceCheckUtils]: 8: Hoare triple {7692#(<= 50000 main_~y~0)} [110] L11-2-->L18-1_primed: Formula: (let ((.cse0 (= v_main_~y~0_412 v_main_~y~0_411)) (.cse1 (= |v_main_#t~post6_88| |v_main_#t~post6_87|)) (.cse5 (<= 50000 v_main_~x~0_448)) (.cse2 (= |v_main_#t~post5_88| |v_main_#t~post5_87|)) (.cse3 (= v_main_~x~0_448 v_main_~x~0_447))) (or (and .cse0 .cse1 .cse2 .cse3) (let ((.cse4 (+ v_main_~x~0_448 v_main_~y~0_411))) (and (= (+ v_main_~x~0_447 v_main_~y~0_412) .cse4) (< v_main_~y~0_412 v_main_~y~0_411) (< .cse4 (+ v_main_~y~0_412 1000001)) .cse5)) (and .cse0 .cse1 (or (not (< v_main_~x~0_448 1000000)) (not .cse5)) .cse2 .cse3))) InVars {main_~y~0=v_main_~y~0_412, main_#t~post5=|v_main_#t~post5_88|, main_~x~0=v_main_~x~0_448, main_#t~post6=|v_main_#t~post6_88|} OutVars{main_~y~0=v_main_~y~0_411, main_#t~post5=|v_main_#t~post5_87|, main_~x~0=v_main_~x~0_447, main_#t~post6=|v_main_#t~post6_87|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {7692#(<= 50000 main_~y~0)} is VALID [2022-04-28 03:51:36,089 INFO L290 TraceCheckUtils]: 9: Hoare triple {7692#(<= 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[] {7692#(<= 50000 main_~y~0)} is VALID [2022-04-28 03:51:36,090 INFO L290 TraceCheckUtils]: 10: Hoare triple {7692#(<= 50000 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {7693#(<= 49998 main_~y~0)} is VALID [2022-04-28 03:51:36,090 INFO L290 TraceCheckUtils]: 11: Hoare triple {7693#(<= 49998 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {7694#(<= 49996 main_~y~0)} is VALID [2022-04-28 03:51:36,090 INFO L290 TraceCheckUtils]: 12: Hoare triple {7694#(<= 49996 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {7695#(<= 49994 main_~y~0)} is VALID [2022-04-28 03:51:36,091 INFO L290 TraceCheckUtils]: 13: Hoare triple {7695#(<= 49994 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {7696#(<= 49992 main_~y~0)} is VALID [2022-04-28 03:51:36,091 INFO L290 TraceCheckUtils]: 14: Hoare triple {7696#(<= 49992 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {7697#(<= 49990 main_~y~0)} is VALID [2022-04-28 03:51:36,092 INFO L290 TraceCheckUtils]: 15: Hoare triple {7697#(<= 49990 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {7698#(<= 49988 main_~y~0)} is VALID [2022-04-28 03:51:36,092 INFO L290 TraceCheckUtils]: 16: Hoare triple {7698#(<= 49988 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {7699#(<= 49986 main_~y~0)} is VALID [2022-04-28 03:51:36,093 INFO L290 TraceCheckUtils]: 17: Hoare triple {7699#(<= 49986 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {7700#(<= 49984 main_~y~0)} is VALID [2022-04-28 03:51:36,093 INFO L290 TraceCheckUtils]: 18: Hoare triple {7700#(<= 49984 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {7701#(<= 49982 main_~y~0)} is VALID [2022-04-28 03:51:36,093 INFO L290 TraceCheckUtils]: 19: Hoare triple {7701#(<= 49982 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {7702#(<= 49980 main_~y~0)} is VALID [2022-04-28 03:51:36,094 INFO L290 TraceCheckUtils]: 20: Hoare triple {7702#(<= 49980 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {7703#(<= 49978 main_~y~0)} is VALID [2022-04-28 03:51:36,094 INFO L290 TraceCheckUtils]: 21: Hoare triple {7703#(<= 49978 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {7704#(<= 49976 main_~y~0)} is VALID [2022-04-28 03:51:36,095 INFO L290 TraceCheckUtils]: 22: Hoare triple {7704#(<= 49976 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {7705#(<= 49974 main_~y~0)} is VALID [2022-04-28 03:51:36,095 INFO L290 TraceCheckUtils]: 23: Hoare triple {7705#(<= 49974 main_~y~0)} assume !(~y~0 > 0); {7688#false} is VALID [2022-04-28 03:51:36,095 INFO L272 TraceCheckUtils]: 24: Hoare triple {7688#false} call __VERIFIER_assert((if ~z~0 == ~x~0 then 1 else 0)); {7688#false} is VALID [2022-04-28 03:51:36,095 INFO L290 TraceCheckUtils]: 25: Hoare triple {7688#false} ~cond := #in~cond; {7688#false} is VALID [2022-04-28 03:51:36,095 INFO L290 TraceCheckUtils]: 26: Hoare triple {7688#false} assume 0 == ~cond; {7688#false} is VALID [2022-04-28 03:51:36,095 INFO L290 TraceCheckUtils]: 27: Hoare triple {7688#false} assume !false; {7688#false} is VALID [2022-04-28 03:51:36,095 INFO L134 CoverageAnalysis]: Checked inductivity of 93 backedges. 0 proven. 91 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-04-28 03:51:36,095 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 03:51:36,559 INFO L290 TraceCheckUtils]: 27: Hoare triple {7688#false} assume !false; {7688#false} is VALID [2022-04-28 03:51:36,559 INFO L290 TraceCheckUtils]: 26: Hoare triple {7688#false} assume 0 == ~cond; {7688#false} is VALID [2022-04-28 03:51:36,559 INFO L290 TraceCheckUtils]: 25: Hoare triple {7688#false} ~cond := #in~cond; {7688#false} is VALID [2022-04-28 03:51:36,559 INFO L272 TraceCheckUtils]: 24: Hoare triple {7688#false} call __VERIFIER_assert((if ~z~0 == ~x~0 then 1 else 0)); {7688#false} is VALID [2022-04-28 03:51:36,559 INFO L290 TraceCheckUtils]: 23: Hoare triple {7803#(< 0 main_~y~0)} assume !(~y~0 > 0); {7688#false} is VALID [2022-04-28 03:51:36,560 INFO L290 TraceCheckUtils]: 22: Hoare triple {7807#(< 2 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {7803#(< 0 main_~y~0)} is VALID [2022-04-28 03:51:36,560 INFO L290 TraceCheckUtils]: 21: Hoare triple {7811#(< 4 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {7807#(< 2 main_~y~0)} is VALID [2022-04-28 03:51:36,561 INFO L290 TraceCheckUtils]: 20: Hoare triple {7815#(< 6 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {7811#(< 4 main_~y~0)} is VALID [2022-04-28 03:51:36,561 INFO L290 TraceCheckUtils]: 19: Hoare triple {7819#(< 8 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {7815#(< 6 main_~y~0)} is VALID [2022-04-28 03:51:36,561 INFO L290 TraceCheckUtils]: 18: Hoare triple {7823#(< 10 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {7819#(< 8 main_~y~0)} is VALID [2022-04-28 03:51:36,562 INFO L290 TraceCheckUtils]: 17: Hoare triple {7827#(< 12 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {7823#(< 10 main_~y~0)} is VALID [2022-04-28 03:51:36,562 INFO L290 TraceCheckUtils]: 16: Hoare triple {7831#(< 14 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {7827#(< 12 main_~y~0)} is VALID [2022-04-28 03:51:36,563 INFO L290 TraceCheckUtils]: 15: Hoare triple {7835#(< 16 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {7831#(< 14 main_~y~0)} is VALID [2022-04-28 03:51:36,563 INFO L290 TraceCheckUtils]: 14: Hoare triple {7839#(< 18 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {7835#(< 16 main_~y~0)} is VALID [2022-04-28 03:51:36,564 INFO L290 TraceCheckUtils]: 13: Hoare triple {7843#(< 20 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {7839#(< 18 main_~y~0)} is VALID [2022-04-28 03:51:36,564 INFO L290 TraceCheckUtils]: 12: Hoare triple {7847#(< 22 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {7843#(< 20 main_~y~0)} is VALID [2022-04-28 03:51:36,564 INFO L290 TraceCheckUtils]: 11: Hoare triple {7851#(< 24 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {7847#(< 22 main_~y~0)} is VALID [2022-04-28 03:51:36,565 INFO L290 TraceCheckUtils]: 10: Hoare triple {7855#(< 26 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {7851#(< 24 main_~y~0)} is VALID [2022-04-28 03:51:36,565 INFO L290 TraceCheckUtils]: 9: Hoare triple {7855#(< 26 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[] {7855#(< 26 main_~y~0)} is VALID [2022-04-28 03:51:36,566 INFO L290 TraceCheckUtils]: 8: Hoare triple {7855#(< 26 main_~y~0)} [110] L11-2-->L18-1_primed: Formula: (let ((.cse0 (= v_main_~y~0_412 v_main_~y~0_411)) (.cse1 (= |v_main_#t~post6_88| |v_main_#t~post6_87|)) (.cse5 (<= 50000 v_main_~x~0_448)) (.cse2 (= |v_main_#t~post5_88| |v_main_#t~post5_87|)) (.cse3 (= v_main_~x~0_448 v_main_~x~0_447))) (or (and .cse0 .cse1 .cse2 .cse3) (let ((.cse4 (+ v_main_~x~0_448 v_main_~y~0_411))) (and (= (+ v_main_~x~0_447 v_main_~y~0_412) .cse4) (< v_main_~y~0_412 v_main_~y~0_411) (< .cse4 (+ v_main_~y~0_412 1000001)) .cse5)) (and .cse0 .cse1 (or (not (< v_main_~x~0_448 1000000)) (not .cse5)) .cse2 .cse3))) InVars {main_~y~0=v_main_~y~0_412, main_#t~post5=|v_main_#t~post5_88|, main_~x~0=v_main_~x~0_448, main_#t~post6=|v_main_#t~post6_88|} OutVars{main_~y~0=v_main_~y~0_411, main_#t~post5=|v_main_#t~post5_87|, main_~x~0=v_main_~x~0_447, main_#t~post6=|v_main_#t~post6_87|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {7855#(< 26 main_~y~0)} is VALID [2022-04-28 03:51:36,566 INFO L290 TraceCheckUtils]: 7: Hoare triple {7855#(< 26 main_~y~0)} [109] L18-1_primed-->L11-2: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {7855#(< 26 main_~y~0)} is VALID [2022-04-28 03:51:36,566 INFO L290 TraceCheckUtils]: 6: Hoare triple {7855#(< 26 main_~y~0)} [108] L11-2-->L18-1_primed: Formula: (let ((.cse0 (= |v_main_#t~post4_84| |v_main_#t~post4_83|))) (or (and (< v_main_~x~0_445 50001) (< v_main_~x~0_446 v_main_~x~0_445)) (and .cse0 (= v_main_~x~0_445 v_main_~x~0_446) (not (< v_main_~x~0_446 50000))) (and .cse0 (= v_main_~x~0_446 v_main_~x~0_445)))) InVars {main_~x~0=v_main_~x~0_446, main_#t~post4=|v_main_#t~post4_84|} OutVars{main_~x~0=v_main_~x~0_445, main_#t~post4=|v_main_#t~post4_83|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {7855#(< 26 main_~y~0)} is VALID [2022-04-28 03:51:36,567 INFO L290 TraceCheckUtils]: 5: Hoare triple {7687#true} ~x~0 := 0;~y~0 := 50000;~z~0 := 0;~x~0 := 0; {7855#(< 26 main_~y~0)} is VALID [2022-04-28 03:51:36,567 INFO L272 TraceCheckUtils]: 4: Hoare triple {7687#true} call #t~ret7 := main(); {7687#true} is VALID [2022-04-28 03:51:36,567 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {7687#true} {7687#true} #52#return; {7687#true} is VALID [2022-04-28 03:51:36,567 INFO L290 TraceCheckUtils]: 2: Hoare triple {7687#true} assume true; {7687#true} is VALID [2022-04-28 03:51:36,567 INFO L290 TraceCheckUtils]: 1: Hoare triple {7687#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); {7687#true} is VALID [2022-04-28 03:51:36,567 INFO L272 TraceCheckUtils]: 0: Hoare triple {7687#true} call ULTIMATE.init(); {7687#true} is VALID [2022-04-28 03:51:36,567 INFO L134 CoverageAnalysis]: Checked inductivity of 93 backedges. 0 proven. 91 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-04-28 03:51:36,567 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1970125818] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 03:51:36,567 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 03:51:36,567 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 16, 16] total 31 [2022-04-28 03:51:37,325 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 03:51:37,325 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [291819025] [2022-04-28 03:51:37,336 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [291819025] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 03:51:37,336 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 03:51:37,336 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [43] imperfect sequences [] total 43 [2022-04-28 03:51:37,336 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [89885197] [2022-04-28 03:51:37,337 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 03:51:37,340 INFO L78 Accepts]: Start accepts. Automaton has has 43 states, 43 states have (on average 1.6511627906976745) internal successors, (71), 42 states have internal predecessors, (71), 2 states have call successors, (3), 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 75 [2022-04-28 03:51:37,341 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 03:51:37,341 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 43 states, 43 states have (on average 1.6511627906976745) internal successors, (71), 42 states have internal predecessors, (71), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:51:37,393 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 75 edges. 75 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 03:51:37,393 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 43 states [2022-04-28 03:51:37,393 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 03:51:37,393 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2022-04-28 03:51:37,394 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1242, Invalid=1950, Unknown=0, NotChecked=0, Total=3192 [2022-04-28 03:51:37,394 INFO L87 Difference]: Start difference. First operand 76 states and 79 transitions. Second operand has 43 states, 43 states have (on average 1.6511627906976745) internal successors, (71), 42 states have internal predecessors, (71), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:51:40,338 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:51:40,339 INFO L93 Difference]: Finished difference Result 149 states and 160 transitions. [2022-04-28 03:51:40,339 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2022-04-28 03:51:40,339 INFO L78 Accepts]: Start accepts. Automaton has has 43 states, 43 states have (on average 1.6511627906976745) internal successors, (71), 42 states have internal predecessors, (71), 2 states have call successors, (3), 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 75 [2022-04-28 03:51:40,339 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 03:51:40,339 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 43 states, 43 states have (on average 1.6511627906976745) internal successors, (71), 42 states have internal predecessors, (71), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:51:40,340 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 97 transitions. [2022-04-28 03:51:40,340 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 43 states, 43 states have (on average 1.6511627906976745) internal successors, (71), 42 states have internal predecessors, (71), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:51:40,341 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 97 transitions. [2022-04-28 03:51:40,341 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 43 states and 97 transitions. [2022-04-28 03:51:40,416 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 97 edges. 97 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 03:51:40,416 INFO L225 Difference]: With dead ends: 149 [2022-04-28 03:51:40,417 INFO L226 Difference]: Without dead ends: 81 [2022-04-28 03:51:40,418 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 169 GetRequests, 73 SyntacticMatches, 1 SemanticMatches, 95 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2614 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=2922, Invalid=6390, Unknown=0, NotChecked=0, Total=9312 [2022-04-28 03:51:40,418 INFO L413 NwaCegarLoop]: 12 mSDtfsCounter, 119 mSDsluCounter, 27 mSDsCounter, 0 mSdLazyCounter, 1348 mSolverCounterSat, 108 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 119 SdHoareTripleChecker+Valid, 39 SdHoareTripleChecker+Invalid, 1456 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 108 IncrementalHoareTripleChecker+Valid, 1348 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2022-04-28 03:51:40,418 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [119 Valid, 39 Invalid, 1456 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [108 Valid, 1348 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2022-04-28 03:51:40,418 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2022-04-28 03:51:40,519 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 81. [2022-04-28 03:51:40,519 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 03:51:40,519 INFO L82 GeneralOperation]: Start isEquivalent. First operand 81 states. Second operand has 81 states, 76 states have (on average 1.0526315789473684) internal successors, (80), 76 states have internal predecessors, (80), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:51:40,520 INFO L74 IsIncluded]: Start isIncluded. First operand 81 states. Second operand has 81 states, 76 states have (on average 1.0526315789473684) internal successors, (80), 76 states have internal predecessors, (80), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:51:40,520 INFO L87 Difference]: Start difference. First operand 81 states. Second operand has 81 states, 76 states have (on average 1.0526315789473684) internal successors, (80), 76 states have internal predecessors, (80), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:51:40,521 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:51:40,521 INFO L93 Difference]: Finished difference Result 81 states and 84 transitions. [2022-04-28 03:51:40,521 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 84 transitions. [2022-04-28 03:51:40,521 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:51:40,521 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:51:40,521 INFO L74 IsIncluded]: Start isIncluded. First operand has 81 states, 76 states have (on average 1.0526315789473684) internal successors, (80), 76 states have internal predecessors, (80), 3 states have call successors, (3), 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 81 states. [2022-04-28 03:51:40,521 INFO L87 Difference]: Start difference. First operand has 81 states, 76 states have (on average 1.0526315789473684) internal successors, (80), 76 states have internal predecessors, (80), 3 states have call successors, (3), 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 81 states. [2022-04-28 03:51:40,522 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:51:40,522 INFO L93 Difference]: Finished difference Result 81 states and 84 transitions. [2022-04-28 03:51:40,522 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 84 transitions. [2022-04-28 03:51:40,522 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:51:40,522 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:51:40,522 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 03:51:40,522 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 03:51:40,522 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 81 states, 76 states have (on average 1.0526315789473684) internal successors, (80), 76 states have internal predecessors, (80), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:51:40,524 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 84 transitions. [2022-04-28 03:51:40,524 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 84 transitions. Word has length 75 [2022-04-28 03:51:40,524 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 03:51:40,524 INFO L495 AbstractCegarLoop]: Abstraction has 81 states and 84 transitions. [2022-04-28 03:51:40,524 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 43 states, 43 states have (on average 1.6511627906976745) internal successors, (71), 42 states have internal predecessors, (71), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:51:40,524 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 81 states and 84 transitions. [2022-04-28 03:51:40,595 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 84 edges. 84 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 03:51:40,595 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 84 transitions. [2022-04-28 03:51:40,595 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2022-04-28 03:51:40,595 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 03:51:40,595 INFO L195 NwaCegarLoop]: trace histogram [27, 26, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 03:51:40,614 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Forceful destruction successful, exit code 0 [2022-04-28 03:51:40,796 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2022-04-28 03:51:40,796 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 03:51:40,796 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 03:51:40,796 INFO L85 PathProgramCache]: Analyzing trace with hash -1712396772, now seen corresponding path program 14 times [2022-04-28 03:51:40,796 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 03:51:40,797 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [996971473] [2022-04-28 03:51:40,881 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 1 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 03:51:41,071 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={1=1, 2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 03:51:41,072 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-28 03:51:41,074 INFO L85 PathProgramCache]: Analyzing trace with hash 1276734689, now seen corresponding path program 1 times [2022-04-28 03:51:41,074 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 03:51:41,074 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [635918353] [2022-04-28 03:51:41,074 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:51:41,074 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 03:51:41,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:51:41,229 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 03:51:41,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:51:41,256 INFO L290 TraceCheckUtils]: 0: Hoare triple {8636#(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); {8616#true} is VALID [2022-04-28 03:51:41,256 INFO L290 TraceCheckUtils]: 1: Hoare triple {8616#true} assume true; {8616#true} is VALID [2022-04-28 03:51:41,256 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {8616#true} {8616#true} #52#return; {8616#true} is VALID [2022-04-28 03:51:41,256 INFO L272 TraceCheckUtils]: 0: Hoare triple {8616#true} call ULTIMATE.init(); {8636#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 03:51:41,257 INFO L290 TraceCheckUtils]: 1: Hoare triple {8636#(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); {8616#true} is VALID [2022-04-28 03:51:41,257 INFO L290 TraceCheckUtils]: 2: Hoare triple {8616#true} assume true; {8616#true} is VALID [2022-04-28 03:51:41,257 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {8616#true} {8616#true} #52#return; {8616#true} is VALID [2022-04-28 03:51:41,257 INFO L272 TraceCheckUtils]: 4: Hoare triple {8616#true} call #t~ret7 := main(); {8616#true} is VALID [2022-04-28 03:51:41,257 INFO L290 TraceCheckUtils]: 5: Hoare triple {8616#true} ~x~0 := 0;~y~0 := 50000;~z~0 := 0;~x~0 := 0; {8621#(<= 50000 main_~y~0)} is VALID [2022-04-28 03:51:41,257 INFO L290 TraceCheckUtils]: 6: Hoare triple {8621#(<= 50000 main_~y~0)} [112] L11-2-->L18-1_primed: Formula: (let ((.cse0 (= v_main_~x~0_500 v_main_~x~0_499))) (or (and (= |v_main_#t~post4_89| |v_main_#t~post4_90|) (<= 50000 v_main_~x~0_500) .cse0) (and (= |v_main_#t~post4_90| |v_main_#t~post4_89|) .cse0) (and (< v_main_~x~0_499 50001) (< v_main_~x~0_500 v_main_~x~0_499)))) InVars {main_~x~0=v_main_~x~0_500, main_#t~post4=|v_main_#t~post4_90|} OutVars{main_~x~0=v_main_~x~0_499, main_#t~post4=|v_main_#t~post4_89|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {8621#(<= 50000 main_~y~0)} is VALID [2022-04-28 03:51:41,258 INFO L290 TraceCheckUtils]: 7: Hoare triple {8621#(<= 50000 main_~y~0)} [113] L18-1_primed-->L11-2: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {8621#(<= 50000 main_~y~0)} is VALID [2022-04-28 03:51:41,258 INFO L290 TraceCheckUtils]: 8: Hoare triple {8621#(<= 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_~x~0_502 v_main_~x~0_501)) (.cse2 (= |v_main_#t~post6_95| |v_main_#t~post6_94|)) (.cse5 (<= 50000 v_main_~x~0_502)) (.cse3 (= v_main_~y~0_471 v_main_~y~0_470))) (or (and .cse0 .cse1 .cse2 .cse3) (let ((.cse4 (+ v_main_~x~0_502 v_main_~y~0_470))) (and (< v_main_~y~0_471 v_main_~y~0_470) (= .cse4 (+ v_main_~x~0_501 v_main_~y~0_471)) (< .cse4 (+ v_main_~y~0_471 1000001)) .cse5)) (and .cse0 .cse1 .cse2 (or (not (< v_main_~x~0_502 1000000)) (not .cse5)) .cse3))) InVars {main_~y~0=v_main_~y~0_471, main_#t~post5=|v_main_#t~post5_95|, main_~x~0=v_main_~x~0_502, main_#t~post6=|v_main_#t~post6_95|} OutVars{main_~y~0=v_main_~y~0_470, main_#t~post5=|v_main_#t~post5_94|, main_~x~0=v_main_~x~0_501, main_#t~post6=|v_main_#t~post6_94|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {8621#(<= 50000 main_~y~0)} is VALID [2022-04-28 03:51:41,259 INFO L290 TraceCheckUtils]: 9: Hoare triple {8621#(<= 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[] {8621#(<= 50000 main_~y~0)} is VALID [2022-04-28 03:51:41,259 INFO L290 TraceCheckUtils]: 10: Hoare triple {8621#(<= 50000 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {8622#(<= 49998 main_~y~0)} is VALID [2022-04-28 03:51:41,260 INFO L290 TraceCheckUtils]: 11: Hoare triple {8622#(<= 49998 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {8623#(<= 49996 main_~y~0)} is VALID [2022-04-28 03:51:41,260 INFO L290 TraceCheckUtils]: 12: Hoare triple {8623#(<= 49996 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {8624#(<= 49994 main_~y~0)} is VALID [2022-04-28 03:51:41,261 INFO L290 TraceCheckUtils]: 13: Hoare triple {8624#(<= 49994 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {8625#(<= 49992 main_~y~0)} is VALID [2022-04-28 03:51:41,261 INFO L290 TraceCheckUtils]: 14: Hoare triple {8625#(<= 49992 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {8626#(<= 49990 main_~y~0)} is VALID [2022-04-28 03:51:41,261 INFO L290 TraceCheckUtils]: 15: Hoare triple {8626#(<= 49990 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {8627#(<= 49988 main_~y~0)} is VALID [2022-04-28 03:51:41,262 INFO L290 TraceCheckUtils]: 16: Hoare triple {8627#(<= 49988 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {8628#(<= 49986 main_~y~0)} is VALID [2022-04-28 03:51:41,262 INFO L290 TraceCheckUtils]: 17: Hoare triple {8628#(<= 49986 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {8629#(<= 49984 main_~y~0)} is VALID [2022-04-28 03:51:41,263 INFO L290 TraceCheckUtils]: 18: Hoare triple {8629#(<= 49984 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {8630#(<= 49982 main_~y~0)} is VALID [2022-04-28 03:51:41,263 INFO L290 TraceCheckUtils]: 19: Hoare triple {8630#(<= 49982 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {8631#(<= 49980 main_~y~0)} is VALID [2022-04-28 03:51:41,264 INFO L290 TraceCheckUtils]: 20: Hoare triple {8631#(<= 49980 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {8632#(<= 49978 main_~y~0)} is VALID [2022-04-28 03:51:41,264 INFO L290 TraceCheckUtils]: 21: Hoare triple {8632#(<= 49978 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {8633#(<= 49976 main_~y~0)} is VALID [2022-04-28 03:51:41,265 INFO L290 TraceCheckUtils]: 22: Hoare triple {8633#(<= 49976 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {8634#(<= 49974 main_~y~0)} is VALID [2022-04-28 03:51:41,265 INFO L290 TraceCheckUtils]: 23: Hoare triple {8634#(<= 49974 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {8635#(<= 49972 main_~y~0)} is VALID [2022-04-28 03:51:41,265 INFO L290 TraceCheckUtils]: 24: Hoare triple {8635#(<= 49972 main_~y~0)} assume !(~y~0 > 0); {8617#false} is VALID [2022-04-28 03:51:41,265 INFO L272 TraceCheckUtils]: 25: Hoare triple {8617#false} call __VERIFIER_assert((if ~z~0 == ~x~0 then 1 else 0)); {8617#false} is VALID [2022-04-28 03:51:41,266 INFO L290 TraceCheckUtils]: 26: Hoare triple {8617#false} ~cond := #in~cond; {8617#false} is VALID [2022-04-28 03:51:41,266 INFO L290 TraceCheckUtils]: 27: Hoare triple {8617#false} assume 0 == ~cond; {8617#false} is VALID [2022-04-28 03:51:41,266 INFO L290 TraceCheckUtils]: 28: Hoare triple {8617#false} assume !false; {8617#false} is VALID [2022-04-28 03:51:41,266 INFO L134 CoverageAnalysis]: Checked inductivity of 107 backedges. 0 proven. 105 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-04-28 03:51:41,266 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 03:51:41,266 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [635918353] [2022-04-28 03:51:41,266 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [635918353] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 03:51:41,266 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1234756892] [2022-04-28 03:51:41,266 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:51:41,266 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 03:51:41,266 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 03:51:41,267 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 03:51:41,268 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2022-04-28 03:51:41,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:51:41,300 INFO L263 TraceCheckSpWp]: Trace formula consists of 129 conjuncts, 17 conjunts are in the unsatisfiable core [2022-04-28 03:51:41,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:51:41,311 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 03:51:41,580 INFO L272 TraceCheckUtils]: 0: Hoare triple {8616#true} call ULTIMATE.init(); {8616#true} is VALID [2022-04-28 03:51:41,581 INFO L290 TraceCheckUtils]: 1: Hoare triple {8616#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); {8616#true} is VALID [2022-04-28 03:51:41,581 INFO L290 TraceCheckUtils]: 2: Hoare triple {8616#true} assume true; {8616#true} is VALID [2022-04-28 03:51:41,581 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {8616#true} {8616#true} #52#return; {8616#true} is VALID [2022-04-28 03:51:41,581 INFO L272 TraceCheckUtils]: 4: Hoare triple {8616#true} call #t~ret7 := main(); {8616#true} is VALID [2022-04-28 03:51:41,581 INFO L290 TraceCheckUtils]: 5: Hoare triple {8616#true} ~x~0 := 0;~y~0 := 50000;~z~0 := 0;~x~0 := 0; {8621#(<= 50000 main_~y~0)} is VALID [2022-04-28 03:51:41,581 INFO L290 TraceCheckUtils]: 6: Hoare triple {8621#(<= 50000 main_~y~0)} [112] L11-2-->L18-1_primed: Formula: (let ((.cse0 (= v_main_~x~0_500 v_main_~x~0_499))) (or (and (= |v_main_#t~post4_89| |v_main_#t~post4_90|) (<= 50000 v_main_~x~0_500) .cse0) (and (= |v_main_#t~post4_90| |v_main_#t~post4_89|) .cse0) (and (< v_main_~x~0_499 50001) (< v_main_~x~0_500 v_main_~x~0_499)))) InVars {main_~x~0=v_main_~x~0_500, main_#t~post4=|v_main_#t~post4_90|} OutVars{main_~x~0=v_main_~x~0_499, main_#t~post4=|v_main_#t~post4_89|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {8621#(<= 50000 main_~y~0)} is VALID [2022-04-28 03:51:41,582 INFO L290 TraceCheckUtils]: 7: Hoare triple {8621#(<= 50000 main_~y~0)} [113] L18-1_primed-->L11-2: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {8621#(<= 50000 main_~y~0)} is VALID [2022-04-28 03:51:41,582 INFO L290 TraceCheckUtils]: 8: Hoare triple {8621#(<= 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_~x~0_502 v_main_~x~0_501)) (.cse2 (= |v_main_#t~post6_95| |v_main_#t~post6_94|)) (.cse5 (<= 50000 v_main_~x~0_502)) (.cse3 (= v_main_~y~0_471 v_main_~y~0_470))) (or (and .cse0 .cse1 .cse2 .cse3) (let ((.cse4 (+ v_main_~x~0_502 v_main_~y~0_470))) (and (< v_main_~y~0_471 v_main_~y~0_470) (= .cse4 (+ v_main_~x~0_501 v_main_~y~0_471)) (< .cse4 (+ v_main_~y~0_471 1000001)) .cse5)) (and .cse0 .cse1 .cse2 (or (not (< v_main_~x~0_502 1000000)) (not .cse5)) .cse3))) InVars {main_~y~0=v_main_~y~0_471, main_#t~post5=|v_main_#t~post5_95|, main_~x~0=v_main_~x~0_502, main_#t~post6=|v_main_#t~post6_95|} OutVars{main_~y~0=v_main_~y~0_470, main_#t~post5=|v_main_#t~post5_94|, main_~x~0=v_main_~x~0_501, main_#t~post6=|v_main_#t~post6_94|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {8621#(<= 50000 main_~y~0)} is VALID [2022-04-28 03:51:41,583 INFO L290 TraceCheckUtils]: 9: Hoare triple {8621#(<= 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[] {8621#(<= 50000 main_~y~0)} is VALID [2022-04-28 03:51:41,583 INFO L290 TraceCheckUtils]: 10: Hoare triple {8621#(<= 50000 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {8622#(<= 49998 main_~y~0)} is VALID [2022-04-28 03:51:41,583 INFO L290 TraceCheckUtils]: 11: Hoare triple {8622#(<= 49998 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {8623#(<= 49996 main_~y~0)} is VALID [2022-04-28 03:51:41,584 INFO L290 TraceCheckUtils]: 12: Hoare triple {8623#(<= 49996 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {8624#(<= 49994 main_~y~0)} is VALID [2022-04-28 03:51:41,584 INFO L290 TraceCheckUtils]: 13: Hoare triple {8624#(<= 49994 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {8625#(<= 49992 main_~y~0)} is VALID [2022-04-28 03:51:41,585 INFO L290 TraceCheckUtils]: 14: Hoare triple {8625#(<= 49992 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {8626#(<= 49990 main_~y~0)} is VALID [2022-04-28 03:51:41,585 INFO L290 TraceCheckUtils]: 15: Hoare triple {8626#(<= 49990 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {8627#(<= 49988 main_~y~0)} is VALID [2022-04-28 03:51:41,586 INFO L290 TraceCheckUtils]: 16: Hoare triple {8627#(<= 49988 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {8628#(<= 49986 main_~y~0)} is VALID [2022-04-28 03:51:41,586 INFO L290 TraceCheckUtils]: 17: Hoare triple {8628#(<= 49986 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {8629#(<= 49984 main_~y~0)} is VALID [2022-04-28 03:51:41,586 INFO L290 TraceCheckUtils]: 18: Hoare triple {8629#(<= 49984 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {8630#(<= 49982 main_~y~0)} is VALID [2022-04-28 03:51:41,587 INFO L290 TraceCheckUtils]: 19: Hoare triple {8630#(<= 49982 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {8631#(<= 49980 main_~y~0)} is VALID [2022-04-28 03:51:41,587 INFO L290 TraceCheckUtils]: 20: Hoare triple {8631#(<= 49980 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {8632#(<= 49978 main_~y~0)} is VALID [2022-04-28 03:51:41,588 INFO L290 TraceCheckUtils]: 21: Hoare triple {8632#(<= 49978 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {8633#(<= 49976 main_~y~0)} is VALID [2022-04-28 03:51:41,588 INFO L290 TraceCheckUtils]: 22: Hoare triple {8633#(<= 49976 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {8634#(<= 49974 main_~y~0)} is VALID [2022-04-28 03:51:41,588 INFO L290 TraceCheckUtils]: 23: Hoare triple {8634#(<= 49974 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {8635#(<= 49972 main_~y~0)} is VALID [2022-04-28 03:51:41,589 INFO L290 TraceCheckUtils]: 24: Hoare triple {8635#(<= 49972 main_~y~0)} assume !(~y~0 > 0); {8617#false} is VALID [2022-04-28 03:51:41,589 INFO L272 TraceCheckUtils]: 25: Hoare triple {8617#false} call __VERIFIER_assert((if ~z~0 == ~x~0 then 1 else 0)); {8617#false} is VALID [2022-04-28 03:51:41,589 INFO L290 TraceCheckUtils]: 26: Hoare triple {8617#false} ~cond := #in~cond; {8617#false} is VALID [2022-04-28 03:51:41,589 INFO L290 TraceCheckUtils]: 27: Hoare triple {8617#false} assume 0 == ~cond; {8617#false} is VALID [2022-04-28 03:51:41,589 INFO L290 TraceCheckUtils]: 28: Hoare triple {8617#false} assume !false; {8617#false} is VALID [2022-04-28 03:51:41,589 INFO L134 CoverageAnalysis]: Checked inductivity of 107 backedges. 0 proven. 105 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-04-28 03:51:41,589 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 03:51:42,103 INFO L290 TraceCheckUtils]: 28: Hoare triple {8617#false} assume !false; {8617#false} is VALID [2022-04-28 03:51:42,103 INFO L290 TraceCheckUtils]: 27: Hoare triple {8617#false} assume 0 == ~cond; {8617#false} is VALID [2022-04-28 03:51:42,103 INFO L290 TraceCheckUtils]: 26: Hoare triple {8617#false} ~cond := #in~cond; {8617#false} is VALID [2022-04-28 03:51:42,103 INFO L272 TraceCheckUtils]: 25: Hoare triple {8617#false} call __VERIFIER_assert((if ~z~0 == ~x~0 then 1 else 0)); {8617#false} is VALID [2022-04-28 03:51:42,108 INFO L290 TraceCheckUtils]: 24: Hoare triple {8736#(< 0 main_~y~0)} assume !(~y~0 > 0); {8617#false} is VALID [2022-04-28 03:51:42,108 INFO L290 TraceCheckUtils]: 23: Hoare triple {8740#(< 2 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {8736#(< 0 main_~y~0)} is VALID [2022-04-28 03:51:42,109 INFO L290 TraceCheckUtils]: 22: Hoare triple {8744#(< 4 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {8740#(< 2 main_~y~0)} is VALID [2022-04-28 03:51:42,109 INFO L290 TraceCheckUtils]: 21: Hoare triple {8748#(< 6 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {8744#(< 4 main_~y~0)} is VALID [2022-04-28 03:51:42,110 INFO L290 TraceCheckUtils]: 20: Hoare triple {8752#(< 8 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {8748#(< 6 main_~y~0)} is VALID [2022-04-28 03:51:42,110 INFO L290 TraceCheckUtils]: 19: Hoare triple {8756#(< 10 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {8752#(< 8 main_~y~0)} is VALID [2022-04-28 03:51:42,111 INFO L290 TraceCheckUtils]: 18: Hoare triple {8760#(< 12 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {8756#(< 10 main_~y~0)} is VALID [2022-04-28 03:51:42,111 INFO L290 TraceCheckUtils]: 17: Hoare triple {8764#(< 14 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {8760#(< 12 main_~y~0)} is VALID [2022-04-28 03:51:42,112 INFO L290 TraceCheckUtils]: 16: Hoare triple {8768#(< 16 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {8764#(< 14 main_~y~0)} is VALID [2022-04-28 03:51:42,123 INFO L290 TraceCheckUtils]: 15: Hoare triple {8772#(< 18 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {8768#(< 16 main_~y~0)} is VALID [2022-04-28 03:51:42,124 INFO L290 TraceCheckUtils]: 14: Hoare triple {8776#(< 20 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {8772#(< 18 main_~y~0)} is VALID [2022-04-28 03:51:42,124 INFO L290 TraceCheckUtils]: 13: Hoare triple {8780#(< 22 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {8776#(< 20 main_~y~0)} is VALID [2022-04-28 03:51:42,125 INFO L290 TraceCheckUtils]: 12: Hoare triple {8784#(< 24 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {8780#(< 22 main_~y~0)} is VALID [2022-04-28 03:51:42,125 INFO L290 TraceCheckUtils]: 11: Hoare triple {8788#(< 26 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {8784#(< 24 main_~y~0)} is VALID [2022-04-28 03:51:42,126 INFO L290 TraceCheckUtils]: 10: Hoare triple {8792#(< 28 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {8788#(< 26 main_~y~0)} is VALID [2022-04-28 03:51:42,126 INFO L290 TraceCheckUtils]: 9: Hoare triple {8792#(< 28 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[] {8792#(< 28 main_~y~0)} is VALID [2022-04-28 03:51:42,127 INFO L290 TraceCheckUtils]: 8: Hoare triple {8792#(< 28 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_~x~0_502 v_main_~x~0_501)) (.cse2 (= |v_main_#t~post6_95| |v_main_#t~post6_94|)) (.cse5 (<= 50000 v_main_~x~0_502)) (.cse3 (= v_main_~y~0_471 v_main_~y~0_470))) (or (and .cse0 .cse1 .cse2 .cse3) (let ((.cse4 (+ v_main_~x~0_502 v_main_~y~0_470))) (and (< v_main_~y~0_471 v_main_~y~0_470) (= .cse4 (+ v_main_~x~0_501 v_main_~y~0_471)) (< .cse4 (+ v_main_~y~0_471 1000001)) .cse5)) (and .cse0 .cse1 .cse2 (or (not (< v_main_~x~0_502 1000000)) (not .cse5)) .cse3))) InVars {main_~y~0=v_main_~y~0_471, main_#t~post5=|v_main_#t~post5_95|, main_~x~0=v_main_~x~0_502, main_#t~post6=|v_main_#t~post6_95|} OutVars{main_~y~0=v_main_~y~0_470, main_#t~post5=|v_main_#t~post5_94|, main_~x~0=v_main_~x~0_501, main_#t~post6=|v_main_#t~post6_94|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {8792#(< 28 main_~y~0)} is VALID [2022-04-28 03:51:42,127 INFO L290 TraceCheckUtils]: 7: Hoare triple {8792#(< 28 main_~y~0)} [113] L18-1_primed-->L11-2: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {8792#(< 28 main_~y~0)} is VALID [2022-04-28 03:51:42,128 INFO L290 TraceCheckUtils]: 6: Hoare triple {8792#(< 28 main_~y~0)} [112] L11-2-->L18-1_primed: Formula: (let ((.cse0 (= v_main_~x~0_500 v_main_~x~0_499))) (or (and (= |v_main_#t~post4_89| |v_main_#t~post4_90|) (<= 50000 v_main_~x~0_500) .cse0) (and (= |v_main_#t~post4_90| |v_main_#t~post4_89|) .cse0) (and (< v_main_~x~0_499 50001) (< v_main_~x~0_500 v_main_~x~0_499)))) InVars {main_~x~0=v_main_~x~0_500, main_#t~post4=|v_main_#t~post4_90|} OutVars{main_~x~0=v_main_~x~0_499, main_#t~post4=|v_main_#t~post4_89|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {8792#(< 28 main_~y~0)} is VALID [2022-04-28 03:51:42,128 INFO L290 TraceCheckUtils]: 5: Hoare triple {8616#true} ~x~0 := 0;~y~0 := 50000;~z~0 := 0;~x~0 := 0; {8792#(< 28 main_~y~0)} is VALID [2022-04-28 03:51:42,128 INFO L272 TraceCheckUtils]: 4: Hoare triple {8616#true} call #t~ret7 := main(); {8616#true} is VALID [2022-04-28 03:51:42,128 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {8616#true} {8616#true} #52#return; {8616#true} is VALID [2022-04-28 03:51:42,128 INFO L290 TraceCheckUtils]: 2: Hoare triple {8616#true} assume true; {8616#true} is VALID [2022-04-28 03:51:42,128 INFO L290 TraceCheckUtils]: 1: Hoare triple {8616#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); {8616#true} is VALID [2022-04-28 03:51:42,128 INFO L272 TraceCheckUtils]: 0: Hoare triple {8616#true} call ULTIMATE.init(); {8616#true} is VALID [2022-04-28 03:51:42,128 INFO L134 CoverageAnalysis]: Checked inductivity of 107 backedges. 0 proven. 105 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-04-28 03:51:42,129 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1234756892] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 03:51:42,129 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 03:51:42,129 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 17, 17] total 33 [2022-04-28 03:51:42,934 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 03:51:42,934 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [996971473] [2022-04-28 03:51:42,934 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [996971473] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 03:51:42,934 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 03:51:42,934 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [46] imperfect sequences [] total 46 [2022-04-28 03:51:42,934 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [382715923] [2022-04-28 03:51:42,934 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 03:51:42,935 INFO L78 Accepts]: Start accepts. Automaton has has 46 states, 46 states have (on average 1.6521739130434783) internal successors, (76), 45 states have internal predecessors, (76), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 80 [2022-04-28 03:51:42,935 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 03:51:42,935 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 46 states, 46 states have (on average 1.6521739130434783) internal successors, (76), 45 states have internal predecessors, (76), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:51:43,025 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 80 edges. 80 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 03:51:43,026 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 46 states [2022-04-28 03:51:43,026 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 03:51:43,026 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2022-04-28 03:51:43,027 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1421, Invalid=2239, Unknown=0, NotChecked=0, Total=3660 [2022-04-28 03:51:43,027 INFO L87 Difference]: Start difference. First operand 81 states and 84 transitions. Second operand has 46 states, 46 states have (on average 1.6521739130434783) internal successors, (76), 45 states have internal predecessors, (76), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:51:46,327 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:51:46,327 INFO L93 Difference]: Finished difference Result 159 states and 170 transitions. [2022-04-28 03:51:46,327 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2022-04-28 03:51:46,328 INFO L78 Accepts]: Start accepts. Automaton has has 46 states, 46 states have (on average 1.6521739130434783) internal successors, (76), 45 states have internal predecessors, (76), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 80 [2022-04-28 03:51:46,328 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 03:51:46,328 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 46 states, 46 states have (on average 1.6521739130434783) internal successors, (76), 45 states have internal predecessors, (76), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:51:46,330 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 102 transitions. [2022-04-28 03:51:46,330 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 46 states, 46 states have (on average 1.6521739130434783) internal successors, (76), 45 states have internal predecessors, (76), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:51:46,332 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 102 transitions. [2022-04-28 03:51:46,332 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 46 states and 102 transitions. [2022-04-28 03:51:46,419 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 102 edges. 102 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 03:51:46,420 INFO L225 Difference]: With dead ends: 159 [2022-04-28 03:51:46,420 INFO L226 Difference]: Without dead ends: 86 [2022-04-28 03:51:46,421 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 179 GetRequests, 76 SyntacticMatches, 1 SemanticMatches, 102 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3018 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=3342, Invalid=7370, Unknown=0, NotChecked=0, Total=10712 [2022-04-28 03:51:46,422 INFO L413 NwaCegarLoop]: 12 mSDtfsCounter, 157 mSDsluCounter, 37 mSDsCounter, 0 mSdLazyCounter, 1599 mSolverCounterSat, 176 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 157 SdHoareTripleChecker+Valid, 49 SdHoareTripleChecker+Invalid, 1775 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 176 IncrementalHoareTripleChecker+Valid, 1599 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2022-04-28 03:51:46,422 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [157 Valid, 49 Invalid, 1775 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [176 Valid, 1599 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2022-04-28 03:51:46,422 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2022-04-28 03:51:46,534 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 86. [2022-04-28 03:51:46,534 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 03:51:46,535 INFO L82 GeneralOperation]: Start isEquivalent. First operand 86 states. Second operand has 86 states, 81 states have (on average 1.0493827160493827) internal successors, (85), 81 states have internal predecessors, (85), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:51:46,535 INFO L74 IsIncluded]: Start isIncluded. First operand 86 states. Second operand has 86 states, 81 states have (on average 1.0493827160493827) internal successors, (85), 81 states have internal predecessors, (85), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:51:46,535 INFO L87 Difference]: Start difference. First operand 86 states. Second operand has 86 states, 81 states have (on average 1.0493827160493827) internal successors, (85), 81 states have internal predecessors, (85), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:51:46,538 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:51:46,538 INFO L93 Difference]: Finished difference Result 86 states and 89 transitions. [2022-04-28 03:51:46,538 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 89 transitions. [2022-04-28 03:51:46,539 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:51:46,539 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:51:46,539 INFO L74 IsIncluded]: Start isIncluded. First operand has 86 states, 81 states have (on average 1.0493827160493827) internal successors, (85), 81 states have internal predecessors, (85), 3 states have call successors, (3), 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 86 states. [2022-04-28 03:51:46,539 INFO L87 Difference]: Start difference. First operand has 86 states, 81 states have (on average 1.0493827160493827) internal successors, (85), 81 states have internal predecessors, (85), 3 states have call successors, (3), 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 86 states. [2022-04-28 03:51:46,540 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:51:46,540 INFO L93 Difference]: Finished difference Result 86 states and 89 transitions. [2022-04-28 03:51:46,540 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 89 transitions. [2022-04-28 03:51:46,540 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:51:46,540 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:51:46,540 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 03:51:46,540 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 03:51:46,540 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 86 states, 81 states have (on average 1.0493827160493827) internal successors, (85), 81 states have internal predecessors, (85), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:51:46,541 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 89 transitions. [2022-04-28 03:51:46,541 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 89 transitions. Word has length 80 [2022-04-28 03:51:46,541 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 03:51:46,541 INFO L495 AbstractCegarLoop]: Abstraction has 86 states and 89 transitions. [2022-04-28 03:51:46,541 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 46 states, 46 states have (on average 1.6521739130434783) internal successors, (76), 45 states have internal predecessors, (76), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:51:46,541 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 86 states and 89 transitions. [2022-04-28 03:51:46,622 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 89 edges. 89 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 03:51:46,622 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 89 transitions. [2022-04-28 03:51:46,623 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2022-04-28 03:51:46,623 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 03:51:46,623 INFO L195 NwaCegarLoop]: trace histogram [29, 28, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 03:51:46,640 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Forceful destruction successful, exit code 0 [2022-04-28 03:51:46,823 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16,15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 03:51:46,823 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 03:51:46,824 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 03:51:46,824 INFO L85 PathProgramCache]: Analyzing trace with hash 1383819325, now seen corresponding path program 15 times [2022-04-28 03:51:46,824 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 03:51:46,824 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [2119943043] [2022-04-28 03:51:46,925 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 1 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 03:51:47,143 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={1=1, 2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 03:51:47,144 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-28 03:51:47,146 INFO L85 PathProgramCache]: Analyzing trace with hash -1636183134, now seen corresponding path program 1 times [2022-04-28 03:51:47,146 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 03:51:47,146 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [115622660] [2022-04-28 03:51:47,146 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:51:47,146 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 03:51:47,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:51:47,322 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 03:51:47,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:51:47,326 INFO L290 TraceCheckUtils]: 0: Hoare triple {9622#(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); {9601#true} is VALID [2022-04-28 03:51:47,326 INFO L290 TraceCheckUtils]: 1: Hoare triple {9601#true} assume true; {9601#true} is VALID [2022-04-28 03:51:47,326 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {9601#true} {9601#true} #52#return; {9601#true} is VALID [2022-04-28 03:51:47,326 INFO L272 TraceCheckUtils]: 0: Hoare triple {9601#true} call ULTIMATE.init(); {9622#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 03:51:47,326 INFO L290 TraceCheckUtils]: 1: Hoare triple {9622#(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); {9601#true} is VALID [2022-04-28 03:51:47,327 INFO L290 TraceCheckUtils]: 2: Hoare triple {9601#true} assume true; {9601#true} is VALID [2022-04-28 03:51:47,327 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {9601#true} {9601#true} #52#return; {9601#true} is VALID [2022-04-28 03:51:47,327 INFO L272 TraceCheckUtils]: 4: Hoare triple {9601#true} call #t~ret7 := main(); {9601#true} is VALID [2022-04-28 03:51:47,327 INFO L290 TraceCheckUtils]: 5: Hoare triple {9601#true} ~x~0 := 0;~y~0 := 50000;~z~0 := 0;~x~0 := 0; {9606#(<= 50000 main_~y~0)} is VALID [2022-04-28 03:51:47,327 INFO L290 TraceCheckUtils]: 6: Hoare triple {9606#(<= 50000 main_~y~0)} [116] L11-2-->L18-1_primed: Formula: (let ((.cse0 (= v_main_~x~0_557 v_main_~x~0_556)) (.cse1 (= |v_main_#t~post4_96| |v_main_#t~post4_95|))) (or (and .cse0 .cse1 (not (< v_main_~x~0_557 50000))) (and .cse0 .cse1) (and (< v_main_~x~0_556 50001) (< v_main_~x~0_557 v_main_~x~0_556)))) InVars {main_~x~0=v_main_~x~0_557, main_#t~post4=|v_main_#t~post4_96|} OutVars{main_~x~0=v_main_~x~0_556, main_#t~post4=|v_main_#t~post4_95|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {9606#(<= 50000 main_~y~0)} is VALID [2022-04-28 03:51:47,328 INFO L290 TraceCheckUtils]: 7: Hoare triple {9606#(<= 50000 main_~y~0)} [117] L18-1_primed-->L11-2: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {9606#(<= 50000 main_~y~0)} is VALID [2022-04-28 03:51:47,328 INFO L290 TraceCheckUtils]: 8: Hoare triple {9606#(<= 50000 main_~y~0)} [118] L11-2-->L18-1_primed: Formula: (let ((.cse0 (<= 50000 v_main_~x~0_559)) (.cse1 (= v_main_~x~0_559 v_main_~x~0_558)) (.cse2 (= v_main_~y~0_534 v_main_~y~0_533)) (.cse3 (= |v_main_#t~post6_102| |v_main_#t~post6_101|)) (.cse4 (= |v_main_#t~post5_102| |v_main_#t~post5_101|))) (or (and .cse0 (< v_main_~x~0_558 1000001) (< v_main_~x~0_559 v_main_~x~0_558) (= (+ v_main_~x~0_559 v_main_~y~0_533) (+ v_main_~x~0_558 v_main_~y~0_534))) (and .cse1 .cse2 .cse3 .cse4) (and (or (not (< v_main_~x~0_559 1000000)) (not .cse0)) .cse1 .cse2 .cse3 .cse4))) InVars {main_~y~0=v_main_~y~0_534, main_#t~post5=|v_main_#t~post5_102|, main_~x~0=v_main_~x~0_559, main_#t~post6=|v_main_#t~post6_102|} OutVars{main_~y~0=v_main_~y~0_533, main_#t~post5=|v_main_#t~post5_101|, main_~x~0=v_main_~x~0_558, main_#t~post6=|v_main_#t~post6_101|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {9606#(<= 50000 main_~y~0)} is VALID [2022-04-28 03:51:47,328 INFO L290 TraceCheckUtils]: 9: Hoare triple {9606#(<= 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[] {9606#(<= 50000 main_~y~0)} is VALID [2022-04-28 03:51:47,329 INFO L290 TraceCheckUtils]: 10: Hoare triple {9606#(<= 50000 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {9607#(<= 49998 main_~y~0)} is VALID [2022-04-28 03:51:47,329 INFO L290 TraceCheckUtils]: 11: Hoare triple {9607#(<= 49998 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {9608#(<= 49996 main_~y~0)} is VALID [2022-04-28 03:51:47,330 INFO L290 TraceCheckUtils]: 12: Hoare triple {9608#(<= 49996 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {9609#(<= 49994 main_~y~0)} is VALID [2022-04-28 03:51:47,330 INFO L290 TraceCheckUtils]: 13: Hoare triple {9609#(<= 49994 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {9610#(<= 49992 main_~y~0)} is VALID [2022-04-28 03:51:47,331 INFO L290 TraceCheckUtils]: 14: Hoare triple {9610#(<= 49992 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {9611#(<= 49990 main_~y~0)} is VALID [2022-04-28 03:51:47,331 INFO L290 TraceCheckUtils]: 15: Hoare triple {9611#(<= 49990 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {9612#(<= 49988 main_~y~0)} is VALID [2022-04-28 03:51:47,331 INFO L290 TraceCheckUtils]: 16: Hoare triple {9612#(<= 49988 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {9613#(<= 49986 main_~y~0)} is VALID [2022-04-28 03:51:47,332 INFO L290 TraceCheckUtils]: 17: Hoare triple {9613#(<= 49986 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {9614#(<= 49984 main_~y~0)} is VALID [2022-04-28 03:51:47,332 INFO L290 TraceCheckUtils]: 18: Hoare triple {9614#(<= 49984 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {9615#(<= 49982 main_~y~0)} is VALID [2022-04-28 03:51:47,333 INFO L290 TraceCheckUtils]: 19: Hoare triple {9615#(<= 49982 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {9616#(<= 49980 main_~y~0)} is VALID [2022-04-28 03:51:47,333 INFO L290 TraceCheckUtils]: 20: Hoare triple {9616#(<= 49980 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {9617#(<= 49978 main_~y~0)} is VALID [2022-04-28 03:51:47,334 INFO L290 TraceCheckUtils]: 21: Hoare triple {9617#(<= 49978 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {9618#(<= 49976 main_~y~0)} is VALID [2022-04-28 03:51:47,334 INFO L290 TraceCheckUtils]: 22: Hoare triple {9618#(<= 49976 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {9619#(<= 49974 main_~y~0)} is VALID [2022-04-28 03:51:47,334 INFO L290 TraceCheckUtils]: 23: Hoare triple {9619#(<= 49974 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {9620#(<= 49972 main_~y~0)} is VALID [2022-04-28 03:51:47,335 INFO L290 TraceCheckUtils]: 24: Hoare triple {9620#(<= 49972 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {9621#(<= 49970 main_~y~0)} is VALID [2022-04-28 03:51:47,335 INFO L290 TraceCheckUtils]: 25: Hoare triple {9621#(<= 49970 main_~y~0)} assume !(~y~0 > 0); {9602#false} is VALID [2022-04-28 03:51:47,335 INFO L272 TraceCheckUtils]: 26: Hoare triple {9602#false} call __VERIFIER_assert((if ~z~0 == ~x~0 then 1 else 0)); {9602#false} is VALID [2022-04-28 03:51:47,335 INFO L290 TraceCheckUtils]: 27: Hoare triple {9602#false} ~cond := #in~cond; {9602#false} is VALID [2022-04-28 03:51:47,335 INFO L290 TraceCheckUtils]: 28: Hoare triple {9602#false} assume 0 == ~cond; {9602#false} is VALID [2022-04-28 03:51:47,335 INFO L290 TraceCheckUtils]: 29: Hoare triple {9602#false} assume !false; {9602#false} is VALID [2022-04-28 03:51:47,335 INFO L134 CoverageAnalysis]: Checked inductivity of 122 backedges. 0 proven. 120 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-04-28 03:51:47,336 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 03:51:47,336 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [115622660] [2022-04-28 03:51:47,336 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [115622660] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 03:51:47,336 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [96029856] [2022-04-28 03:51:47,336 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:51:47,336 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 03:51:47,336 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 03:51:47,337 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 03:51:47,337 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2022-04-28 03:51:47,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:51:47,373 INFO L263 TraceCheckSpWp]: Trace formula consists of 134 conjuncts, 21 conjunts are in the unsatisfiable core [2022-04-28 03:51:47,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:51:47,386 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 03:51:47,914 INFO L272 TraceCheckUtils]: 0: Hoare triple {9601#true} call ULTIMATE.init(); {9601#true} is VALID [2022-04-28 03:51:47,914 INFO L290 TraceCheckUtils]: 1: Hoare triple {9601#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); {9601#true} is VALID [2022-04-28 03:51:47,914 INFO L290 TraceCheckUtils]: 2: Hoare triple {9601#true} assume true; {9601#true} is VALID [2022-04-28 03:51:47,914 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {9601#true} {9601#true} #52#return; {9601#true} is VALID [2022-04-28 03:51:47,914 INFO L272 TraceCheckUtils]: 4: Hoare triple {9601#true} call #t~ret7 := main(); {9601#true} is VALID [2022-04-28 03:51:47,914 INFO L290 TraceCheckUtils]: 5: Hoare triple {9601#true} ~x~0 := 0;~y~0 := 50000;~z~0 := 0;~x~0 := 0; {9641#(and (<= main_~x~0 0) (<= 50000 main_~y~0))} is VALID [2022-04-28 03:51:47,915 INFO L290 TraceCheckUtils]: 6: Hoare triple {9641#(and (<= main_~x~0 0) (<= 50000 main_~y~0))} [116] L11-2-->L18-1_primed: Formula: (let ((.cse0 (= v_main_~x~0_557 v_main_~x~0_556)) (.cse1 (= |v_main_#t~post4_96| |v_main_#t~post4_95|))) (or (and .cse0 .cse1 (not (< v_main_~x~0_557 50000))) (and .cse0 .cse1) (and (< v_main_~x~0_556 50001) (< v_main_~x~0_557 v_main_~x~0_556)))) InVars {main_~x~0=v_main_~x~0_557, main_#t~post4=|v_main_#t~post4_96|} OutVars{main_~x~0=v_main_~x~0_556, main_#t~post4=|v_main_#t~post4_95|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {9645#(and (< main_~x~0 50001) (<= 50000 main_~y~0))} is VALID [2022-04-28 03:51:47,915 INFO L290 TraceCheckUtils]: 7: Hoare triple {9645#(and (< main_~x~0 50001) (<= 50000 main_~y~0))} [117] L18-1_primed-->L11-2: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {9645#(and (< main_~x~0 50001) (<= 50000 main_~y~0))} is VALID [2022-04-28 03:51:47,916 INFO L290 TraceCheckUtils]: 8: Hoare triple {9645#(and (< main_~x~0 50001) (<= 50000 main_~y~0))} [118] L11-2-->L18-1_primed: Formula: (let ((.cse0 (<= 50000 v_main_~x~0_559)) (.cse1 (= v_main_~x~0_559 v_main_~x~0_558)) (.cse2 (= v_main_~y~0_534 v_main_~y~0_533)) (.cse3 (= |v_main_#t~post6_102| |v_main_#t~post6_101|)) (.cse4 (= |v_main_#t~post5_102| |v_main_#t~post5_101|))) (or (and .cse0 (< v_main_~x~0_558 1000001) (< v_main_~x~0_559 v_main_~x~0_558) (= (+ v_main_~x~0_559 v_main_~y~0_533) (+ v_main_~x~0_558 v_main_~y~0_534))) (and .cse1 .cse2 .cse3 .cse4) (and (or (not (< v_main_~x~0_559 1000000)) (not .cse0)) .cse1 .cse2 .cse3 .cse4))) InVars {main_~y~0=v_main_~y~0_534, main_#t~post5=|v_main_#t~post5_102|, main_~x~0=v_main_~x~0_559, main_#t~post6=|v_main_#t~post6_102|} OutVars{main_~y~0=v_main_~y~0_533, main_#t~post5=|v_main_#t~post5_101|, main_~x~0=v_main_~x~0_558, main_#t~post6=|v_main_#t~post6_101|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {9652#(or (and (< main_~x~0 50001) (<= 50000 main_~y~0)) (and (< main_~x~0 (+ main_~y~0 1)) (< main_~x~0 1000001) (< 50000 main_~x~0)))} is VALID [2022-04-28 03:51:47,916 INFO L290 TraceCheckUtils]: 9: Hoare triple {9652#(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)))} [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[] {9656#(< 999999 main_~y~0)} is VALID [2022-04-28 03:51:47,917 INFO L290 TraceCheckUtils]: 10: Hoare triple {9656#(< 999999 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {9660#(< 999997 main_~y~0)} is VALID [2022-04-28 03:51:47,917 INFO L290 TraceCheckUtils]: 11: Hoare triple {9660#(< 999997 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {9664#(< 999995 main_~y~0)} is VALID [2022-04-28 03:51:47,918 INFO L290 TraceCheckUtils]: 12: Hoare triple {9664#(< 999995 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {9668#(< 999993 main_~y~0)} is VALID [2022-04-28 03:51:47,918 INFO L290 TraceCheckUtils]: 13: Hoare triple {9668#(< 999993 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {9672#(< 999991 main_~y~0)} is VALID [2022-04-28 03:51:47,918 INFO L290 TraceCheckUtils]: 14: Hoare triple {9672#(< 999991 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {9676#(< 999989 main_~y~0)} is VALID [2022-04-28 03:51:47,919 INFO L290 TraceCheckUtils]: 15: Hoare triple {9676#(< 999989 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {9680#(< 999987 main_~y~0)} is VALID [2022-04-28 03:51:47,919 INFO L290 TraceCheckUtils]: 16: Hoare triple {9680#(< 999987 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {9684#(< 999985 main_~y~0)} is VALID [2022-04-28 03:51:47,920 INFO L290 TraceCheckUtils]: 17: Hoare triple {9684#(< 999985 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {9688#(< 999983 main_~y~0)} is VALID [2022-04-28 03:51:47,920 INFO L290 TraceCheckUtils]: 18: Hoare triple {9688#(< 999983 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {9692#(< 999981 main_~y~0)} is VALID [2022-04-28 03:51:47,921 INFO L290 TraceCheckUtils]: 19: Hoare triple {9692#(< 999981 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {9696#(< 999979 main_~y~0)} is VALID [2022-04-28 03:51:47,921 INFO L290 TraceCheckUtils]: 20: Hoare triple {9696#(< 999979 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {9700#(< 999977 main_~y~0)} is VALID [2022-04-28 03:51:47,921 INFO L290 TraceCheckUtils]: 21: Hoare triple {9700#(< 999977 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {9704#(< 999975 main_~y~0)} is VALID [2022-04-28 03:51:47,922 INFO L290 TraceCheckUtils]: 22: Hoare triple {9704#(< 999975 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {9708#(< 999973 main_~y~0)} is VALID [2022-04-28 03:51:47,922 INFO L290 TraceCheckUtils]: 23: Hoare triple {9708#(< 999973 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {9712#(< 999971 main_~y~0)} is VALID [2022-04-28 03:51:47,923 INFO L290 TraceCheckUtils]: 24: Hoare triple {9712#(< 999971 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {9716#(< 999969 main_~y~0)} is VALID [2022-04-28 03:51:47,923 INFO L290 TraceCheckUtils]: 25: Hoare triple {9716#(< 999969 main_~y~0)} assume !(~y~0 > 0); {9602#false} is VALID [2022-04-28 03:51:47,923 INFO L272 TraceCheckUtils]: 26: Hoare triple {9602#false} call __VERIFIER_assert((if ~z~0 == ~x~0 then 1 else 0)); {9602#false} is VALID [2022-04-28 03:51:47,923 INFO L290 TraceCheckUtils]: 27: Hoare triple {9602#false} ~cond := #in~cond; {9602#false} is VALID [2022-04-28 03:51:47,923 INFO L290 TraceCheckUtils]: 28: Hoare triple {9602#false} assume 0 == ~cond; {9602#false} is VALID [2022-04-28 03:51:47,923 INFO L290 TraceCheckUtils]: 29: Hoare triple {9602#false} assume !false; {9602#false} is VALID [2022-04-28 03:51:47,923 INFO L134 CoverageAnalysis]: Checked inductivity of 122 backedges. 0 proven. 122 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 03:51:47,923 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 03:51:48,681 INFO L290 TraceCheckUtils]: 29: Hoare triple {9602#false} assume !false; {9602#false} is VALID [2022-04-28 03:51:48,682 INFO L290 TraceCheckUtils]: 28: Hoare triple {9602#false} assume 0 == ~cond; {9602#false} is VALID [2022-04-28 03:51:48,682 INFO L290 TraceCheckUtils]: 27: Hoare triple {9602#false} ~cond := #in~cond; {9602#false} is VALID [2022-04-28 03:51:48,682 INFO L272 TraceCheckUtils]: 26: Hoare triple {9602#false} call __VERIFIER_assert((if ~z~0 == ~x~0 then 1 else 0)); {9602#false} is VALID [2022-04-28 03:51:48,682 INFO L290 TraceCheckUtils]: 25: Hoare triple {9744#(< 0 main_~y~0)} assume !(~y~0 > 0); {9602#false} is VALID [2022-04-28 03:51:48,683 INFO L290 TraceCheckUtils]: 24: Hoare triple {9748#(< 2 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {9744#(< 0 main_~y~0)} is VALID [2022-04-28 03:51:48,683 INFO L290 TraceCheckUtils]: 23: Hoare triple {9752#(< 4 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {9748#(< 2 main_~y~0)} is VALID [2022-04-28 03:51:48,684 INFO L290 TraceCheckUtils]: 22: Hoare triple {9756#(< 6 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {9752#(< 4 main_~y~0)} is VALID [2022-04-28 03:51:48,684 INFO L290 TraceCheckUtils]: 21: Hoare triple {9760#(< 8 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {9756#(< 6 main_~y~0)} is VALID [2022-04-28 03:51:48,684 INFO L290 TraceCheckUtils]: 20: Hoare triple {9764#(< 10 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {9760#(< 8 main_~y~0)} is VALID [2022-04-28 03:51:48,685 INFO L290 TraceCheckUtils]: 19: Hoare triple {9768#(< 12 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {9764#(< 10 main_~y~0)} is VALID [2022-04-28 03:51:48,685 INFO L290 TraceCheckUtils]: 18: Hoare triple {9772#(< 14 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {9768#(< 12 main_~y~0)} is VALID [2022-04-28 03:51:48,686 INFO L290 TraceCheckUtils]: 17: Hoare triple {9776#(< 16 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {9772#(< 14 main_~y~0)} is VALID [2022-04-28 03:51:48,686 INFO L290 TraceCheckUtils]: 16: Hoare triple {9780#(< 18 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {9776#(< 16 main_~y~0)} is VALID [2022-04-28 03:51:48,687 INFO L290 TraceCheckUtils]: 15: Hoare triple {9784#(< 20 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {9780#(< 18 main_~y~0)} is VALID [2022-04-28 03:51:48,687 INFO L290 TraceCheckUtils]: 14: Hoare triple {9788#(< 22 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {9784#(< 20 main_~y~0)} is VALID [2022-04-28 03:51:48,687 INFO L290 TraceCheckUtils]: 13: Hoare triple {9792#(< 24 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {9788#(< 22 main_~y~0)} is VALID [2022-04-28 03:51:48,688 INFO L290 TraceCheckUtils]: 12: Hoare triple {9796#(< 26 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {9792#(< 24 main_~y~0)} is VALID [2022-04-28 03:51:48,688 INFO L290 TraceCheckUtils]: 11: Hoare triple {9800#(< 28 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {9796#(< 26 main_~y~0)} is VALID [2022-04-28 03:51:48,689 INFO L290 TraceCheckUtils]: 10: Hoare triple {9804#(< 30 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {9800#(< 28 main_~y~0)} is VALID [2022-04-28 03:51:48,689 INFO L290 TraceCheckUtils]: 9: Hoare triple {9808#(or (< main_~x~0 1000000) (< 30 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[] {9804#(< 30 main_~y~0)} is VALID [2022-04-28 03:51:48,690 INFO L290 TraceCheckUtils]: 8: Hoare triple {9812#(and (or (< main_~x~0 (+ 999970 main_~y~0)) (not (<= 50000 main_~x~0)) (<= 30 main_~y~0)) (or (< main_~x~0 1000000) (< 30 main_~y~0)))} [118] L11-2-->L18-1_primed: Formula: (let ((.cse0 (<= 50000 v_main_~x~0_559)) (.cse1 (= v_main_~x~0_559 v_main_~x~0_558)) (.cse2 (= v_main_~y~0_534 v_main_~y~0_533)) (.cse3 (= |v_main_#t~post6_102| |v_main_#t~post6_101|)) (.cse4 (= |v_main_#t~post5_102| |v_main_#t~post5_101|))) (or (and .cse0 (< v_main_~x~0_558 1000001) (< v_main_~x~0_559 v_main_~x~0_558) (= (+ v_main_~x~0_559 v_main_~y~0_533) (+ v_main_~x~0_558 v_main_~y~0_534))) (and .cse1 .cse2 .cse3 .cse4) (and (or (not (< v_main_~x~0_559 1000000)) (not .cse0)) .cse1 .cse2 .cse3 .cse4))) InVars {main_~y~0=v_main_~y~0_534, main_#t~post5=|v_main_#t~post5_102|, main_~x~0=v_main_~x~0_559, main_#t~post6=|v_main_#t~post6_102|} OutVars{main_~y~0=v_main_~y~0_533, main_#t~post5=|v_main_#t~post5_101|, main_~x~0=v_main_~x~0_558, main_#t~post6=|v_main_#t~post6_101|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {9808#(or (< main_~x~0 1000000) (< 30 main_~y~0))} is VALID [2022-04-28 03:51:48,690 INFO L290 TraceCheckUtils]: 7: Hoare triple {9812#(and (or (< main_~x~0 (+ 999970 main_~y~0)) (not (<= 50000 main_~x~0)) (<= 30 main_~y~0)) (or (< main_~x~0 1000000) (< 30 main_~y~0)))} [117] L18-1_primed-->L11-2: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {9812#(and (or (< main_~x~0 (+ 999970 main_~y~0)) (not (<= 50000 main_~x~0)) (<= 30 main_~y~0)) (or (< main_~x~0 1000000) (< 30 main_~y~0)))} is VALID [2022-04-28 03:51:48,691 INFO L290 TraceCheckUtils]: 6: Hoare triple {9819#(and (or (and (< main_~x~0 (+ 999970 main_~y~0)) (<= 0 (+ 949969 main_~y~0))) (<= 30 main_~y~0)) (or (< main_~x~0 1000000) (< 30 main_~y~0)))} [116] L11-2-->L18-1_primed: Formula: (let ((.cse0 (= v_main_~x~0_557 v_main_~x~0_556)) (.cse1 (= |v_main_#t~post4_96| |v_main_#t~post4_95|))) (or (and .cse0 .cse1 (not (< v_main_~x~0_557 50000))) (and .cse0 .cse1) (and (< v_main_~x~0_556 50001) (< v_main_~x~0_557 v_main_~x~0_556)))) InVars {main_~x~0=v_main_~x~0_557, main_#t~post4=|v_main_#t~post4_96|} OutVars{main_~x~0=v_main_~x~0_556, main_#t~post4=|v_main_#t~post4_95|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {9812#(and (or (< main_~x~0 (+ 999970 main_~y~0)) (not (<= 50000 main_~x~0)) (<= 30 main_~y~0)) (or (< main_~x~0 1000000) (< 30 main_~y~0)))} is VALID [2022-04-28 03:51:48,691 INFO L290 TraceCheckUtils]: 5: Hoare triple {9601#true} ~x~0 := 0;~y~0 := 50000;~z~0 := 0;~x~0 := 0; {9819#(and (or (and (< main_~x~0 (+ 999970 main_~y~0)) (<= 0 (+ 949969 main_~y~0))) (<= 30 main_~y~0)) (or (< main_~x~0 1000000) (< 30 main_~y~0)))} is VALID [2022-04-28 03:51:48,692 INFO L272 TraceCheckUtils]: 4: Hoare triple {9601#true} call #t~ret7 := main(); {9601#true} is VALID [2022-04-28 03:51:48,692 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {9601#true} {9601#true} #52#return; {9601#true} is VALID [2022-04-28 03:51:48,692 INFO L290 TraceCheckUtils]: 2: Hoare triple {9601#true} assume true; {9601#true} is VALID [2022-04-28 03:51:48,692 INFO L290 TraceCheckUtils]: 1: Hoare triple {9601#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); {9601#true} is VALID [2022-04-28 03:51:48,692 INFO L272 TraceCheckUtils]: 0: Hoare triple {9601#true} call ULTIMATE.init(); {9601#true} is VALID [2022-04-28 03:51:48,692 INFO L134 CoverageAnalysis]: Checked inductivity of 122 backedges. 0 proven. 122 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 03:51:48,692 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [96029856] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 03:51:48,692 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 03:51:48,692 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 21, 21] total 57 [2022-04-28 03:51:49,757 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 03:51:49,758 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [2119943043] [2022-04-28 03:51:49,758 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [2119943043] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 03:51:49,758 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 03:51:49,758 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [49] imperfect sequences [] total 49 [2022-04-28 03:51:49,758 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1271605021] [2022-04-28 03:51:49,758 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 03:51:49,758 INFO L78 Accepts]: Start accepts. Automaton has has 49 states, 49 states have (on average 1.653061224489796) internal successors, (81), 48 states have internal predecessors, (81), 2 states have call successors, (3), 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 85 [2022-04-28 03:51:49,758 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 03:51:49,759 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 49 states, 49 states have (on average 1.653061224489796) internal successors, (81), 48 states have internal predecessors, (81), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:51:49,814 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 85 edges. 85 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 03:51:49,814 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 49 states [2022-04-28 03:51:49,814 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 03:51:49,814 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 49 interpolants. [2022-04-28 03:51:49,815 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=2580, Invalid=4730, Unknown=0, NotChecked=0, Total=7310 [2022-04-28 03:51:49,815 INFO L87 Difference]: Start difference. First operand 86 states and 89 transitions. Second operand has 49 states, 49 states have (on average 1.653061224489796) internal successors, (81), 48 states have internal predecessors, (81), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:51:53,620 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:51:53,621 INFO L93 Difference]: Finished difference Result 169 states and 180 transitions. [2022-04-28 03:51:53,621 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 49 states. [2022-04-28 03:51:53,621 INFO L78 Accepts]: Start accepts. Automaton has has 49 states, 49 states have (on average 1.653061224489796) internal successors, (81), 48 states have internal predecessors, (81), 2 states have call successors, (3), 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 85 [2022-04-28 03:51:53,621 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 03:51:53,621 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 49 states, 49 states have (on average 1.653061224489796) internal successors, (81), 48 states have internal predecessors, (81), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:51:53,622 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 107 transitions. [2022-04-28 03:51:53,622 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 49 states, 49 states have (on average 1.653061224489796) internal successors, (81), 48 states have internal predecessors, (81), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:51:53,623 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 107 transitions. [2022-04-28 03:51:53,624 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 49 states and 107 transitions. [2022-04-28 03:51:53,724 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 107 edges. 107 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 03:51:53,725 INFO L225 Difference]: With dead ends: 169 [2022-04-28 03:51:53,725 INFO L226 Difference]: Without dead ends: 91 [2022-04-28 03:51:53,727 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 189 GetRequests, 58 SyntacticMatches, 1 SemanticMatches, 130 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5772 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=4925, Invalid=12367, Unknown=0, NotChecked=0, Total=17292 [2022-04-28 03:51:53,728 INFO L413 NwaCegarLoop]: 12 mSDtfsCounter, 229 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 1781 mSolverCounterSat, 125 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 229 SdHoareTripleChecker+Valid, 34 SdHoareTripleChecker+Invalid, 1906 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 125 IncrementalHoareTripleChecker+Valid, 1781 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2022-04-28 03:51:53,728 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [229 Valid, 34 Invalid, 1906 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [125 Valid, 1781 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2022-04-28 03:51:53,728 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2022-04-28 03:51:53,866 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 91. [2022-04-28 03:51:53,866 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 03:51:53,866 INFO L82 GeneralOperation]: Start isEquivalent. First operand 91 states. Second operand has 91 states, 86 states have (on average 1.0465116279069768) internal successors, (90), 86 states have internal predecessors, (90), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:51:53,866 INFO L74 IsIncluded]: Start isIncluded. First operand 91 states. Second operand has 91 states, 86 states have (on average 1.0465116279069768) internal successors, (90), 86 states have internal predecessors, (90), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:51:53,866 INFO L87 Difference]: Start difference. First operand 91 states. Second operand has 91 states, 86 states have (on average 1.0465116279069768) internal successors, (90), 86 states have internal predecessors, (90), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:51:53,867 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:51:53,867 INFO L93 Difference]: Finished difference Result 91 states and 94 transitions. [2022-04-28 03:51:53,867 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 94 transitions. [2022-04-28 03:51:53,868 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:51:53,868 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:51:53,868 INFO L74 IsIncluded]: Start isIncluded. First operand has 91 states, 86 states have (on average 1.0465116279069768) internal successors, (90), 86 states have internal predecessors, (90), 3 states have call successors, (3), 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 91 states. [2022-04-28 03:51:53,868 INFO L87 Difference]: Start difference. First operand has 91 states, 86 states have (on average 1.0465116279069768) internal successors, (90), 86 states have internal predecessors, (90), 3 states have call successors, (3), 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 91 states. [2022-04-28 03:51:53,869 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:51:53,869 INFO L93 Difference]: Finished difference Result 91 states and 94 transitions. [2022-04-28 03:51:53,869 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 94 transitions. [2022-04-28 03:51:53,869 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:51:53,870 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:51:53,870 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 03:51:53,870 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 03:51:53,870 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 91 states, 86 states have (on average 1.0465116279069768) internal successors, (90), 86 states have internal predecessors, (90), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:51:53,871 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 94 transitions. [2022-04-28 03:51:53,871 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 94 transitions. Word has length 85 [2022-04-28 03:51:53,871 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 03:51:53,871 INFO L495 AbstractCegarLoop]: Abstraction has 91 states and 94 transitions. [2022-04-28 03:51:53,871 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 49 states, 49 states have (on average 1.653061224489796) internal successors, (81), 48 states have internal predecessors, (81), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:51:53,871 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 91 states and 94 transitions. [2022-04-28 03:51:53,959 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 94 edges. 94 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 03:51:53,960 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 94 transitions. [2022-04-28 03:51:53,960 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2022-04-28 03:51:53,960 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 03:51:53,960 INFO L195 NwaCegarLoop]: trace histogram [31, 30, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 03:51:53,989 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Forceful destruction successful, exit code 0 [2022-04-28 03:51:54,161 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2022-04-28 03:51:54,161 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 03:51:54,161 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 03:51:54,161 INFO L85 PathProgramCache]: Analyzing trace with hash -1318005488, now seen corresponding path program 16 times [2022-04-28 03:51:54,161 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 03:51:54,161 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [252493412] [2022-04-28 03:51:54,272 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 1 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 03:51:54,486 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={1=1, 2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 03:51:54,487 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-28 03:51:54,489 INFO L85 PathProgramCache]: Analyzing trace with hash 1988338433, now seen corresponding path program 1 times [2022-04-28 03:51:54,489 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 03:51:54,489 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1734474188] [2022-04-28 03:51:54,489 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:51:54,489 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 03:51:54,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:51:54,691 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 03:51:54,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:51:54,695 INFO L290 TraceCheckUtils]: 0: Hoare triple {10685#(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); {10663#true} is VALID [2022-04-28 03:51:54,695 INFO L290 TraceCheckUtils]: 1: Hoare triple {10663#true} assume true; {10663#true} is VALID [2022-04-28 03:51:54,695 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {10663#true} {10663#true} #52#return; {10663#true} is VALID [2022-04-28 03:51:54,695 INFO L272 TraceCheckUtils]: 0: Hoare triple {10663#true} call ULTIMATE.init(); {10685#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 03:51:54,695 INFO L290 TraceCheckUtils]: 1: Hoare triple {10685#(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); {10663#true} is VALID [2022-04-28 03:51:54,695 INFO L290 TraceCheckUtils]: 2: Hoare triple {10663#true} assume true; {10663#true} is VALID [2022-04-28 03:51:54,696 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {10663#true} {10663#true} #52#return; {10663#true} is VALID [2022-04-28 03:51:54,696 INFO L272 TraceCheckUtils]: 4: Hoare triple {10663#true} call #t~ret7 := main(); {10663#true} is VALID [2022-04-28 03:51:54,696 INFO L290 TraceCheckUtils]: 5: Hoare triple {10663#true} ~x~0 := 0;~y~0 := 50000;~z~0 := 0;~x~0 := 0; {10668#(<= 50000 main_~y~0)} is VALID [2022-04-28 03:51:54,696 INFO L290 TraceCheckUtils]: 6: Hoare triple {10668#(<= 50000 main_~y~0)} [120] L11-2-->L18-1_primed: Formula: (let ((.cse0 (= |v_main_#t~post4_103| |v_main_#t~post4_102|)) (.cse1 (= v_main_~x~0_618 v_main_~x~0_617))) (or (and .cse0 .cse1) (and (< v_main_~x~0_617 50001) (< v_main_~x~0_618 v_main_~x~0_617)) (and .cse0 .cse1 (not (< v_main_~x~0_618 50000))))) InVars {main_~x~0=v_main_~x~0_618, main_#t~post4=|v_main_#t~post4_103|} OutVars{main_~x~0=v_main_~x~0_617, main_#t~post4=|v_main_#t~post4_102|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {10668#(<= 50000 main_~y~0)} is VALID [2022-04-28 03:51:54,697 INFO L290 TraceCheckUtils]: 7: Hoare triple {10668#(<= 50000 main_~y~0)} [121] L18-1_primed-->L11-2: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {10668#(<= 50000 main_~y~0)} is VALID [2022-04-28 03:51:54,697 INFO L290 TraceCheckUtils]: 8: Hoare triple {10668#(<= 50000 main_~y~0)} [122] L11-2-->L18-1_primed: Formula: (let ((.cse1 (= v_main_~y~0_601 v_main_~y~0_600)) (.cse0 (<= 50000 v_main_~x~0_620)) (.cse2 (= |v_main_#t~post6_109| |v_main_#t~post6_108|)) (.cse3 (= |v_main_#t~post5_109| |v_main_#t~post5_108|))) (or (and .cse0 (< v_main_~x~0_619 1000001) (< v_main_~x~0_620 v_main_~x~0_619) (= (+ v_main_~x~0_619 v_main_~y~0_601) (+ v_main_~x~0_620 v_main_~y~0_600))) (and .cse1 (= v_main_~x~0_620 v_main_~x~0_619) .cse2 .cse3) (and .cse1 (= v_main_~x~0_619 v_main_~x~0_620) (or (not .cse0) (not (< v_main_~x~0_620 1000000))) .cse2 .cse3))) InVars {main_~y~0=v_main_~y~0_601, main_#t~post5=|v_main_#t~post5_109|, main_~x~0=v_main_~x~0_620, main_#t~post6=|v_main_#t~post6_109|} OutVars{main_~y~0=v_main_~y~0_600, main_#t~post5=|v_main_#t~post5_108|, main_~x~0=v_main_~x~0_619, main_#t~post6=|v_main_#t~post6_108|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {10668#(<= 50000 main_~y~0)} is VALID [2022-04-28 03:51:54,698 INFO L290 TraceCheckUtils]: 9: Hoare triple {10668#(<= 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[] {10668#(<= 50000 main_~y~0)} is VALID [2022-04-28 03:51:54,698 INFO L290 TraceCheckUtils]: 10: Hoare triple {10668#(<= 50000 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {10669#(<= 49998 main_~y~0)} is VALID [2022-04-28 03:51:54,699 INFO L290 TraceCheckUtils]: 11: Hoare triple {10669#(<= 49998 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {10670#(<= 49996 main_~y~0)} is VALID [2022-04-28 03:51:54,699 INFO L290 TraceCheckUtils]: 12: Hoare triple {10670#(<= 49996 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {10671#(<= 49994 main_~y~0)} is VALID [2022-04-28 03:51:54,700 INFO L290 TraceCheckUtils]: 13: Hoare triple {10671#(<= 49994 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {10672#(<= 49992 main_~y~0)} is VALID [2022-04-28 03:51:54,700 INFO L290 TraceCheckUtils]: 14: Hoare triple {10672#(<= 49992 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {10673#(<= 49990 main_~y~0)} is VALID [2022-04-28 03:51:54,701 INFO L290 TraceCheckUtils]: 15: Hoare triple {10673#(<= 49990 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {10674#(<= 49988 main_~y~0)} is VALID [2022-04-28 03:51:54,701 INFO L290 TraceCheckUtils]: 16: Hoare triple {10674#(<= 49988 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {10675#(<= 49986 main_~y~0)} is VALID [2022-04-28 03:51:54,702 INFO L290 TraceCheckUtils]: 17: Hoare triple {10675#(<= 49986 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {10676#(<= 49984 main_~y~0)} is VALID [2022-04-28 03:51:54,702 INFO L290 TraceCheckUtils]: 18: Hoare triple {10676#(<= 49984 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {10677#(<= 49982 main_~y~0)} is VALID [2022-04-28 03:51:54,703 INFO L290 TraceCheckUtils]: 19: Hoare triple {10677#(<= 49982 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {10678#(<= 49980 main_~y~0)} is VALID [2022-04-28 03:51:54,703 INFO L290 TraceCheckUtils]: 20: Hoare triple {10678#(<= 49980 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {10679#(<= 49978 main_~y~0)} is VALID [2022-04-28 03:51:54,704 INFO L290 TraceCheckUtils]: 21: Hoare triple {10679#(<= 49978 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {10680#(<= 49976 main_~y~0)} is VALID [2022-04-28 03:51:54,704 INFO L290 TraceCheckUtils]: 22: Hoare triple {10680#(<= 49976 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {10681#(<= 49974 main_~y~0)} is VALID [2022-04-28 03:51:54,705 INFO L290 TraceCheckUtils]: 23: Hoare triple {10681#(<= 49974 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {10682#(<= 49972 main_~y~0)} is VALID [2022-04-28 03:51:54,705 INFO L290 TraceCheckUtils]: 24: Hoare triple {10682#(<= 49972 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {10683#(<= 49970 main_~y~0)} is VALID [2022-04-28 03:51:54,705 INFO L290 TraceCheckUtils]: 25: Hoare triple {10683#(<= 49970 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {10684#(<= 49968 main_~y~0)} is VALID [2022-04-28 03:51:54,706 INFO L290 TraceCheckUtils]: 26: Hoare triple {10684#(<= 49968 main_~y~0)} assume !(~y~0 > 0); {10664#false} is VALID [2022-04-28 03:51:54,706 INFO L272 TraceCheckUtils]: 27: Hoare triple {10664#false} call __VERIFIER_assert((if ~z~0 == ~x~0 then 1 else 0)); {10664#false} is VALID [2022-04-28 03:51:54,706 INFO L290 TraceCheckUtils]: 28: Hoare triple {10664#false} ~cond := #in~cond; {10664#false} is VALID [2022-04-28 03:51:54,706 INFO L290 TraceCheckUtils]: 29: Hoare triple {10664#false} assume 0 == ~cond; {10664#false} is VALID [2022-04-28 03:51:54,706 INFO L290 TraceCheckUtils]: 30: Hoare triple {10664#false} assume !false; {10664#false} is VALID [2022-04-28 03:51:54,706 INFO L134 CoverageAnalysis]: Checked inductivity of 138 backedges. 0 proven. 136 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-04-28 03:51:54,706 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 03:51:54,706 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1734474188] [2022-04-28 03:51:54,706 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1734474188] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 03:51:54,707 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1784736217] [2022-04-28 03:51:54,707 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:51:54,707 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 03:51:54,707 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 03:51:54,708 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 03:51:54,708 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Waiting until timeout for monitored process [2022-04-28 03:51:54,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:51:54,747 INFO L263 TraceCheckSpWp]: Trace formula consists of 139 conjuncts, 22 conjunts are in the unsatisfiable core [2022-04-28 03:51:54,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:51:54,768 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 03:51:55,339 INFO L272 TraceCheckUtils]: 0: Hoare triple {10663#true} call ULTIMATE.init(); {10663#true} is VALID [2022-04-28 03:51:55,339 INFO L290 TraceCheckUtils]: 1: Hoare triple {10663#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); {10663#true} is VALID [2022-04-28 03:51:55,339 INFO L290 TraceCheckUtils]: 2: Hoare triple {10663#true} assume true; {10663#true} is VALID [2022-04-28 03:51:55,340 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {10663#true} {10663#true} #52#return; {10663#true} is VALID [2022-04-28 03:51:55,340 INFO L272 TraceCheckUtils]: 4: Hoare triple {10663#true} call #t~ret7 := main(); {10663#true} is VALID [2022-04-28 03:51:55,340 INFO L290 TraceCheckUtils]: 5: Hoare triple {10663#true} ~x~0 := 0;~y~0 := 50000;~z~0 := 0;~x~0 := 0; {10704#(and (<= main_~x~0 0) (<= 50000 main_~y~0))} is VALID [2022-04-28 03:51:55,341 INFO L290 TraceCheckUtils]: 6: Hoare triple {10704#(and (<= main_~x~0 0) (<= 50000 main_~y~0))} [120] L11-2-->L18-1_primed: Formula: (let ((.cse0 (= |v_main_#t~post4_103| |v_main_#t~post4_102|)) (.cse1 (= v_main_~x~0_618 v_main_~x~0_617))) (or (and .cse0 .cse1) (and (< v_main_~x~0_617 50001) (< v_main_~x~0_618 v_main_~x~0_617)) (and .cse0 .cse1 (not (< v_main_~x~0_618 50000))))) InVars {main_~x~0=v_main_~x~0_618, main_#t~post4=|v_main_#t~post4_103|} OutVars{main_~x~0=v_main_~x~0_617, main_#t~post4=|v_main_#t~post4_102|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {10708#(and (< main_~x~0 50001) (<= 50000 main_~y~0))} is VALID [2022-04-28 03:51:55,341 INFO L290 TraceCheckUtils]: 7: Hoare triple {10708#(and (< main_~x~0 50001) (<= 50000 main_~y~0))} [121] L18-1_primed-->L11-2: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {10708#(and (< main_~x~0 50001) (<= 50000 main_~y~0))} is VALID [2022-04-28 03:51:55,342 INFO L290 TraceCheckUtils]: 8: Hoare triple {10708#(and (< main_~x~0 50001) (<= 50000 main_~y~0))} [122] L11-2-->L18-1_primed: Formula: (let ((.cse1 (= v_main_~y~0_601 v_main_~y~0_600)) (.cse0 (<= 50000 v_main_~x~0_620)) (.cse2 (= |v_main_#t~post6_109| |v_main_#t~post6_108|)) (.cse3 (= |v_main_#t~post5_109| |v_main_#t~post5_108|))) (or (and .cse0 (< v_main_~x~0_619 1000001) (< v_main_~x~0_620 v_main_~x~0_619) (= (+ v_main_~x~0_619 v_main_~y~0_601) (+ v_main_~x~0_620 v_main_~y~0_600))) (and .cse1 (= v_main_~x~0_620 v_main_~x~0_619) .cse2 .cse3) (and .cse1 (= v_main_~x~0_619 v_main_~x~0_620) (or (not .cse0) (not (< v_main_~x~0_620 1000000))) .cse2 .cse3))) InVars {main_~y~0=v_main_~y~0_601, main_#t~post5=|v_main_#t~post5_109|, main_~x~0=v_main_~x~0_620, main_#t~post6=|v_main_#t~post6_109|} OutVars{main_~y~0=v_main_~y~0_600, main_#t~post5=|v_main_#t~post5_108|, main_~x~0=v_main_~x~0_619, main_#t~post6=|v_main_#t~post6_108|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {10715#(or (and (< main_~x~0 50001) (<= 50000 main_~y~0)) (and (< main_~x~0 (+ main_~y~0 1)) (< main_~x~0 1000001) (< 50000 main_~x~0)))} is VALID [2022-04-28 03:51:55,342 INFO L290 TraceCheckUtils]: 9: Hoare triple {10715#(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)))} [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[] {10719#(< 999999 main_~y~0)} is VALID [2022-04-28 03:51:55,343 INFO L290 TraceCheckUtils]: 10: Hoare triple {10719#(< 999999 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {10723#(< 999997 main_~y~0)} is VALID [2022-04-28 03:51:55,343 INFO L290 TraceCheckUtils]: 11: Hoare triple {10723#(< 999997 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {10727#(< 999995 main_~y~0)} is VALID [2022-04-28 03:51:55,344 INFO L290 TraceCheckUtils]: 12: Hoare triple {10727#(< 999995 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {10731#(< 999993 main_~y~0)} is VALID [2022-04-28 03:51:55,344 INFO L290 TraceCheckUtils]: 13: Hoare triple {10731#(< 999993 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {10735#(< 999991 main_~y~0)} is VALID [2022-04-28 03:51:55,344 INFO L290 TraceCheckUtils]: 14: Hoare triple {10735#(< 999991 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {10739#(< 999989 main_~y~0)} is VALID [2022-04-28 03:51:55,345 INFO L290 TraceCheckUtils]: 15: Hoare triple {10739#(< 999989 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {10743#(< 999987 main_~y~0)} is VALID [2022-04-28 03:51:55,345 INFO L290 TraceCheckUtils]: 16: Hoare triple {10743#(< 999987 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {10747#(< 999985 main_~y~0)} is VALID [2022-04-28 03:51:55,346 INFO L290 TraceCheckUtils]: 17: Hoare triple {10747#(< 999985 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {10751#(< 999983 main_~y~0)} is VALID [2022-04-28 03:51:55,346 INFO L290 TraceCheckUtils]: 18: Hoare triple {10751#(< 999983 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {10755#(< 999981 main_~y~0)} is VALID [2022-04-28 03:51:55,346 INFO L290 TraceCheckUtils]: 19: Hoare triple {10755#(< 999981 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {10759#(< 999979 main_~y~0)} is VALID [2022-04-28 03:51:55,347 INFO L290 TraceCheckUtils]: 20: Hoare triple {10759#(< 999979 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {10763#(< 999977 main_~y~0)} is VALID [2022-04-28 03:51:55,347 INFO L290 TraceCheckUtils]: 21: Hoare triple {10763#(< 999977 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {10767#(< 999975 main_~y~0)} is VALID [2022-04-28 03:51:55,348 INFO L290 TraceCheckUtils]: 22: Hoare triple {10767#(< 999975 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {10771#(< 999973 main_~y~0)} is VALID [2022-04-28 03:51:55,348 INFO L290 TraceCheckUtils]: 23: Hoare triple {10771#(< 999973 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {10775#(< 999971 main_~y~0)} is VALID [2022-04-28 03:51:55,348 INFO L290 TraceCheckUtils]: 24: Hoare triple {10775#(< 999971 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {10779#(< 999969 main_~y~0)} is VALID [2022-04-28 03:51:55,349 INFO L290 TraceCheckUtils]: 25: Hoare triple {10779#(< 999969 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {10783#(< 999967 main_~y~0)} is VALID [2022-04-28 03:51:55,349 INFO L290 TraceCheckUtils]: 26: Hoare triple {10783#(< 999967 main_~y~0)} assume !(~y~0 > 0); {10664#false} is VALID [2022-04-28 03:51:55,349 INFO L272 TraceCheckUtils]: 27: Hoare triple {10664#false} call __VERIFIER_assert((if ~z~0 == ~x~0 then 1 else 0)); {10664#false} is VALID [2022-04-28 03:51:55,349 INFO L290 TraceCheckUtils]: 28: Hoare triple {10664#false} ~cond := #in~cond; {10664#false} is VALID [2022-04-28 03:51:55,349 INFO L290 TraceCheckUtils]: 29: Hoare triple {10664#false} assume 0 == ~cond; {10664#false} is VALID [2022-04-28 03:51:55,349 INFO L290 TraceCheckUtils]: 30: Hoare triple {10664#false} assume !false; {10664#false} is VALID [2022-04-28 03:51:55,350 INFO L134 CoverageAnalysis]: Checked inductivity of 138 backedges. 0 proven. 138 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 03:51:55,350 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 03:51:56,199 INFO L290 TraceCheckUtils]: 30: Hoare triple {10664#false} assume !false; {10664#false} is VALID [2022-04-28 03:51:56,199 INFO L290 TraceCheckUtils]: 29: Hoare triple {10664#false} assume 0 == ~cond; {10664#false} is VALID [2022-04-28 03:51:56,199 INFO L290 TraceCheckUtils]: 28: Hoare triple {10664#false} ~cond := #in~cond; {10664#false} is VALID [2022-04-28 03:51:56,199 INFO L272 TraceCheckUtils]: 27: Hoare triple {10664#false} call __VERIFIER_assert((if ~z~0 == ~x~0 then 1 else 0)); {10664#false} is VALID [2022-04-28 03:51:56,200 INFO L290 TraceCheckUtils]: 26: Hoare triple {10811#(< 0 main_~y~0)} assume !(~y~0 > 0); {10664#false} is VALID [2022-04-28 03:51:56,200 INFO L290 TraceCheckUtils]: 25: Hoare triple {10815#(< 2 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {10811#(< 0 main_~y~0)} is VALID [2022-04-28 03:51:56,201 INFO L290 TraceCheckUtils]: 24: Hoare triple {10819#(< 4 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {10815#(< 2 main_~y~0)} is VALID [2022-04-28 03:51:56,201 INFO L290 TraceCheckUtils]: 23: Hoare triple {10823#(< 6 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {10819#(< 4 main_~y~0)} is VALID [2022-04-28 03:51:56,201 INFO L290 TraceCheckUtils]: 22: Hoare triple {10827#(< 8 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {10823#(< 6 main_~y~0)} is VALID [2022-04-28 03:51:56,202 INFO L290 TraceCheckUtils]: 21: Hoare triple {10831#(< 10 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {10827#(< 8 main_~y~0)} is VALID [2022-04-28 03:51:56,202 INFO L290 TraceCheckUtils]: 20: Hoare triple {10835#(< 12 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {10831#(< 10 main_~y~0)} is VALID [2022-04-28 03:51:56,203 INFO L290 TraceCheckUtils]: 19: Hoare triple {10839#(< 14 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {10835#(< 12 main_~y~0)} is VALID [2022-04-28 03:51:56,203 INFO L290 TraceCheckUtils]: 18: Hoare triple {10843#(< 16 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {10839#(< 14 main_~y~0)} is VALID [2022-04-28 03:51:56,204 INFO L290 TraceCheckUtils]: 17: Hoare triple {10847#(< 18 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {10843#(< 16 main_~y~0)} is VALID [2022-04-28 03:51:56,204 INFO L290 TraceCheckUtils]: 16: Hoare triple {10851#(< 20 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {10847#(< 18 main_~y~0)} is VALID [2022-04-28 03:51:56,204 INFO L290 TraceCheckUtils]: 15: Hoare triple {10855#(< 22 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {10851#(< 20 main_~y~0)} is VALID [2022-04-28 03:51:56,205 INFO L290 TraceCheckUtils]: 14: Hoare triple {10859#(< 24 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {10855#(< 22 main_~y~0)} is VALID [2022-04-28 03:51:56,205 INFO L290 TraceCheckUtils]: 13: Hoare triple {10863#(< 26 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {10859#(< 24 main_~y~0)} is VALID [2022-04-28 03:51:56,206 INFO L290 TraceCheckUtils]: 12: Hoare triple {10867#(< 28 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {10863#(< 26 main_~y~0)} is VALID [2022-04-28 03:51:56,206 INFO L290 TraceCheckUtils]: 11: Hoare triple {10871#(< 30 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {10867#(< 28 main_~y~0)} is VALID [2022-04-28 03:51:56,206 INFO L290 TraceCheckUtils]: 10: Hoare triple {10875#(< 32 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {10871#(< 30 main_~y~0)} is VALID [2022-04-28 03:51:56,207 INFO L290 TraceCheckUtils]: 9: Hoare triple {10879#(or (< main_~x~0 1000000) (< 32 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[] {10875#(< 32 main_~y~0)} is VALID [2022-04-28 03:51:56,208 INFO L290 TraceCheckUtils]: 8: Hoare triple {10883#(and (or (<= 1000000 main_~x~0) (< main_~x~0 (+ 999968 main_~y~0)) (not (<= 50000 main_~x~0))) (or (< main_~x~0 1000000) (< 32 main_~y~0)))} [122] L11-2-->L18-1_primed: Formula: (let ((.cse1 (= v_main_~y~0_601 v_main_~y~0_600)) (.cse0 (<= 50000 v_main_~x~0_620)) (.cse2 (= |v_main_#t~post6_109| |v_main_#t~post6_108|)) (.cse3 (= |v_main_#t~post5_109| |v_main_#t~post5_108|))) (or (and .cse0 (< v_main_~x~0_619 1000001) (< v_main_~x~0_620 v_main_~x~0_619) (= (+ v_main_~x~0_619 v_main_~y~0_601) (+ v_main_~x~0_620 v_main_~y~0_600))) (and .cse1 (= v_main_~x~0_620 v_main_~x~0_619) .cse2 .cse3) (and .cse1 (= v_main_~x~0_619 v_main_~x~0_620) (or (not .cse0) (not (< v_main_~x~0_620 1000000))) .cse2 .cse3))) InVars {main_~y~0=v_main_~y~0_601, main_#t~post5=|v_main_#t~post5_109|, main_~x~0=v_main_~x~0_620, main_#t~post6=|v_main_#t~post6_109|} OutVars{main_~y~0=v_main_~y~0_600, main_#t~post5=|v_main_#t~post5_108|, main_~x~0=v_main_~x~0_619, main_#t~post6=|v_main_#t~post6_108|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {10879#(or (< main_~x~0 1000000) (< 32 main_~y~0))} is VALID [2022-04-28 03:51:56,208 INFO L290 TraceCheckUtils]: 7: Hoare triple {10883#(and (or (<= 1000000 main_~x~0) (< main_~x~0 (+ 999968 main_~y~0)) (not (<= 50000 main_~x~0))) (or (< main_~x~0 1000000) (< 32 main_~y~0)))} [121] L18-1_primed-->L11-2: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {10883#(and (or (<= 1000000 main_~x~0) (< main_~x~0 (+ 999968 main_~y~0)) (not (<= 50000 main_~x~0))) (or (< main_~x~0 1000000) (< 32 main_~y~0)))} is VALID [2022-04-28 03:51:56,209 INFO L290 TraceCheckUtils]: 6: Hoare triple {10890#(and (or (< main_~x~0 1000000) (< 32 main_~y~0)) (or (<= 1000000 main_~x~0) (< main_~x~0 (+ 999968 main_~y~0))) (<= 0 (+ 949967 main_~y~0)))} [120] L11-2-->L18-1_primed: Formula: (let ((.cse0 (= |v_main_#t~post4_103| |v_main_#t~post4_102|)) (.cse1 (= v_main_~x~0_618 v_main_~x~0_617))) (or (and .cse0 .cse1) (and (< v_main_~x~0_617 50001) (< v_main_~x~0_618 v_main_~x~0_617)) (and .cse0 .cse1 (not (< v_main_~x~0_618 50000))))) InVars {main_~x~0=v_main_~x~0_618, main_#t~post4=|v_main_#t~post4_103|} OutVars{main_~x~0=v_main_~x~0_617, main_#t~post4=|v_main_#t~post4_102|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {10883#(and (or (<= 1000000 main_~x~0) (< main_~x~0 (+ 999968 main_~y~0)) (not (<= 50000 main_~x~0))) (or (< main_~x~0 1000000) (< 32 main_~y~0)))} is VALID [2022-04-28 03:51:56,209 INFO L290 TraceCheckUtils]: 5: Hoare triple {10663#true} ~x~0 := 0;~y~0 := 50000;~z~0 := 0;~x~0 := 0; {10890#(and (or (< main_~x~0 1000000) (< 32 main_~y~0)) (or (<= 1000000 main_~x~0) (< main_~x~0 (+ 999968 main_~y~0))) (<= 0 (+ 949967 main_~y~0)))} is VALID [2022-04-28 03:51:56,209 INFO L272 TraceCheckUtils]: 4: Hoare triple {10663#true} call #t~ret7 := main(); {10663#true} is VALID [2022-04-28 03:51:56,209 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {10663#true} {10663#true} #52#return; {10663#true} is VALID [2022-04-28 03:51:56,209 INFO L290 TraceCheckUtils]: 2: Hoare triple {10663#true} assume true; {10663#true} is VALID [2022-04-28 03:51:56,209 INFO L290 TraceCheckUtils]: 1: Hoare triple {10663#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); {10663#true} is VALID [2022-04-28 03:51:56,209 INFO L272 TraceCheckUtils]: 0: Hoare triple {10663#true} call ULTIMATE.init(); {10663#true} is VALID [2022-04-28 03:51:56,210 INFO L134 CoverageAnalysis]: Checked inductivity of 138 backedges. 0 proven. 138 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 03:51:56,210 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1784736217] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 03:51:56,210 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 03:51:56,210 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 22, 22] total 60 [2022-04-28 03:51:57,366 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 03:51:57,367 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [252493412] [2022-04-28 03:51:57,367 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [252493412] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 03:51:57,367 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 03:51:57,367 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [52] imperfect sequences [] total 52 [2022-04-28 03:51:57,367 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1351571864] [2022-04-28 03:51:57,367 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 03:51:57,367 INFO L78 Accepts]: Start accepts. Automaton has has 52 states, 52 states have (on average 1.6538461538461537) internal successors, (86), 51 states have internal predecessors, (86), 2 states have call successors, (3), 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 90 [2022-04-28 03:51:57,367 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 03:51:57,368 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 52 states, 52 states have (on average 1.6538461538461537) internal successors, (86), 51 states have internal predecessors, (86), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:51:57,426 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 90 edges. 90 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 03:51:57,426 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 52 states [2022-04-28 03:51:57,426 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 03:51:57,427 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 52 interpolants. [2022-04-28 03:51:57,430 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=2885, Invalid=5305, Unknown=0, NotChecked=0, Total=8190 [2022-04-28 03:51:57,430 INFO L87 Difference]: Start difference. First operand 91 states and 94 transitions. Second operand has 52 states, 52 states have (on average 1.6538461538461537) internal successors, (86), 51 states have internal predecessors, (86), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:52:01,882 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:52:01,882 INFO L93 Difference]: Finished difference Result 179 states and 190 transitions. [2022-04-28 03:52:01,882 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 52 states. [2022-04-28 03:52:01,882 INFO L78 Accepts]: Start accepts. Automaton has has 52 states, 52 states have (on average 1.6538461538461537) internal successors, (86), 51 states have internal predecessors, (86), 2 states have call successors, (3), 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 90 [2022-04-28 03:52:01,882 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 03:52:01,882 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 52 states, 52 states have (on average 1.6538461538461537) internal successors, (86), 51 states have internal predecessors, (86), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:52:01,884 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 112 transitions. [2022-04-28 03:52:01,885 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 52 states, 52 states have (on average 1.6538461538461537) internal successors, (86), 51 states have internal predecessors, (86), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:52:01,885 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 112 transitions. [2022-04-28 03:52:01,887 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 52 states and 112 transitions. [2022-04-28 03:52:01,986 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 112 edges. 112 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 03:52:01,987 INFO L225 Difference]: With dead ends: 179 [2022-04-28 03:52:01,987 INFO L226 Difference]: Without dead ends: 96 [2022-04-28 03:52:01,989 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 199 GetRequests, 60 SyntacticMatches, 1 SemanticMatches, 138 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6499 ImplicationChecksByTransitivity, 2.7s TimeCoverageRelationStatistics Valid=5514, Invalid=13946, Unknown=0, NotChecked=0, Total=19460 [2022-04-28 03:52:01,989 INFO L413 NwaCegarLoop]: 12 mSDtfsCounter, 174 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 2056 mSolverCounterSat, 162 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 174 SdHoareTripleChecker+Valid, 34 SdHoareTripleChecker+Invalid, 2218 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 162 IncrementalHoareTripleChecker+Valid, 2056 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2022-04-28 03:52:01,989 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [174 Valid, 34 Invalid, 2218 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [162 Valid, 2056 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2022-04-28 03:52:01,990 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2022-04-28 03:52:02,120 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 96. [2022-04-28 03:52:02,121 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 03:52:02,121 INFO L82 GeneralOperation]: Start isEquivalent. First operand 96 states. Second operand has 96 states, 91 states have (on average 1.043956043956044) internal successors, (95), 91 states have internal predecessors, (95), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:52:02,121 INFO L74 IsIncluded]: Start isIncluded. First operand 96 states. Second operand has 96 states, 91 states have (on average 1.043956043956044) internal successors, (95), 91 states have internal predecessors, (95), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:52:02,121 INFO L87 Difference]: Start difference. First operand 96 states. Second operand has 96 states, 91 states have (on average 1.043956043956044) internal successors, (95), 91 states have internal predecessors, (95), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:52:02,122 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:52:02,122 INFO L93 Difference]: Finished difference Result 96 states and 99 transitions. [2022-04-28 03:52:02,122 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 99 transitions. [2022-04-28 03:52:02,122 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:52:02,122 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:52:02,122 INFO L74 IsIncluded]: Start isIncluded. First operand has 96 states, 91 states have (on average 1.043956043956044) internal successors, (95), 91 states have internal predecessors, (95), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 96 states. [2022-04-28 03:52:02,122 INFO L87 Difference]: Start difference. First operand has 96 states, 91 states have (on average 1.043956043956044) internal successors, (95), 91 states have internal predecessors, (95), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 96 states. [2022-04-28 03:52:02,123 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:52:02,123 INFO L93 Difference]: Finished difference Result 96 states and 99 transitions. [2022-04-28 03:52:02,123 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 99 transitions. [2022-04-28 03:52:02,124 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:52:02,124 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:52:02,124 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 03:52:02,124 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 03:52:02,124 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 96 states, 91 states have (on average 1.043956043956044) internal successors, (95), 91 states have internal predecessors, (95), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:52:02,125 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 99 transitions. [2022-04-28 03:52:02,125 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 99 transitions. Word has length 90 [2022-04-28 03:52:02,125 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 03:52:02,125 INFO L495 AbstractCegarLoop]: Abstraction has 96 states and 99 transitions. [2022-04-28 03:52:02,125 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 52 states, 52 states have (on average 1.6538461538461537) internal successors, (86), 51 states have internal predecessors, (86), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:52:02,125 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 96 states and 99 transitions. [2022-04-28 03:52:02,210 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 99 edges. 99 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 03:52:02,210 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 99 transitions. [2022-04-28 03:52:02,211 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2022-04-28 03:52:02,211 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 03:52:02,211 INFO L195 NwaCegarLoop]: trace histogram [33, 32, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 03:52:02,233 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Forceful destruction successful, exit code 0 [2022-04-28 03:52:02,411 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,17 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 03:52:02,411 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 03:52:02,412 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 03:52:02,412 INFO L85 PathProgramCache]: Analyzing trace with hash -1149961143, now seen corresponding path program 17 times [2022-04-28 03:52:02,412 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 03:52:02,412 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [433200960] [2022-04-28 03:52:02,504 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 1 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 03:52:02,687 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={1=1, 2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 03:52:02,688 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-28 03:52:02,691 INFO L85 PathProgramCache]: Analyzing trace with hash -1929240190, now seen corresponding path program 1 times [2022-04-28 03:52:02,691 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 03:52:02,691 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1636603441] [2022-04-28 03:52:02,691 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:52:02,691 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 03:52:02,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:52:02,894 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 03:52:02,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:52:02,899 INFO L290 TraceCheckUtils]: 0: Hoare triple {11805#(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); {11782#true} is VALID [2022-04-28 03:52:02,899 INFO L290 TraceCheckUtils]: 1: Hoare triple {11782#true} assume true; {11782#true} is VALID [2022-04-28 03:52:02,899 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {11782#true} {11782#true} #52#return; {11782#true} is VALID [2022-04-28 03:52:02,900 INFO L272 TraceCheckUtils]: 0: Hoare triple {11782#true} call ULTIMATE.init(); {11805#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 03:52:02,900 INFO L290 TraceCheckUtils]: 1: Hoare triple {11805#(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); {11782#true} is VALID [2022-04-28 03:52:02,900 INFO L290 TraceCheckUtils]: 2: Hoare triple {11782#true} assume true; {11782#true} is VALID [2022-04-28 03:52:02,900 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {11782#true} {11782#true} #52#return; {11782#true} is VALID [2022-04-28 03:52:02,900 INFO L272 TraceCheckUtils]: 4: Hoare triple {11782#true} call #t~ret7 := main(); {11782#true} is VALID [2022-04-28 03:52:02,900 INFO L290 TraceCheckUtils]: 5: Hoare triple {11782#true} ~x~0 := 0;~y~0 := 50000;~z~0 := 0;~x~0 := 0; {11787#(<= 50000 main_~y~0)} is VALID [2022-04-28 03:52:02,901 INFO L290 TraceCheckUtils]: 6: Hoare triple {11787#(<= 50000 main_~y~0)} [124] L11-2-->L18-1_primed: Formula: (let ((.cse0 (= v_main_~x~0_682 v_main_~x~0_681)) (.cse1 (= |v_main_#t~post4_110| |v_main_#t~post4_109|))) (or (and .cse0 .cse1) (and .cse0 .cse1 (not (< v_main_~x~0_682 50000))) (and (< v_main_~x~0_681 50001) (< v_main_~x~0_682 v_main_~x~0_681)))) InVars {main_~x~0=v_main_~x~0_682, main_#t~post4=|v_main_#t~post4_110|} OutVars{main_~x~0=v_main_~x~0_681, main_#t~post4=|v_main_#t~post4_109|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {11787#(<= 50000 main_~y~0)} is VALID [2022-04-28 03:52:02,901 INFO L290 TraceCheckUtils]: 7: Hoare triple {11787#(<= 50000 main_~y~0)} [125] L18-1_primed-->L11-2: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {11787#(<= 50000 main_~y~0)} is VALID [2022-04-28 03:52:02,902 INFO L290 TraceCheckUtils]: 8: Hoare triple {11787#(<= 50000 main_~y~0)} [126] L11-2-->L18-1_primed: Formula: (let ((.cse0 (= |v_main_#t~post5_116| |v_main_#t~post5_115|)) (.cse1 (= v_main_~x~0_684 v_main_~x~0_683)) (.cse3 (= v_main_~y~0_672 v_main_~y~0_671)) (.cse4 (= |v_main_#t~post6_116| |v_main_#t~post6_115|)) (.cse2 (<= 50000 v_main_~x~0_684))) (or (and .cse0 .cse1 (or (not (< v_main_~x~0_684 1000000)) (not .cse2)) .cse3 .cse4) (and .cse0 .cse1 .cse3 .cse4) (let ((.cse5 (+ v_main_~x~0_684 v_main_~y~0_671))) (and .cse2 (< v_main_~y~0_672 v_main_~y~0_671) (< .cse5 (+ v_main_~y~0_672 1000001)) (= (+ v_main_~x~0_683 v_main_~y~0_672) .cse5))))) InVars {main_~y~0=v_main_~y~0_672, main_#t~post5=|v_main_#t~post5_116|, main_~x~0=v_main_~x~0_684, main_#t~post6=|v_main_#t~post6_116|} OutVars{main_~y~0=v_main_~y~0_671, main_#t~post5=|v_main_#t~post5_115|, main_~x~0=v_main_~x~0_683, main_#t~post6=|v_main_#t~post6_115|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {11787#(<= 50000 main_~y~0)} is VALID [2022-04-28 03:52:02,902 INFO L290 TraceCheckUtils]: 9: Hoare triple {11787#(<= 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[] {11787#(<= 50000 main_~y~0)} is VALID [2022-04-28 03:52:02,902 INFO L290 TraceCheckUtils]: 10: Hoare triple {11787#(<= 50000 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {11788#(<= 49998 main_~y~0)} is VALID [2022-04-28 03:52:02,903 INFO L290 TraceCheckUtils]: 11: Hoare triple {11788#(<= 49998 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {11789#(<= 49996 main_~y~0)} is VALID [2022-04-28 03:52:02,903 INFO L290 TraceCheckUtils]: 12: Hoare triple {11789#(<= 49996 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {11790#(<= 49994 main_~y~0)} is VALID [2022-04-28 03:52:02,904 INFO L290 TraceCheckUtils]: 13: Hoare triple {11790#(<= 49994 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {11791#(<= 49992 main_~y~0)} is VALID [2022-04-28 03:52:02,904 INFO L290 TraceCheckUtils]: 14: Hoare triple {11791#(<= 49992 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {11792#(<= 49990 main_~y~0)} is VALID [2022-04-28 03:52:02,904 INFO L290 TraceCheckUtils]: 15: Hoare triple {11792#(<= 49990 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {11793#(<= 49988 main_~y~0)} is VALID [2022-04-28 03:52:02,905 INFO L290 TraceCheckUtils]: 16: Hoare triple {11793#(<= 49988 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {11794#(<= 49986 main_~y~0)} is VALID [2022-04-28 03:52:02,905 INFO L290 TraceCheckUtils]: 17: Hoare triple {11794#(<= 49986 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {11795#(<= 49984 main_~y~0)} is VALID [2022-04-28 03:52:02,906 INFO L290 TraceCheckUtils]: 18: Hoare triple {11795#(<= 49984 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {11796#(<= 49982 main_~y~0)} is VALID [2022-04-28 03:52:02,906 INFO L290 TraceCheckUtils]: 19: Hoare triple {11796#(<= 49982 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {11797#(<= 49980 main_~y~0)} is VALID [2022-04-28 03:52:02,907 INFO L290 TraceCheckUtils]: 20: Hoare triple {11797#(<= 49980 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {11798#(<= 49978 main_~y~0)} is VALID [2022-04-28 03:52:02,907 INFO L290 TraceCheckUtils]: 21: Hoare triple {11798#(<= 49978 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {11799#(<= 49976 main_~y~0)} is VALID [2022-04-28 03:52:02,907 INFO L290 TraceCheckUtils]: 22: Hoare triple {11799#(<= 49976 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {11800#(<= 49974 main_~y~0)} is VALID [2022-04-28 03:52:02,908 INFO L290 TraceCheckUtils]: 23: Hoare triple {11800#(<= 49974 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {11801#(<= 49972 main_~y~0)} is VALID [2022-04-28 03:52:02,908 INFO L290 TraceCheckUtils]: 24: Hoare triple {11801#(<= 49972 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {11802#(<= 49970 main_~y~0)} is VALID [2022-04-28 03:52:02,909 INFO L290 TraceCheckUtils]: 25: Hoare triple {11802#(<= 49970 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {11803#(<= 49968 main_~y~0)} is VALID [2022-04-28 03:52:02,909 INFO L290 TraceCheckUtils]: 26: Hoare triple {11803#(<= 49968 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {11804#(<= 49966 main_~y~0)} is VALID [2022-04-28 03:52:02,911 INFO L290 TraceCheckUtils]: 27: Hoare triple {11804#(<= 49966 main_~y~0)} assume !(~y~0 > 0); {11783#false} is VALID [2022-04-28 03:52:02,911 INFO L272 TraceCheckUtils]: 28: Hoare triple {11783#false} call __VERIFIER_assert((if ~z~0 == ~x~0 then 1 else 0)); {11783#false} is VALID [2022-04-28 03:52:02,911 INFO L290 TraceCheckUtils]: 29: Hoare triple {11783#false} ~cond := #in~cond; {11783#false} is VALID [2022-04-28 03:52:02,911 INFO L290 TraceCheckUtils]: 30: Hoare triple {11783#false} assume 0 == ~cond; {11783#false} is VALID [2022-04-28 03:52:02,911 INFO L290 TraceCheckUtils]: 31: Hoare triple {11783#false} assume !false; {11783#false} is VALID [2022-04-28 03:52:02,912 INFO L134 CoverageAnalysis]: Checked inductivity of 155 backedges. 0 proven. 153 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-04-28 03:52:02,912 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 03:52:02,912 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1636603441] [2022-04-28 03:52:02,912 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1636603441] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 03:52:02,912 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [253774815] [2022-04-28 03:52:02,912 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:52:02,912 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 03:52:02,912 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 03:52:02,913 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 03:52:02,914 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Waiting until timeout for monitored process [2022-04-28 03:52:02,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:52:02,944 INFO L263 TraceCheckSpWp]: Trace formula consists of 144 conjuncts, 20 conjunts are in the unsatisfiable core [2022-04-28 03:52:02,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:52:02,955 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 03:52:03,265 INFO L272 TraceCheckUtils]: 0: Hoare triple {11782#true} call ULTIMATE.init(); {11782#true} is VALID [2022-04-28 03:52:03,265 INFO L290 TraceCheckUtils]: 1: Hoare triple {11782#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); {11782#true} is VALID [2022-04-28 03:52:03,265 INFO L290 TraceCheckUtils]: 2: Hoare triple {11782#true} assume true; {11782#true} is VALID [2022-04-28 03:52:03,266 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {11782#true} {11782#true} #52#return; {11782#true} is VALID [2022-04-28 03:52:03,266 INFO L272 TraceCheckUtils]: 4: Hoare triple {11782#true} call #t~ret7 := main(); {11782#true} is VALID [2022-04-28 03:52:03,266 INFO L290 TraceCheckUtils]: 5: Hoare triple {11782#true} ~x~0 := 0;~y~0 := 50000;~z~0 := 0;~x~0 := 0; {11787#(<= 50000 main_~y~0)} is VALID [2022-04-28 03:52:03,266 INFO L290 TraceCheckUtils]: 6: Hoare triple {11787#(<= 50000 main_~y~0)} [124] L11-2-->L18-1_primed: Formula: (let ((.cse0 (= v_main_~x~0_682 v_main_~x~0_681)) (.cse1 (= |v_main_#t~post4_110| |v_main_#t~post4_109|))) (or (and .cse0 .cse1) (and .cse0 .cse1 (not (< v_main_~x~0_682 50000))) (and (< v_main_~x~0_681 50001) (< v_main_~x~0_682 v_main_~x~0_681)))) InVars {main_~x~0=v_main_~x~0_682, main_#t~post4=|v_main_#t~post4_110|} OutVars{main_~x~0=v_main_~x~0_681, main_#t~post4=|v_main_#t~post4_109|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {11787#(<= 50000 main_~y~0)} is VALID [2022-04-28 03:52:03,266 INFO L290 TraceCheckUtils]: 7: Hoare triple {11787#(<= 50000 main_~y~0)} [125] L18-1_primed-->L11-2: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {11787#(<= 50000 main_~y~0)} is VALID [2022-04-28 03:52:03,267 INFO L290 TraceCheckUtils]: 8: Hoare triple {11787#(<= 50000 main_~y~0)} [126] L11-2-->L18-1_primed: Formula: (let ((.cse0 (= |v_main_#t~post5_116| |v_main_#t~post5_115|)) (.cse1 (= v_main_~x~0_684 v_main_~x~0_683)) (.cse3 (= v_main_~y~0_672 v_main_~y~0_671)) (.cse4 (= |v_main_#t~post6_116| |v_main_#t~post6_115|)) (.cse2 (<= 50000 v_main_~x~0_684))) (or (and .cse0 .cse1 (or (not (< v_main_~x~0_684 1000000)) (not .cse2)) .cse3 .cse4) (and .cse0 .cse1 .cse3 .cse4) (let ((.cse5 (+ v_main_~x~0_684 v_main_~y~0_671))) (and .cse2 (< v_main_~y~0_672 v_main_~y~0_671) (< .cse5 (+ v_main_~y~0_672 1000001)) (= (+ v_main_~x~0_683 v_main_~y~0_672) .cse5))))) InVars {main_~y~0=v_main_~y~0_672, main_#t~post5=|v_main_#t~post5_116|, main_~x~0=v_main_~x~0_684, main_#t~post6=|v_main_#t~post6_116|} OutVars{main_~y~0=v_main_~y~0_671, main_#t~post5=|v_main_#t~post5_115|, main_~x~0=v_main_~x~0_683, main_#t~post6=|v_main_#t~post6_115|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {11787#(<= 50000 main_~y~0)} is VALID [2022-04-28 03:52:03,267 INFO L290 TraceCheckUtils]: 9: Hoare triple {11787#(<= 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[] {11787#(<= 50000 main_~y~0)} is VALID [2022-04-28 03:52:03,268 INFO L290 TraceCheckUtils]: 10: Hoare triple {11787#(<= 50000 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {11788#(<= 49998 main_~y~0)} is VALID [2022-04-28 03:52:03,268 INFO L290 TraceCheckUtils]: 11: Hoare triple {11788#(<= 49998 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {11789#(<= 49996 main_~y~0)} is VALID [2022-04-28 03:52:03,269 INFO L290 TraceCheckUtils]: 12: Hoare triple {11789#(<= 49996 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {11790#(<= 49994 main_~y~0)} is VALID [2022-04-28 03:52:03,269 INFO L290 TraceCheckUtils]: 13: Hoare triple {11790#(<= 49994 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {11791#(<= 49992 main_~y~0)} is VALID [2022-04-28 03:52:03,270 INFO L290 TraceCheckUtils]: 14: Hoare triple {11791#(<= 49992 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {11792#(<= 49990 main_~y~0)} is VALID [2022-04-28 03:52:03,270 INFO L290 TraceCheckUtils]: 15: Hoare triple {11792#(<= 49990 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {11793#(<= 49988 main_~y~0)} is VALID [2022-04-28 03:52:03,270 INFO L290 TraceCheckUtils]: 16: Hoare triple {11793#(<= 49988 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {11794#(<= 49986 main_~y~0)} is VALID [2022-04-28 03:52:03,271 INFO L290 TraceCheckUtils]: 17: Hoare triple {11794#(<= 49986 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {11795#(<= 49984 main_~y~0)} is VALID [2022-04-28 03:52:03,271 INFO L290 TraceCheckUtils]: 18: Hoare triple {11795#(<= 49984 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {11796#(<= 49982 main_~y~0)} is VALID [2022-04-28 03:52:03,272 INFO L290 TraceCheckUtils]: 19: Hoare triple {11796#(<= 49982 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {11797#(<= 49980 main_~y~0)} is VALID [2022-04-28 03:52:03,272 INFO L290 TraceCheckUtils]: 20: Hoare triple {11797#(<= 49980 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {11798#(<= 49978 main_~y~0)} is VALID [2022-04-28 03:52:03,273 INFO L290 TraceCheckUtils]: 21: Hoare triple {11798#(<= 49978 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {11799#(<= 49976 main_~y~0)} is VALID [2022-04-28 03:52:03,273 INFO L290 TraceCheckUtils]: 22: Hoare triple {11799#(<= 49976 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {11800#(<= 49974 main_~y~0)} is VALID [2022-04-28 03:52:03,274 INFO L290 TraceCheckUtils]: 23: Hoare triple {11800#(<= 49974 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {11801#(<= 49972 main_~y~0)} is VALID [2022-04-28 03:52:03,274 INFO L290 TraceCheckUtils]: 24: Hoare triple {11801#(<= 49972 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {11802#(<= 49970 main_~y~0)} is VALID [2022-04-28 03:52:03,274 INFO L290 TraceCheckUtils]: 25: Hoare triple {11802#(<= 49970 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {11803#(<= 49968 main_~y~0)} is VALID [2022-04-28 03:52:03,275 INFO L290 TraceCheckUtils]: 26: Hoare triple {11803#(<= 49968 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {11804#(<= 49966 main_~y~0)} is VALID [2022-04-28 03:52:03,275 INFO L290 TraceCheckUtils]: 27: Hoare triple {11804#(<= 49966 main_~y~0)} assume !(~y~0 > 0); {11783#false} is VALID [2022-04-28 03:52:03,275 INFO L272 TraceCheckUtils]: 28: Hoare triple {11783#false} call __VERIFIER_assert((if ~z~0 == ~x~0 then 1 else 0)); {11783#false} is VALID [2022-04-28 03:52:03,275 INFO L290 TraceCheckUtils]: 29: Hoare triple {11783#false} ~cond := #in~cond; {11783#false} is VALID [2022-04-28 03:52:03,275 INFO L290 TraceCheckUtils]: 30: Hoare triple {11783#false} assume 0 == ~cond; {11783#false} is VALID [2022-04-28 03:52:03,275 INFO L290 TraceCheckUtils]: 31: Hoare triple {11783#false} assume !false; {11783#false} is VALID [2022-04-28 03:52:03,276 INFO L134 CoverageAnalysis]: Checked inductivity of 155 backedges. 0 proven. 153 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-04-28 03:52:03,276 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 03:52:03,926 INFO L290 TraceCheckUtils]: 31: Hoare triple {11783#false} assume !false; {11783#false} is VALID [2022-04-28 03:52:03,926 INFO L290 TraceCheckUtils]: 30: Hoare triple {11783#false} assume 0 == ~cond; {11783#false} is VALID [2022-04-28 03:52:03,926 INFO L290 TraceCheckUtils]: 29: Hoare triple {11783#false} ~cond := #in~cond; {11783#false} is VALID [2022-04-28 03:52:03,926 INFO L272 TraceCheckUtils]: 28: Hoare triple {11783#false} call __VERIFIER_assert((if ~z~0 == ~x~0 then 1 else 0)); {11783#false} is VALID [2022-04-28 03:52:03,927 INFO L290 TraceCheckUtils]: 27: Hoare triple {11914#(< 0 main_~y~0)} assume !(~y~0 > 0); {11783#false} is VALID [2022-04-28 03:52:03,927 INFO L290 TraceCheckUtils]: 26: Hoare triple {11918#(< 2 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {11914#(< 0 main_~y~0)} is VALID [2022-04-28 03:52:03,928 INFO L290 TraceCheckUtils]: 25: Hoare triple {11922#(< 4 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {11918#(< 2 main_~y~0)} is VALID [2022-04-28 03:52:03,930 INFO L290 TraceCheckUtils]: 24: Hoare triple {11926#(< 6 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {11922#(< 4 main_~y~0)} is VALID [2022-04-28 03:52:03,937 INFO L290 TraceCheckUtils]: 23: Hoare triple {11930#(< 8 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {11926#(< 6 main_~y~0)} is VALID [2022-04-28 03:52:03,938 INFO L290 TraceCheckUtils]: 22: Hoare triple {11934#(< 10 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {11930#(< 8 main_~y~0)} is VALID [2022-04-28 03:52:03,938 INFO L290 TraceCheckUtils]: 21: Hoare triple {11938#(< 12 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {11934#(< 10 main_~y~0)} is VALID [2022-04-28 03:52:03,939 INFO L290 TraceCheckUtils]: 20: Hoare triple {11942#(< 14 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {11938#(< 12 main_~y~0)} is VALID [2022-04-28 03:52:03,939 INFO L290 TraceCheckUtils]: 19: Hoare triple {11946#(< 16 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {11942#(< 14 main_~y~0)} is VALID [2022-04-28 03:52:03,940 INFO L290 TraceCheckUtils]: 18: Hoare triple {11950#(< 18 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {11946#(< 16 main_~y~0)} is VALID [2022-04-28 03:52:03,940 INFO L290 TraceCheckUtils]: 17: Hoare triple {11954#(< 20 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {11950#(< 18 main_~y~0)} is VALID [2022-04-28 03:52:03,941 INFO L290 TraceCheckUtils]: 16: Hoare triple {11958#(< 22 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {11954#(< 20 main_~y~0)} is VALID [2022-04-28 03:52:03,941 INFO L290 TraceCheckUtils]: 15: Hoare triple {11962#(< 24 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {11958#(< 22 main_~y~0)} is VALID [2022-04-28 03:52:03,941 INFO L290 TraceCheckUtils]: 14: Hoare triple {11966#(< 26 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {11962#(< 24 main_~y~0)} is VALID [2022-04-28 03:52:03,942 INFO L290 TraceCheckUtils]: 13: Hoare triple {11970#(< 28 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {11966#(< 26 main_~y~0)} is VALID [2022-04-28 03:52:03,942 INFO L290 TraceCheckUtils]: 12: Hoare triple {11974#(< 30 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {11970#(< 28 main_~y~0)} is VALID [2022-04-28 03:52:03,943 INFO L290 TraceCheckUtils]: 11: Hoare triple {11978#(< 32 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {11974#(< 30 main_~y~0)} is VALID [2022-04-28 03:52:03,943 INFO L290 TraceCheckUtils]: 10: Hoare triple {11982#(< 34 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {11978#(< 32 main_~y~0)} is VALID [2022-04-28 03:52:03,944 INFO L290 TraceCheckUtils]: 9: Hoare triple {11982#(< 34 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[] {11982#(< 34 main_~y~0)} is VALID [2022-04-28 03:52:03,944 INFO L290 TraceCheckUtils]: 8: Hoare triple {11982#(< 34 main_~y~0)} [126] L11-2-->L18-1_primed: Formula: (let ((.cse0 (= |v_main_#t~post5_116| |v_main_#t~post5_115|)) (.cse1 (= v_main_~x~0_684 v_main_~x~0_683)) (.cse3 (= v_main_~y~0_672 v_main_~y~0_671)) (.cse4 (= |v_main_#t~post6_116| |v_main_#t~post6_115|)) (.cse2 (<= 50000 v_main_~x~0_684))) (or (and .cse0 .cse1 (or (not (< v_main_~x~0_684 1000000)) (not .cse2)) .cse3 .cse4) (and .cse0 .cse1 .cse3 .cse4) (let ((.cse5 (+ v_main_~x~0_684 v_main_~y~0_671))) (and .cse2 (< v_main_~y~0_672 v_main_~y~0_671) (< .cse5 (+ v_main_~y~0_672 1000001)) (= (+ v_main_~x~0_683 v_main_~y~0_672) .cse5))))) InVars {main_~y~0=v_main_~y~0_672, main_#t~post5=|v_main_#t~post5_116|, main_~x~0=v_main_~x~0_684, main_#t~post6=|v_main_#t~post6_116|} OutVars{main_~y~0=v_main_~y~0_671, main_#t~post5=|v_main_#t~post5_115|, main_~x~0=v_main_~x~0_683, main_#t~post6=|v_main_#t~post6_115|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {11982#(< 34 main_~y~0)} is VALID [2022-04-28 03:52:03,945 INFO L290 TraceCheckUtils]: 7: Hoare triple {11982#(< 34 main_~y~0)} [125] L18-1_primed-->L11-2: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {11982#(< 34 main_~y~0)} is VALID [2022-04-28 03:52:03,945 INFO L290 TraceCheckUtils]: 6: Hoare triple {11982#(< 34 main_~y~0)} [124] L11-2-->L18-1_primed: Formula: (let ((.cse0 (= v_main_~x~0_682 v_main_~x~0_681)) (.cse1 (= |v_main_#t~post4_110| |v_main_#t~post4_109|))) (or (and .cse0 .cse1) (and .cse0 .cse1 (not (< v_main_~x~0_682 50000))) (and (< v_main_~x~0_681 50001) (< v_main_~x~0_682 v_main_~x~0_681)))) InVars {main_~x~0=v_main_~x~0_682, main_#t~post4=|v_main_#t~post4_110|} OutVars{main_~x~0=v_main_~x~0_681, main_#t~post4=|v_main_#t~post4_109|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {11982#(< 34 main_~y~0)} is VALID [2022-04-28 03:52:03,945 INFO L290 TraceCheckUtils]: 5: Hoare triple {11782#true} ~x~0 := 0;~y~0 := 50000;~z~0 := 0;~x~0 := 0; {11982#(< 34 main_~y~0)} is VALID [2022-04-28 03:52:03,945 INFO L272 TraceCheckUtils]: 4: Hoare triple {11782#true} call #t~ret7 := main(); {11782#true} is VALID [2022-04-28 03:52:03,945 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {11782#true} {11782#true} #52#return; {11782#true} is VALID [2022-04-28 03:52:03,945 INFO L290 TraceCheckUtils]: 2: Hoare triple {11782#true} assume true; {11782#true} is VALID [2022-04-28 03:52:03,946 INFO L290 TraceCheckUtils]: 1: Hoare triple {11782#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); {11782#true} is VALID [2022-04-28 03:52:03,946 INFO L272 TraceCheckUtils]: 0: Hoare triple {11782#true} call ULTIMATE.init(); {11782#true} is VALID [2022-04-28 03:52:03,946 INFO L134 CoverageAnalysis]: Checked inductivity of 155 backedges. 0 proven. 153 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-04-28 03:52:03,946 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [253774815] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 03:52:03,946 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 03:52:03,946 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 20, 20] total 39 [2022-04-28 03:52:05,021 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 03:52:05,022 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [433200960] [2022-04-28 03:52:05,022 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [433200960] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 03:52:05,022 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 03:52:05,022 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [55] imperfect sequences [] total 55 [2022-04-28 03:52:05,022 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1554264155] [2022-04-28 03:52:05,022 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 03:52:05,023 INFO L78 Accepts]: Start accepts. Automaton has has 55 states, 55 states have (on average 1.6545454545454545) internal successors, (91), 54 states have internal predecessors, (91), 2 states have call successors, (3), 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 95 [2022-04-28 03:52:05,024 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 03:52:05,024 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 55 states, 55 states have (on average 1.6545454545454545) internal successors, (91), 54 states have internal predecessors, (91), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:52:05,103 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 95 edges. 95 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 03:52:05,103 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 55 states [2022-04-28 03:52:05,103 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 03:52:05,104 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 55 interpolants. [2022-04-28 03:52:05,104 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=2030, Invalid=3226, Unknown=0, NotChecked=0, Total=5256 [2022-04-28 03:52:05,104 INFO L87 Difference]: Start difference. First operand 96 states and 99 transitions. Second operand has 55 states, 55 states have (on average 1.6545454545454545) internal successors, (91), 54 states have internal predecessors, (91), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:52:09,667 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:52:09,667 INFO L93 Difference]: Finished difference Result 189 states and 200 transitions. [2022-04-28 03:52:09,668 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 55 states. [2022-04-28 03:52:09,668 INFO L78 Accepts]: Start accepts. Automaton has has 55 states, 55 states have (on average 1.6545454545454545) internal successors, (91), 54 states have internal predecessors, (91), 2 states have call successors, (3), 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 95 [2022-04-28 03:52:09,668 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 03:52:09,668 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 55 states, 55 states have (on average 1.6545454545454545) internal successors, (91), 54 states have internal predecessors, (91), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:52:09,669 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 117 transitions. [2022-04-28 03:52:09,670 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 55 states, 55 states have (on average 1.6545454545454545) internal successors, (91), 54 states have internal predecessors, (91), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:52:09,670 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 117 transitions. [2022-04-28 03:52:09,671 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 55 states and 117 transitions. [2022-04-28 03:52:09,773 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 117 edges. 117 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 03:52:09,774 INFO L225 Difference]: With dead ends: 189 [2022-04-28 03:52:09,774 INFO L226 Difference]: Without dead ends: 101 [2022-04-28 03:52:09,775 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 209 GetRequests, 84 SyntacticMatches, 2 SemanticMatches, 123 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4439 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=4770, Invalid=10730, Unknown=0, NotChecked=0, Total=15500 [2022-04-28 03:52:09,776 INFO L413 NwaCegarLoop]: 12 mSDtfsCounter, 79 mSDsluCounter, 32 mSDsCounter, 0 mSdLazyCounter, 2308 mSolverCounterSat, 134 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 79 SdHoareTripleChecker+Valid, 44 SdHoareTripleChecker+Invalid, 2442 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 134 IncrementalHoareTripleChecker+Valid, 2308 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2022-04-28 03:52:09,776 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [79 Valid, 44 Invalid, 2442 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [134 Valid, 2308 Invalid, 0 Unknown, 0 Unchecked, 1.8s Time] [2022-04-28 03:52:09,776 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2022-04-28 03:52:09,939 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 101. [2022-04-28 03:52:09,939 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 03:52:09,939 INFO L82 GeneralOperation]: Start isEquivalent. First operand 101 states. Second operand has 101 states, 96 states have (on average 1.0416666666666667) internal successors, (100), 96 states have internal predecessors, (100), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:52:09,939 INFO L74 IsIncluded]: Start isIncluded. First operand 101 states. Second operand has 101 states, 96 states have (on average 1.0416666666666667) internal successors, (100), 96 states have internal predecessors, (100), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:52:09,939 INFO L87 Difference]: Start difference. First operand 101 states. Second operand has 101 states, 96 states have (on average 1.0416666666666667) internal successors, (100), 96 states have internal predecessors, (100), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:52:09,941 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:52:09,941 INFO L93 Difference]: Finished difference Result 101 states and 104 transitions. [2022-04-28 03:52:09,941 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 104 transitions. [2022-04-28 03:52:09,941 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:52:09,941 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:52:09,941 INFO L74 IsIncluded]: Start isIncluded. First operand has 101 states, 96 states have (on average 1.0416666666666667) internal successors, (100), 96 states have internal predecessors, (100), 3 states have call successors, (3), 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 101 states. [2022-04-28 03:52:09,941 INFO L87 Difference]: Start difference. First operand has 101 states, 96 states have (on average 1.0416666666666667) internal successors, (100), 96 states have internal predecessors, (100), 3 states have call successors, (3), 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 101 states. [2022-04-28 03:52:09,942 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:52:09,942 INFO L93 Difference]: Finished difference Result 101 states and 104 transitions. [2022-04-28 03:52:09,942 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 104 transitions. [2022-04-28 03:52:09,942 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:52:09,942 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:52:09,943 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 03:52:09,943 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 03:52:09,943 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 101 states, 96 states have (on average 1.0416666666666667) internal successors, (100), 96 states have internal predecessors, (100), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:52:09,944 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 104 transitions. [2022-04-28 03:52:09,944 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 104 transitions. Word has length 95 [2022-04-28 03:52:09,944 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 03:52:09,944 INFO L495 AbstractCegarLoop]: Abstraction has 101 states and 104 transitions. [2022-04-28 03:52:09,944 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 55 states, 55 states have (on average 1.6545454545454545) internal successors, (91), 54 states have internal predecessors, (91), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:52:09,944 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 101 states and 104 transitions. [2022-04-28 03:52:10,044 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 104 edges. 104 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 03:52:10,045 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 104 transitions. [2022-04-28 03:52:10,045 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2022-04-28 03:52:10,045 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 03:52:10,046 INFO L195 NwaCegarLoop]: trace histogram [35, 34, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 03:52:10,070 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Forceful destruction successful, exit code 0 [2022-04-28 03:52:10,246 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,18 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 03:52:10,246 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 03:52:10,246 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 03:52:10,246 INFO L85 PathProgramCache]: Analyzing trace with hash 717155844, now seen corresponding path program 18 times [2022-04-28 03:52:10,246 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 03:52:10,247 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [132740608] [2022-04-28 03:52:14,319 WARN L977 rdanLoopAcceleration]: Unable to prove correctness of quantifier elimination. [2022-04-28 03:52:14,369 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 1 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 03:52:18,481 WARN L977 rdanLoopAcceleration]: Unable to prove correctness of quantifier elimination. [2022-04-28 03:52:18,577 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={1=1, 2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 03:52:18,580 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-28 03:52:18,582 INFO L85 PathProgramCache]: Analyzing trace with hash 47272225, now seen corresponding path program 1 times [2022-04-28 03:52:18,582 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 03:52:18,582 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [31155266] [2022-04-28 03:52:18,582 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:52:18,582 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 03:52:18,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:52:18,824 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 03:52:18,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:52:18,827 INFO L290 TraceCheckUtils]: 0: Hoare triple {12959#(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); {12935#true} is VALID [2022-04-28 03:52:18,827 INFO L290 TraceCheckUtils]: 1: Hoare triple {12935#true} assume true; {12935#true} is VALID [2022-04-28 03:52:18,827 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {12935#true} {12935#true} #52#return; {12935#true} is VALID [2022-04-28 03:52:18,828 INFO L272 TraceCheckUtils]: 0: Hoare triple {12935#true} call ULTIMATE.init(); {12959#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 03:52:18,828 INFO L290 TraceCheckUtils]: 1: Hoare triple {12959#(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); {12935#true} is VALID [2022-04-28 03:52:18,828 INFO L290 TraceCheckUtils]: 2: Hoare triple {12935#true} assume true; {12935#true} is VALID [2022-04-28 03:52:18,828 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {12935#true} {12935#true} #52#return; {12935#true} is VALID [2022-04-28 03:52:18,828 INFO L272 TraceCheckUtils]: 4: Hoare triple {12935#true} call #t~ret7 := main(); {12935#true} is VALID [2022-04-28 03:52:18,828 INFO L290 TraceCheckUtils]: 5: Hoare triple {12935#true} ~x~0 := 0;~y~0 := 50000;~z~0 := 0;~x~0 := 0; {12940#(<= 50000 main_~y~0)} is VALID [2022-04-28 03:52:18,829 INFO L290 TraceCheckUtils]: 6: Hoare triple {12940#(<= 50000 main_~y~0)} [128] L11-2-->L18-1_primed: Formula: (let ((.cse0 (= |v_main_#t~post4_116| |v_main_#t~post4_115|)) (.cse1 (= v_main_~x~0_748 v_main_~x~0_747))) (or (and .cse0 .cse1) (and (< v_main_~x~0_747 50001) (< v_main_~x~0_748 v_main_~x~0_747)) (and (not (< v_main_~x~0_748 50000)) .cse0 .cse1))) InVars {main_~x~0=v_main_~x~0_748, main_#t~post4=|v_main_#t~post4_116|} OutVars{main_~x~0=v_main_~x~0_747, main_#t~post4=|v_main_#t~post4_115|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {12940#(<= 50000 main_~y~0)} is VALID [2022-04-28 03:52:18,829 INFO L290 TraceCheckUtils]: 7: Hoare triple {12940#(<= 50000 main_~y~0)} [129] L18-1_primed-->L11-2: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {12940#(<= 50000 main_~y~0)} is VALID [2022-04-28 03:52:18,830 INFO L290 TraceCheckUtils]: 8: Hoare triple {12940#(<= 50000 main_~y~0)} [130] L11-2-->L18-1_primed: Formula: (let ((.cse0 (<= 50000 v_main_~x~0_750)) (.cse1 (= |v_main_#t~post6_123| |v_main_#t~post6_122|)) (.cse2 (= v_main_~y~0_747 v_main_~y~0_746)) (.cse3 (= |v_main_#t~post5_123| |v_main_#t~post5_122|))) (or (and (< v_main_~x~0_750 v_main_~x~0_749) (< v_main_~x~0_749 1000001) .cse0 (= (+ v_main_~x~0_749 v_main_~y~0_747) (+ v_main_~x~0_750 v_main_~y~0_746))) (and .cse1 .cse2 .cse3 (= v_main_~x~0_749 v_main_~x~0_750) (or (not (< v_main_~x~0_750 1000000)) (not .cse0))) (and .cse1 .cse2 .cse3 (= v_main_~x~0_750 v_main_~x~0_749)))) InVars {main_~y~0=v_main_~y~0_747, main_#t~post5=|v_main_#t~post5_123|, main_~x~0=v_main_~x~0_750, main_#t~post6=|v_main_#t~post6_123|} OutVars{main_~y~0=v_main_~y~0_746, main_#t~post5=|v_main_#t~post5_122|, main_~x~0=v_main_~x~0_749, main_#t~post6=|v_main_#t~post6_122|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {12940#(<= 50000 main_~y~0)} is VALID [2022-04-28 03:52:18,830 INFO L290 TraceCheckUtils]: 9: Hoare triple {12940#(<= 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[] {12940#(<= 50000 main_~y~0)} is VALID [2022-04-28 03:52:18,830 INFO L290 TraceCheckUtils]: 10: Hoare triple {12940#(<= 50000 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {12941#(<= 49998 main_~y~0)} is VALID [2022-04-28 03:52:18,831 INFO L290 TraceCheckUtils]: 11: Hoare triple {12941#(<= 49998 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {12942#(<= 49996 main_~y~0)} is VALID [2022-04-28 03:52:18,831 INFO L290 TraceCheckUtils]: 12: Hoare triple {12942#(<= 49996 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {12943#(<= 49994 main_~y~0)} is VALID [2022-04-28 03:52:18,832 INFO L290 TraceCheckUtils]: 13: Hoare triple {12943#(<= 49994 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {12944#(<= 49992 main_~y~0)} is VALID [2022-04-28 03:52:18,832 INFO L290 TraceCheckUtils]: 14: Hoare triple {12944#(<= 49992 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {12945#(<= 49990 main_~y~0)} is VALID [2022-04-28 03:52:18,832 INFO L290 TraceCheckUtils]: 15: Hoare triple {12945#(<= 49990 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {12946#(<= 49988 main_~y~0)} is VALID [2022-04-28 03:52:18,833 INFO L290 TraceCheckUtils]: 16: Hoare triple {12946#(<= 49988 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {12947#(<= 49986 main_~y~0)} is VALID [2022-04-28 03:52:18,833 INFO L290 TraceCheckUtils]: 17: Hoare triple {12947#(<= 49986 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {12948#(<= 49984 main_~y~0)} is VALID [2022-04-28 03:52:18,834 INFO L290 TraceCheckUtils]: 18: Hoare triple {12948#(<= 49984 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {12949#(<= 49982 main_~y~0)} is VALID [2022-04-28 03:52:18,834 INFO L290 TraceCheckUtils]: 19: Hoare triple {12949#(<= 49982 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {12950#(<= 49980 main_~y~0)} is VALID [2022-04-28 03:52:18,834 INFO L290 TraceCheckUtils]: 20: Hoare triple {12950#(<= 49980 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {12951#(<= 49978 main_~y~0)} is VALID [2022-04-28 03:52:18,835 INFO L290 TraceCheckUtils]: 21: Hoare triple {12951#(<= 49978 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {12952#(<= 49976 main_~y~0)} is VALID [2022-04-28 03:52:18,835 INFO L290 TraceCheckUtils]: 22: Hoare triple {12952#(<= 49976 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {12953#(<= 49974 main_~y~0)} is VALID [2022-04-28 03:52:18,836 INFO L290 TraceCheckUtils]: 23: Hoare triple {12953#(<= 49974 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {12954#(<= 49972 main_~y~0)} is VALID [2022-04-28 03:52:18,836 INFO L290 TraceCheckUtils]: 24: Hoare triple {12954#(<= 49972 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {12955#(<= 49970 main_~y~0)} is VALID [2022-04-28 03:52:18,837 INFO L290 TraceCheckUtils]: 25: Hoare triple {12955#(<= 49970 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {12956#(<= 49968 main_~y~0)} is VALID [2022-04-28 03:52:18,837 INFO L290 TraceCheckUtils]: 26: Hoare triple {12956#(<= 49968 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {12957#(<= 49966 main_~y~0)} is VALID [2022-04-28 03:52:18,837 INFO L290 TraceCheckUtils]: 27: Hoare triple {12957#(<= 49966 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {12958#(<= 49964 main_~y~0)} is VALID [2022-04-28 03:52:18,838 INFO L290 TraceCheckUtils]: 28: Hoare triple {12958#(<= 49964 main_~y~0)} assume !(~y~0 > 0); {12936#false} is VALID [2022-04-28 03:52:18,838 INFO L272 TraceCheckUtils]: 29: Hoare triple {12936#false} call __VERIFIER_assert((if ~z~0 == ~x~0 then 1 else 0)); {12936#false} is VALID [2022-04-28 03:52:18,838 INFO L290 TraceCheckUtils]: 30: Hoare triple {12936#false} ~cond := #in~cond; {12936#false} is VALID [2022-04-28 03:52:18,838 INFO L290 TraceCheckUtils]: 31: Hoare triple {12936#false} assume 0 == ~cond; {12936#false} is VALID [2022-04-28 03:52:18,838 INFO L290 TraceCheckUtils]: 32: Hoare triple {12936#false} assume !false; {12936#false} is VALID [2022-04-28 03:52:18,838 INFO L134 CoverageAnalysis]: Checked inductivity of 173 backedges. 0 proven. 171 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-04-28 03:52:18,838 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 03:52:18,838 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [31155266] [2022-04-28 03:52:18,838 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [31155266] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 03:52:18,839 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [182727695] [2022-04-28 03:52:18,839 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:52:18,839 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 03:52:18,839 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 03:52:18,839 INFO L229 MonitoredProcess]: Starting monitored process 19 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 03:52:18,840 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Waiting until timeout for monitored process [2022-04-28 03:52:18,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:52:18,876 INFO L263 TraceCheckSpWp]: Trace formula consists of 149 conjuncts, 21 conjunts are in the unsatisfiable core [2022-04-28 03:52:18,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:52:18,889 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 03:52:19,240 INFO L272 TraceCheckUtils]: 0: Hoare triple {12935#true} call ULTIMATE.init(); {12935#true} is VALID [2022-04-28 03:52:19,240 INFO L290 TraceCheckUtils]: 1: Hoare triple {12935#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); {12935#true} is VALID [2022-04-28 03:52:19,241 INFO L290 TraceCheckUtils]: 2: Hoare triple {12935#true} assume true; {12935#true} is VALID [2022-04-28 03:52:19,241 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {12935#true} {12935#true} #52#return; {12935#true} is VALID [2022-04-28 03:52:19,241 INFO L272 TraceCheckUtils]: 4: Hoare triple {12935#true} call #t~ret7 := main(); {12935#true} is VALID [2022-04-28 03:52:19,241 INFO L290 TraceCheckUtils]: 5: Hoare triple {12935#true} ~x~0 := 0;~y~0 := 50000;~z~0 := 0;~x~0 := 0; {12940#(<= 50000 main_~y~0)} is VALID [2022-04-28 03:52:19,241 INFO L290 TraceCheckUtils]: 6: Hoare triple {12940#(<= 50000 main_~y~0)} [128] L11-2-->L18-1_primed: Formula: (let ((.cse0 (= |v_main_#t~post4_116| |v_main_#t~post4_115|)) (.cse1 (= v_main_~x~0_748 v_main_~x~0_747))) (or (and .cse0 .cse1) (and (< v_main_~x~0_747 50001) (< v_main_~x~0_748 v_main_~x~0_747)) (and (not (< v_main_~x~0_748 50000)) .cse0 .cse1))) InVars {main_~x~0=v_main_~x~0_748, main_#t~post4=|v_main_#t~post4_116|} OutVars{main_~x~0=v_main_~x~0_747, main_#t~post4=|v_main_#t~post4_115|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {12940#(<= 50000 main_~y~0)} is VALID [2022-04-28 03:52:19,242 INFO L290 TraceCheckUtils]: 7: Hoare triple {12940#(<= 50000 main_~y~0)} [129] L18-1_primed-->L11-2: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {12940#(<= 50000 main_~y~0)} is VALID [2022-04-28 03:52:19,256 INFO L290 TraceCheckUtils]: 8: Hoare triple {12940#(<= 50000 main_~y~0)} [130] L11-2-->L18-1_primed: Formula: (let ((.cse0 (<= 50000 v_main_~x~0_750)) (.cse1 (= |v_main_#t~post6_123| |v_main_#t~post6_122|)) (.cse2 (= v_main_~y~0_747 v_main_~y~0_746)) (.cse3 (= |v_main_#t~post5_123| |v_main_#t~post5_122|))) (or (and (< v_main_~x~0_750 v_main_~x~0_749) (< v_main_~x~0_749 1000001) .cse0 (= (+ v_main_~x~0_749 v_main_~y~0_747) (+ v_main_~x~0_750 v_main_~y~0_746))) (and .cse1 .cse2 .cse3 (= v_main_~x~0_749 v_main_~x~0_750) (or (not (< v_main_~x~0_750 1000000)) (not .cse0))) (and .cse1 .cse2 .cse3 (= v_main_~x~0_750 v_main_~x~0_749)))) InVars {main_~y~0=v_main_~y~0_747, main_#t~post5=|v_main_#t~post5_123|, main_~x~0=v_main_~x~0_750, main_#t~post6=|v_main_#t~post6_123|} OutVars{main_~y~0=v_main_~y~0_746, main_#t~post5=|v_main_#t~post5_122|, main_~x~0=v_main_~x~0_749, main_#t~post6=|v_main_#t~post6_122|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {12940#(<= 50000 main_~y~0)} is VALID [2022-04-28 03:52:19,256 INFO L290 TraceCheckUtils]: 9: Hoare triple {12940#(<= 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[] {12940#(<= 50000 main_~y~0)} is VALID [2022-04-28 03:52:19,256 INFO L290 TraceCheckUtils]: 10: Hoare triple {12940#(<= 50000 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {12941#(<= 49998 main_~y~0)} is VALID [2022-04-28 03:52:19,257 INFO L290 TraceCheckUtils]: 11: Hoare triple {12941#(<= 49998 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {12942#(<= 49996 main_~y~0)} is VALID [2022-04-28 03:52:19,257 INFO L290 TraceCheckUtils]: 12: Hoare triple {12942#(<= 49996 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {12943#(<= 49994 main_~y~0)} is VALID [2022-04-28 03:52:19,258 INFO L290 TraceCheckUtils]: 13: Hoare triple {12943#(<= 49994 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {12944#(<= 49992 main_~y~0)} is VALID [2022-04-28 03:52:19,258 INFO L290 TraceCheckUtils]: 14: Hoare triple {12944#(<= 49992 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {12945#(<= 49990 main_~y~0)} is VALID [2022-04-28 03:52:19,258 INFO L290 TraceCheckUtils]: 15: Hoare triple {12945#(<= 49990 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {12946#(<= 49988 main_~y~0)} is VALID [2022-04-28 03:52:19,259 INFO L290 TraceCheckUtils]: 16: Hoare triple {12946#(<= 49988 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {12947#(<= 49986 main_~y~0)} is VALID [2022-04-28 03:52:19,259 INFO L290 TraceCheckUtils]: 17: Hoare triple {12947#(<= 49986 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {12948#(<= 49984 main_~y~0)} is VALID [2022-04-28 03:52:19,260 INFO L290 TraceCheckUtils]: 18: Hoare triple {12948#(<= 49984 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {12949#(<= 49982 main_~y~0)} is VALID [2022-04-28 03:52:19,260 INFO L290 TraceCheckUtils]: 19: Hoare triple {12949#(<= 49982 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {12950#(<= 49980 main_~y~0)} is VALID [2022-04-28 03:52:19,261 INFO L290 TraceCheckUtils]: 20: Hoare triple {12950#(<= 49980 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {12951#(<= 49978 main_~y~0)} is VALID [2022-04-28 03:52:19,261 INFO L290 TraceCheckUtils]: 21: Hoare triple {12951#(<= 49978 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {12952#(<= 49976 main_~y~0)} is VALID [2022-04-28 03:52:19,261 INFO L290 TraceCheckUtils]: 22: Hoare triple {12952#(<= 49976 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {12953#(<= 49974 main_~y~0)} is VALID [2022-04-28 03:52:19,262 INFO L290 TraceCheckUtils]: 23: Hoare triple {12953#(<= 49974 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {12954#(<= 49972 main_~y~0)} is VALID [2022-04-28 03:52:19,262 INFO L290 TraceCheckUtils]: 24: Hoare triple {12954#(<= 49972 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {12955#(<= 49970 main_~y~0)} is VALID [2022-04-28 03:52:19,263 INFO L290 TraceCheckUtils]: 25: Hoare triple {12955#(<= 49970 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {12956#(<= 49968 main_~y~0)} is VALID [2022-04-28 03:52:19,263 INFO L290 TraceCheckUtils]: 26: Hoare triple {12956#(<= 49968 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {12957#(<= 49966 main_~y~0)} is VALID [2022-04-28 03:52:19,264 INFO L290 TraceCheckUtils]: 27: Hoare triple {12957#(<= 49966 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {12958#(<= 49964 main_~y~0)} is VALID [2022-04-28 03:52:19,266 INFO L290 TraceCheckUtils]: 28: Hoare triple {12958#(<= 49964 main_~y~0)} assume !(~y~0 > 0); {12936#false} is VALID [2022-04-28 03:52:19,266 INFO L272 TraceCheckUtils]: 29: Hoare triple {12936#false} call __VERIFIER_assert((if ~z~0 == ~x~0 then 1 else 0)); {12936#false} is VALID [2022-04-28 03:52:19,266 INFO L290 TraceCheckUtils]: 30: Hoare triple {12936#false} ~cond := #in~cond; {12936#false} is VALID [2022-04-28 03:52:19,266 INFO L290 TraceCheckUtils]: 31: Hoare triple {12936#false} assume 0 == ~cond; {12936#false} is VALID [2022-04-28 03:52:19,266 INFO L290 TraceCheckUtils]: 32: Hoare triple {12936#false} assume !false; {12936#false} is VALID [2022-04-28 03:52:19,266 INFO L134 CoverageAnalysis]: Checked inductivity of 173 backedges. 0 proven. 171 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-04-28 03:52:19,266 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 03:52:19,942 INFO L290 TraceCheckUtils]: 32: Hoare triple {12936#false} assume !false; {12936#false} is VALID [2022-04-28 03:52:19,942 INFO L290 TraceCheckUtils]: 31: Hoare triple {12936#false} assume 0 == ~cond; {12936#false} is VALID [2022-04-28 03:52:19,942 INFO L290 TraceCheckUtils]: 30: Hoare triple {12936#false} ~cond := #in~cond; {12936#false} is VALID [2022-04-28 03:52:19,942 INFO L272 TraceCheckUtils]: 29: Hoare triple {12936#false} call __VERIFIER_assert((if ~z~0 == ~x~0 then 1 else 0)); {12936#false} is VALID [2022-04-28 03:52:19,944 INFO L290 TraceCheckUtils]: 28: Hoare triple {13071#(< 0 main_~y~0)} assume !(~y~0 > 0); {12936#false} is VALID [2022-04-28 03:52:19,945 INFO L290 TraceCheckUtils]: 27: Hoare triple {13075#(< 2 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {13071#(< 0 main_~y~0)} is VALID [2022-04-28 03:52:19,945 INFO L290 TraceCheckUtils]: 26: Hoare triple {13079#(< 4 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {13075#(< 2 main_~y~0)} is VALID [2022-04-28 03:52:19,945 INFO L290 TraceCheckUtils]: 25: Hoare triple {13083#(< 6 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {13079#(< 4 main_~y~0)} is VALID [2022-04-28 03:52:19,946 INFO L290 TraceCheckUtils]: 24: Hoare triple {13087#(< 8 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {13083#(< 6 main_~y~0)} is VALID [2022-04-28 03:52:19,946 INFO L290 TraceCheckUtils]: 23: Hoare triple {13091#(< 10 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {13087#(< 8 main_~y~0)} is VALID [2022-04-28 03:52:19,947 INFO L290 TraceCheckUtils]: 22: Hoare triple {13095#(< 12 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {13091#(< 10 main_~y~0)} is VALID [2022-04-28 03:52:19,947 INFO L290 TraceCheckUtils]: 21: Hoare triple {13099#(< 14 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {13095#(< 12 main_~y~0)} is VALID [2022-04-28 03:52:19,947 INFO L290 TraceCheckUtils]: 20: Hoare triple {13103#(< 16 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {13099#(< 14 main_~y~0)} is VALID [2022-04-28 03:52:19,948 INFO L290 TraceCheckUtils]: 19: Hoare triple {13107#(< 18 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {13103#(< 16 main_~y~0)} is VALID [2022-04-28 03:52:19,948 INFO L290 TraceCheckUtils]: 18: Hoare triple {13111#(< 20 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {13107#(< 18 main_~y~0)} is VALID [2022-04-28 03:52:19,949 INFO L290 TraceCheckUtils]: 17: Hoare triple {13115#(< 22 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {13111#(< 20 main_~y~0)} is VALID [2022-04-28 03:52:19,949 INFO L290 TraceCheckUtils]: 16: Hoare triple {13119#(< 24 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {13115#(< 22 main_~y~0)} is VALID [2022-04-28 03:52:19,949 INFO L290 TraceCheckUtils]: 15: Hoare triple {13123#(< 26 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {13119#(< 24 main_~y~0)} is VALID [2022-04-28 03:52:19,950 INFO L290 TraceCheckUtils]: 14: Hoare triple {13127#(< 28 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {13123#(< 26 main_~y~0)} is VALID [2022-04-28 03:52:19,950 INFO L290 TraceCheckUtils]: 13: Hoare triple {13131#(< 30 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {13127#(< 28 main_~y~0)} is VALID [2022-04-28 03:52:19,951 INFO L290 TraceCheckUtils]: 12: Hoare triple {13135#(< 32 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {13131#(< 30 main_~y~0)} is VALID [2022-04-28 03:52:19,951 INFO L290 TraceCheckUtils]: 11: Hoare triple {13139#(< 34 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {13135#(< 32 main_~y~0)} is VALID [2022-04-28 03:52:19,952 INFO L290 TraceCheckUtils]: 10: Hoare triple {13143#(< 36 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {13139#(< 34 main_~y~0)} is VALID [2022-04-28 03:52:19,952 INFO L290 TraceCheckUtils]: 9: Hoare triple {13143#(< 36 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[] {13143#(< 36 main_~y~0)} is VALID [2022-04-28 03:52:19,953 INFO L290 TraceCheckUtils]: 8: Hoare triple {13143#(< 36 main_~y~0)} [130] L11-2-->L18-1_primed: Formula: (let ((.cse0 (<= 50000 v_main_~x~0_750)) (.cse1 (= |v_main_#t~post6_123| |v_main_#t~post6_122|)) (.cse2 (= v_main_~y~0_747 v_main_~y~0_746)) (.cse3 (= |v_main_#t~post5_123| |v_main_#t~post5_122|))) (or (and (< v_main_~x~0_750 v_main_~x~0_749) (< v_main_~x~0_749 1000001) .cse0 (= (+ v_main_~x~0_749 v_main_~y~0_747) (+ v_main_~x~0_750 v_main_~y~0_746))) (and .cse1 .cse2 .cse3 (= v_main_~x~0_749 v_main_~x~0_750) (or (not (< v_main_~x~0_750 1000000)) (not .cse0))) (and .cse1 .cse2 .cse3 (= v_main_~x~0_750 v_main_~x~0_749)))) InVars {main_~y~0=v_main_~y~0_747, main_#t~post5=|v_main_#t~post5_123|, main_~x~0=v_main_~x~0_750, main_#t~post6=|v_main_#t~post6_123|} OutVars{main_~y~0=v_main_~y~0_746, main_#t~post5=|v_main_#t~post5_122|, main_~x~0=v_main_~x~0_749, main_#t~post6=|v_main_#t~post6_122|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {13143#(< 36 main_~y~0)} is VALID [2022-04-28 03:52:19,953 INFO L290 TraceCheckUtils]: 7: Hoare triple {13143#(< 36 main_~y~0)} [129] L18-1_primed-->L11-2: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {13143#(< 36 main_~y~0)} is VALID [2022-04-28 03:52:19,953 INFO L290 TraceCheckUtils]: 6: Hoare triple {13143#(< 36 main_~y~0)} [128] L11-2-->L18-1_primed: Formula: (let ((.cse0 (= |v_main_#t~post4_116| |v_main_#t~post4_115|)) (.cse1 (= v_main_~x~0_748 v_main_~x~0_747))) (or (and .cse0 .cse1) (and (< v_main_~x~0_747 50001) (< v_main_~x~0_748 v_main_~x~0_747)) (and (not (< v_main_~x~0_748 50000)) .cse0 .cse1))) InVars {main_~x~0=v_main_~x~0_748, main_#t~post4=|v_main_#t~post4_116|} OutVars{main_~x~0=v_main_~x~0_747, main_#t~post4=|v_main_#t~post4_115|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {13143#(< 36 main_~y~0)} is VALID [2022-04-28 03:52:19,954 INFO L290 TraceCheckUtils]: 5: Hoare triple {12935#true} ~x~0 := 0;~y~0 := 50000;~z~0 := 0;~x~0 := 0; {13143#(< 36 main_~y~0)} is VALID [2022-04-28 03:52:19,954 INFO L272 TraceCheckUtils]: 4: Hoare triple {12935#true} call #t~ret7 := main(); {12935#true} is VALID [2022-04-28 03:52:19,954 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {12935#true} {12935#true} #52#return; {12935#true} is VALID [2022-04-28 03:52:19,954 INFO L290 TraceCheckUtils]: 2: Hoare triple {12935#true} assume true; {12935#true} is VALID [2022-04-28 03:52:19,954 INFO L290 TraceCheckUtils]: 1: Hoare triple {12935#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); {12935#true} is VALID [2022-04-28 03:52:19,954 INFO L272 TraceCheckUtils]: 0: Hoare triple {12935#true} call ULTIMATE.init(); {12935#true} is VALID [2022-04-28 03:52:19,954 INFO L134 CoverageAnalysis]: Checked inductivity of 173 backedges. 0 proven. 171 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-04-28 03:52:19,954 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [182727695] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 03:52:19,954 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 03:52:19,954 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 21, 21] total 41 [2022-04-28 03:52:21,111 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 03:52:21,111 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [132740608] [2022-04-28 03:52:21,112 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [132740608] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 03:52:21,112 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 03:52:21,112 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [58] imperfect sequences [] total 58 [2022-04-28 03:52:21,112 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [62214114] [2022-04-28 03:52:21,112 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 03:52:21,112 INFO L78 Accepts]: Start accepts. Automaton has has 58 states, 58 states have (on average 1.6551724137931034) internal successors, (96), 57 states have internal predecessors, (96), 2 states have call successors, (3), 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 100 [2022-04-28 03:52:21,112 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 03:52:21,112 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 58 states, 58 states have (on average 1.6551724137931034) internal successors, (96), 57 states have internal predecessors, (96), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:52:21,178 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 100 edges. 100 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 03:52:21,178 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 58 states [2022-04-28 03:52:21,178 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 03:52:21,179 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 58 interpolants. [2022-04-28 03:52:21,180 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=2257, Invalid=3595, Unknown=0, NotChecked=0, Total=5852 [2022-04-28 03:52:21,180 INFO L87 Difference]: Start difference. First operand 101 states and 104 transitions. Second operand has 58 states, 58 states have (on average 1.6551724137931034) internal successors, (96), 57 states have internal predecessors, (96), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:52:26,618 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:52:26,618 INFO L93 Difference]: Finished difference Result 199 states and 210 transitions. [2022-04-28 03:52:26,618 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 58 states. [2022-04-28 03:52:26,618 INFO L78 Accepts]: Start accepts. Automaton has has 58 states, 58 states have (on average 1.6551724137931034) internal successors, (96), 57 states have internal predecessors, (96), 2 states have call successors, (3), 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 100 [2022-04-28 03:52:26,618 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 03:52:26,618 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 58 states, 58 states have (on average 1.6551724137931034) internal successors, (96), 57 states have internal predecessors, (96), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:52:26,619 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 122 transitions. [2022-04-28 03:52:26,619 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 58 states, 58 states have (on average 1.6551724137931034) internal successors, (96), 57 states have internal predecessors, (96), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:52:26,620 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 122 transitions. [2022-04-28 03:52:26,627 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 58 states and 122 transitions. [2022-04-28 03:52:26,723 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 122 edges. 122 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 03:52:26,724 INFO L225 Difference]: With dead ends: 199 [2022-04-28 03:52:26,724 INFO L226 Difference]: Without dead ends: 106 [2022-04-28 03:52:26,725 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 219 GetRequests, 88 SyntacticMatches, 1 SemanticMatches, 130 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4924 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=5302, Invalid=11990, Unknown=0, NotChecked=0, Total=17292 [2022-04-28 03:52:26,725 INFO L413 NwaCegarLoop]: 12 mSDtfsCounter, 235 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 2609 mSolverCounterSat, 295 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 235 SdHoareTripleChecker+Valid, 34 SdHoareTripleChecker+Invalid, 2904 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 295 IncrementalHoareTripleChecker+Valid, 2609 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.1s IncrementalHoareTripleChecker+Time [2022-04-28 03:52:26,725 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [235 Valid, 34 Invalid, 2904 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [295 Valid, 2609 Invalid, 0 Unknown, 0 Unchecked, 2.1s Time] [2022-04-28 03:52:26,726 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states. [2022-04-28 03:52:26,871 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 106. [2022-04-28 03:52:26,871 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 03:52:26,871 INFO L82 GeneralOperation]: Start isEquivalent. First operand 106 states. Second operand has 106 states, 101 states have (on average 1.0396039603960396) internal successors, (105), 101 states have internal predecessors, (105), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:52:26,871 INFO L74 IsIncluded]: Start isIncluded. First operand 106 states. Second operand has 106 states, 101 states have (on average 1.0396039603960396) internal successors, (105), 101 states have internal predecessors, (105), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:52:26,871 INFO L87 Difference]: Start difference. First operand 106 states. Second operand has 106 states, 101 states have (on average 1.0396039603960396) internal successors, (105), 101 states have internal predecessors, (105), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:52:26,872 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:52:26,873 INFO L93 Difference]: Finished difference Result 106 states and 109 transitions. [2022-04-28 03:52:26,873 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 109 transitions. [2022-04-28 03:52:26,873 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:52:26,873 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:52:26,873 INFO L74 IsIncluded]: Start isIncluded. First operand has 106 states, 101 states have (on average 1.0396039603960396) internal successors, (105), 101 states have internal predecessors, (105), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 106 states. [2022-04-28 03:52:26,873 INFO L87 Difference]: Start difference. First operand has 106 states, 101 states have (on average 1.0396039603960396) internal successors, (105), 101 states have internal predecessors, (105), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 106 states. [2022-04-28 03:52:26,874 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:52:26,874 INFO L93 Difference]: Finished difference Result 106 states and 109 transitions. [2022-04-28 03:52:26,874 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 109 transitions. [2022-04-28 03:52:26,874 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:52:26,874 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:52:26,874 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 03:52:26,874 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 03:52:26,874 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 106 states, 101 states have (on average 1.0396039603960396) internal successors, (105), 101 states have internal predecessors, (105), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:52:26,875 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 109 transitions. [2022-04-28 03:52:26,875 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 109 transitions. Word has length 100 [2022-04-28 03:52:26,876 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 03:52:26,876 INFO L495 AbstractCegarLoop]: Abstraction has 106 states and 109 transitions. [2022-04-28 03:52:26,876 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 58 states, 58 states have (on average 1.6551724137931034) internal successors, (96), 57 states have internal predecessors, (96), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:52:26,876 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 106 states and 109 transitions. [2022-04-28 03:52:26,978 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 109 edges. 109 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 03:52:26,979 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 109 transitions. [2022-04-28 03:52:26,979 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2022-04-28 03:52:26,979 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 03:52:26,979 INFO L195 NwaCegarLoop]: trace histogram [37, 36, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 03:52:27,001 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Forceful destruction successful, exit code 0 [2022-04-28 03:52:27,180 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20,19 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 03:52:27,180 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 03:52:27,180 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 03:52:27,180 INFO L85 PathProgramCache]: Analyzing trace with hash -2000419243, now seen corresponding path program 19 times [2022-04-28 03:52:27,180 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 03:52:27,180 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [996045144] [2022-04-28 03:52:27,278 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 1 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 03:52:27,468 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={1=1, 2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 03:52:27,469 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-28 03:52:27,471 INFO L85 PathProgramCache]: Analyzing trace with hash 438695778, now seen corresponding path program 1 times [2022-04-28 03:52:27,471 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 03:52:27,471 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1976599566] [2022-04-28 03:52:27,471 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:52:27,472 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 03:52:27,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:52:27,725 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 03:52:27,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:52:27,729 INFO L290 TraceCheckUtils]: 0: Hoare triple {14169#(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); {14144#true} is VALID [2022-04-28 03:52:27,729 INFO L290 TraceCheckUtils]: 1: Hoare triple {14144#true} assume true; {14144#true} is VALID [2022-04-28 03:52:27,729 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {14144#true} {14144#true} #52#return; {14144#true} is VALID [2022-04-28 03:52:27,730 INFO L272 TraceCheckUtils]: 0: Hoare triple {14144#true} call ULTIMATE.init(); {14169#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 03:52:27,730 INFO L290 TraceCheckUtils]: 1: Hoare triple {14169#(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); {14144#true} is VALID [2022-04-28 03:52:27,730 INFO L290 TraceCheckUtils]: 2: Hoare triple {14144#true} assume true; {14144#true} is VALID [2022-04-28 03:52:27,730 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {14144#true} {14144#true} #52#return; {14144#true} is VALID [2022-04-28 03:52:27,730 INFO L272 TraceCheckUtils]: 4: Hoare triple {14144#true} call #t~ret7 := main(); {14144#true} is VALID [2022-04-28 03:52:27,730 INFO L290 TraceCheckUtils]: 5: Hoare triple {14144#true} ~x~0 := 0;~y~0 := 50000;~z~0 := 0;~x~0 := 0; {14149#(<= 50000 main_~y~0)} is VALID [2022-04-28 03:52:27,731 INFO L290 TraceCheckUtils]: 6: Hoare triple {14149#(<= 50000 main_~y~0)} [132] L11-2-->L18-1_primed: Formula: (let ((.cse0 (= v_main_~x~0_817 v_main_~x~0_816)) (.cse1 (= |v_main_#t~post4_122| |v_main_#t~post4_121|))) (or (and .cse0 .cse1) (and (< v_main_~x~0_817 v_main_~x~0_816) (< v_main_~x~0_816 50001)) (and .cse0 (not (< v_main_~x~0_817 50000)) .cse1))) InVars {main_~x~0=v_main_~x~0_817, main_#t~post4=|v_main_#t~post4_122|} OutVars{main_~x~0=v_main_~x~0_816, main_#t~post4=|v_main_#t~post4_121|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {14149#(<= 50000 main_~y~0)} is VALID [2022-04-28 03:52:27,731 INFO L290 TraceCheckUtils]: 7: Hoare triple {14149#(<= 50000 main_~y~0)} [133] L18-1_primed-->L11-2: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {14149#(<= 50000 main_~y~0)} is VALID [2022-04-28 03:52:27,732 INFO L290 TraceCheckUtils]: 8: Hoare triple {14149#(<= 50000 main_~y~0)} [134] L11-2-->L18-1_primed: Formula: (let ((.cse0 (= v_main_~y~0_826 v_main_~y~0_825)) (.cse1 (= v_main_~x~0_819 v_main_~x~0_818)) (.cse2 (= |v_main_#t~post5_130| |v_main_#t~post5_129|)) (.cse3 (= |v_main_#t~post6_130| |v_main_#t~post6_129|)) (.cse4 (<= 50000 v_main_~x~0_819))) (or (and .cse0 .cse1 .cse2 .cse3) (and .cse0 (or (not .cse4) (not (< v_main_~x~0_819 1000000))) .cse1 .cse2 .cse3) (and (= (+ v_main_~x~0_819 v_main_~y~0_825) (+ v_main_~x~0_818 v_main_~y~0_826)) (< v_main_~x~0_819 v_main_~x~0_818) .cse4 (< v_main_~x~0_818 1000001)))) InVars {main_~y~0=v_main_~y~0_826, main_#t~post5=|v_main_#t~post5_130|, main_~x~0=v_main_~x~0_819, main_#t~post6=|v_main_#t~post6_130|} OutVars{main_~y~0=v_main_~y~0_825, main_#t~post5=|v_main_#t~post5_129|, main_~x~0=v_main_~x~0_818, main_#t~post6=|v_main_#t~post6_129|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {14149#(<= 50000 main_~y~0)} is VALID [2022-04-28 03:52:27,732 INFO L290 TraceCheckUtils]: 9: Hoare triple {14149#(<= 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[] {14149#(<= 50000 main_~y~0)} is VALID [2022-04-28 03:52:27,733 INFO L290 TraceCheckUtils]: 10: Hoare triple {14149#(<= 50000 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {14150#(<= 49998 main_~y~0)} is VALID [2022-04-28 03:52:27,734 INFO L290 TraceCheckUtils]: 11: Hoare triple {14150#(<= 49998 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {14151#(<= 49996 main_~y~0)} is VALID [2022-04-28 03:52:27,734 INFO L290 TraceCheckUtils]: 12: Hoare triple {14151#(<= 49996 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {14152#(<= 49994 main_~y~0)} is VALID [2022-04-28 03:52:27,735 INFO L290 TraceCheckUtils]: 13: Hoare triple {14152#(<= 49994 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {14153#(<= 49992 main_~y~0)} is VALID [2022-04-28 03:52:27,735 INFO L290 TraceCheckUtils]: 14: Hoare triple {14153#(<= 49992 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {14154#(<= 49990 main_~y~0)} is VALID [2022-04-28 03:52:27,736 INFO L290 TraceCheckUtils]: 15: Hoare triple {14154#(<= 49990 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {14155#(<= 49988 main_~y~0)} is VALID [2022-04-28 03:52:27,736 INFO L290 TraceCheckUtils]: 16: Hoare triple {14155#(<= 49988 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {14156#(<= 49986 main_~y~0)} is VALID [2022-04-28 03:52:27,736 INFO L290 TraceCheckUtils]: 17: Hoare triple {14156#(<= 49986 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {14157#(<= 49984 main_~y~0)} is VALID [2022-04-28 03:52:27,737 INFO L290 TraceCheckUtils]: 18: Hoare triple {14157#(<= 49984 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {14158#(<= 49982 main_~y~0)} is VALID [2022-04-28 03:52:27,737 INFO L290 TraceCheckUtils]: 19: Hoare triple {14158#(<= 49982 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {14159#(<= 49980 main_~y~0)} is VALID [2022-04-28 03:52:27,738 INFO L290 TraceCheckUtils]: 20: Hoare triple {14159#(<= 49980 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {14160#(<= 49978 main_~y~0)} is VALID [2022-04-28 03:52:27,738 INFO L290 TraceCheckUtils]: 21: Hoare triple {14160#(<= 49978 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {14161#(<= 49976 main_~y~0)} is VALID [2022-04-28 03:52:27,739 INFO L290 TraceCheckUtils]: 22: Hoare triple {14161#(<= 49976 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {14162#(<= 49974 main_~y~0)} is VALID [2022-04-28 03:52:27,739 INFO L290 TraceCheckUtils]: 23: Hoare triple {14162#(<= 49974 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {14163#(<= 49972 main_~y~0)} is VALID [2022-04-28 03:52:27,740 INFO L290 TraceCheckUtils]: 24: Hoare triple {14163#(<= 49972 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {14164#(<= 49970 main_~y~0)} is VALID [2022-04-28 03:52:27,740 INFO L290 TraceCheckUtils]: 25: Hoare triple {14164#(<= 49970 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {14165#(<= 49968 main_~y~0)} is VALID [2022-04-28 03:52:27,741 INFO L290 TraceCheckUtils]: 26: Hoare triple {14165#(<= 49968 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {14166#(<= 49966 main_~y~0)} is VALID [2022-04-28 03:52:27,741 INFO L290 TraceCheckUtils]: 27: Hoare triple {14166#(<= 49966 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {14167#(<= 49964 main_~y~0)} is VALID [2022-04-28 03:52:27,742 INFO L290 TraceCheckUtils]: 28: Hoare triple {14167#(<= 49964 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {14168#(<= 49962 main_~y~0)} is VALID [2022-04-28 03:52:27,742 INFO L290 TraceCheckUtils]: 29: Hoare triple {14168#(<= 49962 main_~y~0)} assume !(~y~0 > 0); {14145#false} is VALID [2022-04-28 03:52:27,743 INFO L272 TraceCheckUtils]: 30: Hoare triple {14145#false} call __VERIFIER_assert((if ~z~0 == ~x~0 then 1 else 0)); {14145#false} is VALID [2022-04-28 03:52:27,743 INFO L290 TraceCheckUtils]: 31: Hoare triple {14145#false} ~cond := #in~cond; {14145#false} is VALID [2022-04-28 03:52:27,743 INFO L290 TraceCheckUtils]: 32: Hoare triple {14145#false} assume 0 == ~cond; {14145#false} is VALID [2022-04-28 03:52:27,743 INFO L290 TraceCheckUtils]: 33: Hoare triple {14145#false} assume !false; {14145#false} is VALID [2022-04-28 03:52:27,743 INFO L134 CoverageAnalysis]: Checked inductivity of 192 backedges. 0 proven. 190 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-04-28 03:52:27,743 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 03:52:27,743 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1976599566] [2022-04-28 03:52:27,744 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1976599566] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 03:52:27,744 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1789875261] [2022-04-28 03:52:27,744 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:52:27,744 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 03:52:27,744 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 03:52:27,745 INFO L229 MonitoredProcess]: Starting monitored process 20 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 03:52:27,781 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Waiting until timeout for monitored process [2022-04-28 03:52:27,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:52:27,816 INFO L263 TraceCheckSpWp]: Trace formula consists of 154 conjuncts, 22 conjunts are in the unsatisfiable core [2022-04-28 03:52:27,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:52:27,829 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 03:52:28,217 INFO L272 TraceCheckUtils]: 0: Hoare triple {14144#true} call ULTIMATE.init(); {14144#true} is VALID [2022-04-28 03:52:28,217 INFO L290 TraceCheckUtils]: 1: Hoare triple {14144#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); {14144#true} is VALID [2022-04-28 03:52:28,217 INFO L290 TraceCheckUtils]: 2: Hoare triple {14144#true} assume true; {14144#true} is VALID [2022-04-28 03:52:28,217 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {14144#true} {14144#true} #52#return; {14144#true} is VALID [2022-04-28 03:52:28,217 INFO L272 TraceCheckUtils]: 4: Hoare triple {14144#true} call #t~ret7 := main(); {14144#true} is VALID [2022-04-28 03:52:28,218 INFO L290 TraceCheckUtils]: 5: Hoare triple {14144#true} ~x~0 := 0;~y~0 := 50000;~z~0 := 0;~x~0 := 0; {14149#(<= 50000 main_~y~0)} is VALID [2022-04-28 03:52:28,218 INFO L290 TraceCheckUtils]: 6: Hoare triple {14149#(<= 50000 main_~y~0)} [132] L11-2-->L18-1_primed: Formula: (let ((.cse0 (= v_main_~x~0_817 v_main_~x~0_816)) (.cse1 (= |v_main_#t~post4_122| |v_main_#t~post4_121|))) (or (and .cse0 .cse1) (and (< v_main_~x~0_817 v_main_~x~0_816) (< v_main_~x~0_816 50001)) (and .cse0 (not (< v_main_~x~0_817 50000)) .cse1))) InVars {main_~x~0=v_main_~x~0_817, main_#t~post4=|v_main_#t~post4_122|} OutVars{main_~x~0=v_main_~x~0_816, main_#t~post4=|v_main_#t~post4_121|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {14149#(<= 50000 main_~y~0)} is VALID [2022-04-28 03:52:28,218 INFO L290 TraceCheckUtils]: 7: Hoare triple {14149#(<= 50000 main_~y~0)} [133] L18-1_primed-->L11-2: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {14149#(<= 50000 main_~y~0)} is VALID [2022-04-28 03:52:28,219 INFO L290 TraceCheckUtils]: 8: Hoare triple {14149#(<= 50000 main_~y~0)} [134] L11-2-->L18-1_primed: Formula: (let ((.cse0 (= v_main_~y~0_826 v_main_~y~0_825)) (.cse1 (= v_main_~x~0_819 v_main_~x~0_818)) (.cse2 (= |v_main_#t~post5_130| |v_main_#t~post5_129|)) (.cse3 (= |v_main_#t~post6_130| |v_main_#t~post6_129|)) (.cse4 (<= 50000 v_main_~x~0_819))) (or (and .cse0 .cse1 .cse2 .cse3) (and .cse0 (or (not .cse4) (not (< v_main_~x~0_819 1000000))) .cse1 .cse2 .cse3) (and (= (+ v_main_~x~0_819 v_main_~y~0_825) (+ v_main_~x~0_818 v_main_~y~0_826)) (< v_main_~x~0_819 v_main_~x~0_818) .cse4 (< v_main_~x~0_818 1000001)))) InVars {main_~y~0=v_main_~y~0_826, main_#t~post5=|v_main_#t~post5_130|, main_~x~0=v_main_~x~0_819, main_#t~post6=|v_main_#t~post6_130|} OutVars{main_~y~0=v_main_~y~0_825, main_#t~post5=|v_main_#t~post5_129|, main_~x~0=v_main_~x~0_818, main_#t~post6=|v_main_#t~post6_129|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {14149#(<= 50000 main_~y~0)} is VALID [2022-04-28 03:52:28,220 INFO L290 TraceCheckUtils]: 9: Hoare triple {14149#(<= 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[] {14149#(<= 50000 main_~y~0)} is VALID [2022-04-28 03:52:28,220 INFO L290 TraceCheckUtils]: 10: Hoare triple {14149#(<= 50000 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {14150#(<= 49998 main_~y~0)} is VALID [2022-04-28 03:52:28,221 INFO L290 TraceCheckUtils]: 11: Hoare triple {14150#(<= 49998 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {14151#(<= 49996 main_~y~0)} is VALID [2022-04-28 03:52:28,221 INFO L290 TraceCheckUtils]: 12: Hoare triple {14151#(<= 49996 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {14152#(<= 49994 main_~y~0)} is VALID [2022-04-28 03:52:28,222 INFO L290 TraceCheckUtils]: 13: Hoare triple {14152#(<= 49994 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {14153#(<= 49992 main_~y~0)} is VALID [2022-04-28 03:52:28,222 INFO L290 TraceCheckUtils]: 14: Hoare triple {14153#(<= 49992 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {14154#(<= 49990 main_~y~0)} is VALID [2022-04-28 03:52:28,223 INFO L290 TraceCheckUtils]: 15: Hoare triple {14154#(<= 49990 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {14155#(<= 49988 main_~y~0)} is VALID [2022-04-28 03:52:28,223 INFO L290 TraceCheckUtils]: 16: Hoare triple {14155#(<= 49988 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {14156#(<= 49986 main_~y~0)} is VALID [2022-04-28 03:52:28,224 INFO L290 TraceCheckUtils]: 17: Hoare triple {14156#(<= 49986 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {14157#(<= 49984 main_~y~0)} is VALID [2022-04-28 03:52:28,224 INFO L290 TraceCheckUtils]: 18: Hoare triple {14157#(<= 49984 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {14158#(<= 49982 main_~y~0)} is VALID [2022-04-28 03:52:28,225 INFO L290 TraceCheckUtils]: 19: Hoare triple {14158#(<= 49982 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {14159#(<= 49980 main_~y~0)} is VALID [2022-04-28 03:52:28,225 INFO L290 TraceCheckUtils]: 20: Hoare triple {14159#(<= 49980 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {14160#(<= 49978 main_~y~0)} is VALID [2022-04-28 03:52:28,225 INFO L290 TraceCheckUtils]: 21: Hoare triple {14160#(<= 49978 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {14161#(<= 49976 main_~y~0)} is VALID [2022-04-28 03:52:28,226 INFO L290 TraceCheckUtils]: 22: Hoare triple {14161#(<= 49976 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {14162#(<= 49974 main_~y~0)} is VALID [2022-04-28 03:52:28,226 INFO L290 TraceCheckUtils]: 23: Hoare triple {14162#(<= 49974 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {14163#(<= 49972 main_~y~0)} is VALID [2022-04-28 03:52:28,227 INFO L290 TraceCheckUtils]: 24: Hoare triple {14163#(<= 49972 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {14164#(<= 49970 main_~y~0)} is VALID [2022-04-28 03:52:28,227 INFO L290 TraceCheckUtils]: 25: Hoare triple {14164#(<= 49970 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {14165#(<= 49968 main_~y~0)} is VALID [2022-04-28 03:52:28,228 INFO L290 TraceCheckUtils]: 26: Hoare triple {14165#(<= 49968 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {14166#(<= 49966 main_~y~0)} is VALID [2022-04-28 03:52:28,228 INFO L290 TraceCheckUtils]: 27: Hoare triple {14166#(<= 49966 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {14167#(<= 49964 main_~y~0)} is VALID [2022-04-28 03:52:28,229 INFO L290 TraceCheckUtils]: 28: Hoare triple {14167#(<= 49964 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {14168#(<= 49962 main_~y~0)} is VALID [2022-04-28 03:52:28,229 INFO L290 TraceCheckUtils]: 29: Hoare triple {14168#(<= 49962 main_~y~0)} assume !(~y~0 > 0); {14145#false} is VALID [2022-04-28 03:52:28,229 INFO L272 TraceCheckUtils]: 30: Hoare triple {14145#false} call __VERIFIER_assert((if ~z~0 == ~x~0 then 1 else 0)); {14145#false} is VALID [2022-04-28 03:52:28,229 INFO L290 TraceCheckUtils]: 31: Hoare triple {14145#false} ~cond := #in~cond; {14145#false} is VALID [2022-04-28 03:52:28,229 INFO L290 TraceCheckUtils]: 32: Hoare triple {14145#false} assume 0 == ~cond; {14145#false} is VALID [2022-04-28 03:52:28,229 INFO L290 TraceCheckUtils]: 33: Hoare triple {14145#false} assume !false; {14145#false} is VALID [2022-04-28 03:52:28,230 INFO L134 CoverageAnalysis]: Checked inductivity of 192 backedges. 0 proven. 190 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-04-28 03:52:28,230 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 03:52:28,982 INFO L290 TraceCheckUtils]: 33: Hoare triple {14145#false} assume !false; {14145#false} is VALID [2022-04-28 03:52:28,982 INFO L290 TraceCheckUtils]: 32: Hoare triple {14145#false} assume 0 == ~cond; {14145#false} is VALID [2022-04-28 03:52:28,982 INFO L290 TraceCheckUtils]: 31: Hoare triple {14145#false} ~cond := #in~cond; {14145#false} is VALID [2022-04-28 03:52:28,982 INFO L272 TraceCheckUtils]: 30: Hoare triple {14145#false} call __VERIFIER_assert((if ~z~0 == ~x~0 then 1 else 0)); {14145#false} is VALID [2022-04-28 03:52:28,982 INFO L290 TraceCheckUtils]: 29: Hoare triple {14284#(< 0 main_~y~0)} assume !(~y~0 > 0); {14145#false} is VALID [2022-04-28 03:52:28,983 INFO L290 TraceCheckUtils]: 28: Hoare triple {14288#(< 2 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {14284#(< 0 main_~y~0)} is VALID [2022-04-28 03:52:28,983 INFO L290 TraceCheckUtils]: 27: Hoare triple {14292#(< 4 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {14288#(< 2 main_~y~0)} is VALID [2022-04-28 03:52:28,984 INFO L290 TraceCheckUtils]: 26: Hoare triple {14296#(< 6 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {14292#(< 4 main_~y~0)} is VALID [2022-04-28 03:52:28,984 INFO L290 TraceCheckUtils]: 25: Hoare triple {14300#(< 8 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {14296#(< 6 main_~y~0)} is VALID [2022-04-28 03:52:28,984 INFO L290 TraceCheckUtils]: 24: Hoare triple {14304#(< 10 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {14300#(< 8 main_~y~0)} is VALID [2022-04-28 03:52:28,985 INFO L290 TraceCheckUtils]: 23: Hoare triple {14308#(< 12 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {14304#(< 10 main_~y~0)} is VALID [2022-04-28 03:52:28,985 INFO L290 TraceCheckUtils]: 22: Hoare triple {14312#(< 14 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {14308#(< 12 main_~y~0)} is VALID [2022-04-28 03:52:28,986 INFO L290 TraceCheckUtils]: 21: Hoare triple {14316#(< 16 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {14312#(< 14 main_~y~0)} is VALID [2022-04-28 03:52:28,986 INFO L290 TraceCheckUtils]: 20: Hoare triple {14320#(< 18 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {14316#(< 16 main_~y~0)} is VALID [2022-04-28 03:52:28,987 INFO L290 TraceCheckUtils]: 19: Hoare triple {14324#(< 20 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {14320#(< 18 main_~y~0)} is VALID [2022-04-28 03:52:28,987 INFO L290 TraceCheckUtils]: 18: Hoare triple {14328#(< 22 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {14324#(< 20 main_~y~0)} is VALID [2022-04-28 03:52:28,987 INFO L290 TraceCheckUtils]: 17: Hoare triple {14332#(< 24 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {14328#(< 22 main_~y~0)} is VALID [2022-04-28 03:52:28,988 INFO L290 TraceCheckUtils]: 16: Hoare triple {14336#(< 26 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {14332#(< 24 main_~y~0)} is VALID [2022-04-28 03:52:28,988 INFO L290 TraceCheckUtils]: 15: Hoare triple {14340#(< 28 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {14336#(< 26 main_~y~0)} is VALID [2022-04-28 03:52:28,989 INFO L290 TraceCheckUtils]: 14: Hoare triple {14344#(< 30 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {14340#(< 28 main_~y~0)} is VALID [2022-04-28 03:52:28,989 INFO L290 TraceCheckUtils]: 13: Hoare triple {14348#(< 32 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {14344#(< 30 main_~y~0)} is VALID [2022-04-28 03:52:28,989 INFO L290 TraceCheckUtils]: 12: Hoare triple {14352#(< 34 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {14348#(< 32 main_~y~0)} is VALID [2022-04-28 03:52:28,990 INFO L290 TraceCheckUtils]: 11: Hoare triple {14356#(< 36 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {14352#(< 34 main_~y~0)} is VALID [2022-04-28 03:52:28,990 INFO L290 TraceCheckUtils]: 10: Hoare triple {14360#(< 38 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {14356#(< 36 main_~y~0)} is VALID [2022-04-28 03:52:28,991 INFO L290 TraceCheckUtils]: 9: Hoare triple {14360#(< 38 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[] {14360#(< 38 main_~y~0)} is VALID [2022-04-28 03:52:28,991 INFO L290 TraceCheckUtils]: 8: Hoare triple {14360#(< 38 main_~y~0)} [134] L11-2-->L18-1_primed: Formula: (let ((.cse0 (= v_main_~y~0_826 v_main_~y~0_825)) (.cse1 (= v_main_~x~0_819 v_main_~x~0_818)) (.cse2 (= |v_main_#t~post5_130| |v_main_#t~post5_129|)) (.cse3 (= |v_main_#t~post6_130| |v_main_#t~post6_129|)) (.cse4 (<= 50000 v_main_~x~0_819))) (or (and .cse0 .cse1 .cse2 .cse3) (and .cse0 (or (not .cse4) (not (< v_main_~x~0_819 1000000))) .cse1 .cse2 .cse3) (and (= (+ v_main_~x~0_819 v_main_~y~0_825) (+ v_main_~x~0_818 v_main_~y~0_826)) (< v_main_~x~0_819 v_main_~x~0_818) .cse4 (< v_main_~x~0_818 1000001)))) InVars {main_~y~0=v_main_~y~0_826, main_#t~post5=|v_main_#t~post5_130|, main_~x~0=v_main_~x~0_819, main_#t~post6=|v_main_#t~post6_130|} OutVars{main_~y~0=v_main_~y~0_825, main_#t~post5=|v_main_#t~post5_129|, main_~x~0=v_main_~x~0_818, main_#t~post6=|v_main_#t~post6_129|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {14360#(< 38 main_~y~0)} is VALID [2022-04-28 03:52:28,991 INFO L290 TraceCheckUtils]: 7: Hoare triple {14360#(< 38 main_~y~0)} [133] L18-1_primed-->L11-2: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {14360#(< 38 main_~y~0)} is VALID [2022-04-28 03:52:28,992 INFO L290 TraceCheckUtils]: 6: Hoare triple {14360#(< 38 main_~y~0)} [132] L11-2-->L18-1_primed: Formula: (let ((.cse0 (= v_main_~x~0_817 v_main_~x~0_816)) (.cse1 (= |v_main_#t~post4_122| |v_main_#t~post4_121|))) (or (and .cse0 .cse1) (and (< v_main_~x~0_817 v_main_~x~0_816) (< v_main_~x~0_816 50001)) (and .cse0 (not (< v_main_~x~0_817 50000)) .cse1))) InVars {main_~x~0=v_main_~x~0_817, main_#t~post4=|v_main_#t~post4_122|} OutVars{main_~x~0=v_main_~x~0_816, main_#t~post4=|v_main_#t~post4_121|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {14360#(< 38 main_~y~0)} is VALID [2022-04-28 03:52:28,992 INFO L290 TraceCheckUtils]: 5: Hoare triple {14144#true} ~x~0 := 0;~y~0 := 50000;~z~0 := 0;~x~0 := 0; {14360#(< 38 main_~y~0)} is VALID [2022-04-28 03:52:28,992 INFO L272 TraceCheckUtils]: 4: Hoare triple {14144#true} call #t~ret7 := main(); {14144#true} is VALID [2022-04-28 03:52:28,992 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {14144#true} {14144#true} #52#return; {14144#true} is VALID [2022-04-28 03:52:28,992 INFO L290 TraceCheckUtils]: 2: Hoare triple {14144#true} assume true; {14144#true} is VALID [2022-04-28 03:52:28,992 INFO L290 TraceCheckUtils]: 1: Hoare triple {14144#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); {14144#true} is VALID [2022-04-28 03:52:28,992 INFO L272 TraceCheckUtils]: 0: Hoare triple {14144#true} call ULTIMATE.init(); {14144#true} is VALID [2022-04-28 03:52:28,993 INFO L134 CoverageAnalysis]: Checked inductivity of 192 backedges. 0 proven. 190 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-04-28 03:52:28,993 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1789875261] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 03:52:28,993 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 03:52:28,993 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 22, 22] total 43 [2022-04-28 03:52:30,225 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 03:52:30,225 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [996045144] [2022-04-28 03:52:30,225 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [996045144] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 03:52:30,225 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 03:52:30,225 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [61] imperfect sequences [] total 61 [2022-04-28 03:52:30,225 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1077282345] [2022-04-28 03:52:30,225 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 03:52:30,226 INFO L78 Accepts]: Start accepts. Automaton has has 61 states, 61 states have (on average 1.6557377049180328) internal successors, (101), 60 states have internal predecessors, (101), 2 states have call successors, (3), 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 105 [2022-04-28 03:52:30,226 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 03:52:30,226 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 61 states, 61 states have (on average 1.6557377049180328) internal successors, (101), 60 states have internal predecessors, (101), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:52:30,297 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 105 edges. 105 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 03:52:30,297 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 61 states [2022-04-28 03:52:30,297 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 03:52:30,298 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 61 interpolants. [2022-04-28 03:52:30,298 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=2496, Invalid=3984, Unknown=0, NotChecked=0, Total=6480 [2022-04-28 03:52:30,299 INFO L87 Difference]: Start difference. First operand 106 states and 109 transitions. Second operand has 61 states, 61 states have (on average 1.6557377049180328) internal successors, (101), 60 states have internal predecessors, (101), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:52:36,033 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:52:36,033 INFO L93 Difference]: Finished difference Result 209 states and 220 transitions. [2022-04-28 03:52:36,033 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 61 states. [2022-04-28 03:52:36,033 INFO L78 Accepts]: Start accepts. Automaton has has 61 states, 61 states have (on average 1.6557377049180328) internal successors, (101), 60 states have internal predecessors, (101), 2 states have call successors, (3), 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 105 [2022-04-28 03:52:36,033 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 03:52:36,033 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 61 states, 61 states have (on average 1.6557377049180328) internal successors, (101), 60 states have internal predecessors, (101), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:52:36,035 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 127 transitions. [2022-04-28 03:52:36,035 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 61 states, 61 states have (on average 1.6557377049180328) internal successors, (101), 60 states have internal predecessors, (101), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:52:36,035 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 127 transitions. [2022-04-28 03:52:36,035 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 61 states and 127 transitions. [2022-04-28 03:52:36,175 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 127 edges. 127 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 03:52:36,176 INFO L225 Difference]: With dead ends: 209 [2022-04-28 03:52:36,176 INFO L226 Difference]: Without dead ends: 111 [2022-04-28 03:52:36,177 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 229 GetRequests, 91 SyntacticMatches, 1 SemanticMatches, 137 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5473 ImplicationChecksByTransitivity, 2.7s TimeCoverageRelationStatistics Valid=5862, Invalid=13320, Unknown=0, NotChecked=0, Total=19182 [2022-04-28 03:52:36,178 INFO L413 NwaCegarLoop]: 12 mSDtfsCounter, 167 mSDsluCounter, 32 mSDsCounter, 0 mSdLazyCounter, 2901 mSolverCounterSat, 228 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 167 SdHoareTripleChecker+Valid, 44 SdHoareTripleChecker+Invalid, 3129 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 228 IncrementalHoareTripleChecker+Valid, 2901 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2022-04-28 03:52:36,178 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [167 Valid, 44 Invalid, 3129 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [228 Valid, 2901 Invalid, 0 Unknown, 0 Unchecked, 2.3s Time] [2022-04-28 03:52:36,178 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2022-04-28 03:52:36,326 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 111. [2022-04-28 03:52:36,326 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 03:52:36,326 INFO L82 GeneralOperation]: Start isEquivalent. First operand 111 states. Second operand has 111 states, 106 states have (on average 1.0377358490566038) internal successors, (110), 106 states have internal predecessors, (110), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:52:36,326 INFO L74 IsIncluded]: Start isIncluded. First operand 111 states. Second operand has 111 states, 106 states have (on average 1.0377358490566038) internal successors, (110), 106 states have internal predecessors, (110), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:52:36,326 INFO L87 Difference]: Start difference. First operand 111 states. Second operand has 111 states, 106 states have (on average 1.0377358490566038) internal successors, (110), 106 states have internal predecessors, (110), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:52:36,327 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:52:36,327 INFO L93 Difference]: Finished difference Result 111 states and 114 transitions. [2022-04-28 03:52:36,327 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 114 transitions. [2022-04-28 03:52:36,328 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:52:36,328 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:52:36,328 INFO L74 IsIncluded]: Start isIncluded. First operand has 111 states, 106 states have (on average 1.0377358490566038) internal successors, (110), 106 states have internal predecessors, (110), 3 states have call successors, (3), 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 111 states. [2022-04-28 03:52:36,328 INFO L87 Difference]: Start difference. First operand has 111 states, 106 states have (on average 1.0377358490566038) internal successors, (110), 106 states have internal predecessors, (110), 3 states have call successors, (3), 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 111 states. [2022-04-28 03:52:36,329 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:52:36,329 INFO L93 Difference]: Finished difference Result 111 states and 114 transitions. [2022-04-28 03:52:36,329 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 114 transitions. [2022-04-28 03:52:36,329 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:52:36,329 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:52:36,329 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 03:52:36,329 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 03:52:36,329 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 111 states, 106 states have (on average 1.0377358490566038) internal successors, (110), 106 states have internal predecessors, (110), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:52:36,330 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 114 transitions. [2022-04-28 03:52:36,330 INFO L78 Accepts]: Start accepts. Automaton has 111 states and 114 transitions. Word has length 105 [2022-04-28 03:52:36,330 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 03:52:36,330 INFO L495 AbstractCegarLoop]: Abstraction has 111 states and 114 transitions. [2022-04-28 03:52:36,331 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 61 states, 61 states have (on average 1.6557377049180328) internal successors, (101), 60 states have internal predecessors, (101), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:52:36,331 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 111 states and 114 transitions. [2022-04-28 03:52:36,420 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 114 edges. 114 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 03:52:36,420 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 114 transitions. [2022-04-28 03:52:36,421 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2022-04-28 03:52:36,421 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 03:52:36,421 INFO L195 NwaCegarLoop]: trace histogram [39, 38, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 03:52:36,436 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Forceful destruction successful, exit code 0 [2022-04-28 03:52:36,621 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21,20 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 03:52:36,622 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 03:52:36,622 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 03:52:36,622 INFO L85 PathProgramCache]: Analyzing trace with hash -1870270216, now seen corresponding path program 20 times [2022-04-28 03:52:36,622 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 03:52:36,622 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1933975927] [2022-04-28 03:52:36,718 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 1 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 03:52:36,910 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={1=1, 2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 03:52:36,911 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-28 03:52:36,915 INFO L85 PathProgramCache]: Analyzing trace with hash -2115733695, now seen corresponding path program 1 times [2022-04-28 03:52:36,915 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 03:52:36,916 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1354565668] [2022-04-28 03:52:36,916 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:52:36,916 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 03:52:36,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:52:37,217 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 03:52:37,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:52:37,224 INFO L290 TraceCheckUtils]: 0: Hoare triple {15435#(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); {15409#true} is VALID [2022-04-28 03:52:37,224 INFO L290 TraceCheckUtils]: 1: Hoare triple {15409#true} assume true; {15409#true} is VALID [2022-04-28 03:52:37,224 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {15409#true} {15409#true} #52#return; {15409#true} is VALID [2022-04-28 03:52:37,224 INFO L272 TraceCheckUtils]: 0: Hoare triple {15409#true} call ULTIMATE.init(); {15435#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 03:52:37,224 INFO L290 TraceCheckUtils]: 1: Hoare triple {15435#(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); {15409#true} is VALID [2022-04-28 03:52:37,224 INFO L290 TraceCheckUtils]: 2: Hoare triple {15409#true} assume true; {15409#true} is VALID [2022-04-28 03:52:37,224 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {15409#true} {15409#true} #52#return; {15409#true} is VALID [2022-04-28 03:52:37,224 INFO L272 TraceCheckUtils]: 4: Hoare triple {15409#true} call #t~ret7 := main(); {15409#true} is VALID [2022-04-28 03:52:37,225 INFO L290 TraceCheckUtils]: 5: Hoare triple {15409#true} ~x~0 := 0;~y~0 := 50000;~z~0 := 0;~x~0 := 0; {15414#(<= 50000 main_~y~0)} is VALID [2022-04-28 03:52:37,225 INFO L290 TraceCheckUtils]: 6: Hoare triple {15414#(<= 50000 main_~y~0)} [136] L11-2-->L18-1_primed: Formula: (let ((.cse0 (= |v_main_#t~post4_128| |v_main_#t~post4_127|)) (.cse1 (= v_main_~x~0_889 v_main_~x~0_888))) (or (and .cse0 .cse1) (and .cse0 .cse1 (<= 50000 v_main_~x~0_889)) (and (< v_main_~x~0_889 v_main_~x~0_888) (< v_main_~x~0_888 50001)))) InVars {main_~x~0=v_main_~x~0_889, main_#t~post4=|v_main_#t~post4_128|} OutVars{main_~x~0=v_main_~x~0_888, main_#t~post4=|v_main_#t~post4_127|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {15414#(<= 50000 main_~y~0)} is VALID [2022-04-28 03:52:37,225 INFO L290 TraceCheckUtils]: 7: Hoare triple {15414#(<= 50000 main_~y~0)} [137] L18-1_primed-->L11-2: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {15414#(<= 50000 main_~y~0)} is VALID [2022-04-28 03:52:37,226 INFO L290 TraceCheckUtils]: 8: Hoare triple {15414#(<= 50000 main_~y~0)} [138] L11-2-->L18-1_primed: Formula: (let ((.cse1 (= |v_main_#t~post6_137| |v_main_#t~post6_136|)) (.cse2 (= |v_main_#t~post5_137| |v_main_#t~post5_136|)) (.cse3 (= v_main_~y~0_909 v_main_~y~0_908)) (.cse0 (<= 50000 v_main_~x~0_891)) (.cse4 (= v_main_~x~0_891 v_main_~x~0_890))) (or (and .cse0 (< v_main_~x~0_890 1000001) (= (+ v_main_~x~0_890 v_main_~y~0_909) (+ v_main_~x~0_891 v_main_~y~0_908)) (< v_main_~x~0_891 v_main_~x~0_890)) (and .cse1 .cse2 .cse3 .cse4) (and .cse1 .cse2 .cse3 (or (not (< v_main_~x~0_891 1000000)) (not .cse0)) .cse4))) InVars {main_~y~0=v_main_~y~0_909, main_#t~post5=|v_main_#t~post5_137|, main_~x~0=v_main_~x~0_891, main_#t~post6=|v_main_#t~post6_137|} OutVars{main_~y~0=v_main_~y~0_908, main_#t~post5=|v_main_#t~post5_136|, main_~x~0=v_main_~x~0_890, main_#t~post6=|v_main_#t~post6_136|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {15414#(<= 50000 main_~y~0)} is VALID [2022-04-28 03:52:37,226 INFO L290 TraceCheckUtils]: 9: Hoare triple {15414#(<= 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[] {15414#(<= 50000 main_~y~0)} is VALID [2022-04-28 03:52:37,227 INFO L290 TraceCheckUtils]: 10: Hoare triple {15414#(<= 50000 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {15415#(<= 49998 main_~y~0)} is VALID [2022-04-28 03:52:37,227 INFO L290 TraceCheckUtils]: 11: Hoare triple {15415#(<= 49998 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {15416#(<= 49996 main_~y~0)} is VALID [2022-04-28 03:52:37,228 INFO L290 TraceCheckUtils]: 12: Hoare triple {15416#(<= 49996 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {15417#(<= 49994 main_~y~0)} is VALID [2022-04-28 03:52:37,228 INFO L290 TraceCheckUtils]: 13: Hoare triple {15417#(<= 49994 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {15418#(<= 49992 main_~y~0)} is VALID [2022-04-28 03:52:37,229 INFO L290 TraceCheckUtils]: 14: Hoare triple {15418#(<= 49992 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {15419#(<= 49990 main_~y~0)} is VALID [2022-04-28 03:52:37,229 INFO L290 TraceCheckUtils]: 15: Hoare triple {15419#(<= 49990 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {15420#(<= 49988 main_~y~0)} is VALID [2022-04-28 03:52:37,230 INFO L290 TraceCheckUtils]: 16: Hoare triple {15420#(<= 49988 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {15421#(<= 49986 main_~y~0)} is VALID [2022-04-28 03:52:37,230 INFO L290 TraceCheckUtils]: 17: Hoare triple {15421#(<= 49986 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {15422#(<= 49984 main_~y~0)} is VALID [2022-04-28 03:52:37,230 INFO L290 TraceCheckUtils]: 18: Hoare triple {15422#(<= 49984 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {15423#(<= 49982 main_~y~0)} is VALID [2022-04-28 03:52:37,231 INFO L290 TraceCheckUtils]: 19: Hoare triple {15423#(<= 49982 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {15424#(<= 49980 main_~y~0)} is VALID [2022-04-28 03:52:37,231 INFO L290 TraceCheckUtils]: 20: Hoare triple {15424#(<= 49980 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {15425#(<= 49978 main_~y~0)} is VALID [2022-04-28 03:52:37,232 INFO L290 TraceCheckUtils]: 21: Hoare triple {15425#(<= 49978 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {15426#(<= 49976 main_~y~0)} is VALID [2022-04-28 03:52:37,232 INFO L290 TraceCheckUtils]: 22: Hoare triple {15426#(<= 49976 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {15427#(<= 49974 main_~y~0)} is VALID [2022-04-28 03:52:37,233 INFO L290 TraceCheckUtils]: 23: Hoare triple {15427#(<= 49974 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {15428#(<= 49972 main_~y~0)} is VALID [2022-04-28 03:52:37,233 INFO L290 TraceCheckUtils]: 24: Hoare triple {15428#(<= 49972 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {15429#(<= 49970 main_~y~0)} is VALID [2022-04-28 03:52:37,233 INFO L290 TraceCheckUtils]: 25: Hoare triple {15429#(<= 49970 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {15430#(<= 49968 main_~y~0)} is VALID [2022-04-28 03:52:37,234 INFO L290 TraceCheckUtils]: 26: Hoare triple {15430#(<= 49968 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {15431#(<= 49966 main_~y~0)} is VALID [2022-04-28 03:52:37,234 INFO L290 TraceCheckUtils]: 27: Hoare triple {15431#(<= 49966 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {15432#(<= 49964 main_~y~0)} is VALID [2022-04-28 03:52:37,235 INFO L290 TraceCheckUtils]: 28: Hoare triple {15432#(<= 49964 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {15433#(<= 49962 main_~y~0)} is VALID [2022-04-28 03:52:37,235 INFO L290 TraceCheckUtils]: 29: Hoare triple {15433#(<= 49962 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {15434#(<= 49960 main_~y~0)} is VALID [2022-04-28 03:52:37,236 INFO L290 TraceCheckUtils]: 30: Hoare triple {15434#(<= 49960 main_~y~0)} assume !(~y~0 > 0); {15410#false} is VALID [2022-04-28 03:52:37,236 INFO L272 TraceCheckUtils]: 31: Hoare triple {15410#false} call __VERIFIER_assert((if ~z~0 == ~x~0 then 1 else 0)); {15410#false} is VALID [2022-04-28 03:52:37,236 INFO L290 TraceCheckUtils]: 32: Hoare triple {15410#false} ~cond := #in~cond; {15410#false} is VALID [2022-04-28 03:52:37,236 INFO L290 TraceCheckUtils]: 33: Hoare triple {15410#false} assume 0 == ~cond; {15410#false} is VALID [2022-04-28 03:52:37,236 INFO L290 TraceCheckUtils]: 34: Hoare triple {15410#false} assume !false; {15410#false} is VALID [2022-04-28 03:52:37,236 INFO L134 CoverageAnalysis]: Checked inductivity of 212 backedges. 0 proven. 210 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-04-28 03:52:37,236 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 03:52:37,236 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1354565668] [2022-04-28 03:52:37,236 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1354565668] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 03:52:37,236 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [893735575] [2022-04-28 03:52:37,236 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:52:37,237 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 03:52:37,237 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 03:52:37,238 INFO L229 MonitoredProcess]: Starting monitored process 21 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 03:52:37,243 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Waiting until timeout for monitored process [2022-04-28 03:52:37,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:52:37,288 INFO L263 TraceCheckSpWp]: Trace formula consists of 159 conjuncts, 23 conjunts are in the unsatisfiable core [2022-04-28 03:52:37,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:52:37,302 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 03:52:37,657 INFO L272 TraceCheckUtils]: 0: Hoare triple {15409#true} call ULTIMATE.init(); {15409#true} is VALID [2022-04-28 03:52:37,658 INFO L290 TraceCheckUtils]: 1: Hoare triple {15409#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); {15409#true} is VALID [2022-04-28 03:52:37,658 INFO L290 TraceCheckUtils]: 2: Hoare triple {15409#true} assume true; {15409#true} is VALID [2022-04-28 03:52:37,658 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {15409#true} {15409#true} #52#return; {15409#true} is VALID [2022-04-28 03:52:37,658 INFO L272 TraceCheckUtils]: 4: Hoare triple {15409#true} call #t~ret7 := main(); {15409#true} is VALID [2022-04-28 03:52:37,658 INFO L290 TraceCheckUtils]: 5: Hoare triple {15409#true} ~x~0 := 0;~y~0 := 50000;~z~0 := 0;~x~0 := 0; {15414#(<= 50000 main_~y~0)} is VALID [2022-04-28 03:52:37,658 INFO L290 TraceCheckUtils]: 6: Hoare triple {15414#(<= 50000 main_~y~0)} [136] L11-2-->L18-1_primed: Formula: (let ((.cse0 (= |v_main_#t~post4_128| |v_main_#t~post4_127|)) (.cse1 (= v_main_~x~0_889 v_main_~x~0_888))) (or (and .cse0 .cse1) (and .cse0 .cse1 (<= 50000 v_main_~x~0_889)) (and (< v_main_~x~0_889 v_main_~x~0_888) (< v_main_~x~0_888 50001)))) InVars {main_~x~0=v_main_~x~0_889, main_#t~post4=|v_main_#t~post4_128|} OutVars{main_~x~0=v_main_~x~0_888, main_#t~post4=|v_main_#t~post4_127|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {15414#(<= 50000 main_~y~0)} is VALID [2022-04-28 03:52:37,659 INFO L290 TraceCheckUtils]: 7: Hoare triple {15414#(<= 50000 main_~y~0)} [137] L18-1_primed-->L11-2: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {15414#(<= 50000 main_~y~0)} is VALID [2022-04-28 03:52:37,659 INFO L290 TraceCheckUtils]: 8: Hoare triple {15414#(<= 50000 main_~y~0)} [138] L11-2-->L18-1_primed: Formula: (let ((.cse1 (= |v_main_#t~post6_137| |v_main_#t~post6_136|)) (.cse2 (= |v_main_#t~post5_137| |v_main_#t~post5_136|)) (.cse3 (= v_main_~y~0_909 v_main_~y~0_908)) (.cse0 (<= 50000 v_main_~x~0_891)) (.cse4 (= v_main_~x~0_891 v_main_~x~0_890))) (or (and .cse0 (< v_main_~x~0_890 1000001) (= (+ v_main_~x~0_890 v_main_~y~0_909) (+ v_main_~x~0_891 v_main_~y~0_908)) (< v_main_~x~0_891 v_main_~x~0_890)) (and .cse1 .cse2 .cse3 .cse4) (and .cse1 .cse2 .cse3 (or (not (< v_main_~x~0_891 1000000)) (not .cse0)) .cse4))) InVars {main_~y~0=v_main_~y~0_909, main_#t~post5=|v_main_#t~post5_137|, main_~x~0=v_main_~x~0_891, main_#t~post6=|v_main_#t~post6_137|} OutVars{main_~y~0=v_main_~y~0_908, main_#t~post5=|v_main_#t~post5_136|, main_~x~0=v_main_~x~0_890, main_#t~post6=|v_main_#t~post6_136|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {15414#(<= 50000 main_~y~0)} is VALID [2022-04-28 03:52:37,660 INFO L290 TraceCheckUtils]: 9: Hoare triple {15414#(<= 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[] {15414#(<= 50000 main_~y~0)} is VALID [2022-04-28 03:52:37,660 INFO L290 TraceCheckUtils]: 10: Hoare triple {15414#(<= 50000 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {15415#(<= 49998 main_~y~0)} is VALID [2022-04-28 03:52:37,660 INFO L290 TraceCheckUtils]: 11: Hoare triple {15415#(<= 49998 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {15416#(<= 49996 main_~y~0)} is VALID [2022-04-28 03:52:37,661 INFO L290 TraceCheckUtils]: 12: Hoare triple {15416#(<= 49996 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {15417#(<= 49994 main_~y~0)} is VALID [2022-04-28 03:52:37,661 INFO L290 TraceCheckUtils]: 13: Hoare triple {15417#(<= 49994 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {15418#(<= 49992 main_~y~0)} is VALID [2022-04-28 03:52:37,662 INFO L290 TraceCheckUtils]: 14: Hoare triple {15418#(<= 49992 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {15419#(<= 49990 main_~y~0)} is VALID [2022-04-28 03:52:37,662 INFO L290 TraceCheckUtils]: 15: Hoare triple {15419#(<= 49990 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {15420#(<= 49988 main_~y~0)} is VALID [2022-04-28 03:52:37,663 INFO L290 TraceCheckUtils]: 16: Hoare triple {15420#(<= 49988 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {15421#(<= 49986 main_~y~0)} is VALID [2022-04-28 03:52:37,663 INFO L290 TraceCheckUtils]: 17: Hoare triple {15421#(<= 49986 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {15422#(<= 49984 main_~y~0)} is VALID [2022-04-28 03:52:37,663 INFO L290 TraceCheckUtils]: 18: Hoare triple {15422#(<= 49984 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {15423#(<= 49982 main_~y~0)} is VALID [2022-04-28 03:52:37,664 INFO L290 TraceCheckUtils]: 19: Hoare triple {15423#(<= 49982 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {15424#(<= 49980 main_~y~0)} is VALID [2022-04-28 03:52:37,664 INFO L290 TraceCheckUtils]: 20: Hoare triple {15424#(<= 49980 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {15425#(<= 49978 main_~y~0)} is VALID [2022-04-28 03:52:37,665 INFO L290 TraceCheckUtils]: 21: Hoare triple {15425#(<= 49978 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {15426#(<= 49976 main_~y~0)} is VALID [2022-04-28 03:52:37,665 INFO L290 TraceCheckUtils]: 22: Hoare triple {15426#(<= 49976 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {15427#(<= 49974 main_~y~0)} is VALID [2022-04-28 03:52:37,665 INFO L290 TraceCheckUtils]: 23: Hoare triple {15427#(<= 49974 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {15428#(<= 49972 main_~y~0)} is VALID [2022-04-28 03:52:37,666 INFO L290 TraceCheckUtils]: 24: Hoare triple {15428#(<= 49972 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {15429#(<= 49970 main_~y~0)} is VALID [2022-04-28 03:52:37,666 INFO L290 TraceCheckUtils]: 25: Hoare triple {15429#(<= 49970 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {15430#(<= 49968 main_~y~0)} is VALID [2022-04-28 03:52:37,667 INFO L290 TraceCheckUtils]: 26: Hoare triple {15430#(<= 49968 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {15431#(<= 49966 main_~y~0)} is VALID [2022-04-28 03:52:37,667 INFO L290 TraceCheckUtils]: 27: Hoare triple {15431#(<= 49966 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {15432#(<= 49964 main_~y~0)} is VALID [2022-04-28 03:52:37,668 INFO L290 TraceCheckUtils]: 28: Hoare triple {15432#(<= 49964 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {15433#(<= 49962 main_~y~0)} is VALID [2022-04-28 03:52:37,668 INFO L290 TraceCheckUtils]: 29: Hoare triple {15433#(<= 49962 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {15434#(<= 49960 main_~y~0)} is VALID [2022-04-28 03:52:37,668 INFO L290 TraceCheckUtils]: 30: Hoare triple {15434#(<= 49960 main_~y~0)} assume !(~y~0 > 0); {15410#false} is VALID [2022-04-28 03:52:37,668 INFO L272 TraceCheckUtils]: 31: Hoare triple {15410#false} call __VERIFIER_assert((if ~z~0 == ~x~0 then 1 else 0)); {15410#false} is VALID [2022-04-28 03:52:37,668 INFO L290 TraceCheckUtils]: 32: Hoare triple {15410#false} ~cond := #in~cond; {15410#false} is VALID [2022-04-28 03:52:37,669 INFO L290 TraceCheckUtils]: 33: Hoare triple {15410#false} assume 0 == ~cond; {15410#false} is VALID [2022-04-28 03:52:37,669 INFO L290 TraceCheckUtils]: 34: Hoare triple {15410#false} assume !false; {15410#false} is VALID [2022-04-28 03:52:37,669 INFO L134 CoverageAnalysis]: Checked inductivity of 212 backedges. 0 proven. 210 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-04-28 03:52:37,669 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 03:52:38,471 INFO L290 TraceCheckUtils]: 34: Hoare triple {15410#false} assume !false; {15410#false} is VALID [2022-04-28 03:52:38,472 INFO L290 TraceCheckUtils]: 33: Hoare triple {15410#false} assume 0 == ~cond; {15410#false} is VALID [2022-04-28 03:52:38,472 INFO L290 TraceCheckUtils]: 32: Hoare triple {15410#false} ~cond := #in~cond; {15410#false} is VALID [2022-04-28 03:52:38,472 INFO L272 TraceCheckUtils]: 31: Hoare triple {15410#false} call __VERIFIER_assert((if ~z~0 == ~x~0 then 1 else 0)); {15410#false} is VALID [2022-04-28 03:52:38,472 INFO L290 TraceCheckUtils]: 30: Hoare triple {15553#(< 0 main_~y~0)} assume !(~y~0 > 0); {15410#false} is VALID [2022-04-28 03:52:38,473 INFO L290 TraceCheckUtils]: 29: Hoare triple {15557#(< 2 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {15553#(< 0 main_~y~0)} is VALID [2022-04-28 03:52:38,473 INFO L290 TraceCheckUtils]: 28: Hoare triple {15561#(< 4 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {15557#(< 2 main_~y~0)} is VALID [2022-04-28 03:52:38,473 INFO L290 TraceCheckUtils]: 27: Hoare triple {15565#(< 6 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {15561#(< 4 main_~y~0)} is VALID [2022-04-28 03:52:38,474 INFO L290 TraceCheckUtils]: 26: Hoare triple {15569#(< 8 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {15565#(< 6 main_~y~0)} is VALID [2022-04-28 03:52:38,474 INFO L290 TraceCheckUtils]: 25: Hoare triple {15573#(< 10 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {15569#(< 8 main_~y~0)} is VALID [2022-04-28 03:52:38,475 INFO L290 TraceCheckUtils]: 24: Hoare triple {15577#(< 12 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {15573#(< 10 main_~y~0)} is VALID [2022-04-28 03:52:38,475 INFO L290 TraceCheckUtils]: 23: Hoare triple {15581#(< 14 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {15577#(< 12 main_~y~0)} is VALID [2022-04-28 03:52:38,475 INFO L290 TraceCheckUtils]: 22: Hoare triple {15585#(< 16 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {15581#(< 14 main_~y~0)} is VALID [2022-04-28 03:52:38,476 INFO L290 TraceCheckUtils]: 21: Hoare triple {15589#(< 18 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {15585#(< 16 main_~y~0)} is VALID [2022-04-28 03:52:38,476 INFO L290 TraceCheckUtils]: 20: Hoare triple {15593#(< 20 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {15589#(< 18 main_~y~0)} is VALID [2022-04-28 03:52:38,477 INFO L290 TraceCheckUtils]: 19: Hoare triple {15597#(< 22 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {15593#(< 20 main_~y~0)} is VALID [2022-04-28 03:52:38,477 INFO L290 TraceCheckUtils]: 18: Hoare triple {15601#(< 24 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {15597#(< 22 main_~y~0)} is VALID [2022-04-28 03:52:38,478 INFO L290 TraceCheckUtils]: 17: Hoare triple {15605#(< 26 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {15601#(< 24 main_~y~0)} is VALID [2022-04-28 03:52:38,478 INFO L290 TraceCheckUtils]: 16: Hoare triple {15609#(< 28 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {15605#(< 26 main_~y~0)} is VALID [2022-04-28 03:52:38,478 INFO L290 TraceCheckUtils]: 15: Hoare triple {15613#(< 30 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {15609#(< 28 main_~y~0)} is VALID [2022-04-28 03:52:38,479 INFO L290 TraceCheckUtils]: 14: Hoare triple {15617#(< 32 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {15613#(< 30 main_~y~0)} is VALID [2022-04-28 03:52:38,479 INFO L290 TraceCheckUtils]: 13: Hoare triple {15621#(< 34 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {15617#(< 32 main_~y~0)} is VALID [2022-04-28 03:52:38,480 INFO L290 TraceCheckUtils]: 12: Hoare triple {15625#(< 36 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {15621#(< 34 main_~y~0)} is VALID [2022-04-28 03:52:38,480 INFO L290 TraceCheckUtils]: 11: Hoare triple {15629#(< 38 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {15625#(< 36 main_~y~0)} is VALID [2022-04-28 03:52:38,481 INFO L290 TraceCheckUtils]: 10: Hoare triple {15633#(< 40 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {15629#(< 38 main_~y~0)} is VALID [2022-04-28 03:52:38,481 INFO L290 TraceCheckUtils]: 9: Hoare triple {15633#(< 40 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[] {15633#(< 40 main_~y~0)} is VALID [2022-04-28 03:52:38,482 INFO L290 TraceCheckUtils]: 8: Hoare triple {15633#(< 40 main_~y~0)} [138] L11-2-->L18-1_primed: Formula: (let ((.cse1 (= |v_main_#t~post6_137| |v_main_#t~post6_136|)) (.cse2 (= |v_main_#t~post5_137| |v_main_#t~post5_136|)) (.cse3 (= v_main_~y~0_909 v_main_~y~0_908)) (.cse0 (<= 50000 v_main_~x~0_891)) (.cse4 (= v_main_~x~0_891 v_main_~x~0_890))) (or (and .cse0 (< v_main_~x~0_890 1000001) (= (+ v_main_~x~0_890 v_main_~y~0_909) (+ v_main_~x~0_891 v_main_~y~0_908)) (< v_main_~x~0_891 v_main_~x~0_890)) (and .cse1 .cse2 .cse3 .cse4) (and .cse1 .cse2 .cse3 (or (not (< v_main_~x~0_891 1000000)) (not .cse0)) .cse4))) InVars {main_~y~0=v_main_~y~0_909, main_#t~post5=|v_main_#t~post5_137|, main_~x~0=v_main_~x~0_891, main_#t~post6=|v_main_#t~post6_137|} OutVars{main_~y~0=v_main_~y~0_908, main_#t~post5=|v_main_#t~post5_136|, main_~x~0=v_main_~x~0_890, main_#t~post6=|v_main_#t~post6_136|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {15633#(< 40 main_~y~0)} is VALID [2022-04-28 03:52:38,482 INFO L290 TraceCheckUtils]: 7: Hoare triple {15633#(< 40 main_~y~0)} [137] L18-1_primed-->L11-2: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {15633#(< 40 main_~y~0)} is VALID [2022-04-28 03:52:38,482 INFO L290 TraceCheckUtils]: 6: Hoare triple {15633#(< 40 main_~y~0)} [136] L11-2-->L18-1_primed: Formula: (let ((.cse0 (= |v_main_#t~post4_128| |v_main_#t~post4_127|)) (.cse1 (= v_main_~x~0_889 v_main_~x~0_888))) (or (and .cse0 .cse1) (and .cse0 .cse1 (<= 50000 v_main_~x~0_889)) (and (< v_main_~x~0_889 v_main_~x~0_888) (< v_main_~x~0_888 50001)))) InVars {main_~x~0=v_main_~x~0_889, main_#t~post4=|v_main_#t~post4_128|} OutVars{main_~x~0=v_main_~x~0_888, main_#t~post4=|v_main_#t~post4_127|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {15633#(< 40 main_~y~0)} is VALID [2022-04-28 03:52:38,483 INFO L290 TraceCheckUtils]: 5: Hoare triple {15409#true} ~x~0 := 0;~y~0 := 50000;~z~0 := 0;~x~0 := 0; {15633#(< 40 main_~y~0)} is VALID [2022-04-28 03:52:38,483 INFO L272 TraceCheckUtils]: 4: Hoare triple {15409#true} call #t~ret7 := main(); {15409#true} is VALID [2022-04-28 03:52:38,483 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {15409#true} {15409#true} #52#return; {15409#true} is VALID [2022-04-28 03:52:38,483 INFO L290 TraceCheckUtils]: 2: Hoare triple {15409#true} assume true; {15409#true} is VALID [2022-04-28 03:52:38,483 INFO L290 TraceCheckUtils]: 1: Hoare triple {15409#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); {15409#true} is VALID [2022-04-28 03:52:38,483 INFO L272 TraceCheckUtils]: 0: Hoare triple {15409#true} call ULTIMATE.init(); {15409#true} is VALID [2022-04-28 03:52:38,483 INFO L134 CoverageAnalysis]: Checked inductivity of 212 backedges. 0 proven. 210 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-04-28 03:52:38,483 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [893735575] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 03:52:38,483 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 03:52:38,484 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 23, 23] total 45 [2022-04-28 03:52:39,883 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 03:52:39,883 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1933975927] [2022-04-28 03:52:39,883 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1933975927] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 03:52:39,883 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 03:52:39,884 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [64] imperfect sequences [] total 64 [2022-04-28 03:52:39,884 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [393756419] [2022-04-28 03:52:39,884 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 03:52:39,884 INFO L78 Accepts]: Start accepts. Automaton has has 64 states, 64 states have (on average 1.65625) internal successors, (106), 63 states have internal predecessors, (106), 2 states have call successors, (3), 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 110 [2022-04-28 03:52:39,884 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 03:52:39,884 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 64 states, 64 states have (on average 1.65625) internal successors, (106), 63 states have internal predecessors, (106), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:52:39,966 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 110 edges. 110 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 03:52:39,967 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 64 states [2022-04-28 03:52:39,967 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 03:52:39,967 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 64 interpolants. [2022-04-28 03:52:39,968 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=2747, Invalid=4393, Unknown=0, NotChecked=0, Total=7140 [2022-04-28 03:52:39,969 INFO L87 Difference]: Start difference. First operand 111 states and 114 transitions. Second operand has 64 states, 64 states have (on average 1.65625) internal successors, (106), 63 states have internal predecessors, (106), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:52:46,267 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:52:46,267 INFO L93 Difference]: Finished difference Result 219 states and 230 transitions. [2022-04-28 03:52:46,267 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 64 states. [2022-04-28 03:52:46,267 INFO L78 Accepts]: Start accepts. Automaton has has 64 states, 64 states have (on average 1.65625) internal successors, (106), 63 states have internal predecessors, (106), 2 states have call successors, (3), 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 110 [2022-04-28 03:52:46,267 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 03:52:46,267 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 64 states, 64 states have (on average 1.65625) internal successors, (106), 63 states have internal predecessors, (106), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:52:46,268 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 132 transitions. [2022-04-28 03:52:46,269 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 64 states, 64 states have (on average 1.65625) internal successors, (106), 63 states have internal predecessors, (106), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:52:46,270 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 132 transitions. [2022-04-28 03:52:46,270 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 64 states and 132 transitions. [2022-04-28 03:52:46,402 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 132 edges. 132 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 03:52:46,414 INFO L225 Difference]: With dead ends: 219 [2022-04-28 03:52:46,414 INFO L226 Difference]: Without dead ends: 116 [2022-04-28 03:52:46,417 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 239 GetRequests, 94 SyntacticMatches, 1 SemanticMatches, 144 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6051 ImplicationChecksByTransitivity, 3.1s TimeCoverageRelationStatistics Valid=6450, Invalid=14720, Unknown=0, NotChecked=0, Total=21170 [2022-04-28 03:52:46,417 INFO L413 NwaCegarLoop]: 12 mSDtfsCounter, 133 mSDsluCounter, 27 mSDsCounter, 0 mSdLazyCounter, 3218 mSolverCounterSat, 195 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 133 SdHoareTripleChecker+Valid, 39 SdHoareTripleChecker+Invalid, 3413 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 195 IncrementalHoareTripleChecker+Valid, 3218 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.5s IncrementalHoareTripleChecker+Time [2022-04-28 03:52:46,417 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [133 Valid, 39 Invalid, 3413 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [195 Valid, 3218 Invalid, 0 Unknown, 0 Unchecked, 2.5s Time] [2022-04-28 03:52:46,418 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116 states. [2022-04-28 03:52:46,593 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116 to 116. [2022-04-28 03:52:46,593 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 03:52:46,594 INFO L82 GeneralOperation]: Start isEquivalent. First operand 116 states. Second operand has 116 states, 111 states have (on average 1.0360360360360361) internal successors, (115), 111 states have internal predecessors, (115), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:52:46,594 INFO L74 IsIncluded]: Start isIncluded. First operand 116 states. Second operand has 116 states, 111 states have (on average 1.0360360360360361) internal successors, (115), 111 states have internal predecessors, (115), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:52:46,594 INFO L87 Difference]: Start difference. First operand 116 states. Second operand has 116 states, 111 states have (on average 1.0360360360360361) internal successors, (115), 111 states have internal predecessors, (115), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:52:46,604 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:52:46,605 INFO L93 Difference]: Finished difference Result 116 states and 119 transitions. [2022-04-28 03:52:46,605 INFO L276 IsEmpty]: Start isEmpty. Operand 116 states and 119 transitions. [2022-04-28 03:52:46,605 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:52:46,605 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:52:46,605 INFO L74 IsIncluded]: Start isIncluded. First operand has 116 states, 111 states have (on average 1.0360360360360361) internal successors, (115), 111 states have internal predecessors, (115), 3 states have call successors, (3), 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 116 states. [2022-04-28 03:52:46,605 INFO L87 Difference]: Start difference. First operand has 116 states, 111 states have (on average 1.0360360360360361) internal successors, (115), 111 states have internal predecessors, (115), 3 states have call successors, (3), 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 116 states. [2022-04-28 03:52:46,607 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:52:46,607 INFO L93 Difference]: Finished difference Result 116 states and 119 transitions. [2022-04-28 03:52:46,607 INFO L276 IsEmpty]: Start isEmpty. Operand 116 states and 119 transitions. [2022-04-28 03:52:46,607 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:52:46,607 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:52:46,607 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 03:52:46,607 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 03:52:46,607 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 116 states, 111 states have (on average 1.0360360360360361) internal successors, (115), 111 states have internal predecessors, (115), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:52:46,609 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 116 states to 116 states and 119 transitions. [2022-04-28 03:52:46,609 INFO L78 Accepts]: Start accepts. Automaton has 116 states and 119 transitions. Word has length 110 [2022-04-28 03:52:46,609 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 03:52:46,609 INFO L495 AbstractCegarLoop]: Abstraction has 116 states and 119 transitions. [2022-04-28 03:52:46,609 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 64 states, 64 states have (on average 1.65625) internal successors, (106), 63 states have internal predecessors, (106), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:52:46,609 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 116 states and 119 transitions. [2022-04-28 03:52:46,730 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 119 edges. 119 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 03:52:46,730 INFO L276 IsEmpty]: Start isEmpty. Operand 116 states and 119 transitions. [2022-04-28 03:52:46,731 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2022-04-28 03:52:46,731 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 03:52:46,731 INFO L195 NwaCegarLoop]: trace histogram [41, 40, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 03:52:46,753 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Ended with exit code 0 [2022-04-28 03:52:46,943 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 21 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable22 [2022-04-28 03:52:46,943 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 03:52:46,944 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 03:52:46,944 INFO L85 PathProgramCache]: Analyzing trace with hash 895207009, now seen corresponding path program 21 times [2022-04-28 03:52:46,944 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 03:52:46,944 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [59461845] [2022-04-28 03:52:47,062 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 1 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 03:52:47,302 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={1=1, 2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 03:52:47,304 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-28 03:52:47,306 INFO L85 PathProgramCache]: Analyzing trace with hash 222516546, now seen corresponding path program 1 times [2022-04-28 03:52:47,306 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 03:52:47,306 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [917018112] [2022-04-28 03:52:47,306 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:52:47,306 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 03:52:47,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:52:47,636 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 03:52:47,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:52:47,639 INFO L290 TraceCheckUtils]: 0: Hoare triple {16757#(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); {16730#true} is VALID [2022-04-28 03:52:47,639 INFO L290 TraceCheckUtils]: 1: Hoare triple {16730#true} assume true; {16730#true} is VALID [2022-04-28 03:52:47,639 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {16730#true} {16730#true} #52#return; {16730#true} is VALID [2022-04-28 03:52:47,640 INFO L272 TraceCheckUtils]: 0: Hoare triple {16730#true} call ULTIMATE.init(); {16757#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 03:52:47,640 INFO L290 TraceCheckUtils]: 1: Hoare triple {16757#(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); {16730#true} is VALID [2022-04-28 03:52:47,640 INFO L290 TraceCheckUtils]: 2: Hoare triple {16730#true} assume true; {16730#true} is VALID [2022-04-28 03:52:47,640 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {16730#true} {16730#true} #52#return; {16730#true} is VALID [2022-04-28 03:52:47,640 INFO L272 TraceCheckUtils]: 4: Hoare triple {16730#true} call #t~ret7 := main(); {16730#true} is VALID [2022-04-28 03:52:47,640 INFO L290 TraceCheckUtils]: 5: Hoare triple {16730#true} ~x~0 := 0;~y~0 := 50000;~z~0 := 0;~x~0 := 0; {16735#(<= 50000 main_~y~0)} is VALID [2022-04-28 03:52:47,641 INFO L290 TraceCheckUtils]: 6: Hoare triple {16735#(<= 50000 main_~y~0)} [140] L11-2-->L18-1_primed: Formula: (let ((.cse0 (= v_main_~x~0_964 v_main_~x~0_963)) (.cse1 (= |v_main_#t~post4_134| |v_main_#t~post4_133|))) (or (and (< v_main_~x~0_963 50001) (< v_main_~x~0_964 v_main_~x~0_963)) (and .cse0 .cse1) (and .cse0 (not (< v_main_~x~0_964 50000)) .cse1))) InVars {main_~x~0=v_main_~x~0_964, main_#t~post4=|v_main_#t~post4_134|} OutVars{main_~x~0=v_main_~x~0_963, main_#t~post4=|v_main_#t~post4_133|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {16735#(<= 50000 main_~y~0)} is VALID [2022-04-28 03:52:47,641 INFO L290 TraceCheckUtils]: 7: Hoare triple {16735#(<= 50000 main_~y~0)} [141] L18-1_primed-->L11-2: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {16735#(<= 50000 main_~y~0)} is VALID [2022-04-28 03:52:47,642 INFO L290 TraceCheckUtils]: 8: Hoare triple {16735#(<= 50000 main_~y~0)} [142] L11-2-->L18-1_primed: Formula: (let ((.cse2 (= v_main_~y~0_996 v_main_~y~0_995)) (.cse3 (= v_main_~x~0_966 v_main_~x~0_965)) (.cse4 (= |v_main_#t~post6_144| |v_main_#t~post6_143|)) (.cse1 (<= 50000 v_main_~x~0_966)) (.cse5 (= |v_main_#t~post5_144| |v_main_#t~post5_143|))) (or (let ((.cse0 (+ v_main_~x~0_966 v_main_~y~0_995))) (and (< .cse0 (+ v_main_~y~0_996 1000001)) .cse1 (< v_main_~y~0_996 v_main_~y~0_995) (= (+ v_main_~x~0_965 v_main_~y~0_996) .cse0))) (and .cse2 .cse3 .cse4 .cse5) (and .cse2 .cse3 .cse4 (or (not .cse1) (not (< v_main_~x~0_966 1000000))) .cse5))) InVars {main_~y~0=v_main_~y~0_996, main_#t~post5=|v_main_#t~post5_144|, main_~x~0=v_main_~x~0_966, main_#t~post6=|v_main_#t~post6_144|} OutVars{main_~y~0=v_main_~y~0_995, main_#t~post5=|v_main_#t~post5_143|, main_~x~0=v_main_~x~0_965, main_#t~post6=|v_main_#t~post6_143|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {16735#(<= 50000 main_~y~0)} is VALID [2022-04-28 03:52:47,642 INFO L290 TraceCheckUtils]: 9: Hoare triple {16735#(<= 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[] {16735#(<= 50000 main_~y~0)} is VALID [2022-04-28 03:52:47,643 INFO L290 TraceCheckUtils]: 10: Hoare triple {16735#(<= 50000 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {16736#(<= 49998 main_~y~0)} is VALID [2022-04-28 03:52:47,643 INFO L290 TraceCheckUtils]: 11: Hoare triple {16736#(<= 49998 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {16737#(<= 49996 main_~y~0)} is VALID [2022-04-28 03:52:47,644 INFO L290 TraceCheckUtils]: 12: Hoare triple {16737#(<= 49996 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {16738#(<= 49994 main_~y~0)} is VALID [2022-04-28 03:52:47,644 INFO L290 TraceCheckUtils]: 13: Hoare triple {16738#(<= 49994 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {16739#(<= 49992 main_~y~0)} is VALID [2022-04-28 03:52:47,645 INFO L290 TraceCheckUtils]: 14: Hoare triple {16739#(<= 49992 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {16740#(<= 49990 main_~y~0)} is VALID [2022-04-28 03:52:47,645 INFO L290 TraceCheckUtils]: 15: Hoare triple {16740#(<= 49990 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {16741#(<= 49988 main_~y~0)} is VALID [2022-04-28 03:52:47,646 INFO L290 TraceCheckUtils]: 16: Hoare triple {16741#(<= 49988 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {16742#(<= 49986 main_~y~0)} is VALID [2022-04-28 03:52:47,646 INFO L290 TraceCheckUtils]: 17: Hoare triple {16742#(<= 49986 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {16743#(<= 49984 main_~y~0)} is VALID [2022-04-28 03:52:47,647 INFO L290 TraceCheckUtils]: 18: Hoare triple {16743#(<= 49984 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {16744#(<= 49982 main_~y~0)} is VALID [2022-04-28 03:52:47,647 INFO L290 TraceCheckUtils]: 19: Hoare triple {16744#(<= 49982 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {16745#(<= 49980 main_~y~0)} is VALID [2022-04-28 03:52:47,648 INFO L290 TraceCheckUtils]: 20: Hoare triple {16745#(<= 49980 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {16746#(<= 49978 main_~y~0)} is VALID [2022-04-28 03:52:47,648 INFO L290 TraceCheckUtils]: 21: Hoare triple {16746#(<= 49978 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {16747#(<= 49976 main_~y~0)} is VALID [2022-04-28 03:52:47,649 INFO L290 TraceCheckUtils]: 22: Hoare triple {16747#(<= 49976 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {16748#(<= 49974 main_~y~0)} is VALID [2022-04-28 03:52:47,649 INFO L290 TraceCheckUtils]: 23: Hoare triple {16748#(<= 49974 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {16749#(<= 49972 main_~y~0)} is VALID [2022-04-28 03:52:47,650 INFO L290 TraceCheckUtils]: 24: Hoare triple {16749#(<= 49972 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {16750#(<= 49970 main_~y~0)} is VALID [2022-04-28 03:52:47,650 INFO L290 TraceCheckUtils]: 25: Hoare triple {16750#(<= 49970 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {16751#(<= 49968 main_~y~0)} is VALID [2022-04-28 03:52:47,650 INFO L290 TraceCheckUtils]: 26: Hoare triple {16751#(<= 49968 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {16752#(<= 49966 main_~y~0)} is VALID [2022-04-28 03:52:47,651 INFO L290 TraceCheckUtils]: 27: Hoare triple {16752#(<= 49966 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {16753#(<= 49964 main_~y~0)} is VALID [2022-04-28 03:52:47,651 INFO L290 TraceCheckUtils]: 28: Hoare triple {16753#(<= 49964 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {16754#(<= 49962 main_~y~0)} is VALID [2022-04-28 03:52:47,652 INFO L290 TraceCheckUtils]: 29: Hoare triple {16754#(<= 49962 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {16755#(<= 49960 main_~y~0)} is VALID [2022-04-28 03:52:47,652 INFO L290 TraceCheckUtils]: 30: Hoare triple {16755#(<= 49960 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {16756#(<= 49958 main_~y~0)} is VALID [2022-04-28 03:52:47,653 INFO L290 TraceCheckUtils]: 31: Hoare triple {16756#(<= 49958 main_~y~0)} assume !(~y~0 > 0); {16731#false} is VALID [2022-04-28 03:52:47,653 INFO L272 TraceCheckUtils]: 32: Hoare triple {16731#false} call __VERIFIER_assert((if ~z~0 == ~x~0 then 1 else 0)); {16731#false} is VALID [2022-04-28 03:52:47,653 INFO L290 TraceCheckUtils]: 33: Hoare triple {16731#false} ~cond := #in~cond; {16731#false} is VALID [2022-04-28 03:52:47,653 INFO L290 TraceCheckUtils]: 34: Hoare triple {16731#false} assume 0 == ~cond; {16731#false} is VALID [2022-04-28 03:52:47,653 INFO L290 TraceCheckUtils]: 35: Hoare triple {16731#false} assume !false; {16731#false} is VALID [2022-04-28 03:52:47,653 INFO L134 CoverageAnalysis]: Checked inductivity of 233 backedges. 0 proven. 231 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-04-28 03:52:47,654 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 03:52:47,654 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [917018112] [2022-04-28 03:52:47,654 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [917018112] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 03:52:47,654 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [612961115] [2022-04-28 03:52:47,654 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:52:47,654 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 03:52:47,654 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 03:52:47,655 INFO L229 MonitoredProcess]: Starting monitored process 22 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 03:52:47,656 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Waiting until timeout for monitored process [2022-04-28 03:52:47,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:52:47,699 INFO L263 TraceCheckSpWp]: Trace formula consists of 164 conjuncts, 24 conjunts are in the unsatisfiable core [2022-04-28 03:52:47,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:52:47,715 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 03:52:48,096 INFO L272 TraceCheckUtils]: 0: Hoare triple {16730#true} call ULTIMATE.init(); {16730#true} is VALID [2022-04-28 03:52:48,097 INFO L290 TraceCheckUtils]: 1: Hoare triple {16730#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); {16730#true} is VALID [2022-04-28 03:52:48,097 INFO L290 TraceCheckUtils]: 2: Hoare triple {16730#true} assume true; {16730#true} is VALID [2022-04-28 03:52:48,097 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {16730#true} {16730#true} #52#return; {16730#true} is VALID [2022-04-28 03:52:48,097 INFO L272 TraceCheckUtils]: 4: Hoare triple {16730#true} call #t~ret7 := main(); {16730#true} is VALID [2022-04-28 03:52:48,097 INFO L290 TraceCheckUtils]: 5: Hoare triple {16730#true} ~x~0 := 0;~y~0 := 50000;~z~0 := 0;~x~0 := 0; {16735#(<= 50000 main_~y~0)} is VALID [2022-04-28 03:52:48,098 INFO L290 TraceCheckUtils]: 6: Hoare triple {16735#(<= 50000 main_~y~0)} [140] L11-2-->L18-1_primed: Formula: (let ((.cse0 (= v_main_~x~0_964 v_main_~x~0_963)) (.cse1 (= |v_main_#t~post4_134| |v_main_#t~post4_133|))) (or (and (< v_main_~x~0_963 50001) (< v_main_~x~0_964 v_main_~x~0_963)) (and .cse0 .cse1) (and .cse0 (not (< v_main_~x~0_964 50000)) .cse1))) InVars {main_~x~0=v_main_~x~0_964, main_#t~post4=|v_main_#t~post4_134|} OutVars{main_~x~0=v_main_~x~0_963, main_#t~post4=|v_main_#t~post4_133|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {16735#(<= 50000 main_~y~0)} is VALID [2022-04-28 03:52:48,098 INFO L290 TraceCheckUtils]: 7: Hoare triple {16735#(<= 50000 main_~y~0)} [141] L18-1_primed-->L11-2: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {16735#(<= 50000 main_~y~0)} is VALID [2022-04-28 03:52:48,099 INFO L290 TraceCheckUtils]: 8: Hoare triple {16735#(<= 50000 main_~y~0)} [142] L11-2-->L18-1_primed: Formula: (let ((.cse2 (= v_main_~y~0_996 v_main_~y~0_995)) (.cse3 (= v_main_~x~0_966 v_main_~x~0_965)) (.cse4 (= |v_main_#t~post6_144| |v_main_#t~post6_143|)) (.cse1 (<= 50000 v_main_~x~0_966)) (.cse5 (= |v_main_#t~post5_144| |v_main_#t~post5_143|))) (or (let ((.cse0 (+ v_main_~x~0_966 v_main_~y~0_995))) (and (< .cse0 (+ v_main_~y~0_996 1000001)) .cse1 (< v_main_~y~0_996 v_main_~y~0_995) (= (+ v_main_~x~0_965 v_main_~y~0_996) .cse0))) (and .cse2 .cse3 .cse4 .cse5) (and .cse2 .cse3 .cse4 (or (not .cse1) (not (< v_main_~x~0_966 1000000))) .cse5))) InVars {main_~y~0=v_main_~y~0_996, main_#t~post5=|v_main_#t~post5_144|, main_~x~0=v_main_~x~0_966, main_#t~post6=|v_main_#t~post6_144|} OutVars{main_~y~0=v_main_~y~0_995, main_#t~post5=|v_main_#t~post5_143|, main_~x~0=v_main_~x~0_965, main_#t~post6=|v_main_#t~post6_143|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {16735#(<= 50000 main_~y~0)} is VALID [2022-04-28 03:52:48,099 INFO L290 TraceCheckUtils]: 9: Hoare triple {16735#(<= 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[] {16735#(<= 50000 main_~y~0)} is VALID [2022-04-28 03:52:48,100 INFO L290 TraceCheckUtils]: 10: Hoare triple {16735#(<= 50000 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {16736#(<= 49998 main_~y~0)} is VALID [2022-04-28 03:52:48,100 INFO L290 TraceCheckUtils]: 11: Hoare triple {16736#(<= 49998 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {16737#(<= 49996 main_~y~0)} is VALID [2022-04-28 03:52:48,101 INFO L290 TraceCheckUtils]: 12: Hoare triple {16737#(<= 49996 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {16738#(<= 49994 main_~y~0)} is VALID [2022-04-28 03:52:48,101 INFO L290 TraceCheckUtils]: 13: Hoare triple {16738#(<= 49994 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {16739#(<= 49992 main_~y~0)} is VALID [2022-04-28 03:52:48,102 INFO L290 TraceCheckUtils]: 14: Hoare triple {16739#(<= 49992 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {16740#(<= 49990 main_~y~0)} is VALID [2022-04-28 03:52:48,102 INFO L290 TraceCheckUtils]: 15: Hoare triple {16740#(<= 49990 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {16741#(<= 49988 main_~y~0)} is VALID [2022-04-28 03:52:48,103 INFO L290 TraceCheckUtils]: 16: Hoare triple {16741#(<= 49988 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {16742#(<= 49986 main_~y~0)} is VALID [2022-04-28 03:52:48,103 INFO L290 TraceCheckUtils]: 17: Hoare triple {16742#(<= 49986 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {16743#(<= 49984 main_~y~0)} is VALID [2022-04-28 03:52:48,104 INFO L290 TraceCheckUtils]: 18: Hoare triple {16743#(<= 49984 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {16744#(<= 49982 main_~y~0)} is VALID [2022-04-28 03:52:48,104 INFO L290 TraceCheckUtils]: 19: Hoare triple {16744#(<= 49982 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {16745#(<= 49980 main_~y~0)} is VALID [2022-04-28 03:52:48,105 INFO L290 TraceCheckUtils]: 20: Hoare triple {16745#(<= 49980 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {16746#(<= 49978 main_~y~0)} is VALID [2022-04-28 03:52:48,105 INFO L290 TraceCheckUtils]: 21: Hoare triple {16746#(<= 49978 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {16747#(<= 49976 main_~y~0)} is VALID [2022-04-28 03:52:48,105 INFO L290 TraceCheckUtils]: 22: Hoare triple {16747#(<= 49976 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {16748#(<= 49974 main_~y~0)} is VALID [2022-04-28 03:52:48,106 INFO L290 TraceCheckUtils]: 23: Hoare triple {16748#(<= 49974 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {16749#(<= 49972 main_~y~0)} is VALID [2022-04-28 03:52:48,106 INFO L290 TraceCheckUtils]: 24: Hoare triple {16749#(<= 49972 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {16750#(<= 49970 main_~y~0)} is VALID [2022-04-28 03:52:48,107 INFO L290 TraceCheckUtils]: 25: Hoare triple {16750#(<= 49970 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {16751#(<= 49968 main_~y~0)} is VALID [2022-04-28 03:52:48,107 INFO L290 TraceCheckUtils]: 26: Hoare triple {16751#(<= 49968 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {16752#(<= 49966 main_~y~0)} is VALID [2022-04-28 03:52:48,108 INFO L290 TraceCheckUtils]: 27: Hoare triple {16752#(<= 49966 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {16753#(<= 49964 main_~y~0)} is VALID [2022-04-28 03:52:48,108 INFO L290 TraceCheckUtils]: 28: Hoare triple {16753#(<= 49964 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {16754#(<= 49962 main_~y~0)} is VALID [2022-04-28 03:52:48,109 INFO L290 TraceCheckUtils]: 29: Hoare triple {16754#(<= 49962 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {16755#(<= 49960 main_~y~0)} is VALID [2022-04-28 03:52:48,109 INFO L290 TraceCheckUtils]: 30: Hoare triple {16755#(<= 49960 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {16756#(<= 49958 main_~y~0)} is VALID [2022-04-28 03:52:48,110 INFO L290 TraceCheckUtils]: 31: Hoare triple {16756#(<= 49958 main_~y~0)} assume !(~y~0 > 0); {16731#false} is VALID [2022-04-28 03:52:48,110 INFO L272 TraceCheckUtils]: 32: Hoare triple {16731#false} call __VERIFIER_assert((if ~z~0 == ~x~0 then 1 else 0)); {16731#false} is VALID [2022-04-28 03:52:48,110 INFO L290 TraceCheckUtils]: 33: Hoare triple {16731#false} ~cond := #in~cond; {16731#false} is VALID [2022-04-28 03:52:48,110 INFO L290 TraceCheckUtils]: 34: Hoare triple {16731#false} assume 0 == ~cond; {16731#false} is VALID [2022-04-28 03:52:48,110 INFO L290 TraceCheckUtils]: 35: Hoare triple {16731#false} assume !false; {16731#false} is VALID [2022-04-28 03:52:48,110 INFO L134 CoverageAnalysis]: Checked inductivity of 233 backedges. 0 proven. 231 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-04-28 03:52:48,111 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 03:52:49,080 INFO L290 TraceCheckUtils]: 35: Hoare triple {16731#false} assume !false; {16731#false} is VALID [2022-04-28 03:52:49,080 INFO L290 TraceCheckUtils]: 34: Hoare triple {16731#false} assume 0 == ~cond; {16731#false} is VALID [2022-04-28 03:52:49,080 INFO L290 TraceCheckUtils]: 33: Hoare triple {16731#false} ~cond := #in~cond; {16731#false} is VALID [2022-04-28 03:52:49,080 INFO L272 TraceCheckUtils]: 32: Hoare triple {16731#false} call __VERIFIER_assert((if ~z~0 == ~x~0 then 1 else 0)); {16731#false} is VALID [2022-04-28 03:52:49,081 INFO L290 TraceCheckUtils]: 31: Hoare triple {16878#(< 0 main_~y~0)} assume !(~y~0 > 0); {16731#false} is VALID [2022-04-28 03:52:49,081 INFO L290 TraceCheckUtils]: 30: Hoare triple {16882#(< 2 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {16878#(< 0 main_~y~0)} is VALID [2022-04-28 03:52:49,082 INFO L290 TraceCheckUtils]: 29: Hoare triple {16886#(< 4 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {16882#(< 2 main_~y~0)} is VALID [2022-04-28 03:52:49,082 INFO L290 TraceCheckUtils]: 28: Hoare triple {16890#(< 6 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {16886#(< 4 main_~y~0)} is VALID [2022-04-28 03:52:49,083 INFO L290 TraceCheckUtils]: 27: Hoare triple {16894#(< 8 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {16890#(< 6 main_~y~0)} is VALID [2022-04-28 03:52:49,083 INFO L290 TraceCheckUtils]: 26: Hoare triple {16898#(< 10 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {16894#(< 8 main_~y~0)} is VALID [2022-04-28 03:52:49,084 INFO L290 TraceCheckUtils]: 25: Hoare triple {16902#(< 12 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {16898#(< 10 main_~y~0)} is VALID [2022-04-28 03:52:49,084 INFO L290 TraceCheckUtils]: 24: Hoare triple {16906#(< 14 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {16902#(< 12 main_~y~0)} is VALID [2022-04-28 03:52:49,085 INFO L290 TraceCheckUtils]: 23: Hoare triple {16910#(< 16 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {16906#(< 14 main_~y~0)} is VALID [2022-04-28 03:52:49,085 INFO L290 TraceCheckUtils]: 22: Hoare triple {16914#(< 18 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {16910#(< 16 main_~y~0)} is VALID [2022-04-28 03:52:49,086 INFO L290 TraceCheckUtils]: 21: Hoare triple {16918#(< 20 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {16914#(< 18 main_~y~0)} is VALID [2022-04-28 03:52:49,086 INFO L290 TraceCheckUtils]: 20: Hoare triple {16922#(< 22 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {16918#(< 20 main_~y~0)} is VALID [2022-04-28 03:52:49,087 INFO L290 TraceCheckUtils]: 19: Hoare triple {16926#(< 24 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {16922#(< 22 main_~y~0)} is VALID [2022-04-28 03:52:49,087 INFO L290 TraceCheckUtils]: 18: Hoare triple {16930#(< 26 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {16926#(< 24 main_~y~0)} is VALID [2022-04-28 03:52:49,087 INFO L290 TraceCheckUtils]: 17: Hoare triple {16934#(< 28 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {16930#(< 26 main_~y~0)} is VALID [2022-04-28 03:52:49,088 INFO L290 TraceCheckUtils]: 16: Hoare triple {16938#(< 30 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {16934#(< 28 main_~y~0)} is VALID [2022-04-28 03:52:49,088 INFO L290 TraceCheckUtils]: 15: Hoare triple {16942#(< 32 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {16938#(< 30 main_~y~0)} is VALID [2022-04-28 03:52:49,089 INFO L290 TraceCheckUtils]: 14: Hoare triple {16946#(< 34 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {16942#(< 32 main_~y~0)} is VALID [2022-04-28 03:52:49,089 INFO L290 TraceCheckUtils]: 13: Hoare triple {16950#(< 36 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {16946#(< 34 main_~y~0)} is VALID [2022-04-28 03:52:49,090 INFO L290 TraceCheckUtils]: 12: Hoare triple {16954#(< 38 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {16950#(< 36 main_~y~0)} is VALID [2022-04-28 03:52:49,090 INFO L290 TraceCheckUtils]: 11: Hoare triple {16958#(< 40 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {16954#(< 38 main_~y~0)} is VALID [2022-04-28 03:52:49,091 INFO L290 TraceCheckUtils]: 10: Hoare triple {16962#(< 42 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {16958#(< 40 main_~y~0)} is VALID [2022-04-28 03:52:49,091 INFO L290 TraceCheckUtils]: 9: Hoare triple {16962#(< 42 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[] {16962#(< 42 main_~y~0)} is VALID [2022-04-28 03:52:49,092 INFO L290 TraceCheckUtils]: 8: Hoare triple {16962#(< 42 main_~y~0)} [142] L11-2-->L18-1_primed: Formula: (let ((.cse2 (= v_main_~y~0_996 v_main_~y~0_995)) (.cse3 (= v_main_~x~0_966 v_main_~x~0_965)) (.cse4 (= |v_main_#t~post6_144| |v_main_#t~post6_143|)) (.cse1 (<= 50000 v_main_~x~0_966)) (.cse5 (= |v_main_#t~post5_144| |v_main_#t~post5_143|))) (or (let ((.cse0 (+ v_main_~x~0_966 v_main_~y~0_995))) (and (< .cse0 (+ v_main_~y~0_996 1000001)) .cse1 (< v_main_~y~0_996 v_main_~y~0_995) (= (+ v_main_~x~0_965 v_main_~y~0_996) .cse0))) (and .cse2 .cse3 .cse4 .cse5) (and .cse2 .cse3 .cse4 (or (not .cse1) (not (< v_main_~x~0_966 1000000))) .cse5))) InVars {main_~y~0=v_main_~y~0_996, main_#t~post5=|v_main_#t~post5_144|, main_~x~0=v_main_~x~0_966, main_#t~post6=|v_main_#t~post6_144|} OutVars{main_~y~0=v_main_~y~0_995, main_#t~post5=|v_main_#t~post5_143|, main_~x~0=v_main_~x~0_965, main_#t~post6=|v_main_#t~post6_143|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {16962#(< 42 main_~y~0)} is VALID [2022-04-28 03:52:49,092 INFO L290 TraceCheckUtils]: 7: Hoare triple {16962#(< 42 main_~y~0)} [141] L18-1_primed-->L11-2: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {16962#(< 42 main_~y~0)} is VALID [2022-04-28 03:52:49,093 INFO L290 TraceCheckUtils]: 6: Hoare triple {16962#(< 42 main_~y~0)} [140] L11-2-->L18-1_primed: Formula: (let ((.cse0 (= v_main_~x~0_964 v_main_~x~0_963)) (.cse1 (= |v_main_#t~post4_134| |v_main_#t~post4_133|))) (or (and (< v_main_~x~0_963 50001) (< v_main_~x~0_964 v_main_~x~0_963)) (and .cse0 .cse1) (and .cse0 (not (< v_main_~x~0_964 50000)) .cse1))) InVars {main_~x~0=v_main_~x~0_964, main_#t~post4=|v_main_#t~post4_134|} OutVars{main_~x~0=v_main_~x~0_963, main_#t~post4=|v_main_#t~post4_133|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {16962#(< 42 main_~y~0)} is VALID [2022-04-28 03:52:49,093 INFO L290 TraceCheckUtils]: 5: Hoare triple {16730#true} ~x~0 := 0;~y~0 := 50000;~z~0 := 0;~x~0 := 0; {16962#(< 42 main_~y~0)} is VALID [2022-04-28 03:52:49,093 INFO L272 TraceCheckUtils]: 4: Hoare triple {16730#true} call #t~ret7 := main(); {16730#true} is VALID [2022-04-28 03:52:49,093 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {16730#true} {16730#true} #52#return; {16730#true} is VALID [2022-04-28 03:52:49,093 INFO L290 TraceCheckUtils]: 2: Hoare triple {16730#true} assume true; {16730#true} is VALID [2022-04-28 03:52:49,094 INFO L290 TraceCheckUtils]: 1: Hoare triple {16730#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); {16730#true} is VALID [2022-04-28 03:52:49,094 INFO L272 TraceCheckUtils]: 0: Hoare triple {16730#true} call ULTIMATE.init(); {16730#true} is VALID [2022-04-28 03:52:49,094 INFO L134 CoverageAnalysis]: Checked inductivity of 233 backedges. 0 proven. 231 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-04-28 03:52:49,094 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [612961115] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 03:52:49,094 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 03:52:49,094 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 24, 24] total 47 [2022-04-28 03:52:50,759 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 03:52:50,759 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [59461845] [2022-04-28 03:52:50,760 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [59461845] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 03:52:50,760 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 03:52:50,760 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [67] imperfect sequences [] total 67 [2022-04-28 03:52:50,760 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2066539617] [2022-04-28 03:52:50,760 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 03:52:50,760 INFO L78 Accepts]: Start accepts. Automaton has has 67 states, 67 states have (on average 1.6567164179104477) internal successors, (111), 66 states have internal predecessors, (111), 2 states have call successors, (3), 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 115 [2022-04-28 03:52:50,761 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 03:52:50,761 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 67 states, 67 states have (on average 1.6567164179104477) internal successors, (111), 66 states have internal predecessors, (111), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:52:50,850 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 115 edges. 115 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 03:52:50,851 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 67 states [2022-04-28 03:52:50,851 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 03:52:50,851 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 67 interpolants. [2022-04-28 03:52:50,852 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3010, Invalid=4822, Unknown=0, NotChecked=0, Total=7832 [2022-04-28 03:52:50,852 INFO L87 Difference]: Start difference. First operand 116 states and 119 transitions. Second operand has 67 states, 67 states have (on average 1.6567164179104477) internal successors, (111), 66 states have internal predecessors, (111), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:52:57,752 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:52:57,752 INFO L93 Difference]: Finished difference Result 229 states and 240 transitions. [2022-04-28 03:52:57,752 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 67 states. [2022-04-28 03:52:57,757 INFO L78 Accepts]: Start accepts. Automaton has has 67 states, 67 states have (on average 1.6567164179104477) internal successors, (111), 66 states have internal predecessors, (111), 2 states have call successors, (3), 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 115 [2022-04-28 03:52:57,757 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 03:52:57,757 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 67 states, 67 states have (on average 1.6567164179104477) internal successors, (111), 66 states have internal predecessors, (111), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:52:57,759 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 137 transitions. [2022-04-28 03:52:57,759 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 67 states, 67 states have (on average 1.6567164179104477) internal successors, (111), 66 states have internal predecessors, (111), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:52:57,760 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 137 transitions. [2022-04-28 03:52:57,760 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 67 states and 137 transitions. [2022-04-28 03:52:57,878 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 137 edges. 137 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 03:52:57,879 INFO L225 Difference]: With dead ends: 229 [2022-04-28 03:52:57,879 INFO L226 Difference]: Without dead ends: 121 [2022-04-28 03:52:57,881 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 249 GetRequests, 97 SyntacticMatches, 1 SemanticMatches, 151 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6658 ImplicationChecksByTransitivity, 3.5s TimeCoverageRelationStatistics Valid=7066, Invalid=16190, Unknown=0, NotChecked=0, Total=23256 [2022-04-28 03:52:57,881 INFO L413 NwaCegarLoop]: 12 mSDtfsCounter, 183 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 3513 mSolverCounterSat, 250 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 183 SdHoareTripleChecker+Valid, 29 SdHoareTripleChecker+Invalid, 3763 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 250 IncrementalHoareTripleChecker+Valid, 3513 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.7s IncrementalHoareTripleChecker+Time [2022-04-28 03:52:57,881 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [183 Valid, 29 Invalid, 3763 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [250 Valid, 3513 Invalid, 0 Unknown, 0 Unchecked, 2.7s Time] [2022-04-28 03:52:57,881 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121 states. [2022-04-28 03:52:58,061 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121 to 121. [2022-04-28 03:52:58,061 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 03:52:58,062 INFO L82 GeneralOperation]: Start isEquivalent. First operand 121 states. Second operand has 121 states, 116 states have (on average 1.0344827586206897) internal successors, (120), 116 states have internal predecessors, (120), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:52:58,062 INFO L74 IsIncluded]: Start isIncluded. First operand 121 states. Second operand has 121 states, 116 states have (on average 1.0344827586206897) internal successors, (120), 116 states have internal predecessors, (120), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:52:58,062 INFO L87 Difference]: Start difference. First operand 121 states. Second operand has 121 states, 116 states have (on average 1.0344827586206897) internal successors, (120), 116 states have internal predecessors, (120), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:52:58,063 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:52:58,063 INFO L93 Difference]: Finished difference Result 121 states and 124 transitions. [2022-04-28 03:52:58,063 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states and 124 transitions. [2022-04-28 03:52:58,064 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:52:58,064 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:52:58,064 INFO L74 IsIncluded]: Start isIncluded. First operand has 121 states, 116 states have (on average 1.0344827586206897) internal successors, (120), 116 states have internal predecessors, (120), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 121 states. [2022-04-28 03:52:58,064 INFO L87 Difference]: Start difference. First operand has 121 states, 116 states have (on average 1.0344827586206897) internal successors, (120), 116 states have internal predecessors, (120), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 121 states. [2022-04-28 03:52:58,065 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:52:58,065 INFO L93 Difference]: Finished difference Result 121 states and 124 transitions. [2022-04-28 03:52:58,065 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states and 124 transitions. [2022-04-28 03:52:58,065 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:52:58,065 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:52:58,065 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 03:52:58,065 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 03:52:58,065 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 121 states, 116 states have (on average 1.0344827586206897) internal successors, (120), 116 states have internal predecessors, (120), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:52:58,067 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 121 states to 121 states and 124 transitions. [2022-04-28 03:52:58,067 INFO L78 Accepts]: Start accepts. Automaton has 121 states and 124 transitions. Word has length 115 [2022-04-28 03:52:58,067 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 03:52:58,067 INFO L495 AbstractCegarLoop]: Abstraction has 121 states and 124 transitions. [2022-04-28 03:52:58,067 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 67 states, 67 states have (on average 1.6567164179104477) internal successors, (111), 66 states have internal predecessors, (111), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:52:58,067 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 121 states and 124 transitions. [2022-04-28 03:52:58,190 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 124 edges. 124 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 03:52:58,190 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states and 124 transitions. [2022-04-28 03:52:58,190 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2022-04-28 03:52:58,190 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 03:52:58,190 INFO L195 NwaCegarLoop]: trace histogram [43, 42, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 03:52:58,212 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Forceful destruction successful, exit code 0 [2022-04-28 03:52:58,391 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 22 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable23 [2022-04-28 03:52:58,391 INFO L420 AbstractCegarLoop]: === Iteration 25 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 03:52:58,391 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 03:52:58,391 INFO L85 PathProgramCache]: Analyzing trace with hash -617439764, now seen corresponding path program 22 times [2022-04-28 03:52:58,391 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 03:52:58,392 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1037193153] [2022-04-28 03:52:58,493 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 1 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 03:52:58,690 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={1=1, 2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 03:52:58,691 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-28 03:52:58,693 INFO L85 PathProgramCache]: Analyzing trace with hash 1545540961, now seen corresponding path program 1 times [2022-04-28 03:52:58,693 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 03:52:58,693 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1097222701] [2022-04-28 03:52:58,693 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:52:58,693 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 03:52:58,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:52:59,026 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 03:52:59,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:52:59,035 INFO L290 TraceCheckUtils]: 0: Hoare triple {18135#(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); {18107#true} is VALID [2022-04-28 03:52:59,035 INFO L290 TraceCheckUtils]: 1: Hoare triple {18107#true} assume true; {18107#true} is VALID [2022-04-28 03:52:59,035 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {18107#true} {18107#true} #52#return; {18107#true} is VALID [2022-04-28 03:52:59,036 INFO L272 TraceCheckUtils]: 0: Hoare triple {18107#true} call ULTIMATE.init(); {18135#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 03:52:59,036 INFO L290 TraceCheckUtils]: 1: Hoare triple {18135#(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); {18107#true} is VALID [2022-04-28 03:52:59,036 INFO L290 TraceCheckUtils]: 2: Hoare triple {18107#true} assume true; {18107#true} is VALID [2022-04-28 03:52:59,036 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {18107#true} {18107#true} #52#return; {18107#true} is VALID [2022-04-28 03:52:59,036 INFO L272 TraceCheckUtils]: 4: Hoare triple {18107#true} call #t~ret7 := main(); {18107#true} is VALID [2022-04-28 03:52:59,037 INFO L290 TraceCheckUtils]: 5: Hoare triple {18107#true} ~x~0 := 0;~y~0 := 50000;~z~0 := 0;~x~0 := 0; {18112#(<= 50000 main_~y~0)} is VALID [2022-04-28 03:52:59,037 INFO L290 TraceCheckUtils]: 6: Hoare triple {18112#(<= 50000 main_~y~0)} [144] L11-2-->L18-1_primed: Formula: (let ((.cse0 (= v_main_~x~0_1042 v_main_~x~0_1041))) (or (and (= |v_main_#t~post4_140| |v_main_#t~post4_139|) .cse0) (and (= |v_main_#t~post4_139| |v_main_#t~post4_140|) (<= 50000 v_main_~x~0_1042) .cse0) (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_140|} OutVars{main_~x~0=v_main_~x~0_1041, main_#t~post4=|v_main_#t~post4_139|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {18112#(<= 50000 main_~y~0)} is VALID [2022-04-28 03:52:59,038 INFO L290 TraceCheckUtils]: 7: Hoare triple {18112#(<= 50000 main_~y~0)} [145] L18-1_primed-->L11-2: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {18112#(<= 50000 main_~y~0)} is VALID [2022-04-28 03:52:59,040 INFO L290 TraceCheckUtils]: 8: Hoare triple {18112#(<= 50000 main_~y~0)} [146] L11-2-->L18-1_primed: Formula: (let ((.cse1 (= v_main_~x~0_1044 v_main_~x~0_1043)) (.cse2 (= |v_main_#t~post6_151| |v_main_#t~post6_150|)) (.cse3 (= v_main_~y~0_1087 v_main_~y~0_1086)) (.cse0 (<= 50000 v_main_~x~0_1044)) (.cse4 (= |v_main_#t~post5_151| |v_main_#t~post5_150|))) (or (and (< v_main_~x~0_1043 1000001) (= (+ v_main_~x~0_1043 v_main_~y~0_1087) (+ v_main_~x~0_1044 v_main_~y~0_1086)) .cse0 (< v_main_~x~0_1044 v_main_~x~0_1043)) (and .cse1 .cse2 .cse3 .cse4) (and .cse1 .cse2 .cse3 (or (not .cse0) (not (< v_main_~x~0_1044 1000000))) .cse4))) InVars {main_~y~0=v_main_~y~0_1087, main_#t~post5=|v_main_#t~post5_151|, main_~x~0=v_main_~x~0_1044, main_#t~post6=|v_main_#t~post6_151|} OutVars{main_~y~0=v_main_~y~0_1086, main_#t~post5=|v_main_#t~post5_150|, main_~x~0=v_main_~x~0_1043, main_#t~post6=|v_main_#t~post6_150|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {18112#(<= 50000 main_~y~0)} is VALID [2022-04-28 03:52:59,040 INFO L290 TraceCheckUtils]: 9: Hoare triple {18112#(<= 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[] {18112#(<= 50000 main_~y~0)} is VALID [2022-04-28 03:52:59,040 INFO L290 TraceCheckUtils]: 10: Hoare triple {18112#(<= 50000 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {18113#(<= 49998 main_~y~0)} is VALID [2022-04-28 03:52:59,041 INFO L290 TraceCheckUtils]: 11: Hoare triple {18113#(<= 49998 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {18114#(<= 49996 main_~y~0)} is VALID [2022-04-28 03:52:59,041 INFO L290 TraceCheckUtils]: 12: Hoare triple {18114#(<= 49996 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {18115#(<= 49994 main_~y~0)} is VALID [2022-04-28 03:52:59,042 INFO L290 TraceCheckUtils]: 13: Hoare triple {18115#(<= 49994 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {18116#(<= 49992 main_~y~0)} is VALID [2022-04-28 03:52:59,042 INFO L290 TraceCheckUtils]: 14: Hoare triple {18116#(<= 49992 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {18117#(<= 49990 main_~y~0)} is VALID [2022-04-28 03:52:59,042 INFO L290 TraceCheckUtils]: 15: Hoare triple {18117#(<= 49990 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {18118#(<= 49988 main_~y~0)} is VALID [2022-04-28 03:52:59,043 INFO L290 TraceCheckUtils]: 16: Hoare triple {18118#(<= 49988 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {18119#(<= 49986 main_~y~0)} is VALID [2022-04-28 03:52:59,043 INFO L290 TraceCheckUtils]: 17: Hoare triple {18119#(<= 49986 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {18120#(<= 49984 main_~y~0)} is VALID [2022-04-28 03:52:59,044 INFO L290 TraceCheckUtils]: 18: Hoare triple {18120#(<= 49984 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {18121#(<= 49982 main_~y~0)} is VALID [2022-04-28 03:52:59,044 INFO L290 TraceCheckUtils]: 19: Hoare triple {18121#(<= 49982 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {18122#(<= 49980 main_~y~0)} is VALID [2022-04-28 03:52:59,045 INFO L290 TraceCheckUtils]: 20: Hoare triple {18122#(<= 49980 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {18123#(<= 49978 main_~y~0)} is VALID [2022-04-28 03:52:59,045 INFO L290 TraceCheckUtils]: 21: Hoare triple {18123#(<= 49978 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {18124#(<= 49976 main_~y~0)} is VALID [2022-04-28 03:52:59,045 INFO L290 TraceCheckUtils]: 22: Hoare triple {18124#(<= 49976 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {18125#(<= 49974 main_~y~0)} is VALID [2022-04-28 03:52:59,046 INFO L290 TraceCheckUtils]: 23: Hoare triple {18125#(<= 49974 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {18126#(<= 49972 main_~y~0)} is VALID [2022-04-28 03:52:59,046 INFO L290 TraceCheckUtils]: 24: Hoare triple {18126#(<= 49972 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {18127#(<= 49970 main_~y~0)} is VALID [2022-04-28 03:52:59,047 INFO L290 TraceCheckUtils]: 25: Hoare triple {18127#(<= 49970 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {18128#(<= 49968 main_~y~0)} is VALID [2022-04-28 03:52:59,047 INFO L290 TraceCheckUtils]: 26: Hoare triple {18128#(<= 49968 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {18129#(<= 49966 main_~y~0)} is VALID [2022-04-28 03:52:59,047 INFO L290 TraceCheckUtils]: 27: Hoare triple {18129#(<= 49966 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {18130#(<= 49964 main_~y~0)} is VALID [2022-04-28 03:52:59,048 INFO L290 TraceCheckUtils]: 28: Hoare triple {18130#(<= 49964 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {18131#(<= 49962 main_~y~0)} is VALID [2022-04-28 03:52:59,048 INFO L290 TraceCheckUtils]: 29: Hoare triple {18131#(<= 49962 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {18132#(<= 49960 main_~y~0)} is VALID [2022-04-28 03:52:59,049 INFO L290 TraceCheckUtils]: 30: Hoare triple {18132#(<= 49960 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {18133#(<= 49958 main_~y~0)} is VALID [2022-04-28 03:52:59,049 INFO L290 TraceCheckUtils]: 31: Hoare triple {18133#(<= 49958 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {18134#(<= 49956 main_~y~0)} is VALID [2022-04-28 03:52:59,049 INFO L290 TraceCheckUtils]: 32: Hoare triple {18134#(<= 49956 main_~y~0)} assume !(~y~0 > 0); {18108#false} is VALID [2022-04-28 03:52:59,049 INFO L272 TraceCheckUtils]: 33: Hoare triple {18108#false} call __VERIFIER_assert((if ~z~0 == ~x~0 then 1 else 0)); {18108#false} is VALID [2022-04-28 03:52:59,050 INFO L290 TraceCheckUtils]: 34: Hoare triple {18108#false} ~cond := #in~cond; {18108#false} is VALID [2022-04-28 03:52:59,050 INFO L290 TraceCheckUtils]: 35: Hoare triple {18108#false} assume 0 == ~cond; {18108#false} is VALID [2022-04-28 03:52:59,050 INFO L290 TraceCheckUtils]: 36: Hoare triple {18108#false} assume !false; {18108#false} is VALID [2022-04-28 03:52:59,050 INFO L134 CoverageAnalysis]: Checked inductivity of 255 backedges. 0 proven. 253 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-04-28 03:52:59,050 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 03:52:59,050 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1097222701] [2022-04-28 03:52:59,050 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1097222701] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 03:52:59,050 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [782767276] [2022-04-28 03:52:59,050 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:52:59,050 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 03:52:59,050 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 03:52:59,051 INFO L229 MonitoredProcess]: Starting monitored process 23 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 03:52:59,052 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (23)] Waiting until timeout for monitored process [2022-04-28 03:52:59,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:52:59,089 INFO L263 TraceCheckSpWp]: Trace formula consists of 169 conjuncts, 28 conjunts are in the unsatisfiable core [2022-04-28 03:52:59,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:52:59,104 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 03:52:59,778 INFO L272 TraceCheckUtils]: 0: Hoare triple {18107#true} call ULTIMATE.init(); {18107#true} is VALID [2022-04-28 03:52:59,778 INFO L290 TraceCheckUtils]: 1: Hoare triple {18107#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); {18107#true} is VALID [2022-04-28 03:52:59,778 INFO L290 TraceCheckUtils]: 2: Hoare triple {18107#true} assume true; {18107#true} is VALID [2022-04-28 03:52:59,778 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {18107#true} {18107#true} #52#return; {18107#true} is VALID [2022-04-28 03:52:59,778 INFO L272 TraceCheckUtils]: 4: Hoare triple {18107#true} call #t~ret7 := main(); {18107#true} is VALID [2022-04-28 03:52:59,779 INFO L290 TraceCheckUtils]: 5: Hoare triple {18107#true} ~x~0 := 0;~y~0 := 50000;~z~0 := 0;~x~0 := 0; {18154#(and (<= main_~x~0 0) (<= 50000 main_~y~0))} is VALID [2022-04-28 03:52:59,779 INFO L290 TraceCheckUtils]: 6: Hoare triple {18154#(and (<= main_~x~0 0) (<= 50000 main_~y~0))} [144] L11-2-->L18-1_primed: Formula: (let ((.cse0 (= v_main_~x~0_1042 v_main_~x~0_1041))) (or (and (= |v_main_#t~post4_140| |v_main_#t~post4_139|) .cse0) (and (= |v_main_#t~post4_139| |v_main_#t~post4_140|) (<= 50000 v_main_~x~0_1042) .cse0) (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_140|} OutVars{main_~x~0=v_main_~x~0_1041, main_#t~post4=|v_main_#t~post4_139|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {18158#(and (< main_~x~0 50001) (<= 50000 main_~y~0))} is VALID [2022-04-28 03:52:59,779 INFO L290 TraceCheckUtils]: 7: Hoare triple {18158#(and (< main_~x~0 50001) (<= 50000 main_~y~0))} [145] L18-1_primed-->L11-2: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {18158#(and (< main_~x~0 50001) (<= 50000 main_~y~0))} is VALID [2022-04-28 03:52:59,780 INFO L290 TraceCheckUtils]: 8: Hoare triple {18158#(and (< main_~x~0 50001) (<= 50000 main_~y~0))} [146] L11-2-->L18-1_primed: Formula: (let ((.cse1 (= v_main_~x~0_1044 v_main_~x~0_1043)) (.cse2 (= |v_main_#t~post6_151| |v_main_#t~post6_150|)) (.cse3 (= v_main_~y~0_1087 v_main_~y~0_1086)) (.cse0 (<= 50000 v_main_~x~0_1044)) (.cse4 (= |v_main_#t~post5_151| |v_main_#t~post5_150|))) (or (and (< v_main_~x~0_1043 1000001) (= (+ v_main_~x~0_1043 v_main_~y~0_1087) (+ v_main_~x~0_1044 v_main_~y~0_1086)) .cse0 (< v_main_~x~0_1044 v_main_~x~0_1043)) (and .cse1 .cse2 .cse3 .cse4) (and .cse1 .cse2 .cse3 (or (not .cse0) (not (< v_main_~x~0_1044 1000000))) .cse4))) InVars {main_~y~0=v_main_~y~0_1087, main_#t~post5=|v_main_#t~post5_151|, main_~x~0=v_main_~x~0_1044, main_#t~post6=|v_main_#t~post6_151|} OutVars{main_~y~0=v_main_~y~0_1086, main_#t~post5=|v_main_#t~post5_150|, main_~x~0=v_main_~x~0_1043, main_#t~post6=|v_main_#t~post6_150|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {18165#(or (and (< main_~x~0 50001) (<= 50000 main_~y~0)) (and (< main_~x~0 (+ main_~y~0 1)) (< main_~x~0 1000001) (< 50000 main_~x~0)))} is VALID [2022-04-28 03:52:59,781 INFO L290 TraceCheckUtils]: 9: Hoare triple {18165#(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)))} [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[] {18169#(< 999999 main_~y~0)} is VALID [2022-04-28 03:52:59,781 INFO L290 TraceCheckUtils]: 10: Hoare triple {18169#(< 999999 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {18173#(< 999997 main_~y~0)} is VALID [2022-04-28 03:52:59,782 INFO L290 TraceCheckUtils]: 11: Hoare triple {18173#(< 999997 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {18177#(< 999995 main_~y~0)} is VALID [2022-04-28 03:52:59,782 INFO L290 TraceCheckUtils]: 12: Hoare triple {18177#(< 999995 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {18181#(< 999993 main_~y~0)} is VALID [2022-04-28 03:52:59,782 INFO L290 TraceCheckUtils]: 13: Hoare triple {18181#(< 999993 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {18185#(< 999991 main_~y~0)} is VALID [2022-04-28 03:52:59,783 INFO L290 TraceCheckUtils]: 14: Hoare triple {18185#(< 999991 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {18189#(< 999989 main_~y~0)} is VALID [2022-04-28 03:52:59,783 INFO L290 TraceCheckUtils]: 15: Hoare triple {18189#(< 999989 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {18193#(< 999987 main_~y~0)} is VALID [2022-04-28 03:52:59,784 INFO L290 TraceCheckUtils]: 16: Hoare triple {18193#(< 999987 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {18197#(< 999985 main_~y~0)} is VALID [2022-04-28 03:52:59,784 INFO L290 TraceCheckUtils]: 17: Hoare triple {18197#(< 999985 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {18201#(< 999983 main_~y~0)} is VALID [2022-04-28 03:52:59,784 INFO L290 TraceCheckUtils]: 18: Hoare triple {18201#(< 999983 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {18205#(< 999981 main_~y~0)} is VALID [2022-04-28 03:52:59,785 INFO L290 TraceCheckUtils]: 19: Hoare triple {18205#(< 999981 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {18209#(< 999979 main_~y~0)} is VALID [2022-04-28 03:52:59,785 INFO L290 TraceCheckUtils]: 20: Hoare triple {18209#(< 999979 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {18213#(< 999977 main_~y~0)} is VALID [2022-04-28 03:52:59,786 INFO L290 TraceCheckUtils]: 21: Hoare triple {18213#(< 999977 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {18217#(< 999975 main_~y~0)} is VALID [2022-04-28 03:52:59,786 INFO L290 TraceCheckUtils]: 22: Hoare triple {18217#(< 999975 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {18221#(< 999973 main_~y~0)} is VALID [2022-04-28 03:52:59,786 INFO L290 TraceCheckUtils]: 23: Hoare triple {18221#(< 999973 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {18225#(< 999971 main_~y~0)} is VALID [2022-04-28 03:52:59,787 INFO L290 TraceCheckUtils]: 24: Hoare triple {18225#(< 999971 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {18229#(< 999969 main_~y~0)} is VALID [2022-04-28 03:52:59,787 INFO L290 TraceCheckUtils]: 25: Hoare triple {18229#(< 999969 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {18233#(< 999967 main_~y~0)} is VALID [2022-04-28 03:52:59,788 INFO L290 TraceCheckUtils]: 26: Hoare triple {18233#(< 999967 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {18237#(< 999965 main_~y~0)} is VALID [2022-04-28 03:52:59,788 INFO L290 TraceCheckUtils]: 27: Hoare triple {18237#(< 999965 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {18241#(< 999963 main_~y~0)} is VALID [2022-04-28 03:52:59,789 INFO L290 TraceCheckUtils]: 28: Hoare triple {18241#(< 999963 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {18245#(< 999961 main_~y~0)} is VALID [2022-04-28 03:52:59,789 INFO L290 TraceCheckUtils]: 29: Hoare triple {18245#(< 999961 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {18249#(< 999959 main_~y~0)} is VALID [2022-04-28 03:52:59,789 INFO L290 TraceCheckUtils]: 30: Hoare triple {18249#(< 999959 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {18253#(< 999957 main_~y~0)} is VALID [2022-04-28 03:52:59,790 INFO L290 TraceCheckUtils]: 31: Hoare triple {18253#(< 999957 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {18257#(< 999955 main_~y~0)} is VALID [2022-04-28 03:52:59,790 INFO L290 TraceCheckUtils]: 32: Hoare triple {18257#(< 999955 main_~y~0)} assume !(~y~0 > 0); {18108#false} is VALID [2022-04-28 03:52:59,790 INFO L272 TraceCheckUtils]: 33: Hoare triple {18108#false} call __VERIFIER_assert((if ~z~0 == ~x~0 then 1 else 0)); {18108#false} is VALID [2022-04-28 03:52:59,790 INFO L290 TraceCheckUtils]: 34: Hoare triple {18108#false} ~cond := #in~cond; {18108#false} is VALID [2022-04-28 03:52:59,790 INFO L290 TraceCheckUtils]: 35: Hoare triple {18108#false} assume 0 == ~cond; {18108#false} is VALID [2022-04-28 03:52:59,790 INFO L290 TraceCheckUtils]: 36: Hoare triple {18108#false} assume !false; {18108#false} is VALID [2022-04-28 03:52:59,791 INFO L134 CoverageAnalysis]: Checked inductivity of 255 backedges. 0 proven. 255 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 03:52:59,791 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 03:53:00,905 INFO L290 TraceCheckUtils]: 36: Hoare triple {18108#false} assume !false; {18108#false} is VALID [2022-04-28 03:53:00,905 INFO L290 TraceCheckUtils]: 35: Hoare triple {18108#false} assume 0 == ~cond; {18108#false} is VALID [2022-04-28 03:53:00,905 INFO L290 TraceCheckUtils]: 34: Hoare triple {18108#false} ~cond := #in~cond; {18108#false} is VALID [2022-04-28 03:53:00,905 INFO L272 TraceCheckUtils]: 33: Hoare triple {18108#false} call __VERIFIER_assert((if ~z~0 == ~x~0 then 1 else 0)); {18108#false} is VALID [2022-04-28 03:53:00,906 INFO L290 TraceCheckUtils]: 32: Hoare triple {18285#(< 0 main_~y~0)} assume !(~y~0 > 0); {18108#false} is VALID [2022-04-28 03:53:00,906 INFO L290 TraceCheckUtils]: 31: Hoare triple {18289#(< 2 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {18285#(< 0 main_~y~0)} is VALID [2022-04-28 03:53:00,906 INFO L290 TraceCheckUtils]: 30: Hoare triple {18293#(< 4 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {18289#(< 2 main_~y~0)} is VALID [2022-04-28 03:53:00,907 INFO L290 TraceCheckUtils]: 29: Hoare triple {18297#(< 6 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {18293#(< 4 main_~y~0)} is VALID [2022-04-28 03:53:00,907 INFO L290 TraceCheckUtils]: 28: Hoare triple {18301#(< 8 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {18297#(< 6 main_~y~0)} is VALID [2022-04-28 03:53:00,908 INFO L290 TraceCheckUtils]: 27: Hoare triple {18305#(< 10 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {18301#(< 8 main_~y~0)} is VALID [2022-04-28 03:53:00,908 INFO L290 TraceCheckUtils]: 26: Hoare triple {18309#(< 12 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {18305#(< 10 main_~y~0)} is VALID [2022-04-28 03:53:00,909 INFO L290 TraceCheckUtils]: 25: Hoare triple {18313#(< 14 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {18309#(< 12 main_~y~0)} is VALID [2022-04-28 03:53:00,909 INFO L290 TraceCheckUtils]: 24: Hoare triple {18317#(< 16 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {18313#(< 14 main_~y~0)} is VALID [2022-04-28 03:53:00,909 INFO L290 TraceCheckUtils]: 23: Hoare triple {18321#(< 18 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {18317#(< 16 main_~y~0)} is VALID [2022-04-28 03:53:00,910 INFO L290 TraceCheckUtils]: 22: Hoare triple {18325#(< 20 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {18321#(< 18 main_~y~0)} is VALID [2022-04-28 03:53:00,910 INFO L290 TraceCheckUtils]: 21: Hoare triple {18329#(< 22 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {18325#(< 20 main_~y~0)} is VALID [2022-04-28 03:53:00,911 INFO L290 TraceCheckUtils]: 20: Hoare triple {18333#(< 24 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {18329#(< 22 main_~y~0)} is VALID [2022-04-28 03:53:00,911 INFO L290 TraceCheckUtils]: 19: Hoare triple {18337#(< 26 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {18333#(< 24 main_~y~0)} is VALID [2022-04-28 03:53:00,912 INFO L290 TraceCheckUtils]: 18: Hoare triple {18341#(< 28 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {18337#(< 26 main_~y~0)} is VALID [2022-04-28 03:53:00,912 INFO L290 TraceCheckUtils]: 17: Hoare triple {18345#(< 30 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {18341#(< 28 main_~y~0)} is VALID [2022-04-28 03:53:00,912 INFO L290 TraceCheckUtils]: 16: Hoare triple {18349#(< 32 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {18345#(< 30 main_~y~0)} is VALID [2022-04-28 03:53:00,913 INFO L290 TraceCheckUtils]: 15: Hoare triple {18353#(< 34 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {18349#(< 32 main_~y~0)} is VALID [2022-04-28 03:53:00,913 INFO L290 TraceCheckUtils]: 14: Hoare triple {18357#(< 36 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {18353#(< 34 main_~y~0)} is VALID [2022-04-28 03:53:00,914 INFO L290 TraceCheckUtils]: 13: Hoare triple {18361#(< 38 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {18357#(< 36 main_~y~0)} is VALID [2022-04-28 03:53:00,914 INFO L290 TraceCheckUtils]: 12: Hoare triple {18365#(< 40 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {18361#(< 38 main_~y~0)} is VALID [2022-04-28 03:53:00,914 INFO L290 TraceCheckUtils]: 11: Hoare triple {18369#(< 42 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {18365#(< 40 main_~y~0)} is VALID [2022-04-28 03:53:00,915 INFO L290 TraceCheckUtils]: 10: Hoare triple {18373#(< 44 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {18369#(< 42 main_~y~0)} is VALID [2022-04-28 03:53:00,915 INFO L290 TraceCheckUtils]: 9: Hoare triple {18377#(or (< main_~x~0 1000000) (< 44 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[] {18373#(< 44 main_~y~0)} is VALID [2022-04-28 03:53:00,916 INFO L290 TraceCheckUtils]: 8: Hoare triple {18381#(and (or (< main_~x~0 1000000) (< 44 main_~y~0)) (or (<= 1000000 main_~x~0) (< main_~x~0 (+ main_~y~0 999956)) (not (<= 50000 main_~x~0))))} [146] L11-2-->L18-1_primed: Formula: (let ((.cse1 (= v_main_~x~0_1044 v_main_~x~0_1043)) (.cse2 (= |v_main_#t~post6_151| |v_main_#t~post6_150|)) (.cse3 (= v_main_~y~0_1087 v_main_~y~0_1086)) (.cse0 (<= 50000 v_main_~x~0_1044)) (.cse4 (= |v_main_#t~post5_151| |v_main_#t~post5_150|))) (or (and (< v_main_~x~0_1043 1000001) (= (+ v_main_~x~0_1043 v_main_~y~0_1087) (+ v_main_~x~0_1044 v_main_~y~0_1086)) .cse0 (< v_main_~x~0_1044 v_main_~x~0_1043)) (and .cse1 .cse2 .cse3 .cse4) (and .cse1 .cse2 .cse3 (or (not .cse0) (not (< v_main_~x~0_1044 1000000))) .cse4))) InVars {main_~y~0=v_main_~y~0_1087, main_#t~post5=|v_main_#t~post5_151|, main_~x~0=v_main_~x~0_1044, main_#t~post6=|v_main_#t~post6_151|} OutVars{main_~y~0=v_main_~y~0_1086, main_#t~post5=|v_main_#t~post5_150|, main_~x~0=v_main_~x~0_1043, main_#t~post6=|v_main_#t~post6_150|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {18377#(or (< main_~x~0 1000000) (< 44 main_~y~0))} is VALID [2022-04-28 03:53:00,917 INFO L290 TraceCheckUtils]: 7: Hoare triple {18381#(and (or (< main_~x~0 1000000) (< 44 main_~y~0)) (or (<= 1000000 main_~x~0) (< main_~x~0 (+ main_~y~0 999956)) (not (<= 50000 main_~x~0))))} [145] L18-1_primed-->L11-2: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {18381#(and (or (< main_~x~0 1000000) (< 44 main_~y~0)) (or (<= 1000000 main_~x~0) (< main_~x~0 (+ main_~y~0 999956)) (not (<= 50000 main_~x~0))))} is VALID [2022-04-28 03:53:00,917 INFO L290 TraceCheckUtils]: 6: Hoare triple {18388#(and (or (< main_~x~0 1000000) (< 44 main_~y~0)) (<= 0 (+ 949955 main_~y~0)) (or (<= 1000000 main_~x~0) (< main_~x~0 (+ main_~y~0 999956))))} [144] L11-2-->L18-1_primed: Formula: (let ((.cse0 (= v_main_~x~0_1042 v_main_~x~0_1041))) (or (and (= |v_main_#t~post4_140| |v_main_#t~post4_139|) .cse0) (and (= |v_main_#t~post4_139| |v_main_#t~post4_140|) (<= 50000 v_main_~x~0_1042) .cse0) (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_140|} OutVars{main_~x~0=v_main_~x~0_1041, main_#t~post4=|v_main_#t~post4_139|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {18381#(and (or (< main_~x~0 1000000) (< 44 main_~y~0)) (or (<= 1000000 main_~x~0) (< main_~x~0 (+ main_~y~0 999956)) (not (<= 50000 main_~x~0))))} is VALID [2022-04-28 03:53:00,918 INFO L290 TraceCheckUtils]: 5: Hoare triple {18107#true} ~x~0 := 0;~y~0 := 50000;~z~0 := 0;~x~0 := 0; {18388#(and (or (< main_~x~0 1000000) (< 44 main_~y~0)) (<= 0 (+ 949955 main_~y~0)) (or (<= 1000000 main_~x~0) (< main_~x~0 (+ main_~y~0 999956))))} is VALID [2022-04-28 03:53:00,918 INFO L272 TraceCheckUtils]: 4: Hoare triple {18107#true} call #t~ret7 := main(); {18107#true} is VALID [2022-04-28 03:53:00,918 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {18107#true} {18107#true} #52#return; {18107#true} is VALID [2022-04-28 03:53:00,918 INFO L290 TraceCheckUtils]: 2: Hoare triple {18107#true} assume true; {18107#true} is VALID [2022-04-28 03:53:00,918 INFO L290 TraceCheckUtils]: 1: Hoare triple {18107#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); {18107#true} is VALID [2022-04-28 03:53:00,918 INFO L272 TraceCheckUtils]: 0: Hoare triple {18107#true} call ULTIMATE.init(); {18107#true} is VALID [2022-04-28 03:53:00,918 INFO L134 CoverageAnalysis]: Checked inductivity of 255 backedges. 0 proven. 255 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 03:53:00,918 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [782767276] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 03:53:00,918 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 03:53:00,918 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 28, 28] total 78 [2022-04-28 03:53:02,877 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 03:53:02,877 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1037193153] [2022-04-28 03:53:02,877 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1037193153] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 03:53:02,877 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 03:53:02,877 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [70] imperfect sequences [] total 70 [2022-04-28 03:53:02,877 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1195184849] [2022-04-28 03:53:02,877 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 03:53:02,878 INFO L78 Accepts]: Start accepts. Automaton has has 70 states, 70 states have (on average 1.6571428571428573) internal successors, (116), 69 states have internal predecessors, (116), 2 states have call successors, (3), 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 120 [2022-04-28 03:53:02,878 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 03:53:02,878 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 70 states, 70 states have (on average 1.6571428571428573) internal successors, (116), 69 states have internal predecessors, (116), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:53:02,965 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 120 edges. 120 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 03:53:02,965 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 70 states [2022-04-28 03:53:02,965 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 03:53:02,966 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 70 interpolants. [2022-04-28 03:53:02,967 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5072, Invalid=9448, Unknown=0, NotChecked=0, Total=14520 [2022-04-28 03:53:02,967 INFO L87 Difference]: Start difference. First operand 121 states and 124 transitions. Second operand has 70 states, 70 states have (on average 1.6571428571428573) internal successors, (116), 69 states have internal predecessors, (116), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:53:10,956 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:53:10,956 INFO L93 Difference]: Finished difference Result 239 states and 250 transitions. [2022-04-28 03:53:10,956 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 70 states. [2022-04-28 03:53:10,957 INFO L78 Accepts]: Start accepts. Automaton has has 70 states, 70 states have (on average 1.6571428571428573) internal successors, (116), 69 states have internal predecessors, (116), 2 states have call successors, (3), 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 120 [2022-04-28 03:53:10,957 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 03:53:10,957 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 70 states, 70 states have (on average 1.6571428571428573) internal successors, (116), 69 states have internal predecessors, (116), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:53:10,958 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 142 transitions. [2022-04-28 03:53:10,958 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 70 states, 70 states have (on average 1.6571428571428573) internal successors, (116), 69 states have internal predecessors, (116), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:53:10,959 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 142 transitions. [2022-04-28 03:53:10,959 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 70 states and 142 transitions. [2022-04-28 03:53:11,064 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 142 edges. 142 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 03:53:11,066 INFO L225 Difference]: With dead ends: 239 [2022-04-28 03:53:11,066 INFO L226 Difference]: Without dead ends: 126 [2022-04-28 03:53:11,068 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 259 GetRequests, 72 SyntacticMatches, 1 SemanticMatches, 186 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11764 ImplicationChecksByTransitivity, 4.8s TimeCoverageRelationStatistics Valid=9741, Invalid=25415, Unknown=0, NotChecked=0, Total=35156 [2022-04-28 03:53:11,068 INFO L413 NwaCegarLoop]: 12 mSDtfsCounter, 281 mSDsluCounter, 32 mSDsCounter, 0 mSdLazyCounter, 3874 mSolverCounterSat, 173 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 281 SdHoareTripleChecker+Valid, 44 SdHoareTripleChecker+Invalid, 4047 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 173 IncrementalHoareTripleChecker+Valid, 3874 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.0s IncrementalHoareTripleChecker+Time [2022-04-28 03:53:11,068 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [281 Valid, 44 Invalid, 4047 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [173 Valid, 3874 Invalid, 0 Unknown, 0 Unchecked, 3.0s Time] [2022-04-28 03:53:11,069 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 126 states. [2022-04-28 03:53:11,239 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 126 to 126. [2022-04-28 03:53:11,240 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 03:53:11,240 INFO L82 GeneralOperation]: Start isEquivalent. First operand 126 states. Second operand has 126 states, 121 states have (on average 1.0330578512396693) internal successors, (125), 121 states have internal predecessors, (125), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:53:11,240 INFO L74 IsIncluded]: Start isIncluded. First operand 126 states. Second operand has 126 states, 121 states have (on average 1.0330578512396693) internal successors, (125), 121 states have internal predecessors, (125), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:53:11,240 INFO L87 Difference]: Start difference. First operand 126 states. Second operand has 126 states, 121 states have (on average 1.0330578512396693) internal successors, (125), 121 states have internal predecessors, (125), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:53:11,241 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:53:11,241 INFO L93 Difference]: Finished difference Result 126 states and 129 transitions. [2022-04-28 03:53:11,241 INFO L276 IsEmpty]: Start isEmpty. Operand 126 states and 129 transitions. [2022-04-28 03:53:11,241 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:53:11,241 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:53:11,242 INFO L74 IsIncluded]: Start isIncluded. First operand has 126 states, 121 states have (on average 1.0330578512396693) internal successors, (125), 121 states have internal predecessors, (125), 3 states have call successors, (3), 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 126 states. [2022-04-28 03:53:11,242 INFO L87 Difference]: Start difference. First operand has 126 states, 121 states have (on average 1.0330578512396693) internal successors, (125), 121 states have internal predecessors, (125), 3 states have call successors, (3), 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 126 states. [2022-04-28 03:53:11,243 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:53:11,243 INFO L93 Difference]: Finished difference Result 126 states and 129 transitions. [2022-04-28 03:53:11,243 INFO L276 IsEmpty]: Start isEmpty. Operand 126 states and 129 transitions. [2022-04-28 03:53:11,243 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:53:11,243 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:53:11,243 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 03:53:11,243 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 03:53:11,243 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 126 states, 121 states have (on average 1.0330578512396693) internal successors, (125), 121 states have internal predecessors, (125), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:53:11,244 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 126 states to 126 states and 129 transitions. [2022-04-28 03:53:11,244 INFO L78 Accepts]: Start accepts. Automaton has 126 states and 129 transitions. Word has length 120 [2022-04-28 03:53:11,244 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 03:53:11,244 INFO L495 AbstractCegarLoop]: Abstraction has 126 states and 129 transitions. [2022-04-28 03:53:11,245 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 70 states, 70 states have (on average 1.6571428571428573) internal successors, (116), 69 states have internal predecessors, (116), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:53:11,245 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 126 states and 129 transitions. [2022-04-28 03:53:11,344 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 129 edges. 129 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 03:53:11,344 INFO L276 IsEmpty]: Start isEmpty. Operand 126 states and 129 transitions. [2022-04-28 03:53:11,345 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2022-04-28 03:53:11,345 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 03:53:11,345 INFO L195 NwaCegarLoop]: trace histogram [45, 44, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 03:53:11,361 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-28 03:53:11,559 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24,23 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 03:53:11,559 INFO L420 AbstractCegarLoop]: === Iteration 26 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 03:53:11,559 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 03:53:11,560 INFO L85 PathProgramCache]: Analyzing trace with hash 477068397, now seen corresponding path program 23 times [2022-04-28 03:53:11,560 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 03:53:11,560 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [38444146] [2022-04-28 03:53:11,659 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 1 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 03:53:11,909 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={1=1, 2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 03:53:11,910 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-28 03:53:11,912 INFO L85 PathProgramCache]: Analyzing trace with hash 1178090274, now seen corresponding path program 1 times [2022-04-28 03:53:11,912 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 03:53:11,912 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [372677678] [2022-04-28 03:53:11,912 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:53:11,912 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 03:53:11,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:53:12,291 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 03:53:12,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:53:12,295 INFO L290 TraceCheckUtils]: 0: Hoare triple {19600#(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); {19568#true} is VALID [2022-04-28 03:53:12,295 INFO L290 TraceCheckUtils]: 1: Hoare triple {19568#true} assume true; {19568#true} is VALID [2022-04-28 03:53:12,295 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {19568#true} {19568#true} #52#return; {19568#true} is VALID [2022-04-28 03:53:12,296 INFO L272 TraceCheckUtils]: 0: Hoare triple {19568#true} call ULTIMATE.init(); {19600#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 03:53:12,296 INFO L290 TraceCheckUtils]: 1: Hoare triple {19600#(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); {19568#true} is VALID [2022-04-28 03:53:12,296 INFO L290 TraceCheckUtils]: 2: Hoare triple {19568#true} assume true; {19568#true} is VALID [2022-04-28 03:53:12,296 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {19568#true} {19568#true} #52#return; {19568#true} is VALID [2022-04-28 03:53:12,296 INFO L272 TraceCheckUtils]: 4: Hoare triple {19568#true} call #t~ret7 := main(); {19568#true} is VALID [2022-04-28 03:53:12,296 INFO L290 TraceCheckUtils]: 5: Hoare triple {19568#true} ~x~0 := 0;~y~0 := 50000;~z~0 := 0;~x~0 := 0; {19573#(and (= main_~x~0 0) (<= 50000 main_~y~0))} is VALID [2022-04-28 03:53:12,297 INFO L290 TraceCheckUtils]: 6: Hoare triple {19573#(and (= main_~x~0 0) (<= 50000 main_~y~0))} [148] L11-2-->L18-1_primed: Formula: (let ((.cse0 (= v_main_~x~0_1124 v_main_~x~0_1123)) (.cse1 (= |v_main_#t~post4_147| |v_main_#t~post4_146|))) (or (and (< v_main_~x~0_1123 50001) (< v_main_~x~0_1124 v_main_~x~0_1123)) (and .cse0 .cse1) (and (<= 50000 v_main_~x~0_1124) .cse0 .cse1))) InVars {main_~x~0=v_main_~x~0_1124, main_#t~post4=|v_main_#t~post4_147|} OutVars{main_~x~0=v_main_~x~0_1123, main_#t~post4=|v_main_#t~post4_146|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {19574#(and (<= main_~x~0 main_~y~0) (<= 50000 main_~y~0))} is VALID [2022-04-28 03:53:12,297 INFO L290 TraceCheckUtils]: 7: Hoare triple {19574#(and (<= main_~x~0 main_~y~0) (<= 50000 main_~y~0))} [149] L18-1_primed-->L11-2: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {19574#(and (<= main_~x~0 main_~y~0) (<= 50000 main_~y~0))} is VALID [2022-04-28 03:53:12,298 INFO L290 TraceCheckUtils]: 8: Hoare triple {19574#(and (<= main_~x~0 main_~y~0) (<= 50000 main_~y~0))} [150] L11-2-->L18-1_primed: Formula: (let ((.cse0 (<= 50000 v_main_~x~0_1126)) (.cse1 (= |v_main_#t~post6_158| |v_main_#t~post6_157|)) (.cse2 (= v_main_~y~0_1182 v_main_~y~0_1181)) (.cse3 (= v_main_~x~0_1126 v_main_~x~0_1125)) (.cse4 (= |v_main_#t~post5_158| |v_main_#t~post5_157|))) (or (and .cse0 (= (+ v_main_~x~0_1126 v_main_~y~0_1181) (+ v_main_~x~0_1125 v_main_~y~0_1182)) (< v_main_~x~0_1125 1000001) (< v_main_~x~0_1126 v_main_~x~0_1125)) (and .cse1 .cse2 .cse3 .cse4 (or (not (< v_main_~x~0_1126 1000000)) (not .cse0))) (and .cse1 .cse2 .cse3 .cse4))) InVars {main_~y~0=v_main_~y~0_1182, main_#t~post5=|v_main_#t~post5_158|, main_~x~0=v_main_~x~0_1126, main_#t~post6=|v_main_#t~post6_158|} OutVars{main_~y~0=v_main_~y~0_1181, main_#t~post5=|v_main_#t~post5_157|, main_~x~0=v_main_~x~0_1125, main_#t~post6=|v_main_#t~post6_157|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {19575#(or (<= main_~x~0 main_~y~0) (<= 50000 main_~y~0))} is VALID [2022-04-28 03:53:12,298 INFO L290 TraceCheckUtils]: 9: Hoare triple {19575#(or (<= main_~x~0 main_~y~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[] {19576#(<= 50000 main_~y~0)} is VALID [2022-04-28 03:53:12,299 INFO L290 TraceCheckUtils]: 10: Hoare triple {19576#(<= 50000 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {19577#(<= 49998 main_~y~0)} is VALID [2022-04-28 03:53:12,299 INFO L290 TraceCheckUtils]: 11: Hoare triple {19577#(<= 49998 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {19578#(<= 49996 main_~y~0)} is VALID [2022-04-28 03:53:12,300 INFO L290 TraceCheckUtils]: 12: Hoare triple {19578#(<= 49996 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {19579#(<= 49994 main_~y~0)} is VALID [2022-04-28 03:53:12,300 INFO L290 TraceCheckUtils]: 13: Hoare triple {19579#(<= 49994 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {19580#(<= 49992 main_~y~0)} is VALID [2022-04-28 03:53:12,300 INFO L290 TraceCheckUtils]: 14: Hoare triple {19580#(<= 49992 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {19581#(<= 49990 main_~y~0)} is VALID [2022-04-28 03:53:12,301 INFO L290 TraceCheckUtils]: 15: Hoare triple {19581#(<= 49990 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {19582#(<= 49988 main_~y~0)} is VALID [2022-04-28 03:53:12,301 INFO L290 TraceCheckUtils]: 16: Hoare triple {19582#(<= 49988 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {19583#(<= 49986 main_~y~0)} is VALID [2022-04-28 03:53:12,302 INFO L290 TraceCheckUtils]: 17: Hoare triple {19583#(<= 49986 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {19584#(<= 49984 main_~y~0)} is VALID [2022-04-28 03:53:12,302 INFO L290 TraceCheckUtils]: 18: Hoare triple {19584#(<= 49984 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {19585#(<= 49982 main_~y~0)} is VALID [2022-04-28 03:53:12,302 INFO L290 TraceCheckUtils]: 19: Hoare triple {19585#(<= 49982 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {19586#(<= 49980 main_~y~0)} is VALID [2022-04-28 03:53:12,303 INFO L290 TraceCheckUtils]: 20: Hoare triple {19586#(<= 49980 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {19587#(<= 49978 main_~y~0)} is VALID [2022-04-28 03:53:12,303 INFO L290 TraceCheckUtils]: 21: Hoare triple {19587#(<= 49978 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {19588#(<= 49976 main_~y~0)} is VALID [2022-04-28 03:53:12,304 INFO L290 TraceCheckUtils]: 22: Hoare triple {19588#(<= 49976 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {19589#(<= 49974 main_~y~0)} is VALID [2022-04-28 03:53:12,304 INFO L290 TraceCheckUtils]: 23: Hoare triple {19589#(<= 49974 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {19590#(<= 49972 main_~y~0)} is VALID [2022-04-28 03:53:12,305 INFO L290 TraceCheckUtils]: 24: Hoare triple {19590#(<= 49972 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {19591#(<= 49970 main_~y~0)} is VALID [2022-04-28 03:53:12,305 INFO L290 TraceCheckUtils]: 25: Hoare triple {19591#(<= 49970 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {19592#(<= 49968 main_~y~0)} is VALID [2022-04-28 03:53:12,305 INFO L290 TraceCheckUtils]: 26: Hoare triple {19592#(<= 49968 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {19593#(<= 49966 main_~y~0)} is VALID [2022-04-28 03:53:12,306 INFO L290 TraceCheckUtils]: 27: Hoare triple {19593#(<= 49966 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {19594#(<= 49964 main_~y~0)} is VALID [2022-04-28 03:53:12,306 INFO L290 TraceCheckUtils]: 28: Hoare triple {19594#(<= 49964 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {19595#(<= 49962 main_~y~0)} is VALID [2022-04-28 03:53:12,307 INFO L290 TraceCheckUtils]: 29: Hoare triple {19595#(<= 49962 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {19596#(<= 49960 main_~y~0)} is VALID [2022-04-28 03:53:12,307 INFO L290 TraceCheckUtils]: 30: Hoare triple {19596#(<= 49960 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {19597#(<= 49958 main_~y~0)} is VALID [2022-04-28 03:53:12,307 INFO L290 TraceCheckUtils]: 31: Hoare triple {19597#(<= 49958 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {19598#(<= 49956 main_~y~0)} is VALID [2022-04-28 03:53:12,308 INFO L290 TraceCheckUtils]: 32: Hoare triple {19598#(<= 49956 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {19599#(<= 49954 main_~y~0)} is VALID [2022-04-28 03:53:12,308 INFO L290 TraceCheckUtils]: 33: Hoare triple {19599#(<= 49954 main_~y~0)} assume !(~y~0 > 0); {19569#false} is VALID [2022-04-28 03:53:12,308 INFO L272 TraceCheckUtils]: 34: Hoare triple {19569#false} call __VERIFIER_assert((if ~z~0 == ~x~0 then 1 else 0)); {19569#false} is VALID [2022-04-28 03:53:12,308 INFO L290 TraceCheckUtils]: 35: Hoare triple {19569#false} ~cond := #in~cond; {19569#false} is VALID [2022-04-28 03:53:12,308 INFO L290 TraceCheckUtils]: 36: Hoare triple {19569#false} assume 0 == ~cond; {19569#false} is VALID [2022-04-28 03:53:12,308 INFO L290 TraceCheckUtils]: 37: Hoare triple {19569#false} assume !false; {19569#false} is VALID [2022-04-28 03:53:12,309 INFO L134 CoverageAnalysis]: Checked inductivity of 278 backedges. 0 proven. 278 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 03:53:12,309 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 03:53:12,309 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [372677678] [2022-04-28 03:53:12,309 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [372677678] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 03:53:12,309 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [843586962] [2022-04-28 03:53:12,309 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:53:12,309 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 03:53:12,309 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 03:53:12,310 INFO L229 MonitoredProcess]: Starting monitored process 24 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 03:53:12,310 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (24)] Waiting until timeout for monitored process [2022-04-28 03:53:12,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:53:12,349 INFO L263 TraceCheckSpWp]: Trace formula consists of 174 conjuncts, 26 conjunts are in the unsatisfiable core [2022-04-28 03:53:12,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:53:12,363 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 03:53:12,708 INFO L272 TraceCheckUtils]: 0: Hoare triple {19568#true} call ULTIMATE.init(); {19568#true} is VALID [2022-04-28 03:53:12,708 INFO L290 TraceCheckUtils]: 1: Hoare triple {19568#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); {19568#true} is VALID [2022-04-28 03:53:12,708 INFO L290 TraceCheckUtils]: 2: Hoare triple {19568#true} assume true; {19568#true} is VALID [2022-04-28 03:53:12,708 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {19568#true} {19568#true} #52#return; {19568#true} is VALID [2022-04-28 03:53:12,708 INFO L272 TraceCheckUtils]: 4: Hoare triple {19568#true} call #t~ret7 := main(); {19568#true} is VALID [2022-04-28 03:53:12,709 INFO L290 TraceCheckUtils]: 5: Hoare triple {19568#true} ~x~0 := 0;~y~0 := 50000;~z~0 := 0;~x~0 := 0; {19576#(<= 50000 main_~y~0)} is VALID [2022-04-28 03:53:12,709 INFO L290 TraceCheckUtils]: 6: Hoare triple {19576#(<= 50000 main_~y~0)} [148] L11-2-->L18-1_primed: Formula: (let ((.cse0 (= v_main_~x~0_1124 v_main_~x~0_1123)) (.cse1 (= |v_main_#t~post4_147| |v_main_#t~post4_146|))) (or (and (< v_main_~x~0_1123 50001) (< v_main_~x~0_1124 v_main_~x~0_1123)) (and .cse0 .cse1) (and (<= 50000 v_main_~x~0_1124) .cse0 .cse1))) InVars {main_~x~0=v_main_~x~0_1124, main_#t~post4=|v_main_#t~post4_147|} OutVars{main_~x~0=v_main_~x~0_1123, main_#t~post4=|v_main_#t~post4_146|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {19576#(<= 50000 main_~y~0)} is VALID [2022-04-28 03:53:12,709 INFO L290 TraceCheckUtils]: 7: Hoare triple {19576#(<= 50000 main_~y~0)} [149] L18-1_primed-->L11-2: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {19576#(<= 50000 main_~y~0)} is VALID [2022-04-28 03:53:12,710 INFO L290 TraceCheckUtils]: 8: Hoare triple {19576#(<= 50000 main_~y~0)} [150] L11-2-->L18-1_primed: Formula: (let ((.cse0 (<= 50000 v_main_~x~0_1126)) (.cse1 (= |v_main_#t~post6_158| |v_main_#t~post6_157|)) (.cse2 (= v_main_~y~0_1182 v_main_~y~0_1181)) (.cse3 (= v_main_~x~0_1126 v_main_~x~0_1125)) (.cse4 (= |v_main_#t~post5_158| |v_main_#t~post5_157|))) (or (and .cse0 (= (+ v_main_~x~0_1126 v_main_~y~0_1181) (+ v_main_~x~0_1125 v_main_~y~0_1182)) (< v_main_~x~0_1125 1000001) (< v_main_~x~0_1126 v_main_~x~0_1125)) (and .cse1 .cse2 .cse3 .cse4 (or (not (< v_main_~x~0_1126 1000000)) (not .cse0))) (and .cse1 .cse2 .cse3 .cse4))) InVars {main_~y~0=v_main_~y~0_1182, main_#t~post5=|v_main_#t~post5_158|, main_~x~0=v_main_~x~0_1126, main_#t~post6=|v_main_#t~post6_158|} OutVars{main_~y~0=v_main_~y~0_1181, main_#t~post5=|v_main_#t~post5_157|, main_~x~0=v_main_~x~0_1125, main_#t~post6=|v_main_#t~post6_157|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {19576#(<= 50000 main_~y~0)} is VALID [2022-04-28 03:53:12,710 INFO L290 TraceCheckUtils]: 9: Hoare triple {19576#(<= 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[] {19576#(<= 50000 main_~y~0)} is VALID [2022-04-28 03:53:12,711 INFO L290 TraceCheckUtils]: 10: Hoare triple {19576#(<= 50000 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {19577#(<= 49998 main_~y~0)} is VALID [2022-04-28 03:53:12,711 INFO L290 TraceCheckUtils]: 11: Hoare triple {19577#(<= 49998 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {19578#(<= 49996 main_~y~0)} is VALID [2022-04-28 03:53:12,712 INFO L290 TraceCheckUtils]: 12: Hoare triple {19578#(<= 49996 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {19579#(<= 49994 main_~y~0)} is VALID [2022-04-28 03:53:12,712 INFO L290 TraceCheckUtils]: 13: Hoare triple {19579#(<= 49994 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {19580#(<= 49992 main_~y~0)} is VALID [2022-04-28 03:53:12,712 INFO L290 TraceCheckUtils]: 14: Hoare triple {19580#(<= 49992 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {19581#(<= 49990 main_~y~0)} is VALID [2022-04-28 03:53:12,713 INFO L290 TraceCheckUtils]: 15: Hoare triple {19581#(<= 49990 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {19582#(<= 49988 main_~y~0)} is VALID [2022-04-28 03:53:12,713 INFO L290 TraceCheckUtils]: 16: Hoare triple {19582#(<= 49988 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {19583#(<= 49986 main_~y~0)} is VALID [2022-04-28 03:53:12,714 INFO L290 TraceCheckUtils]: 17: Hoare triple {19583#(<= 49986 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {19584#(<= 49984 main_~y~0)} is VALID [2022-04-28 03:53:12,714 INFO L290 TraceCheckUtils]: 18: Hoare triple {19584#(<= 49984 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {19585#(<= 49982 main_~y~0)} is VALID [2022-04-28 03:53:12,714 INFO L290 TraceCheckUtils]: 19: Hoare triple {19585#(<= 49982 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {19586#(<= 49980 main_~y~0)} is VALID [2022-04-28 03:53:12,715 INFO L290 TraceCheckUtils]: 20: Hoare triple {19586#(<= 49980 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {19587#(<= 49978 main_~y~0)} is VALID [2022-04-28 03:53:12,715 INFO L290 TraceCheckUtils]: 21: Hoare triple {19587#(<= 49978 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {19588#(<= 49976 main_~y~0)} is VALID [2022-04-28 03:53:12,716 INFO L290 TraceCheckUtils]: 22: Hoare triple {19588#(<= 49976 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {19589#(<= 49974 main_~y~0)} is VALID [2022-04-28 03:53:12,716 INFO L290 TraceCheckUtils]: 23: Hoare triple {19589#(<= 49974 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {19590#(<= 49972 main_~y~0)} is VALID [2022-04-28 03:53:12,717 INFO L290 TraceCheckUtils]: 24: Hoare triple {19590#(<= 49972 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {19591#(<= 49970 main_~y~0)} is VALID [2022-04-28 03:53:12,717 INFO L290 TraceCheckUtils]: 25: Hoare triple {19591#(<= 49970 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {19592#(<= 49968 main_~y~0)} is VALID [2022-04-28 03:53:12,718 INFO L290 TraceCheckUtils]: 26: Hoare triple {19592#(<= 49968 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {19593#(<= 49966 main_~y~0)} is VALID [2022-04-28 03:53:12,718 INFO L290 TraceCheckUtils]: 27: Hoare triple {19593#(<= 49966 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {19594#(<= 49964 main_~y~0)} is VALID [2022-04-28 03:53:12,719 INFO L290 TraceCheckUtils]: 28: Hoare triple {19594#(<= 49964 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {19595#(<= 49962 main_~y~0)} is VALID [2022-04-28 03:53:12,719 INFO L290 TraceCheckUtils]: 29: Hoare triple {19595#(<= 49962 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {19596#(<= 49960 main_~y~0)} is VALID [2022-04-28 03:53:12,720 INFO L290 TraceCheckUtils]: 30: Hoare triple {19596#(<= 49960 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {19597#(<= 49958 main_~y~0)} is VALID [2022-04-28 03:53:12,720 INFO L290 TraceCheckUtils]: 31: Hoare triple {19597#(<= 49958 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {19598#(<= 49956 main_~y~0)} is VALID [2022-04-28 03:53:12,721 INFO L290 TraceCheckUtils]: 32: Hoare triple {19598#(<= 49956 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {19599#(<= 49954 main_~y~0)} is VALID [2022-04-28 03:53:12,721 INFO L290 TraceCheckUtils]: 33: Hoare triple {19599#(<= 49954 main_~y~0)} assume !(~y~0 > 0); {19569#false} is VALID [2022-04-28 03:53:12,721 INFO L272 TraceCheckUtils]: 34: Hoare triple {19569#false} call __VERIFIER_assert((if ~z~0 == ~x~0 then 1 else 0)); {19569#false} is VALID [2022-04-28 03:53:12,721 INFO L290 TraceCheckUtils]: 35: Hoare triple {19569#false} ~cond := #in~cond; {19569#false} is VALID [2022-04-28 03:53:12,721 INFO L290 TraceCheckUtils]: 36: Hoare triple {19569#false} assume 0 == ~cond; {19569#false} is VALID [2022-04-28 03:53:12,721 INFO L290 TraceCheckUtils]: 37: Hoare triple {19569#false} assume !false; {19569#false} is VALID [2022-04-28 03:53:12,722 INFO L134 CoverageAnalysis]: Checked inductivity of 278 backedges. 0 proven. 276 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-04-28 03:53:12,722 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 03:53:13,721 INFO L290 TraceCheckUtils]: 37: Hoare triple {19569#false} assume !false; {19569#false} is VALID [2022-04-28 03:53:13,721 INFO L290 TraceCheckUtils]: 36: Hoare triple {19569#false} assume 0 == ~cond; {19569#false} is VALID [2022-04-28 03:53:13,721 INFO L290 TraceCheckUtils]: 35: Hoare triple {19569#false} ~cond := #in~cond; {19569#false} is VALID [2022-04-28 03:53:13,721 INFO L272 TraceCheckUtils]: 34: Hoare triple {19569#false} call __VERIFIER_assert((if ~z~0 == ~x~0 then 1 else 0)); {19569#false} is VALID [2022-04-28 03:53:13,722 INFO L290 TraceCheckUtils]: 33: Hoare triple {19727#(< 0 main_~y~0)} assume !(~y~0 > 0); {19569#false} is VALID [2022-04-28 03:53:13,722 INFO L290 TraceCheckUtils]: 32: Hoare triple {19731#(< 2 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {19727#(< 0 main_~y~0)} is VALID [2022-04-28 03:53:13,723 INFO L290 TraceCheckUtils]: 31: Hoare triple {19735#(< 4 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {19731#(< 2 main_~y~0)} is VALID [2022-04-28 03:53:13,723 INFO L290 TraceCheckUtils]: 30: Hoare triple {19739#(< 6 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {19735#(< 4 main_~y~0)} is VALID [2022-04-28 03:53:13,724 INFO L290 TraceCheckUtils]: 29: Hoare triple {19743#(< 8 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {19739#(< 6 main_~y~0)} is VALID [2022-04-28 03:53:13,724 INFO L290 TraceCheckUtils]: 28: Hoare triple {19747#(< 10 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {19743#(< 8 main_~y~0)} is VALID [2022-04-28 03:53:13,725 INFO L290 TraceCheckUtils]: 27: Hoare triple {19751#(< 12 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {19747#(< 10 main_~y~0)} is VALID [2022-04-28 03:53:13,725 INFO L290 TraceCheckUtils]: 26: Hoare triple {19755#(< 14 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {19751#(< 12 main_~y~0)} is VALID [2022-04-28 03:53:13,726 INFO L290 TraceCheckUtils]: 25: Hoare triple {19759#(< 16 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {19755#(< 14 main_~y~0)} is VALID [2022-04-28 03:53:13,726 INFO L290 TraceCheckUtils]: 24: Hoare triple {19763#(< 18 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {19759#(< 16 main_~y~0)} is VALID [2022-04-28 03:53:13,727 INFO L290 TraceCheckUtils]: 23: Hoare triple {19767#(< 20 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {19763#(< 18 main_~y~0)} is VALID [2022-04-28 03:53:13,727 INFO L290 TraceCheckUtils]: 22: Hoare triple {19771#(< 22 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {19767#(< 20 main_~y~0)} is VALID [2022-04-28 03:53:13,728 INFO L290 TraceCheckUtils]: 21: Hoare triple {19775#(< 24 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {19771#(< 22 main_~y~0)} is VALID [2022-04-28 03:53:13,728 INFO L290 TraceCheckUtils]: 20: Hoare triple {19779#(< 26 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {19775#(< 24 main_~y~0)} is VALID [2022-04-28 03:53:13,729 INFO L290 TraceCheckUtils]: 19: Hoare triple {19783#(< 28 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {19779#(< 26 main_~y~0)} is VALID [2022-04-28 03:53:13,729 INFO L290 TraceCheckUtils]: 18: Hoare triple {19787#(< 30 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {19783#(< 28 main_~y~0)} is VALID [2022-04-28 03:53:13,730 INFO L290 TraceCheckUtils]: 17: Hoare triple {19791#(< 32 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {19787#(< 30 main_~y~0)} is VALID [2022-04-28 03:53:13,730 INFO L290 TraceCheckUtils]: 16: Hoare triple {19795#(< 34 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {19791#(< 32 main_~y~0)} is VALID [2022-04-28 03:53:13,730 INFO L290 TraceCheckUtils]: 15: Hoare triple {19799#(< 36 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {19795#(< 34 main_~y~0)} is VALID [2022-04-28 03:53:13,731 INFO L290 TraceCheckUtils]: 14: Hoare triple {19803#(< 38 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {19799#(< 36 main_~y~0)} is VALID [2022-04-28 03:53:13,731 INFO L290 TraceCheckUtils]: 13: Hoare triple {19807#(< 40 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {19803#(< 38 main_~y~0)} is VALID [2022-04-28 03:53:13,732 INFO L290 TraceCheckUtils]: 12: Hoare triple {19811#(< 42 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {19807#(< 40 main_~y~0)} is VALID [2022-04-28 03:53:13,732 INFO L290 TraceCheckUtils]: 11: Hoare triple {19815#(< 44 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {19811#(< 42 main_~y~0)} is VALID [2022-04-28 03:53:13,733 INFO L290 TraceCheckUtils]: 10: Hoare triple {19819#(< 46 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {19815#(< 44 main_~y~0)} is VALID [2022-04-28 03:53:13,733 INFO L290 TraceCheckUtils]: 9: Hoare triple {19819#(< 46 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[] {19819#(< 46 main_~y~0)} is VALID [2022-04-28 03:53:13,734 INFO L290 TraceCheckUtils]: 8: Hoare triple {19819#(< 46 main_~y~0)} [150] L11-2-->L18-1_primed: Formula: (let ((.cse0 (<= 50000 v_main_~x~0_1126)) (.cse1 (= |v_main_#t~post6_158| |v_main_#t~post6_157|)) (.cse2 (= v_main_~y~0_1182 v_main_~y~0_1181)) (.cse3 (= v_main_~x~0_1126 v_main_~x~0_1125)) (.cse4 (= |v_main_#t~post5_158| |v_main_#t~post5_157|))) (or (and .cse0 (= (+ v_main_~x~0_1126 v_main_~y~0_1181) (+ v_main_~x~0_1125 v_main_~y~0_1182)) (< v_main_~x~0_1125 1000001) (< v_main_~x~0_1126 v_main_~x~0_1125)) (and .cse1 .cse2 .cse3 .cse4 (or (not (< v_main_~x~0_1126 1000000)) (not .cse0))) (and .cse1 .cse2 .cse3 .cse4))) InVars {main_~y~0=v_main_~y~0_1182, main_#t~post5=|v_main_#t~post5_158|, main_~x~0=v_main_~x~0_1126, main_#t~post6=|v_main_#t~post6_158|} OutVars{main_~y~0=v_main_~y~0_1181, main_#t~post5=|v_main_#t~post5_157|, main_~x~0=v_main_~x~0_1125, main_#t~post6=|v_main_#t~post6_157|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {19819#(< 46 main_~y~0)} is VALID [2022-04-28 03:53:13,734 INFO L290 TraceCheckUtils]: 7: Hoare triple {19819#(< 46 main_~y~0)} [149] L18-1_primed-->L11-2: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {19819#(< 46 main_~y~0)} is VALID [2022-04-28 03:53:13,734 INFO L290 TraceCheckUtils]: 6: Hoare triple {19819#(< 46 main_~y~0)} [148] L11-2-->L18-1_primed: Formula: (let ((.cse0 (= v_main_~x~0_1124 v_main_~x~0_1123)) (.cse1 (= |v_main_#t~post4_147| |v_main_#t~post4_146|))) (or (and (< v_main_~x~0_1123 50001) (< v_main_~x~0_1124 v_main_~x~0_1123)) (and .cse0 .cse1) (and (<= 50000 v_main_~x~0_1124) .cse0 .cse1))) InVars {main_~x~0=v_main_~x~0_1124, main_#t~post4=|v_main_#t~post4_147|} OutVars{main_~x~0=v_main_~x~0_1123, main_#t~post4=|v_main_#t~post4_146|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {19819#(< 46 main_~y~0)} is VALID [2022-04-28 03:53:13,735 INFO L290 TraceCheckUtils]: 5: Hoare triple {19568#true} ~x~0 := 0;~y~0 := 50000;~z~0 := 0;~x~0 := 0; {19819#(< 46 main_~y~0)} is VALID [2022-04-28 03:53:13,735 INFO L272 TraceCheckUtils]: 4: Hoare triple {19568#true} call #t~ret7 := main(); {19568#true} is VALID [2022-04-28 03:53:13,735 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {19568#true} {19568#true} #52#return; {19568#true} is VALID [2022-04-28 03:53:13,735 INFO L290 TraceCheckUtils]: 2: Hoare triple {19568#true} assume true; {19568#true} is VALID [2022-04-28 03:53:13,735 INFO L290 TraceCheckUtils]: 1: Hoare triple {19568#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); {19568#true} is VALID [2022-04-28 03:53:13,735 INFO L272 TraceCheckUtils]: 0: Hoare triple {19568#true} call ULTIMATE.init(); {19568#true} is VALID [2022-04-28 03:53:13,735 INFO L134 CoverageAnalysis]: Checked inductivity of 278 backedges. 0 proven. 276 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-04-28 03:53:13,735 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [843586962] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 03:53:13,736 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 03:53:13,736 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [30, 26, 26] total 54 [2022-04-28 03:53:15,390 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 03:53:15,390 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [38444146] [2022-04-28 03:53:15,390 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [38444146] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 03:53:15,390 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 03:53:15,390 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [73] imperfect sequences [] total 73 [2022-04-28 03:53:15,390 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [9629910] [2022-04-28 03:53:15,390 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 03:53:15,391 INFO L78 Accepts]: Start accepts. Automaton has has 73 states, 73 states have (on average 1.6575342465753424) internal successors, (121), 72 states have internal predecessors, (121), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 125 [2022-04-28 03:53:15,391 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 03:53:15,391 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 73 states, 73 states have (on average 1.6575342465753424) internal successors, (121), 72 states have internal predecessors, (121), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:53:15,474 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 125 edges. 125 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 03:53:15,474 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 73 states [2022-04-28 03:53:15,474 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 03:53:15,475 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 73 interpolants. [2022-04-28 03:53:15,476 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3727, Invalid=6173, Unknown=0, NotChecked=0, Total=9900 [2022-04-28 03:53:15,476 INFO L87 Difference]: Start difference. First operand 126 states and 129 transitions. Second operand has 73 states, 73 states have (on average 1.6575342465753424) internal successors, (121), 72 states have internal predecessors, (121), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:53:24,146 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:53:24,146 INFO L93 Difference]: Finished difference Result 335 states and 346 transitions. [2022-04-28 03:53:24,146 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 73 states. [2022-04-28 03:53:24,146 INFO L78 Accepts]: Start accepts. Automaton has has 73 states, 73 states have (on average 1.6575342465753424) internal successors, (121), 72 states have internal predecessors, (121), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 125 [2022-04-28 03:53:24,146 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 03:53:24,147 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 73 states, 73 states have (on average 1.6575342465753424) internal successors, (121), 72 states have internal predecessors, (121), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:53:24,147 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 147 transitions. [2022-04-28 03:53:24,148 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 73 states, 73 states have (on average 1.6575342465753424) internal successors, (121), 72 states have internal predecessors, (121), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:53:24,148 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 147 transitions. [2022-04-28 03:53:24,149 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 73 states and 147 transitions. [2022-04-28 03:53:24,263 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 147 edges. 147 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 03:53:24,265 INFO L225 Difference]: With dead ends: 335 [2022-04-28 03:53:24,265 INFO L226 Difference]: Without dead ends: 217 [2022-04-28 03:53:24,267 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 271 GetRequests, 102 SyntacticMatches, 1 SemanticMatches, 168 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8423 ImplicationChecksByTransitivity, 4.0s TimeCoverageRelationStatistics Valid=8542, Invalid=20188, Unknown=0, NotChecked=0, Total=28730 [2022-04-28 03:53:24,268 INFO L413 NwaCegarLoop]: 12 mSDtfsCounter, 291 mSDsluCounter, 32 mSDsCounter, 0 mSdLazyCounter, 4446 mSolverCounterSat, 317 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 291 SdHoareTripleChecker+Valid, 44 SdHoareTripleChecker+Invalid, 4763 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 317 IncrementalHoareTripleChecker+Valid, 4446 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.4s IncrementalHoareTripleChecker+Time [2022-04-28 03:53:24,268 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [291 Valid, 44 Invalid, 4763 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [317 Valid, 4446 Invalid, 0 Unknown, 0 Unchecked, 3.4s Time] [2022-04-28 03:53:24,268 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 217 states. [2022-04-28 03:53:24,620 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 217 to 217. [2022-04-28 03:53:24,620 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 03:53:24,621 INFO L82 GeneralOperation]: Start isEquivalent. First operand 217 states. Second operand has 217 states, 212 states have (on average 1.0235849056603774) internal successors, (217), 212 states have internal predecessors, (217), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:53:24,621 INFO L74 IsIncluded]: Start isIncluded. First operand 217 states. Second operand has 217 states, 212 states have (on average 1.0235849056603774) internal successors, (217), 212 states have internal predecessors, (217), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:53:24,621 INFO L87 Difference]: Start difference. First operand 217 states. Second operand has 217 states, 212 states have (on average 1.0235849056603774) internal successors, (217), 212 states have internal predecessors, (217), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:53:24,623 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:53:24,623 INFO L93 Difference]: Finished difference Result 217 states and 221 transitions. [2022-04-28 03:53:24,623 INFO L276 IsEmpty]: Start isEmpty. Operand 217 states and 221 transitions. [2022-04-28 03:53:24,623 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:53:24,623 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:53:24,624 INFO L74 IsIncluded]: Start isIncluded. First operand has 217 states, 212 states have (on average 1.0235849056603774) internal successors, (217), 212 states have internal predecessors, (217), 3 states have call successors, (3), 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 217 states. [2022-04-28 03:53:24,624 INFO L87 Difference]: Start difference. First operand has 217 states, 212 states have (on average 1.0235849056603774) internal successors, (217), 212 states have internal predecessors, (217), 3 states have call successors, (3), 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 217 states. [2022-04-28 03:53:24,626 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:53:24,626 INFO L93 Difference]: Finished difference Result 217 states and 221 transitions. [2022-04-28 03:53:24,626 INFO L276 IsEmpty]: Start isEmpty. Operand 217 states and 221 transitions. [2022-04-28 03:53:24,626 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:53:24,626 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:53:24,626 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 03:53:24,626 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 03:53:24,626 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 217 states, 212 states have (on average 1.0235849056603774) internal successors, (217), 212 states have internal predecessors, (217), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:53:24,640 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 217 states to 217 states and 221 transitions. [2022-04-28 03:53:24,640 INFO L78 Accepts]: Start accepts. Automaton has 217 states and 221 transitions. Word has length 125 [2022-04-28 03:53:24,640 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 03:53:24,640 INFO L495 AbstractCegarLoop]: Abstraction has 217 states and 221 transitions. [2022-04-28 03:53:24,640 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 73 states, 73 states have (on average 1.6575342465753424) internal successors, (121), 72 states have internal predecessors, (121), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:53:24,640 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 217 states and 221 transitions. [2022-04-28 03:53:24,809 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 221 edges. 221 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 03:53:24,810 INFO L276 IsEmpty]: Start isEmpty. Operand 217 states and 221 transitions. [2022-04-28 03:53:24,810 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2022-04-28 03:53:24,810 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 03:53:24,810 INFO L195 NwaCegarLoop]: trace histogram [46, 45, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 03:53:24,827 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (24)] Forceful destruction successful, exit code 0 [2022-04-28 03:53:25,026 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25,24 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 03:53:25,027 INFO L420 AbstractCegarLoop]: === Iteration 27 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 03:53:25,027 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 03:53:25,027 INFO L85 PathProgramCache]: Analyzing trace with hash 1372214107, now seen corresponding path program 24 times [2022-04-28 03:53:25,027 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 03:53:25,027 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1412605836] [2022-04-28 03:53:25,122 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 1 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 03:53:25,308 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={1=1, 2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 03:53:25,309 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-28 03:53:25,311 INFO L85 PathProgramCache]: Analyzing trace with hash -245159039, now seen corresponding path program 1 times [2022-04-28 03:53:25,311 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 03:53:25,311 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [429777337] [2022-04-28 03:53:25,311 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:53:25,312 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 03:53:25,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:53:25,636 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 03:53:25,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:53:25,639 INFO L290 TraceCheckUtils]: 0: Hoare triple {21606#(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); {21576#true} is VALID [2022-04-28 03:53:25,639 INFO L290 TraceCheckUtils]: 1: Hoare triple {21576#true} assume true; {21576#true} is VALID [2022-04-28 03:53:25,639 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {21576#true} {21576#true} #52#return; {21576#true} is VALID [2022-04-28 03:53:25,640 INFO L272 TraceCheckUtils]: 0: Hoare triple {21576#true} call ULTIMATE.init(); {21606#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 03:53:25,640 INFO L290 TraceCheckUtils]: 1: Hoare triple {21606#(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); {21576#true} is VALID [2022-04-28 03:53:25,640 INFO L290 TraceCheckUtils]: 2: Hoare triple {21576#true} assume true; {21576#true} is VALID [2022-04-28 03:53:25,640 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {21576#true} {21576#true} #52#return; {21576#true} is VALID [2022-04-28 03:53:25,640 INFO L272 TraceCheckUtils]: 4: Hoare triple {21576#true} call #t~ret7 := main(); {21576#true} is VALID [2022-04-28 03:53:25,640 INFO L290 TraceCheckUtils]: 5: Hoare triple {21576#true} ~x~0 := 0;~y~0 := 50000;~z~0 := 0;~x~0 := 0; {21581#(<= 50000 main_~y~0)} is VALID [2022-04-28 03:53:25,641 INFO L290 TraceCheckUtils]: 6: Hoare triple {21581#(<= 50000 main_~y~0)} [152] L11-2-->L18-1_primed: Formula: (let ((.cse0 (= |v_main_#t~post4_153| |v_main_#t~post4_152|)) (.cse1 (= v_main_~x~0_1208 v_main_~x~0_1207))) (or (and .cse0 .cse1) (and .cse0 (not (< v_main_~x~0_1208 50000)) .cse1) (and (< v_main_~x~0_1207 50001) (< v_main_~x~0_1208 v_main_~x~0_1207)))) InVars {main_~x~0=v_main_~x~0_1208, main_#t~post4=|v_main_#t~post4_153|} OutVars{main_~x~0=v_main_~x~0_1207, main_#t~post4=|v_main_#t~post4_152|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {21581#(<= 50000 main_~y~0)} is VALID [2022-04-28 03:53:25,641 INFO L290 TraceCheckUtils]: 7: Hoare triple {21581#(<= 50000 main_~y~0)} [153] L18-1_primed-->L11-2: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {21581#(<= 50000 main_~y~0)} is VALID [2022-04-28 03:53:25,642 INFO L290 TraceCheckUtils]: 8: Hoare triple {21581#(<= 50000 main_~y~0)} [154] L11-2-->L18-1_primed: Formula: (let ((.cse2 (= |v_main_#t~post6_165| |v_main_#t~post6_164|)) (.cse0 (<= 50000 v_main_~x~0_1210)) (.cse3 (= v_main_~y~0_1281 v_main_~y~0_1280)) (.cse4 (= |v_main_#t~post5_165| |v_main_#t~post5_164|))) (or (let ((.cse1 (+ v_main_~x~0_1210 v_main_~y~0_1280))) (and (< v_main_~y~0_1281 v_main_~y~0_1280) .cse0 (< .cse1 (+ 1000001 v_main_~y~0_1281)) (= .cse1 (+ v_main_~x~0_1209 v_main_~y~0_1281)))) (and .cse2 (= v_main_~x~0_1210 v_main_~x~0_1209) .cse3 .cse4) (and (= v_main_~x~0_1209 v_main_~x~0_1210) .cse2 (or (not (< v_main_~x~0_1210 1000000)) (not .cse0)) .cse3 .cse4))) InVars {main_~y~0=v_main_~y~0_1281, main_#t~post5=|v_main_#t~post5_165|, main_~x~0=v_main_~x~0_1210, main_#t~post6=|v_main_#t~post6_165|} OutVars{main_~y~0=v_main_~y~0_1280, main_#t~post5=|v_main_#t~post5_164|, main_~x~0=v_main_~x~0_1209, main_#t~post6=|v_main_#t~post6_164|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {21581#(<= 50000 main_~y~0)} is VALID [2022-04-28 03:53:25,642 INFO L290 TraceCheckUtils]: 9: Hoare triple {21581#(<= 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[] {21581#(<= 50000 main_~y~0)} is VALID [2022-04-28 03:53:25,642 INFO L290 TraceCheckUtils]: 10: Hoare triple {21581#(<= 50000 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {21582#(<= 49998 main_~y~0)} is VALID [2022-04-28 03:53:25,643 INFO L290 TraceCheckUtils]: 11: Hoare triple {21582#(<= 49998 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {21583#(<= 49996 main_~y~0)} is VALID [2022-04-28 03:53:25,643 INFO L290 TraceCheckUtils]: 12: Hoare triple {21583#(<= 49996 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {21584#(<= 49994 main_~y~0)} is VALID [2022-04-28 03:53:25,644 INFO L290 TraceCheckUtils]: 13: Hoare triple {21584#(<= 49994 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {21585#(<= 49992 main_~y~0)} is VALID [2022-04-28 03:53:25,644 INFO L290 TraceCheckUtils]: 14: Hoare triple {21585#(<= 49992 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {21586#(<= 49990 main_~y~0)} is VALID [2022-04-28 03:53:25,644 INFO L290 TraceCheckUtils]: 15: Hoare triple {21586#(<= 49990 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {21587#(<= 49988 main_~y~0)} is VALID [2022-04-28 03:53:25,645 INFO L290 TraceCheckUtils]: 16: Hoare triple {21587#(<= 49988 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {21588#(<= 49986 main_~y~0)} is VALID [2022-04-28 03:53:25,645 INFO L290 TraceCheckUtils]: 17: Hoare triple {21588#(<= 49986 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {21589#(<= 49984 main_~y~0)} is VALID [2022-04-28 03:53:25,646 INFO L290 TraceCheckUtils]: 18: Hoare triple {21589#(<= 49984 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {21590#(<= 49982 main_~y~0)} is VALID [2022-04-28 03:53:25,646 INFO L290 TraceCheckUtils]: 19: Hoare triple {21590#(<= 49982 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {21591#(<= 49980 main_~y~0)} is VALID [2022-04-28 03:53:25,646 INFO L290 TraceCheckUtils]: 20: Hoare triple {21591#(<= 49980 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {21592#(<= 49978 main_~y~0)} is VALID [2022-04-28 03:53:25,647 INFO L290 TraceCheckUtils]: 21: Hoare triple {21592#(<= 49978 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {21593#(<= 49976 main_~y~0)} is VALID [2022-04-28 03:53:25,647 INFO L290 TraceCheckUtils]: 22: Hoare triple {21593#(<= 49976 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {21594#(<= 49974 main_~y~0)} is VALID [2022-04-28 03:53:25,648 INFO L290 TraceCheckUtils]: 23: Hoare triple {21594#(<= 49974 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {21595#(<= 49972 main_~y~0)} is VALID [2022-04-28 03:53:25,648 INFO L290 TraceCheckUtils]: 24: Hoare triple {21595#(<= 49972 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {21596#(<= 49970 main_~y~0)} is VALID [2022-04-28 03:53:25,648 INFO L290 TraceCheckUtils]: 25: Hoare triple {21596#(<= 49970 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {21597#(<= 49968 main_~y~0)} is VALID [2022-04-28 03:53:25,649 INFO L290 TraceCheckUtils]: 26: Hoare triple {21597#(<= 49968 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {21598#(<= 49966 main_~y~0)} is VALID [2022-04-28 03:53:25,649 INFO L290 TraceCheckUtils]: 27: Hoare triple {21598#(<= 49966 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {21599#(<= 49964 main_~y~0)} is VALID [2022-04-28 03:53:25,650 INFO L290 TraceCheckUtils]: 28: Hoare triple {21599#(<= 49964 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {21600#(<= 49962 main_~y~0)} is VALID [2022-04-28 03:53:25,650 INFO L290 TraceCheckUtils]: 29: Hoare triple {21600#(<= 49962 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {21601#(<= 49960 main_~y~0)} is VALID [2022-04-28 03:53:25,651 INFO L290 TraceCheckUtils]: 30: Hoare triple {21601#(<= 49960 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {21602#(<= 49958 main_~y~0)} is VALID [2022-04-28 03:53:25,651 INFO L290 TraceCheckUtils]: 31: Hoare triple {21602#(<= 49958 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {21603#(<= 49956 main_~y~0)} is VALID [2022-04-28 03:53:25,651 INFO L290 TraceCheckUtils]: 32: Hoare triple {21603#(<= 49956 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {21604#(<= 49954 main_~y~0)} is VALID [2022-04-28 03:53:25,652 INFO L290 TraceCheckUtils]: 33: Hoare triple {21604#(<= 49954 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {21605#(<= 49952 main_~y~0)} is VALID [2022-04-28 03:53:25,652 INFO L290 TraceCheckUtils]: 34: Hoare triple {21605#(<= 49952 main_~y~0)} assume !(~y~0 > 0); {21577#false} is VALID [2022-04-28 03:53:25,652 INFO L272 TraceCheckUtils]: 35: Hoare triple {21577#false} call __VERIFIER_assert((if ~z~0 == ~x~0 then 1 else 0)); {21577#false} is VALID [2022-04-28 03:53:25,652 INFO L290 TraceCheckUtils]: 36: Hoare triple {21577#false} ~cond := #in~cond; {21577#false} is VALID [2022-04-28 03:53:25,652 INFO L290 TraceCheckUtils]: 37: Hoare triple {21577#false} assume 0 == ~cond; {21577#false} is VALID [2022-04-28 03:53:25,652 INFO L290 TraceCheckUtils]: 38: Hoare triple {21577#false} assume !false; {21577#false} is VALID [2022-04-28 03:53:25,653 INFO L134 CoverageAnalysis]: Checked inductivity of 302 backedges. 0 proven. 300 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-04-28 03:53:25,653 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 03:53:25,653 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [429777337] [2022-04-28 03:53:25,653 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [429777337] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 03:53:25,653 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1541026562] [2022-04-28 03:53:25,653 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:53:25,653 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 03:53:25,653 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 03:53:25,654 INFO L229 MonitoredProcess]: Starting monitored process 25 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 03:53:25,654 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (25)] Waiting until timeout for monitored process [2022-04-28 03:53:25,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:53:25,698 INFO L263 TraceCheckSpWp]: Trace formula consists of 179 conjuncts, 27 conjunts are in the unsatisfiable core [2022-04-28 03:53:25,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:53:25,714 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 03:53:26,126 INFO L272 TraceCheckUtils]: 0: Hoare triple {21576#true} call ULTIMATE.init(); {21576#true} is VALID [2022-04-28 03:53:26,127 INFO L290 TraceCheckUtils]: 1: Hoare triple {21576#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); {21576#true} is VALID [2022-04-28 03:53:26,127 INFO L290 TraceCheckUtils]: 2: Hoare triple {21576#true} assume true; {21576#true} is VALID [2022-04-28 03:53:26,127 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {21576#true} {21576#true} #52#return; {21576#true} is VALID [2022-04-28 03:53:26,127 INFO L272 TraceCheckUtils]: 4: Hoare triple {21576#true} call #t~ret7 := main(); {21576#true} is VALID [2022-04-28 03:53:26,127 INFO L290 TraceCheckUtils]: 5: Hoare triple {21576#true} ~x~0 := 0;~y~0 := 50000;~z~0 := 0;~x~0 := 0; {21581#(<= 50000 main_~y~0)} is VALID [2022-04-28 03:53:26,128 INFO L290 TraceCheckUtils]: 6: Hoare triple {21581#(<= 50000 main_~y~0)} [152] L11-2-->L18-1_primed: Formula: (let ((.cse0 (= |v_main_#t~post4_153| |v_main_#t~post4_152|)) (.cse1 (= v_main_~x~0_1208 v_main_~x~0_1207))) (or (and .cse0 .cse1) (and .cse0 (not (< v_main_~x~0_1208 50000)) .cse1) (and (< v_main_~x~0_1207 50001) (< v_main_~x~0_1208 v_main_~x~0_1207)))) InVars {main_~x~0=v_main_~x~0_1208, main_#t~post4=|v_main_#t~post4_153|} OutVars{main_~x~0=v_main_~x~0_1207, main_#t~post4=|v_main_#t~post4_152|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {21581#(<= 50000 main_~y~0)} is VALID [2022-04-28 03:53:26,128 INFO L290 TraceCheckUtils]: 7: Hoare triple {21581#(<= 50000 main_~y~0)} [153] L18-1_primed-->L11-2: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {21581#(<= 50000 main_~y~0)} is VALID [2022-04-28 03:53:26,129 INFO L290 TraceCheckUtils]: 8: Hoare triple {21581#(<= 50000 main_~y~0)} [154] L11-2-->L18-1_primed: Formula: (let ((.cse2 (= |v_main_#t~post6_165| |v_main_#t~post6_164|)) (.cse0 (<= 50000 v_main_~x~0_1210)) (.cse3 (= v_main_~y~0_1281 v_main_~y~0_1280)) (.cse4 (= |v_main_#t~post5_165| |v_main_#t~post5_164|))) (or (let ((.cse1 (+ v_main_~x~0_1210 v_main_~y~0_1280))) (and (< v_main_~y~0_1281 v_main_~y~0_1280) .cse0 (< .cse1 (+ 1000001 v_main_~y~0_1281)) (= .cse1 (+ v_main_~x~0_1209 v_main_~y~0_1281)))) (and .cse2 (= v_main_~x~0_1210 v_main_~x~0_1209) .cse3 .cse4) (and (= v_main_~x~0_1209 v_main_~x~0_1210) .cse2 (or (not (< v_main_~x~0_1210 1000000)) (not .cse0)) .cse3 .cse4))) InVars {main_~y~0=v_main_~y~0_1281, main_#t~post5=|v_main_#t~post5_165|, main_~x~0=v_main_~x~0_1210, main_#t~post6=|v_main_#t~post6_165|} OutVars{main_~y~0=v_main_~y~0_1280, main_#t~post5=|v_main_#t~post5_164|, main_~x~0=v_main_~x~0_1209, main_#t~post6=|v_main_#t~post6_164|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {21581#(<= 50000 main_~y~0)} is VALID [2022-04-28 03:53:26,129 INFO L290 TraceCheckUtils]: 9: Hoare triple {21581#(<= 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[] {21581#(<= 50000 main_~y~0)} is VALID [2022-04-28 03:53:26,129 INFO L290 TraceCheckUtils]: 10: Hoare triple {21581#(<= 50000 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {21582#(<= 49998 main_~y~0)} is VALID [2022-04-28 03:53:26,130 INFO L290 TraceCheckUtils]: 11: Hoare triple {21582#(<= 49998 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {21583#(<= 49996 main_~y~0)} is VALID [2022-04-28 03:53:26,130 INFO L290 TraceCheckUtils]: 12: Hoare triple {21583#(<= 49996 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {21584#(<= 49994 main_~y~0)} is VALID [2022-04-28 03:53:26,131 INFO L290 TraceCheckUtils]: 13: Hoare triple {21584#(<= 49994 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {21585#(<= 49992 main_~y~0)} is VALID [2022-04-28 03:53:26,131 INFO L290 TraceCheckUtils]: 14: Hoare triple {21585#(<= 49992 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {21586#(<= 49990 main_~y~0)} is VALID [2022-04-28 03:53:26,132 INFO L290 TraceCheckUtils]: 15: Hoare triple {21586#(<= 49990 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {21587#(<= 49988 main_~y~0)} is VALID [2022-04-28 03:53:26,132 INFO L290 TraceCheckUtils]: 16: Hoare triple {21587#(<= 49988 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {21588#(<= 49986 main_~y~0)} is VALID [2022-04-28 03:53:26,133 INFO L290 TraceCheckUtils]: 17: Hoare triple {21588#(<= 49986 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {21589#(<= 49984 main_~y~0)} is VALID [2022-04-28 03:53:26,133 INFO L290 TraceCheckUtils]: 18: Hoare triple {21589#(<= 49984 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {21590#(<= 49982 main_~y~0)} is VALID [2022-04-28 03:53:26,133 INFO L290 TraceCheckUtils]: 19: Hoare triple {21590#(<= 49982 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {21591#(<= 49980 main_~y~0)} is VALID [2022-04-28 03:53:26,134 INFO L290 TraceCheckUtils]: 20: Hoare triple {21591#(<= 49980 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {21592#(<= 49978 main_~y~0)} is VALID [2022-04-28 03:53:26,134 INFO L290 TraceCheckUtils]: 21: Hoare triple {21592#(<= 49978 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {21593#(<= 49976 main_~y~0)} is VALID [2022-04-28 03:53:26,135 INFO L290 TraceCheckUtils]: 22: Hoare triple {21593#(<= 49976 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {21594#(<= 49974 main_~y~0)} is VALID [2022-04-28 03:53:26,135 INFO L290 TraceCheckUtils]: 23: Hoare triple {21594#(<= 49974 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {21595#(<= 49972 main_~y~0)} is VALID [2022-04-28 03:53:26,136 INFO L290 TraceCheckUtils]: 24: Hoare triple {21595#(<= 49972 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {21596#(<= 49970 main_~y~0)} is VALID [2022-04-28 03:53:26,136 INFO L290 TraceCheckUtils]: 25: Hoare triple {21596#(<= 49970 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {21597#(<= 49968 main_~y~0)} is VALID [2022-04-28 03:53:26,137 INFO L290 TraceCheckUtils]: 26: Hoare triple {21597#(<= 49968 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {21598#(<= 49966 main_~y~0)} is VALID [2022-04-28 03:53:26,137 INFO L290 TraceCheckUtils]: 27: Hoare triple {21598#(<= 49966 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {21599#(<= 49964 main_~y~0)} is VALID [2022-04-28 03:53:26,137 INFO L290 TraceCheckUtils]: 28: Hoare triple {21599#(<= 49964 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {21600#(<= 49962 main_~y~0)} is VALID [2022-04-28 03:53:26,138 INFO L290 TraceCheckUtils]: 29: Hoare triple {21600#(<= 49962 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {21601#(<= 49960 main_~y~0)} is VALID [2022-04-28 03:53:26,138 INFO L290 TraceCheckUtils]: 30: Hoare triple {21601#(<= 49960 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {21602#(<= 49958 main_~y~0)} is VALID [2022-04-28 03:53:26,139 INFO L290 TraceCheckUtils]: 31: Hoare triple {21602#(<= 49958 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {21603#(<= 49956 main_~y~0)} is VALID [2022-04-28 03:53:26,139 INFO L290 TraceCheckUtils]: 32: Hoare triple {21603#(<= 49956 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {21604#(<= 49954 main_~y~0)} is VALID [2022-04-28 03:53:26,140 INFO L290 TraceCheckUtils]: 33: Hoare triple {21604#(<= 49954 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {21605#(<= 49952 main_~y~0)} is VALID [2022-04-28 03:53:26,140 INFO L290 TraceCheckUtils]: 34: Hoare triple {21605#(<= 49952 main_~y~0)} assume !(~y~0 > 0); {21577#false} is VALID [2022-04-28 03:53:26,140 INFO L272 TraceCheckUtils]: 35: Hoare triple {21577#false} call __VERIFIER_assert((if ~z~0 == ~x~0 then 1 else 0)); {21577#false} is VALID [2022-04-28 03:53:26,140 INFO L290 TraceCheckUtils]: 36: Hoare triple {21577#false} ~cond := #in~cond; {21577#false} is VALID [2022-04-28 03:53:26,140 INFO L290 TraceCheckUtils]: 37: Hoare triple {21577#false} assume 0 == ~cond; {21577#false} is VALID [2022-04-28 03:53:26,140 INFO L290 TraceCheckUtils]: 38: Hoare triple {21577#false} assume !false; {21577#false} is VALID [2022-04-28 03:53:26,140 INFO L134 CoverageAnalysis]: Checked inductivity of 302 backedges. 0 proven. 300 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-04-28 03:53:26,141 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 03:53:27,110 INFO L290 TraceCheckUtils]: 38: Hoare triple {21577#false} assume !false; {21577#false} is VALID [2022-04-28 03:53:27,110 INFO L290 TraceCheckUtils]: 37: Hoare triple {21577#false} assume 0 == ~cond; {21577#false} is VALID [2022-04-28 03:53:27,110 INFO L290 TraceCheckUtils]: 36: Hoare triple {21577#false} ~cond := #in~cond; {21577#false} is VALID [2022-04-28 03:53:27,110 INFO L272 TraceCheckUtils]: 35: Hoare triple {21577#false} call __VERIFIER_assert((if ~z~0 == ~x~0 then 1 else 0)); {21577#false} is VALID [2022-04-28 03:53:27,110 INFO L290 TraceCheckUtils]: 34: Hoare triple {21736#(< 0 main_~y~0)} assume !(~y~0 > 0); {21577#false} is VALID [2022-04-28 03:53:27,111 INFO L290 TraceCheckUtils]: 33: Hoare triple {21740#(< 2 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {21736#(< 0 main_~y~0)} is VALID [2022-04-28 03:53:27,112 INFO L290 TraceCheckUtils]: 32: Hoare triple {21744#(< 4 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {21740#(< 2 main_~y~0)} is VALID [2022-04-28 03:53:27,112 INFO L290 TraceCheckUtils]: 31: Hoare triple {21748#(< 6 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {21744#(< 4 main_~y~0)} is VALID [2022-04-28 03:53:27,113 INFO L290 TraceCheckUtils]: 30: Hoare triple {21752#(< 8 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {21748#(< 6 main_~y~0)} is VALID [2022-04-28 03:53:27,113 INFO L290 TraceCheckUtils]: 29: Hoare triple {21756#(< 10 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {21752#(< 8 main_~y~0)} is VALID [2022-04-28 03:53:27,114 INFO L290 TraceCheckUtils]: 28: Hoare triple {21760#(< 12 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {21756#(< 10 main_~y~0)} is VALID [2022-04-28 03:53:27,115 INFO L290 TraceCheckUtils]: 27: Hoare triple {21764#(< 14 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {21760#(< 12 main_~y~0)} is VALID [2022-04-28 03:53:27,115 INFO L290 TraceCheckUtils]: 26: Hoare triple {21768#(< 16 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {21764#(< 14 main_~y~0)} is VALID [2022-04-28 03:53:27,116 INFO L290 TraceCheckUtils]: 25: Hoare triple {21772#(< 18 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {21768#(< 16 main_~y~0)} is VALID [2022-04-28 03:53:27,116 INFO L290 TraceCheckUtils]: 24: Hoare triple {21776#(< 20 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {21772#(< 18 main_~y~0)} is VALID [2022-04-28 03:53:27,117 INFO L290 TraceCheckUtils]: 23: Hoare triple {21780#(< 22 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {21776#(< 20 main_~y~0)} is VALID [2022-04-28 03:53:27,117 INFO L290 TraceCheckUtils]: 22: Hoare triple {21784#(< 24 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {21780#(< 22 main_~y~0)} is VALID [2022-04-28 03:53:27,118 INFO L290 TraceCheckUtils]: 21: Hoare triple {21788#(< 26 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {21784#(< 24 main_~y~0)} is VALID [2022-04-28 03:53:27,118 INFO L290 TraceCheckUtils]: 20: Hoare triple {21792#(< 28 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {21788#(< 26 main_~y~0)} is VALID [2022-04-28 03:53:27,119 INFO L290 TraceCheckUtils]: 19: Hoare triple {21796#(< 30 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {21792#(< 28 main_~y~0)} is VALID [2022-04-28 03:53:27,119 INFO L290 TraceCheckUtils]: 18: Hoare triple {21800#(< 32 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {21796#(< 30 main_~y~0)} is VALID [2022-04-28 03:53:27,120 INFO L290 TraceCheckUtils]: 17: Hoare triple {21804#(< 34 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {21800#(< 32 main_~y~0)} is VALID [2022-04-28 03:53:27,120 INFO L290 TraceCheckUtils]: 16: Hoare triple {21808#(< 36 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {21804#(< 34 main_~y~0)} is VALID [2022-04-28 03:53:27,121 INFO L290 TraceCheckUtils]: 15: Hoare triple {21812#(< 38 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {21808#(< 36 main_~y~0)} is VALID [2022-04-28 03:53:27,121 INFO L290 TraceCheckUtils]: 14: Hoare triple {21816#(< 40 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {21812#(< 38 main_~y~0)} is VALID [2022-04-28 03:53:27,122 INFO L290 TraceCheckUtils]: 13: Hoare triple {21820#(< 42 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {21816#(< 40 main_~y~0)} is VALID [2022-04-28 03:53:27,122 INFO L290 TraceCheckUtils]: 12: Hoare triple {21824#(< 44 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {21820#(< 42 main_~y~0)} is VALID [2022-04-28 03:53:27,123 INFO L290 TraceCheckUtils]: 11: Hoare triple {21828#(< 46 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {21824#(< 44 main_~y~0)} is VALID [2022-04-28 03:53:27,123 INFO L290 TraceCheckUtils]: 10: Hoare triple {21832#(< 48 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {21828#(< 46 main_~y~0)} is VALID [2022-04-28 03:53:27,124 INFO L290 TraceCheckUtils]: 9: Hoare triple {21832#(< 48 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[] {21832#(< 48 main_~y~0)} is VALID [2022-04-28 03:53:27,125 INFO L290 TraceCheckUtils]: 8: Hoare triple {21832#(< 48 main_~y~0)} [154] L11-2-->L18-1_primed: Formula: (let ((.cse2 (= |v_main_#t~post6_165| |v_main_#t~post6_164|)) (.cse0 (<= 50000 v_main_~x~0_1210)) (.cse3 (= v_main_~y~0_1281 v_main_~y~0_1280)) (.cse4 (= |v_main_#t~post5_165| |v_main_#t~post5_164|))) (or (let ((.cse1 (+ v_main_~x~0_1210 v_main_~y~0_1280))) (and (< v_main_~y~0_1281 v_main_~y~0_1280) .cse0 (< .cse1 (+ 1000001 v_main_~y~0_1281)) (= .cse1 (+ v_main_~x~0_1209 v_main_~y~0_1281)))) (and .cse2 (= v_main_~x~0_1210 v_main_~x~0_1209) .cse3 .cse4) (and (= v_main_~x~0_1209 v_main_~x~0_1210) .cse2 (or (not (< v_main_~x~0_1210 1000000)) (not .cse0)) .cse3 .cse4))) InVars {main_~y~0=v_main_~y~0_1281, main_#t~post5=|v_main_#t~post5_165|, main_~x~0=v_main_~x~0_1210, main_#t~post6=|v_main_#t~post6_165|} OutVars{main_~y~0=v_main_~y~0_1280, main_#t~post5=|v_main_#t~post5_164|, main_~x~0=v_main_~x~0_1209, main_#t~post6=|v_main_#t~post6_164|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {21832#(< 48 main_~y~0)} is VALID [2022-04-28 03:53:27,125 INFO L290 TraceCheckUtils]: 7: Hoare triple {21832#(< 48 main_~y~0)} [153] L18-1_primed-->L11-2: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {21832#(< 48 main_~y~0)} is VALID [2022-04-28 03:53:27,125 INFO L290 TraceCheckUtils]: 6: Hoare triple {21832#(< 48 main_~y~0)} [152] L11-2-->L18-1_primed: Formula: (let ((.cse0 (= |v_main_#t~post4_153| |v_main_#t~post4_152|)) (.cse1 (= v_main_~x~0_1208 v_main_~x~0_1207))) (or (and .cse0 .cse1) (and .cse0 (not (< v_main_~x~0_1208 50000)) .cse1) (and (< v_main_~x~0_1207 50001) (< v_main_~x~0_1208 v_main_~x~0_1207)))) InVars {main_~x~0=v_main_~x~0_1208, main_#t~post4=|v_main_#t~post4_153|} OutVars{main_~x~0=v_main_~x~0_1207, main_#t~post4=|v_main_#t~post4_152|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {21832#(< 48 main_~y~0)} is VALID [2022-04-28 03:53:27,126 INFO L290 TraceCheckUtils]: 5: Hoare triple {21576#true} ~x~0 := 0;~y~0 := 50000;~z~0 := 0;~x~0 := 0; {21832#(< 48 main_~y~0)} is VALID [2022-04-28 03:53:27,126 INFO L272 TraceCheckUtils]: 4: Hoare triple {21576#true} call #t~ret7 := main(); {21576#true} is VALID [2022-04-28 03:53:27,126 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {21576#true} {21576#true} #52#return; {21576#true} is VALID [2022-04-28 03:53:27,126 INFO L290 TraceCheckUtils]: 2: Hoare triple {21576#true} assume true; {21576#true} is VALID [2022-04-28 03:53:27,126 INFO L290 TraceCheckUtils]: 1: Hoare triple {21576#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); {21576#true} is VALID [2022-04-28 03:53:27,126 INFO L272 TraceCheckUtils]: 0: Hoare triple {21576#true} call ULTIMATE.init(); {21576#true} is VALID [2022-04-28 03:53:27,127 INFO L134 CoverageAnalysis]: Checked inductivity of 302 backedges. 0 proven. 300 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-04-28 03:53:27,127 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1541026562] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 03:53:27,127 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 03:53:27,127 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [28, 27, 27] total 53 [2022-04-28 03:53:28,884 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 03:53:28,884 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1412605836] [2022-04-28 03:53:28,884 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1412605836] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 03:53:28,884 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 03:53:28,884 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [75] imperfect sequences [] total 75 [2022-04-28 03:53:28,884 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [858782377] [2022-04-28 03:53:28,884 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 03:53:28,885 INFO L78 Accepts]: Start accepts. Automaton has has 75 states, 75 states have (on average 1.6533333333333333) internal successors, (124), 74 states have internal predecessors, (124), 2 states have call successors, (3), 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 128 [2022-04-28 03:53:28,885 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 03:53:28,885 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 75 states, 75 states have (on average 1.6533333333333333) internal successors, (124), 74 states have internal predecessors, (124), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:53:28,969 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 128 edges. 128 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 03:53:28,969 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 75 states [2022-04-28 03:53:28,969 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 03:53:28,970 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 75 interpolants. [2022-04-28 03:53:28,970 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3818, Invalid=6082, Unknown=0, NotChecked=0, Total=9900 [2022-04-28 03:53:28,970 INFO L87 Difference]: Start difference. First operand 217 states and 221 transitions. Second operand has 75 states, 75 states have (on average 1.6533333333333333) internal successors, (124), 74 states have internal predecessors, (124), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:53:37,485 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:53:37,485 INFO L93 Difference]: Finished difference Result 343 states and 357 transitions. [2022-04-28 03:53:37,485 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 75 states. [2022-04-28 03:53:37,485 INFO L78 Accepts]: Start accepts. Automaton has has 75 states, 75 states have (on average 1.6533333333333333) internal successors, (124), 74 states have internal predecessors, (124), 2 states have call successors, (3), 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 128 [2022-04-28 03:53:37,485 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 03:53:37,485 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 75 states, 75 states have (on average 1.6533333333333333) internal successors, (124), 74 states have internal predecessors, (124), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:53:37,486 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 152 transitions. [2022-04-28 03:53:37,486 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 75 states, 75 states have (on average 1.6533333333333333) internal successors, (124), 74 states have internal predecessors, (124), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:53:37,487 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 152 transitions. [2022-04-28 03:53:37,488 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 75 states and 152 transitions. [2022-04-28 03:53:37,602 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 152 edges. 152 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 03:53:37,604 INFO L225 Difference]: With dead ends: 343 [2022-04-28 03:53:37,604 INFO L226 Difference]: Without dead ends: 224 [2022-04-28 03:53:37,606 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 276 GetRequests, 104 SyntacticMatches, 2 SemanticMatches, 170 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8507 ImplicationChecksByTransitivity, 4.0s TimeCoverageRelationStatistics Valid=8948, Invalid=20464, Unknown=0, NotChecked=0, Total=29412 [2022-04-28 03:53:37,606 INFO L413 NwaCegarLoop]: 12 mSDtfsCounter, 252 mSDsluCounter, 27 mSDsCounter, 0 mSdLazyCounter, 4399 mSolverCounterSat, 282 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 252 SdHoareTripleChecker+Valid, 39 SdHoareTripleChecker+Invalid, 4681 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 282 IncrementalHoareTripleChecker+Valid, 4399 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.3s IncrementalHoareTripleChecker+Time [2022-04-28 03:53:37,606 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [252 Valid, 39 Invalid, 4681 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [282 Valid, 4399 Invalid, 0 Unknown, 0 Unchecked, 3.3s Time] [2022-04-28 03:53:37,607 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 224 states. [2022-04-28 03:53:37,794 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 224 to 134. [2022-04-28 03:53:37,794 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 03:53:37,795 INFO L82 GeneralOperation]: Start isEquivalent. First operand 224 states. Second operand has 134 states, 129 states have (on average 1.0310077519379846) internal successors, (133), 129 states have internal predecessors, (133), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:53:37,795 INFO L74 IsIncluded]: Start isIncluded. First operand 224 states. Second operand has 134 states, 129 states have (on average 1.0310077519379846) internal successors, (133), 129 states have internal predecessors, (133), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:53:37,795 INFO L87 Difference]: Start difference. First operand 224 states. Second operand has 134 states, 129 states have (on average 1.0310077519379846) internal successors, (133), 129 states have internal predecessors, (133), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:53:37,797 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:53:37,797 INFO L93 Difference]: Finished difference Result 224 states and 228 transitions. [2022-04-28 03:53:37,797 INFO L276 IsEmpty]: Start isEmpty. Operand 224 states and 228 transitions. [2022-04-28 03:53:37,797 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:53:37,797 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:53:37,798 INFO L74 IsIncluded]: Start isIncluded. First operand has 134 states, 129 states have (on average 1.0310077519379846) internal successors, (133), 129 states have internal predecessors, (133), 3 states have call successors, (3), 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 224 states. [2022-04-28 03:53:37,798 INFO L87 Difference]: Start difference. First operand has 134 states, 129 states have (on average 1.0310077519379846) internal successors, (133), 129 states have internal predecessors, (133), 3 states have call successors, (3), 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 224 states. [2022-04-28 03:53:37,800 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:53:37,800 INFO L93 Difference]: Finished difference Result 224 states and 228 transitions. [2022-04-28 03:53:37,800 INFO L276 IsEmpty]: Start isEmpty. Operand 224 states and 228 transitions. [2022-04-28 03:53:37,800 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:53:37,800 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:53:37,800 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 03:53:37,800 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 03:53:37,801 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 134 states, 129 states have (on average 1.0310077519379846) internal successors, (133), 129 states have internal predecessors, (133), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:53:37,802 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 134 states to 134 states and 137 transitions. [2022-04-28 03:53:37,802 INFO L78 Accepts]: Start accepts. Automaton has 134 states and 137 transitions. Word has length 128 [2022-04-28 03:53:37,802 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 03:53:37,802 INFO L495 AbstractCegarLoop]: Abstraction has 134 states and 137 transitions. [2022-04-28 03:53:37,802 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 75 states, 75 states have (on average 1.6533333333333333) internal successors, (124), 74 states have internal predecessors, (124), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:53:37,802 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 134 states and 137 transitions. [2022-04-28 03:53:37,922 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 137 edges. 137 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 03:53:37,922 INFO L276 IsEmpty]: Start isEmpty. Operand 134 states and 137 transitions. [2022-04-28 03:53:37,922 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2022-04-28 03:53:37,922 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 03:53:37,922 INFO L195 NwaCegarLoop]: trace histogram [48, 47, 25, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 03:53:37,940 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (25)] Ended with exit code 0 [2022-04-28 03:53:38,123 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 25 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable26 [2022-04-28 03:53:38,123 INFO L420 AbstractCegarLoop]: === Iteration 28 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 03:53:38,123 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 03:53:38,123 INFO L85 PathProgramCache]: Analyzing trace with hash 1328586462, now seen corresponding path program 25 times [2022-04-28 03:53:38,123 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 03:53:38,124 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1250691423] [2022-04-28 03:53:38,209 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 1 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 03:53:38,387 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={1=1, 2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 03:53:38,388 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-28 03:53:38,390 INFO L85 PathProgramCache]: Analyzing trace with hash -1654478590, now seen corresponding path program 1 times [2022-04-28 03:53:38,390 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 03:53:38,390 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1346934073] [2022-04-28 03:53:38,390 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:53:38,390 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 03:53:38,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:53:38,784 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 03:53:38,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:53:38,787 INFO L290 TraceCheckUtils]: 0: Hoare triple {23489#(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); {23458#true} is VALID [2022-04-28 03:53:38,787 INFO L290 TraceCheckUtils]: 1: Hoare triple {23458#true} assume true; {23458#true} is VALID [2022-04-28 03:53:38,788 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {23458#true} {23458#true} #52#return; {23458#true} is VALID [2022-04-28 03:53:38,788 INFO L272 TraceCheckUtils]: 0: Hoare triple {23458#true} call ULTIMATE.init(); {23489#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 03:53:38,788 INFO L290 TraceCheckUtils]: 1: Hoare triple {23489#(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); {23458#true} is VALID [2022-04-28 03:53:38,788 INFO L290 TraceCheckUtils]: 2: Hoare triple {23458#true} assume true; {23458#true} is VALID [2022-04-28 03:53:38,788 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {23458#true} {23458#true} #52#return; {23458#true} is VALID [2022-04-28 03:53:38,788 INFO L272 TraceCheckUtils]: 4: Hoare triple {23458#true} call #t~ret7 := main(); {23458#true} is VALID [2022-04-28 03:53:38,789 INFO L290 TraceCheckUtils]: 5: Hoare triple {23458#true} ~x~0 := 0;~y~0 := 50000;~z~0 := 0;~x~0 := 0; {23463#(<= 50000 main_~y~0)} is VALID [2022-04-28 03:53:38,789 INFO L290 TraceCheckUtils]: 6: Hoare triple {23463#(<= 50000 main_~y~0)} [156] L11-2-->L18-1_primed: Formula: (let ((.cse0 (= v_main_~x~0_1294 v_main_~x~0_1293)) (.cse1 (= |v_main_#t~post4_159| |v_main_#t~post4_158|))) (or (and (not (< v_main_~x~0_1294 50000)) .cse0 .cse1) (and .cse0 .cse1) (and (< v_main_~x~0_1293 50001) (< v_main_~x~0_1294 v_main_~x~0_1293)))) InVars {main_~x~0=v_main_~x~0_1294, main_#t~post4=|v_main_#t~post4_159|} OutVars{main_~x~0=v_main_~x~0_1293, main_#t~post4=|v_main_#t~post4_158|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {23463#(<= 50000 main_~y~0)} is VALID [2022-04-28 03:53:38,790 INFO L290 TraceCheckUtils]: 7: Hoare triple {23463#(<= 50000 main_~y~0)} [157] L18-1_primed-->L11-2: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {23463#(<= 50000 main_~y~0)} is VALID [2022-04-28 03:53:38,790 INFO L290 TraceCheckUtils]: 8: Hoare triple {23463#(<= 50000 main_~y~0)} [158] L11-2-->L18-1_primed: Formula: (let ((.cse0 (<= 50000 v_main_~x~0_1296)) (.cse1 (= |v_main_#t~post5_172| |v_main_#t~post5_171|)) (.cse2 (= v_main_~x~0_1296 v_main_~x~0_1295)) (.cse3 (= |v_main_#t~post6_172| |v_main_#t~post6_171|)) (.cse4 (= v_main_~y~0_1383 v_main_~y~0_1382))) (or (and (< v_main_~x~0_1296 v_main_~x~0_1295) (= (+ v_main_~x~0_1296 v_main_~y~0_1382) (+ v_main_~x~0_1295 v_main_~y~0_1383)) .cse0 (< v_main_~x~0_1295 1000001)) (and (or (not (< v_main_~x~0_1296 1000000)) (not .cse0)) .cse1 .cse2 .cse3 .cse4) (and .cse1 .cse2 .cse3 .cse4))) InVars {main_~y~0=v_main_~y~0_1383, main_#t~post5=|v_main_#t~post5_172|, main_~x~0=v_main_~x~0_1296, main_#t~post6=|v_main_#t~post6_172|} OutVars{main_~y~0=v_main_~y~0_1382, main_#t~post5=|v_main_#t~post5_171|, main_~x~0=v_main_~x~0_1295, main_#t~post6=|v_main_#t~post6_171|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {23463#(<= 50000 main_~y~0)} is VALID [2022-04-28 03:53:38,791 INFO L290 TraceCheckUtils]: 9: Hoare triple {23463#(<= 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[] {23463#(<= 50000 main_~y~0)} is VALID [2022-04-28 03:53:38,791 INFO L290 TraceCheckUtils]: 10: Hoare triple {23463#(<= 50000 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {23464#(<= 49998 main_~y~0)} is VALID [2022-04-28 03:53:38,792 INFO L290 TraceCheckUtils]: 11: Hoare triple {23464#(<= 49998 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {23465#(<= 49996 main_~y~0)} is VALID [2022-04-28 03:53:38,792 INFO L290 TraceCheckUtils]: 12: Hoare triple {23465#(<= 49996 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {23466#(<= 49994 main_~y~0)} is VALID [2022-04-28 03:53:38,793 INFO L290 TraceCheckUtils]: 13: Hoare triple {23466#(<= 49994 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {23467#(<= 49992 main_~y~0)} is VALID [2022-04-28 03:53:38,793 INFO L290 TraceCheckUtils]: 14: Hoare triple {23467#(<= 49992 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {23468#(<= 49990 main_~y~0)} is VALID [2022-04-28 03:53:38,794 INFO L290 TraceCheckUtils]: 15: Hoare triple {23468#(<= 49990 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {23469#(<= 49988 main_~y~0)} is VALID [2022-04-28 03:53:38,795 INFO L290 TraceCheckUtils]: 16: Hoare triple {23469#(<= 49988 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {23470#(<= 49986 main_~y~0)} is VALID [2022-04-28 03:53:38,795 INFO L290 TraceCheckUtils]: 17: Hoare triple {23470#(<= 49986 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {23471#(<= 49984 main_~y~0)} is VALID [2022-04-28 03:53:38,796 INFO L290 TraceCheckUtils]: 18: Hoare triple {23471#(<= 49984 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {23472#(<= 49982 main_~y~0)} is VALID [2022-04-28 03:53:38,796 INFO L290 TraceCheckUtils]: 19: Hoare triple {23472#(<= 49982 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {23473#(<= 49980 main_~y~0)} is VALID [2022-04-28 03:53:38,797 INFO L290 TraceCheckUtils]: 20: Hoare triple {23473#(<= 49980 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {23474#(<= 49978 main_~y~0)} is VALID [2022-04-28 03:53:38,797 INFO L290 TraceCheckUtils]: 21: Hoare triple {23474#(<= 49978 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {23475#(<= 49976 main_~y~0)} is VALID [2022-04-28 03:53:38,816 INFO L290 TraceCheckUtils]: 22: Hoare triple {23475#(<= 49976 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {23476#(<= 49974 main_~y~0)} is VALID [2022-04-28 03:53:38,817 INFO L290 TraceCheckUtils]: 23: Hoare triple {23476#(<= 49974 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {23477#(<= 49972 main_~y~0)} is VALID [2022-04-28 03:53:38,817 INFO L290 TraceCheckUtils]: 24: Hoare triple {23477#(<= 49972 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {23478#(<= 49970 main_~y~0)} is VALID [2022-04-28 03:53:38,818 INFO L290 TraceCheckUtils]: 25: Hoare triple {23478#(<= 49970 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {23479#(<= 49968 main_~y~0)} is VALID [2022-04-28 03:53:38,818 INFO L290 TraceCheckUtils]: 26: Hoare triple {23479#(<= 49968 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {23480#(<= 49966 main_~y~0)} is VALID [2022-04-28 03:53:38,819 INFO L290 TraceCheckUtils]: 27: Hoare triple {23480#(<= 49966 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {23481#(<= 49964 main_~y~0)} is VALID [2022-04-28 03:53:38,819 INFO L290 TraceCheckUtils]: 28: Hoare triple {23481#(<= 49964 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {23482#(<= 49962 main_~y~0)} is VALID [2022-04-28 03:53:38,820 INFO L290 TraceCheckUtils]: 29: Hoare triple {23482#(<= 49962 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {23483#(<= 49960 main_~y~0)} is VALID [2022-04-28 03:53:38,820 INFO L290 TraceCheckUtils]: 30: Hoare triple {23483#(<= 49960 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {23484#(<= 49958 main_~y~0)} is VALID [2022-04-28 03:53:38,821 INFO L290 TraceCheckUtils]: 31: Hoare triple {23484#(<= 49958 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {23485#(<= 49956 main_~y~0)} is VALID [2022-04-28 03:53:38,821 INFO L290 TraceCheckUtils]: 32: Hoare triple {23485#(<= 49956 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {23486#(<= 49954 main_~y~0)} is VALID [2022-04-28 03:53:38,822 INFO L290 TraceCheckUtils]: 33: Hoare triple {23486#(<= 49954 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {23487#(<= 49952 main_~y~0)} is VALID [2022-04-28 03:53:38,822 INFO L290 TraceCheckUtils]: 34: Hoare triple {23487#(<= 49952 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {23488#(<= 49950 main_~y~0)} is VALID [2022-04-28 03:53:38,822 INFO L290 TraceCheckUtils]: 35: Hoare triple {23488#(<= 49950 main_~y~0)} assume !(~y~0 > 0); {23459#false} is VALID [2022-04-28 03:53:38,822 INFO L272 TraceCheckUtils]: 36: Hoare triple {23459#false} call __VERIFIER_assert((if ~z~0 == ~x~0 then 1 else 0)); {23459#false} is VALID [2022-04-28 03:53:38,822 INFO L290 TraceCheckUtils]: 37: Hoare triple {23459#false} ~cond := #in~cond; {23459#false} is VALID [2022-04-28 03:53:38,823 INFO L290 TraceCheckUtils]: 38: Hoare triple {23459#false} assume 0 == ~cond; {23459#false} is VALID [2022-04-28 03:53:38,823 INFO L290 TraceCheckUtils]: 39: Hoare triple {23459#false} assume !false; {23459#false} is VALID [2022-04-28 03:53:38,823 INFO L134 CoverageAnalysis]: Checked inductivity of 327 backedges. 0 proven. 325 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-04-28 03:53:38,823 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 03:53:38,823 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1346934073] [2022-04-28 03:53:38,823 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1346934073] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 03:53:38,823 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [724295564] [2022-04-28 03:53:38,823 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:53:38,823 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 03:53:38,823 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 03:53:38,824 INFO L229 MonitoredProcess]: Starting monitored process 26 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 03:53:38,825 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (26)] Waiting until timeout for monitored process [2022-04-28 03:53:38,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:53:38,867 INFO L263 TraceCheckSpWp]: Trace formula consists of 184 conjuncts, 28 conjunts are in the unsatisfiable core [2022-04-28 03:53:38,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:53:38,881 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 03:53:39,286 INFO L272 TraceCheckUtils]: 0: Hoare triple {23458#true} call ULTIMATE.init(); {23458#true} is VALID [2022-04-28 03:53:39,286 INFO L290 TraceCheckUtils]: 1: Hoare triple {23458#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); {23458#true} is VALID [2022-04-28 03:53:39,286 INFO L290 TraceCheckUtils]: 2: Hoare triple {23458#true} assume true; {23458#true} is VALID [2022-04-28 03:53:39,286 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {23458#true} {23458#true} #52#return; {23458#true} is VALID [2022-04-28 03:53:39,286 INFO L272 TraceCheckUtils]: 4: Hoare triple {23458#true} call #t~ret7 := main(); {23458#true} is VALID [2022-04-28 03:53:39,286 INFO L290 TraceCheckUtils]: 5: Hoare triple {23458#true} ~x~0 := 0;~y~0 := 50000;~z~0 := 0;~x~0 := 0; {23463#(<= 50000 main_~y~0)} is VALID [2022-04-28 03:53:39,287 INFO L290 TraceCheckUtils]: 6: Hoare triple {23463#(<= 50000 main_~y~0)} [156] L11-2-->L18-1_primed: Formula: (let ((.cse0 (= v_main_~x~0_1294 v_main_~x~0_1293)) (.cse1 (= |v_main_#t~post4_159| |v_main_#t~post4_158|))) (or (and (not (< v_main_~x~0_1294 50000)) .cse0 .cse1) (and .cse0 .cse1) (and (< v_main_~x~0_1293 50001) (< v_main_~x~0_1294 v_main_~x~0_1293)))) InVars {main_~x~0=v_main_~x~0_1294, main_#t~post4=|v_main_#t~post4_159|} OutVars{main_~x~0=v_main_~x~0_1293, main_#t~post4=|v_main_#t~post4_158|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {23463#(<= 50000 main_~y~0)} is VALID [2022-04-28 03:53:39,287 INFO L290 TraceCheckUtils]: 7: Hoare triple {23463#(<= 50000 main_~y~0)} [157] L18-1_primed-->L11-2: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {23463#(<= 50000 main_~y~0)} is VALID [2022-04-28 03:53:39,288 INFO L290 TraceCheckUtils]: 8: Hoare triple {23463#(<= 50000 main_~y~0)} [158] L11-2-->L18-1_primed: Formula: (let ((.cse0 (<= 50000 v_main_~x~0_1296)) (.cse1 (= |v_main_#t~post5_172| |v_main_#t~post5_171|)) (.cse2 (= v_main_~x~0_1296 v_main_~x~0_1295)) (.cse3 (= |v_main_#t~post6_172| |v_main_#t~post6_171|)) (.cse4 (= v_main_~y~0_1383 v_main_~y~0_1382))) (or (and (< v_main_~x~0_1296 v_main_~x~0_1295) (= (+ v_main_~x~0_1296 v_main_~y~0_1382) (+ v_main_~x~0_1295 v_main_~y~0_1383)) .cse0 (< v_main_~x~0_1295 1000001)) (and (or (not (< v_main_~x~0_1296 1000000)) (not .cse0)) .cse1 .cse2 .cse3 .cse4) (and .cse1 .cse2 .cse3 .cse4))) InVars {main_~y~0=v_main_~y~0_1383, main_#t~post5=|v_main_#t~post5_172|, main_~x~0=v_main_~x~0_1296, main_#t~post6=|v_main_#t~post6_172|} OutVars{main_~y~0=v_main_~y~0_1382, main_#t~post5=|v_main_#t~post5_171|, main_~x~0=v_main_~x~0_1295, main_#t~post6=|v_main_#t~post6_171|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {23463#(<= 50000 main_~y~0)} is VALID [2022-04-28 03:53:39,288 INFO L290 TraceCheckUtils]: 9: Hoare triple {23463#(<= 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[] {23463#(<= 50000 main_~y~0)} is VALID [2022-04-28 03:53:39,288 INFO L290 TraceCheckUtils]: 10: Hoare triple {23463#(<= 50000 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {23464#(<= 49998 main_~y~0)} is VALID [2022-04-28 03:53:39,289 INFO L290 TraceCheckUtils]: 11: Hoare triple {23464#(<= 49998 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {23465#(<= 49996 main_~y~0)} is VALID [2022-04-28 03:53:39,289 INFO L290 TraceCheckUtils]: 12: Hoare triple {23465#(<= 49996 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {23466#(<= 49994 main_~y~0)} is VALID [2022-04-28 03:53:39,290 INFO L290 TraceCheckUtils]: 13: Hoare triple {23466#(<= 49994 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {23467#(<= 49992 main_~y~0)} is VALID [2022-04-28 03:53:39,290 INFO L290 TraceCheckUtils]: 14: Hoare triple {23467#(<= 49992 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {23468#(<= 49990 main_~y~0)} is VALID [2022-04-28 03:53:39,290 INFO L290 TraceCheckUtils]: 15: Hoare triple {23468#(<= 49990 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {23469#(<= 49988 main_~y~0)} is VALID [2022-04-28 03:53:39,291 INFO L290 TraceCheckUtils]: 16: Hoare triple {23469#(<= 49988 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {23470#(<= 49986 main_~y~0)} is VALID [2022-04-28 03:53:39,291 INFO L290 TraceCheckUtils]: 17: Hoare triple {23470#(<= 49986 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {23471#(<= 49984 main_~y~0)} is VALID [2022-04-28 03:53:39,295 INFO L290 TraceCheckUtils]: 18: Hoare triple {23471#(<= 49984 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {23472#(<= 49982 main_~y~0)} is VALID [2022-04-28 03:53:39,300 INFO L290 TraceCheckUtils]: 19: Hoare triple {23472#(<= 49982 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {23473#(<= 49980 main_~y~0)} is VALID [2022-04-28 03:53:39,301 INFO L290 TraceCheckUtils]: 20: Hoare triple {23473#(<= 49980 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {23474#(<= 49978 main_~y~0)} is VALID [2022-04-28 03:53:39,301 INFO L290 TraceCheckUtils]: 21: Hoare triple {23474#(<= 49978 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {23475#(<= 49976 main_~y~0)} is VALID [2022-04-28 03:53:39,302 INFO L290 TraceCheckUtils]: 22: Hoare triple {23475#(<= 49976 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {23476#(<= 49974 main_~y~0)} is VALID [2022-04-28 03:53:39,302 INFO L290 TraceCheckUtils]: 23: Hoare triple {23476#(<= 49974 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {23477#(<= 49972 main_~y~0)} is VALID [2022-04-28 03:53:39,302 INFO L290 TraceCheckUtils]: 24: Hoare triple {23477#(<= 49972 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {23478#(<= 49970 main_~y~0)} is VALID [2022-04-28 03:53:39,303 INFO L290 TraceCheckUtils]: 25: Hoare triple {23478#(<= 49970 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {23479#(<= 49968 main_~y~0)} is VALID [2022-04-28 03:53:39,303 INFO L290 TraceCheckUtils]: 26: Hoare triple {23479#(<= 49968 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {23480#(<= 49966 main_~y~0)} is VALID [2022-04-28 03:53:39,304 INFO L290 TraceCheckUtils]: 27: Hoare triple {23480#(<= 49966 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {23481#(<= 49964 main_~y~0)} is VALID [2022-04-28 03:53:39,304 INFO L290 TraceCheckUtils]: 28: Hoare triple {23481#(<= 49964 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {23482#(<= 49962 main_~y~0)} is VALID [2022-04-28 03:53:39,305 INFO L290 TraceCheckUtils]: 29: Hoare triple {23482#(<= 49962 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {23483#(<= 49960 main_~y~0)} is VALID [2022-04-28 03:53:39,305 INFO L290 TraceCheckUtils]: 30: Hoare triple {23483#(<= 49960 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {23484#(<= 49958 main_~y~0)} is VALID [2022-04-28 03:53:39,305 INFO L290 TraceCheckUtils]: 31: Hoare triple {23484#(<= 49958 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {23485#(<= 49956 main_~y~0)} is VALID [2022-04-28 03:53:39,306 INFO L290 TraceCheckUtils]: 32: Hoare triple {23485#(<= 49956 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {23486#(<= 49954 main_~y~0)} is VALID [2022-04-28 03:53:39,306 INFO L290 TraceCheckUtils]: 33: Hoare triple {23486#(<= 49954 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {23487#(<= 49952 main_~y~0)} is VALID [2022-04-28 03:53:39,307 INFO L290 TraceCheckUtils]: 34: Hoare triple {23487#(<= 49952 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {23488#(<= 49950 main_~y~0)} is VALID [2022-04-28 03:53:39,307 INFO L290 TraceCheckUtils]: 35: Hoare triple {23488#(<= 49950 main_~y~0)} assume !(~y~0 > 0); {23459#false} is VALID [2022-04-28 03:53:39,307 INFO L272 TraceCheckUtils]: 36: Hoare triple {23459#false} call __VERIFIER_assert((if ~z~0 == ~x~0 then 1 else 0)); {23459#false} is VALID [2022-04-28 03:53:39,307 INFO L290 TraceCheckUtils]: 37: Hoare triple {23459#false} ~cond := #in~cond; {23459#false} is VALID [2022-04-28 03:53:39,307 INFO L290 TraceCheckUtils]: 38: Hoare triple {23459#false} assume 0 == ~cond; {23459#false} is VALID [2022-04-28 03:53:39,307 INFO L290 TraceCheckUtils]: 39: Hoare triple {23459#false} assume !false; {23459#false} is VALID [2022-04-28 03:53:39,308 INFO L134 CoverageAnalysis]: Checked inductivity of 327 backedges. 0 proven. 325 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-04-28 03:53:39,308 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 03:53:40,363 INFO L290 TraceCheckUtils]: 39: Hoare triple {23459#false} assume !false; {23459#false} is VALID [2022-04-28 03:53:40,363 INFO L290 TraceCheckUtils]: 38: Hoare triple {23459#false} assume 0 == ~cond; {23459#false} is VALID [2022-04-28 03:53:40,363 INFO L290 TraceCheckUtils]: 37: Hoare triple {23459#false} ~cond := #in~cond; {23459#false} is VALID [2022-04-28 03:53:40,363 INFO L272 TraceCheckUtils]: 36: Hoare triple {23459#false} call __VERIFIER_assert((if ~z~0 == ~x~0 then 1 else 0)); {23459#false} is VALID [2022-04-28 03:53:40,364 INFO L290 TraceCheckUtils]: 35: Hoare triple {23622#(< 0 main_~y~0)} assume !(~y~0 > 0); {23459#false} is VALID [2022-04-28 03:53:40,364 INFO L290 TraceCheckUtils]: 34: Hoare triple {23626#(< 2 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {23622#(< 0 main_~y~0)} is VALID [2022-04-28 03:53:40,364 INFO L290 TraceCheckUtils]: 33: Hoare triple {23630#(< 4 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {23626#(< 2 main_~y~0)} is VALID [2022-04-28 03:53:40,365 INFO L290 TraceCheckUtils]: 32: Hoare triple {23634#(< 6 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {23630#(< 4 main_~y~0)} is VALID [2022-04-28 03:53:40,365 INFO L290 TraceCheckUtils]: 31: Hoare triple {23638#(< 8 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {23634#(< 6 main_~y~0)} is VALID [2022-04-28 03:53:40,366 INFO L290 TraceCheckUtils]: 30: Hoare triple {23642#(< 10 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {23638#(< 8 main_~y~0)} is VALID [2022-04-28 03:53:40,366 INFO L290 TraceCheckUtils]: 29: Hoare triple {23646#(< 12 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {23642#(< 10 main_~y~0)} is VALID [2022-04-28 03:53:40,366 INFO L290 TraceCheckUtils]: 28: Hoare triple {23650#(< 14 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {23646#(< 12 main_~y~0)} is VALID [2022-04-28 03:53:40,367 INFO L290 TraceCheckUtils]: 27: Hoare triple {23654#(< 16 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {23650#(< 14 main_~y~0)} is VALID [2022-04-28 03:53:40,367 INFO L290 TraceCheckUtils]: 26: Hoare triple {23658#(< 18 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {23654#(< 16 main_~y~0)} is VALID [2022-04-28 03:53:40,368 INFO L290 TraceCheckUtils]: 25: Hoare triple {23662#(< 20 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {23658#(< 18 main_~y~0)} is VALID [2022-04-28 03:53:40,368 INFO L290 TraceCheckUtils]: 24: Hoare triple {23666#(< 22 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {23662#(< 20 main_~y~0)} is VALID [2022-04-28 03:53:40,369 INFO L290 TraceCheckUtils]: 23: Hoare triple {23670#(< 24 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {23666#(< 22 main_~y~0)} is VALID [2022-04-28 03:53:40,369 INFO L290 TraceCheckUtils]: 22: Hoare triple {23674#(< 26 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {23670#(< 24 main_~y~0)} is VALID [2022-04-28 03:53:40,369 INFO L290 TraceCheckUtils]: 21: Hoare triple {23678#(< 28 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {23674#(< 26 main_~y~0)} is VALID [2022-04-28 03:53:40,370 INFO L290 TraceCheckUtils]: 20: Hoare triple {23682#(< 30 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {23678#(< 28 main_~y~0)} is VALID [2022-04-28 03:53:40,370 INFO L290 TraceCheckUtils]: 19: Hoare triple {23686#(< 32 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {23682#(< 30 main_~y~0)} is VALID [2022-04-28 03:53:40,371 INFO L290 TraceCheckUtils]: 18: Hoare triple {23690#(< 34 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {23686#(< 32 main_~y~0)} is VALID [2022-04-28 03:53:40,371 INFO L290 TraceCheckUtils]: 17: Hoare triple {23694#(< 36 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {23690#(< 34 main_~y~0)} is VALID [2022-04-28 03:53:40,371 INFO L290 TraceCheckUtils]: 16: Hoare triple {23698#(< 38 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {23694#(< 36 main_~y~0)} is VALID [2022-04-28 03:53:40,372 INFO L290 TraceCheckUtils]: 15: Hoare triple {23702#(< 40 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {23698#(< 38 main_~y~0)} is VALID [2022-04-28 03:53:40,372 INFO L290 TraceCheckUtils]: 14: Hoare triple {23706#(< 42 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {23702#(< 40 main_~y~0)} is VALID [2022-04-28 03:53:40,373 INFO L290 TraceCheckUtils]: 13: Hoare triple {23710#(< 44 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {23706#(< 42 main_~y~0)} is VALID [2022-04-28 03:53:40,373 INFO L290 TraceCheckUtils]: 12: Hoare triple {23714#(< 46 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {23710#(< 44 main_~y~0)} is VALID [2022-04-28 03:53:40,374 INFO L290 TraceCheckUtils]: 11: Hoare triple {23718#(< 48 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {23714#(< 46 main_~y~0)} is VALID [2022-04-28 03:53:40,374 INFO L290 TraceCheckUtils]: 10: Hoare triple {23722#(< 50 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {23718#(< 48 main_~y~0)} is VALID [2022-04-28 03:53:40,374 INFO L290 TraceCheckUtils]: 9: Hoare triple {23722#(< 50 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[] {23722#(< 50 main_~y~0)} is VALID [2022-04-28 03:53:40,375 INFO L290 TraceCheckUtils]: 8: Hoare triple {23722#(< 50 main_~y~0)} [158] L11-2-->L18-1_primed: Formula: (let ((.cse0 (<= 50000 v_main_~x~0_1296)) (.cse1 (= |v_main_#t~post5_172| |v_main_#t~post5_171|)) (.cse2 (= v_main_~x~0_1296 v_main_~x~0_1295)) (.cse3 (= |v_main_#t~post6_172| |v_main_#t~post6_171|)) (.cse4 (= v_main_~y~0_1383 v_main_~y~0_1382))) (or (and (< v_main_~x~0_1296 v_main_~x~0_1295) (= (+ v_main_~x~0_1296 v_main_~y~0_1382) (+ v_main_~x~0_1295 v_main_~y~0_1383)) .cse0 (< v_main_~x~0_1295 1000001)) (and (or (not (< v_main_~x~0_1296 1000000)) (not .cse0)) .cse1 .cse2 .cse3 .cse4) (and .cse1 .cse2 .cse3 .cse4))) InVars {main_~y~0=v_main_~y~0_1383, main_#t~post5=|v_main_#t~post5_172|, main_~x~0=v_main_~x~0_1296, main_#t~post6=|v_main_#t~post6_172|} OutVars{main_~y~0=v_main_~y~0_1382, main_#t~post5=|v_main_#t~post5_171|, main_~x~0=v_main_~x~0_1295, main_#t~post6=|v_main_#t~post6_171|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {23722#(< 50 main_~y~0)} is VALID [2022-04-28 03:53:40,375 INFO L290 TraceCheckUtils]: 7: Hoare triple {23722#(< 50 main_~y~0)} [157] L18-1_primed-->L11-2: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {23722#(< 50 main_~y~0)} is VALID [2022-04-28 03:53:40,375 INFO L290 TraceCheckUtils]: 6: Hoare triple {23722#(< 50 main_~y~0)} [156] L11-2-->L18-1_primed: Formula: (let ((.cse0 (= v_main_~x~0_1294 v_main_~x~0_1293)) (.cse1 (= |v_main_#t~post4_159| |v_main_#t~post4_158|))) (or (and (not (< v_main_~x~0_1294 50000)) .cse0 .cse1) (and .cse0 .cse1) (and (< v_main_~x~0_1293 50001) (< v_main_~x~0_1294 v_main_~x~0_1293)))) InVars {main_~x~0=v_main_~x~0_1294, main_#t~post4=|v_main_#t~post4_159|} OutVars{main_~x~0=v_main_~x~0_1293, main_#t~post4=|v_main_#t~post4_158|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {23722#(< 50 main_~y~0)} is VALID [2022-04-28 03:53:40,376 INFO L290 TraceCheckUtils]: 5: Hoare triple {23458#true} ~x~0 := 0;~y~0 := 50000;~z~0 := 0;~x~0 := 0; {23722#(< 50 main_~y~0)} is VALID [2022-04-28 03:53:40,376 INFO L272 TraceCheckUtils]: 4: Hoare triple {23458#true} call #t~ret7 := main(); {23458#true} is VALID [2022-04-28 03:53:40,376 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {23458#true} {23458#true} #52#return; {23458#true} is VALID [2022-04-28 03:53:40,376 INFO L290 TraceCheckUtils]: 2: Hoare triple {23458#true} assume true; {23458#true} is VALID [2022-04-28 03:53:40,376 INFO L290 TraceCheckUtils]: 1: Hoare triple {23458#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); {23458#true} is VALID [2022-04-28 03:53:40,376 INFO L272 TraceCheckUtils]: 0: Hoare triple {23458#true} call ULTIMATE.init(); {23458#true} is VALID [2022-04-28 03:53:40,376 INFO L134 CoverageAnalysis]: Checked inductivity of 327 backedges. 0 proven. 325 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-04-28 03:53:40,376 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [724295564] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 03:53:40,376 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 03:53:40,377 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [29, 28, 28] total 55 [2022-04-28 03:53:42,167 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 03:53:42,167 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1250691423] [2022-04-28 03:53:42,167 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1250691423] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 03:53:42,167 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 03:53:42,167 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [78] imperfect sequences [] total 78 [2022-04-28 03:53:42,167 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2115867272] [2022-04-28 03:53:42,167 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 03:53:42,168 INFO L78 Accepts]: Start accepts. Automaton has has 78 states, 78 states have (on average 1.6538461538461537) internal successors, (129), 77 states have internal predecessors, (129), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 133 [2022-04-28 03:53:42,168 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 03:53:42,168 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 78 states, 78 states have (on average 1.6538461538461537) internal successors, (129), 77 states have internal predecessors, (129), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:53:42,262 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 133 edges. 133 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 03:53:42,262 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 78 states [2022-04-28 03:53:42,262 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 03:53:42,263 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 78 interpolants. [2022-04-28 03:53:42,263 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=4127, Invalid=6585, Unknown=0, NotChecked=0, Total=10712 [2022-04-28 03:53:42,264 INFO L87 Difference]: Start difference. First operand 134 states and 137 transitions. Second operand has 78 states, 78 states have (on average 1.6538461538461537) internal successors, (129), 77 states have internal predecessors, (129), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:53:51,451 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:53:51,452 INFO L93 Difference]: Finished difference Result 265 states and 276 transitions. [2022-04-28 03:53:51,452 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 78 states. [2022-04-28 03:53:51,452 INFO L78 Accepts]: Start accepts. Automaton has has 78 states, 78 states have (on average 1.6538461538461537) internal successors, (129), 77 states have internal predecessors, (129), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 133 [2022-04-28 03:53:51,452 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 03:53:51,452 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 78 states, 78 states have (on average 1.6538461538461537) internal successors, (129), 77 states have internal predecessors, (129), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:53:51,453 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 155 transitions. [2022-04-28 03:53:51,453 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 78 states, 78 states have (on average 1.6538461538461537) internal successors, (129), 77 states have internal predecessors, (129), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:53:51,454 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 155 transitions. [2022-04-28 03:53:51,454 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 78 states and 155 transitions. [2022-04-28 03:53:51,568 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 155 edges. 155 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 03:53:51,569 INFO L225 Difference]: With dead ends: 265 [2022-04-28 03:53:51,569 INFO L226 Difference]: Without dead ends: 139 [2022-04-28 03:53:51,571 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 286 GetRequests, 108 SyntacticMatches, 1 SemanticMatches, 177 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9173 ImplicationChecksByTransitivity, 4.4s TimeCoverageRelationStatistics Valid=9671, Invalid=22191, Unknown=0, NotChecked=0, Total=31862 [2022-04-28 03:53:51,571 INFO L413 NwaCegarLoop]: 12 mSDtfsCounter, 211 mSDsluCounter, 67 mSDsCounter, 0 mSdLazyCounter, 4828 mSolverCounterSat, 289 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 211 SdHoareTripleChecker+Valid, 79 SdHoareTripleChecker+Invalid, 5117 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 289 IncrementalHoareTripleChecker+Valid, 4828 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.7s IncrementalHoareTripleChecker+Time [2022-04-28 03:53:51,571 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [211 Valid, 79 Invalid, 5117 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [289 Valid, 4828 Invalid, 0 Unknown, 0 Unchecked, 3.7s Time] [2022-04-28 03:53:51,571 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 139 states. [2022-04-28 03:53:51,780 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 139 to 139. [2022-04-28 03:53:51,780 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 03:53:51,780 INFO L82 GeneralOperation]: Start isEquivalent. First operand 139 states. Second operand has 139 states, 134 states have (on average 1.0298507462686568) internal successors, (138), 134 states have internal predecessors, (138), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:53:51,781 INFO L74 IsIncluded]: Start isIncluded. First operand 139 states. Second operand has 139 states, 134 states have (on average 1.0298507462686568) internal successors, (138), 134 states have internal predecessors, (138), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:53:51,781 INFO L87 Difference]: Start difference. First operand 139 states. Second operand has 139 states, 134 states have (on average 1.0298507462686568) internal successors, (138), 134 states have internal predecessors, (138), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:53:51,782 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:53:51,782 INFO L93 Difference]: Finished difference Result 139 states and 142 transitions. [2022-04-28 03:53:51,782 INFO L276 IsEmpty]: Start isEmpty. Operand 139 states and 142 transitions. [2022-04-28 03:53:51,782 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:53:51,782 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:53:51,782 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 139 states. [2022-04-28 03:53:51,783 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 139 states. [2022-04-28 03:53:51,784 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:53:51,784 INFO L93 Difference]: Finished difference Result 139 states and 142 transitions. [2022-04-28 03:53:51,784 INFO L276 IsEmpty]: Start isEmpty. Operand 139 states and 142 transitions. [2022-04-28 03:53:51,784 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:53:51,784 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:53:51,784 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 03:53:51,784 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 03:53:51,784 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 139 states, 134 states have (on average 1.0298507462686568) internal successors, (138), 134 states have internal predecessors, (138), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:53:51,785 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 139 states to 139 states and 142 transitions. [2022-04-28 03:53:51,785 INFO L78 Accepts]: Start accepts. Automaton has 139 states and 142 transitions. Word has length 133 [2022-04-28 03:53:51,786 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 03:53:51,786 INFO L495 AbstractCegarLoop]: Abstraction has 139 states and 142 transitions. [2022-04-28 03:53:51,786 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 78 states, 78 states have (on average 1.6538461538461537) internal successors, (129), 77 states have internal predecessors, (129), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:53:51,786 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 139 states and 142 transitions. [2022-04-28 03:53:51,898 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 142 edges. 142 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 03:53:51,898 INFO L276 IsEmpty]: Start isEmpty. Operand 139 states and 142 transitions. [2022-04-28 03:53:51,899 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2022-04-28 03:53:51,899 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 03:53:51,899 INFO L195 NwaCegarLoop]: trace histogram [50, 49, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 03:53:51,917 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (26)] Forceful destruction successful, exit code 0 [2022-04-28 03:53:52,117 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 26 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable27 [2022-04-28 03:53:52,117 INFO L420 AbstractCegarLoop]: === Iteration 29 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 03:53:52,118 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 03:53:52,118 INFO L85 PathProgramCache]: Analyzing trace with hash -54724977, now seen corresponding path program 26 times [2022-04-28 03:53:52,118 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 03:53:52,118 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [269445255] [2022-04-28 03:53:52,211 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 1 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 03:53:56,315 WARN L977 rdanLoopAcceleration]: Unable to prove correctness of quantifier elimination. [2022-04-28 03:53:56,405 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={1=1, 2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 03:53:56,406 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-28 03:53:56,408 INFO L85 PathProgramCache]: Analyzing trace with hash -1189955167, now seen corresponding path program 1 times [2022-04-28 03:53:56,408 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 03:53:56,408 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [545722568] [2022-04-28 03:53:56,408 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:53:56,408 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 03:53:56,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:53:56,856 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 03:53:56,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:53:56,859 INFO L290 TraceCheckUtils]: 0: Hoare triple {25075#(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); {25040#true} is VALID [2022-04-28 03:53:56,859 INFO L290 TraceCheckUtils]: 1: Hoare triple {25040#true} assume true; {25040#true} is VALID [2022-04-28 03:53:56,859 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {25040#true} {25040#true} #52#return; {25040#true} is VALID [2022-04-28 03:53:56,859 INFO L272 TraceCheckUtils]: 0: Hoare triple {25040#true} call ULTIMATE.init(); {25075#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 03:53:56,859 INFO L290 TraceCheckUtils]: 1: Hoare triple {25075#(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); {25040#true} is VALID [2022-04-28 03:53:56,859 INFO L290 TraceCheckUtils]: 2: Hoare triple {25040#true} assume true; {25040#true} is VALID [2022-04-28 03:53:56,860 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {25040#true} {25040#true} #52#return; {25040#true} is VALID [2022-04-28 03:53:56,860 INFO L272 TraceCheckUtils]: 4: Hoare triple {25040#true} call #t~ret7 := main(); {25040#true} is VALID [2022-04-28 03:53:56,860 INFO L290 TraceCheckUtils]: 5: Hoare triple {25040#true} ~x~0 := 0;~y~0 := 50000;~z~0 := 0;~x~0 := 0; {25045#(and (= main_~x~0 0) (<= 50000 main_~y~0))} is VALID [2022-04-28 03:53:56,860 INFO L290 TraceCheckUtils]: 6: Hoare triple {25045#(and (= main_~x~0 0) (<= 50000 main_~y~0))} [160] L11-2-->L18-1_primed: Formula: (let ((.cse0 (= v_main_~x~0_1383 v_main_~x~0_1382)) (.cse1 (= |v_main_#t~post4_165| |v_main_#t~post4_164|))) (or (and (< v_main_~x~0_1382 50001) (< v_main_~x~0_1383 v_main_~x~0_1382)) (and (<= 50000 v_main_~x~0_1383) .cse0 .cse1) (and .cse0 .cse1))) InVars {main_~x~0=v_main_~x~0_1383, main_#t~post4=|v_main_#t~post4_165|} OutVars{main_~x~0=v_main_~x~0_1382, main_#t~post4=|v_main_#t~post4_164|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {25046#(and (<= main_~x~0 main_~y~0) (<= 50000 main_~y~0))} is VALID [2022-04-28 03:53:56,861 INFO L290 TraceCheckUtils]: 7: Hoare triple {25046#(and (<= main_~x~0 main_~y~0) (<= 50000 main_~y~0))} [161] L18-1_primed-->L11-2: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {25046#(and (<= main_~x~0 main_~y~0) (<= 50000 main_~y~0))} is VALID [2022-04-28 03:53:56,861 INFO L290 TraceCheckUtils]: 8: Hoare triple {25046#(and (<= main_~x~0 main_~y~0) (<= 50000 main_~y~0))} [162] L11-2-->L18-1_primed: Formula: (let ((.cse0 (= v_main_~x~0_1385 v_main_~x~0_1384)) (.cse1 (= |v_main_#t~post6_179| |v_main_#t~post6_178|)) (.cse2 (= v_main_~y~0_1489 v_main_~y~0_1488)) (.cse3 (= |v_main_#t~post5_179| |v_main_#t~post5_178|)) (.cse4 (<= 50000 v_main_~x~0_1385))) (or (and .cse0 .cse1 .cse2 .cse3) (and .cse0 .cse1 .cse2 .cse3 (or (not .cse4) (not (< v_main_~x~0_1385 1000000)))) (and (= (+ v_main_~x~0_1384 v_main_~y~0_1489) (+ v_main_~x~0_1385 v_main_~y~0_1488)) .cse4 (< v_main_~x~0_1384 1000001) (< v_main_~x~0_1385 v_main_~x~0_1384)))) InVars {main_~y~0=v_main_~y~0_1489, main_#t~post5=|v_main_#t~post5_179|, main_~x~0=v_main_~x~0_1385, main_#t~post6=|v_main_#t~post6_179|} OutVars{main_~y~0=v_main_~y~0_1488, main_#t~post5=|v_main_#t~post5_178|, main_~x~0=v_main_~x~0_1384, main_#t~post6=|v_main_#t~post6_178|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {25047#(or (<= main_~x~0 main_~y~0) (<= 50000 main_~y~0))} is VALID [2022-04-28 03:53:56,862 INFO L290 TraceCheckUtils]: 9: Hoare triple {25047#(or (<= main_~x~0 main_~y~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[] {25048#(<= 50000 main_~y~0)} is VALID [2022-04-28 03:53:56,862 INFO L290 TraceCheckUtils]: 10: Hoare triple {25048#(<= 50000 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {25049#(<= 49998 main_~y~0)} is VALID [2022-04-28 03:53:56,863 INFO L290 TraceCheckUtils]: 11: Hoare triple {25049#(<= 49998 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {25050#(<= 49996 main_~y~0)} is VALID [2022-04-28 03:53:56,863 INFO L290 TraceCheckUtils]: 12: Hoare triple {25050#(<= 49996 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {25051#(<= 49994 main_~y~0)} is VALID [2022-04-28 03:53:56,864 INFO L290 TraceCheckUtils]: 13: Hoare triple {25051#(<= 49994 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {25052#(<= 49992 main_~y~0)} is VALID [2022-04-28 03:53:56,864 INFO L290 TraceCheckUtils]: 14: Hoare triple {25052#(<= 49992 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {25053#(<= 49990 main_~y~0)} is VALID [2022-04-28 03:53:56,864 INFO L290 TraceCheckUtils]: 15: Hoare triple {25053#(<= 49990 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {25054#(<= 49988 main_~y~0)} is VALID [2022-04-28 03:53:56,865 INFO L290 TraceCheckUtils]: 16: Hoare triple {25054#(<= 49988 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {25055#(<= 49986 main_~y~0)} is VALID [2022-04-28 03:53:56,865 INFO L290 TraceCheckUtils]: 17: Hoare triple {25055#(<= 49986 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {25056#(<= 49984 main_~y~0)} is VALID [2022-04-28 03:53:56,866 INFO L290 TraceCheckUtils]: 18: Hoare triple {25056#(<= 49984 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {25057#(<= 49982 main_~y~0)} is VALID [2022-04-28 03:53:56,866 INFO L290 TraceCheckUtils]: 19: Hoare triple {25057#(<= 49982 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {25058#(<= 49980 main_~y~0)} is VALID [2022-04-28 03:53:56,866 INFO L290 TraceCheckUtils]: 20: Hoare triple {25058#(<= 49980 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {25059#(<= 49978 main_~y~0)} is VALID [2022-04-28 03:53:56,867 INFO L290 TraceCheckUtils]: 21: Hoare triple {25059#(<= 49978 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {25060#(<= 49976 main_~y~0)} is VALID [2022-04-28 03:53:56,867 INFO L290 TraceCheckUtils]: 22: Hoare triple {25060#(<= 49976 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {25061#(<= 49974 main_~y~0)} is VALID [2022-04-28 03:53:56,868 INFO L290 TraceCheckUtils]: 23: Hoare triple {25061#(<= 49974 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {25062#(<= 49972 main_~y~0)} is VALID [2022-04-28 03:53:56,868 INFO L290 TraceCheckUtils]: 24: Hoare triple {25062#(<= 49972 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {25063#(<= 49970 main_~y~0)} is VALID [2022-04-28 03:53:56,869 INFO L290 TraceCheckUtils]: 25: Hoare triple {25063#(<= 49970 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {25064#(<= 49968 main_~y~0)} is VALID [2022-04-28 03:53:56,869 INFO L290 TraceCheckUtils]: 26: Hoare triple {25064#(<= 49968 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {25065#(<= 49966 main_~y~0)} is VALID [2022-04-28 03:53:56,869 INFO L290 TraceCheckUtils]: 27: Hoare triple {25065#(<= 49966 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {25066#(<= 49964 main_~y~0)} is VALID [2022-04-28 03:53:56,870 INFO L290 TraceCheckUtils]: 28: Hoare triple {25066#(<= 49964 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {25067#(<= 49962 main_~y~0)} is VALID [2022-04-28 03:53:56,870 INFO L290 TraceCheckUtils]: 29: Hoare triple {25067#(<= 49962 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {25068#(<= 49960 main_~y~0)} is VALID [2022-04-28 03:53:56,881 INFO L290 TraceCheckUtils]: 30: Hoare triple {25068#(<= 49960 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {25069#(<= 49958 main_~y~0)} is VALID [2022-04-28 03:53:56,881 INFO L290 TraceCheckUtils]: 31: Hoare triple {25069#(<= 49958 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {25070#(<= 49956 main_~y~0)} is VALID [2022-04-28 03:53:56,882 INFO L290 TraceCheckUtils]: 32: Hoare triple {25070#(<= 49956 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {25071#(<= 49954 main_~y~0)} is VALID [2022-04-28 03:53:56,882 INFO L290 TraceCheckUtils]: 33: Hoare triple {25071#(<= 49954 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {25072#(<= 49952 main_~y~0)} is VALID [2022-04-28 03:53:56,883 INFO L290 TraceCheckUtils]: 34: Hoare triple {25072#(<= 49952 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {25073#(<= 49950 main_~y~0)} is VALID [2022-04-28 03:53:56,883 INFO L290 TraceCheckUtils]: 35: Hoare triple {25073#(<= 49950 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {25074#(<= 49948 main_~y~0)} is VALID [2022-04-28 03:53:56,883 INFO L290 TraceCheckUtils]: 36: Hoare triple {25074#(<= 49948 main_~y~0)} assume !(~y~0 > 0); {25041#false} is VALID [2022-04-28 03:53:56,883 INFO L272 TraceCheckUtils]: 37: Hoare triple {25041#false} call __VERIFIER_assert((if ~z~0 == ~x~0 then 1 else 0)); {25041#false} is VALID [2022-04-28 03:53:56,883 INFO L290 TraceCheckUtils]: 38: Hoare triple {25041#false} ~cond := #in~cond; {25041#false} is VALID [2022-04-28 03:53:56,883 INFO L290 TraceCheckUtils]: 39: Hoare triple {25041#false} assume 0 == ~cond; {25041#false} is VALID [2022-04-28 03:53:56,884 INFO L290 TraceCheckUtils]: 40: Hoare triple {25041#false} assume !false; {25041#false} is VALID [2022-04-28 03:53:56,884 INFO L134 CoverageAnalysis]: Checked inductivity of 353 backedges. 0 proven. 353 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 03:53:56,884 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 03:53:56,884 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [545722568] [2022-04-28 03:53:56,884 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [545722568] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 03:53:56,884 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1803237960] [2022-04-28 03:53:56,884 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:53:56,884 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 03:53:56,884 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 03:53:56,885 INFO L229 MonitoredProcess]: Starting monitored process 27 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 03:53:56,886 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (27)] Waiting until timeout for monitored process [2022-04-28 03:53:56,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:53:56,930 INFO L263 TraceCheckSpWp]: Trace formula consists of 189 conjuncts, 29 conjunts are in the unsatisfiable core [2022-04-28 03:53:56,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:53:56,952 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 03:53:57,367 INFO L272 TraceCheckUtils]: 0: Hoare triple {25040#true} call ULTIMATE.init(); {25040#true} is VALID [2022-04-28 03:53:57,367 INFO L290 TraceCheckUtils]: 1: Hoare triple {25040#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); {25040#true} is VALID [2022-04-28 03:53:57,367 INFO L290 TraceCheckUtils]: 2: Hoare triple {25040#true} assume true; {25040#true} is VALID [2022-04-28 03:53:57,368 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {25040#true} {25040#true} #52#return; {25040#true} is VALID [2022-04-28 03:53:57,368 INFO L272 TraceCheckUtils]: 4: Hoare triple {25040#true} call #t~ret7 := main(); {25040#true} is VALID [2022-04-28 03:53:57,369 INFO L290 TraceCheckUtils]: 5: Hoare triple {25040#true} ~x~0 := 0;~y~0 := 50000;~z~0 := 0;~x~0 := 0; {25048#(<= 50000 main_~y~0)} is VALID [2022-04-28 03:53:57,369 INFO L290 TraceCheckUtils]: 6: Hoare triple {25048#(<= 50000 main_~y~0)} [160] L11-2-->L18-1_primed: Formula: (let ((.cse0 (= v_main_~x~0_1383 v_main_~x~0_1382)) (.cse1 (= |v_main_#t~post4_165| |v_main_#t~post4_164|))) (or (and (< v_main_~x~0_1382 50001) (< v_main_~x~0_1383 v_main_~x~0_1382)) (and (<= 50000 v_main_~x~0_1383) .cse0 .cse1) (and .cse0 .cse1))) InVars {main_~x~0=v_main_~x~0_1383, main_#t~post4=|v_main_#t~post4_165|} OutVars{main_~x~0=v_main_~x~0_1382, main_#t~post4=|v_main_#t~post4_164|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {25048#(<= 50000 main_~y~0)} is VALID [2022-04-28 03:53:57,369 INFO L290 TraceCheckUtils]: 7: Hoare triple {25048#(<= 50000 main_~y~0)} [161] L18-1_primed-->L11-2: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {25048#(<= 50000 main_~y~0)} is VALID [2022-04-28 03:53:57,370 INFO L290 TraceCheckUtils]: 8: Hoare triple {25048#(<= 50000 main_~y~0)} [162] L11-2-->L18-1_primed: Formula: (let ((.cse0 (= v_main_~x~0_1385 v_main_~x~0_1384)) (.cse1 (= |v_main_#t~post6_179| |v_main_#t~post6_178|)) (.cse2 (= v_main_~y~0_1489 v_main_~y~0_1488)) (.cse3 (= |v_main_#t~post5_179| |v_main_#t~post5_178|)) (.cse4 (<= 50000 v_main_~x~0_1385))) (or (and .cse0 .cse1 .cse2 .cse3) (and .cse0 .cse1 .cse2 .cse3 (or (not .cse4) (not (< v_main_~x~0_1385 1000000)))) (and (= (+ v_main_~x~0_1384 v_main_~y~0_1489) (+ v_main_~x~0_1385 v_main_~y~0_1488)) .cse4 (< v_main_~x~0_1384 1000001) (< v_main_~x~0_1385 v_main_~x~0_1384)))) InVars {main_~y~0=v_main_~y~0_1489, main_#t~post5=|v_main_#t~post5_179|, main_~x~0=v_main_~x~0_1385, main_#t~post6=|v_main_#t~post6_179|} OutVars{main_~y~0=v_main_~y~0_1488, main_#t~post5=|v_main_#t~post5_178|, main_~x~0=v_main_~x~0_1384, main_#t~post6=|v_main_#t~post6_178|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {25048#(<= 50000 main_~y~0)} is VALID [2022-04-28 03:53:57,370 INFO L290 TraceCheckUtils]: 9: Hoare triple {25048#(<= 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[] {25048#(<= 50000 main_~y~0)} is VALID [2022-04-28 03:53:57,371 INFO L290 TraceCheckUtils]: 10: Hoare triple {25048#(<= 50000 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {25049#(<= 49998 main_~y~0)} is VALID [2022-04-28 03:53:57,371 INFO L290 TraceCheckUtils]: 11: Hoare triple {25049#(<= 49998 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {25050#(<= 49996 main_~y~0)} is VALID [2022-04-28 03:53:57,371 INFO L290 TraceCheckUtils]: 12: Hoare triple {25050#(<= 49996 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {25051#(<= 49994 main_~y~0)} is VALID [2022-04-28 03:53:57,372 INFO L290 TraceCheckUtils]: 13: Hoare triple {25051#(<= 49994 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {25052#(<= 49992 main_~y~0)} is VALID [2022-04-28 03:53:57,372 INFO L290 TraceCheckUtils]: 14: Hoare triple {25052#(<= 49992 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {25053#(<= 49990 main_~y~0)} is VALID [2022-04-28 03:53:57,373 INFO L290 TraceCheckUtils]: 15: Hoare triple {25053#(<= 49990 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {25054#(<= 49988 main_~y~0)} is VALID [2022-04-28 03:53:57,373 INFO L290 TraceCheckUtils]: 16: Hoare triple {25054#(<= 49988 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {25055#(<= 49986 main_~y~0)} is VALID [2022-04-28 03:53:57,374 INFO L290 TraceCheckUtils]: 17: Hoare triple {25055#(<= 49986 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {25056#(<= 49984 main_~y~0)} is VALID [2022-04-28 03:53:57,374 INFO L290 TraceCheckUtils]: 18: Hoare triple {25056#(<= 49984 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {25057#(<= 49982 main_~y~0)} is VALID [2022-04-28 03:53:57,374 INFO L290 TraceCheckUtils]: 19: Hoare triple {25057#(<= 49982 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {25058#(<= 49980 main_~y~0)} is VALID [2022-04-28 03:53:57,375 INFO L290 TraceCheckUtils]: 20: Hoare triple {25058#(<= 49980 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {25059#(<= 49978 main_~y~0)} is VALID [2022-04-28 03:53:57,375 INFO L290 TraceCheckUtils]: 21: Hoare triple {25059#(<= 49978 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {25060#(<= 49976 main_~y~0)} is VALID [2022-04-28 03:53:57,376 INFO L290 TraceCheckUtils]: 22: Hoare triple {25060#(<= 49976 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {25061#(<= 49974 main_~y~0)} is VALID [2022-04-28 03:53:57,376 INFO L290 TraceCheckUtils]: 23: Hoare triple {25061#(<= 49974 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {25062#(<= 49972 main_~y~0)} is VALID [2022-04-28 03:53:57,377 INFO L290 TraceCheckUtils]: 24: Hoare triple {25062#(<= 49972 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {25063#(<= 49970 main_~y~0)} is VALID [2022-04-28 03:53:57,377 INFO L290 TraceCheckUtils]: 25: Hoare triple {25063#(<= 49970 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {25064#(<= 49968 main_~y~0)} is VALID [2022-04-28 03:53:57,377 INFO L290 TraceCheckUtils]: 26: Hoare triple {25064#(<= 49968 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {25065#(<= 49966 main_~y~0)} is VALID [2022-04-28 03:53:57,378 INFO L290 TraceCheckUtils]: 27: Hoare triple {25065#(<= 49966 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {25066#(<= 49964 main_~y~0)} is VALID [2022-04-28 03:53:57,379 INFO L290 TraceCheckUtils]: 28: Hoare triple {25066#(<= 49964 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {25067#(<= 49962 main_~y~0)} is VALID [2022-04-28 03:53:57,379 INFO L290 TraceCheckUtils]: 29: Hoare triple {25067#(<= 49962 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {25068#(<= 49960 main_~y~0)} is VALID [2022-04-28 03:53:57,379 INFO L290 TraceCheckUtils]: 30: Hoare triple {25068#(<= 49960 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {25069#(<= 49958 main_~y~0)} is VALID [2022-04-28 03:53:57,380 INFO L290 TraceCheckUtils]: 31: Hoare triple {25069#(<= 49958 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {25070#(<= 49956 main_~y~0)} is VALID [2022-04-28 03:53:57,380 INFO L290 TraceCheckUtils]: 32: Hoare triple {25070#(<= 49956 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {25071#(<= 49954 main_~y~0)} is VALID [2022-04-28 03:53:57,381 INFO L290 TraceCheckUtils]: 33: Hoare triple {25071#(<= 49954 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {25072#(<= 49952 main_~y~0)} is VALID [2022-04-28 03:53:57,381 INFO L290 TraceCheckUtils]: 34: Hoare triple {25072#(<= 49952 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {25073#(<= 49950 main_~y~0)} is VALID [2022-04-28 03:53:57,382 INFO L290 TraceCheckUtils]: 35: Hoare triple {25073#(<= 49950 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {25074#(<= 49948 main_~y~0)} is VALID [2022-04-28 03:53:57,382 INFO L290 TraceCheckUtils]: 36: Hoare triple {25074#(<= 49948 main_~y~0)} assume !(~y~0 > 0); {25041#false} is VALID [2022-04-28 03:53:57,382 INFO L272 TraceCheckUtils]: 37: Hoare triple {25041#false} call __VERIFIER_assert((if ~z~0 == ~x~0 then 1 else 0)); {25041#false} is VALID [2022-04-28 03:53:57,382 INFO L290 TraceCheckUtils]: 38: Hoare triple {25041#false} ~cond := #in~cond; {25041#false} is VALID [2022-04-28 03:53:57,382 INFO L290 TraceCheckUtils]: 39: Hoare triple {25041#false} assume 0 == ~cond; {25041#false} is VALID [2022-04-28 03:53:57,382 INFO L290 TraceCheckUtils]: 40: Hoare triple {25041#false} assume !false; {25041#false} is VALID [2022-04-28 03:53:57,382 INFO L134 CoverageAnalysis]: Checked inductivity of 353 backedges. 0 proven. 351 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-04-28 03:53:57,382 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 03:53:58,581 INFO L290 TraceCheckUtils]: 40: Hoare triple {25041#false} assume !false; {25041#false} is VALID [2022-04-28 03:53:58,581 INFO L290 TraceCheckUtils]: 39: Hoare triple {25041#false} assume 0 == ~cond; {25041#false} is VALID [2022-04-28 03:53:58,581 INFO L290 TraceCheckUtils]: 38: Hoare triple {25041#false} ~cond := #in~cond; {25041#false} is VALID [2022-04-28 03:53:58,581 INFO L272 TraceCheckUtils]: 37: Hoare triple {25041#false} call __VERIFIER_assert((if ~z~0 == ~x~0 then 1 else 0)); {25041#false} is VALID [2022-04-28 03:53:58,581 INFO L290 TraceCheckUtils]: 36: Hoare triple {25211#(< 0 main_~y~0)} assume !(~y~0 > 0); {25041#false} is VALID [2022-04-28 03:53:58,582 INFO L290 TraceCheckUtils]: 35: Hoare triple {25215#(< 2 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {25211#(< 0 main_~y~0)} is VALID [2022-04-28 03:53:58,583 INFO L290 TraceCheckUtils]: 34: Hoare triple {25219#(< 4 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {25215#(< 2 main_~y~0)} is VALID [2022-04-28 03:53:58,583 INFO L290 TraceCheckUtils]: 33: Hoare triple {25223#(< 6 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {25219#(< 4 main_~y~0)} is VALID [2022-04-28 03:53:58,584 INFO L290 TraceCheckUtils]: 32: Hoare triple {25227#(< 8 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {25223#(< 6 main_~y~0)} is VALID [2022-04-28 03:53:58,584 INFO L290 TraceCheckUtils]: 31: Hoare triple {25231#(< 10 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {25227#(< 8 main_~y~0)} is VALID [2022-04-28 03:53:58,585 INFO L290 TraceCheckUtils]: 30: Hoare triple {25235#(< 12 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {25231#(< 10 main_~y~0)} is VALID [2022-04-28 03:53:58,585 INFO L290 TraceCheckUtils]: 29: Hoare triple {25239#(< 14 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {25235#(< 12 main_~y~0)} is VALID [2022-04-28 03:53:58,586 INFO L290 TraceCheckUtils]: 28: Hoare triple {25243#(< 16 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {25239#(< 14 main_~y~0)} is VALID [2022-04-28 03:53:58,586 INFO L290 TraceCheckUtils]: 27: Hoare triple {25247#(< 18 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {25243#(< 16 main_~y~0)} is VALID [2022-04-28 03:53:58,587 INFO L290 TraceCheckUtils]: 26: Hoare triple {25251#(< 20 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {25247#(< 18 main_~y~0)} is VALID [2022-04-28 03:53:58,587 INFO L290 TraceCheckUtils]: 25: Hoare triple {25255#(< 22 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {25251#(< 20 main_~y~0)} is VALID [2022-04-28 03:53:58,588 INFO L290 TraceCheckUtils]: 24: Hoare triple {25259#(< 24 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {25255#(< 22 main_~y~0)} is VALID [2022-04-28 03:53:58,588 INFO L290 TraceCheckUtils]: 23: Hoare triple {25263#(< 26 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {25259#(< 24 main_~y~0)} is VALID [2022-04-28 03:53:58,588 INFO L290 TraceCheckUtils]: 22: Hoare triple {25267#(< 28 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {25263#(< 26 main_~y~0)} is VALID [2022-04-28 03:53:58,589 INFO L290 TraceCheckUtils]: 21: Hoare triple {25271#(< 30 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {25267#(< 28 main_~y~0)} is VALID [2022-04-28 03:53:58,589 INFO L290 TraceCheckUtils]: 20: Hoare triple {25275#(< 32 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {25271#(< 30 main_~y~0)} is VALID [2022-04-28 03:53:58,590 INFO L290 TraceCheckUtils]: 19: Hoare triple {25279#(< 34 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {25275#(< 32 main_~y~0)} is VALID [2022-04-28 03:53:58,590 INFO L290 TraceCheckUtils]: 18: Hoare triple {25283#(< 36 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {25279#(< 34 main_~y~0)} is VALID [2022-04-28 03:53:58,591 INFO L290 TraceCheckUtils]: 17: Hoare triple {25287#(< 38 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {25283#(< 36 main_~y~0)} is VALID [2022-04-28 03:53:58,591 INFO L290 TraceCheckUtils]: 16: Hoare triple {25291#(< 40 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {25287#(< 38 main_~y~0)} is VALID [2022-04-28 03:53:58,592 INFO L290 TraceCheckUtils]: 15: Hoare triple {25295#(< 42 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {25291#(< 40 main_~y~0)} is VALID [2022-04-28 03:53:58,592 INFO L290 TraceCheckUtils]: 14: Hoare triple {25299#(< 44 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {25295#(< 42 main_~y~0)} is VALID [2022-04-28 03:53:58,593 INFO L290 TraceCheckUtils]: 13: Hoare triple {25303#(< 46 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {25299#(< 44 main_~y~0)} is VALID [2022-04-28 03:53:58,593 INFO L290 TraceCheckUtils]: 12: Hoare triple {25307#(< 48 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {25303#(< 46 main_~y~0)} is VALID [2022-04-28 03:53:58,594 INFO L290 TraceCheckUtils]: 11: Hoare triple {25311#(< 50 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {25307#(< 48 main_~y~0)} is VALID [2022-04-28 03:53:58,594 INFO L290 TraceCheckUtils]: 10: Hoare triple {25315#(< 52 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {25311#(< 50 main_~y~0)} is VALID [2022-04-28 03:53:58,594 INFO L290 TraceCheckUtils]: 9: Hoare triple {25315#(< 52 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[] {25315#(< 52 main_~y~0)} is VALID [2022-04-28 03:53:58,595 INFO L290 TraceCheckUtils]: 8: Hoare triple {25315#(< 52 main_~y~0)} [162] L11-2-->L18-1_primed: Formula: (let ((.cse0 (= v_main_~x~0_1385 v_main_~x~0_1384)) (.cse1 (= |v_main_#t~post6_179| |v_main_#t~post6_178|)) (.cse2 (= v_main_~y~0_1489 v_main_~y~0_1488)) (.cse3 (= |v_main_#t~post5_179| |v_main_#t~post5_178|)) (.cse4 (<= 50000 v_main_~x~0_1385))) (or (and .cse0 .cse1 .cse2 .cse3) (and .cse0 .cse1 .cse2 .cse3 (or (not .cse4) (not (< v_main_~x~0_1385 1000000)))) (and (= (+ v_main_~x~0_1384 v_main_~y~0_1489) (+ v_main_~x~0_1385 v_main_~y~0_1488)) .cse4 (< v_main_~x~0_1384 1000001) (< v_main_~x~0_1385 v_main_~x~0_1384)))) InVars {main_~y~0=v_main_~y~0_1489, main_#t~post5=|v_main_#t~post5_179|, main_~x~0=v_main_~x~0_1385, main_#t~post6=|v_main_#t~post6_179|} OutVars{main_~y~0=v_main_~y~0_1488, main_#t~post5=|v_main_#t~post5_178|, main_~x~0=v_main_~x~0_1384, main_#t~post6=|v_main_#t~post6_178|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {25315#(< 52 main_~y~0)} is VALID [2022-04-28 03:53:58,596 INFO L290 TraceCheckUtils]: 7: Hoare triple {25315#(< 52 main_~y~0)} [161] L18-1_primed-->L11-2: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {25315#(< 52 main_~y~0)} is VALID [2022-04-28 03:53:58,596 INFO L290 TraceCheckUtils]: 6: Hoare triple {25315#(< 52 main_~y~0)} [160] L11-2-->L18-1_primed: Formula: (let ((.cse0 (= v_main_~x~0_1383 v_main_~x~0_1382)) (.cse1 (= |v_main_#t~post4_165| |v_main_#t~post4_164|))) (or (and (< v_main_~x~0_1382 50001) (< v_main_~x~0_1383 v_main_~x~0_1382)) (and (<= 50000 v_main_~x~0_1383) .cse0 .cse1) (and .cse0 .cse1))) InVars {main_~x~0=v_main_~x~0_1383, main_#t~post4=|v_main_#t~post4_165|} OutVars{main_~x~0=v_main_~x~0_1382, main_#t~post4=|v_main_#t~post4_164|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {25315#(< 52 main_~y~0)} is VALID [2022-04-28 03:53:58,596 INFO L290 TraceCheckUtils]: 5: Hoare triple {25040#true} ~x~0 := 0;~y~0 := 50000;~z~0 := 0;~x~0 := 0; {25315#(< 52 main_~y~0)} is VALID [2022-04-28 03:53:58,596 INFO L272 TraceCheckUtils]: 4: Hoare triple {25040#true} call #t~ret7 := main(); {25040#true} is VALID [2022-04-28 03:53:58,596 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {25040#true} {25040#true} #52#return; {25040#true} is VALID [2022-04-28 03:53:58,597 INFO L290 TraceCheckUtils]: 2: Hoare triple {25040#true} assume true; {25040#true} is VALID [2022-04-28 03:53:58,597 INFO L290 TraceCheckUtils]: 1: Hoare triple {25040#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); {25040#true} is VALID [2022-04-28 03:53:58,597 INFO L272 TraceCheckUtils]: 0: Hoare triple {25040#true} call ULTIMATE.init(); {25040#true} is VALID [2022-04-28 03:53:58,597 INFO L134 CoverageAnalysis]: Checked inductivity of 353 backedges. 0 proven. 351 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-04-28 03:53:58,597 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1803237960] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 03:53:58,597 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 03:53:58,597 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [33, 29, 29] total 60 [2022-04-28 03:54:00,537 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 03:54:00,537 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [269445255] [2022-04-28 03:54:00,537 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [269445255] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 03:54:00,537 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 03:54:00,537 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [81] imperfect sequences [] total 81 [2022-04-28 03:54:00,537 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [233299403] [2022-04-28 03:54:00,537 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 03:54:00,538 INFO L78 Accepts]: Start accepts. Automaton has has 81 states, 81 states have (on average 1.654320987654321) internal successors, (134), 80 states have internal predecessors, (134), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 138 [2022-04-28 03:54:00,538 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 03:54:00,538 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 81 states, 81 states have (on average 1.654320987654321) internal successors, (134), 80 states have internal predecessors, (134), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:54:00,640 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 138 edges. 138 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 03:54:00,640 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 81 states [2022-04-28 03:54:00,640 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 03:54:00,641 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 81 interpolants. [2022-04-28 03:54:00,642 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=4620, Invalid=7590, Unknown=0, NotChecked=0, Total=12210 [2022-04-28 03:54:00,642 INFO L87 Difference]: Start difference. First operand 139 states and 142 transitions. Second operand has 81 states, 81 states have (on average 1.654320987654321) internal successors, (134), 80 states have internal predecessors, (134), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:54:11,274 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:54:11,274 INFO L93 Difference]: Finished difference Result 371 states and 382 transitions. [2022-04-28 03:54:11,274 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 81 states. [2022-04-28 03:54:11,275 INFO L78 Accepts]: Start accepts. Automaton has has 81 states, 81 states have (on average 1.654320987654321) internal successors, (134), 80 states have internal predecessors, (134), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 138 [2022-04-28 03:54:11,275 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 03:54:11,275 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 81 states, 81 states have (on average 1.654320987654321) internal successors, (134), 80 states have internal predecessors, (134), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:54:11,276 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 160 transitions. [2022-04-28 03:54:11,276 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 81 states, 81 states have (on average 1.654320987654321) internal successors, (134), 80 states have internal predecessors, (134), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:54:11,277 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 160 transitions. [2022-04-28 03:54:11,277 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 81 states and 160 transitions. [2022-04-28 03:54:11,395 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 160 edges. 160 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 03:54:11,397 INFO L225 Difference]: With dead ends: 371 [2022-04-28 03:54:11,397 INFO L226 Difference]: Without dead ends: 240 [2022-04-28 03:54:11,400 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 298 GetRequests, 110 SyntacticMatches, 1 SemanticMatches, 187 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10433 ImplicationChecksByTransitivity, 4.8s TimeCoverageRelationStatistics Valid=10599, Invalid=24933, Unknown=0, NotChecked=0, Total=35532 [2022-04-28 03:54:11,400 INFO L413 NwaCegarLoop]: 12 mSDtfsCounter, 324 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 5450 mSolverCounterSat, 349 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 324 SdHoareTripleChecker+Valid, 34 SdHoareTripleChecker+Invalid, 5799 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 349 IncrementalHoareTripleChecker+Valid, 5450 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.2s IncrementalHoareTripleChecker+Time [2022-04-28 03:54:11,400 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [324 Valid, 34 Invalid, 5799 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [349 Valid, 5450 Invalid, 0 Unknown, 0 Unchecked, 4.2s Time] [2022-04-28 03:54:11,400 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 240 states. [2022-04-28 03:54:11,786 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 240 to 240. [2022-04-28 03:54:11,786 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 03:54:11,787 INFO L82 GeneralOperation]: Start isEquivalent. First operand 240 states. Second operand has 240 states, 235 states have (on average 1.0212765957446808) internal successors, (240), 235 states have internal predecessors, (240), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:54:11,787 INFO L74 IsIncluded]: Start isIncluded. First operand 240 states. Second operand has 240 states, 235 states have (on average 1.0212765957446808) internal successors, (240), 235 states have internal predecessors, (240), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:54:11,787 INFO L87 Difference]: Start difference. First operand 240 states. Second operand has 240 states, 235 states have (on average 1.0212765957446808) internal successors, (240), 235 states have internal predecessors, (240), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:54:11,790 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:54:11,790 INFO L93 Difference]: Finished difference Result 240 states and 244 transitions. [2022-04-28 03:54:11,790 INFO L276 IsEmpty]: Start isEmpty. Operand 240 states and 244 transitions. [2022-04-28 03:54:11,790 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:54:11,790 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:54:11,790 INFO L74 IsIncluded]: Start isIncluded. First operand has 240 states, 235 states have (on average 1.0212765957446808) internal successors, (240), 235 states have internal predecessors, (240), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 240 states. [2022-04-28 03:54:11,790 INFO L87 Difference]: Start difference. First operand has 240 states, 235 states have (on average 1.0212765957446808) internal successors, (240), 235 states have internal predecessors, (240), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 240 states. [2022-04-28 03:54:11,793 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:54:11,793 INFO L93 Difference]: Finished difference Result 240 states and 244 transitions. [2022-04-28 03:54:11,793 INFO L276 IsEmpty]: Start isEmpty. Operand 240 states and 244 transitions. [2022-04-28 03:54:11,793 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:54:11,793 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:54:11,793 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 03:54:11,793 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 03:54:11,793 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 240 states, 235 states have (on average 1.0212765957446808) internal successors, (240), 235 states have internal predecessors, (240), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:54:11,796 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 240 states to 240 states and 244 transitions. [2022-04-28 03:54:11,796 INFO L78 Accepts]: Start accepts. Automaton has 240 states and 244 transitions. Word has length 138 [2022-04-28 03:54:11,796 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 03:54:11,796 INFO L495 AbstractCegarLoop]: Abstraction has 240 states and 244 transitions. [2022-04-28 03:54:11,796 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 81 states, 81 states have (on average 1.654320987654321) internal successors, (134), 80 states have internal predecessors, (134), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:54:11,796 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 240 states and 244 transitions. [2022-04-28 03:54:11,979 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 244 edges. 244 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 03:54:11,979 INFO L276 IsEmpty]: Start isEmpty. Operand 240 states and 244 transitions. [2022-04-28 03:54:11,979 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2022-04-28 03:54:11,979 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 03:54:11,980 INFO L195 NwaCegarLoop]: trace histogram [51, 50, 27, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 03:54:11,997 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (27)] Forceful destruction successful, exit code 0 [2022-04-28 03:54:12,180 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 27 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable28 [2022-04-28 03:54:12,180 INFO L420 AbstractCegarLoop]: === Iteration 30 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 03:54:12,180 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 03:54:12,180 INFO L85 PathProgramCache]: Analyzing trace with hash 980224015, now seen corresponding path program 27 times [2022-04-28 03:54:12,181 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 03:54:12,181 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [543552514] [2022-04-28 03:54:14,310 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 1 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 03:54:14,524 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={1=1, 2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 03:54:14,526 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-28 03:54:14,528 INFO L85 PathProgramCache]: Analyzing trace with hash -1012883742, now seen corresponding path program 1 times [2022-04-28 03:54:14,528 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 03:54:14,528 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2046037381] [2022-04-28 03:54:14,528 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:54:14,528 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 03:54:14,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:54:14,919 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 03:54:14,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:54:14,930 INFO L290 TraceCheckUtils]: 0: Hoare triple {27290#(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); {27257#true} is VALID [2022-04-28 03:54:14,930 INFO L290 TraceCheckUtils]: 1: Hoare triple {27257#true} assume true; {27257#true} is VALID [2022-04-28 03:54:14,931 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {27257#true} {27257#true} #52#return; {27257#true} is VALID [2022-04-28 03:54:14,931 INFO L272 TraceCheckUtils]: 0: Hoare triple {27257#true} call ULTIMATE.init(); {27290#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 03:54:14,931 INFO L290 TraceCheckUtils]: 1: Hoare triple {27290#(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); {27257#true} is VALID [2022-04-28 03:54:14,931 INFO L290 TraceCheckUtils]: 2: Hoare triple {27257#true} assume true; {27257#true} is VALID [2022-04-28 03:54:14,931 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {27257#true} {27257#true} #52#return; {27257#true} is VALID [2022-04-28 03:54:14,931 INFO L272 TraceCheckUtils]: 4: Hoare triple {27257#true} call #t~ret7 := main(); {27257#true} is VALID [2022-04-28 03:54:14,932 INFO L290 TraceCheckUtils]: 5: Hoare triple {27257#true} ~x~0 := 0;~y~0 := 50000;~z~0 := 0;~x~0 := 0; {27262#(<= 50000 main_~y~0)} is VALID [2022-04-28 03:54:14,932 INFO L290 TraceCheckUtils]: 6: Hoare triple {27262#(<= 50000 main_~y~0)} [164] L11-2-->L18-1_primed: Formula: (let ((.cse0 (= v_main_~x~0_1475 v_main_~x~0_1474))) (or (and .cse0 (= |v_main_#t~post4_171| |v_main_#t~post4_170|)) (and (< v_main_~x~0_1475 v_main_~x~0_1474) (< v_main_~x~0_1474 50001)) (and (<= 50000 v_main_~x~0_1475) (= |v_main_#t~post4_170| |v_main_#t~post4_171|) .cse0))) InVars {main_~x~0=v_main_~x~0_1475, main_#t~post4=|v_main_#t~post4_171|} OutVars{main_~x~0=v_main_~x~0_1474, main_#t~post4=|v_main_#t~post4_170|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {27262#(<= 50000 main_~y~0)} is VALID [2022-04-28 03:54:14,932 INFO L290 TraceCheckUtils]: 7: Hoare triple {27262#(<= 50000 main_~y~0)} [165] L18-1_primed-->L11-2: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {27262#(<= 50000 main_~y~0)} is VALID [2022-04-28 03:54:14,933 INFO L290 TraceCheckUtils]: 8: Hoare triple {27262#(<= 50000 main_~y~0)} [166] L11-2-->L18-1_primed: Formula: (let ((.cse0 (= v_main_~y~0_1599 v_main_~y~0_1598)) (.cse1 (= |v_main_#t~post5_186| |v_main_#t~post5_185|)) (.cse2 (= v_main_~x~0_1477 v_main_~x~0_1476)) (.cse3 (= |v_main_#t~post6_186| |v_main_#t~post6_185|)) (.cse4 (<= 50000 v_main_~x~0_1477))) (or (and .cse0 .cse1 .cse2 .cse3) (and (or (not .cse4) (not (< v_main_~x~0_1477 1000000))) .cse0 .cse1 .cse2 .cse3) (and (< v_main_~x~0_1476 1000001) (< v_main_~x~0_1477 v_main_~x~0_1476) (= (+ v_main_~x~0_1476 v_main_~y~0_1599) (+ v_main_~x~0_1477 v_main_~y~0_1598)) .cse4))) InVars {main_~y~0=v_main_~y~0_1599, main_#t~post5=|v_main_#t~post5_186|, main_~x~0=v_main_~x~0_1477, main_#t~post6=|v_main_#t~post6_186|} OutVars{main_~y~0=v_main_~y~0_1598, main_#t~post5=|v_main_#t~post5_185|, main_~x~0=v_main_~x~0_1476, main_#t~post6=|v_main_#t~post6_185|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {27262#(<= 50000 main_~y~0)} is VALID [2022-04-28 03:54:14,933 INFO L290 TraceCheckUtils]: 9: Hoare triple {27262#(<= 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[] {27262#(<= 50000 main_~y~0)} is VALID [2022-04-28 03:54:14,933 INFO L290 TraceCheckUtils]: 10: Hoare triple {27262#(<= 50000 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {27263#(<= 49998 main_~y~0)} is VALID [2022-04-28 03:54:14,934 INFO L290 TraceCheckUtils]: 11: Hoare triple {27263#(<= 49998 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {27264#(<= 49996 main_~y~0)} is VALID [2022-04-28 03:54:14,934 INFO L290 TraceCheckUtils]: 12: Hoare triple {27264#(<= 49996 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {27265#(<= 49994 main_~y~0)} is VALID [2022-04-28 03:54:14,935 INFO L290 TraceCheckUtils]: 13: Hoare triple {27265#(<= 49994 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {27266#(<= 49992 main_~y~0)} is VALID [2022-04-28 03:54:14,935 INFO L290 TraceCheckUtils]: 14: Hoare triple {27266#(<= 49992 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {27267#(<= 49990 main_~y~0)} is VALID [2022-04-28 03:54:14,936 INFO L290 TraceCheckUtils]: 15: Hoare triple {27267#(<= 49990 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {27268#(<= 49988 main_~y~0)} is VALID [2022-04-28 03:54:14,936 INFO L290 TraceCheckUtils]: 16: Hoare triple {27268#(<= 49988 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {27269#(<= 49986 main_~y~0)} is VALID [2022-04-28 03:54:14,936 INFO L290 TraceCheckUtils]: 17: Hoare triple {27269#(<= 49986 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {27270#(<= 49984 main_~y~0)} is VALID [2022-04-28 03:54:14,937 INFO L290 TraceCheckUtils]: 18: Hoare triple {27270#(<= 49984 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {27271#(<= 49982 main_~y~0)} is VALID [2022-04-28 03:54:14,937 INFO L290 TraceCheckUtils]: 19: Hoare triple {27271#(<= 49982 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {27272#(<= 49980 main_~y~0)} is VALID [2022-04-28 03:54:14,938 INFO L290 TraceCheckUtils]: 20: Hoare triple {27272#(<= 49980 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {27273#(<= 49978 main_~y~0)} is VALID [2022-04-28 03:54:14,938 INFO L290 TraceCheckUtils]: 21: Hoare triple {27273#(<= 49978 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {27274#(<= 49976 main_~y~0)} is VALID [2022-04-28 03:54:14,938 INFO L290 TraceCheckUtils]: 22: Hoare triple {27274#(<= 49976 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {27275#(<= 49974 main_~y~0)} is VALID [2022-04-28 03:54:14,939 INFO L290 TraceCheckUtils]: 23: Hoare triple {27275#(<= 49974 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {27276#(<= 49972 main_~y~0)} is VALID [2022-04-28 03:54:14,939 INFO L290 TraceCheckUtils]: 24: Hoare triple {27276#(<= 49972 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {27277#(<= 49970 main_~y~0)} is VALID [2022-04-28 03:54:14,940 INFO L290 TraceCheckUtils]: 25: Hoare triple {27277#(<= 49970 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {27278#(<= 49968 main_~y~0)} is VALID [2022-04-28 03:54:14,940 INFO L290 TraceCheckUtils]: 26: Hoare triple {27278#(<= 49968 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {27279#(<= 49966 main_~y~0)} is VALID [2022-04-28 03:54:14,941 INFO L290 TraceCheckUtils]: 27: Hoare triple {27279#(<= 49966 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {27280#(<= 49964 main_~y~0)} is VALID [2022-04-28 03:54:14,941 INFO L290 TraceCheckUtils]: 28: Hoare triple {27280#(<= 49964 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {27281#(<= 49962 main_~y~0)} is VALID [2022-04-28 03:54:14,941 INFO L290 TraceCheckUtils]: 29: Hoare triple {27281#(<= 49962 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {27282#(<= 49960 main_~y~0)} is VALID [2022-04-28 03:54:14,942 INFO L290 TraceCheckUtils]: 30: Hoare triple {27282#(<= 49960 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {27283#(<= 49958 main_~y~0)} is VALID [2022-04-28 03:54:14,942 INFO L290 TraceCheckUtils]: 31: Hoare triple {27283#(<= 49958 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {27284#(<= 49956 main_~y~0)} is VALID [2022-04-28 03:54:14,943 INFO L290 TraceCheckUtils]: 32: Hoare triple {27284#(<= 49956 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {27285#(<= 49954 main_~y~0)} is VALID [2022-04-28 03:54:14,943 INFO L290 TraceCheckUtils]: 33: Hoare triple {27285#(<= 49954 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {27286#(<= 49952 main_~y~0)} is VALID [2022-04-28 03:54:14,944 INFO L290 TraceCheckUtils]: 34: Hoare triple {27286#(<= 49952 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {27287#(<= 49950 main_~y~0)} is VALID [2022-04-28 03:54:14,944 INFO L290 TraceCheckUtils]: 35: Hoare triple {27287#(<= 49950 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {27288#(<= 49948 main_~y~0)} is VALID [2022-04-28 03:54:14,944 INFO L290 TraceCheckUtils]: 36: Hoare triple {27288#(<= 49948 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {27289#(<= 49946 main_~y~0)} is VALID [2022-04-28 03:54:14,945 INFO L290 TraceCheckUtils]: 37: Hoare triple {27289#(<= 49946 main_~y~0)} assume !(~y~0 > 0); {27258#false} is VALID [2022-04-28 03:54:14,945 INFO L272 TraceCheckUtils]: 38: Hoare triple {27258#false} call __VERIFIER_assert((if ~z~0 == ~x~0 then 1 else 0)); {27258#false} is VALID [2022-04-28 03:54:14,945 INFO L290 TraceCheckUtils]: 39: Hoare triple {27258#false} ~cond := #in~cond; {27258#false} is VALID [2022-04-28 03:54:14,945 INFO L290 TraceCheckUtils]: 40: Hoare triple {27258#false} assume 0 == ~cond; {27258#false} is VALID [2022-04-28 03:54:14,945 INFO L290 TraceCheckUtils]: 41: Hoare triple {27258#false} assume !false; {27258#false} is VALID [2022-04-28 03:54:14,945 INFO L134 CoverageAnalysis]: Checked inductivity of 380 backedges. 0 proven. 378 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-04-28 03:54:14,945 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 03:54:14,945 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2046037381] [2022-04-28 03:54:14,946 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2046037381] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 03:54:14,946 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [924104379] [2022-04-28 03:54:14,946 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:54:14,946 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 03:54:14,946 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 03:54:14,947 INFO L229 MonitoredProcess]: Starting monitored process 28 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 03:54:14,948 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (28)] Waiting until timeout for monitored process [2022-04-28 03:54:14,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:54:14,990 INFO L263 TraceCheckSpWp]: Trace formula consists of 194 conjuncts, 30 conjunts are in the unsatisfiable core [2022-04-28 03:54:15,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:54:15,007 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 03:54:15,420 INFO L272 TraceCheckUtils]: 0: Hoare triple {27257#true} call ULTIMATE.init(); {27257#true} is VALID [2022-04-28 03:54:15,420 INFO L290 TraceCheckUtils]: 1: Hoare triple {27257#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); {27257#true} is VALID [2022-04-28 03:54:15,420 INFO L290 TraceCheckUtils]: 2: Hoare triple {27257#true} assume true; {27257#true} is VALID [2022-04-28 03:54:15,420 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {27257#true} {27257#true} #52#return; {27257#true} is VALID [2022-04-28 03:54:15,420 INFO L272 TraceCheckUtils]: 4: Hoare triple {27257#true} call #t~ret7 := main(); {27257#true} is VALID [2022-04-28 03:54:15,421 INFO L290 TraceCheckUtils]: 5: Hoare triple {27257#true} ~x~0 := 0;~y~0 := 50000;~z~0 := 0;~x~0 := 0; {27262#(<= 50000 main_~y~0)} is VALID [2022-04-28 03:54:15,421 INFO L290 TraceCheckUtils]: 6: Hoare triple {27262#(<= 50000 main_~y~0)} [164] L11-2-->L18-1_primed: Formula: (let ((.cse0 (= v_main_~x~0_1475 v_main_~x~0_1474))) (or (and .cse0 (= |v_main_#t~post4_171| |v_main_#t~post4_170|)) (and (< v_main_~x~0_1475 v_main_~x~0_1474) (< v_main_~x~0_1474 50001)) (and (<= 50000 v_main_~x~0_1475) (= |v_main_#t~post4_170| |v_main_#t~post4_171|) .cse0))) InVars {main_~x~0=v_main_~x~0_1475, main_#t~post4=|v_main_#t~post4_171|} OutVars{main_~x~0=v_main_~x~0_1474, main_#t~post4=|v_main_#t~post4_170|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {27262#(<= 50000 main_~y~0)} is VALID [2022-04-28 03:54:15,421 INFO L290 TraceCheckUtils]: 7: Hoare triple {27262#(<= 50000 main_~y~0)} [165] L18-1_primed-->L11-2: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {27262#(<= 50000 main_~y~0)} is VALID [2022-04-28 03:54:15,422 INFO L290 TraceCheckUtils]: 8: Hoare triple {27262#(<= 50000 main_~y~0)} [166] L11-2-->L18-1_primed: Formula: (let ((.cse0 (= v_main_~y~0_1599 v_main_~y~0_1598)) (.cse1 (= |v_main_#t~post5_186| |v_main_#t~post5_185|)) (.cse2 (= v_main_~x~0_1477 v_main_~x~0_1476)) (.cse3 (= |v_main_#t~post6_186| |v_main_#t~post6_185|)) (.cse4 (<= 50000 v_main_~x~0_1477))) (or (and .cse0 .cse1 .cse2 .cse3) (and (or (not .cse4) (not (< v_main_~x~0_1477 1000000))) .cse0 .cse1 .cse2 .cse3) (and (< v_main_~x~0_1476 1000001) (< v_main_~x~0_1477 v_main_~x~0_1476) (= (+ v_main_~x~0_1476 v_main_~y~0_1599) (+ v_main_~x~0_1477 v_main_~y~0_1598)) .cse4))) InVars {main_~y~0=v_main_~y~0_1599, main_#t~post5=|v_main_#t~post5_186|, main_~x~0=v_main_~x~0_1477, main_#t~post6=|v_main_#t~post6_186|} OutVars{main_~y~0=v_main_~y~0_1598, main_#t~post5=|v_main_#t~post5_185|, main_~x~0=v_main_~x~0_1476, main_#t~post6=|v_main_#t~post6_185|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {27262#(<= 50000 main_~y~0)} is VALID [2022-04-28 03:54:15,422 INFO L290 TraceCheckUtils]: 9: Hoare triple {27262#(<= 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[] {27262#(<= 50000 main_~y~0)} is VALID [2022-04-28 03:54:15,423 INFO L290 TraceCheckUtils]: 10: Hoare triple {27262#(<= 50000 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {27263#(<= 49998 main_~y~0)} is VALID [2022-04-28 03:54:15,423 INFO L290 TraceCheckUtils]: 11: Hoare triple {27263#(<= 49998 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {27264#(<= 49996 main_~y~0)} is VALID [2022-04-28 03:54:15,423 INFO L290 TraceCheckUtils]: 12: Hoare triple {27264#(<= 49996 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {27265#(<= 49994 main_~y~0)} is VALID [2022-04-28 03:54:15,424 INFO L290 TraceCheckUtils]: 13: Hoare triple {27265#(<= 49994 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {27266#(<= 49992 main_~y~0)} is VALID [2022-04-28 03:54:15,424 INFO L290 TraceCheckUtils]: 14: Hoare triple {27266#(<= 49992 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {27267#(<= 49990 main_~y~0)} is VALID [2022-04-28 03:54:15,425 INFO L290 TraceCheckUtils]: 15: Hoare triple {27267#(<= 49990 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {27268#(<= 49988 main_~y~0)} is VALID [2022-04-28 03:54:15,425 INFO L290 TraceCheckUtils]: 16: Hoare triple {27268#(<= 49988 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {27269#(<= 49986 main_~y~0)} is VALID [2022-04-28 03:54:15,425 INFO L290 TraceCheckUtils]: 17: Hoare triple {27269#(<= 49986 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {27270#(<= 49984 main_~y~0)} is VALID [2022-04-28 03:54:15,426 INFO L290 TraceCheckUtils]: 18: Hoare triple {27270#(<= 49984 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {27271#(<= 49982 main_~y~0)} is VALID [2022-04-28 03:54:15,426 INFO L290 TraceCheckUtils]: 19: Hoare triple {27271#(<= 49982 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {27272#(<= 49980 main_~y~0)} is VALID [2022-04-28 03:54:15,427 INFO L290 TraceCheckUtils]: 20: Hoare triple {27272#(<= 49980 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {27273#(<= 49978 main_~y~0)} is VALID [2022-04-28 03:54:15,427 INFO L290 TraceCheckUtils]: 21: Hoare triple {27273#(<= 49978 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {27274#(<= 49976 main_~y~0)} is VALID [2022-04-28 03:54:15,428 INFO L290 TraceCheckUtils]: 22: Hoare triple {27274#(<= 49976 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {27275#(<= 49974 main_~y~0)} is VALID [2022-04-28 03:54:15,428 INFO L290 TraceCheckUtils]: 23: Hoare triple {27275#(<= 49974 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {27276#(<= 49972 main_~y~0)} is VALID [2022-04-28 03:54:15,428 INFO L290 TraceCheckUtils]: 24: Hoare triple {27276#(<= 49972 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {27277#(<= 49970 main_~y~0)} is VALID [2022-04-28 03:54:15,429 INFO L290 TraceCheckUtils]: 25: Hoare triple {27277#(<= 49970 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {27278#(<= 49968 main_~y~0)} is VALID [2022-04-28 03:54:15,429 INFO L290 TraceCheckUtils]: 26: Hoare triple {27278#(<= 49968 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {27279#(<= 49966 main_~y~0)} is VALID [2022-04-28 03:54:15,430 INFO L290 TraceCheckUtils]: 27: Hoare triple {27279#(<= 49966 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {27280#(<= 49964 main_~y~0)} is VALID [2022-04-28 03:54:15,430 INFO L290 TraceCheckUtils]: 28: Hoare triple {27280#(<= 49964 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {27281#(<= 49962 main_~y~0)} is VALID [2022-04-28 03:54:15,430 INFO L290 TraceCheckUtils]: 29: Hoare triple {27281#(<= 49962 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {27282#(<= 49960 main_~y~0)} is VALID [2022-04-28 03:54:15,431 INFO L290 TraceCheckUtils]: 30: Hoare triple {27282#(<= 49960 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {27283#(<= 49958 main_~y~0)} is VALID [2022-04-28 03:54:15,431 INFO L290 TraceCheckUtils]: 31: Hoare triple {27283#(<= 49958 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {27284#(<= 49956 main_~y~0)} is VALID [2022-04-28 03:54:15,432 INFO L290 TraceCheckUtils]: 32: Hoare triple {27284#(<= 49956 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {27285#(<= 49954 main_~y~0)} is VALID [2022-04-28 03:54:15,432 INFO L290 TraceCheckUtils]: 33: Hoare triple {27285#(<= 49954 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {27286#(<= 49952 main_~y~0)} is VALID [2022-04-28 03:54:15,432 INFO L290 TraceCheckUtils]: 34: Hoare triple {27286#(<= 49952 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {27287#(<= 49950 main_~y~0)} is VALID [2022-04-28 03:54:15,433 INFO L290 TraceCheckUtils]: 35: Hoare triple {27287#(<= 49950 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {27288#(<= 49948 main_~y~0)} is VALID [2022-04-28 03:54:15,433 INFO L290 TraceCheckUtils]: 36: Hoare triple {27288#(<= 49948 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {27289#(<= 49946 main_~y~0)} is VALID [2022-04-28 03:54:15,434 INFO L290 TraceCheckUtils]: 37: Hoare triple {27289#(<= 49946 main_~y~0)} assume !(~y~0 > 0); {27258#false} is VALID [2022-04-28 03:54:15,434 INFO L272 TraceCheckUtils]: 38: Hoare triple {27258#false} call __VERIFIER_assert((if ~z~0 == ~x~0 then 1 else 0)); {27258#false} is VALID [2022-04-28 03:54:15,434 INFO L290 TraceCheckUtils]: 39: Hoare triple {27258#false} ~cond := #in~cond; {27258#false} is VALID [2022-04-28 03:54:15,434 INFO L290 TraceCheckUtils]: 40: Hoare triple {27258#false} assume 0 == ~cond; {27258#false} is VALID [2022-04-28 03:54:15,434 INFO L290 TraceCheckUtils]: 41: Hoare triple {27258#false} assume !false; {27258#false} is VALID [2022-04-28 03:54:15,434 INFO L134 CoverageAnalysis]: Checked inductivity of 380 backedges. 0 proven. 378 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-04-28 03:54:15,434 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 03:54:16,597 INFO L290 TraceCheckUtils]: 41: Hoare triple {27258#false} assume !false; {27258#false} is VALID [2022-04-28 03:54:16,597 INFO L290 TraceCheckUtils]: 40: Hoare triple {27258#false} assume 0 == ~cond; {27258#false} is VALID [2022-04-28 03:54:16,597 INFO L290 TraceCheckUtils]: 39: Hoare triple {27258#false} ~cond := #in~cond; {27258#false} is VALID [2022-04-28 03:54:16,597 INFO L272 TraceCheckUtils]: 38: Hoare triple {27258#false} call __VERIFIER_assert((if ~z~0 == ~x~0 then 1 else 0)); {27258#false} is VALID [2022-04-28 03:54:16,598 INFO L290 TraceCheckUtils]: 37: Hoare triple {27429#(< 0 main_~y~0)} assume !(~y~0 > 0); {27258#false} is VALID [2022-04-28 03:54:16,598 INFO L290 TraceCheckUtils]: 36: Hoare triple {27433#(< 2 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {27429#(< 0 main_~y~0)} is VALID [2022-04-28 03:54:16,599 INFO L290 TraceCheckUtils]: 35: Hoare triple {27437#(< 4 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {27433#(< 2 main_~y~0)} is VALID [2022-04-28 03:54:16,599 INFO L290 TraceCheckUtils]: 34: Hoare triple {27441#(< 6 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {27437#(< 4 main_~y~0)} is VALID [2022-04-28 03:54:16,600 INFO L290 TraceCheckUtils]: 33: Hoare triple {27445#(< 8 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {27441#(< 6 main_~y~0)} is VALID [2022-04-28 03:54:16,600 INFO L290 TraceCheckUtils]: 32: Hoare triple {27449#(< 10 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {27445#(< 8 main_~y~0)} is VALID [2022-04-28 03:54:16,600 INFO L290 TraceCheckUtils]: 31: Hoare triple {27453#(< 12 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {27449#(< 10 main_~y~0)} is VALID [2022-04-28 03:54:16,601 INFO L290 TraceCheckUtils]: 30: Hoare triple {27457#(< 14 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {27453#(< 12 main_~y~0)} is VALID [2022-04-28 03:54:16,601 INFO L290 TraceCheckUtils]: 29: Hoare triple {27461#(< 16 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {27457#(< 14 main_~y~0)} is VALID [2022-04-28 03:54:16,602 INFO L290 TraceCheckUtils]: 28: Hoare triple {27465#(< 18 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {27461#(< 16 main_~y~0)} is VALID [2022-04-28 03:54:16,602 INFO L290 TraceCheckUtils]: 27: Hoare triple {27469#(< 20 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {27465#(< 18 main_~y~0)} is VALID [2022-04-28 03:54:16,602 INFO L290 TraceCheckUtils]: 26: Hoare triple {27473#(< 22 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {27469#(< 20 main_~y~0)} is VALID [2022-04-28 03:54:16,603 INFO L290 TraceCheckUtils]: 25: Hoare triple {27477#(< 24 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {27473#(< 22 main_~y~0)} is VALID [2022-04-28 03:54:16,603 INFO L290 TraceCheckUtils]: 24: Hoare triple {27481#(< 26 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {27477#(< 24 main_~y~0)} is VALID [2022-04-28 03:54:16,604 INFO L290 TraceCheckUtils]: 23: Hoare triple {27485#(< 28 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {27481#(< 26 main_~y~0)} is VALID [2022-04-28 03:54:16,604 INFO L290 TraceCheckUtils]: 22: Hoare triple {27489#(< 30 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {27485#(< 28 main_~y~0)} is VALID [2022-04-28 03:54:16,605 INFO L290 TraceCheckUtils]: 21: Hoare triple {27493#(< 32 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {27489#(< 30 main_~y~0)} is VALID [2022-04-28 03:54:16,605 INFO L290 TraceCheckUtils]: 20: Hoare triple {27497#(< 34 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {27493#(< 32 main_~y~0)} is VALID [2022-04-28 03:54:16,605 INFO L290 TraceCheckUtils]: 19: Hoare triple {27501#(< 36 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {27497#(< 34 main_~y~0)} is VALID [2022-04-28 03:54:16,606 INFO L290 TraceCheckUtils]: 18: Hoare triple {27505#(< 38 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {27501#(< 36 main_~y~0)} is VALID [2022-04-28 03:54:16,606 INFO L290 TraceCheckUtils]: 17: Hoare triple {27509#(< 40 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {27505#(< 38 main_~y~0)} is VALID [2022-04-28 03:54:16,607 INFO L290 TraceCheckUtils]: 16: Hoare triple {27513#(< 42 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {27509#(< 40 main_~y~0)} is VALID [2022-04-28 03:54:16,607 INFO L290 TraceCheckUtils]: 15: Hoare triple {27517#(< 44 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {27513#(< 42 main_~y~0)} is VALID [2022-04-28 03:54:16,607 INFO L290 TraceCheckUtils]: 14: Hoare triple {27521#(< 46 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {27517#(< 44 main_~y~0)} is VALID [2022-04-28 03:54:16,608 INFO L290 TraceCheckUtils]: 13: Hoare triple {27525#(< 48 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {27521#(< 46 main_~y~0)} is VALID [2022-04-28 03:54:16,608 INFO L290 TraceCheckUtils]: 12: Hoare triple {27529#(< 50 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {27525#(< 48 main_~y~0)} is VALID [2022-04-28 03:54:16,609 INFO L290 TraceCheckUtils]: 11: Hoare triple {27533#(< 52 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {27529#(< 50 main_~y~0)} is VALID [2022-04-28 03:54:16,609 INFO L290 TraceCheckUtils]: 10: Hoare triple {27537#(< 54 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {27533#(< 52 main_~y~0)} is VALID [2022-04-28 03:54:16,609 INFO L290 TraceCheckUtils]: 9: Hoare triple {27537#(< 54 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[] {27537#(< 54 main_~y~0)} is VALID [2022-04-28 03:54:16,610 INFO L290 TraceCheckUtils]: 8: Hoare triple {27537#(< 54 main_~y~0)} [166] L11-2-->L18-1_primed: Formula: (let ((.cse0 (= v_main_~y~0_1599 v_main_~y~0_1598)) (.cse1 (= |v_main_#t~post5_186| |v_main_#t~post5_185|)) (.cse2 (= v_main_~x~0_1477 v_main_~x~0_1476)) (.cse3 (= |v_main_#t~post6_186| |v_main_#t~post6_185|)) (.cse4 (<= 50000 v_main_~x~0_1477))) (or (and .cse0 .cse1 .cse2 .cse3) (and (or (not .cse4) (not (< v_main_~x~0_1477 1000000))) .cse0 .cse1 .cse2 .cse3) (and (< v_main_~x~0_1476 1000001) (< v_main_~x~0_1477 v_main_~x~0_1476) (= (+ v_main_~x~0_1476 v_main_~y~0_1599) (+ v_main_~x~0_1477 v_main_~y~0_1598)) .cse4))) InVars {main_~y~0=v_main_~y~0_1599, main_#t~post5=|v_main_#t~post5_186|, main_~x~0=v_main_~x~0_1477, main_#t~post6=|v_main_#t~post6_186|} OutVars{main_~y~0=v_main_~y~0_1598, main_#t~post5=|v_main_#t~post5_185|, main_~x~0=v_main_~x~0_1476, main_#t~post6=|v_main_#t~post6_185|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {27537#(< 54 main_~y~0)} is VALID [2022-04-28 03:54:16,610 INFO L290 TraceCheckUtils]: 7: Hoare triple {27537#(< 54 main_~y~0)} [165] L18-1_primed-->L11-2: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {27537#(< 54 main_~y~0)} is VALID [2022-04-28 03:54:16,611 INFO L290 TraceCheckUtils]: 6: Hoare triple {27537#(< 54 main_~y~0)} [164] L11-2-->L18-1_primed: Formula: (let ((.cse0 (= v_main_~x~0_1475 v_main_~x~0_1474))) (or (and .cse0 (= |v_main_#t~post4_171| |v_main_#t~post4_170|)) (and (< v_main_~x~0_1475 v_main_~x~0_1474) (< v_main_~x~0_1474 50001)) (and (<= 50000 v_main_~x~0_1475) (= |v_main_#t~post4_170| |v_main_#t~post4_171|) .cse0))) InVars {main_~x~0=v_main_~x~0_1475, main_#t~post4=|v_main_#t~post4_171|} OutVars{main_~x~0=v_main_~x~0_1474, main_#t~post4=|v_main_#t~post4_170|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {27537#(< 54 main_~y~0)} is VALID [2022-04-28 03:54:16,611 INFO L290 TraceCheckUtils]: 5: Hoare triple {27257#true} ~x~0 := 0;~y~0 := 50000;~z~0 := 0;~x~0 := 0; {27537#(< 54 main_~y~0)} is VALID [2022-04-28 03:54:16,611 INFO L272 TraceCheckUtils]: 4: Hoare triple {27257#true} call #t~ret7 := main(); {27257#true} is VALID [2022-04-28 03:54:16,611 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {27257#true} {27257#true} #52#return; {27257#true} is VALID [2022-04-28 03:54:16,611 INFO L290 TraceCheckUtils]: 2: Hoare triple {27257#true} assume true; {27257#true} is VALID [2022-04-28 03:54:16,611 INFO L290 TraceCheckUtils]: 1: Hoare triple {27257#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); {27257#true} is VALID [2022-04-28 03:54:16,611 INFO L272 TraceCheckUtils]: 0: Hoare triple {27257#true} call ULTIMATE.init(); {27257#true} is VALID [2022-04-28 03:54:16,612 INFO L134 CoverageAnalysis]: Checked inductivity of 380 backedges. 0 proven. 378 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-04-28 03:54:16,612 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [924104379] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 03:54:16,612 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 03:54:16,612 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [31, 30, 30] total 59 [2022-04-28 03:54:18,602 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 03:54:18,602 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [543552514] [2022-04-28 03:54:18,603 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [543552514] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 03:54:18,603 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 03:54:18,603 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [83] imperfect sequences [] total 83 [2022-04-28 03:54:18,603 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [898537629] [2022-04-28 03:54:18,603 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 03:54:18,603 INFO L78 Accepts]: Start accepts. Automaton has has 83 states, 83 states have (on average 1.6506024096385543) internal successors, (137), 82 states have internal predecessors, (137), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 141 [2022-04-28 03:54:18,603 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 03:54:18,603 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 83 states, 83 states have (on average 1.6506024096385543) internal successors, (137), 82 states have internal predecessors, (137), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:54:18,711 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 141 edges. 141 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 03:54:18,711 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 83 states [2022-04-28 03:54:18,711 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 03:54:18,712 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 83 interpolants. [2022-04-28 03:54:18,713 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=4722, Invalid=7488, Unknown=0, NotChecked=0, Total=12210 [2022-04-28 03:54:18,713 INFO L87 Difference]: Start difference. First operand 240 states and 244 transitions. Second operand has 83 states, 83 states have (on average 1.6506024096385543) internal successors, (137), 82 states have internal predecessors, (137), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:54:29,194 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:54:29,194 INFO L93 Difference]: Finished difference Result 379 states and 393 transitions. [2022-04-28 03:54:29,194 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 83 states. [2022-04-28 03:54:29,195 INFO L78 Accepts]: Start accepts. Automaton has has 83 states, 83 states have (on average 1.6506024096385543) internal successors, (137), 82 states have internal predecessors, (137), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 141 [2022-04-28 03:54:29,195 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 03:54:29,195 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 83 states, 83 states have (on average 1.6506024096385543) internal successors, (137), 82 states have internal predecessors, (137), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:54:29,197 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 165 transitions. [2022-04-28 03:54:29,197 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 83 states, 83 states have (on average 1.6506024096385543) internal successors, (137), 82 states have internal predecessors, (137), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:54:29,200 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 165 transitions. [2022-04-28 03:54:29,200 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 83 states and 165 transitions. [2022-04-28 03:54:29,327 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 165 edges. 165 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 03:54:29,343 INFO L225 Difference]: With dead ends: 379 [2022-04-28 03:54:29,343 INFO L226 Difference]: Without dead ends: 247 [2022-04-28 03:54:29,345 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 303 GetRequests, 113 SyntacticMatches, 1 SemanticMatches, 189 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10472 ImplicationChecksByTransitivity, 5.0s TimeCoverageRelationStatistics Valid=11052, Invalid=25238, Unknown=0, NotChecked=0, Total=36290 [2022-04-28 03:54:29,346 INFO L413 NwaCegarLoop]: 12 mSDtfsCounter, 220 mSDsluCounter, 52 mSDsCounter, 0 mSdLazyCounter, 5397 mSolverCounterSat, 201 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 220 SdHoareTripleChecker+Valid, 64 SdHoareTripleChecker+Invalid, 5598 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 201 IncrementalHoareTripleChecker+Valid, 5397 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.1s IncrementalHoareTripleChecker+Time [2022-04-28 03:54:29,346 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [220 Valid, 64 Invalid, 5598 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [201 Valid, 5397 Invalid, 0 Unknown, 0 Unchecked, 4.1s Time] [2022-04-28 03:54:29,346 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 247 states. [2022-04-28 03:54:29,549 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 247 to 147. [2022-04-28 03:54:29,549 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 03:54:29,550 INFO L82 GeneralOperation]: Start isEquivalent. First operand 247 states. Second operand has 147 states, 142 states have (on average 1.028169014084507) internal successors, (146), 142 states have internal predecessors, (146), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:54:29,550 INFO L74 IsIncluded]: Start isIncluded. First operand 247 states. Second operand has 147 states, 142 states have (on average 1.028169014084507) internal successors, (146), 142 states have internal predecessors, (146), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:54:29,550 INFO L87 Difference]: Start difference. First operand 247 states. Second operand has 147 states, 142 states have (on average 1.028169014084507) internal successors, (146), 142 states have internal predecessors, (146), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:54:29,552 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:54:29,552 INFO L93 Difference]: Finished difference Result 247 states and 251 transitions. [2022-04-28 03:54:29,552 INFO L276 IsEmpty]: Start isEmpty. Operand 247 states and 251 transitions. [2022-04-28 03:54:29,553 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:54:29,553 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:54:29,553 INFO L74 IsIncluded]: Start isIncluded. First operand has 147 states, 142 states have (on average 1.028169014084507) internal successors, (146), 142 states have internal predecessors, (146), 3 states have call successors, (3), 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 247 states. [2022-04-28 03:54:29,553 INFO L87 Difference]: Start difference. First operand has 147 states, 142 states have (on average 1.028169014084507) internal successors, (146), 142 states have internal predecessors, (146), 3 states have call successors, (3), 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 247 states. [2022-04-28 03:54:29,555 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:54:29,555 INFO L93 Difference]: Finished difference Result 247 states and 251 transitions. [2022-04-28 03:54:29,555 INFO L276 IsEmpty]: Start isEmpty. Operand 247 states and 251 transitions. [2022-04-28 03:54:29,556 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:54:29,556 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:54:29,556 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 03:54:29,556 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 03:54:29,556 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 147 states, 142 states have (on average 1.028169014084507) internal successors, (146), 142 states have internal predecessors, (146), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:54:29,557 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 147 states to 147 states and 150 transitions. [2022-04-28 03:54:29,557 INFO L78 Accepts]: Start accepts. Automaton has 147 states and 150 transitions. Word has length 141 [2022-04-28 03:54:29,557 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 03:54:29,557 INFO L495 AbstractCegarLoop]: Abstraction has 147 states and 150 transitions. [2022-04-28 03:54:29,558 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 83 states, 83 states have (on average 1.6506024096385543) internal successors, (137), 82 states have internal predecessors, (137), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:54:29,558 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 147 states and 150 transitions. [2022-04-28 03:54:29,677 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 150 edges. 150 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 03:54:29,677 INFO L276 IsEmpty]: Start isEmpty. Operand 147 states and 150 transitions. [2022-04-28 03:54:29,677 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2022-04-28 03:54:29,677 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 03:54:29,677 INFO L195 NwaCegarLoop]: trace histogram [53, 52, 28, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 03:54:29,697 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (28)] Forceful destruction successful, exit code 0 [2022-04-28 03:54:29,877 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29,28 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 03:54:29,878 INFO L420 AbstractCegarLoop]: === Iteration 31 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 03:54:29,878 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 03:54:29,878 INFO L85 PathProgramCache]: Analyzing trace with hash -184563330, now seen corresponding path program 28 times [2022-04-28 03:54:29,878 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 03:54:29,878 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [947040379] [2022-04-28 03:54:33,948 WARN L977 rdanLoopAcceleration]: Unable to prove correctness of quantifier elimination. [2022-04-28 03:54:34,002 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 1 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 03:54:38,117 WARN L977 rdanLoopAcceleration]: Unable to prove correctness of quantifier elimination. [2022-04-28 03:54:38,211 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={1=1, 2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 03:54:38,212 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-28 03:54:38,214 INFO L85 PathProgramCache]: Analyzing trace with hash 1645199297, now seen corresponding path program 1 times [2022-04-28 03:54:38,214 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 03:54:38,214 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1260652524] [2022-04-28 03:54:38,215 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:54:38,215 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 03:54:38,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:54:38,739 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 03:54:38,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:54:38,742 INFO L290 TraceCheckUtils]: 0: Hoare triple {29365#(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); {29328#true} is VALID [2022-04-28 03:54:38,742 INFO L290 TraceCheckUtils]: 1: Hoare triple {29328#true} assume true; {29328#true} is VALID [2022-04-28 03:54:38,742 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {29328#true} {29328#true} #52#return; {29328#true} is VALID [2022-04-28 03:54:38,743 INFO L272 TraceCheckUtils]: 0: Hoare triple {29328#true} call ULTIMATE.init(); {29365#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 03:54:38,743 INFO L290 TraceCheckUtils]: 1: Hoare triple {29365#(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); {29328#true} is VALID [2022-04-28 03:54:38,743 INFO L290 TraceCheckUtils]: 2: Hoare triple {29328#true} assume true; {29328#true} is VALID [2022-04-28 03:54:38,743 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {29328#true} {29328#true} #52#return; {29328#true} is VALID [2022-04-28 03:54:38,743 INFO L272 TraceCheckUtils]: 4: Hoare triple {29328#true} call #t~ret7 := main(); {29328#true} is VALID [2022-04-28 03:54:38,743 INFO L290 TraceCheckUtils]: 5: Hoare triple {29328#true} ~x~0 := 0;~y~0 := 50000;~z~0 := 0;~x~0 := 0; {29333#(and (= main_~x~0 0) (<= 50000 main_~y~0))} is VALID [2022-04-28 03:54:38,744 INFO L290 TraceCheckUtils]: 6: Hoare triple {29333#(and (= main_~x~0 0) (<= 50000 main_~y~0))} [168] L11-2-->L18-1_primed: Formula: (let ((.cse0 (= v_main_~x~0_1569 v_main_~x~0_1568)) (.cse1 (= |v_main_#t~post4_177| |v_main_#t~post4_176|))) (or (and (< v_main_~x~0_1568 50001) (< v_main_~x~0_1569 v_main_~x~0_1568)) (and .cse0 .cse1) (and .cse0 .cse1 (not (< v_main_~x~0_1569 50000))))) InVars {main_~x~0=v_main_~x~0_1569, main_#t~post4=|v_main_#t~post4_177|} OutVars{main_~x~0=v_main_~x~0_1568, main_#t~post4=|v_main_#t~post4_176|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {29334#(and (<= main_~x~0 main_~y~0) (<= 50000 main_~y~0))} is VALID [2022-04-28 03:54:38,744 INFO L290 TraceCheckUtils]: 7: Hoare triple {29334#(and (<= main_~x~0 main_~y~0) (<= 50000 main_~y~0))} [169] L18-1_primed-->L11-2: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {29334#(and (<= main_~x~0 main_~y~0) (<= 50000 main_~y~0))} is VALID [2022-04-28 03:54:38,745 INFO L290 TraceCheckUtils]: 8: Hoare triple {29334#(and (<= main_~x~0 main_~y~0) (<= 50000 main_~y~0))} [170] L11-2-->L18-1_primed: Formula: (let ((.cse0 (= |v_main_#t~post5_193| |v_main_#t~post5_192|)) (.cse1 (= v_main_~y~0_1712 v_main_~y~0_1711)) (.cse2 (= |v_main_#t~post6_193| |v_main_#t~post6_192|)) (.cse3 (= v_main_~x~0_1571 v_main_~x~0_1570)) (.cse4 (<= 50000 v_main_~x~0_1571))) (or (and .cse0 .cse1 .cse2 .cse3) (and .cse0 (or (not (< v_main_~x~0_1571 1000000)) (not .cse4)) .cse1 .cse2 .cse3) (and (= (+ v_main_~x~0_1570 v_main_~y~0_1712) (+ v_main_~x~0_1571 v_main_~y~0_1711)) (< v_main_~x~0_1570 1000001) (< v_main_~x~0_1571 v_main_~x~0_1570) .cse4))) InVars {main_~y~0=v_main_~y~0_1712, main_#t~post5=|v_main_#t~post5_193|, main_~x~0=v_main_~x~0_1571, main_#t~post6=|v_main_#t~post6_193|} OutVars{main_~y~0=v_main_~y~0_1711, main_#t~post5=|v_main_#t~post5_192|, main_~x~0=v_main_~x~0_1570, main_#t~post6=|v_main_#t~post6_192|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {29335#(or (<= main_~x~0 main_~y~0) (<= 50000 main_~y~0))} is VALID [2022-04-28 03:54:38,746 INFO L290 TraceCheckUtils]: 9: Hoare triple {29335#(or (<= main_~x~0 main_~y~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[] {29336#(<= 50000 main_~y~0)} is VALID [2022-04-28 03:54:38,746 INFO L290 TraceCheckUtils]: 10: Hoare triple {29336#(<= 50000 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {29337#(<= 49998 main_~y~0)} is VALID [2022-04-28 03:54:38,747 INFO L290 TraceCheckUtils]: 11: Hoare triple {29337#(<= 49998 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {29338#(<= 49996 main_~y~0)} is VALID [2022-04-28 03:54:38,747 INFO L290 TraceCheckUtils]: 12: Hoare triple {29338#(<= 49996 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {29339#(<= 49994 main_~y~0)} is VALID [2022-04-28 03:54:38,748 INFO L290 TraceCheckUtils]: 13: Hoare triple {29339#(<= 49994 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {29340#(<= 49992 main_~y~0)} is VALID [2022-04-28 03:54:38,748 INFO L290 TraceCheckUtils]: 14: Hoare triple {29340#(<= 49992 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {29341#(<= 49990 main_~y~0)} is VALID [2022-04-28 03:54:38,749 INFO L290 TraceCheckUtils]: 15: Hoare triple {29341#(<= 49990 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {29342#(<= 49988 main_~y~0)} is VALID [2022-04-28 03:54:38,749 INFO L290 TraceCheckUtils]: 16: Hoare triple {29342#(<= 49988 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {29343#(<= 49986 main_~y~0)} is VALID [2022-04-28 03:54:38,750 INFO L290 TraceCheckUtils]: 17: Hoare triple {29343#(<= 49986 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {29344#(<= 49984 main_~y~0)} is VALID [2022-04-28 03:54:38,750 INFO L290 TraceCheckUtils]: 18: Hoare triple {29344#(<= 49984 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {29345#(<= 49982 main_~y~0)} is VALID [2022-04-28 03:54:38,751 INFO L290 TraceCheckUtils]: 19: Hoare triple {29345#(<= 49982 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {29346#(<= 49980 main_~y~0)} is VALID [2022-04-28 03:54:38,751 INFO L290 TraceCheckUtils]: 20: Hoare triple {29346#(<= 49980 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {29347#(<= 49978 main_~y~0)} is VALID [2022-04-28 03:54:38,752 INFO L290 TraceCheckUtils]: 21: Hoare triple {29347#(<= 49978 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {29348#(<= 49976 main_~y~0)} is VALID [2022-04-28 03:54:38,752 INFO L290 TraceCheckUtils]: 22: Hoare triple {29348#(<= 49976 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {29349#(<= 49974 main_~y~0)} is VALID [2022-04-28 03:54:38,752 INFO L290 TraceCheckUtils]: 23: Hoare triple {29349#(<= 49974 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {29350#(<= 49972 main_~y~0)} is VALID [2022-04-28 03:54:38,753 INFO L290 TraceCheckUtils]: 24: Hoare triple {29350#(<= 49972 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {29351#(<= 49970 main_~y~0)} is VALID [2022-04-28 03:54:38,753 INFO L290 TraceCheckUtils]: 25: Hoare triple {29351#(<= 49970 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {29352#(<= 49968 main_~y~0)} is VALID [2022-04-28 03:54:38,754 INFO L290 TraceCheckUtils]: 26: Hoare triple {29352#(<= 49968 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {29353#(<= 49966 main_~y~0)} is VALID [2022-04-28 03:54:38,754 INFO L290 TraceCheckUtils]: 27: Hoare triple {29353#(<= 49966 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {29354#(<= 49964 main_~y~0)} is VALID [2022-04-28 03:54:38,755 INFO L290 TraceCheckUtils]: 28: Hoare triple {29354#(<= 49964 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {29355#(<= 49962 main_~y~0)} is VALID [2022-04-28 03:54:38,755 INFO L290 TraceCheckUtils]: 29: Hoare triple {29355#(<= 49962 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {29356#(<= 49960 main_~y~0)} is VALID [2022-04-28 03:54:38,756 INFO L290 TraceCheckUtils]: 30: Hoare triple {29356#(<= 49960 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {29357#(<= 49958 main_~y~0)} is VALID [2022-04-28 03:54:38,756 INFO L290 TraceCheckUtils]: 31: Hoare triple {29357#(<= 49958 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {29358#(<= 49956 main_~y~0)} is VALID [2022-04-28 03:54:38,757 INFO L290 TraceCheckUtils]: 32: Hoare triple {29358#(<= 49956 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {29359#(<= 49954 main_~y~0)} is VALID [2022-04-28 03:54:38,757 INFO L290 TraceCheckUtils]: 33: Hoare triple {29359#(<= 49954 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {29360#(<= 49952 main_~y~0)} is VALID [2022-04-28 03:54:38,758 INFO L290 TraceCheckUtils]: 34: Hoare triple {29360#(<= 49952 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {29361#(<= 49950 main_~y~0)} is VALID [2022-04-28 03:54:38,758 INFO L290 TraceCheckUtils]: 35: Hoare triple {29361#(<= 49950 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {29362#(<= 49948 main_~y~0)} is VALID [2022-04-28 03:54:38,759 INFO L290 TraceCheckUtils]: 36: Hoare triple {29362#(<= 49948 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {29363#(<= 49946 main_~y~0)} is VALID [2022-04-28 03:54:38,759 INFO L290 TraceCheckUtils]: 37: Hoare triple {29363#(<= 49946 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {29364#(<= 49944 main_~y~0)} is VALID [2022-04-28 03:54:38,760 INFO L290 TraceCheckUtils]: 38: Hoare triple {29364#(<= 49944 main_~y~0)} assume !(~y~0 > 0); {29329#false} is VALID [2022-04-28 03:54:38,760 INFO L272 TraceCheckUtils]: 39: Hoare triple {29329#false} call __VERIFIER_assert((if ~z~0 == ~x~0 then 1 else 0)); {29329#false} is VALID [2022-04-28 03:54:38,760 INFO L290 TraceCheckUtils]: 40: Hoare triple {29329#false} ~cond := #in~cond; {29329#false} is VALID [2022-04-28 03:54:38,760 INFO L290 TraceCheckUtils]: 41: Hoare triple {29329#false} assume 0 == ~cond; {29329#false} is VALID [2022-04-28 03:54:38,760 INFO L290 TraceCheckUtils]: 42: Hoare triple {29329#false} assume !false; {29329#false} is VALID [2022-04-28 03:54:38,760 INFO L134 CoverageAnalysis]: Checked inductivity of 408 backedges. 0 proven. 408 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 03:54:38,760 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 03:54:38,760 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1260652524] [2022-04-28 03:54:38,761 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1260652524] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 03:54:38,790 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [51993278] [2022-04-28 03:54:38,790 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:54:38,791 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 03:54:38,791 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 03:54:38,792 INFO L229 MonitoredProcess]: Starting monitored process 29 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 03:54:38,793 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (29)] Waiting until timeout for monitored process [2022-04-28 03:54:38,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:54:38,844 INFO L263 TraceCheckSpWp]: Trace formula consists of 199 conjuncts, 34 conjunts are in the unsatisfiable core [2022-04-28 03:54:38,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:54:38,867 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 03:54:39,785 INFO L272 TraceCheckUtils]: 0: Hoare triple {29328#true} call ULTIMATE.init(); {29328#true} is VALID [2022-04-28 03:54:39,785 INFO L290 TraceCheckUtils]: 1: Hoare triple {29328#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); {29328#true} is VALID [2022-04-28 03:54:39,786 INFO L290 TraceCheckUtils]: 2: Hoare triple {29328#true} assume true; {29328#true} is VALID [2022-04-28 03:54:39,786 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {29328#true} {29328#true} #52#return; {29328#true} is VALID [2022-04-28 03:54:39,786 INFO L272 TraceCheckUtils]: 4: Hoare triple {29328#true} call #t~ret7 := main(); {29328#true} is VALID [2022-04-28 03:54:39,786 INFO L290 TraceCheckUtils]: 5: Hoare triple {29328#true} ~x~0 := 0;~y~0 := 50000;~z~0 := 0;~x~0 := 0; {29384#(and (<= main_~x~0 0) (<= 50000 main_~y~0))} is VALID [2022-04-28 03:54:39,787 INFO L290 TraceCheckUtils]: 6: Hoare triple {29384#(and (<= main_~x~0 0) (<= 50000 main_~y~0))} [168] L11-2-->L18-1_primed: Formula: (let ((.cse0 (= v_main_~x~0_1569 v_main_~x~0_1568)) (.cse1 (= |v_main_#t~post4_177| |v_main_#t~post4_176|))) (or (and (< v_main_~x~0_1568 50001) (< v_main_~x~0_1569 v_main_~x~0_1568)) (and .cse0 .cse1) (and .cse0 .cse1 (not (< v_main_~x~0_1569 50000))))) InVars {main_~x~0=v_main_~x~0_1569, main_#t~post4=|v_main_#t~post4_177|} OutVars{main_~x~0=v_main_~x~0_1568, main_#t~post4=|v_main_#t~post4_176|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {29388#(and (< main_~x~0 50001) (<= 50000 main_~y~0))} is VALID [2022-04-28 03:54:39,787 INFO L290 TraceCheckUtils]: 7: Hoare triple {29388#(and (< main_~x~0 50001) (<= 50000 main_~y~0))} [169] L18-1_primed-->L11-2: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {29388#(and (< main_~x~0 50001) (<= 50000 main_~y~0))} is VALID [2022-04-28 03:54:39,788 INFO L290 TraceCheckUtils]: 8: Hoare triple {29388#(and (< main_~x~0 50001) (<= 50000 main_~y~0))} [170] L11-2-->L18-1_primed: Formula: (let ((.cse0 (= |v_main_#t~post5_193| |v_main_#t~post5_192|)) (.cse1 (= v_main_~y~0_1712 v_main_~y~0_1711)) (.cse2 (= |v_main_#t~post6_193| |v_main_#t~post6_192|)) (.cse3 (= v_main_~x~0_1571 v_main_~x~0_1570)) (.cse4 (<= 50000 v_main_~x~0_1571))) (or (and .cse0 .cse1 .cse2 .cse3) (and .cse0 (or (not (< v_main_~x~0_1571 1000000)) (not .cse4)) .cse1 .cse2 .cse3) (and (= (+ v_main_~x~0_1570 v_main_~y~0_1712) (+ v_main_~x~0_1571 v_main_~y~0_1711)) (< v_main_~x~0_1570 1000001) (< v_main_~x~0_1571 v_main_~x~0_1570) .cse4))) InVars {main_~y~0=v_main_~y~0_1712, main_#t~post5=|v_main_#t~post5_193|, main_~x~0=v_main_~x~0_1571, main_#t~post6=|v_main_#t~post6_193|} OutVars{main_~y~0=v_main_~y~0_1711, main_#t~post5=|v_main_#t~post5_192|, main_~x~0=v_main_~x~0_1570, main_#t~post6=|v_main_#t~post6_192|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {29395#(or (and (< main_~x~0 50001) (<= 50000 main_~y~0)) (and (< main_~x~0 (+ main_~y~0 1)) (< main_~x~0 1000001) (< 50000 main_~x~0)))} is VALID [2022-04-28 03:54:39,788 INFO L290 TraceCheckUtils]: 9: Hoare triple {29395#(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)))} [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[] {29399#(< 999999 main_~y~0)} is VALID [2022-04-28 03:54:39,789 INFO L290 TraceCheckUtils]: 10: Hoare triple {29399#(< 999999 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {29403#(< 999997 main_~y~0)} is VALID [2022-04-28 03:54:39,789 INFO L290 TraceCheckUtils]: 11: Hoare triple {29403#(< 999997 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {29407#(< 999995 main_~y~0)} is VALID [2022-04-28 03:54:39,790 INFO L290 TraceCheckUtils]: 12: Hoare triple {29407#(< 999995 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {29411#(< 999993 main_~y~0)} is VALID [2022-04-28 03:54:39,790 INFO L290 TraceCheckUtils]: 13: Hoare triple {29411#(< 999993 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {29415#(< 999991 main_~y~0)} is VALID [2022-04-28 03:54:39,791 INFO L290 TraceCheckUtils]: 14: Hoare triple {29415#(< 999991 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {29419#(< 999989 main_~y~0)} is VALID [2022-04-28 03:54:39,791 INFO L290 TraceCheckUtils]: 15: Hoare triple {29419#(< 999989 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {29423#(< 999987 main_~y~0)} is VALID [2022-04-28 03:54:39,792 INFO L290 TraceCheckUtils]: 16: Hoare triple {29423#(< 999987 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {29427#(< 999985 main_~y~0)} is VALID [2022-04-28 03:54:39,792 INFO L290 TraceCheckUtils]: 17: Hoare triple {29427#(< 999985 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {29431#(< 999983 main_~y~0)} is VALID [2022-04-28 03:54:39,793 INFO L290 TraceCheckUtils]: 18: Hoare triple {29431#(< 999983 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {29435#(< 999981 main_~y~0)} is VALID [2022-04-28 03:54:39,793 INFO L290 TraceCheckUtils]: 19: Hoare triple {29435#(< 999981 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {29439#(< 999979 main_~y~0)} is VALID [2022-04-28 03:54:39,794 INFO L290 TraceCheckUtils]: 20: Hoare triple {29439#(< 999979 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {29443#(< 999977 main_~y~0)} is VALID [2022-04-28 03:54:39,794 INFO L290 TraceCheckUtils]: 21: Hoare triple {29443#(< 999977 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {29447#(< 999975 main_~y~0)} is VALID [2022-04-28 03:54:39,795 INFO L290 TraceCheckUtils]: 22: Hoare triple {29447#(< 999975 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {29451#(< 999973 main_~y~0)} is VALID [2022-04-28 03:54:39,795 INFO L290 TraceCheckUtils]: 23: Hoare triple {29451#(< 999973 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {29455#(< 999971 main_~y~0)} is VALID [2022-04-28 03:54:39,796 INFO L290 TraceCheckUtils]: 24: Hoare triple {29455#(< 999971 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {29459#(< 999969 main_~y~0)} is VALID [2022-04-28 03:54:39,796 INFO L290 TraceCheckUtils]: 25: Hoare triple {29459#(< 999969 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {29463#(< 999967 main_~y~0)} is VALID [2022-04-28 03:54:39,797 INFO L290 TraceCheckUtils]: 26: Hoare triple {29463#(< 999967 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {29467#(< 999965 main_~y~0)} is VALID [2022-04-28 03:54:39,797 INFO L290 TraceCheckUtils]: 27: Hoare triple {29467#(< 999965 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {29471#(< 999963 main_~y~0)} is VALID [2022-04-28 03:54:39,797 INFO L290 TraceCheckUtils]: 28: Hoare triple {29471#(< 999963 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {29475#(< 999961 main_~y~0)} is VALID [2022-04-28 03:54:39,798 INFO L290 TraceCheckUtils]: 29: Hoare triple {29475#(< 999961 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {29479#(< 999959 main_~y~0)} is VALID [2022-04-28 03:54:39,798 INFO L290 TraceCheckUtils]: 30: Hoare triple {29479#(< 999959 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {29483#(< 999957 main_~y~0)} is VALID [2022-04-28 03:54:39,799 INFO L290 TraceCheckUtils]: 31: Hoare triple {29483#(< 999957 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {29487#(< 999955 main_~y~0)} is VALID [2022-04-28 03:54:39,799 INFO L290 TraceCheckUtils]: 32: Hoare triple {29487#(< 999955 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {29491#(< 999953 main_~y~0)} is VALID [2022-04-28 03:54:39,800 INFO L290 TraceCheckUtils]: 33: Hoare triple {29491#(< 999953 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {29495#(< 999951 main_~y~0)} is VALID [2022-04-28 03:54:39,800 INFO L290 TraceCheckUtils]: 34: Hoare triple {29495#(< 999951 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {29499#(< 999949 main_~y~0)} is VALID [2022-04-28 03:54:39,801 INFO L290 TraceCheckUtils]: 35: Hoare triple {29499#(< 999949 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {29503#(< 999947 main_~y~0)} is VALID [2022-04-28 03:54:39,801 INFO L290 TraceCheckUtils]: 36: Hoare triple {29503#(< 999947 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {29507#(< 999945 main_~y~0)} is VALID [2022-04-28 03:54:39,802 INFO L290 TraceCheckUtils]: 37: Hoare triple {29507#(< 999945 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {29511#(< 999943 main_~y~0)} is VALID [2022-04-28 03:54:39,802 INFO L290 TraceCheckUtils]: 38: Hoare triple {29511#(< 999943 main_~y~0)} assume !(~y~0 > 0); {29329#false} is VALID [2022-04-28 03:54:39,802 INFO L272 TraceCheckUtils]: 39: Hoare triple {29329#false} call __VERIFIER_assert((if ~z~0 == ~x~0 then 1 else 0)); {29329#false} is VALID [2022-04-28 03:54:39,802 INFO L290 TraceCheckUtils]: 40: Hoare triple {29329#false} ~cond := #in~cond; {29329#false} is VALID [2022-04-28 03:54:39,802 INFO L290 TraceCheckUtils]: 41: Hoare triple {29329#false} assume 0 == ~cond; {29329#false} is VALID [2022-04-28 03:54:39,802 INFO L290 TraceCheckUtils]: 42: Hoare triple {29329#false} assume !false; {29329#false} is VALID [2022-04-28 03:54:39,803 INFO L134 CoverageAnalysis]: Checked inductivity of 408 backedges. 0 proven. 408 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 03:54:39,803 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 03:54:41,342 INFO L290 TraceCheckUtils]: 42: Hoare triple {29329#false} assume !false; {29329#false} is VALID [2022-04-28 03:54:41,342 INFO L290 TraceCheckUtils]: 41: Hoare triple {29329#false} assume 0 == ~cond; {29329#false} is VALID [2022-04-28 03:54:41,342 INFO L290 TraceCheckUtils]: 40: Hoare triple {29329#false} ~cond := #in~cond; {29329#false} is VALID [2022-04-28 03:54:41,342 INFO L272 TraceCheckUtils]: 39: Hoare triple {29329#false} call __VERIFIER_assert((if ~z~0 == ~x~0 then 1 else 0)); {29329#false} is VALID [2022-04-28 03:54:41,342 INFO L290 TraceCheckUtils]: 38: Hoare triple {29539#(< 0 main_~y~0)} assume !(~y~0 > 0); {29329#false} is VALID [2022-04-28 03:54:41,343 INFO L290 TraceCheckUtils]: 37: Hoare triple {29543#(< 2 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {29539#(< 0 main_~y~0)} is VALID [2022-04-28 03:54:41,343 INFO L290 TraceCheckUtils]: 36: Hoare triple {29547#(< 4 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {29543#(< 2 main_~y~0)} is VALID [2022-04-28 03:54:41,344 INFO L290 TraceCheckUtils]: 35: Hoare triple {29551#(< 6 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {29547#(< 4 main_~y~0)} is VALID [2022-04-28 03:54:41,344 INFO L290 TraceCheckUtils]: 34: Hoare triple {29555#(< 8 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {29551#(< 6 main_~y~0)} is VALID [2022-04-28 03:54:41,345 INFO L290 TraceCheckUtils]: 33: Hoare triple {29559#(< 10 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {29555#(< 8 main_~y~0)} is VALID [2022-04-28 03:54:41,345 INFO L290 TraceCheckUtils]: 32: Hoare triple {29563#(< 12 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {29559#(< 10 main_~y~0)} is VALID [2022-04-28 03:54:41,345 INFO L290 TraceCheckUtils]: 31: Hoare triple {29567#(< 14 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {29563#(< 12 main_~y~0)} is VALID [2022-04-28 03:54:41,346 INFO L290 TraceCheckUtils]: 30: Hoare triple {29571#(< 16 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {29567#(< 14 main_~y~0)} is VALID [2022-04-28 03:54:41,346 INFO L290 TraceCheckUtils]: 29: Hoare triple {29575#(< 18 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {29571#(< 16 main_~y~0)} is VALID [2022-04-28 03:54:41,347 INFO L290 TraceCheckUtils]: 28: Hoare triple {29579#(< 20 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {29575#(< 18 main_~y~0)} is VALID [2022-04-28 03:54:41,347 INFO L290 TraceCheckUtils]: 27: Hoare triple {29583#(< 22 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {29579#(< 20 main_~y~0)} is VALID [2022-04-28 03:54:41,347 INFO L290 TraceCheckUtils]: 26: Hoare triple {29587#(< 24 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {29583#(< 22 main_~y~0)} is VALID [2022-04-28 03:54:41,348 INFO L290 TraceCheckUtils]: 25: Hoare triple {29591#(< 26 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {29587#(< 24 main_~y~0)} is VALID [2022-04-28 03:54:41,348 INFO L290 TraceCheckUtils]: 24: Hoare triple {29595#(< 28 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {29591#(< 26 main_~y~0)} is VALID [2022-04-28 03:54:41,349 INFO L290 TraceCheckUtils]: 23: Hoare triple {29599#(< 30 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {29595#(< 28 main_~y~0)} is VALID [2022-04-28 03:54:41,349 INFO L290 TraceCheckUtils]: 22: Hoare triple {29603#(< 32 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {29599#(< 30 main_~y~0)} is VALID [2022-04-28 03:54:41,359 INFO L290 TraceCheckUtils]: 21: Hoare triple {29607#(< 34 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {29603#(< 32 main_~y~0)} is VALID [2022-04-28 03:54:41,360 INFO L290 TraceCheckUtils]: 20: Hoare triple {29611#(< 36 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {29607#(< 34 main_~y~0)} is VALID [2022-04-28 03:54:41,360 INFO L290 TraceCheckUtils]: 19: Hoare triple {29615#(< 38 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {29611#(< 36 main_~y~0)} is VALID [2022-04-28 03:54:41,361 INFO L290 TraceCheckUtils]: 18: Hoare triple {29619#(< 40 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {29615#(< 38 main_~y~0)} is VALID [2022-04-28 03:54:41,361 INFO L290 TraceCheckUtils]: 17: Hoare triple {29623#(< 42 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {29619#(< 40 main_~y~0)} is VALID [2022-04-28 03:54:41,362 INFO L290 TraceCheckUtils]: 16: Hoare triple {29627#(< 44 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {29623#(< 42 main_~y~0)} is VALID [2022-04-28 03:54:41,362 INFO L290 TraceCheckUtils]: 15: Hoare triple {29631#(< 46 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {29627#(< 44 main_~y~0)} is VALID [2022-04-28 03:54:41,362 INFO L290 TraceCheckUtils]: 14: Hoare triple {29635#(< 48 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {29631#(< 46 main_~y~0)} is VALID [2022-04-28 03:54:41,363 INFO L290 TraceCheckUtils]: 13: Hoare triple {29639#(< 50 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {29635#(< 48 main_~y~0)} is VALID [2022-04-28 03:54:41,363 INFO L290 TraceCheckUtils]: 12: Hoare triple {29643#(< 52 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {29639#(< 50 main_~y~0)} is VALID [2022-04-28 03:54:41,364 INFO L290 TraceCheckUtils]: 11: Hoare triple {29647#(< 54 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {29643#(< 52 main_~y~0)} is VALID [2022-04-28 03:54:41,364 INFO L290 TraceCheckUtils]: 10: Hoare triple {29651#(< 56 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {29647#(< 54 main_~y~0)} is VALID [2022-04-28 03:54:41,365 INFO L290 TraceCheckUtils]: 9: Hoare triple {29655#(or (< main_~x~0 1000000) (< 56 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[] {29651#(< 56 main_~y~0)} is VALID [2022-04-28 03:54:41,365 INFO L290 TraceCheckUtils]: 8: Hoare triple {29659#(and (or (< main_~x~0 1000000) (< 56 main_~y~0)) (or (< main_~x~0 (+ 999944 main_~y~0)) (not (<= 50000 main_~x~0)) (<= 56 main_~y~0)))} [170] L11-2-->L18-1_primed: Formula: (let ((.cse0 (= |v_main_#t~post5_193| |v_main_#t~post5_192|)) (.cse1 (= v_main_~y~0_1712 v_main_~y~0_1711)) (.cse2 (= |v_main_#t~post6_193| |v_main_#t~post6_192|)) (.cse3 (= v_main_~x~0_1571 v_main_~x~0_1570)) (.cse4 (<= 50000 v_main_~x~0_1571))) (or (and .cse0 .cse1 .cse2 .cse3) (and .cse0 (or (not (< v_main_~x~0_1571 1000000)) (not .cse4)) .cse1 .cse2 .cse3) (and (= (+ v_main_~x~0_1570 v_main_~y~0_1712) (+ v_main_~x~0_1571 v_main_~y~0_1711)) (< v_main_~x~0_1570 1000001) (< v_main_~x~0_1571 v_main_~x~0_1570) .cse4))) InVars {main_~y~0=v_main_~y~0_1712, main_#t~post5=|v_main_#t~post5_193|, main_~x~0=v_main_~x~0_1571, main_#t~post6=|v_main_#t~post6_193|} OutVars{main_~y~0=v_main_~y~0_1711, main_#t~post5=|v_main_#t~post5_192|, main_~x~0=v_main_~x~0_1570, main_#t~post6=|v_main_#t~post6_192|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {29655#(or (< main_~x~0 1000000) (< 56 main_~y~0))} is VALID [2022-04-28 03:54:41,366 INFO L290 TraceCheckUtils]: 7: Hoare triple {29659#(and (or (< main_~x~0 1000000) (< 56 main_~y~0)) (or (< main_~x~0 (+ 999944 main_~y~0)) (not (<= 50000 main_~x~0)) (<= 56 main_~y~0)))} [169] L18-1_primed-->L11-2: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {29659#(and (or (< main_~x~0 1000000) (< 56 main_~y~0)) (or (< main_~x~0 (+ 999944 main_~y~0)) (not (<= 50000 main_~x~0)) (<= 56 main_~y~0)))} is VALID [2022-04-28 03:54:41,367 INFO L290 TraceCheckUtils]: 6: Hoare triple {29666#(and (or (and (< main_~x~0 (+ 999944 main_~y~0)) (<= 0 (+ main_~y~0 949943))) (<= 56 main_~y~0)) (or (< main_~x~0 1000000) (< 56 main_~y~0)))} [168] L11-2-->L18-1_primed: Formula: (let ((.cse0 (= v_main_~x~0_1569 v_main_~x~0_1568)) (.cse1 (= |v_main_#t~post4_177| |v_main_#t~post4_176|))) (or (and (< v_main_~x~0_1568 50001) (< v_main_~x~0_1569 v_main_~x~0_1568)) (and .cse0 .cse1) (and .cse0 .cse1 (not (< v_main_~x~0_1569 50000))))) InVars {main_~x~0=v_main_~x~0_1569, main_#t~post4=|v_main_#t~post4_177|} OutVars{main_~x~0=v_main_~x~0_1568, main_#t~post4=|v_main_#t~post4_176|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {29659#(and (or (< main_~x~0 1000000) (< 56 main_~y~0)) (or (< main_~x~0 (+ 999944 main_~y~0)) (not (<= 50000 main_~x~0)) (<= 56 main_~y~0)))} is VALID [2022-04-28 03:54:41,367 INFO L290 TraceCheckUtils]: 5: Hoare triple {29328#true} ~x~0 := 0;~y~0 := 50000;~z~0 := 0;~x~0 := 0; {29666#(and (or (and (< main_~x~0 (+ 999944 main_~y~0)) (<= 0 (+ main_~y~0 949943))) (<= 56 main_~y~0)) (or (< main_~x~0 1000000) (< 56 main_~y~0)))} is VALID [2022-04-28 03:54:41,367 INFO L272 TraceCheckUtils]: 4: Hoare triple {29328#true} call #t~ret7 := main(); {29328#true} is VALID [2022-04-28 03:54:41,367 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {29328#true} {29328#true} #52#return; {29328#true} is VALID [2022-04-28 03:54:41,367 INFO L290 TraceCheckUtils]: 2: Hoare triple {29328#true} assume true; {29328#true} is VALID [2022-04-28 03:54:41,367 INFO L290 TraceCheckUtils]: 1: Hoare triple {29328#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); {29328#true} is VALID [2022-04-28 03:54:41,367 INFO L272 TraceCheckUtils]: 0: Hoare triple {29328#true} call ULTIMATE.init(); {29328#true} is VALID [2022-04-28 03:54:41,368 INFO L134 CoverageAnalysis]: Checked inductivity of 408 backedges. 0 proven. 408 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 03:54:41,368 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [51993278] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 03:54:41,368 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 03:54:41,368 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [35, 34, 34] total 99 [2022-04-28 03:54:44,143 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 03:54:44,143 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [947040379] [2022-04-28 03:54:44,143 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [947040379] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 03:54:44,143 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 03:54:44,143 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [86] imperfect sequences [] total 86 [2022-04-28 03:54:44,143 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1934341170] [2022-04-28 03:54:44,143 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 03:54:44,144 INFO L78 Accepts]: Start accepts. Automaton has has 86 states, 86 states have (on average 1.6511627906976745) internal successors, (142), 85 states have internal predecessors, (142), 2 states have call successors, (3), 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 146 [2022-04-28 03:54:44,144 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 03:54:44,144 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 86 states, 86 states have (on average 1.6511627906976745) internal successors, (142), 85 states have internal predecessors, (142), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:54:44,249 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 146 edges. 146 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 03:54:44,249 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 86 states [2022-04-28 03:54:44,249 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 03:54:44,250 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 86 interpolants. [2022-04-28 03:54:44,251 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8036, Invalid=15220, Unknown=0, NotChecked=0, Total=23256 [2022-04-28 03:54:44,251 INFO L87 Difference]: Start difference. First operand 147 states and 150 transitions. Second operand has 86 states, 86 states have (on average 1.6511627906976745) internal successors, (142), 85 states have internal predecessors, (142), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:54:57,524 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:54:57,524 INFO L93 Difference]: Finished difference Result 393 states and 404 transitions. [2022-04-28 03:54:57,524 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 86 states. [2022-04-28 03:54:57,524 INFO L78 Accepts]: Start accepts. Automaton has has 86 states, 86 states have (on average 1.6511627906976745) internal successors, (142), 85 states have internal predecessors, (142), 2 states have call successors, (3), 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 146 [2022-04-28 03:54:57,524 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 03:54:57,525 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 86 states, 86 states have (on average 1.6511627906976745) internal successors, (142), 85 states have internal predecessors, (142), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:54:57,526 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 168 transitions. [2022-04-28 03:54:57,526 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 86 states, 86 states have (on average 1.6511627906976745) internal successors, (142), 85 states have internal predecessors, (142), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:54:57,527 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 168 transitions. [2022-04-28 03:54:57,528 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 86 states and 168 transitions. [2022-04-28 03:54:57,685 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 168 edges. 168 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 03:54:57,696 INFO L225 Difference]: With dead ends: 393 [2022-04-28 03:54:57,696 INFO L226 Difference]: Without dead ends: 254 [2022-04-28 03:54:57,699 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 315 GetRequests, 80 SyntacticMatches, 1 SemanticMatches, 234 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19057 ImplicationChecksByTransitivity, 7.7s TimeCoverageRelationStatistics Valid=15135, Invalid=40325, Unknown=0, NotChecked=0, Total=55460 [2022-04-28 03:54:57,699 INFO L413 NwaCegarLoop]: 12 mSDtfsCounter, 283 mSDsluCounter, 27 mSDsCounter, 0 mSdLazyCounter, 6092 mSolverCounterSat, 314 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 283 SdHoareTripleChecker+Valid, 39 SdHoareTripleChecker+Invalid, 6406 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 314 IncrementalHoareTripleChecker+Valid, 6092 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.9s IncrementalHoareTripleChecker+Time [2022-04-28 03:54:57,699 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [283 Valid, 39 Invalid, 6406 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [314 Valid, 6092 Invalid, 0 Unknown, 0 Unchecked, 4.9s Time] [2022-04-28 03:54:57,699 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 254 states. [2022-04-28 03:54:58,148 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 254 to 254. [2022-04-28 03:54:58,148 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 03:54:58,148 INFO L82 GeneralOperation]: Start isEquivalent. First operand 254 states. Second operand has 254 states, 249 states have (on average 1.0200803212851406) internal successors, (254), 249 states have internal predecessors, (254), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:54:58,148 INFO L74 IsIncluded]: Start isIncluded. First operand 254 states. Second operand has 254 states, 249 states have (on average 1.0200803212851406) internal successors, (254), 249 states have internal predecessors, (254), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:54:58,148 INFO L87 Difference]: Start difference. First operand 254 states. Second operand has 254 states, 249 states have (on average 1.0200803212851406) internal successors, (254), 249 states have internal predecessors, (254), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:54:58,151 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:54:58,151 INFO L93 Difference]: Finished difference Result 254 states and 258 transitions. [2022-04-28 03:54:58,151 INFO L276 IsEmpty]: Start isEmpty. Operand 254 states and 258 transitions. [2022-04-28 03:54:58,151 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:54:58,151 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:54:58,151 INFO L74 IsIncluded]: Start isIncluded. First operand has 254 states, 249 states have (on average 1.0200803212851406) internal successors, (254), 249 states have internal predecessors, (254), 3 states have call successors, (3), 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 254 states. [2022-04-28 03:54:58,152 INFO L87 Difference]: Start difference. First operand has 254 states, 249 states have (on average 1.0200803212851406) internal successors, (254), 249 states have internal predecessors, (254), 3 states have call successors, (3), 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 254 states. [2022-04-28 03:54:58,154 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:54:58,154 INFO L93 Difference]: Finished difference Result 254 states and 258 transitions. [2022-04-28 03:54:58,154 INFO L276 IsEmpty]: Start isEmpty. Operand 254 states and 258 transitions. [2022-04-28 03:54:58,154 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:54:58,154 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:54:58,154 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 03:54:58,154 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 03:54:58,154 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 254 states, 249 states have (on average 1.0200803212851406) internal successors, (254), 249 states have internal predecessors, (254), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:54:58,157 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 254 states to 254 states and 258 transitions. [2022-04-28 03:54:58,157 INFO L78 Accepts]: Start accepts. Automaton has 254 states and 258 transitions. Word has length 146 [2022-04-28 03:54:58,157 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 03:54:58,158 INFO L495 AbstractCegarLoop]: Abstraction has 254 states and 258 transitions. [2022-04-28 03:54:58,158 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 86 states, 86 states have (on average 1.6511627906976745) internal successors, (142), 85 states have internal predecessors, (142), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:54:58,158 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 254 states and 258 transitions. [2022-04-28 03:54:58,364 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 258 edges. 258 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 03:54:58,365 INFO L276 IsEmpty]: Start isEmpty. Operand 254 states and 258 transitions. [2022-04-28 03:54:58,365 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 150 [2022-04-28 03:54:58,365 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 03:54:58,365 INFO L195 NwaCegarLoop]: trace histogram [54, 53, 29, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 03:54:58,383 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (29)] Forceful destruction successful, exit code 0 [2022-04-28 03:54:58,579 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30,29 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 03:54:58,579 INFO L420 AbstractCegarLoop]: === Iteration 32 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 03:54:58,580 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 03:54:58,580 INFO L85 PathProgramCache]: Analyzing trace with hash 467601408, now seen corresponding path program 29 times [2022-04-28 03:54:58,580 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 03:54:58,580 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [7796985] [2022-04-28 03:55:02,651 WARN L977 rdanLoopAcceleration]: Unable to prove correctness of quantifier elimination. [2022-04-28 03:55:02,702 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 1 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 03:55:06,816 WARN L977 rdanLoopAcceleration]: Unable to prove correctness of quantifier elimination. [2022-04-28 03:55:06,908 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={1=1, 2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 03:55:06,909 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-28 03:55:06,911 INFO L85 PathProgramCache]: Analyzing trace with hash 575675586, now seen corresponding path program 1 times [2022-04-28 03:55:06,911 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 03:55:06,911 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1778938847] [2022-04-28 03:55:06,911 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:55:06,911 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 03:55:06,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:55:07,437 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 03:55:07,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:55:07,440 INFO L290 TraceCheckUtils]: 0: Hoare triple {31744#(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); {31709#true} is VALID [2022-04-28 03:55:07,440 INFO L290 TraceCheckUtils]: 1: Hoare triple {31709#true} assume true; {31709#true} is VALID [2022-04-28 03:55:07,440 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {31709#true} {31709#true} #52#return; {31709#true} is VALID [2022-04-28 03:55:07,441 INFO L272 TraceCheckUtils]: 0: Hoare triple {31709#true} call ULTIMATE.init(); {31744#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 03:55:07,441 INFO L290 TraceCheckUtils]: 1: Hoare triple {31744#(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); {31709#true} is VALID [2022-04-28 03:55:07,441 INFO L290 TraceCheckUtils]: 2: Hoare triple {31709#true} assume true; {31709#true} is VALID [2022-04-28 03:55:07,441 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {31709#true} {31709#true} #52#return; {31709#true} is VALID [2022-04-28 03:55:07,441 INFO L272 TraceCheckUtils]: 4: Hoare triple {31709#true} call #t~ret7 := main(); {31709#true} is VALID [2022-04-28 03:55:07,441 INFO L290 TraceCheckUtils]: 5: Hoare triple {31709#true} ~x~0 := 0;~y~0 := 50000;~z~0 := 0;~x~0 := 0; {31714#(<= 50000 main_~y~0)} is VALID [2022-04-28 03:55:07,442 INFO L290 TraceCheckUtils]: 6: Hoare triple {31714#(<= 50000 main_~y~0)} [172] L11-2-->L18-1_primed: Formula: (let ((.cse0 (= |v_main_#t~post4_184| |v_main_#t~post4_183|)) (.cse1 (= v_main_~x~0_1667 v_main_~x~0_1666))) (or (and (< v_main_~x~0_1667 v_main_~x~0_1666) (< v_main_~x~0_1666 50001)) (and .cse0 .cse1) (and (not (< v_main_~x~0_1667 50000)) .cse0 .cse1))) InVars {main_~x~0=v_main_~x~0_1667, main_#t~post4=|v_main_#t~post4_184|} OutVars{main_~x~0=v_main_~x~0_1666, main_#t~post4=|v_main_#t~post4_183|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {31714#(<= 50000 main_~y~0)} is VALID [2022-04-28 03:55:07,442 INFO L290 TraceCheckUtils]: 7: Hoare triple {31714#(<= 50000 main_~y~0)} [173] L18-1_primed-->L11-2: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {31714#(<= 50000 main_~y~0)} is VALID [2022-04-28 03:55:07,443 INFO L290 TraceCheckUtils]: 8: Hoare triple {31714#(<= 50000 main_~y~0)} [174] L11-2-->L18-1_primed: Formula: (let ((.cse0 (= |v_main_#t~post6_200| |v_main_#t~post6_199|)) (.cse4 (<= 50000 v_main_~x~0_1669)) (.cse1 (= v_main_~y~0_1829 v_main_~y~0_1828)) (.cse2 (= v_main_~x~0_1669 v_main_~x~0_1668)) (.cse3 (= |v_main_#t~post5_200| |v_main_#t~post5_199|))) (or (and .cse0 .cse1 .cse2 .cse3) (let ((.cse5 (+ v_main_~x~0_1669 v_main_~y~0_1828))) (and .cse4 (= .cse5 (+ v_main_~x~0_1668 v_main_~y~0_1829)) (< v_main_~y~0_1829 v_main_~y~0_1828) (< .cse5 (+ 1000001 v_main_~y~0_1829)))) (and .cse0 (or (not .cse4) (not (< v_main_~x~0_1669 1000000))) .cse1 .cse2 .cse3))) InVars {main_~y~0=v_main_~y~0_1829, main_#t~post5=|v_main_#t~post5_200|, main_~x~0=v_main_~x~0_1669, main_#t~post6=|v_main_#t~post6_200|} OutVars{main_~y~0=v_main_~y~0_1828, main_#t~post5=|v_main_#t~post5_199|, main_~x~0=v_main_~x~0_1668, main_#t~post6=|v_main_#t~post6_199|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {31714#(<= 50000 main_~y~0)} is VALID [2022-04-28 03:55:07,443 INFO L290 TraceCheckUtils]: 9: Hoare triple {31714#(<= 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[] {31714#(<= 50000 main_~y~0)} is VALID [2022-04-28 03:55:07,443 INFO L290 TraceCheckUtils]: 10: Hoare triple {31714#(<= 50000 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {31715#(<= 49998 main_~y~0)} is VALID [2022-04-28 03:55:07,444 INFO L290 TraceCheckUtils]: 11: Hoare triple {31715#(<= 49998 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {31716#(<= 49996 main_~y~0)} is VALID [2022-04-28 03:55:07,444 INFO L290 TraceCheckUtils]: 12: Hoare triple {31716#(<= 49996 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {31717#(<= 49994 main_~y~0)} is VALID [2022-04-28 03:55:07,445 INFO L290 TraceCheckUtils]: 13: Hoare triple {31717#(<= 49994 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {31718#(<= 49992 main_~y~0)} is VALID [2022-04-28 03:55:07,445 INFO L290 TraceCheckUtils]: 14: Hoare triple {31718#(<= 49992 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {31719#(<= 49990 main_~y~0)} is VALID [2022-04-28 03:55:07,446 INFO L290 TraceCheckUtils]: 15: Hoare triple {31719#(<= 49990 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {31720#(<= 49988 main_~y~0)} is VALID [2022-04-28 03:55:07,446 INFO L290 TraceCheckUtils]: 16: Hoare triple {31720#(<= 49988 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {31721#(<= 49986 main_~y~0)} is VALID [2022-04-28 03:55:07,447 INFO L290 TraceCheckUtils]: 17: Hoare triple {31721#(<= 49986 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {31722#(<= 49984 main_~y~0)} is VALID [2022-04-28 03:55:07,447 INFO L290 TraceCheckUtils]: 18: Hoare triple {31722#(<= 49984 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {31723#(<= 49982 main_~y~0)} is VALID [2022-04-28 03:55:07,447 INFO L290 TraceCheckUtils]: 19: Hoare triple {31723#(<= 49982 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {31724#(<= 49980 main_~y~0)} is VALID [2022-04-28 03:55:07,448 INFO L290 TraceCheckUtils]: 20: Hoare triple {31724#(<= 49980 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {31725#(<= 49978 main_~y~0)} is VALID [2022-04-28 03:55:07,448 INFO L290 TraceCheckUtils]: 21: Hoare triple {31725#(<= 49978 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {31726#(<= 49976 main_~y~0)} is VALID [2022-04-28 03:55:07,449 INFO L290 TraceCheckUtils]: 22: Hoare triple {31726#(<= 49976 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {31727#(<= 49974 main_~y~0)} is VALID [2022-04-28 03:55:07,449 INFO L290 TraceCheckUtils]: 23: Hoare triple {31727#(<= 49974 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {31728#(<= 49972 main_~y~0)} is VALID [2022-04-28 03:55:07,450 INFO L290 TraceCheckUtils]: 24: Hoare triple {31728#(<= 49972 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {31729#(<= 49970 main_~y~0)} is VALID [2022-04-28 03:55:07,450 INFO L290 TraceCheckUtils]: 25: Hoare triple {31729#(<= 49970 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {31730#(<= 49968 main_~y~0)} is VALID [2022-04-28 03:55:07,451 INFO L290 TraceCheckUtils]: 26: Hoare triple {31730#(<= 49968 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {31731#(<= 49966 main_~y~0)} is VALID [2022-04-28 03:55:07,451 INFO L290 TraceCheckUtils]: 27: Hoare triple {31731#(<= 49966 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {31732#(<= 49964 main_~y~0)} is VALID [2022-04-28 03:55:07,451 INFO L290 TraceCheckUtils]: 28: Hoare triple {31732#(<= 49964 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {31733#(<= 49962 main_~y~0)} is VALID [2022-04-28 03:55:07,452 INFO L290 TraceCheckUtils]: 29: Hoare triple {31733#(<= 49962 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {31734#(<= 49960 main_~y~0)} is VALID [2022-04-28 03:55:07,452 INFO L290 TraceCheckUtils]: 30: Hoare triple {31734#(<= 49960 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {31735#(<= 49958 main_~y~0)} is VALID [2022-04-28 03:55:07,453 INFO L290 TraceCheckUtils]: 31: Hoare triple {31735#(<= 49958 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {31736#(<= 49956 main_~y~0)} is VALID [2022-04-28 03:55:07,453 INFO L290 TraceCheckUtils]: 32: Hoare triple {31736#(<= 49956 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {31737#(<= 49954 main_~y~0)} is VALID [2022-04-28 03:55:07,454 INFO L290 TraceCheckUtils]: 33: Hoare triple {31737#(<= 49954 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {31738#(<= 49952 main_~y~0)} is VALID [2022-04-28 03:55:07,454 INFO L290 TraceCheckUtils]: 34: Hoare triple {31738#(<= 49952 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {31739#(<= 49950 main_~y~0)} is VALID [2022-04-28 03:55:07,454 INFO L290 TraceCheckUtils]: 35: Hoare triple {31739#(<= 49950 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {31740#(<= 49948 main_~y~0)} is VALID [2022-04-28 03:55:07,455 INFO L290 TraceCheckUtils]: 36: Hoare triple {31740#(<= 49948 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {31741#(<= 49946 main_~y~0)} is VALID [2022-04-28 03:55:07,455 INFO L290 TraceCheckUtils]: 37: Hoare triple {31741#(<= 49946 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {31742#(<= 49944 main_~y~0)} is VALID [2022-04-28 03:55:07,456 INFO L290 TraceCheckUtils]: 38: Hoare triple {31742#(<= 49944 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {31743#(<= 49942 main_~y~0)} is VALID [2022-04-28 03:55:07,456 INFO L290 TraceCheckUtils]: 39: Hoare triple {31743#(<= 49942 main_~y~0)} assume !(~y~0 > 0); {31710#false} is VALID [2022-04-28 03:55:07,456 INFO L272 TraceCheckUtils]: 40: Hoare triple {31710#false} call __VERIFIER_assert((if ~z~0 == ~x~0 then 1 else 0)); {31710#false} is VALID [2022-04-28 03:55:07,456 INFO L290 TraceCheckUtils]: 41: Hoare triple {31710#false} ~cond := #in~cond; {31710#false} is VALID [2022-04-28 03:55:07,456 INFO L290 TraceCheckUtils]: 42: Hoare triple {31710#false} assume 0 == ~cond; {31710#false} is VALID [2022-04-28 03:55:07,456 INFO L290 TraceCheckUtils]: 43: Hoare triple {31710#false} assume !false; {31710#false} is VALID [2022-04-28 03:55:07,456 INFO L134 CoverageAnalysis]: Checked inductivity of 437 backedges. 0 proven. 435 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-04-28 03:55:07,457 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 03:55:07,457 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1778938847] [2022-04-28 03:55:07,457 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1778938847] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 03:55:07,457 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1102419238] [2022-04-28 03:55:07,457 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:55:07,457 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 03:55:07,457 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 03:55:07,458 INFO L229 MonitoredProcess]: Starting monitored process 30 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 03:55:07,458 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (30)] Waiting until timeout for monitored process [2022-04-28 03:55:07,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:55:07,512 INFO L263 TraceCheckSpWp]: Trace formula consists of 204 conjuncts, 32 conjunts are in the unsatisfiable core [2022-04-28 03:55:07,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:55:07,528 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 03:55:07,931 INFO L272 TraceCheckUtils]: 0: Hoare triple {31709#true} call ULTIMATE.init(); {31709#true} is VALID [2022-04-28 03:55:07,931 INFO L290 TraceCheckUtils]: 1: Hoare triple {31709#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); {31709#true} is VALID [2022-04-28 03:55:07,931 INFO L290 TraceCheckUtils]: 2: Hoare triple {31709#true} assume true; {31709#true} is VALID [2022-04-28 03:55:07,931 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {31709#true} {31709#true} #52#return; {31709#true} is VALID [2022-04-28 03:55:07,931 INFO L272 TraceCheckUtils]: 4: Hoare triple {31709#true} call #t~ret7 := main(); {31709#true} is VALID [2022-04-28 03:55:07,931 INFO L290 TraceCheckUtils]: 5: Hoare triple {31709#true} ~x~0 := 0;~y~0 := 50000;~z~0 := 0;~x~0 := 0; {31714#(<= 50000 main_~y~0)} is VALID [2022-04-28 03:55:07,932 INFO L290 TraceCheckUtils]: 6: Hoare triple {31714#(<= 50000 main_~y~0)} [172] L11-2-->L18-1_primed: Formula: (let ((.cse0 (= |v_main_#t~post4_184| |v_main_#t~post4_183|)) (.cse1 (= v_main_~x~0_1667 v_main_~x~0_1666))) (or (and (< v_main_~x~0_1667 v_main_~x~0_1666) (< v_main_~x~0_1666 50001)) (and .cse0 .cse1) (and (not (< v_main_~x~0_1667 50000)) .cse0 .cse1))) InVars {main_~x~0=v_main_~x~0_1667, main_#t~post4=|v_main_#t~post4_184|} OutVars{main_~x~0=v_main_~x~0_1666, main_#t~post4=|v_main_#t~post4_183|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {31714#(<= 50000 main_~y~0)} is VALID [2022-04-28 03:55:07,932 INFO L290 TraceCheckUtils]: 7: Hoare triple {31714#(<= 50000 main_~y~0)} [173] L18-1_primed-->L11-2: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {31714#(<= 50000 main_~y~0)} is VALID [2022-04-28 03:55:07,933 INFO L290 TraceCheckUtils]: 8: Hoare triple {31714#(<= 50000 main_~y~0)} [174] L11-2-->L18-1_primed: Formula: (let ((.cse0 (= |v_main_#t~post6_200| |v_main_#t~post6_199|)) (.cse4 (<= 50000 v_main_~x~0_1669)) (.cse1 (= v_main_~y~0_1829 v_main_~y~0_1828)) (.cse2 (= v_main_~x~0_1669 v_main_~x~0_1668)) (.cse3 (= |v_main_#t~post5_200| |v_main_#t~post5_199|))) (or (and .cse0 .cse1 .cse2 .cse3) (let ((.cse5 (+ v_main_~x~0_1669 v_main_~y~0_1828))) (and .cse4 (= .cse5 (+ v_main_~x~0_1668 v_main_~y~0_1829)) (< v_main_~y~0_1829 v_main_~y~0_1828) (< .cse5 (+ 1000001 v_main_~y~0_1829)))) (and .cse0 (or (not .cse4) (not (< v_main_~x~0_1669 1000000))) .cse1 .cse2 .cse3))) InVars {main_~y~0=v_main_~y~0_1829, main_#t~post5=|v_main_#t~post5_200|, main_~x~0=v_main_~x~0_1669, main_#t~post6=|v_main_#t~post6_200|} OutVars{main_~y~0=v_main_~y~0_1828, main_#t~post5=|v_main_#t~post5_199|, main_~x~0=v_main_~x~0_1668, main_#t~post6=|v_main_#t~post6_199|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {31714#(<= 50000 main_~y~0)} is VALID [2022-04-28 03:55:07,933 INFO L290 TraceCheckUtils]: 9: Hoare triple {31714#(<= 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[] {31714#(<= 50000 main_~y~0)} is VALID [2022-04-28 03:55:07,933 INFO L290 TraceCheckUtils]: 10: Hoare triple {31714#(<= 50000 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {31715#(<= 49998 main_~y~0)} is VALID [2022-04-28 03:55:07,934 INFO L290 TraceCheckUtils]: 11: Hoare triple {31715#(<= 49998 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {31716#(<= 49996 main_~y~0)} is VALID [2022-04-28 03:55:07,934 INFO L290 TraceCheckUtils]: 12: Hoare triple {31716#(<= 49996 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {31717#(<= 49994 main_~y~0)} is VALID [2022-04-28 03:55:07,935 INFO L290 TraceCheckUtils]: 13: Hoare triple {31717#(<= 49994 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {31718#(<= 49992 main_~y~0)} is VALID [2022-04-28 03:55:07,935 INFO L290 TraceCheckUtils]: 14: Hoare triple {31718#(<= 49992 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {31719#(<= 49990 main_~y~0)} is VALID [2022-04-28 03:55:07,936 INFO L290 TraceCheckUtils]: 15: Hoare triple {31719#(<= 49990 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {31720#(<= 49988 main_~y~0)} is VALID [2022-04-28 03:55:07,936 INFO L290 TraceCheckUtils]: 16: Hoare triple {31720#(<= 49988 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {31721#(<= 49986 main_~y~0)} is VALID [2022-04-28 03:55:07,936 INFO L290 TraceCheckUtils]: 17: Hoare triple {31721#(<= 49986 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {31722#(<= 49984 main_~y~0)} is VALID [2022-04-28 03:55:07,937 INFO L290 TraceCheckUtils]: 18: Hoare triple {31722#(<= 49984 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {31723#(<= 49982 main_~y~0)} is VALID [2022-04-28 03:55:07,937 INFO L290 TraceCheckUtils]: 19: Hoare triple {31723#(<= 49982 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {31724#(<= 49980 main_~y~0)} is VALID [2022-04-28 03:55:07,938 INFO L290 TraceCheckUtils]: 20: Hoare triple {31724#(<= 49980 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {31725#(<= 49978 main_~y~0)} is VALID [2022-04-28 03:55:07,938 INFO L290 TraceCheckUtils]: 21: Hoare triple {31725#(<= 49978 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {31726#(<= 49976 main_~y~0)} is VALID [2022-04-28 03:55:07,939 INFO L290 TraceCheckUtils]: 22: Hoare triple {31726#(<= 49976 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {31727#(<= 49974 main_~y~0)} is VALID [2022-04-28 03:55:07,939 INFO L290 TraceCheckUtils]: 23: Hoare triple {31727#(<= 49974 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {31728#(<= 49972 main_~y~0)} is VALID [2022-04-28 03:55:07,940 INFO L290 TraceCheckUtils]: 24: Hoare triple {31728#(<= 49972 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {31729#(<= 49970 main_~y~0)} is VALID [2022-04-28 03:55:07,940 INFO L290 TraceCheckUtils]: 25: Hoare triple {31729#(<= 49970 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {31730#(<= 49968 main_~y~0)} is VALID [2022-04-28 03:55:07,941 INFO L290 TraceCheckUtils]: 26: Hoare triple {31730#(<= 49968 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {31731#(<= 49966 main_~y~0)} is VALID [2022-04-28 03:55:07,941 INFO L290 TraceCheckUtils]: 27: Hoare triple {31731#(<= 49966 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {31732#(<= 49964 main_~y~0)} is VALID [2022-04-28 03:55:07,941 INFO L290 TraceCheckUtils]: 28: Hoare triple {31732#(<= 49964 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {31733#(<= 49962 main_~y~0)} is VALID [2022-04-28 03:55:07,942 INFO L290 TraceCheckUtils]: 29: Hoare triple {31733#(<= 49962 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {31734#(<= 49960 main_~y~0)} is VALID [2022-04-28 03:55:07,942 INFO L290 TraceCheckUtils]: 30: Hoare triple {31734#(<= 49960 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {31735#(<= 49958 main_~y~0)} is VALID [2022-04-28 03:55:07,943 INFO L290 TraceCheckUtils]: 31: Hoare triple {31735#(<= 49958 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {31736#(<= 49956 main_~y~0)} is VALID [2022-04-28 03:55:07,943 INFO L290 TraceCheckUtils]: 32: Hoare triple {31736#(<= 49956 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {31737#(<= 49954 main_~y~0)} is VALID [2022-04-28 03:55:07,944 INFO L290 TraceCheckUtils]: 33: Hoare triple {31737#(<= 49954 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {31738#(<= 49952 main_~y~0)} is VALID [2022-04-28 03:55:07,944 INFO L290 TraceCheckUtils]: 34: Hoare triple {31738#(<= 49952 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {31739#(<= 49950 main_~y~0)} is VALID [2022-04-28 03:55:07,944 INFO L290 TraceCheckUtils]: 35: Hoare triple {31739#(<= 49950 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {31740#(<= 49948 main_~y~0)} is VALID [2022-04-28 03:55:07,945 INFO L290 TraceCheckUtils]: 36: Hoare triple {31740#(<= 49948 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {31741#(<= 49946 main_~y~0)} is VALID [2022-04-28 03:55:07,945 INFO L290 TraceCheckUtils]: 37: Hoare triple {31741#(<= 49946 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {31742#(<= 49944 main_~y~0)} is VALID [2022-04-28 03:55:07,946 INFO L290 TraceCheckUtils]: 38: Hoare triple {31742#(<= 49944 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {31743#(<= 49942 main_~y~0)} is VALID [2022-04-28 03:55:07,946 INFO L290 TraceCheckUtils]: 39: Hoare triple {31743#(<= 49942 main_~y~0)} assume !(~y~0 > 0); {31710#false} is VALID [2022-04-28 03:55:07,946 INFO L272 TraceCheckUtils]: 40: Hoare triple {31710#false} call __VERIFIER_assert((if ~z~0 == ~x~0 then 1 else 0)); {31710#false} is VALID [2022-04-28 03:55:07,946 INFO L290 TraceCheckUtils]: 41: Hoare triple {31710#false} ~cond := #in~cond; {31710#false} is VALID [2022-04-28 03:55:07,946 INFO L290 TraceCheckUtils]: 42: Hoare triple {31710#false} assume 0 == ~cond; {31710#false} is VALID [2022-04-28 03:55:07,946 INFO L290 TraceCheckUtils]: 43: Hoare triple {31710#false} assume !false; {31710#false} is VALID [2022-04-28 03:55:07,947 INFO L134 CoverageAnalysis]: Checked inductivity of 437 backedges. 0 proven. 435 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-04-28 03:55:07,947 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 03:55:09,281 INFO L290 TraceCheckUtils]: 43: Hoare triple {31710#false} assume !false; {31710#false} is VALID [2022-04-28 03:55:09,281 INFO L290 TraceCheckUtils]: 42: Hoare triple {31710#false} assume 0 == ~cond; {31710#false} is VALID [2022-04-28 03:55:09,281 INFO L290 TraceCheckUtils]: 41: Hoare triple {31710#false} ~cond := #in~cond; {31710#false} is VALID [2022-04-28 03:55:09,281 INFO L272 TraceCheckUtils]: 40: Hoare triple {31710#false} call __VERIFIER_assert((if ~z~0 == ~x~0 then 1 else 0)); {31710#false} is VALID [2022-04-28 03:55:09,282 INFO L290 TraceCheckUtils]: 39: Hoare triple {31889#(< 0 main_~y~0)} assume !(~y~0 > 0); {31710#false} is VALID [2022-04-28 03:55:09,282 INFO L290 TraceCheckUtils]: 38: Hoare triple {31893#(< 2 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {31889#(< 0 main_~y~0)} is VALID [2022-04-28 03:55:09,283 INFO L290 TraceCheckUtils]: 37: Hoare triple {31897#(< 4 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {31893#(< 2 main_~y~0)} is VALID [2022-04-28 03:55:09,283 INFO L290 TraceCheckUtils]: 36: Hoare triple {31901#(< 6 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {31897#(< 4 main_~y~0)} is VALID [2022-04-28 03:55:09,284 INFO L290 TraceCheckUtils]: 35: Hoare triple {31905#(< 8 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {31901#(< 6 main_~y~0)} is VALID [2022-04-28 03:55:09,284 INFO L290 TraceCheckUtils]: 34: Hoare triple {31909#(< 10 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {31905#(< 8 main_~y~0)} is VALID [2022-04-28 03:55:09,285 INFO L290 TraceCheckUtils]: 33: Hoare triple {31913#(< 12 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {31909#(< 10 main_~y~0)} is VALID [2022-04-28 03:55:09,285 INFO L290 TraceCheckUtils]: 32: Hoare triple {31917#(< 14 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {31913#(< 12 main_~y~0)} is VALID [2022-04-28 03:55:09,286 INFO L290 TraceCheckUtils]: 31: Hoare triple {31921#(< 16 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {31917#(< 14 main_~y~0)} is VALID [2022-04-28 03:55:09,286 INFO L290 TraceCheckUtils]: 30: Hoare triple {31925#(< 18 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {31921#(< 16 main_~y~0)} is VALID [2022-04-28 03:55:09,287 INFO L290 TraceCheckUtils]: 29: Hoare triple {31929#(< 20 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {31925#(< 18 main_~y~0)} is VALID [2022-04-28 03:55:09,287 INFO L290 TraceCheckUtils]: 28: Hoare triple {31933#(< 22 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {31929#(< 20 main_~y~0)} is VALID [2022-04-28 03:55:09,287 INFO L290 TraceCheckUtils]: 27: Hoare triple {31937#(< 24 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {31933#(< 22 main_~y~0)} is VALID [2022-04-28 03:55:09,288 INFO L290 TraceCheckUtils]: 26: Hoare triple {31941#(< 26 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {31937#(< 24 main_~y~0)} is VALID [2022-04-28 03:55:09,288 INFO L290 TraceCheckUtils]: 25: Hoare triple {31945#(< 28 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {31941#(< 26 main_~y~0)} is VALID [2022-04-28 03:55:09,289 INFO L290 TraceCheckUtils]: 24: Hoare triple {31949#(< 30 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {31945#(< 28 main_~y~0)} is VALID [2022-04-28 03:55:09,289 INFO L290 TraceCheckUtils]: 23: Hoare triple {31953#(< 32 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {31949#(< 30 main_~y~0)} is VALID [2022-04-28 03:55:09,290 INFO L290 TraceCheckUtils]: 22: Hoare triple {31957#(< 34 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {31953#(< 32 main_~y~0)} is VALID [2022-04-28 03:55:09,290 INFO L290 TraceCheckUtils]: 21: Hoare triple {31961#(< 36 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {31957#(< 34 main_~y~0)} is VALID [2022-04-28 03:55:09,291 INFO L290 TraceCheckUtils]: 20: Hoare triple {31965#(< 38 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {31961#(< 36 main_~y~0)} is VALID [2022-04-28 03:55:09,291 INFO L290 TraceCheckUtils]: 19: Hoare triple {31969#(< 40 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {31965#(< 38 main_~y~0)} is VALID [2022-04-28 03:55:09,292 INFO L290 TraceCheckUtils]: 18: Hoare triple {31973#(< 42 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {31969#(< 40 main_~y~0)} is VALID [2022-04-28 03:55:09,292 INFO L290 TraceCheckUtils]: 17: Hoare triple {31977#(< 44 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {31973#(< 42 main_~y~0)} is VALID [2022-04-28 03:55:09,293 INFO L290 TraceCheckUtils]: 16: Hoare triple {31981#(< 46 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {31977#(< 44 main_~y~0)} is VALID [2022-04-28 03:55:09,293 INFO L290 TraceCheckUtils]: 15: Hoare triple {31985#(< 48 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {31981#(< 46 main_~y~0)} is VALID [2022-04-28 03:55:09,294 INFO L290 TraceCheckUtils]: 14: Hoare triple {31989#(< 50 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {31985#(< 48 main_~y~0)} is VALID [2022-04-28 03:55:09,294 INFO L290 TraceCheckUtils]: 13: Hoare triple {31993#(< 52 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {31989#(< 50 main_~y~0)} is VALID [2022-04-28 03:55:09,295 INFO L290 TraceCheckUtils]: 12: Hoare triple {31997#(< 54 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {31993#(< 52 main_~y~0)} is VALID [2022-04-28 03:55:09,295 INFO L290 TraceCheckUtils]: 11: Hoare triple {32001#(< 56 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {31997#(< 54 main_~y~0)} is VALID [2022-04-28 03:55:09,296 INFO L290 TraceCheckUtils]: 10: Hoare triple {32005#(< 58 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {32001#(< 56 main_~y~0)} is VALID [2022-04-28 03:55:09,296 INFO L290 TraceCheckUtils]: 9: Hoare triple {32005#(< 58 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[] {32005#(< 58 main_~y~0)} is VALID [2022-04-28 03:55:09,297 INFO L290 TraceCheckUtils]: 8: Hoare triple {32005#(< 58 main_~y~0)} [174] L11-2-->L18-1_primed: Formula: (let ((.cse0 (= |v_main_#t~post6_200| |v_main_#t~post6_199|)) (.cse4 (<= 50000 v_main_~x~0_1669)) (.cse1 (= v_main_~y~0_1829 v_main_~y~0_1828)) (.cse2 (= v_main_~x~0_1669 v_main_~x~0_1668)) (.cse3 (= |v_main_#t~post5_200| |v_main_#t~post5_199|))) (or (and .cse0 .cse1 .cse2 .cse3) (let ((.cse5 (+ v_main_~x~0_1669 v_main_~y~0_1828))) (and .cse4 (= .cse5 (+ v_main_~x~0_1668 v_main_~y~0_1829)) (< v_main_~y~0_1829 v_main_~y~0_1828) (< .cse5 (+ 1000001 v_main_~y~0_1829)))) (and .cse0 (or (not .cse4) (not (< v_main_~x~0_1669 1000000))) .cse1 .cse2 .cse3))) InVars {main_~y~0=v_main_~y~0_1829, main_#t~post5=|v_main_#t~post5_200|, main_~x~0=v_main_~x~0_1669, main_#t~post6=|v_main_#t~post6_200|} OutVars{main_~y~0=v_main_~y~0_1828, main_#t~post5=|v_main_#t~post5_199|, main_~x~0=v_main_~x~0_1668, main_#t~post6=|v_main_#t~post6_199|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {32005#(< 58 main_~y~0)} is VALID [2022-04-28 03:55:09,297 INFO L290 TraceCheckUtils]: 7: Hoare triple {32005#(< 58 main_~y~0)} [173] L18-1_primed-->L11-2: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {32005#(< 58 main_~y~0)} is VALID [2022-04-28 03:55:09,297 INFO L290 TraceCheckUtils]: 6: Hoare triple {32005#(< 58 main_~y~0)} [172] L11-2-->L18-1_primed: Formula: (let ((.cse0 (= |v_main_#t~post4_184| |v_main_#t~post4_183|)) (.cse1 (= v_main_~x~0_1667 v_main_~x~0_1666))) (or (and (< v_main_~x~0_1667 v_main_~x~0_1666) (< v_main_~x~0_1666 50001)) (and .cse0 .cse1) (and (not (< v_main_~x~0_1667 50000)) .cse0 .cse1))) InVars {main_~x~0=v_main_~x~0_1667, main_#t~post4=|v_main_#t~post4_184|} OutVars{main_~x~0=v_main_~x~0_1666, main_#t~post4=|v_main_#t~post4_183|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {32005#(< 58 main_~y~0)} is VALID [2022-04-28 03:55:09,298 INFO L290 TraceCheckUtils]: 5: Hoare triple {31709#true} ~x~0 := 0;~y~0 := 50000;~z~0 := 0;~x~0 := 0; {32005#(< 58 main_~y~0)} is VALID [2022-04-28 03:55:09,298 INFO L272 TraceCheckUtils]: 4: Hoare triple {31709#true} call #t~ret7 := main(); {31709#true} is VALID [2022-04-28 03:55:09,298 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {31709#true} {31709#true} #52#return; {31709#true} is VALID [2022-04-28 03:55:09,298 INFO L290 TraceCheckUtils]: 2: Hoare triple {31709#true} assume true; {31709#true} is VALID [2022-04-28 03:55:09,298 INFO L290 TraceCheckUtils]: 1: Hoare triple {31709#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); {31709#true} is VALID [2022-04-28 03:55:09,298 INFO L272 TraceCheckUtils]: 0: Hoare triple {31709#true} call ULTIMATE.init(); {31709#true} is VALID [2022-04-28 03:55:09,299 INFO L134 CoverageAnalysis]: Checked inductivity of 437 backedges. 0 proven. 435 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-04-28 03:55:09,299 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1102419238] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 03:55:09,299 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 03:55:09,299 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [33, 32, 32] total 63 [2022-04-28 03:55:11,552 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 03:55:11,552 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [7796985] [2022-04-28 03:55:11,552 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [7796985] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 03:55:11,552 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 03:55:11,552 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [88] imperfect sequences [] total 88 [2022-04-28 03:55:11,552 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1354220629] [2022-04-28 03:55:11,552 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 03:55:11,553 INFO L78 Accepts]: Start accepts. Automaton has has 88 states, 88 states have (on average 1.6477272727272727) internal successors, (145), 87 states have internal predecessors, (145), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 149 [2022-04-28 03:55:11,553 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 03:55:11,553 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 88 states, 88 states have (on average 1.6477272727272727) internal successors, (145), 87 states have internal predecessors, (145), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:55:11,651 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 149 edges. 149 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 03:55:11,651 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 88 states [2022-04-28 03:55:11,651 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 03:55:11,652 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 88 interpolants. [2022-04-28 03:55:11,653 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5357, Invalid=8449, Unknown=0, NotChecked=0, Total=13806 [2022-04-28 03:55:11,653 INFO L87 Difference]: Start difference. First operand 254 states and 258 transitions. Second operand has 88 states, 88 states have (on average 1.6477272727272727) internal successors, (145), 87 states have internal predecessors, (145), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:55:23,343 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:55:23,344 INFO L93 Difference]: Finished difference Result 401 states and 415 transitions. [2022-04-28 03:55:23,344 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 88 states. [2022-04-28 03:55:23,344 INFO L78 Accepts]: Start accepts. Automaton has has 88 states, 88 states have (on average 1.6477272727272727) internal successors, (145), 87 states have internal predecessors, (145), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 149 [2022-04-28 03:55:23,344 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 03:55:23,344 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 88 states, 88 states have (on average 1.6477272727272727) internal successors, (145), 87 states have internal predecessors, (145), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:55:23,345 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 173 transitions. [2022-04-28 03:55:23,345 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 88 states, 88 states have (on average 1.6477272727272727) internal successors, (145), 87 states have internal predecessors, (145), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:55:23,346 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 173 transitions. [2022-04-28 03:55:23,346 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 88 states and 173 transitions. [2022-04-28 03:55:23,475 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 173 edges. 173 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 03:55:23,478 INFO L225 Difference]: With dead ends: 401 [2022-04-28 03:55:23,478 INFO L226 Difference]: Without dead ends: 261 [2022-04-28 03:55:23,481 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 320 GetRequests, 118 SyntacticMatches, 1 SemanticMatches, 201 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11856 ImplicationChecksByTransitivity, 5.7s TimeCoverageRelationStatistics Valid=12525, Invalid=28481, Unknown=0, NotChecked=0, Total=41006 [2022-04-28 03:55:23,481 INFO L413 NwaCegarLoop]: 12 mSDtfsCounter, 291 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 6000 mSolverCounterSat, 327 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 291 SdHoareTripleChecker+Valid, 29 SdHoareTripleChecker+Invalid, 6327 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 327 IncrementalHoareTripleChecker+Valid, 6000 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.6s IncrementalHoareTripleChecker+Time [2022-04-28 03:55:23,481 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [291 Valid, 29 Invalid, 6327 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [327 Valid, 6000 Invalid, 0 Unknown, 0 Unchecked, 4.6s Time] [2022-04-28 03:55:23,483 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 261 states. [2022-04-28 03:55:23,724 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 261 to 155. [2022-04-28 03:55:23,724 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 03:55:23,725 INFO L82 GeneralOperation]: Start isEquivalent. First operand 261 states. Second operand has 155 states, 150 states have (on average 1.0266666666666666) internal successors, (154), 150 states have internal predecessors, (154), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:55:23,725 INFO L74 IsIncluded]: Start isIncluded. First operand 261 states. Second operand has 155 states, 150 states have (on average 1.0266666666666666) internal successors, (154), 150 states have internal predecessors, (154), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:55:23,725 INFO L87 Difference]: Start difference. First operand 261 states. Second operand has 155 states, 150 states have (on average 1.0266666666666666) internal successors, (154), 150 states have internal predecessors, (154), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:55:23,728 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:55:23,728 INFO L93 Difference]: Finished difference Result 261 states and 265 transitions. [2022-04-28 03:55:23,728 INFO L276 IsEmpty]: Start isEmpty. Operand 261 states and 265 transitions. [2022-04-28 03:55:23,729 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:55:23,729 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:55:23,729 INFO L74 IsIncluded]: Start isIncluded. First operand has 155 states, 150 states have (on average 1.0266666666666666) internal successors, (154), 150 states have internal predecessors, (154), 3 states have call successors, (3), 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 261 states. [2022-04-28 03:55:23,729 INFO L87 Difference]: Start difference. First operand has 155 states, 150 states have (on average 1.0266666666666666) internal successors, (154), 150 states have internal predecessors, (154), 3 states have call successors, (3), 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 261 states. [2022-04-28 03:55:23,732 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:55:23,732 INFO L93 Difference]: Finished difference Result 261 states and 265 transitions. [2022-04-28 03:55:23,732 INFO L276 IsEmpty]: Start isEmpty. Operand 261 states and 265 transitions. [2022-04-28 03:55:23,733 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:55:23,733 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:55:23,733 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 03:55:23,733 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 03:55:23,733 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 155 states, 150 states have (on average 1.0266666666666666) internal successors, (154), 150 states have internal predecessors, (154), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:55:23,735 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 155 states to 155 states and 158 transitions. [2022-04-28 03:55:23,735 INFO L78 Accepts]: Start accepts. Automaton has 155 states and 158 transitions. Word has length 149 [2022-04-28 03:55:23,735 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 03:55:23,735 INFO L495 AbstractCegarLoop]: Abstraction has 155 states and 158 transitions. [2022-04-28 03:55:23,735 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 88 states, 88 states have (on average 1.6477272727272727) internal successors, (145), 87 states have internal predecessors, (145), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:55:23,735 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 155 states and 158 transitions. [2022-04-28 03:55:23,872 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 158 edges. 158 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 03:55:23,873 INFO L276 IsEmpty]: Start isEmpty. Operand 155 states and 158 transitions. [2022-04-28 03:55:23,873 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 155 [2022-04-28 03:55:23,873 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 03:55:23,873 INFO L195 NwaCegarLoop]: trace histogram [56, 55, 30, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 03:55:23,889 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (30)] Forceful destruction successful, exit code 0 [2022-04-28 03:55:24,074 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31,30 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 03:55:24,074 INFO L420 AbstractCegarLoop]: === Iteration 33 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 03:55:24,074 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 03:55:24,074 INFO L85 PathProgramCache]: Analyzing trace with hash -1924538963, now seen corresponding path program 30 times [2022-04-28 03:55:24,074 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 03:55:24,074 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [127284606] [2022-04-28 03:55:28,135 WARN L977 rdanLoopAcceleration]: Unable to prove correctness of quantifier elimination. [2022-04-28 03:55:28,182 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 1 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 03:55:32,324 WARN L977 rdanLoopAcceleration]: Unable to prove correctness of quantifier elimination. [2022-04-28 03:55:32,432 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={1=1, 2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 03:55:32,433 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-28 03:55:32,435 INFO L85 PathProgramCache]: Analyzing trace with hash -222544415, now seen corresponding path program 1 times [2022-04-28 03:55:32,435 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 03:55:32,435 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [172329577] [2022-04-28 03:55:32,435 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:55:32,435 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 03:55:32,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:55:32,943 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 03:55:32,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:55:32,952 INFO L290 TraceCheckUtils]: 0: Hoare triple {33933#(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); {33897#true} is VALID [2022-04-28 03:55:32,952 INFO L290 TraceCheckUtils]: 1: Hoare triple {33897#true} assume true; {33897#true} is VALID [2022-04-28 03:55:32,952 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {33897#true} {33897#true} #52#return; {33897#true} is VALID [2022-04-28 03:55:32,952 INFO L272 TraceCheckUtils]: 0: Hoare triple {33897#true} call ULTIMATE.init(); {33933#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 03:55:32,952 INFO L290 TraceCheckUtils]: 1: Hoare triple {33933#(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); {33897#true} is VALID [2022-04-28 03:55:32,952 INFO L290 TraceCheckUtils]: 2: Hoare triple {33897#true} assume true; {33897#true} is VALID [2022-04-28 03:55:32,953 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {33897#true} {33897#true} #52#return; {33897#true} is VALID [2022-04-28 03:55:32,953 INFO L272 TraceCheckUtils]: 4: Hoare triple {33897#true} call #t~ret7 := main(); {33897#true} is VALID [2022-04-28 03:55:32,960 INFO L290 TraceCheckUtils]: 5: Hoare triple {33897#true} ~x~0 := 0;~y~0 := 50000;~z~0 := 0;~x~0 := 0; {33902#(<= 50000 main_~y~0)} is VALID [2022-04-28 03:55:32,961 INFO L290 TraceCheckUtils]: 6: Hoare triple {33902#(<= 50000 main_~y~0)} [176] L11-2-->L18-1_primed: Formula: (let ((.cse0 (= |v_main_#t~post4_190| |v_main_#t~post4_189|)) (.cse1 (= v_main_~x~0_1766 v_main_~x~0_1765))) (or (and .cse0 .cse1) (and (< v_main_~x~0_1765 50001) (< v_main_~x~0_1766 v_main_~x~0_1765)) (and (<= 50000 v_main_~x~0_1766) .cse0 .cse1))) InVars {main_~x~0=v_main_~x~0_1766, main_#t~post4=|v_main_#t~post4_190|} OutVars{main_~x~0=v_main_~x~0_1765, main_#t~post4=|v_main_#t~post4_189|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {33902#(<= 50000 main_~y~0)} is VALID [2022-04-28 03:55:32,961 INFO L290 TraceCheckUtils]: 7: Hoare triple {33902#(<= 50000 main_~y~0)} [177] L18-1_primed-->L11-2: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {33902#(<= 50000 main_~y~0)} is VALID [2022-04-28 03:55:32,962 INFO L290 TraceCheckUtils]: 8: Hoare triple {33902#(<= 50000 main_~y~0)} [178] L11-2-->L18-1_primed: Formula: (let ((.cse4 (<= 50000 v_main_~x~0_1768)) (.cse0 (= v_main_~x~0_1768 v_main_~x~0_1767)) (.cse1 (= |v_main_#t~post5_207| |v_main_#t~post5_206|)) (.cse2 (= |v_main_#t~post6_207| |v_main_#t~post6_206|)) (.cse3 (= v_main_~y~0_1949 v_main_~y~0_1948))) (or (and .cse0 .cse1 .cse2 .cse3 (or (not (< v_main_~x~0_1768 1000000)) (not .cse4))) (let ((.cse5 (+ v_main_~x~0_1768 v_main_~y~0_1948))) (and (< v_main_~y~0_1949 v_main_~y~0_1948) .cse4 (< .cse5 (+ 1000001 v_main_~y~0_1949)) (= .cse5 (+ v_main_~x~0_1767 v_main_~y~0_1949)))) (and .cse0 .cse1 .cse2 .cse3))) InVars {main_~y~0=v_main_~y~0_1949, main_#t~post5=|v_main_#t~post5_207|, main_~x~0=v_main_~x~0_1768, main_#t~post6=|v_main_#t~post6_207|} OutVars{main_~y~0=v_main_~y~0_1948, main_#t~post5=|v_main_#t~post5_206|, main_~x~0=v_main_~x~0_1767, main_#t~post6=|v_main_#t~post6_206|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {33902#(<= 50000 main_~y~0)} is VALID [2022-04-28 03:55:32,962 INFO L290 TraceCheckUtils]: 9: Hoare triple {33902#(<= 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[] {33902#(<= 50000 main_~y~0)} is VALID [2022-04-28 03:55:32,963 INFO L290 TraceCheckUtils]: 10: Hoare triple {33902#(<= 50000 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {33903#(<= 49998 main_~y~0)} is VALID [2022-04-28 03:55:32,963 INFO L290 TraceCheckUtils]: 11: Hoare triple {33903#(<= 49998 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {33904#(<= 49996 main_~y~0)} is VALID [2022-04-28 03:55:32,963 INFO L290 TraceCheckUtils]: 12: Hoare triple {33904#(<= 49996 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {33905#(<= 49994 main_~y~0)} is VALID [2022-04-28 03:55:32,964 INFO L290 TraceCheckUtils]: 13: Hoare triple {33905#(<= 49994 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {33906#(<= 49992 main_~y~0)} is VALID [2022-04-28 03:55:32,964 INFO L290 TraceCheckUtils]: 14: Hoare triple {33906#(<= 49992 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {33907#(<= 49990 main_~y~0)} is VALID [2022-04-28 03:55:32,965 INFO L290 TraceCheckUtils]: 15: Hoare triple {33907#(<= 49990 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {33908#(<= 49988 main_~y~0)} is VALID [2022-04-28 03:55:32,965 INFO L290 TraceCheckUtils]: 16: Hoare triple {33908#(<= 49988 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {33909#(<= 49986 main_~y~0)} is VALID [2022-04-28 03:55:32,966 INFO L290 TraceCheckUtils]: 17: Hoare triple {33909#(<= 49986 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {33910#(<= 49984 main_~y~0)} is VALID [2022-04-28 03:55:32,966 INFO L290 TraceCheckUtils]: 18: Hoare triple {33910#(<= 49984 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {33911#(<= 49982 main_~y~0)} is VALID [2022-04-28 03:55:32,966 INFO L290 TraceCheckUtils]: 19: Hoare triple {33911#(<= 49982 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {33912#(<= 49980 main_~y~0)} is VALID [2022-04-28 03:55:32,967 INFO L290 TraceCheckUtils]: 20: Hoare triple {33912#(<= 49980 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {33913#(<= 49978 main_~y~0)} is VALID [2022-04-28 03:55:32,967 INFO L290 TraceCheckUtils]: 21: Hoare triple {33913#(<= 49978 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {33914#(<= 49976 main_~y~0)} is VALID [2022-04-28 03:55:32,968 INFO L290 TraceCheckUtils]: 22: Hoare triple {33914#(<= 49976 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {33915#(<= 49974 main_~y~0)} is VALID [2022-04-28 03:55:32,968 INFO L290 TraceCheckUtils]: 23: Hoare triple {33915#(<= 49974 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {33916#(<= 49972 main_~y~0)} is VALID [2022-04-28 03:55:32,969 INFO L290 TraceCheckUtils]: 24: Hoare triple {33916#(<= 49972 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {33917#(<= 49970 main_~y~0)} is VALID [2022-04-28 03:55:32,969 INFO L290 TraceCheckUtils]: 25: Hoare triple {33917#(<= 49970 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {33918#(<= 49968 main_~y~0)} is VALID [2022-04-28 03:55:32,970 INFO L290 TraceCheckUtils]: 26: Hoare triple {33918#(<= 49968 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {33919#(<= 49966 main_~y~0)} is VALID [2022-04-28 03:55:32,970 INFO L290 TraceCheckUtils]: 27: Hoare triple {33919#(<= 49966 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {33920#(<= 49964 main_~y~0)} is VALID [2022-04-28 03:55:32,970 INFO L290 TraceCheckUtils]: 28: Hoare triple {33920#(<= 49964 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {33921#(<= 49962 main_~y~0)} is VALID [2022-04-28 03:55:32,971 INFO L290 TraceCheckUtils]: 29: Hoare triple {33921#(<= 49962 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {33922#(<= 49960 main_~y~0)} is VALID [2022-04-28 03:55:32,971 INFO L290 TraceCheckUtils]: 30: Hoare triple {33922#(<= 49960 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {33923#(<= 49958 main_~y~0)} is VALID [2022-04-28 03:55:32,972 INFO L290 TraceCheckUtils]: 31: Hoare triple {33923#(<= 49958 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {33924#(<= 49956 main_~y~0)} is VALID [2022-04-28 03:55:32,972 INFO L290 TraceCheckUtils]: 32: Hoare triple {33924#(<= 49956 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {33925#(<= 49954 main_~y~0)} is VALID [2022-04-28 03:55:32,973 INFO L290 TraceCheckUtils]: 33: Hoare triple {33925#(<= 49954 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {33926#(<= 49952 main_~y~0)} is VALID [2022-04-28 03:55:32,973 INFO L290 TraceCheckUtils]: 34: Hoare triple {33926#(<= 49952 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {33927#(<= 49950 main_~y~0)} is VALID [2022-04-28 03:55:32,973 INFO L290 TraceCheckUtils]: 35: Hoare triple {33927#(<= 49950 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {33928#(<= 49948 main_~y~0)} is VALID [2022-04-28 03:55:32,974 INFO L290 TraceCheckUtils]: 36: Hoare triple {33928#(<= 49948 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {33929#(<= 49946 main_~y~0)} is VALID [2022-04-28 03:55:32,974 INFO L290 TraceCheckUtils]: 37: Hoare triple {33929#(<= 49946 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {33930#(<= 49944 main_~y~0)} is VALID [2022-04-28 03:55:32,975 INFO L290 TraceCheckUtils]: 38: Hoare triple {33930#(<= 49944 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {33931#(<= 49942 main_~y~0)} is VALID [2022-04-28 03:55:32,975 INFO L290 TraceCheckUtils]: 39: Hoare triple {33931#(<= 49942 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {33932#(<= 49940 main_~y~0)} is VALID [2022-04-28 03:55:32,976 INFO L290 TraceCheckUtils]: 40: Hoare triple {33932#(<= 49940 main_~y~0)} assume !(~y~0 > 0); {33898#false} is VALID [2022-04-28 03:55:32,976 INFO L272 TraceCheckUtils]: 41: Hoare triple {33898#false} call __VERIFIER_assert((if ~z~0 == ~x~0 then 1 else 0)); {33898#false} is VALID [2022-04-28 03:55:32,976 INFO L290 TraceCheckUtils]: 42: Hoare triple {33898#false} ~cond := #in~cond; {33898#false} is VALID [2022-04-28 03:55:32,976 INFO L290 TraceCheckUtils]: 43: Hoare triple {33898#false} assume 0 == ~cond; {33898#false} is VALID [2022-04-28 03:55:32,976 INFO L290 TraceCheckUtils]: 44: Hoare triple {33898#false} assume !false; {33898#false} is VALID [2022-04-28 03:55:32,976 INFO L134 CoverageAnalysis]: Checked inductivity of 467 backedges. 0 proven. 465 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-04-28 03:55:32,976 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 03:55:32,976 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [172329577] [2022-04-28 03:55:32,976 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [172329577] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 03:55:32,976 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1951045221] [2022-04-28 03:55:32,976 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:55:32,977 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 03:55:32,977 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 03:55:32,977 INFO L229 MonitoredProcess]: Starting monitored process 31 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 03:55:32,978 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (31)] Waiting until timeout for monitored process [2022-04-28 03:55:33,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:55:33,025 INFO L263 TraceCheckSpWp]: Trace formula consists of 209 conjuncts, 33 conjunts are in the unsatisfiable core [2022-04-28 03:55:33,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:55:33,041 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 03:55:33,494 INFO L272 TraceCheckUtils]: 0: Hoare triple {33897#true} call ULTIMATE.init(); {33897#true} is VALID [2022-04-28 03:55:33,494 INFO L290 TraceCheckUtils]: 1: Hoare triple {33897#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); {33897#true} is VALID [2022-04-28 03:55:33,494 INFO L290 TraceCheckUtils]: 2: Hoare triple {33897#true} assume true; {33897#true} is VALID [2022-04-28 03:55:33,494 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {33897#true} {33897#true} #52#return; {33897#true} is VALID [2022-04-28 03:55:33,494 INFO L272 TraceCheckUtils]: 4: Hoare triple {33897#true} call #t~ret7 := main(); {33897#true} is VALID [2022-04-28 03:55:33,494 INFO L290 TraceCheckUtils]: 5: Hoare triple {33897#true} ~x~0 := 0;~y~0 := 50000;~z~0 := 0;~x~0 := 0; {33902#(<= 50000 main_~y~0)} is VALID [2022-04-28 03:55:33,494 INFO L290 TraceCheckUtils]: 6: Hoare triple {33902#(<= 50000 main_~y~0)} [176] L11-2-->L18-1_primed: Formula: (let ((.cse0 (= |v_main_#t~post4_190| |v_main_#t~post4_189|)) (.cse1 (= v_main_~x~0_1766 v_main_~x~0_1765))) (or (and .cse0 .cse1) (and (< v_main_~x~0_1765 50001) (< v_main_~x~0_1766 v_main_~x~0_1765)) (and (<= 50000 v_main_~x~0_1766) .cse0 .cse1))) InVars {main_~x~0=v_main_~x~0_1766, main_#t~post4=|v_main_#t~post4_190|} OutVars{main_~x~0=v_main_~x~0_1765, main_#t~post4=|v_main_#t~post4_189|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {33902#(<= 50000 main_~y~0)} is VALID [2022-04-28 03:55:33,495 INFO L290 TraceCheckUtils]: 7: Hoare triple {33902#(<= 50000 main_~y~0)} [177] L18-1_primed-->L11-2: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {33902#(<= 50000 main_~y~0)} is VALID [2022-04-28 03:55:33,496 INFO L290 TraceCheckUtils]: 8: Hoare triple {33902#(<= 50000 main_~y~0)} [178] L11-2-->L18-1_primed: Formula: (let ((.cse4 (<= 50000 v_main_~x~0_1768)) (.cse0 (= v_main_~x~0_1768 v_main_~x~0_1767)) (.cse1 (= |v_main_#t~post5_207| |v_main_#t~post5_206|)) (.cse2 (= |v_main_#t~post6_207| |v_main_#t~post6_206|)) (.cse3 (= v_main_~y~0_1949 v_main_~y~0_1948))) (or (and .cse0 .cse1 .cse2 .cse3 (or (not (< v_main_~x~0_1768 1000000)) (not .cse4))) (let ((.cse5 (+ v_main_~x~0_1768 v_main_~y~0_1948))) (and (< v_main_~y~0_1949 v_main_~y~0_1948) .cse4 (< .cse5 (+ 1000001 v_main_~y~0_1949)) (= .cse5 (+ v_main_~x~0_1767 v_main_~y~0_1949)))) (and .cse0 .cse1 .cse2 .cse3))) InVars {main_~y~0=v_main_~y~0_1949, main_#t~post5=|v_main_#t~post5_207|, main_~x~0=v_main_~x~0_1768, main_#t~post6=|v_main_#t~post6_207|} OutVars{main_~y~0=v_main_~y~0_1948, main_#t~post5=|v_main_#t~post5_206|, main_~x~0=v_main_~x~0_1767, main_#t~post6=|v_main_#t~post6_206|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {33902#(<= 50000 main_~y~0)} is VALID [2022-04-28 03:55:33,496 INFO L290 TraceCheckUtils]: 9: Hoare triple {33902#(<= 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[] {33902#(<= 50000 main_~y~0)} is VALID [2022-04-28 03:55:33,496 INFO L290 TraceCheckUtils]: 10: Hoare triple {33902#(<= 50000 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {33903#(<= 49998 main_~y~0)} is VALID [2022-04-28 03:55:33,497 INFO L290 TraceCheckUtils]: 11: Hoare triple {33903#(<= 49998 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {33904#(<= 49996 main_~y~0)} is VALID [2022-04-28 03:55:33,497 INFO L290 TraceCheckUtils]: 12: Hoare triple {33904#(<= 49996 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {33905#(<= 49994 main_~y~0)} is VALID [2022-04-28 03:55:33,498 INFO L290 TraceCheckUtils]: 13: Hoare triple {33905#(<= 49994 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {33906#(<= 49992 main_~y~0)} is VALID [2022-04-28 03:55:33,498 INFO L290 TraceCheckUtils]: 14: Hoare triple {33906#(<= 49992 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {33907#(<= 49990 main_~y~0)} is VALID [2022-04-28 03:55:33,498 INFO L290 TraceCheckUtils]: 15: Hoare triple {33907#(<= 49990 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {33908#(<= 49988 main_~y~0)} is VALID [2022-04-28 03:55:33,499 INFO L290 TraceCheckUtils]: 16: Hoare triple {33908#(<= 49988 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {33909#(<= 49986 main_~y~0)} is VALID [2022-04-28 03:55:33,499 INFO L290 TraceCheckUtils]: 17: Hoare triple {33909#(<= 49986 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {33910#(<= 49984 main_~y~0)} is VALID [2022-04-28 03:55:33,500 INFO L290 TraceCheckUtils]: 18: Hoare triple {33910#(<= 49984 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {33911#(<= 49982 main_~y~0)} is VALID [2022-04-28 03:55:33,500 INFO L290 TraceCheckUtils]: 19: Hoare triple {33911#(<= 49982 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {33912#(<= 49980 main_~y~0)} is VALID [2022-04-28 03:55:33,500 INFO L290 TraceCheckUtils]: 20: Hoare triple {33912#(<= 49980 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {33913#(<= 49978 main_~y~0)} is VALID [2022-04-28 03:55:33,501 INFO L290 TraceCheckUtils]: 21: Hoare triple {33913#(<= 49978 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {33914#(<= 49976 main_~y~0)} is VALID [2022-04-28 03:55:33,501 INFO L290 TraceCheckUtils]: 22: Hoare triple {33914#(<= 49976 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {33915#(<= 49974 main_~y~0)} is VALID [2022-04-28 03:55:33,502 INFO L290 TraceCheckUtils]: 23: Hoare triple {33915#(<= 49974 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {33916#(<= 49972 main_~y~0)} is VALID [2022-04-28 03:55:33,502 INFO L290 TraceCheckUtils]: 24: Hoare triple {33916#(<= 49972 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {33917#(<= 49970 main_~y~0)} is VALID [2022-04-28 03:55:33,502 INFO L290 TraceCheckUtils]: 25: Hoare triple {33917#(<= 49970 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {33918#(<= 49968 main_~y~0)} is VALID [2022-04-28 03:55:33,503 INFO L290 TraceCheckUtils]: 26: Hoare triple {33918#(<= 49968 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {33919#(<= 49966 main_~y~0)} is VALID [2022-04-28 03:55:33,503 INFO L290 TraceCheckUtils]: 27: Hoare triple {33919#(<= 49966 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {33920#(<= 49964 main_~y~0)} is VALID [2022-04-28 03:55:33,504 INFO L290 TraceCheckUtils]: 28: Hoare triple {33920#(<= 49964 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {33921#(<= 49962 main_~y~0)} is VALID [2022-04-28 03:55:33,504 INFO L290 TraceCheckUtils]: 29: Hoare triple {33921#(<= 49962 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {33922#(<= 49960 main_~y~0)} is VALID [2022-04-28 03:55:33,505 INFO L290 TraceCheckUtils]: 30: Hoare triple {33922#(<= 49960 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {33923#(<= 49958 main_~y~0)} is VALID [2022-04-28 03:55:33,505 INFO L290 TraceCheckUtils]: 31: Hoare triple {33923#(<= 49958 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {33924#(<= 49956 main_~y~0)} is VALID [2022-04-28 03:55:33,505 INFO L290 TraceCheckUtils]: 32: Hoare triple {33924#(<= 49956 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {33925#(<= 49954 main_~y~0)} is VALID [2022-04-28 03:55:33,506 INFO L290 TraceCheckUtils]: 33: Hoare triple {33925#(<= 49954 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {33926#(<= 49952 main_~y~0)} is VALID [2022-04-28 03:55:33,506 INFO L290 TraceCheckUtils]: 34: Hoare triple {33926#(<= 49952 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {33927#(<= 49950 main_~y~0)} is VALID [2022-04-28 03:55:33,507 INFO L290 TraceCheckUtils]: 35: Hoare triple {33927#(<= 49950 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {33928#(<= 49948 main_~y~0)} is VALID [2022-04-28 03:55:33,507 INFO L290 TraceCheckUtils]: 36: Hoare triple {33928#(<= 49948 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {33929#(<= 49946 main_~y~0)} is VALID [2022-04-28 03:55:33,507 INFO L290 TraceCheckUtils]: 37: Hoare triple {33929#(<= 49946 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {33930#(<= 49944 main_~y~0)} is VALID [2022-04-28 03:55:33,508 INFO L290 TraceCheckUtils]: 38: Hoare triple {33930#(<= 49944 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {33931#(<= 49942 main_~y~0)} is VALID [2022-04-28 03:55:33,508 INFO L290 TraceCheckUtils]: 39: Hoare triple {33931#(<= 49942 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {33932#(<= 49940 main_~y~0)} is VALID [2022-04-28 03:55:33,509 INFO L290 TraceCheckUtils]: 40: Hoare triple {33932#(<= 49940 main_~y~0)} assume !(~y~0 > 0); {33898#false} is VALID [2022-04-28 03:55:33,509 INFO L272 TraceCheckUtils]: 41: Hoare triple {33898#false} call __VERIFIER_assert((if ~z~0 == ~x~0 then 1 else 0)); {33898#false} is VALID [2022-04-28 03:55:33,509 INFO L290 TraceCheckUtils]: 42: Hoare triple {33898#false} ~cond := #in~cond; {33898#false} is VALID [2022-04-28 03:55:33,509 INFO L290 TraceCheckUtils]: 43: Hoare triple {33898#false} assume 0 == ~cond; {33898#false} is VALID [2022-04-28 03:55:33,509 INFO L290 TraceCheckUtils]: 44: Hoare triple {33898#false} assume !false; {33898#false} is VALID [2022-04-28 03:55:33,509 INFO L134 CoverageAnalysis]: Checked inductivity of 467 backedges. 0 proven. 465 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-04-28 03:55:33,509 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 03:55:34,857 INFO L290 TraceCheckUtils]: 44: Hoare triple {33898#false} assume !false; {33898#false} is VALID [2022-04-28 03:55:34,857 INFO L290 TraceCheckUtils]: 43: Hoare triple {33898#false} assume 0 == ~cond; {33898#false} is VALID [2022-04-28 03:55:34,857 INFO L290 TraceCheckUtils]: 42: Hoare triple {33898#false} ~cond := #in~cond; {33898#false} is VALID [2022-04-28 03:55:34,857 INFO L272 TraceCheckUtils]: 41: Hoare triple {33898#false} call __VERIFIER_assert((if ~z~0 == ~x~0 then 1 else 0)); {33898#false} is VALID [2022-04-28 03:55:34,857 INFO L290 TraceCheckUtils]: 40: Hoare triple {34081#(< 0 main_~y~0)} assume !(~y~0 > 0); {33898#false} is VALID [2022-04-28 03:55:34,858 INFO L290 TraceCheckUtils]: 39: Hoare triple {34085#(< 2 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {34081#(< 0 main_~y~0)} is VALID [2022-04-28 03:55:34,858 INFO L290 TraceCheckUtils]: 38: Hoare triple {34089#(< 4 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {34085#(< 2 main_~y~0)} is VALID [2022-04-28 03:55:34,858 INFO L290 TraceCheckUtils]: 37: Hoare triple {34093#(< 6 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {34089#(< 4 main_~y~0)} is VALID [2022-04-28 03:55:34,859 INFO L290 TraceCheckUtils]: 36: Hoare triple {34097#(< 8 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {34093#(< 6 main_~y~0)} is VALID [2022-04-28 03:55:34,859 INFO L290 TraceCheckUtils]: 35: Hoare triple {34101#(< 10 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {34097#(< 8 main_~y~0)} is VALID [2022-04-28 03:55:34,860 INFO L290 TraceCheckUtils]: 34: Hoare triple {34105#(< 12 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {34101#(< 10 main_~y~0)} is VALID [2022-04-28 03:55:34,860 INFO L290 TraceCheckUtils]: 33: Hoare triple {34109#(< 14 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {34105#(< 12 main_~y~0)} is VALID [2022-04-28 03:55:34,860 INFO L290 TraceCheckUtils]: 32: Hoare triple {34113#(< 16 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {34109#(< 14 main_~y~0)} is VALID [2022-04-28 03:55:34,861 INFO L290 TraceCheckUtils]: 31: Hoare triple {34117#(< 18 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {34113#(< 16 main_~y~0)} is VALID [2022-04-28 03:55:34,861 INFO L290 TraceCheckUtils]: 30: Hoare triple {34121#(< 20 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {34117#(< 18 main_~y~0)} is VALID [2022-04-28 03:55:34,862 INFO L290 TraceCheckUtils]: 29: Hoare triple {34125#(< 22 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {34121#(< 20 main_~y~0)} is VALID [2022-04-28 03:55:34,862 INFO L290 TraceCheckUtils]: 28: Hoare triple {34129#(< 24 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {34125#(< 22 main_~y~0)} is VALID [2022-04-28 03:55:34,862 INFO L290 TraceCheckUtils]: 27: Hoare triple {34133#(< 26 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {34129#(< 24 main_~y~0)} is VALID [2022-04-28 03:55:34,863 INFO L290 TraceCheckUtils]: 26: Hoare triple {34137#(< 28 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {34133#(< 26 main_~y~0)} is VALID [2022-04-28 03:55:34,863 INFO L290 TraceCheckUtils]: 25: Hoare triple {34141#(< 30 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {34137#(< 28 main_~y~0)} is VALID [2022-04-28 03:55:34,864 INFO L290 TraceCheckUtils]: 24: Hoare triple {34145#(< 32 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {34141#(< 30 main_~y~0)} is VALID [2022-04-28 03:55:34,864 INFO L290 TraceCheckUtils]: 23: Hoare triple {34149#(< 34 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {34145#(< 32 main_~y~0)} is VALID [2022-04-28 03:55:34,864 INFO L290 TraceCheckUtils]: 22: Hoare triple {34153#(< 36 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {34149#(< 34 main_~y~0)} is VALID [2022-04-28 03:55:34,865 INFO L290 TraceCheckUtils]: 21: Hoare triple {34157#(< 38 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {34153#(< 36 main_~y~0)} is VALID [2022-04-28 03:55:34,865 INFO L290 TraceCheckUtils]: 20: Hoare triple {34161#(< 40 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {34157#(< 38 main_~y~0)} is VALID [2022-04-28 03:55:34,866 INFO L290 TraceCheckUtils]: 19: Hoare triple {34165#(< 42 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {34161#(< 40 main_~y~0)} is VALID [2022-04-28 03:55:34,866 INFO L290 TraceCheckUtils]: 18: Hoare triple {34169#(< 44 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {34165#(< 42 main_~y~0)} is VALID [2022-04-28 03:55:34,866 INFO L290 TraceCheckUtils]: 17: Hoare triple {34173#(< 46 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {34169#(< 44 main_~y~0)} is VALID [2022-04-28 03:55:34,867 INFO L290 TraceCheckUtils]: 16: Hoare triple {34177#(< 48 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {34173#(< 46 main_~y~0)} is VALID [2022-04-28 03:55:34,867 INFO L290 TraceCheckUtils]: 15: Hoare triple {34181#(< 50 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {34177#(< 48 main_~y~0)} is VALID [2022-04-28 03:55:34,868 INFO L290 TraceCheckUtils]: 14: Hoare triple {34185#(< 52 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {34181#(< 50 main_~y~0)} is VALID [2022-04-28 03:55:34,868 INFO L290 TraceCheckUtils]: 13: Hoare triple {34189#(< 54 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {34185#(< 52 main_~y~0)} is VALID [2022-04-28 03:55:34,868 INFO L290 TraceCheckUtils]: 12: Hoare triple {34193#(< 56 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {34189#(< 54 main_~y~0)} is VALID [2022-04-28 03:55:34,869 INFO L290 TraceCheckUtils]: 11: Hoare triple {34197#(< 58 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {34193#(< 56 main_~y~0)} is VALID [2022-04-28 03:55:34,869 INFO L290 TraceCheckUtils]: 10: Hoare triple {34201#(< 60 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {34197#(< 58 main_~y~0)} is VALID [2022-04-28 03:55:34,870 INFO L290 TraceCheckUtils]: 9: Hoare triple {34201#(< 60 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[] {34201#(< 60 main_~y~0)} is VALID [2022-04-28 03:55:34,870 INFO L290 TraceCheckUtils]: 8: Hoare triple {34201#(< 60 main_~y~0)} [178] L11-2-->L18-1_primed: Formula: (let ((.cse4 (<= 50000 v_main_~x~0_1768)) (.cse0 (= v_main_~x~0_1768 v_main_~x~0_1767)) (.cse1 (= |v_main_#t~post5_207| |v_main_#t~post5_206|)) (.cse2 (= |v_main_#t~post6_207| |v_main_#t~post6_206|)) (.cse3 (= v_main_~y~0_1949 v_main_~y~0_1948))) (or (and .cse0 .cse1 .cse2 .cse3 (or (not (< v_main_~x~0_1768 1000000)) (not .cse4))) (let ((.cse5 (+ v_main_~x~0_1768 v_main_~y~0_1948))) (and (< v_main_~y~0_1949 v_main_~y~0_1948) .cse4 (< .cse5 (+ 1000001 v_main_~y~0_1949)) (= .cse5 (+ v_main_~x~0_1767 v_main_~y~0_1949)))) (and .cse0 .cse1 .cse2 .cse3))) InVars {main_~y~0=v_main_~y~0_1949, main_#t~post5=|v_main_#t~post5_207|, main_~x~0=v_main_~x~0_1768, main_#t~post6=|v_main_#t~post6_207|} OutVars{main_~y~0=v_main_~y~0_1948, main_#t~post5=|v_main_#t~post5_206|, main_~x~0=v_main_~x~0_1767, main_#t~post6=|v_main_#t~post6_206|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {34201#(< 60 main_~y~0)} is VALID [2022-04-28 03:55:34,871 INFO L290 TraceCheckUtils]: 7: Hoare triple {34201#(< 60 main_~y~0)} [177] L18-1_primed-->L11-2: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {34201#(< 60 main_~y~0)} is VALID [2022-04-28 03:55:34,871 INFO L290 TraceCheckUtils]: 6: Hoare triple {34201#(< 60 main_~y~0)} [176] L11-2-->L18-1_primed: Formula: (let ((.cse0 (= |v_main_#t~post4_190| |v_main_#t~post4_189|)) (.cse1 (= v_main_~x~0_1766 v_main_~x~0_1765))) (or (and .cse0 .cse1) (and (< v_main_~x~0_1765 50001) (< v_main_~x~0_1766 v_main_~x~0_1765)) (and (<= 50000 v_main_~x~0_1766) .cse0 .cse1))) InVars {main_~x~0=v_main_~x~0_1766, main_#t~post4=|v_main_#t~post4_190|} OutVars{main_~x~0=v_main_~x~0_1765, main_#t~post4=|v_main_#t~post4_189|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {34201#(< 60 main_~y~0)} is VALID [2022-04-28 03:55:34,871 INFO L290 TraceCheckUtils]: 5: Hoare triple {33897#true} ~x~0 := 0;~y~0 := 50000;~z~0 := 0;~x~0 := 0; {34201#(< 60 main_~y~0)} is VALID [2022-04-28 03:55:34,871 INFO L272 TraceCheckUtils]: 4: Hoare triple {33897#true} call #t~ret7 := main(); {33897#true} is VALID [2022-04-28 03:55:34,871 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {33897#true} {33897#true} #52#return; {33897#true} is VALID [2022-04-28 03:55:34,871 INFO L290 TraceCheckUtils]: 2: Hoare triple {33897#true} assume true; {33897#true} is VALID [2022-04-28 03:55:34,871 INFO L290 TraceCheckUtils]: 1: Hoare triple {33897#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); {33897#true} is VALID [2022-04-28 03:55:34,871 INFO L272 TraceCheckUtils]: 0: Hoare triple {33897#true} call ULTIMATE.init(); {33897#true} is VALID [2022-04-28 03:55:34,872 INFO L134 CoverageAnalysis]: Checked inductivity of 467 backedges. 0 proven. 465 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-04-28 03:55:34,872 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1951045221] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 03:55:34,872 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 03:55:34,872 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [34, 33, 33] total 65 [2022-04-28 03:55:37,197 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 03:55:37,197 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [127284606] [2022-04-28 03:55:37,197 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [127284606] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 03:55:37,197 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 03:55:37,197 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [91] imperfect sequences [] total 91 [2022-04-28 03:55:37,197 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1960410994] [2022-04-28 03:55:37,197 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 03:55:37,198 INFO L78 Accepts]: Start accepts. Automaton has has 91 states, 91 states have (on average 1.6483516483516483) internal successors, (150), 90 states have internal predecessors, (150), 2 states have call successors, (3), 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 154 [2022-04-28 03:55:37,198 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 03:55:37,199 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 91 states, 91 states have (on average 1.6483516483516483) internal successors, (150), 90 states have internal predecessors, (150), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:55:37,314 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 154 edges. 154 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 03:55:37,314 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 91 states [2022-04-28 03:55:37,314 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 03:55:37,315 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 91 interpolants. [2022-04-28 03:55:37,316 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5722, Invalid=9040, Unknown=0, NotChecked=0, Total=14762 [2022-04-28 03:55:37,316 INFO L87 Difference]: Start difference. First operand 155 states and 158 transitions. Second operand has 91 states, 91 states have (on average 1.6483516483516483) internal successors, (150), 90 states have internal predecessors, (150), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:55:49,906 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:55:49,906 INFO L93 Difference]: Finished difference Result 307 states and 318 transitions. [2022-04-28 03:55:49,906 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 91 states. [2022-04-28 03:55:49,907 INFO L78 Accepts]: Start accepts. Automaton has has 91 states, 91 states have (on average 1.6483516483516483) internal successors, (150), 90 states have internal predecessors, (150), 2 states have call successors, (3), 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 154 [2022-04-28 03:55:49,907 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 03:55:49,907 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 91 states, 91 states have (on average 1.6483516483516483) internal successors, (150), 90 states have internal predecessors, (150), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:55:49,908 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 176 transitions. [2022-04-28 03:55:49,908 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 91 states, 91 states have (on average 1.6483516483516483) internal successors, (150), 90 states have internal predecessors, (150), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:55:49,909 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 176 transitions. [2022-04-28 03:55:49,909 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 91 states and 176 transitions. [2022-04-28 03:55:50,042 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 176 edges. 176 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 03:55:50,044 INFO L225 Difference]: With dead ends: 307 [2022-04-28 03:55:50,044 INFO L226 Difference]: Without dead ends: 160 [2022-04-28 03:55:50,047 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 330 GetRequests, 121 SyntacticMatches, 1 SemanticMatches, 208 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12700 ImplicationChecksByTransitivity, 5.9s TimeCoverageRelationStatistics Valid=13378, Invalid=30512, Unknown=0, NotChecked=0, Total=43890 [2022-04-28 03:55:50,047 INFO L413 NwaCegarLoop]: 12 mSDtfsCounter, 302 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 6492 mSolverCounterSat, 396 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 302 SdHoareTripleChecker+Valid, 34 SdHoareTripleChecker+Invalid, 6888 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 396 IncrementalHoareTripleChecker+Valid, 6492 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.1s IncrementalHoareTripleChecker+Time [2022-04-28 03:55:50,047 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [302 Valid, 34 Invalid, 6888 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [396 Valid, 6492 Invalid, 0 Unknown, 0 Unchecked, 5.1s Time] [2022-04-28 03:55:50,048 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 160 states. [2022-04-28 03:55:50,287 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 160 to 160. [2022-04-28 03:55:50,287 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 03:55:50,287 INFO L82 GeneralOperation]: Start isEquivalent. First operand 160 states. Second operand has 160 states, 155 states have (on average 1.0258064516129033) internal successors, (159), 155 states have internal predecessors, (159), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:55:50,288 INFO L74 IsIncluded]: Start isIncluded. First operand 160 states. Second operand has 160 states, 155 states have (on average 1.0258064516129033) internal successors, (159), 155 states have internal predecessors, (159), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:55:50,288 INFO L87 Difference]: Start difference. First operand 160 states. Second operand has 160 states, 155 states have (on average 1.0258064516129033) internal successors, (159), 155 states have internal predecessors, (159), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:55:50,289 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:55:50,289 INFO L93 Difference]: Finished difference Result 160 states and 163 transitions. [2022-04-28 03:55:50,289 INFO L276 IsEmpty]: Start isEmpty. Operand 160 states and 163 transitions. [2022-04-28 03:55:50,289 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:55:50,289 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:55:50,289 INFO L74 IsIncluded]: Start isIncluded. First operand has 160 states, 155 states have (on average 1.0258064516129033) internal successors, (159), 155 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 160 states. [2022-04-28 03:55:50,290 INFO L87 Difference]: Start difference. First operand has 160 states, 155 states have (on average 1.0258064516129033) internal successors, (159), 155 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 160 states. [2022-04-28 03:55:50,291 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:55:50,291 INFO L93 Difference]: Finished difference Result 160 states and 163 transitions. [2022-04-28 03:55:50,291 INFO L276 IsEmpty]: Start isEmpty. Operand 160 states and 163 transitions. [2022-04-28 03:55:50,291 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:55:50,291 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:55:50,291 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 03:55:50,291 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 03:55:50,291 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 160 states, 155 states have (on average 1.0258064516129033) internal successors, (159), 155 states have internal predecessors, (159), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:55:50,293 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 160 states to 160 states and 163 transitions. [2022-04-28 03:55:50,293 INFO L78 Accepts]: Start accepts. Automaton has 160 states and 163 transitions. Word has length 154 [2022-04-28 03:55:50,293 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 03:55:50,293 INFO L495 AbstractCegarLoop]: Abstraction has 160 states and 163 transitions. [2022-04-28 03:55:50,293 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 91 states, 91 states have (on average 1.6483516483516483) internal successors, (150), 90 states have internal predecessors, (150), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:55:50,293 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 160 states and 163 transitions. [2022-04-28 03:55:50,424 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 163 edges. 163 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 03:55:50,424 INFO L276 IsEmpty]: Start isEmpty. Operand 160 states and 163 transitions. [2022-04-28 03:55:50,425 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 160 [2022-04-28 03:55:50,425 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 03:55:50,425 INFO L195 NwaCegarLoop]: trace histogram [58, 57, 31, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 03:55:50,441 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (31)] Forceful destruction successful, exit code 0 [2022-04-28 03:55:50,625 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 31 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable32 [2022-04-28 03:55:50,625 INFO L420 AbstractCegarLoop]: === Iteration 34 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 03:55:50,626 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 03:55:50,626 INFO L85 PathProgramCache]: Analyzing trace with hash 1944213324, now seen corresponding path program 31 times [2022-04-28 03:55:50,626 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 03:55:50,626 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1084687139] [2022-04-28 03:55:50,711 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 1 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 03:55:54,831 WARN L977 rdanLoopAcceleration]: Unable to prove correctness of quantifier elimination. [2022-04-28 03:55:54,932 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={1=1, 2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 03:55:54,934 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-28 03:55:54,936 INFO L85 PathProgramCache]: Analyzing trace with hash -1152441694, now seen corresponding path program 1 times [2022-04-28 03:55:54,936 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 03:55:54,936 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1421892] [2022-04-28 03:55:54,936 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:55:54,936 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 03:55:54,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:55:55,507 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 03:55:55,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:55:55,512 INFO L290 TraceCheckUtils]: 0: Hoare triple {35761#(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); {35721#true} is VALID [2022-04-28 03:55:55,512 INFO L290 TraceCheckUtils]: 1: Hoare triple {35721#true} assume true; {35721#true} is VALID [2022-04-28 03:55:55,513 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {35721#true} {35721#true} #52#return; {35721#true} is VALID [2022-04-28 03:55:55,513 INFO L272 TraceCheckUtils]: 0: Hoare triple {35721#true} call ULTIMATE.init(); {35761#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 03:55:55,513 INFO L290 TraceCheckUtils]: 1: Hoare triple {35761#(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); {35721#true} is VALID [2022-04-28 03:55:55,513 INFO L290 TraceCheckUtils]: 2: Hoare triple {35721#true} assume true; {35721#true} is VALID [2022-04-28 03:55:55,513 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {35721#true} {35721#true} #52#return; {35721#true} is VALID [2022-04-28 03:55:55,513 INFO L272 TraceCheckUtils]: 4: Hoare triple {35721#true} call #t~ret7 := main(); {35721#true} is VALID [2022-04-28 03:55:55,524 INFO L290 TraceCheckUtils]: 5: Hoare triple {35721#true} ~x~0 := 0;~y~0 := 50000;~z~0 := 0;~x~0 := 0; {35726#(and (= main_~x~0 0) (<= 50000 main_~y~0))} is VALID [2022-04-28 03:55:55,524 INFO L290 TraceCheckUtils]: 6: Hoare triple {35726#(and (= main_~x~0 0) (<= 50000 main_~y~0))} [180] L11-2-->L18-1_primed: Formula: (let ((.cse0 (= |v_main_#t~post4_196| |v_main_#t~post4_195|)) (.cse1 (= v_main_~x~0_1868 v_main_~x~0_1867))) (or (and (< v_main_~x~0_1868 v_main_~x~0_1867) (< v_main_~x~0_1867 50001)) (and .cse0 .cse1) (and .cse0 .cse1 (<= 50000 v_main_~x~0_1868)))) InVars {main_~x~0=v_main_~x~0_1868, main_#t~post4=|v_main_#t~post4_196|} OutVars{main_~x~0=v_main_~x~0_1867, main_#t~post4=|v_main_#t~post4_195|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {35727#(and (<= main_~x~0 main_~y~0) (<= 50000 main_~y~0))} is VALID [2022-04-28 03:55:55,525 INFO L290 TraceCheckUtils]: 7: Hoare triple {35727#(and (<= main_~x~0 main_~y~0) (<= 50000 main_~y~0))} [181] L18-1_primed-->L11-2: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {35727#(and (<= main_~x~0 main_~y~0) (<= 50000 main_~y~0))} is VALID [2022-04-28 03:55:55,525 INFO L290 TraceCheckUtils]: 8: Hoare triple {35727#(and (<= main_~x~0 main_~y~0) (<= 50000 main_~y~0))} [182] L11-2-->L18-1_primed: Formula: (let ((.cse1 (<= 50000 v_main_~x~0_1870)) (.cse0 (= |v_main_#t~post5_214| |v_main_#t~post5_213|)) (.cse2 (= |v_main_#t~post6_214| |v_main_#t~post6_213|)) (.cse3 (= v_main_~y~0_2073 v_main_~y~0_2072))) (or (and .cse0 (or (not .cse1) (not (< v_main_~x~0_1870 1000000))) .cse2 .cse3 (= v_main_~x~0_1869 v_main_~x~0_1870)) (and (< v_main_~x~0_1870 v_main_~x~0_1869) (< v_main_~x~0_1869 1000001) .cse1 (= (+ v_main_~x~0_1870 v_main_~y~0_2072) (+ v_main_~x~0_1869 v_main_~y~0_2073))) (and .cse0 (= v_main_~x~0_1870 v_main_~x~0_1869) .cse2 .cse3))) InVars {main_~y~0=v_main_~y~0_2073, main_#t~post5=|v_main_#t~post5_214|, main_~x~0=v_main_~x~0_1870, main_#t~post6=|v_main_#t~post6_214|} OutVars{main_~y~0=v_main_~y~0_2072, main_#t~post5=|v_main_#t~post5_213|, main_~x~0=v_main_~x~0_1869, main_#t~post6=|v_main_#t~post6_213|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {35728#(or (<= main_~x~0 main_~y~0) (<= 50000 main_~y~0))} is VALID [2022-04-28 03:55:55,526 INFO L290 TraceCheckUtils]: 9: Hoare triple {35728#(or (<= main_~x~0 main_~y~0) (<= 50000 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[] {35729#(<= 50000 main_~y~0)} is VALID [2022-04-28 03:55:55,526 INFO L290 TraceCheckUtils]: 10: Hoare triple {35729#(<= 50000 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {35730#(<= 49998 main_~y~0)} is VALID [2022-04-28 03:55:55,527 INFO L290 TraceCheckUtils]: 11: Hoare triple {35730#(<= 49998 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {35731#(<= 49996 main_~y~0)} is VALID [2022-04-28 03:55:55,527 INFO L290 TraceCheckUtils]: 12: Hoare triple {35731#(<= 49996 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {35732#(<= 49994 main_~y~0)} is VALID [2022-04-28 03:55:55,527 INFO L290 TraceCheckUtils]: 13: Hoare triple {35732#(<= 49994 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {35733#(<= 49992 main_~y~0)} is VALID [2022-04-28 03:55:55,528 INFO L290 TraceCheckUtils]: 14: Hoare triple {35733#(<= 49992 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {35734#(<= 49990 main_~y~0)} is VALID [2022-04-28 03:55:55,528 INFO L290 TraceCheckUtils]: 15: Hoare triple {35734#(<= 49990 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {35735#(<= 49988 main_~y~0)} is VALID [2022-04-28 03:55:55,529 INFO L290 TraceCheckUtils]: 16: Hoare triple {35735#(<= 49988 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {35736#(<= 49986 main_~y~0)} is VALID [2022-04-28 03:55:55,529 INFO L290 TraceCheckUtils]: 17: Hoare triple {35736#(<= 49986 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {35737#(<= 49984 main_~y~0)} is VALID [2022-04-28 03:55:55,530 INFO L290 TraceCheckUtils]: 18: Hoare triple {35737#(<= 49984 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {35738#(<= 49982 main_~y~0)} is VALID [2022-04-28 03:55:55,530 INFO L290 TraceCheckUtils]: 19: Hoare triple {35738#(<= 49982 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {35739#(<= 49980 main_~y~0)} is VALID [2022-04-28 03:55:55,530 INFO L290 TraceCheckUtils]: 20: Hoare triple {35739#(<= 49980 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {35740#(<= 49978 main_~y~0)} is VALID [2022-04-28 03:55:55,531 INFO L290 TraceCheckUtils]: 21: Hoare triple {35740#(<= 49978 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {35741#(<= 49976 main_~y~0)} is VALID [2022-04-28 03:55:55,531 INFO L290 TraceCheckUtils]: 22: Hoare triple {35741#(<= 49976 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {35742#(<= 49974 main_~y~0)} is VALID [2022-04-28 03:55:55,532 INFO L290 TraceCheckUtils]: 23: Hoare triple {35742#(<= 49974 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {35743#(<= 49972 main_~y~0)} is VALID [2022-04-28 03:55:55,532 INFO L290 TraceCheckUtils]: 24: Hoare triple {35743#(<= 49972 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {35744#(<= 49970 main_~y~0)} is VALID [2022-04-28 03:55:55,533 INFO L290 TraceCheckUtils]: 25: Hoare triple {35744#(<= 49970 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {35745#(<= 49968 main_~y~0)} is VALID [2022-04-28 03:55:55,533 INFO L290 TraceCheckUtils]: 26: Hoare triple {35745#(<= 49968 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {35746#(<= 49966 main_~y~0)} is VALID [2022-04-28 03:55:55,533 INFO L290 TraceCheckUtils]: 27: Hoare triple {35746#(<= 49966 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {35747#(<= 49964 main_~y~0)} is VALID [2022-04-28 03:55:55,534 INFO L290 TraceCheckUtils]: 28: Hoare triple {35747#(<= 49964 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {35748#(<= 49962 main_~y~0)} is VALID [2022-04-28 03:55:55,534 INFO L290 TraceCheckUtils]: 29: Hoare triple {35748#(<= 49962 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {35749#(<= 49960 main_~y~0)} is VALID [2022-04-28 03:55:55,535 INFO L290 TraceCheckUtils]: 30: Hoare triple {35749#(<= 49960 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {35750#(<= 49958 main_~y~0)} is VALID [2022-04-28 03:55:55,535 INFO L290 TraceCheckUtils]: 31: Hoare triple {35750#(<= 49958 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {35751#(<= 49956 main_~y~0)} is VALID [2022-04-28 03:55:55,536 INFO L290 TraceCheckUtils]: 32: Hoare triple {35751#(<= 49956 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {35752#(<= 49954 main_~y~0)} is VALID [2022-04-28 03:55:55,536 INFO L290 TraceCheckUtils]: 33: Hoare triple {35752#(<= 49954 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {35753#(<= 49952 main_~y~0)} is VALID [2022-04-28 03:55:55,536 INFO L290 TraceCheckUtils]: 34: Hoare triple {35753#(<= 49952 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {35754#(<= 49950 main_~y~0)} is VALID [2022-04-28 03:55:55,537 INFO L290 TraceCheckUtils]: 35: Hoare triple {35754#(<= 49950 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {35755#(<= 49948 main_~y~0)} is VALID [2022-04-28 03:55:55,537 INFO L290 TraceCheckUtils]: 36: Hoare triple {35755#(<= 49948 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {35756#(<= 49946 main_~y~0)} is VALID [2022-04-28 03:55:55,538 INFO L290 TraceCheckUtils]: 37: Hoare triple {35756#(<= 49946 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {35757#(<= 49944 main_~y~0)} is VALID [2022-04-28 03:55:55,538 INFO L290 TraceCheckUtils]: 38: Hoare triple {35757#(<= 49944 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {35758#(<= 49942 main_~y~0)} is VALID [2022-04-28 03:55:55,538 INFO L290 TraceCheckUtils]: 39: Hoare triple {35758#(<= 49942 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {35759#(<= 49940 main_~y~0)} is VALID [2022-04-28 03:55:55,539 INFO L290 TraceCheckUtils]: 40: Hoare triple {35759#(<= 49940 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {35760#(<= 49938 main_~y~0)} is VALID [2022-04-28 03:55:55,539 INFO L290 TraceCheckUtils]: 41: Hoare triple {35760#(<= 49938 main_~y~0)} assume !(~y~0 > 0); {35722#false} is VALID [2022-04-28 03:55:55,539 INFO L272 TraceCheckUtils]: 42: Hoare triple {35722#false} call __VERIFIER_assert((if ~z~0 == ~x~0 then 1 else 0)); {35722#false} is VALID [2022-04-28 03:55:55,539 INFO L290 TraceCheckUtils]: 43: Hoare triple {35722#false} ~cond := #in~cond; {35722#false} is VALID [2022-04-28 03:55:55,539 INFO L290 TraceCheckUtils]: 44: Hoare triple {35722#false} assume 0 == ~cond; {35722#false} is VALID [2022-04-28 03:55:55,539 INFO L290 TraceCheckUtils]: 45: Hoare triple {35722#false} assume !false; {35722#false} is VALID [2022-04-28 03:55:55,540 INFO L134 CoverageAnalysis]: Checked inductivity of 498 backedges. 0 proven. 498 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 03:55:55,540 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 03:55:55,540 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1421892] [2022-04-28 03:55:55,540 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1421892] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 03:55:55,540 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1963333953] [2022-04-28 03:55:55,540 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:55:55,540 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 03:55:55,540 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 03:55:55,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-28 03:55:55,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-28 03:55:55,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:55:55,588 INFO L263 TraceCheckSpWp]: Trace formula consists of 214 conjuncts, 37 conjunts are in the unsatisfiable core [2022-04-28 03:55:55,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:55:55,606 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 03:55:56,537 INFO L272 TraceCheckUtils]: 0: Hoare triple {35721#true} call ULTIMATE.init(); {35721#true} is VALID [2022-04-28 03:55:56,537 INFO L290 TraceCheckUtils]: 1: Hoare triple {35721#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); {35721#true} is VALID [2022-04-28 03:55:56,537 INFO L290 TraceCheckUtils]: 2: Hoare triple {35721#true} assume true; {35721#true} is VALID [2022-04-28 03:55:56,537 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {35721#true} {35721#true} #52#return; {35721#true} is VALID [2022-04-28 03:55:56,537 INFO L272 TraceCheckUtils]: 4: Hoare triple {35721#true} call #t~ret7 := main(); {35721#true} is VALID [2022-04-28 03:55:56,538 INFO L290 TraceCheckUtils]: 5: Hoare triple {35721#true} ~x~0 := 0;~y~0 := 50000;~z~0 := 0;~x~0 := 0; {35780#(and (<= main_~x~0 0) (<= 50000 main_~y~0))} is VALID [2022-04-28 03:55:56,538 INFO L290 TraceCheckUtils]: 6: Hoare triple {35780#(and (<= main_~x~0 0) (<= 50000 main_~y~0))} [180] L11-2-->L18-1_primed: Formula: (let ((.cse0 (= |v_main_#t~post4_196| |v_main_#t~post4_195|)) (.cse1 (= v_main_~x~0_1868 v_main_~x~0_1867))) (or (and (< v_main_~x~0_1868 v_main_~x~0_1867) (< v_main_~x~0_1867 50001)) (and .cse0 .cse1) (and .cse0 .cse1 (<= 50000 v_main_~x~0_1868)))) InVars {main_~x~0=v_main_~x~0_1868, main_#t~post4=|v_main_#t~post4_196|} OutVars{main_~x~0=v_main_~x~0_1867, main_#t~post4=|v_main_#t~post4_195|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {35784#(and (< main_~x~0 50001) (<= 50000 main_~y~0))} is VALID [2022-04-28 03:55:56,538 INFO L290 TraceCheckUtils]: 7: Hoare triple {35784#(and (< main_~x~0 50001) (<= 50000 main_~y~0))} [181] L18-1_primed-->L11-2: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {35784#(and (< main_~x~0 50001) (<= 50000 main_~y~0))} is VALID [2022-04-28 03:55:56,539 INFO L290 TraceCheckUtils]: 8: Hoare triple {35784#(and (< main_~x~0 50001) (<= 50000 main_~y~0))} [182] L11-2-->L18-1_primed: Formula: (let ((.cse1 (<= 50000 v_main_~x~0_1870)) (.cse0 (= |v_main_#t~post5_214| |v_main_#t~post5_213|)) (.cse2 (= |v_main_#t~post6_214| |v_main_#t~post6_213|)) (.cse3 (= v_main_~y~0_2073 v_main_~y~0_2072))) (or (and .cse0 (or (not .cse1) (not (< v_main_~x~0_1870 1000000))) .cse2 .cse3 (= v_main_~x~0_1869 v_main_~x~0_1870)) (and (< v_main_~x~0_1870 v_main_~x~0_1869) (< v_main_~x~0_1869 1000001) .cse1 (= (+ v_main_~x~0_1870 v_main_~y~0_2072) (+ v_main_~x~0_1869 v_main_~y~0_2073))) (and .cse0 (= v_main_~x~0_1870 v_main_~x~0_1869) .cse2 .cse3))) InVars {main_~y~0=v_main_~y~0_2073, main_#t~post5=|v_main_#t~post5_214|, main_~x~0=v_main_~x~0_1870, main_#t~post6=|v_main_#t~post6_214|} OutVars{main_~y~0=v_main_~y~0_2072, main_#t~post5=|v_main_#t~post5_213|, main_~x~0=v_main_~x~0_1869, main_#t~post6=|v_main_#t~post6_213|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {35791#(or (and (< main_~x~0 50001) (<= 50000 main_~y~0)) (and (< main_~x~0 (+ main_~y~0 1)) (< main_~x~0 1000001) (< 50000 main_~x~0)))} is VALID [2022-04-28 03:55:56,540 INFO L290 TraceCheckUtils]: 9: Hoare triple {35791#(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[] {35795#(< 999999 main_~y~0)} is VALID [2022-04-28 03:55:56,540 INFO L290 TraceCheckUtils]: 10: Hoare triple {35795#(< 999999 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {35799#(< 999997 main_~y~0)} is VALID [2022-04-28 03:55:56,540 INFO L290 TraceCheckUtils]: 11: Hoare triple {35799#(< 999997 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {35803#(< 999995 main_~y~0)} is VALID [2022-04-28 03:55:56,541 INFO L290 TraceCheckUtils]: 12: Hoare triple {35803#(< 999995 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {35807#(< 999993 main_~y~0)} is VALID [2022-04-28 03:55:56,541 INFO L290 TraceCheckUtils]: 13: Hoare triple {35807#(< 999993 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {35811#(< 999991 main_~y~0)} is VALID [2022-04-28 03:55:56,542 INFO L290 TraceCheckUtils]: 14: Hoare triple {35811#(< 999991 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {35815#(< 999989 main_~y~0)} is VALID [2022-04-28 03:55:56,542 INFO L290 TraceCheckUtils]: 15: Hoare triple {35815#(< 999989 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {35819#(< 999987 main_~y~0)} is VALID [2022-04-28 03:55:56,542 INFO L290 TraceCheckUtils]: 16: Hoare triple {35819#(< 999987 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {35823#(< 999985 main_~y~0)} is VALID [2022-04-28 03:55:56,543 INFO L290 TraceCheckUtils]: 17: Hoare triple {35823#(< 999985 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {35827#(< 999983 main_~y~0)} is VALID [2022-04-28 03:55:56,543 INFO L290 TraceCheckUtils]: 18: Hoare triple {35827#(< 999983 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {35831#(< 999981 main_~y~0)} is VALID [2022-04-28 03:55:56,544 INFO L290 TraceCheckUtils]: 19: Hoare triple {35831#(< 999981 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {35835#(< 999979 main_~y~0)} is VALID [2022-04-28 03:55:56,544 INFO L290 TraceCheckUtils]: 20: Hoare triple {35835#(< 999979 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {35839#(< 999977 main_~y~0)} is VALID [2022-04-28 03:55:56,545 INFO L290 TraceCheckUtils]: 21: Hoare triple {35839#(< 999977 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {35843#(< 999975 main_~y~0)} is VALID [2022-04-28 03:55:56,545 INFO L290 TraceCheckUtils]: 22: Hoare triple {35843#(< 999975 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {35847#(< 999973 main_~y~0)} is VALID [2022-04-28 03:55:56,545 INFO L290 TraceCheckUtils]: 23: Hoare triple {35847#(< 999973 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {35851#(< 999971 main_~y~0)} is VALID [2022-04-28 03:55:56,546 INFO L290 TraceCheckUtils]: 24: Hoare triple {35851#(< 999971 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {35855#(< 999969 main_~y~0)} is VALID [2022-04-28 03:55:56,546 INFO L290 TraceCheckUtils]: 25: Hoare triple {35855#(< 999969 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {35859#(< 999967 main_~y~0)} is VALID [2022-04-28 03:55:56,547 INFO L290 TraceCheckUtils]: 26: Hoare triple {35859#(< 999967 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {35863#(< 999965 main_~y~0)} is VALID [2022-04-28 03:55:56,547 INFO L290 TraceCheckUtils]: 27: Hoare triple {35863#(< 999965 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {35867#(< 999963 main_~y~0)} is VALID [2022-04-28 03:55:56,547 INFO L290 TraceCheckUtils]: 28: Hoare triple {35867#(< 999963 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {35871#(< 999961 main_~y~0)} is VALID [2022-04-28 03:55:56,548 INFO L290 TraceCheckUtils]: 29: Hoare triple {35871#(< 999961 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {35875#(< 999959 main_~y~0)} is VALID [2022-04-28 03:55:56,548 INFO L290 TraceCheckUtils]: 30: Hoare triple {35875#(< 999959 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {35879#(< 999957 main_~y~0)} is VALID [2022-04-28 03:55:56,549 INFO L290 TraceCheckUtils]: 31: Hoare triple {35879#(< 999957 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {35883#(< 999955 main_~y~0)} is VALID [2022-04-28 03:55:56,549 INFO L290 TraceCheckUtils]: 32: Hoare triple {35883#(< 999955 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {35887#(< 999953 main_~y~0)} is VALID [2022-04-28 03:55:56,549 INFO L290 TraceCheckUtils]: 33: Hoare triple {35887#(< 999953 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {35891#(< 999951 main_~y~0)} is VALID [2022-04-28 03:55:56,550 INFO L290 TraceCheckUtils]: 34: Hoare triple {35891#(< 999951 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {35895#(< 999949 main_~y~0)} is VALID [2022-04-28 03:55:56,550 INFO L290 TraceCheckUtils]: 35: Hoare triple {35895#(< 999949 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {35899#(< 999947 main_~y~0)} is VALID [2022-04-28 03:55:56,551 INFO L290 TraceCheckUtils]: 36: Hoare triple {35899#(< 999947 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {35903#(< 999945 main_~y~0)} is VALID [2022-04-28 03:55:56,551 INFO L290 TraceCheckUtils]: 37: Hoare triple {35903#(< 999945 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {35907#(< 999943 main_~y~0)} is VALID [2022-04-28 03:55:56,551 INFO L290 TraceCheckUtils]: 38: Hoare triple {35907#(< 999943 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {35911#(< 999941 main_~y~0)} is VALID [2022-04-28 03:55:56,552 INFO L290 TraceCheckUtils]: 39: Hoare triple {35911#(< 999941 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {35915#(< 999939 main_~y~0)} is VALID [2022-04-28 03:55:56,552 INFO L290 TraceCheckUtils]: 40: Hoare triple {35915#(< 999939 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {35919#(< 999937 main_~y~0)} is VALID [2022-04-28 03:55:56,553 INFO L290 TraceCheckUtils]: 41: Hoare triple {35919#(< 999937 main_~y~0)} assume !(~y~0 > 0); {35722#false} is VALID [2022-04-28 03:55:56,553 INFO L272 TraceCheckUtils]: 42: Hoare triple {35722#false} call __VERIFIER_assert((if ~z~0 == ~x~0 then 1 else 0)); {35722#false} is VALID [2022-04-28 03:55:56,553 INFO L290 TraceCheckUtils]: 43: Hoare triple {35722#false} ~cond := #in~cond; {35722#false} is VALID [2022-04-28 03:55:56,553 INFO L290 TraceCheckUtils]: 44: Hoare triple {35722#false} assume 0 == ~cond; {35722#false} is VALID [2022-04-28 03:55:56,553 INFO L290 TraceCheckUtils]: 45: Hoare triple {35722#false} assume !false; {35722#false} is VALID [2022-04-28 03:55:56,553 INFO L134 CoverageAnalysis]: Checked inductivity of 498 backedges. 0 proven. 498 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 03:55:56,553 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 03:55:58,315 INFO L290 TraceCheckUtils]: 45: Hoare triple {35722#false} assume !false; {35722#false} is VALID [2022-04-28 03:55:58,315 INFO L290 TraceCheckUtils]: 44: Hoare triple {35722#false} assume 0 == ~cond; {35722#false} is VALID [2022-04-28 03:55:58,315 INFO L290 TraceCheckUtils]: 43: Hoare triple {35722#false} ~cond := #in~cond; {35722#false} is VALID [2022-04-28 03:55:58,315 INFO L272 TraceCheckUtils]: 42: Hoare triple {35722#false} call __VERIFIER_assert((if ~z~0 == ~x~0 then 1 else 0)); {35722#false} is VALID [2022-04-28 03:55:58,316 INFO L290 TraceCheckUtils]: 41: Hoare triple {35947#(< 0 main_~y~0)} assume !(~y~0 > 0); {35722#false} is VALID [2022-04-28 03:55:58,316 INFO L290 TraceCheckUtils]: 40: Hoare triple {35951#(< 2 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {35947#(< 0 main_~y~0)} is VALID [2022-04-28 03:55:58,316 INFO L290 TraceCheckUtils]: 39: Hoare triple {35955#(< 4 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {35951#(< 2 main_~y~0)} is VALID [2022-04-28 03:55:58,317 INFO L290 TraceCheckUtils]: 38: Hoare triple {35959#(< 6 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {35955#(< 4 main_~y~0)} is VALID [2022-04-28 03:55:58,317 INFO L290 TraceCheckUtils]: 37: Hoare triple {35963#(< 8 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {35959#(< 6 main_~y~0)} is VALID [2022-04-28 03:55:58,318 INFO L290 TraceCheckUtils]: 36: Hoare triple {35967#(< 10 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {35963#(< 8 main_~y~0)} is VALID [2022-04-28 03:55:58,318 INFO L290 TraceCheckUtils]: 35: Hoare triple {35971#(< 12 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {35967#(< 10 main_~y~0)} is VALID [2022-04-28 03:55:58,319 INFO L290 TraceCheckUtils]: 34: Hoare triple {35975#(< 14 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {35971#(< 12 main_~y~0)} is VALID [2022-04-28 03:55:58,319 INFO L290 TraceCheckUtils]: 33: Hoare triple {35979#(< 16 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {35975#(< 14 main_~y~0)} is VALID [2022-04-28 03:55:58,319 INFO L290 TraceCheckUtils]: 32: Hoare triple {35983#(< 18 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {35979#(< 16 main_~y~0)} is VALID [2022-04-28 03:55:58,320 INFO L290 TraceCheckUtils]: 31: Hoare triple {35987#(< 20 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {35983#(< 18 main_~y~0)} is VALID [2022-04-28 03:55:58,320 INFO L290 TraceCheckUtils]: 30: Hoare triple {35991#(< 22 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {35987#(< 20 main_~y~0)} is VALID [2022-04-28 03:55:58,321 INFO L290 TraceCheckUtils]: 29: Hoare triple {35995#(< 24 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {35991#(< 22 main_~y~0)} is VALID [2022-04-28 03:55:58,321 INFO L290 TraceCheckUtils]: 28: Hoare triple {35999#(< 26 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {35995#(< 24 main_~y~0)} is VALID [2022-04-28 03:55:58,321 INFO L290 TraceCheckUtils]: 27: Hoare triple {36003#(< 28 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {35999#(< 26 main_~y~0)} is VALID [2022-04-28 03:55:58,322 INFO L290 TraceCheckUtils]: 26: Hoare triple {36007#(< 30 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {36003#(< 28 main_~y~0)} is VALID [2022-04-28 03:55:58,322 INFO L290 TraceCheckUtils]: 25: Hoare triple {36011#(< 32 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {36007#(< 30 main_~y~0)} is VALID [2022-04-28 03:55:58,323 INFO L290 TraceCheckUtils]: 24: Hoare triple {36015#(< 34 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {36011#(< 32 main_~y~0)} is VALID [2022-04-28 03:55:58,323 INFO L290 TraceCheckUtils]: 23: Hoare triple {36019#(< 36 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {36015#(< 34 main_~y~0)} is VALID [2022-04-28 03:55:58,324 INFO L290 TraceCheckUtils]: 22: Hoare triple {36023#(< 38 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {36019#(< 36 main_~y~0)} is VALID [2022-04-28 03:55:58,324 INFO L290 TraceCheckUtils]: 21: Hoare triple {36027#(< 40 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {36023#(< 38 main_~y~0)} is VALID [2022-04-28 03:55:58,325 INFO L290 TraceCheckUtils]: 20: Hoare triple {36031#(< 42 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {36027#(< 40 main_~y~0)} is VALID [2022-04-28 03:55:58,325 INFO L290 TraceCheckUtils]: 19: Hoare triple {36035#(< 44 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {36031#(< 42 main_~y~0)} is VALID [2022-04-28 03:55:58,326 INFO L290 TraceCheckUtils]: 18: Hoare triple {36039#(< 46 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {36035#(< 44 main_~y~0)} is VALID [2022-04-28 03:55:58,326 INFO L290 TraceCheckUtils]: 17: Hoare triple {36043#(< 48 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {36039#(< 46 main_~y~0)} is VALID [2022-04-28 03:55:58,326 INFO L290 TraceCheckUtils]: 16: Hoare triple {36047#(< 50 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {36043#(< 48 main_~y~0)} is VALID [2022-04-28 03:55:58,327 INFO L290 TraceCheckUtils]: 15: Hoare triple {36051#(< 52 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {36047#(< 50 main_~y~0)} is VALID [2022-04-28 03:55:58,327 INFO L290 TraceCheckUtils]: 14: Hoare triple {36055#(< 54 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {36051#(< 52 main_~y~0)} is VALID [2022-04-28 03:55:58,328 INFO L290 TraceCheckUtils]: 13: Hoare triple {36059#(< 56 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {36055#(< 54 main_~y~0)} is VALID [2022-04-28 03:55:58,328 INFO L290 TraceCheckUtils]: 12: Hoare triple {36063#(< 58 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {36059#(< 56 main_~y~0)} is VALID [2022-04-28 03:55:58,329 INFO L290 TraceCheckUtils]: 11: Hoare triple {36067#(< 60 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {36063#(< 58 main_~y~0)} is VALID [2022-04-28 03:55:58,329 INFO L290 TraceCheckUtils]: 10: Hoare triple {36071#(< 62 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {36067#(< 60 main_~y~0)} is VALID [2022-04-28 03:55:58,330 INFO L290 TraceCheckUtils]: 9: Hoare triple {36075#(or (< 62 main_~y~0) (< main_~x~0 1000000))} [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[] {36071#(< 62 main_~y~0)} is VALID [2022-04-28 03:55:58,331 INFO L290 TraceCheckUtils]: 8: Hoare triple {36079#(and (or (< 62 main_~y~0) (< main_~x~0 1000000)) (or (< main_~x~0 (+ main_~y~0 999938)) (<= 62 main_~y~0) (not (<= 50000 main_~x~0))))} [182] L11-2-->L18-1_primed: Formula: (let ((.cse1 (<= 50000 v_main_~x~0_1870)) (.cse0 (= |v_main_#t~post5_214| |v_main_#t~post5_213|)) (.cse2 (= |v_main_#t~post6_214| |v_main_#t~post6_213|)) (.cse3 (= v_main_~y~0_2073 v_main_~y~0_2072))) (or (and .cse0 (or (not .cse1) (not (< v_main_~x~0_1870 1000000))) .cse2 .cse3 (= v_main_~x~0_1869 v_main_~x~0_1870)) (and (< v_main_~x~0_1870 v_main_~x~0_1869) (< v_main_~x~0_1869 1000001) .cse1 (= (+ v_main_~x~0_1870 v_main_~y~0_2072) (+ v_main_~x~0_1869 v_main_~y~0_2073))) (and .cse0 (= v_main_~x~0_1870 v_main_~x~0_1869) .cse2 .cse3))) InVars {main_~y~0=v_main_~y~0_2073, main_#t~post5=|v_main_#t~post5_214|, main_~x~0=v_main_~x~0_1870, main_#t~post6=|v_main_#t~post6_214|} OutVars{main_~y~0=v_main_~y~0_2072, main_#t~post5=|v_main_#t~post5_213|, main_~x~0=v_main_~x~0_1869, main_#t~post6=|v_main_#t~post6_213|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {36075#(or (< 62 main_~y~0) (< main_~x~0 1000000))} is VALID [2022-04-28 03:55:58,331 INFO L290 TraceCheckUtils]: 7: Hoare triple {36079#(and (or (< 62 main_~y~0) (< main_~x~0 1000000)) (or (< main_~x~0 (+ main_~y~0 999938)) (<= 62 main_~y~0) (not (<= 50000 main_~x~0))))} [181] L18-1_primed-->L11-2: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {36079#(and (or (< 62 main_~y~0) (< main_~x~0 1000000)) (or (< main_~x~0 (+ main_~y~0 999938)) (<= 62 main_~y~0) (not (<= 50000 main_~x~0))))} is VALID [2022-04-28 03:55:58,332 INFO L290 TraceCheckUtils]: 6: Hoare triple {36086#(and (or (< 62 main_~y~0) (< main_~x~0 1000000)) (or (<= 62 main_~y~0) (and (<= 0 (+ main_~y~0 949937)) (< main_~x~0 (+ main_~y~0 999938)))))} [180] L11-2-->L18-1_primed: Formula: (let ((.cse0 (= |v_main_#t~post4_196| |v_main_#t~post4_195|)) (.cse1 (= v_main_~x~0_1868 v_main_~x~0_1867))) (or (and (< v_main_~x~0_1868 v_main_~x~0_1867) (< v_main_~x~0_1867 50001)) (and .cse0 .cse1) (and .cse0 .cse1 (<= 50000 v_main_~x~0_1868)))) InVars {main_~x~0=v_main_~x~0_1868, main_#t~post4=|v_main_#t~post4_196|} OutVars{main_~x~0=v_main_~x~0_1867, main_#t~post4=|v_main_#t~post4_195|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {36079#(and (or (< 62 main_~y~0) (< main_~x~0 1000000)) (or (< main_~x~0 (+ main_~y~0 999938)) (<= 62 main_~y~0) (not (<= 50000 main_~x~0))))} is VALID [2022-04-28 03:55:58,332 INFO L290 TraceCheckUtils]: 5: Hoare triple {35721#true} ~x~0 := 0;~y~0 := 50000;~z~0 := 0;~x~0 := 0; {36086#(and (or (< 62 main_~y~0) (< main_~x~0 1000000)) (or (<= 62 main_~y~0) (and (<= 0 (+ main_~y~0 949937)) (< main_~x~0 (+ main_~y~0 999938)))))} is VALID [2022-04-28 03:55:58,333 INFO L272 TraceCheckUtils]: 4: Hoare triple {35721#true} call #t~ret7 := main(); {35721#true} is VALID [2022-04-28 03:55:58,333 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {35721#true} {35721#true} #52#return; {35721#true} is VALID [2022-04-28 03:55:58,333 INFO L290 TraceCheckUtils]: 2: Hoare triple {35721#true} assume true; {35721#true} is VALID [2022-04-28 03:55:58,333 INFO L290 TraceCheckUtils]: 1: Hoare triple {35721#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); {35721#true} is VALID [2022-04-28 03:55:58,333 INFO L272 TraceCheckUtils]: 0: Hoare triple {35721#true} call ULTIMATE.init(); {35721#true} is VALID [2022-04-28 03:55:58,333 INFO L134 CoverageAnalysis]: Checked inductivity of 498 backedges. 0 proven. 498 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 03:55:58,333 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1963333953] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 03:55:58,333 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 03:55:58,334 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [38, 37, 37] total 108 [2022-04-28 03:56:01,528 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 03:56:01,528 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1084687139] [2022-04-28 03:56:01,528 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1084687139] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 03:56:01,528 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 03:56:01,528 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [94] imperfect sequences [] total 94 [2022-04-28 03:56:01,528 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1051187945] [2022-04-28 03:56:01,528 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 03:56:01,529 INFO L78 Accepts]: Start accepts. Automaton has has 94 states, 94 states have (on average 1.648936170212766) internal successors, (155), 93 states have internal predecessors, (155), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 159 [2022-04-28 03:56:01,529 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 03:56:01,529 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 94 states, 94 states have (on average 1.648936170212766) internal successors, (155), 93 states have internal predecessors, (155), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:56:01,633 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 159 edges. 159 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 03:56:01,633 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 94 states [2022-04-28 03:56:01,633 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 03:56:01,637 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 94 interpolants. [2022-04-28 03:56:01,638 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9608, Invalid=18114, Unknown=0, NotChecked=0, Total=27722 [2022-04-28 03:56:01,639 INFO L87 Difference]: Start difference. First operand 160 states and 163 transitions. Second operand has 94 states, 94 states have (on average 1.648936170212766) internal successors, (155), 93 states have internal predecessors, (155), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:56:16,501 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:56:16,501 INFO L93 Difference]: Finished difference Result 429 states and 440 transitions. [2022-04-28 03:56:16,501 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 94 states. [2022-04-28 03:56:16,502 INFO L78 Accepts]: Start accepts. Automaton has has 94 states, 94 states have (on average 1.648936170212766) internal successors, (155), 93 states have internal predecessors, (155), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 159 [2022-04-28 03:56:16,502 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 03:56:16,502 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 94 states, 94 states have (on average 1.648936170212766) internal successors, (155), 93 states have internal predecessors, (155), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:56:16,503 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 181 transitions. [2022-04-28 03:56:16,503 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 94 states, 94 states have (on average 1.648936170212766) internal successors, (155), 93 states have internal predecessors, (155), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:56:16,504 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 181 transitions. [2022-04-28 03:56:16,504 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 94 states and 181 transitions. [2022-04-28 03:56:16,668 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 181 edges. 181 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 03:56:16,672 INFO L225 Difference]: With dead ends: 429 [2022-04-28 03:56:16,672 INFO L226 Difference]: Without dead ends: 277 [2022-04-28 03:56:16,676 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 342 GetRequests, 85 SyntacticMatches, 1 SemanticMatches, 256 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22796 ImplicationChecksByTransitivity, 8.7s TimeCoverageRelationStatistics Valid=18107, Invalid=48199, Unknown=0, NotChecked=0, Total=66306 [2022-04-28 03:56:16,676 INFO L413 NwaCegarLoop]: 12 mSDtfsCounter, 251 mSDsluCounter, 47 mSDsCounter, 0 mSdLazyCounter, 7265 mSolverCounterSat, 280 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 251 SdHoareTripleChecker+Valid, 59 SdHoareTripleChecker+Invalid, 7545 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 280 IncrementalHoareTripleChecker+Valid, 7265 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.6s IncrementalHoareTripleChecker+Time [2022-04-28 03:56:16,676 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [251 Valid, 59 Invalid, 7545 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [280 Valid, 7265 Invalid, 0 Unknown, 0 Unchecked, 5.6s Time] [2022-04-28 03:56:16,676 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 277 states. [2022-04-28 03:56:17,160 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 277 to 277. [2022-04-28 03:56:17,160 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 03:56:17,161 INFO L82 GeneralOperation]: Start isEquivalent. First operand 277 states. Second operand has 277 states, 272 states have (on average 1.0183823529411764) internal successors, (277), 272 states have internal predecessors, (277), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:56:17,161 INFO L74 IsIncluded]: Start isIncluded. First operand 277 states. Second operand has 277 states, 272 states have (on average 1.0183823529411764) internal successors, (277), 272 states have internal predecessors, (277), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:56:17,161 INFO L87 Difference]: Start difference. First operand 277 states. Second operand has 277 states, 272 states have (on average 1.0183823529411764) internal successors, (277), 272 states have internal predecessors, (277), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:56:17,164 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:56:17,164 INFO L93 Difference]: Finished difference Result 277 states and 281 transitions. [2022-04-28 03:56:17,164 INFO L276 IsEmpty]: Start isEmpty. Operand 277 states and 281 transitions. [2022-04-28 03:56:17,164 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:56:17,164 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:56:17,165 INFO L74 IsIncluded]: Start isIncluded. First operand has 277 states, 272 states have (on average 1.0183823529411764) internal successors, (277), 272 states have internal predecessors, (277), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 277 states. [2022-04-28 03:56:17,165 INFO L87 Difference]: Start difference. First operand has 277 states, 272 states have (on average 1.0183823529411764) internal successors, (277), 272 states have internal predecessors, (277), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 277 states. [2022-04-28 03:56:17,168 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:56:17,168 INFO L93 Difference]: Finished difference Result 277 states and 281 transitions. [2022-04-28 03:56:17,168 INFO L276 IsEmpty]: Start isEmpty. Operand 277 states and 281 transitions. [2022-04-28 03:56:17,168 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:56:17,168 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:56:17,168 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 03:56:17,168 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 03:56:17,168 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 277 states, 272 states have (on average 1.0183823529411764) internal successors, (277), 272 states have internal predecessors, (277), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:56:17,172 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 277 states to 277 states and 281 transitions. [2022-04-28 03:56:17,172 INFO L78 Accepts]: Start accepts. Automaton has 277 states and 281 transitions. Word has length 159 [2022-04-28 03:56:17,172 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 03:56:17,172 INFO L495 AbstractCegarLoop]: Abstraction has 277 states and 281 transitions. [2022-04-28 03:56:17,172 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 94 states, 94 states have (on average 1.648936170212766) internal successors, (155), 93 states have internal predecessors, (155), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:56:17,173 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 277 states and 281 transitions. [2022-04-28 03:56:17,403 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 281 edges. 281 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 03:56:17,403 INFO L276 IsEmpty]: Start isEmpty. Operand 277 states and 281 transitions. [2022-04-28 03:56:17,403 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 163 [2022-04-28 03:56:17,403 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 03:56:17,403 INFO L195 NwaCegarLoop]: trace histogram [59, 58, 32, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 03:56:17,420 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (32)] Forceful destruction successful, exit code 0 [2022-04-28 03:56:17,604 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33,32 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 03:56:17,604 INFO L420 AbstractCegarLoop]: === Iteration 35 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 03:56:17,604 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 03:56:17,604 INFO L85 PathProgramCache]: Analyzing trace with hash -788602084, now seen corresponding path program 32 times [2022-04-28 03:56:17,604 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 03:56:17,604 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [761845453] [2022-04-28 03:56:21,668 WARN L977 rdanLoopAcceleration]: Unable to prove correctness of quantifier elimination. [2022-04-28 03:56:21,722 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 1 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 03:56:25,833 WARN L977 rdanLoopAcceleration]: Unable to prove correctness of quantifier elimination. [2022-04-28 03:56:25,934 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={1=1, 2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 03:56:25,935 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-28 03:56:25,938 INFO L85 PathProgramCache]: Analyzing trace with hash -386255871, now seen corresponding path program 1 times [2022-04-28 03:56:25,938 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 03:56:25,938 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [53590696] [2022-04-28 03:56:25,939 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:56:25,939 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 03:56:25,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:56:26,490 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 03:56:26,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:56:26,493 INFO L290 TraceCheckUtils]: 0: Hoare triple {38352#(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); {38314#true} is VALID [2022-04-28 03:56:26,493 INFO L290 TraceCheckUtils]: 1: Hoare triple {38314#true} assume true; {38314#true} is VALID [2022-04-28 03:56:26,493 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {38314#true} {38314#true} #52#return; {38314#true} is VALID [2022-04-28 03:56:26,494 INFO L272 TraceCheckUtils]: 0: Hoare triple {38314#true} call ULTIMATE.init(); {38352#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 03:56:26,494 INFO L290 TraceCheckUtils]: 1: Hoare triple {38352#(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); {38314#true} is VALID [2022-04-28 03:56:26,494 INFO L290 TraceCheckUtils]: 2: Hoare triple {38314#true} assume true; {38314#true} is VALID [2022-04-28 03:56:26,494 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {38314#true} {38314#true} #52#return; {38314#true} is VALID [2022-04-28 03:56:26,494 INFO L272 TraceCheckUtils]: 4: Hoare triple {38314#true} call #t~ret7 := main(); {38314#true} is VALID [2022-04-28 03:56:26,494 INFO L290 TraceCheckUtils]: 5: Hoare triple {38314#true} ~x~0 := 0;~y~0 := 50000;~z~0 := 0;~x~0 := 0; {38319#(<= 50000 main_~y~0)} is VALID [2022-04-28 03:56:26,495 INFO L290 TraceCheckUtils]: 6: Hoare triple {38319#(<= 50000 main_~y~0)} [184] L11-2-->L18-1_primed: Formula: (let ((.cse0 (= v_main_~x~0_1974 v_main_~x~0_1973)) (.cse1 (= |v_main_#t~post4_203| |v_main_#t~post4_202|))) (or (and .cse0 .cse1) (and .cse0 .cse1 (<= 50000 v_main_~x~0_1974)) (and (< v_main_~x~0_1973 50001) (< v_main_~x~0_1974 v_main_~x~0_1973)))) InVars {main_~x~0=v_main_~x~0_1974, main_#t~post4=|v_main_#t~post4_203|} OutVars{main_~x~0=v_main_~x~0_1973, main_#t~post4=|v_main_#t~post4_202|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {38319#(<= 50000 main_~y~0)} is VALID [2022-04-28 03:56:26,495 INFO L290 TraceCheckUtils]: 7: Hoare triple {38319#(<= 50000 main_~y~0)} [185] L18-1_primed-->L11-2: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {38319#(<= 50000 main_~y~0)} is VALID [2022-04-28 03:56:26,496 INFO L290 TraceCheckUtils]: 8: Hoare triple {38319#(<= 50000 main_~y~0)} [186] L11-2-->L18-1_primed: Formula: (let ((.cse3 (<= 50000 v_main_~x~0_1976)) (.cse0 (= |v_main_#t~post6_221| |v_main_#t~post6_220|)) (.cse1 (= |v_main_#t~post5_221| |v_main_#t~post5_220|)) (.cse2 (= v_main_~y~0_2201 v_main_~y~0_2200)) (.cse4 (= v_main_~x~0_1976 v_main_~x~0_1975))) (or (and .cse0 .cse1 .cse2 (or (not .cse3) (not (< v_main_~x~0_1976 1000000))) .cse4) (let ((.cse5 (+ v_main_~x~0_1976 v_main_~y~0_2200))) (and (= (+ v_main_~x~0_1975 v_main_~y~0_2201) .cse5) .cse3 (< v_main_~y~0_2201 v_main_~y~0_2200) (< .cse5 (+ 1000001 v_main_~y~0_2201)))) (and .cse0 .cse1 .cse2 .cse4))) InVars {main_~y~0=v_main_~y~0_2201, main_#t~post5=|v_main_#t~post5_221|, main_~x~0=v_main_~x~0_1976, main_#t~post6=|v_main_#t~post6_221|} OutVars{main_~y~0=v_main_~y~0_2200, main_#t~post5=|v_main_#t~post5_220|, main_~x~0=v_main_~x~0_1975, main_#t~post6=|v_main_#t~post6_220|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {38319#(<= 50000 main_~y~0)} is VALID [2022-04-28 03:56:26,496 INFO L290 TraceCheckUtils]: 9: Hoare triple {38319#(<= 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[] {38319#(<= 50000 main_~y~0)} is VALID [2022-04-28 03:56:26,497 INFO L290 TraceCheckUtils]: 10: Hoare triple {38319#(<= 50000 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {38320#(<= 49998 main_~y~0)} is VALID [2022-04-28 03:56:26,497 INFO L290 TraceCheckUtils]: 11: Hoare triple {38320#(<= 49998 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {38321#(<= 49996 main_~y~0)} is VALID [2022-04-28 03:56:26,497 INFO L290 TraceCheckUtils]: 12: Hoare triple {38321#(<= 49996 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {38322#(<= 49994 main_~y~0)} is VALID [2022-04-28 03:56:26,498 INFO L290 TraceCheckUtils]: 13: Hoare triple {38322#(<= 49994 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {38323#(<= 49992 main_~y~0)} is VALID [2022-04-28 03:56:26,498 INFO L290 TraceCheckUtils]: 14: Hoare triple {38323#(<= 49992 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {38324#(<= 49990 main_~y~0)} is VALID [2022-04-28 03:56:26,499 INFO L290 TraceCheckUtils]: 15: Hoare triple {38324#(<= 49990 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {38325#(<= 49988 main_~y~0)} is VALID [2022-04-28 03:56:26,504 INFO L290 TraceCheckUtils]: 16: Hoare triple {38325#(<= 49988 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {38326#(<= 49986 main_~y~0)} is VALID [2022-04-28 03:56:26,505 INFO L290 TraceCheckUtils]: 17: Hoare triple {38326#(<= 49986 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {38327#(<= 49984 main_~y~0)} is VALID [2022-04-28 03:56:26,505 INFO L290 TraceCheckUtils]: 18: Hoare triple {38327#(<= 49984 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {38328#(<= 49982 main_~y~0)} is VALID [2022-04-28 03:56:26,506 INFO L290 TraceCheckUtils]: 19: Hoare triple {38328#(<= 49982 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {38329#(<= 49980 main_~y~0)} is VALID [2022-04-28 03:56:26,506 INFO L290 TraceCheckUtils]: 20: Hoare triple {38329#(<= 49980 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {38330#(<= 49978 main_~y~0)} is VALID [2022-04-28 03:56:26,506 INFO L290 TraceCheckUtils]: 21: Hoare triple {38330#(<= 49978 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {38331#(<= 49976 main_~y~0)} is VALID [2022-04-28 03:56:26,507 INFO L290 TraceCheckUtils]: 22: Hoare triple {38331#(<= 49976 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {38332#(<= 49974 main_~y~0)} is VALID [2022-04-28 03:56:26,507 INFO L290 TraceCheckUtils]: 23: Hoare triple {38332#(<= 49974 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {38333#(<= 49972 main_~y~0)} is VALID [2022-04-28 03:56:26,508 INFO L290 TraceCheckUtils]: 24: Hoare triple {38333#(<= 49972 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {38334#(<= 49970 main_~y~0)} is VALID [2022-04-28 03:56:26,508 INFO L290 TraceCheckUtils]: 25: Hoare triple {38334#(<= 49970 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {38335#(<= 49968 main_~y~0)} is VALID [2022-04-28 03:56:26,509 INFO L290 TraceCheckUtils]: 26: Hoare triple {38335#(<= 49968 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {38336#(<= 49966 main_~y~0)} is VALID [2022-04-28 03:56:26,509 INFO L290 TraceCheckUtils]: 27: Hoare triple {38336#(<= 49966 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {38337#(<= 49964 main_~y~0)} is VALID [2022-04-28 03:56:26,509 INFO L290 TraceCheckUtils]: 28: Hoare triple {38337#(<= 49964 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {38338#(<= 49962 main_~y~0)} is VALID [2022-04-28 03:56:26,510 INFO L290 TraceCheckUtils]: 29: Hoare triple {38338#(<= 49962 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {38339#(<= 49960 main_~y~0)} is VALID [2022-04-28 03:56:26,510 INFO L290 TraceCheckUtils]: 30: Hoare triple {38339#(<= 49960 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {38340#(<= 49958 main_~y~0)} is VALID [2022-04-28 03:56:26,511 INFO L290 TraceCheckUtils]: 31: Hoare triple {38340#(<= 49958 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {38341#(<= 49956 main_~y~0)} is VALID [2022-04-28 03:56:26,511 INFO L290 TraceCheckUtils]: 32: Hoare triple {38341#(<= 49956 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {38342#(<= 49954 main_~y~0)} is VALID [2022-04-28 03:56:26,512 INFO L290 TraceCheckUtils]: 33: Hoare triple {38342#(<= 49954 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {38343#(<= 49952 main_~y~0)} is VALID [2022-04-28 03:56:26,512 INFO L290 TraceCheckUtils]: 34: Hoare triple {38343#(<= 49952 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {38344#(<= 49950 main_~y~0)} is VALID [2022-04-28 03:56:26,512 INFO L290 TraceCheckUtils]: 35: Hoare triple {38344#(<= 49950 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {38345#(<= 49948 main_~y~0)} is VALID [2022-04-28 03:56:26,513 INFO L290 TraceCheckUtils]: 36: Hoare triple {38345#(<= 49948 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {38346#(<= 49946 main_~y~0)} is VALID [2022-04-28 03:56:26,513 INFO L290 TraceCheckUtils]: 37: Hoare triple {38346#(<= 49946 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {38347#(<= 49944 main_~y~0)} is VALID [2022-04-28 03:56:26,514 INFO L290 TraceCheckUtils]: 38: Hoare triple {38347#(<= 49944 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {38348#(<= 49942 main_~y~0)} is VALID [2022-04-28 03:56:26,514 INFO L290 TraceCheckUtils]: 39: Hoare triple {38348#(<= 49942 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {38349#(<= 49940 main_~y~0)} is VALID [2022-04-28 03:56:26,514 INFO L290 TraceCheckUtils]: 40: Hoare triple {38349#(<= 49940 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {38350#(<= 49938 main_~y~0)} is VALID [2022-04-28 03:56:26,515 INFO L290 TraceCheckUtils]: 41: Hoare triple {38350#(<= 49938 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {38351#(<= 49936 main_~y~0)} is VALID [2022-04-28 03:56:26,515 INFO L290 TraceCheckUtils]: 42: Hoare triple {38351#(<= 49936 main_~y~0)} assume !(~y~0 > 0); {38315#false} is VALID [2022-04-28 03:56:26,515 INFO L272 TraceCheckUtils]: 43: Hoare triple {38315#false} call __VERIFIER_assert((if ~z~0 == ~x~0 then 1 else 0)); {38315#false} is VALID [2022-04-28 03:56:26,515 INFO L290 TraceCheckUtils]: 44: Hoare triple {38315#false} ~cond := #in~cond; {38315#false} is VALID [2022-04-28 03:56:26,515 INFO L290 TraceCheckUtils]: 45: Hoare triple {38315#false} assume 0 == ~cond; {38315#false} is VALID [2022-04-28 03:56:26,515 INFO L290 TraceCheckUtils]: 46: Hoare triple {38315#false} assume !false; {38315#false} is VALID [2022-04-28 03:56:26,516 INFO L134 CoverageAnalysis]: Checked inductivity of 530 backedges. 0 proven. 528 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-04-28 03:56:26,516 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 03:56:26,516 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [53590696] [2022-04-28 03:56:26,516 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [53590696] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 03:56:26,516 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2125348272] [2022-04-28 03:56:26,516 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:56:26,516 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 03:56:26,516 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 03:56:26,517 INFO L229 MonitoredProcess]: Starting monitored process 33 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 03:56:26,532 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (33)] Waiting until timeout for monitored process [2022-04-28 03:56:26,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:56:26,577 INFO L263 TraceCheckSpWp]: Trace formula consists of 219 conjuncts, 35 conjunts are in the unsatisfiable core [2022-04-28 03:56:26,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:56:26,594 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 03:56:27,015 INFO L272 TraceCheckUtils]: 0: Hoare triple {38314#true} call ULTIMATE.init(); {38314#true} is VALID [2022-04-28 03:56:27,015 INFO L290 TraceCheckUtils]: 1: Hoare triple {38314#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); {38314#true} is VALID [2022-04-28 03:56:27,015 INFO L290 TraceCheckUtils]: 2: Hoare triple {38314#true} assume true; {38314#true} is VALID [2022-04-28 03:56:27,015 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {38314#true} {38314#true} #52#return; {38314#true} is VALID [2022-04-28 03:56:27,015 INFO L272 TraceCheckUtils]: 4: Hoare triple {38314#true} call #t~ret7 := main(); {38314#true} is VALID [2022-04-28 03:56:27,016 INFO L290 TraceCheckUtils]: 5: Hoare triple {38314#true} ~x~0 := 0;~y~0 := 50000;~z~0 := 0;~x~0 := 0; {38319#(<= 50000 main_~y~0)} is VALID [2022-04-28 03:56:27,016 INFO L290 TraceCheckUtils]: 6: Hoare triple {38319#(<= 50000 main_~y~0)} [184] L11-2-->L18-1_primed: Formula: (let ((.cse0 (= v_main_~x~0_1974 v_main_~x~0_1973)) (.cse1 (= |v_main_#t~post4_203| |v_main_#t~post4_202|))) (or (and .cse0 .cse1) (and .cse0 .cse1 (<= 50000 v_main_~x~0_1974)) (and (< v_main_~x~0_1973 50001) (< v_main_~x~0_1974 v_main_~x~0_1973)))) InVars {main_~x~0=v_main_~x~0_1974, main_#t~post4=|v_main_#t~post4_203|} OutVars{main_~x~0=v_main_~x~0_1973, main_#t~post4=|v_main_#t~post4_202|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {38319#(<= 50000 main_~y~0)} is VALID [2022-04-28 03:56:27,016 INFO L290 TraceCheckUtils]: 7: Hoare triple {38319#(<= 50000 main_~y~0)} [185] L18-1_primed-->L11-2: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {38319#(<= 50000 main_~y~0)} is VALID [2022-04-28 03:56:27,017 INFO L290 TraceCheckUtils]: 8: Hoare triple {38319#(<= 50000 main_~y~0)} [186] L11-2-->L18-1_primed: Formula: (let ((.cse3 (<= 50000 v_main_~x~0_1976)) (.cse0 (= |v_main_#t~post6_221| |v_main_#t~post6_220|)) (.cse1 (= |v_main_#t~post5_221| |v_main_#t~post5_220|)) (.cse2 (= v_main_~y~0_2201 v_main_~y~0_2200)) (.cse4 (= v_main_~x~0_1976 v_main_~x~0_1975))) (or (and .cse0 .cse1 .cse2 (or (not .cse3) (not (< v_main_~x~0_1976 1000000))) .cse4) (let ((.cse5 (+ v_main_~x~0_1976 v_main_~y~0_2200))) (and (= (+ v_main_~x~0_1975 v_main_~y~0_2201) .cse5) .cse3 (< v_main_~y~0_2201 v_main_~y~0_2200) (< .cse5 (+ 1000001 v_main_~y~0_2201)))) (and .cse0 .cse1 .cse2 .cse4))) InVars {main_~y~0=v_main_~y~0_2201, main_#t~post5=|v_main_#t~post5_221|, main_~x~0=v_main_~x~0_1976, main_#t~post6=|v_main_#t~post6_221|} OutVars{main_~y~0=v_main_~y~0_2200, main_#t~post5=|v_main_#t~post5_220|, main_~x~0=v_main_~x~0_1975, main_#t~post6=|v_main_#t~post6_220|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {38319#(<= 50000 main_~y~0)} is VALID [2022-04-28 03:56:27,017 INFO L290 TraceCheckUtils]: 9: Hoare triple {38319#(<= 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[] {38319#(<= 50000 main_~y~0)} is VALID [2022-04-28 03:56:27,018 INFO L290 TraceCheckUtils]: 10: Hoare triple {38319#(<= 50000 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {38320#(<= 49998 main_~y~0)} is VALID [2022-04-28 03:56:27,018 INFO L290 TraceCheckUtils]: 11: Hoare triple {38320#(<= 49998 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {38321#(<= 49996 main_~y~0)} is VALID [2022-04-28 03:56:27,018 INFO L290 TraceCheckUtils]: 12: Hoare triple {38321#(<= 49996 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {38322#(<= 49994 main_~y~0)} is VALID [2022-04-28 03:56:27,019 INFO L290 TraceCheckUtils]: 13: Hoare triple {38322#(<= 49994 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {38323#(<= 49992 main_~y~0)} is VALID [2022-04-28 03:56:27,019 INFO L290 TraceCheckUtils]: 14: Hoare triple {38323#(<= 49992 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {38324#(<= 49990 main_~y~0)} is VALID [2022-04-28 03:56:27,020 INFO L290 TraceCheckUtils]: 15: Hoare triple {38324#(<= 49990 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {38325#(<= 49988 main_~y~0)} is VALID [2022-04-28 03:56:27,020 INFO L290 TraceCheckUtils]: 16: Hoare triple {38325#(<= 49988 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {38326#(<= 49986 main_~y~0)} is VALID [2022-04-28 03:56:27,021 INFO L290 TraceCheckUtils]: 17: Hoare triple {38326#(<= 49986 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {38327#(<= 49984 main_~y~0)} is VALID [2022-04-28 03:56:27,021 INFO L290 TraceCheckUtils]: 18: Hoare triple {38327#(<= 49984 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {38328#(<= 49982 main_~y~0)} is VALID [2022-04-28 03:56:27,021 INFO L290 TraceCheckUtils]: 19: Hoare triple {38328#(<= 49982 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {38329#(<= 49980 main_~y~0)} is VALID [2022-04-28 03:56:27,022 INFO L290 TraceCheckUtils]: 20: Hoare triple {38329#(<= 49980 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {38330#(<= 49978 main_~y~0)} is VALID [2022-04-28 03:56:27,022 INFO L290 TraceCheckUtils]: 21: Hoare triple {38330#(<= 49978 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {38331#(<= 49976 main_~y~0)} is VALID [2022-04-28 03:56:27,023 INFO L290 TraceCheckUtils]: 22: Hoare triple {38331#(<= 49976 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {38332#(<= 49974 main_~y~0)} is VALID [2022-04-28 03:56:27,023 INFO L290 TraceCheckUtils]: 23: Hoare triple {38332#(<= 49974 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {38333#(<= 49972 main_~y~0)} is VALID [2022-04-28 03:56:27,024 INFO L290 TraceCheckUtils]: 24: Hoare triple {38333#(<= 49972 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {38334#(<= 49970 main_~y~0)} is VALID [2022-04-28 03:56:27,024 INFO L290 TraceCheckUtils]: 25: Hoare triple {38334#(<= 49970 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {38335#(<= 49968 main_~y~0)} is VALID [2022-04-28 03:56:27,024 INFO L290 TraceCheckUtils]: 26: Hoare triple {38335#(<= 49968 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {38336#(<= 49966 main_~y~0)} is VALID [2022-04-28 03:56:27,025 INFO L290 TraceCheckUtils]: 27: Hoare triple {38336#(<= 49966 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {38337#(<= 49964 main_~y~0)} is VALID [2022-04-28 03:56:27,025 INFO L290 TraceCheckUtils]: 28: Hoare triple {38337#(<= 49964 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {38338#(<= 49962 main_~y~0)} is VALID [2022-04-28 03:56:27,026 INFO L290 TraceCheckUtils]: 29: Hoare triple {38338#(<= 49962 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {38339#(<= 49960 main_~y~0)} is VALID [2022-04-28 03:56:27,026 INFO L290 TraceCheckUtils]: 30: Hoare triple {38339#(<= 49960 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {38340#(<= 49958 main_~y~0)} is VALID [2022-04-28 03:56:27,026 INFO L290 TraceCheckUtils]: 31: Hoare triple {38340#(<= 49958 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {38341#(<= 49956 main_~y~0)} is VALID [2022-04-28 03:56:27,027 INFO L290 TraceCheckUtils]: 32: Hoare triple {38341#(<= 49956 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {38342#(<= 49954 main_~y~0)} is VALID [2022-04-28 03:56:27,027 INFO L290 TraceCheckUtils]: 33: Hoare triple {38342#(<= 49954 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {38343#(<= 49952 main_~y~0)} is VALID [2022-04-28 03:56:27,028 INFO L290 TraceCheckUtils]: 34: Hoare triple {38343#(<= 49952 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {38344#(<= 49950 main_~y~0)} is VALID [2022-04-28 03:56:27,028 INFO L290 TraceCheckUtils]: 35: Hoare triple {38344#(<= 49950 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {38345#(<= 49948 main_~y~0)} is VALID [2022-04-28 03:56:27,029 INFO L290 TraceCheckUtils]: 36: Hoare triple {38345#(<= 49948 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {38346#(<= 49946 main_~y~0)} is VALID [2022-04-28 03:56:27,029 INFO L290 TraceCheckUtils]: 37: Hoare triple {38346#(<= 49946 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {38347#(<= 49944 main_~y~0)} is VALID [2022-04-28 03:56:27,029 INFO L290 TraceCheckUtils]: 38: Hoare triple {38347#(<= 49944 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {38348#(<= 49942 main_~y~0)} is VALID [2022-04-28 03:56:27,030 INFO L290 TraceCheckUtils]: 39: Hoare triple {38348#(<= 49942 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {38349#(<= 49940 main_~y~0)} is VALID [2022-04-28 03:56:27,030 INFO L290 TraceCheckUtils]: 40: Hoare triple {38349#(<= 49940 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {38350#(<= 49938 main_~y~0)} is VALID [2022-04-28 03:56:27,031 INFO L290 TraceCheckUtils]: 41: Hoare triple {38350#(<= 49938 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {38351#(<= 49936 main_~y~0)} is VALID [2022-04-28 03:56:27,031 INFO L290 TraceCheckUtils]: 42: Hoare triple {38351#(<= 49936 main_~y~0)} assume !(~y~0 > 0); {38315#false} is VALID [2022-04-28 03:56:27,031 INFO L272 TraceCheckUtils]: 43: Hoare triple {38315#false} call __VERIFIER_assert((if ~z~0 == ~x~0 then 1 else 0)); {38315#false} is VALID [2022-04-28 03:56:27,031 INFO L290 TraceCheckUtils]: 44: Hoare triple {38315#false} ~cond := #in~cond; {38315#false} is VALID [2022-04-28 03:56:27,031 INFO L290 TraceCheckUtils]: 45: Hoare triple {38315#false} assume 0 == ~cond; {38315#false} is VALID [2022-04-28 03:56:27,031 INFO L290 TraceCheckUtils]: 46: Hoare triple {38315#false} assume !false; {38315#false} is VALID [2022-04-28 03:56:27,031 INFO L134 CoverageAnalysis]: Checked inductivity of 530 backedges. 0 proven. 528 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-04-28 03:56:27,032 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 03:56:28,538 INFO L290 TraceCheckUtils]: 46: Hoare triple {38315#false} assume !false; {38315#false} is VALID [2022-04-28 03:56:28,538 INFO L290 TraceCheckUtils]: 45: Hoare triple {38315#false} assume 0 == ~cond; {38315#false} is VALID [2022-04-28 03:56:28,538 INFO L290 TraceCheckUtils]: 44: Hoare triple {38315#false} ~cond := #in~cond; {38315#false} is VALID [2022-04-28 03:56:28,538 INFO L272 TraceCheckUtils]: 43: Hoare triple {38315#false} call __VERIFIER_assert((if ~z~0 == ~x~0 then 1 else 0)); {38315#false} is VALID [2022-04-28 03:56:28,538 INFO L290 TraceCheckUtils]: 42: Hoare triple {38506#(< 0 main_~y~0)} assume !(~y~0 > 0); {38315#false} is VALID [2022-04-28 03:56:28,539 INFO L290 TraceCheckUtils]: 41: Hoare triple {38510#(< 2 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {38506#(< 0 main_~y~0)} is VALID [2022-04-28 03:56:28,539 INFO L290 TraceCheckUtils]: 40: Hoare triple {38514#(< 4 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {38510#(< 2 main_~y~0)} is VALID [2022-04-28 03:56:28,540 INFO L290 TraceCheckUtils]: 39: Hoare triple {38518#(< 6 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {38514#(< 4 main_~y~0)} is VALID [2022-04-28 03:56:28,540 INFO L290 TraceCheckUtils]: 38: Hoare triple {38522#(< 8 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {38518#(< 6 main_~y~0)} is VALID [2022-04-28 03:56:28,541 INFO L290 TraceCheckUtils]: 37: Hoare triple {38526#(< 10 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {38522#(< 8 main_~y~0)} is VALID [2022-04-28 03:56:28,541 INFO L290 TraceCheckUtils]: 36: Hoare triple {38530#(< 12 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {38526#(< 10 main_~y~0)} is VALID [2022-04-28 03:56:28,541 INFO L290 TraceCheckUtils]: 35: Hoare triple {38534#(< 14 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {38530#(< 12 main_~y~0)} is VALID [2022-04-28 03:56:28,542 INFO L290 TraceCheckUtils]: 34: Hoare triple {38538#(< 16 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {38534#(< 14 main_~y~0)} is VALID [2022-04-28 03:56:28,542 INFO L290 TraceCheckUtils]: 33: Hoare triple {38542#(< 18 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {38538#(< 16 main_~y~0)} is VALID [2022-04-28 03:56:28,543 INFO L290 TraceCheckUtils]: 32: Hoare triple {38546#(< 20 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {38542#(< 18 main_~y~0)} is VALID [2022-04-28 03:56:28,547 INFO L290 TraceCheckUtils]: 31: Hoare triple {38550#(< 22 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {38546#(< 20 main_~y~0)} is VALID [2022-04-28 03:56:28,548 INFO L290 TraceCheckUtils]: 30: Hoare triple {38554#(< 24 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {38550#(< 22 main_~y~0)} is VALID [2022-04-28 03:56:28,548 INFO L290 TraceCheckUtils]: 29: Hoare triple {38558#(< 26 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {38554#(< 24 main_~y~0)} is VALID [2022-04-28 03:56:28,549 INFO L290 TraceCheckUtils]: 28: Hoare triple {38562#(< 28 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {38558#(< 26 main_~y~0)} is VALID [2022-04-28 03:56:28,549 INFO L290 TraceCheckUtils]: 27: Hoare triple {38566#(< 30 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {38562#(< 28 main_~y~0)} is VALID [2022-04-28 03:56:28,550 INFO L290 TraceCheckUtils]: 26: Hoare triple {38570#(< 32 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {38566#(< 30 main_~y~0)} is VALID [2022-04-28 03:56:28,550 INFO L290 TraceCheckUtils]: 25: Hoare triple {38574#(< 34 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {38570#(< 32 main_~y~0)} is VALID [2022-04-28 03:56:28,550 INFO L290 TraceCheckUtils]: 24: Hoare triple {38578#(< 36 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {38574#(< 34 main_~y~0)} is VALID [2022-04-28 03:56:28,551 INFO L290 TraceCheckUtils]: 23: Hoare triple {38582#(< 38 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {38578#(< 36 main_~y~0)} is VALID [2022-04-28 03:56:28,551 INFO L290 TraceCheckUtils]: 22: Hoare triple {38586#(< 40 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {38582#(< 38 main_~y~0)} is VALID [2022-04-28 03:56:28,552 INFO L290 TraceCheckUtils]: 21: Hoare triple {38590#(< 42 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {38586#(< 40 main_~y~0)} is VALID [2022-04-28 03:56:28,552 INFO L290 TraceCheckUtils]: 20: Hoare triple {38594#(< 44 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {38590#(< 42 main_~y~0)} is VALID [2022-04-28 03:56:28,553 INFO L290 TraceCheckUtils]: 19: Hoare triple {38598#(< 46 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {38594#(< 44 main_~y~0)} is VALID [2022-04-28 03:56:28,553 INFO L290 TraceCheckUtils]: 18: Hoare triple {38602#(< 48 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {38598#(< 46 main_~y~0)} is VALID [2022-04-28 03:56:28,554 INFO L290 TraceCheckUtils]: 17: Hoare triple {38606#(< 50 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {38602#(< 48 main_~y~0)} is VALID [2022-04-28 03:56:28,554 INFO L290 TraceCheckUtils]: 16: Hoare triple {38610#(< 52 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {38606#(< 50 main_~y~0)} is VALID [2022-04-28 03:56:28,554 INFO L290 TraceCheckUtils]: 15: Hoare triple {38614#(< 54 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {38610#(< 52 main_~y~0)} is VALID [2022-04-28 03:56:28,555 INFO L290 TraceCheckUtils]: 14: Hoare triple {38618#(< 56 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {38614#(< 54 main_~y~0)} is VALID [2022-04-28 03:56:28,555 INFO L290 TraceCheckUtils]: 13: Hoare triple {38622#(< 58 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {38618#(< 56 main_~y~0)} is VALID [2022-04-28 03:56:28,556 INFO L290 TraceCheckUtils]: 12: Hoare triple {38626#(< 60 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {38622#(< 58 main_~y~0)} is VALID [2022-04-28 03:56:28,556 INFO L290 TraceCheckUtils]: 11: Hoare triple {38630#(< 62 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {38626#(< 60 main_~y~0)} is VALID [2022-04-28 03:56:28,557 INFO L290 TraceCheckUtils]: 10: Hoare triple {38634#(< 64 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {38630#(< 62 main_~y~0)} is VALID [2022-04-28 03:56:28,557 INFO L290 TraceCheckUtils]: 9: Hoare triple {38634#(< 64 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[] {38634#(< 64 main_~y~0)} is VALID [2022-04-28 03:56:28,558 INFO L290 TraceCheckUtils]: 8: Hoare triple {38634#(< 64 main_~y~0)} [186] L11-2-->L18-1_primed: Formula: (let ((.cse3 (<= 50000 v_main_~x~0_1976)) (.cse0 (= |v_main_#t~post6_221| |v_main_#t~post6_220|)) (.cse1 (= |v_main_#t~post5_221| |v_main_#t~post5_220|)) (.cse2 (= v_main_~y~0_2201 v_main_~y~0_2200)) (.cse4 (= v_main_~x~0_1976 v_main_~x~0_1975))) (or (and .cse0 .cse1 .cse2 (or (not .cse3) (not (< v_main_~x~0_1976 1000000))) .cse4) (let ((.cse5 (+ v_main_~x~0_1976 v_main_~y~0_2200))) (and (= (+ v_main_~x~0_1975 v_main_~y~0_2201) .cse5) .cse3 (< v_main_~y~0_2201 v_main_~y~0_2200) (< .cse5 (+ 1000001 v_main_~y~0_2201)))) (and .cse0 .cse1 .cse2 .cse4))) InVars {main_~y~0=v_main_~y~0_2201, main_#t~post5=|v_main_#t~post5_221|, main_~x~0=v_main_~x~0_1976, main_#t~post6=|v_main_#t~post6_221|} OutVars{main_~y~0=v_main_~y~0_2200, main_#t~post5=|v_main_#t~post5_220|, main_~x~0=v_main_~x~0_1975, main_#t~post6=|v_main_#t~post6_220|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {38634#(< 64 main_~y~0)} is VALID [2022-04-28 03:56:28,558 INFO L290 TraceCheckUtils]: 7: Hoare triple {38634#(< 64 main_~y~0)} [185] L18-1_primed-->L11-2: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {38634#(< 64 main_~y~0)} is VALID [2022-04-28 03:56:28,558 INFO L290 TraceCheckUtils]: 6: Hoare triple {38634#(< 64 main_~y~0)} [184] L11-2-->L18-1_primed: Formula: (let ((.cse0 (= v_main_~x~0_1974 v_main_~x~0_1973)) (.cse1 (= |v_main_#t~post4_203| |v_main_#t~post4_202|))) (or (and .cse0 .cse1) (and .cse0 .cse1 (<= 50000 v_main_~x~0_1974)) (and (< v_main_~x~0_1973 50001) (< v_main_~x~0_1974 v_main_~x~0_1973)))) InVars {main_~x~0=v_main_~x~0_1974, main_#t~post4=|v_main_#t~post4_203|} OutVars{main_~x~0=v_main_~x~0_1973, main_#t~post4=|v_main_#t~post4_202|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {38634#(< 64 main_~y~0)} is VALID [2022-04-28 03:56:28,559 INFO L290 TraceCheckUtils]: 5: Hoare triple {38314#true} ~x~0 := 0;~y~0 := 50000;~z~0 := 0;~x~0 := 0; {38634#(< 64 main_~y~0)} is VALID [2022-04-28 03:56:28,559 INFO L272 TraceCheckUtils]: 4: Hoare triple {38314#true} call #t~ret7 := main(); {38314#true} is VALID [2022-04-28 03:56:28,559 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {38314#true} {38314#true} #52#return; {38314#true} is VALID [2022-04-28 03:56:28,559 INFO L290 TraceCheckUtils]: 2: Hoare triple {38314#true} assume true; {38314#true} is VALID [2022-04-28 03:56:28,559 INFO L290 TraceCheckUtils]: 1: Hoare triple {38314#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); {38314#true} is VALID [2022-04-28 03:56:28,559 INFO L272 TraceCheckUtils]: 0: Hoare triple {38314#true} call ULTIMATE.init(); {38314#true} is VALID [2022-04-28 03:56:28,559 INFO L134 CoverageAnalysis]: Checked inductivity of 530 backedges. 0 proven. 528 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-04-28 03:56:28,559 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2125348272] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 03:56:28,560 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 03:56:28,560 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [36, 35, 35] total 69 [2022-04-28 03:56:31,131 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 03:56:31,131 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [761845453] [2022-04-28 03:56:31,131 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [761845453] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 03:56:31,131 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 03:56:31,131 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [96] imperfect sequences [] total 96 [2022-04-28 03:56:31,131 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [192042943] [2022-04-28 03:56:31,131 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 03:56:31,132 INFO L78 Accepts]: Start accepts. Automaton has has 96 states, 96 states have (on average 1.6458333333333333) internal successors, (158), 95 states have internal predecessors, (158), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 162 [2022-04-28 03:56:31,132 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 03:56:31,132 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 96 states, 96 states have (on average 1.6458333333333333) internal successors, (158), 95 states have internal predecessors, (158), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:56:31,253 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 162 edges. 162 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 03:56:31,253 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 96 states [2022-04-28 03:56:31,253 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 03:56:31,254 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 96 interpolants. [2022-04-28 03:56:31,255 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6419, Invalid=10093, Unknown=0, NotChecked=0, Total=16512 [2022-04-28 03:56:31,255 INFO L87 Difference]: Start difference. First operand 277 states and 281 transitions. Second operand has 96 states, 96 states have (on average 1.6458333333333333) internal successors, (158), 95 states have internal predecessors, (158), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:56:45,502 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:56:45,502 INFO L93 Difference]: Finished difference Result 437 states and 451 transitions. [2022-04-28 03:56:45,502 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 96 states. [2022-04-28 03:56:45,502 INFO L78 Accepts]: Start accepts. Automaton has has 96 states, 96 states have (on average 1.6458333333333333) internal successors, (158), 95 states have internal predecessors, (158), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 162 [2022-04-28 03:56:45,503 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 03:56:45,503 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 96 states, 96 states have (on average 1.6458333333333333) internal successors, (158), 95 states have internal predecessors, (158), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:56:45,504 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 186 transitions. [2022-04-28 03:56:45,504 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 96 states, 96 states have (on average 1.6458333333333333) internal successors, (158), 95 states have internal predecessors, (158), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:56:45,505 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 186 transitions. [2022-04-28 03:56:45,505 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 96 states and 186 transitions. [2022-04-28 03:56:45,644 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 186 edges. 186 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 03:56:45,648 INFO L225 Difference]: With dead ends: 437 [2022-04-28 03:56:45,648 INFO L226 Difference]: Without dead ends: 284 [2022-04-28 03:56:45,651 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 347 GetRequests, 126 SyntacticMatches, 1 SemanticMatches, 220 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14219 ImplicationChecksByTransitivity, 6.7s TimeCoverageRelationStatistics Valid=14994, Invalid=34068, Unknown=0, NotChecked=0, Total=49062 [2022-04-28 03:56:45,651 INFO L413 NwaCegarLoop]: 12 mSDtfsCounter, 438 mSDsluCounter, 27 mSDsCounter, 0 mSdLazyCounter, 7165 mSolverCounterSat, 357 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 438 SdHoareTripleChecker+Valid, 39 SdHoareTripleChecker+Invalid, 7522 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 357 IncrementalHoareTripleChecker+Valid, 7165 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.6s IncrementalHoareTripleChecker+Time [2022-04-28 03:56:45,651 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [438 Valid, 39 Invalid, 7522 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [357 Valid, 7165 Invalid, 0 Unknown, 0 Unchecked, 5.6s Time] [2022-04-28 03:56:45,651 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 284 states. [2022-04-28 03:56:45,894 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 284 to 168. [2022-04-28 03:56:45,894 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 03:56:45,895 INFO L82 GeneralOperation]: Start isEquivalent. First operand 284 states. Second operand has 168 states, 163 states have (on average 1.0245398773006136) internal successors, (167), 163 states have internal predecessors, (167), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:56:45,895 INFO L74 IsIncluded]: Start isIncluded. First operand 284 states. Second operand has 168 states, 163 states have (on average 1.0245398773006136) internal successors, (167), 163 states have internal predecessors, (167), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:56:45,895 INFO L87 Difference]: Start difference. First operand 284 states. Second operand has 168 states, 163 states have (on average 1.0245398773006136) internal successors, (167), 163 states have internal predecessors, (167), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:56:45,898 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:56:45,898 INFO L93 Difference]: Finished difference Result 284 states and 288 transitions. [2022-04-28 03:56:45,898 INFO L276 IsEmpty]: Start isEmpty. Operand 284 states and 288 transitions. [2022-04-28 03:56:45,898 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:56:45,898 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:56:45,898 INFO L74 IsIncluded]: Start isIncluded. First operand has 168 states, 163 states have (on average 1.0245398773006136) internal successors, (167), 163 states have internal predecessors, (167), 3 states have call successors, (3), 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 284 states. [2022-04-28 03:56:45,898 INFO L87 Difference]: Start difference. First operand has 168 states, 163 states have (on average 1.0245398773006136) internal successors, (167), 163 states have internal predecessors, (167), 3 states have call successors, (3), 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 284 states. [2022-04-28 03:56:45,901 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:56:45,901 INFO L93 Difference]: Finished difference Result 284 states and 288 transitions. [2022-04-28 03:56:45,901 INFO L276 IsEmpty]: Start isEmpty. Operand 284 states and 288 transitions. [2022-04-28 03:56:45,901 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:56:45,901 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:56:45,902 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 03:56:45,902 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 03:56:45,902 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 168 states, 163 states have (on average 1.0245398773006136) internal successors, (167), 163 states have internal predecessors, (167), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:56:45,903 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 168 states to 168 states and 171 transitions. [2022-04-28 03:56:45,903 INFO L78 Accepts]: Start accepts. Automaton has 168 states and 171 transitions. Word has length 162 [2022-04-28 03:56:45,903 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 03:56:45,903 INFO L495 AbstractCegarLoop]: Abstraction has 168 states and 171 transitions. [2022-04-28 03:56:45,904 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 96 states, 96 states have (on average 1.6458333333333333) internal successors, (158), 95 states have internal predecessors, (158), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:56:45,904 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 168 states and 171 transitions. [2022-04-28 03:56:46,045 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-28 03:56:46,045 INFO L276 IsEmpty]: Start isEmpty. Operand 168 states and 171 transitions. [2022-04-28 03:56:46,046 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 168 [2022-04-28 03:56:46,046 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 03:56:46,046 INFO L195 NwaCegarLoop]: trace histogram [61, 60, 33, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 03:56:46,067 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-28 03:56:46,246 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34,33 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 03:56:46,247 INFO L420 AbstractCegarLoop]: === Iteration 36 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 03:56:46,247 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 03:56:46,247 INFO L85 PathProgramCache]: Analyzing trace with hash -198858307, now seen corresponding path program 33 times [2022-04-28 03:56:46,247 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 03:56:46,247 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1153780873] [2022-04-28 03:56:46,342 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 1 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 03:56:46,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-28 03:56:46,553 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-28 03:56:46,555 INFO L85 PathProgramCache]: Analyzing trace with hash 150712450, now seen corresponding path program 1 times [2022-04-28 03:56:46,555 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 03:56:46,555 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1575535830] [2022-04-28 03:56:46,555 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:56:46,555 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 03:56:46,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:56:47,128 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 03:56:47,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:56:47,131 INFO L290 TraceCheckUtils]: 0: Hoare triple {40730#(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); {40691#true} is VALID [2022-04-28 03:56:47,131 INFO L290 TraceCheckUtils]: 1: Hoare triple {40691#true} assume true; {40691#true} is VALID [2022-04-28 03:56:47,131 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {40691#true} {40691#true} #52#return; {40691#true} is VALID [2022-04-28 03:56:47,132 INFO L272 TraceCheckUtils]: 0: Hoare triple {40691#true} call ULTIMATE.init(); {40730#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 03:56:47,132 INFO L290 TraceCheckUtils]: 1: Hoare triple {40730#(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); {40691#true} is VALID [2022-04-28 03:56:47,132 INFO L290 TraceCheckUtils]: 2: Hoare triple {40691#true} assume true; {40691#true} is VALID [2022-04-28 03:56:47,132 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {40691#true} {40691#true} #52#return; {40691#true} is VALID [2022-04-28 03:56:47,132 INFO L272 TraceCheckUtils]: 4: Hoare triple {40691#true} call #t~ret7 := main(); {40691#true} is VALID [2022-04-28 03:56:47,132 INFO L290 TraceCheckUtils]: 5: Hoare triple {40691#true} ~x~0 := 0;~y~0 := 50000;~z~0 := 0;~x~0 := 0; {40696#(<= 50000 main_~y~0)} is VALID [2022-04-28 03:56:47,133 INFO L290 TraceCheckUtils]: 6: Hoare triple {40696#(<= 50000 main_~y~0)} [188] L11-2-->L18-1_primed: Formula: (let ((.cse0 (= v_main_~x~0_2081 v_main_~x~0_2080)) (.cse1 (= |v_main_#t~post4_209| |v_main_#t~post4_208|))) (or (and (<= 50000 v_main_~x~0_2081) .cse0 .cse1) (and .cse0 .cse1) (and (< v_main_~x~0_2080 50001) (< v_main_~x~0_2081 v_main_~x~0_2080)))) InVars {main_~x~0=v_main_~x~0_2081, main_#t~post4=|v_main_#t~post4_209|} OutVars{main_~x~0=v_main_~x~0_2080, main_#t~post4=|v_main_#t~post4_208|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {40696#(<= 50000 main_~y~0)} is VALID [2022-04-28 03:56:47,133 INFO L290 TraceCheckUtils]: 7: Hoare triple {40696#(<= 50000 main_~y~0)} [189] L18-1_primed-->L11-2: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {40696#(<= 50000 main_~y~0)} is VALID [2022-04-28 03:56:47,134 INFO L290 TraceCheckUtils]: 8: Hoare triple {40696#(<= 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_~y~0_2332 v_main_~y~0_2331)) (.cse2 (= v_main_~x~0_2083 v_main_~x~0_2082)) (.cse3 (= |v_main_#t~post5_228| |v_main_#t~post5_227|)) (.cse4 (<= 50000 v_main_~x~0_2083))) (or (and .cse0 .cse1 .cse2 .cse3) (and .cse0 .cse1 .cse2 .cse3 (or (not (< v_main_~x~0_2083 1000000)) (not .cse4))) (and (< v_main_~x~0_2082 1000001) (< v_main_~x~0_2083 v_main_~x~0_2082) .cse4 (= (+ v_main_~x~0_2082 v_main_~y~0_2332) (+ v_main_~x~0_2083 v_main_~y~0_2331))))) InVars {main_~y~0=v_main_~y~0_2332, main_#t~post5=|v_main_#t~post5_228|, main_~x~0=v_main_~x~0_2083, main_#t~post6=|v_main_#t~post6_228|} OutVars{main_~y~0=v_main_~y~0_2331, main_#t~post5=|v_main_#t~post5_227|, main_~x~0=v_main_~x~0_2082, main_#t~post6=|v_main_#t~post6_227|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {40696#(<= 50000 main_~y~0)} is VALID [2022-04-28 03:56:47,134 INFO L290 TraceCheckUtils]: 9: Hoare triple {40696#(<= 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[] {40696#(<= 50000 main_~y~0)} is VALID [2022-04-28 03:56:47,134 INFO L290 TraceCheckUtils]: 10: Hoare triple {40696#(<= 50000 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {40697#(<= 49998 main_~y~0)} is VALID [2022-04-28 03:56:47,135 INFO L290 TraceCheckUtils]: 11: Hoare triple {40697#(<= 49998 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {40698#(<= 49996 main_~y~0)} is VALID [2022-04-28 03:56:47,135 INFO L290 TraceCheckUtils]: 12: Hoare triple {40698#(<= 49996 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {40699#(<= 49994 main_~y~0)} is VALID [2022-04-28 03:56:47,136 INFO L290 TraceCheckUtils]: 13: Hoare triple {40699#(<= 49994 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {40700#(<= 49992 main_~y~0)} is VALID [2022-04-28 03:56:47,136 INFO L290 TraceCheckUtils]: 14: Hoare triple {40700#(<= 49992 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {40701#(<= 49990 main_~y~0)} is VALID [2022-04-28 03:56:47,136 INFO L290 TraceCheckUtils]: 15: Hoare triple {40701#(<= 49990 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {40702#(<= 49988 main_~y~0)} is VALID [2022-04-28 03:56:47,137 INFO L290 TraceCheckUtils]: 16: Hoare triple {40702#(<= 49988 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {40703#(<= 49986 main_~y~0)} is VALID [2022-04-28 03:56:47,137 INFO L290 TraceCheckUtils]: 17: Hoare triple {40703#(<= 49986 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {40704#(<= 49984 main_~y~0)} is VALID [2022-04-28 03:56:47,138 INFO L290 TraceCheckUtils]: 18: Hoare triple {40704#(<= 49984 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {40705#(<= 49982 main_~y~0)} is VALID [2022-04-28 03:56:47,138 INFO L290 TraceCheckUtils]: 19: Hoare triple {40705#(<= 49982 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {40706#(<= 49980 main_~y~0)} is VALID [2022-04-28 03:56:47,138 INFO L290 TraceCheckUtils]: 20: Hoare triple {40706#(<= 49980 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {40707#(<= 49978 main_~y~0)} is VALID [2022-04-28 03:56:47,139 INFO L290 TraceCheckUtils]: 21: Hoare triple {40707#(<= 49978 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {40708#(<= 49976 main_~y~0)} is VALID [2022-04-28 03:56:47,139 INFO L290 TraceCheckUtils]: 22: Hoare triple {40708#(<= 49976 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {40709#(<= 49974 main_~y~0)} is VALID [2022-04-28 03:56:47,140 INFO L290 TraceCheckUtils]: 23: Hoare triple {40709#(<= 49974 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {40710#(<= 49972 main_~y~0)} is VALID [2022-04-28 03:56:47,140 INFO L290 TraceCheckUtils]: 24: Hoare triple {40710#(<= 49972 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {40711#(<= 49970 main_~y~0)} is VALID [2022-04-28 03:56:47,141 INFO L290 TraceCheckUtils]: 25: Hoare triple {40711#(<= 49970 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {40712#(<= 49968 main_~y~0)} is VALID [2022-04-28 03:56:47,141 INFO L290 TraceCheckUtils]: 26: Hoare triple {40712#(<= 49968 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {40713#(<= 49966 main_~y~0)} is VALID [2022-04-28 03:56:47,141 INFO L290 TraceCheckUtils]: 27: Hoare triple {40713#(<= 49966 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {40714#(<= 49964 main_~y~0)} is VALID [2022-04-28 03:56:47,142 INFO L290 TraceCheckUtils]: 28: Hoare triple {40714#(<= 49964 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {40715#(<= 49962 main_~y~0)} is VALID [2022-04-28 03:56:47,142 INFO L290 TraceCheckUtils]: 29: Hoare triple {40715#(<= 49962 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {40716#(<= 49960 main_~y~0)} is VALID [2022-04-28 03:56:47,143 INFO L290 TraceCheckUtils]: 30: Hoare triple {40716#(<= 49960 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {40717#(<= 49958 main_~y~0)} is VALID [2022-04-28 03:56:47,143 INFO L290 TraceCheckUtils]: 31: Hoare triple {40717#(<= 49958 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {40718#(<= 49956 main_~y~0)} is VALID [2022-04-28 03:56:47,143 INFO L290 TraceCheckUtils]: 32: Hoare triple {40718#(<= 49956 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {40719#(<= 49954 main_~y~0)} is VALID [2022-04-28 03:56:47,144 INFO L290 TraceCheckUtils]: 33: Hoare triple {40719#(<= 49954 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {40720#(<= 49952 main_~y~0)} is VALID [2022-04-28 03:56:47,144 INFO L290 TraceCheckUtils]: 34: Hoare triple {40720#(<= 49952 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {40721#(<= 49950 main_~y~0)} is VALID [2022-04-28 03:56:47,145 INFO L290 TraceCheckUtils]: 35: Hoare triple {40721#(<= 49950 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {40722#(<= 49948 main_~y~0)} is VALID [2022-04-28 03:56:47,145 INFO L290 TraceCheckUtils]: 36: Hoare triple {40722#(<= 49948 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {40723#(<= 49946 main_~y~0)} is VALID [2022-04-28 03:56:47,146 INFO L290 TraceCheckUtils]: 37: Hoare triple {40723#(<= 49946 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {40724#(<= 49944 main_~y~0)} is VALID [2022-04-28 03:56:47,146 INFO L290 TraceCheckUtils]: 38: Hoare triple {40724#(<= 49944 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {40725#(<= 49942 main_~y~0)} is VALID [2022-04-28 03:56:47,146 INFO L290 TraceCheckUtils]: 39: Hoare triple {40725#(<= 49942 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {40726#(<= 49940 main_~y~0)} is VALID [2022-04-28 03:56:47,147 INFO L290 TraceCheckUtils]: 40: Hoare triple {40726#(<= 49940 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {40727#(<= 49938 main_~y~0)} is VALID [2022-04-28 03:56:47,147 INFO L290 TraceCheckUtils]: 41: Hoare triple {40727#(<= 49938 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {40728#(<= 49936 main_~y~0)} is VALID [2022-04-28 03:56:47,148 INFO L290 TraceCheckUtils]: 42: Hoare triple {40728#(<= 49936 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {40729#(<= 49934 main_~y~0)} is VALID [2022-04-28 03:56:47,148 INFO L290 TraceCheckUtils]: 43: Hoare triple {40729#(<= 49934 main_~y~0)} assume !(~y~0 > 0); {40692#false} is VALID [2022-04-28 03:56:47,148 INFO L272 TraceCheckUtils]: 44: Hoare triple {40692#false} call __VERIFIER_assert((if ~z~0 == ~x~0 then 1 else 0)); {40692#false} is VALID [2022-04-28 03:56:47,148 INFO L290 TraceCheckUtils]: 45: Hoare triple {40692#false} ~cond := #in~cond; {40692#false} is VALID [2022-04-28 03:56:47,148 INFO L290 TraceCheckUtils]: 46: Hoare triple {40692#false} assume 0 == ~cond; {40692#false} is VALID [2022-04-28 03:56:47,148 INFO L290 TraceCheckUtils]: 47: Hoare triple {40692#false} assume !false; {40692#false} is VALID [2022-04-28 03:56:47,148 INFO L134 CoverageAnalysis]: Checked inductivity of 563 backedges. 0 proven. 561 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-04-28 03:56:47,149 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 03:56:47,149 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1575535830] [2022-04-28 03:56:47,149 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1575535830] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 03:56:47,149 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [376116291] [2022-04-28 03:56:47,149 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:56:47,149 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 03:56:47,149 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 03:56:47,150 INFO L229 MonitoredProcess]: Starting monitored process 34 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 03:56:47,151 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (34)] Waiting until timeout for monitored process [2022-04-28 03:56:47,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:56:47,200 INFO L263 TraceCheckSpWp]: Trace formula consists of 224 conjuncts, 36 conjunts are in the unsatisfiable core [2022-04-28 03:56:47,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:56:47,220 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 03:56:47,685 INFO L272 TraceCheckUtils]: 0: Hoare triple {40691#true} call ULTIMATE.init(); {40691#true} is VALID [2022-04-28 03:56:47,685 INFO L290 TraceCheckUtils]: 1: Hoare triple {40691#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); {40691#true} is VALID [2022-04-28 03:56:47,685 INFO L290 TraceCheckUtils]: 2: Hoare triple {40691#true} assume true; {40691#true} is VALID [2022-04-28 03:56:47,685 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {40691#true} {40691#true} #52#return; {40691#true} is VALID [2022-04-28 03:56:47,685 INFO L272 TraceCheckUtils]: 4: Hoare triple {40691#true} call #t~ret7 := main(); {40691#true} is VALID [2022-04-28 03:56:47,685 INFO L290 TraceCheckUtils]: 5: Hoare triple {40691#true} ~x~0 := 0;~y~0 := 50000;~z~0 := 0;~x~0 := 0; {40696#(<= 50000 main_~y~0)} is VALID [2022-04-28 03:56:47,686 INFO L290 TraceCheckUtils]: 6: Hoare triple {40696#(<= 50000 main_~y~0)} [188] L11-2-->L18-1_primed: Formula: (let ((.cse0 (= v_main_~x~0_2081 v_main_~x~0_2080)) (.cse1 (= |v_main_#t~post4_209| |v_main_#t~post4_208|))) (or (and (<= 50000 v_main_~x~0_2081) .cse0 .cse1) (and .cse0 .cse1) (and (< v_main_~x~0_2080 50001) (< v_main_~x~0_2081 v_main_~x~0_2080)))) InVars {main_~x~0=v_main_~x~0_2081, main_#t~post4=|v_main_#t~post4_209|} OutVars{main_~x~0=v_main_~x~0_2080, main_#t~post4=|v_main_#t~post4_208|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {40696#(<= 50000 main_~y~0)} is VALID [2022-04-28 03:56:47,686 INFO L290 TraceCheckUtils]: 7: Hoare triple {40696#(<= 50000 main_~y~0)} [189] L18-1_primed-->L11-2: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {40696#(<= 50000 main_~y~0)} is VALID [2022-04-28 03:56:47,687 INFO L290 TraceCheckUtils]: 8: Hoare triple {40696#(<= 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_~y~0_2332 v_main_~y~0_2331)) (.cse2 (= v_main_~x~0_2083 v_main_~x~0_2082)) (.cse3 (= |v_main_#t~post5_228| |v_main_#t~post5_227|)) (.cse4 (<= 50000 v_main_~x~0_2083))) (or (and .cse0 .cse1 .cse2 .cse3) (and .cse0 .cse1 .cse2 .cse3 (or (not (< v_main_~x~0_2083 1000000)) (not .cse4))) (and (< v_main_~x~0_2082 1000001) (< v_main_~x~0_2083 v_main_~x~0_2082) .cse4 (= (+ v_main_~x~0_2082 v_main_~y~0_2332) (+ v_main_~x~0_2083 v_main_~y~0_2331))))) InVars {main_~y~0=v_main_~y~0_2332, main_#t~post5=|v_main_#t~post5_228|, main_~x~0=v_main_~x~0_2083, main_#t~post6=|v_main_#t~post6_228|} OutVars{main_~y~0=v_main_~y~0_2331, main_#t~post5=|v_main_#t~post5_227|, main_~x~0=v_main_~x~0_2082, main_#t~post6=|v_main_#t~post6_227|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {40696#(<= 50000 main_~y~0)} is VALID [2022-04-28 03:56:47,687 INFO L290 TraceCheckUtils]: 9: Hoare triple {40696#(<= 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[] {40696#(<= 50000 main_~y~0)} is VALID [2022-04-28 03:56:47,687 INFO L290 TraceCheckUtils]: 10: Hoare triple {40696#(<= 50000 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {40697#(<= 49998 main_~y~0)} is VALID [2022-04-28 03:56:47,688 INFO L290 TraceCheckUtils]: 11: Hoare triple {40697#(<= 49998 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {40698#(<= 49996 main_~y~0)} is VALID [2022-04-28 03:56:47,688 INFO L290 TraceCheckUtils]: 12: Hoare triple {40698#(<= 49996 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {40699#(<= 49994 main_~y~0)} is VALID [2022-04-28 03:56:47,689 INFO L290 TraceCheckUtils]: 13: Hoare triple {40699#(<= 49994 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {40700#(<= 49992 main_~y~0)} is VALID [2022-04-28 03:56:47,689 INFO L290 TraceCheckUtils]: 14: Hoare triple {40700#(<= 49992 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {40701#(<= 49990 main_~y~0)} is VALID [2022-04-28 03:56:47,689 INFO L290 TraceCheckUtils]: 15: Hoare triple {40701#(<= 49990 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {40702#(<= 49988 main_~y~0)} is VALID [2022-04-28 03:56:47,690 INFO L290 TraceCheckUtils]: 16: Hoare triple {40702#(<= 49988 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {40703#(<= 49986 main_~y~0)} is VALID [2022-04-28 03:56:47,690 INFO L290 TraceCheckUtils]: 17: Hoare triple {40703#(<= 49986 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {40704#(<= 49984 main_~y~0)} is VALID [2022-04-28 03:56:47,691 INFO L290 TraceCheckUtils]: 18: Hoare triple {40704#(<= 49984 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {40705#(<= 49982 main_~y~0)} is VALID [2022-04-28 03:56:47,691 INFO L290 TraceCheckUtils]: 19: Hoare triple {40705#(<= 49982 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {40706#(<= 49980 main_~y~0)} is VALID [2022-04-28 03:56:47,692 INFO L290 TraceCheckUtils]: 20: Hoare triple {40706#(<= 49980 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {40707#(<= 49978 main_~y~0)} is VALID [2022-04-28 03:56:47,692 INFO L290 TraceCheckUtils]: 21: Hoare triple {40707#(<= 49978 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {40708#(<= 49976 main_~y~0)} is VALID [2022-04-28 03:56:47,692 INFO L290 TraceCheckUtils]: 22: Hoare triple {40708#(<= 49976 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {40709#(<= 49974 main_~y~0)} is VALID [2022-04-28 03:56:47,693 INFO L290 TraceCheckUtils]: 23: Hoare triple {40709#(<= 49974 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {40710#(<= 49972 main_~y~0)} is VALID [2022-04-28 03:56:47,693 INFO L290 TraceCheckUtils]: 24: Hoare triple {40710#(<= 49972 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {40711#(<= 49970 main_~y~0)} is VALID [2022-04-28 03:56:47,694 INFO L290 TraceCheckUtils]: 25: Hoare triple {40711#(<= 49970 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {40712#(<= 49968 main_~y~0)} is VALID [2022-04-28 03:56:47,694 INFO L290 TraceCheckUtils]: 26: Hoare triple {40712#(<= 49968 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {40713#(<= 49966 main_~y~0)} is VALID [2022-04-28 03:56:47,694 INFO L290 TraceCheckUtils]: 27: Hoare triple {40713#(<= 49966 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {40714#(<= 49964 main_~y~0)} is VALID [2022-04-28 03:56:47,695 INFO L290 TraceCheckUtils]: 28: Hoare triple {40714#(<= 49964 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {40715#(<= 49962 main_~y~0)} is VALID [2022-04-28 03:56:47,695 INFO L290 TraceCheckUtils]: 29: Hoare triple {40715#(<= 49962 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {40716#(<= 49960 main_~y~0)} is VALID [2022-04-28 03:56:47,696 INFO L290 TraceCheckUtils]: 30: Hoare triple {40716#(<= 49960 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {40717#(<= 49958 main_~y~0)} is VALID [2022-04-28 03:56:47,696 INFO L290 TraceCheckUtils]: 31: Hoare triple {40717#(<= 49958 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {40718#(<= 49956 main_~y~0)} is VALID [2022-04-28 03:56:47,697 INFO L290 TraceCheckUtils]: 32: Hoare triple {40718#(<= 49956 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {40719#(<= 49954 main_~y~0)} is VALID [2022-04-28 03:56:47,697 INFO L290 TraceCheckUtils]: 33: Hoare triple {40719#(<= 49954 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {40720#(<= 49952 main_~y~0)} is VALID [2022-04-28 03:56:47,697 INFO L290 TraceCheckUtils]: 34: Hoare triple {40720#(<= 49952 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {40721#(<= 49950 main_~y~0)} is VALID [2022-04-28 03:56:47,698 INFO L290 TraceCheckUtils]: 35: Hoare triple {40721#(<= 49950 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {40722#(<= 49948 main_~y~0)} is VALID [2022-04-28 03:56:47,698 INFO L290 TraceCheckUtils]: 36: Hoare triple {40722#(<= 49948 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {40723#(<= 49946 main_~y~0)} is VALID [2022-04-28 03:56:47,699 INFO L290 TraceCheckUtils]: 37: Hoare triple {40723#(<= 49946 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {40724#(<= 49944 main_~y~0)} is VALID [2022-04-28 03:56:47,699 INFO L290 TraceCheckUtils]: 38: Hoare triple {40724#(<= 49944 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {40725#(<= 49942 main_~y~0)} is VALID [2022-04-28 03:56:47,700 INFO L290 TraceCheckUtils]: 39: Hoare triple {40725#(<= 49942 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {40726#(<= 49940 main_~y~0)} is VALID [2022-04-28 03:56:47,700 INFO L290 TraceCheckUtils]: 40: Hoare triple {40726#(<= 49940 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {40727#(<= 49938 main_~y~0)} is VALID [2022-04-28 03:56:47,700 INFO L290 TraceCheckUtils]: 41: Hoare triple {40727#(<= 49938 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {40728#(<= 49936 main_~y~0)} is VALID [2022-04-28 03:56:47,701 INFO L290 TraceCheckUtils]: 42: Hoare triple {40728#(<= 49936 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {40729#(<= 49934 main_~y~0)} is VALID [2022-04-28 03:56:47,701 INFO L290 TraceCheckUtils]: 43: Hoare triple {40729#(<= 49934 main_~y~0)} assume !(~y~0 > 0); {40692#false} is VALID [2022-04-28 03:56:47,701 INFO L272 TraceCheckUtils]: 44: Hoare triple {40692#false} call __VERIFIER_assert((if ~z~0 == ~x~0 then 1 else 0)); {40692#false} is VALID [2022-04-28 03:56:47,701 INFO L290 TraceCheckUtils]: 45: Hoare triple {40692#false} ~cond := #in~cond; {40692#false} is VALID [2022-04-28 03:56:47,701 INFO L290 TraceCheckUtils]: 46: Hoare triple {40692#false} assume 0 == ~cond; {40692#false} is VALID [2022-04-28 03:56:47,701 INFO L290 TraceCheckUtils]: 47: Hoare triple {40692#false} assume !false; {40692#false} is VALID [2022-04-28 03:56:47,702 INFO L134 CoverageAnalysis]: Checked inductivity of 563 backedges. 0 proven. 561 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-04-28 03:56:47,702 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 03:56:49,278 INFO L290 TraceCheckUtils]: 47: Hoare triple {40692#false} assume !false; {40692#false} is VALID [2022-04-28 03:56:49,278 INFO L290 TraceCheckUtils]: 46: Hoare triple {40692#false} assume 0 == ~cond; {40692#false} is VALID [2022-04-28 03:56:49,278 INFO L290 TraceCheckUtils]: 45: Hoare triple {40692#false} ~cond := #in~cond; {40692#false} is VALID [2022-04-28 03:56:49,278 INFO L272 TraceCheckUtils]: 44: Hoare triple {40692#false} call __VERIFIER_assert((if ~z~0 == ~x~0 then 1 else 0)); {40692#false} is VALID [2022-04-28 03:56:49,282 INFO L290 TraceCheckUtils]: 43: Hoare triple {40887#(< 0 main_~y~0)} assume !(~y~0 > 0); {40692#false} is VALID [2022-04-28 03:56:49,283 INFO L290 TraceCheckUtils]: 42: Hoare triple {40891#(< 2 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {40887#(< 0 main_~y~0)} is VALID [2022-04-28 03:56:49,283 INFO L290 TraceCheckUtils]: 41: Hoare triple {40895#(< 4 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {40891#(< 2 main_~y~0)} is VALID [2022-04-28 03:56:49,287 INFO L290 TraceCheckUtils]: 40: Hoare triple {40899#(< 6 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {40895#(< 4 main_~y~0)} is VALID [2022-04-28 03:56:49,299 INFO L290 TraceCheckUtils]: 39: Hoare triple {40903#(< 8 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {40899#(< 6 main_~y~0)} is VALID [2022-04-28 03:56:49,300 INFO L290 TraceCheckUtils]: 38: Hoare triple {40907#(< 10 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {40903#(< 8 main_~y~0)} is VALID [2022-04-28 03:56:49,300 INFO L290 TraceCheckUtils]: 37: Hoare triple {40911#(< 12 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {40907#(< 10 main_~y~0)} is VALID [2022-04-28 03:56:49,301 INFO L290 TraceCheckUtils]: 36: Hoare triple {40915#(< 14 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {40911#(< 12 main_~y~0)} is VALID [2022-04-28 03:56:49,301 INFO L290 TraceCheckUtils]: 35: Hoare triple {40919#(< 16 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {40915#(< 14 main_~y~0)} is VALID [2022-04-28 03:56:49,302 INFO L290 TraceCheckUtils]: 34: Hoare triple {40923#(< 18 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {40919#(< 16 main_~y~0)} is VALID [2022-04-28 03:56:49,302 INFO L290 TraceCheckUtils]: 33: Hoare triple {40927#(< 20 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {40923#(< 18 main_~y~0)} is VALID [2022-04-28 03:56:49,302 INFO L290 TraceCheckUtils]: 32: Hoare triple {40931#(< 22 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {40927#(< 20 main_~y~0)} is VALID [2022-04-28 03:56:49,303 INFO L290 TraceCheckUtils]: 31: Hoare triple {40935#(< 24 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {40931#(< 22 main_~y~0)} is VALID [2022-04-28 03:56:49,303 INFO L290 TraceCheckUtils]: 30: Hoare triple {40939#(< 26 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {40935#(< 24 main_~y~0)} is VALID [2022-04-28 03:56:49,304 INFO L290 TraceCheckUtils]: 29: Hoare triple {40943#(< 28 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {40939#(< 26 main_~y~0)} is VALID [2022-04-28 03:56:49,304 INFO L290 TraceCheckUtils]: 28: Hoare triple {40947#(< 30 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {40943#(< 28 main_~y~0)} is VALID [2022-04-28 03:56:49,305 INFO L290 TraceCheckUtils]: 27: Hoare triple {40951#(< 32 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {40947#(< 30 main_~y~0)} is VALID [2022-04-28 03:56:49,305 INFO L290 TraceCheckUtils]: 26: Hoare triple {40955#(< 34 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {40951#(< 32 main_~y~0)} is VALID [2022-04-28 03:56:49,306 INFO L290 TraceCheckUtils]: 25: Hoare triple {40959#(< 36 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {40955#(< 34 main_~y~0)} is VALID [2022-04-28 03:56:49,306 INFO L290 TraceCheckUtils]: 24: Hoare triple {40963#(< 38 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {40959#(< 36 main_~y~0)} is VALID [2022-04-28 03:56:49,306 INFO L290 TraceCheckUtils]: 23: Hoare triple {40967#(< 40 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {40963#(< 38 main_~y~0)} is VALID [2022-04-28 03:56:49,307 INFO L290 TraceCheckUtils]: 22: Hoare triple {40971#(< 42 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {40967#(< 40 main_~y~0)} is VALID [2022-04-28 03:56:49,307 INFO L290 TraceCheckUtils]: 21: Hoare triple {40975#(< 44 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {40971#(< 42 main_~y~0)} is VALID [2022-04-28 03:56:49,308 INFO L290 TraceCheckUtils]: 20: Hoare triple {40979#(< 46 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {40975#(< 44 main_~y~0)} is VALID [2022-04-28 03:56:49,308 INFO L290 TraceCheckUtils]: 19: Hoare triple {40983#(< 48 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {40979#(< 46 main_~y~0)} is VALID [2022-04-28 03:56:49,309 INFO L290 TraceCheckUtils]: 18: Hoare triple {40987#(< 50 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {40983#(< 48 main_~y~0)} is VALID [2022-04-28 03:56:49,309 INFO L290 TraceCheckUtils]: 17: Hoare triple {40991#(< 52 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {40987#(< 50 main_~y~0)} is VALID [2022-04-28 03:56:49,309 INFO L290 TraceCheckUtils]: 16: Hoare triple {40995#(< 54 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {40991#(< 52 main_~y~0)} is VALID [2022-04-28 03:56:49,310 INFO L290 TraceCheckUtils]: 15: Hoare triple {40999#(< 56 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {40995#(< 54 main_~y~0)} is VALID [2022-04-28 03:56:49,310 INFO L290 TraceCheckUtils]: 14: Hoare triple {41003#(< 58 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {40999#(< 56 main_~y~0)} is VALID [2022-04-28 03:56:49,311 INFO L290 TraceCheckUtils]: 13: Hoare triple {41007#(< 60 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {41003#(< 58 main_~y~0)} is VALID [2022-04-28 03:56:49,311 INFO L290 TraceCheckUtils]: 12: Hoare triple {41011#(< 62 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {41007#(< 60 main_~y~0)} is VALID [2022-04-28 03:56:49,312 INFO L290 TraceCheckUtils]: 11: Hoare triple {41015#(< 64 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {41011#(< 62 main_~y~0)} is VALID [2022-04-28 03:56:49,312 INFO L290 TraceCheckUtils]: 10: Hoare triple {41019#(< 66 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {41015#(< 64 main_~y~0)} is VALID [2022-04-28 03:56:49,312 INFO L290 TraceCheckUtils]: 9: Hoare triple {41019#(< 66 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[] {41019#(< 66 main_~y~0)} is VALID [2022-04-28 03:56:49,313 INFO L290 TraceCheckUtils]: 8: Hoare triple {41019#(< 66 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_~y~0_2332 v_main_~y~0_2331)) (.cse2 (= v_main_~x~0_2083 v_main_~x~0_2082)) (.cse3 (= |v_main_#t~post5_228| |v_main_#t~post5_227|)) (.cse4 (<= 50000 v_main_~x~0_2083))) (or (and .cse0 .cse1 .cse2 .cse3) (and .cse0 .cse1 .cse2 .cse3 (or (not (< v_main_~x~0_2083 1000000)) (not .cse4))) (and (< v_main_~x~0_2082 1000001) (< v_main_~x~0_2083 v_main_~x~0_2082) .cse4 (= (+ v_main_~x~0_2082 v_main_~y~0_2332) (+ v_main_~x~0_2083 v_main_~y~0_2331))))) InVars {main_~y~0=v_main_~y~0_2332, main_#t~post5=|v_main_#t~post5_228|, main_~x~0=v_main_~x~0_2083, main_#t~post6=|v_main_#t~post6_228|} OutVars{main_~y~0=v_main_~y~0_2331, main_#t~post5=|v_main_#t~post5_227|, main_~x~0=v_main_~x~0_2082, main_#t~post6=|v_main_#t~post6_227|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {41019#(< 66 main_~y~0)} is VALID [2022-04-28 03:56:49,313 INFO L290 TraceCheckUtils]: 7: Hoare triple {41019#(< 66 main_~y~0)} [189] L18-1_primed-->L11-2: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {41019#(< 66 main_~y~0)} is VALID [2022-04-28 03:56:49,314 INFO L290 TraceCheckUtils]: 6: Hoare triple {41019#(< 66 main_~y~0)} [188] L11-2-->L18-1_primed: Formula: (let ((.cse0 (= v_main_~x~0_2081 v_main_~x~0_2080)) (.cse1 (= |v_main_#t~post4_209| |v_main_#t~post4_208|))) (or (and (<= 50000 v_main_~x~0_2081) .cse0 .cse1) (and .cse0 .cse1) (and (< v_main_~x~0_2080 50001) (< v_main_~x~0_2081 v_main_~x~0_2080)))) InVars {main_~x~0=v_main_~x~0_2081, main_#t~post4=|v_main_#t~post4_209|} OutVars{main_~x~0=v_main_~x~0_2080, main_#t~post4=|v_main_#t~post4_208|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {41019#(< 66 main_~y~0)} is VALID [2022-04-28 03:56:49,314 INFO L290 TraceCheckUtils]: 5: Hoare triple {40691#true} ~x~0 := 0;~y~0 := 50000;~z~0 := 0;~x~0 := 0; {41019#(< 66 main_~y~0)} is VALID [2022-04-28 03:56:49,314 INFO L272 TraceCheckUtils]: 4: Hoare triple {40691#true} call #t~ret7 := main(); {40691#true} is VALID [2022-04-28 03:56:49,314 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {40691#true} {40691#true} #52#return; {40691#true} is VALID [2022-04-28 03:56:49,314 INFO L290 TraceCheckUtils]: 2: Hoare triple {40691#true} assume true; {40691#true} is VALID [2022-04-28 03:56:49,314 INFO L290 TraceCheckUtils]: 1: Hoare triple {40691#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); {40691#true} is VALID [2022-04-28 03:56:49,314 INFO L272 TraceCheckUtils]: 0: Hoare triple {40691#true} call ULTIMATE.init(); {40691#true} is VALID [2022-04-28 03:56:49,314 INFO L134 CoverageAnalysis]: Checked inductivity of 563 backedges. 0 proven. 561 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-04-28 03:56:49,315 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [376116291] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 03:56:49,315 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 03:56:49,315 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [37, 36, 36] total 71 [2022-04-28 03:56:52,052 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 03:56:52,053 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1153780873] [2022-04-28 03:56:52,053 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1153780873] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 03:56:52,053 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 03:56:52,053 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [99] imperfect sequences [] total 99 [2022-04-28 03:56:52,053 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2132825374] [2022-04-28 03:56:52,053 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 03:56:52,053 INFO L78 Accepts]: Start accepts. Automaton has has 99 states, 99 states have (on average 1.6464646464646464) internal successors, (163), 98 states have internal predecessors, (163), 2 states have call successors, (3), 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 167 [2022-04-28 03:56:52,054 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 03:56:52,054 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 99 states, 99 states have (on average 1.6464646464646464) internal successors, (163), 98 states have internal predecessors, (163), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:56:52,169 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 167 edges. 167 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 03:56:52,169 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 99 states [2022-04-28 03:56:52,169 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 03:56:52,170 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 99 interpolants. [2022-04-28 03:56:52,171 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6818, Invalid=10738, Unknown=0, NotChecked=0, Total=17556 [2022-04-28 03:56:52,172 INFO L87 Difference]: Start difference. First operand 168 states and 171 transitions. Second operand has 99 states, 99 states have (on average 1.6464646464646464) internal successors, (163), 98 states have internal predecessors, (163), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:57:07,539 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:57:07,539 INFO L93 Difference]: Finished difference Result 333 states and 344 transitions. [2022-04-28 03:57:07,539 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 99 states. [2022-04-28 03:57:07,539 INFO L78 Accepts]: Start accepts. Automaton has has 99 states, 99 states have (on average 1.6464646464646464) internal successors, (163), 98 states have internal predecessors, (163), 2 states have call successors, (3), 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 167 [2022-04-28 03:57:07,540 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 03:57:07,540 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 99 states, 99 states have (on average 1.6464646464646464) internal successors, (163), 98 states have internal predecessors, (163), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:57:07,541 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 189 transitions. [2022-04-28 03:57:07,541 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 99 states, 99 states have (on average 1.6464646464646464) internal successors, (163), 98 states have internal predecessors, (163), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:57:07,542 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 189 transitions. [2022-04-28 03:57:07,542 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 99 states and 189 transitions. [2022-04-28 03:57:07,683 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 189 edges. 189 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 03:57:07,685 INFO L225 Difference]: With dead ends: 333 [2022-04-28 03:57:07,685 INFO L226 Difference]: Without dead ends: 173 [2022-04-28 03:57:07,688 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 357 GetRequests, 129 SyntacticMatches, 1 SemanticMatches, 227 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15142 ImplicationChecksByTransitivity, 7.3s TimeCoverageRelationStatistics Valid=15926, Invalid=36286, Unknown=0, NotChecked=0, Total=52212 [2022-04-28 03:57:07,689 INFO L413 NwaCegarLoop]: 12 mSDtfsCounter, 327 mSDsluCounter, 42 mSDsCounter, 0 mSdLazyCounter, 7651 mSolverCounterSat, 237 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 327 SdHoareTripleChecker+Valid, 54 SdHoareTripleChecker+Invalid, 7888 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 237 IncrementalHoareTripleChecker+Valid, 7651 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6.2s IncrementalHoareTripleChecker+Time [2022-04-28 03:57:07,689 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [327 Valid, 54 Invalid, 7888 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [237 Valid, 7651 Invalid, 0 Unknown, 0 Unchecked, 6.2s Time] [2022-04-28 03:57:07,689 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 173 states. [2022-04-28 03:57:07,954 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 173 to 173. [2022-04-28 03:57:07,954 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 03:57:07,954 INFO L82 GeneralOperation]: Start isEquivalent. First operand 173 states. Second operand has 173 states, 168 states have (on average 1.0238095238095237) internal successors, (172), 168 states have internal predecessors, (172), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:57:07,954 INFO L74 IsIncluded]: Start isIncluded. First operand 173 states. Second operand has 173 states, 168 states have (on average 1.0238095238095237) internal successors, (172), 168 states have internal predecessors, (172), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:57:07,955 INFO L87 Difference]: Start difference. First operand 173 states. Second operand has 173 states, 168 states have (on average 1.0238095238095237) internal successors, (172), 168 states have internal predecessors, (172), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:57:07,956 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:57:07,956 INFO L93 Difference]: Finished difference Result 173 states and 176 transitions. [2022-04-28 03:57:07,956 INFO L276 IsEmpty]: Start isEmpty. Operand 173 states and 176 transitions. [2022-04-28 03:57:07,956 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:57:07,956 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:57:07,956 INFO L74 IsIncluded]: Start isIncluded. First operand has 173 states, 168 states have (on average 1.0238095238095237) internal successors, (172), 168 states have internal predecessors, (172), 3 states have call successors, (3), 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 173 states. [2022-04-28 03:57:07,956 INFO L87 Difference]: Start difference. First operand has 173 states, 168 states have (on average 1.0238095238095237) internal successors, (172), 168 states have internal predecessors, (172), 3 states have call successors, (3), 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 173 states. [2022-04-28 03:57:07,958 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:57:07,958 INFO L93 Difference]: Finished difference Result 173 states and 176 transitions. [2022-04-28 03:57:07,958 INFO L276 IsEmpty]: Start isEmpty. Operand 173 states and 176 transitions. [2022-04-28 03:57:07,958 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:57:07,958 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:57:07,958 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 03:57:07,958 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 03:57:07,958 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 173 states, 168 states have (on average 1.0238095238095237) internal successors, (172), 168 states have internal predecessors, (172), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:57:07,960 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 173 states to 173 states and 176 transitions. [2022-04-28 03:57:07,960 INFO L78 Accepts]: Start accepts. Automaton has 173 states and 176 transitions. Word has length 167 [2022-04-28 03:57:07,960 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 03:57:07,960 INFO L495 AbstractCegarLoop]: Abstraction has 173 states and 176 transitions. [2022-04-28 03:57:07,960 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 99 states, 99 states have (on average 1.6464646464646464) internal successors, (163), 98 states have internal predecessors, (163), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:57:07,960 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 173 states and 176 transitions. [2022-04-28 03:57:08,101 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 176 edges. 176 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 03:57:08,101 INFO L276 IsEmpty]: Start isEmpty. Operand 173 states and 176 transitions. [2022-04-28 03:57:08,102 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 173 [2022-04-28 03:57:08,102 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 03:57:08,102 INFO L195 NwaCegarLoop]: trace histogram [63, 62, 34, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 03:57:08,118 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (34)] Forceful destruction successful, exit code 0 [2022-04-28 03:57:08,303 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 34 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable35 [2022-04-28 03:57:08,303 INFO L420 AbstractCegarLoop]: === Iteration 37 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 03:57:08,304 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 03:57:08,304 INFO L85 PathProgramCache]: Analyzing trace with hash -357354224, now seen corresponding path program 34 times [2022-04-28 03:57:08,304 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 03:57:08,304 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [535860864] [2022-04-28 03:57:12,374 WARN L977 rdanLoopAcceleration]: Unable to prove correctness of quantifier elimination. [2022-04-28 03:57:12,426 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 1 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 03:57:12,631 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={1=1, 2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 03:57:12,632 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-28 03:57:12,634 INFO L85 PathProgramCache]: Analyzing trace with hash 1512808993, now seen corresponding path program 1 times [2022-04-28 03:57:12,634 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 03:57:12,634 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1874591321] [2022-04-28 03:57:12,634 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:57:12,634 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 03:57:12,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:57:13,300 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 03:57:13,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:57:13,303 INFO L290 TraceCheckUtils]: 0: Hoare triple {42707#(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); {42664#true} is VALID [2022-04-28 03:57:13,303 INFO L290 TraceCheckUtils]: 1: Hoare triple {42664#true} assume true; {42664#true} is VALID [2022-04-28 03:57:13,303 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {42664#true} {42664#true} #52#return; {42664#true} is VALID [2022-04-28 03:57:13,310 INFO L272 TraceCheckUtils]: 0: Hoare triple {42664#true} call ULTIMATE.init(); {42707#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 03:57:13,310 INFO L290 TraceCheckUtils]: 1: Hoare triple {42707#(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); {42664#true} is VALID [2022-04-28 03:57:13,310 INFO L290 TraceCheckUtils]: 2: Hoare triple {42664#true} assume true; {42664#true} is VALID [2022-04-28 03:57:13,310 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {42664#true} {42664#true} #52#return; {42664#true} is VALID [2022-04-28 03:57:13,310 INFO L272 TraceCheckUtils]: 4: Hoare triple {42664#true} call #t~ret7 := main(); {42664#true} is VALID [2022-04-28 03:57:13,311 INFO L290 TraceCheckUtils]: 5: Hoare triple {42664#true} ~x~0 := 0;~y~0 := 50000;~z~0 := 0;~x~0 := 0; {42669#(and (= main_~x~0 0) (<= 50000 main_~y~0))} is VALID [2022-04-28 03:57:13,311 INFO L290 TraceCheckUtils]: 6: Hoare triple {42669#(and (= main_~x~0 0) (<= 50000 main_~y~0))} [192] L11-2-->L18-1_primed: Formula: (let ((.cse0 (= v_main_~x~0_2191 v_main_~x~0_2190)) (.cse1 (= |v_main_#t~post4_215| |v_main_#t~post4_214|))) (or (and (< v_main_~x~0_2190 50001) (< v_main_~x~0_2191 v_main_~x~0_2190)) (and .cse0 (<= 50000 v_main_~x~0_2191) .cse1) (and .cse0 .cse1))) InVars {main_~x~0=v_main_~x~0_2191, main_#t~post4=|v_main_#t~post4_215|} OutVars{main_~x~0=v_main_~x~0_2190, main_#t~post4=|v_main_#t~post4_214|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {42670#(and (<= main_~x~0 main_~y~0) (<= 50000 main_~y~0))} is VALID [2022-04-28 03:57:13,312 INFO L290 TraceCheckUtils]: 7: Hoare triple {42670#(and (<= main_~x~0 main_~y~0) (<= 50000 main_~y~0))} [193] L18-1_primed-->L11-2: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {42670#(and (<= main_~x~0 main_~y~0) (<= 50000 main_~y~0))} is VALID [2022-04-28 03:57:13,312 INFO L290 TraceCheckUtils]: 8: Hoare triple {42670#(and (<= main_~x~0 main_~y~0) (<= 50000 main_~y~0))} [194] L11-2-->L18-1_primed: Formula: (let ((.cse4 (<= 50000 v_main_~x~0_2193)) (.cse0 (= v_main_~x~0_2193 v_main_~x~0_2192)) (.cse1 (= |v_main_#t~post5_235| |v_main_#t~post5_234|)) (.cse2 (= v_main_~y~0_2467 v_main_~y~0_2466)) (.cse3 (= |v_main_#t~post6_235| |v_main_#t~post6_234|))) (or (and .cse0 .cse1 .cse2 .cse3 (or (not .cse4) (not (< v_main_~x~0_2193 1000000)))) (and (< v_main_~x~0_2193 v_main_~x~0_2192) .cse4 (< v_main_~x~0_2192 1000001) (= (+ v_main_~x~0_2192 v_main_~y~0_2467) (+ v_main_~x~0_2193 v_main_~y~0_2466))) (and .cse0 .cse1 .cse2 .cse3))) InVars {main_~y~0=v_main_~y~0_2467, main_#t~post5=|v_main_#t~post5_235|, main_~x~0=v_main_~x~0_2193, main_#t~post6=|v_main_#t~post6_235|} OutVars{main_~y~0=v_main_~y~0_2466, main_#t~post5=|v_main_#t~post5_234|, main_~x~0=v_main_~x~0_2192, main_#t~post6=|v_main_#t~post6_234|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {42671#(or (<= main_~x~0 main_~y~0) (<= 50000 main_~y~0))} is VALID [2022-04-28 03:57:13,313 INFO L290 TraceCheckUtils]: 9: Hoare triple {42671#(or (<= main_~x~0 main_~y~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[] {42672#(<= 50000 main_~y~0)} is VALID [2022-04-28 03:57:13,313 INFO L290 TraceCheckUtils]: 10: Hoare triple {42672#(<= 50000 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {42673#(<= 49998 main_~y~0)} is VALID [2022-04-28 03:57:13,314 INFO L290 TraceCheckUtils]: 11: Hoare triple {42673#(<= 49998 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {42674#(<= 49996 main_~y~0)} is VALID [2022-04-28 03:57:13,314 INFO L290 TraceCheckUtils]: 12: Hoare triple {42674#(<= 49996 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {42675#(<= 49994 main_~y~0)} is VALID [2022-04-28 03:57:13,314 INFO L290 TraceCheckUtils]: 13: Hoare triple {42675#(<= 49994 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {42676#(<= 49992 main_~y~0)} is VALID [2022-04-28 03:57:13,315 INFO L290 TraceCheckUtils]: 14: Hoare triple {42676#(<= 49992 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {42677#(<= 49990 main_~y~0)} is VALID [2022-04-28 03:57:13,315 INFO L290 TraceCheckUtils]: 15: Hoare triple {42677#(<= 49990 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {42678#(<= 49988 main_~y~0)} is VALID [2022-04-28 03:57:13,316 INFO L290 TraceCheckUtils]: 16: Hoare triple {42678#(<= 49988 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {42679#(<= 49986 main_~y~0)} is VALID [2022-04-28 03:57:13,316 INFO L290 TraceCheckUtils]: 17: Hoare triple {42679#(<= 49986 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {42680#(<= 49984 main_~y~0)} is VALID [2022-04-28 03:57:13,317 INFO L290 TraceCheckUtils]: 18: Hoare triple {42680#(<= 49984 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {42681#(<= 49982 main_~y~0)} is VALID [2022-04-28 03:57:13,317 INFO L290 TraceCheckUtils]: 19: Hoare triple {42681#(<= 49982 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {42682#(<= 49980 main_~y~0)} is VALID [2022-04-28 03:57:13,317 INFO L290 TraceCheckUtils]: 20: Hoare triple {42682#(<= 49980 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {42683#(<= 49978 main_~y~0)} is VALID [2022-04-28 03:57:13,318 INFO L290 TraceCheckUtils]: 21: Hoare triple {42683#(<= 49978 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {42684#(<= 49976 main_~y~0)} is VALID [2022-04-28 03:57:13,318 INFO L290 TraceCheckUtils]: 22: Hoare triple {42684#(<= 49976 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {42685#(<= 49974 main_~y~0)} is VALID [2022-04-28 03:57:13,319 INFO L290 TraceCheckUtils]: 23: Hoare triple {42685#(<= 49974 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {42686#(<= 49972 main_~y~0)} is VALID [2022-04-28 03:57:13,319 INFO L290 TraceCheckUtils]: 24: Hoare triple {42686#(<= 49972 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {42687#(<= 49970 main_~y~0)} is VALID [2022-04-28 03:57:13,320 INFO L290 TraceCheckUtils]: 25: Hoare triple {42687#(<= 49970 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {42688#(<= 49968 main_~y~0)} is VALID [2022-04-28 03:57:13,320 INFO L290 TraceCheckUtils]: 26: Hoare triple {42688#(<= 49968 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {42689#(<= 49966 main_~y~0)} is VALID [2022-04-28 03:57:13,321 INFO L290 TraceCheckUtils]: 27: Hoare triple {42689#(<= 49966 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {42690#(<= 49964 main_~y~0)} is VALID [2022-04-28 03:57:13,321 INFO L290 TraceCheckUtils]: 28: Hoare triple {42690#(<= 49964 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {42691#(<= 49962 main_~y~0)} is VALID [2022-04-28 03:57:13,322 INFO L290 TraceCheckUtils]: 29: Hoare triple {42691#(<= 49962 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {42692#(<= 49960 main_~y~0)} is VALID [2022-04-28 03:57:13,322 INFO L290 TraceCheckUtils]: 30: Hoare triple {42692#(<= 49960 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {42693#(<= 49958 main_~y~0)} is VALID [2022-04-28 03:57:13,323 INFO L290 TraceCheckUtils]: 31: Hoare triple {42693#(<= 49958 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {42694#(<= 49956 main_~y~0)} is VALID [2022-04-28 03:57:13,323 INFO L290 TraceCheckUtils]: 32: Hoare triple {42694#(<= 49956 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {42695#(<= 49954 main_~y~0)} is VALID [2022-04-28 03:57:13,324 INFO L290 TraceCheckUtils]: 33: Hoare triple {42695#(<= 49954 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {42696#(<= 49952 main_~y~0)} is VALID [2022-04-28 03:57:13,324 INFO L290 TraceCheckUtils]: 34: Hoare triple {42696#(<= 49952 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {42697#(<= 49950 main_~y~0)} is VALID [2022-04-28 03:57:13,325 INFO L290 TraceCheckUtils]: 35: Hoare triple {42697#(<= 49950 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {42698#(<= 49948 main_~y~0)} is VALID [2022-04-28 03:57:13,325 INFO L290 TraceCheckUtils]: 36: Hoare triple {42698#(<= 49948 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {42699#(<= 49946 main_~y~0)} is VALID [2022-04-28 03:57:13,325 INFO L290 TraceCheckUtils]: 37: Hoare triple {42699#(<= 49946 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {42700#(<= 49944 main_~y~0)} is VALID [2022-04-28 03:57:13,326 INFO L290 TraceCheckUtils]: 38: Hoare triple {42700#(<= 49944 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {42701#(<= 49942 main_~y~0)} is VALID [2022-04-28 03:57:13,326 INFO L290 TraceCheckUtils]: 39: Hoare triple {42701#(<= 49942 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {42702#(<= 49940 main_~y~0)} is VALID [2022-04-28 03:57:13,327 INFO L290 TraceCheckUtils]: 40: Hoare triple {42702#(<= 49940 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {42703#(<= 49938 main_~y~0)} is VALID [2022-04-28 03:57:13,327 INFO L290 TraceCheckUtils]: 41: Hoare triple {42703#(<= 49938 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {42704#(<= 49936 main_~y~0)} is VALID [2022-04-28 03:57:13,328 INFO L290 TraceCheckUtils]: 42: Hoare triple {42704#(<= 49936 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {42705#(<= 49934 main_~y~0)} is VALID [2022-04-28 03:57:13,328 INFO L290 TraceCheckUtils]: 43: Hoare triple {42705#(<= 49934 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {42706#(<= 49932 main_~y~0)} is VALID [2022-04-28 03:57:13,329 INFO L290 TraceCheckUtils]: 44: Hoare triple {42706#(<= 49932 main_~y~0)} assume !(~y~0 > 0); {42665#false} is VALID [2022-04-28 03:57:13,329 INFO L272 TraceCheckUtils]: 45: Hoare triple {42665#false} call __VERIFIER_assert((if ~z~0 == ~x~0 then 1 else 0)); {42665#false} is VALID [2022-04-28 03:57:13,329 INFO L290 TraceCheckUtils]: 46: Hoare triple {42665#false} ~cond := #in~cond; {42665#false} is VALID [2022-04-28 03:57:13,329 INFO L290 TraceCheckUtils]: 47: Hoare triple {42665#false} assume 0 == ~cond; {42665#false} is VALID [2022-04-28 03:57:13,329 INFO L290 TraceCheckUtils]: 48: Hoare triple {42665#false} assume !false; {42665#false} is VALID [2022-04-28 03:57:13,329 INFO L134 CoverageAnalysis]: Checked inductivity of 597 backedges. 0 proven. 597 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 03:57:13,329 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 03:57:13,329 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1874591321] [2022-04-28 03:57:13,329 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1874591321] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 03:57:13,329 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [314924672] [2022-04-28 03:57:13,329 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:57:13,330 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 03:57:13,330 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 03:57:13,330 INFO L229 MonitoredProcess]: Starting monitored process 35 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 03:57:13,333 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (35)] Waiting until timeout for monitored process [2022-04-28 03:57:13,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:57:13,382 INFO L263 TraceCheckSpWp]: Trace formula consists of 229 conjuncts, 40 conjunts are in the unsatisfiable core [2022-04-28 03:57:13,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:57:13,406 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 03:57:14,476 INFO L272 TraceCheckUtils]: 0: Hoare triple {42664#true} call ULTIMATE.init(); {42664#true} is VALID [2022-04-28 03:57:14,476 INFO L290 TraceCheckUtils]: 1: Hoare triple {42664#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); {42664#true} is VALID [2022-04-28 03:57:14,476 INFO L290 TraceCheckUtils]: 2: Hoare triple {42664#true} assume true; {42664#true} is VALID [2022-04-28 03:57:14,476 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {42664#true} {42664#true} #52#return; {42664#true} is VALID [2022-04-28 03:57:14,476 INFO L272 TraceCheckUtils]: 4: Hoare triple {42664#true} call #t~ret7 := main(); {42664#true} is VALID [2022-04-28 03:57:14,477 INFO L290 TraceCheckUtils]: 5: Hoare triple {42664#true} ~x~0 := 0;~y~0 := 50000;~z~0 := 0;~x~0 := 0; {42726#(and (<= main_~x~0 0) (<= 50000 main_~y~0))} is VALID [2022-04-28 03:57:14,477 INFO L290 TraceCheckUtils]: 6: Hoare triple {42726#(and (<= main_~x~0 0) (<= 50000 main_~y~0))} [192] L11-2-->L18-1_primed: Formula: (let ((.cse0 (= v_main_~x~0_2191 v_main_~x~0_2190)) (.cse1 (= |v_main_#t~post4_215| |v_main_#t~post4_214|))) (or (and (< v_main_~x~0_2190 50001) (< v_main_~x~0_2191 v_main_~x~0_2190)) (and .cse0 (<= 50000 v_main_~x~0_2191) .cse1) (and .cse0 .cse1))) InVars {main_~x~0=v_main_~x~0_2191, main_#t~post4=|v_main_#t~post4_215|} OutVars{main_~x~0=v_main_~x~0_2190, main_#t~post4=|v_main_#t~post4_214|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {42730#(and (< main_~x~0 50001) (<= 50000 main_~y~0))} is VALID [2022-04-28 03:57:14,477 INFO L290 TraceCheckUtils]: 7: Hoare triple {42730#(and (< main_~x~0 50001) (<= 50000 main_~y~0))} [193] L18-1_primed-->L11-2: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {42730#(and (< main_~x~0 50001) (<= 50000 main_~y~0))} is VALID [2022-04-28 03:57:14,478 INFO L290 TraceCheckUtils]: 8: Hoare triple {42730#(and (< main_~x~0 50001) (<= 50000 main_~y~0))} [194] L11-2-->L18-1_primed: Formula: (let ((.cse4 (<= 50000 v_main_~x~0_2193)) (.cse0 (= v_main_~x~0_2193 v_main_~x~0_2192)) (.cse1 (= |v_main_#t~post5_235| |v_main_#t~post5_234|)) (.cse2 (= v_main_~y~0_2467 v_main_~y~0_2466)) (.cse3 (= |v_main_#t~post6_235| |v_main_#t~post6_234|))) (or (and .cse0 .cse1 .cse2 .cse3 (or (not .cse4) (not (< v_main_~x~0_2193 1000000)))) (and (< v_main_~x~0_2193 v_main_~x~0_2192) .cse4 (< v_main_~x~0_2192 1000001) (= (+ v_main_~x~0_2192 v_main_~y~0_2467) (+ v_main_~x~0_2193 v_main_~y~0_2466))) (and .cse0 .cse1 .cse2 .cse3))) InVars {main_~y~0=v_main_~y~0_2467, main_#t~post5=|v_main_#t~post5_235|, main_~x~0=v_main_~x~0_2193, main_#t~post6=|v_main_#t~post6_235|} OutVars{main_~y~0=v_main_~y~0_2466, main_#t~post5=|v_main_#t~post5_234|, main_~x~0=v_main_~x~0_2192, main_#t~post6=|v_main_#t~post6_234|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {42737#(or (and (< main_~x~0 50001) (<= 50000 main_~y~0)) (and (< main_~x~0 (+ main_~y~0 1)) (< main_~x~0 1000001) (< 50000 main_~x~0)))} is VALID [2022-04-28 03:57:14,479 INFO L290 TraceCheckUtils]: 9: Hoare triple {42737#(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)))} [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[] {42741#(< 999999 main_~y~0)} is VALID [2022-04-28 03:57:14,479 INFO L290 TraceCheckUtils]: 10: Hoare triple {42741#(< 999999 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {42745#(< 999997 main_~y~0)} is VALID [2022-04-28 03:57:14,479 INFO L290 TraceCheckUtils]: 11: Hoare triple {42745#(< 999997 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {42749#(< 999995 main_~y~0)} is VALID [2022-04-28 03:57:14,480 INFO L290 TraceCheckUtils]: 12: Hoare triple {42749#(< 999995 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {42753#(< 999993 main_~y~0)} is VALID [2022-04-28 03:57:14,480 INFO L290 TraceCheckUtils]: 13: Hoare triple {42753#(< 999993 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {42757#(< 999991 main_~y~0)} is VALID [2022-04-28 03:57:14,481 INFO L290 TraceCheckUtils]: 14: Hoare triple {42757#(< 999991 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {42761#(< 999989 main_~y~0)} is VALID [2022-04-28 03:57:14,481 INFO L290 TraceCheckUtils]: 15: Hoare triple {42761#(< 999989 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {42765#(< 999987 main_~y~0)} is VALID [2022-04-28 03:57:14,482 INFO L290 TraceCheckUtils]: 16: Hoare triple {42765#(< 999987 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {42769#(< 999985 main_~y~0)} is VALID [2022-04-28 03:57:14,482 INFO L290 TraceCheckUtils]: 17: Hoare triple {42769#(< 999985 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {42773#(< 999983 main_~y~0)} is VALID [2022-04-28 03:57:14,482 INFO L290 TraceCheckUtils]: 18: Hoare triple {42773#(< 999983 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {42777#(< 999981 main_~y~0)} is VALID [2022-04-28 03:57:14,483 INFO L290 TraceCheckUtils]: 19: Hoare triple {42777#(< 999981 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {42781#(< 999979 main_~y~0)} is VALID [2022-04-28 03:57:14,483 INFO L290 TraceCheckUtils]: 20: Hoare triple {42781#(< 999979 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {42785#(< 999977 main_~y~0)} is VALID [2022-04-28 03:57:14,484 INFO L290 TraceCheckUtils]: 21: Hoare triple {42785#(< 999977 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {42789#(< 999975 main_~y~0)} is VALID [2022-04-28 03:57:14,484 INFO L290 TraceCheckUtils]: 22: Hoare triple {42789#(< 999975 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {42793#(< 999973 main_~y~0)} is VALID [2022-04-28 03:57:14,484 INFO L290 TraceCheckUtils]: 23: Hoare triple {42793#(< 999973 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {42797#(< 999971 main_~y~0)} is VALID [2022-04-28 03:57:14,485 INFO L290 TraceCheckUtils]: 24: Hoare triple {42797#(< 999971 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {42801#(< 999969 main_~y~0)} is VALID [2022-04-28 03:57:14,485 INFO L290 TraceCheckUtils]: 25: Hoare triple {42801#(< 999969 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {42805#(< 999967 main_~y~0)} is VALID [2022-04-28 03:57:14,486 INFO L290 TraceCheckUtils]: 26: Hoare triple {42805#(< 999967 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {42809#(< 999965 main_~y~0)} is VALID [2022-04-28 03:57:14,486 INFO L290 TraceCheckUtils]: 27: Hoare triple {42809#(< 999965 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {42813#(< 999963 main_~y~0)} is VALID [2022-04-28 03:57:14,486 INFO L290 TraceCheckUtils]: 28: Hoare triple {42813#(< 999963 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {42817#(< 999961 main_~y~0)} is VALID [2022-04-28 03:57:14,487 INFO L290 TraceCheckUtils]: 29: Hoare triple {42817#(< 999961 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {42821#(< 999959 main_~y~0)} is VALID [2022-04-28 03:57:14,487 INFO L290 TraceCheckUtils]: 30: Hoare triple {42821#(< 999959 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {42825#(< 999957 main_~y~0)} is VALID [2022-04-28 03:57:14,488 INFO L290 TraceCheckUtils]: 31: Hoare triple {42825#(< 999957 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {42829#(< 999955 main_~y~0)} is VALID [2022-04-28 03:57:14,488 INFO L290 TraceCheckUtils]: 32: Hoare triple {42829#(< 999955 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {42833#(< 999953 main_~y~0)} is VALID [2022-04-28 03:57:14,488 INFO L290 TraceCheckUtils]: 33: Hoare triple {42833#(< 999953 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {42837#(< 999951 main_~y~0)} is VALID [2022-04-28 03:57:14,489 INFO L290 TraceCheckUtils]: 34: Hoare triple {42837#(< 999951 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {42841#(< 999949 main_~y~0)} is VALID [2022-04-28 03:57:14,489 INFO L290 TraceCheckUtils]: 35: Hoare triple {42841#(< 999949 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {42845#(< 999947 main_~y~0)} is VALID [2022-04-28 03:57:14,490 INFO L290 TraceCheckUtils]: 36: Hoare triple {42845#(< 999947 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {42849#(< 999945 main_~y~0)} is VALID [2022-04-28 03:57:14,490 INFO L290 TraceCheckUtils]: 37: Hoare triple {42849#(< 999945 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {42853#(< 999943 main_~y~0)} is VALID [2022-04-28 03:57:14,491 INFO L290 TraceCheckUtils]: 38: Hoare triple {42853#(< 999943 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {42857#(< 999941 main_~y~0)} is VALID [2022-04-28 03:57:14,491 INFO L290 TraceCheckUtils]: 39: Hoare triple {42857#(< 999941 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {42861#(< 999939 main_~y~0)} is VALID [2022-04-28 03:57:14,492 INFO L290 TraceCheckUtils]: 40: Hoare triple {42861#(< 999939 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {42865#(< 999937 main_~y~0)} is VALID [2022-04-28 03:57:14,492 INFO L290 TraceCheckUtils]: 41: Hoare triple {42865#(< 999937 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {42869#(< 999935 main_~y~0)} is VALID [2022-04-28 03:57:14,493 INFO L290 TraceCheckUtils]: 42: Hoare triple {42869#(< 999935 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {42873#(< 999933 main_~y~0)} is VALID [2022-04-28 03:57:14,493 INFO L290 TraceCheckUtils]: 43: Hoare triple {42873#(< 999933 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {42877#(< 999931 main_~y~0)} is VALID [2022-04-28 03:57:14,493 INFO L290 TraceCheckUtils]: 44: Hoare triple {42877#(< 999931 main_~y~0)} assume !(~y~0 > 0); {42665#false} is VALID [2022-04-28 03:57:14,493 INFO L272 TraceCheckUtils]: 45: Hoare triple {42665#false} call __VERIFIER_assert((if ~z~0 == ~x~0 then 1 else 0)); {42665#false} is VALID [2022-04-28 03:57:14,493 INFO L290 TraceCheckUtils]: 46: Hoare triple {42665#false} ~cond := #in~cond; {42665#false} is VALID [2022-04-28 03:57:14,493 INFO L290 TraceCheckUtils]: 47: Hoare triple {42665#false} assume 0 == ~cond; {42665#false} is VALID [2022-04-28 03:57:14,494 INFO L290 TraceCheckUtils]: 48: Hoare triple {42665#false} assume !false; {42665#false} is VALID [2022-04-28 03:57:14,494 INFO L134 CoverageAnalysis]: Checked inductivity of 597 backedges. 0 proven. 597 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 03:57:14,494 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 03:57:16,489 INFO L290 TraceCheckUtils]: 48: Hoare triple {42665#false} assume !false; {42665#false} is VALID [2022-04-28 03:57:16,489 INFO L290 TraceCheckUtils]: 47: Hoare triple {42665#false} assume 0 == ~cond; {42665#false} is VALID [2022-04-28 03:57:16,490 INFO L290 TraceCheckUtils]: 46: Hoare triple {42665#false} ~cond := #in~cond; {42665#false} is VALID [2022-04-28 03:57:16,490 INFO L272 TraceCheckUtils]: 45: Hoare triple {42665#false} call __VERIFIER_assert((if ~z~0 == ~x~0 then 1 else 0)); {42665#false} is VALID [2022-04-28 03:57:16,490 INFO L290 TraceCheckUtils]: 44: Hoare triple {42905#(< 0 main_~y~0)} assume !(~y~0 > 0); {42665#false} is VALID [2022-04-28 03:57:16,490 INFO L290 TraceCheckUtils]: 43: Hoare triple {42909#(< 2 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {42905#(< 0 main_~y~0)} is VALID [2022-04-28 03:57:16,491 INFO L290 TraceCheckUtils]: 42: Hoare triple {42913#(< 4 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {42909#(< 2 main_~y~0)} is VALID [2022-04-28 03:57:16,491 INFO L290 TraceCheckUtils]: 41: Hoare triple {42917#(< 6 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {42913#(< 4 main_~y~0)} is VALID [2022-04-28 03:57:16,492 INFO L290 TraceCheckUtils]: 40: Hoare triple {42921#(< 8 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {42917#(< 6 main_~y~0)} is VALID [2022-04-28 03:57:16,492 INFO L290 TraceCheckUtils]: 39: Hoare triple {42925#(< 10 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {42921#(< 8 main_~y~0)} is VALID [2022-04-28 03:57:16,493 INFO L290 TraceCheckUtils]: 38: Hoare triple {42929#(< 12 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {42925#(< 10 main_~y~0)} is VALID [2022-04-28 03:57:16,493 INFO L290 TraceCheckUtils]: 37: Hoare triple {42933#(< 14 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {42929#(< 12 main_~y~0)} is VALID [2022-04-28 03:57:16,494 INFO L290 TraceCheckUtils]: 36: Hoare triple {42937#(< 16 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {42933#(< 14 main_~y~0)} is VALID [2022-04-28 03:57:16,494 INFO L290 TraceCheckUtils]: 35: Hoare triple {42941#(< 18 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {42937#(< 16 main_~y~0)} is VALID [2022-04-28 03:57:16,495 INFO L290 TraceCheckUtils]: 34: Hoare triple {42945#(< 20 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {42941#(< 18 main_~y~0)} is VALID [2022-04-28 03:57:16,495 INFO L290 TraceCheckUtils]: 33: Hoare triple {42949#(< 22 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {42945#(< 20 main_~y~0)} is VALID [2022-04-28 03:57:16,496 INFO L290 TraceCheckUtils]: 32: Hoare triple {42953#(< 24 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {42949#(< 22 main_~y~0)} is VALID [2022-04-28 03:57:16,496 INFO L290 TraceCheckUtils]: 31: Hoare triple {42957#(< 26 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {42953#(< 24 main_~y~0)} is VALID [2022-04-28 03:57:16,497 INFO L290 TraceCheckUtils]: 30: Hoare triple {42961#(< 28 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {42957#(< 26 main_~y~0)} is VALID [2022-04-28 03:57:16,497 INFO L290 TraceCheckUtils]: 29: Hoare triple {42965#(< 30 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {42961#(< 28 main_~y~0)} is VALID [2022-04-28 03:57:16,497 INFO L290 TraceCheckUtils]: 28: Hoare triple {42969#(< 32 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {42965#(< 30 main_~y~0)} is VALID [2022-04-28 03:57:16,498 INFO L290 TraceCheckUtils]: 27: Hoare triple {42973#(< 34 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {42969#(< 32 main_~y~0)} is VALID [2022-04-28 03:57:16,498 INFO L290 TraceCheckUtils]: 26: Hoare triple {42977#(< 36 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {42973#(< 34 main_~y~0)} is VALID [2022-04-28 03:57:16,499 INFO L290 TraceCheckUtils]: 25: Hoare triple {42981#(< 38 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {42977#(< 36 main_~y~0)} is VALID [2022-04-28 03:57:16,499 INFO L290 TraceCheckUtils]: 24: Hoare triple {42985#(< 40 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {42981#(< 38 main_~y~0)} is VALID [2022-04-28 03:57:16,500 INFO L290 TraceCheckUtils]: 23: Hoare triple {42989#(< 42 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {42985#(< 40 main_~y~0)} is VALID [2022-04-28 03:57:16,500 INFO L290 TraceCheckUtils]: 22: Hoare triple {42993#(< 44 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {42989#(< 42 main_~y~0)} is VALID [2022-04-28 03:57:16,501 INFO L290 TraceCheckUtils]: 21: Hoare triple {42997#(< 46 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {42993#(< 44 main_~y~0)} is VALID [2022-04-28 03:57:16,501 INFO L290 TraceCheckUtils]: 20: Hoare triple {43001#(< 48 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {42997#(< 46 main_~y~0)} is VALID [2022-04-28 03:57:16,501 INFO L290 TraceCheckUtils]: 19: Hoare triple {43005#(< 50 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {43001#(< 48 main_~y~0)} is VALID [2022-04-28 03:57:16,502 INFO L290 TraceCheckUtils]: 18: Hoare triple {43009#(< 52 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {43005#(< 50 main_~y~0)} is VALID [2022-04-28 03:57:16,502 INFO L290 TraceCheckUtils]: 17: Hoare triple {43013#(< 54 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {43009#(< 52 main_~y~0)} is VALID [2022-04-28 03:57:16,503 INFO L290 TraceCheckUtils]: 16: Hoare triple {43017#(< 56 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {43013#(< 54 main_~y~0)} is VALID [2022-04-28 03:57:16,503 INFO L290 TraceCheckUtils]: 15: Hoare triple {43021#(< 58 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {43017#(< 56 main_~y~0)} is VALID [2022-04-28 03:57:16,504 INFO L290 TraceCheckUtils]: 14: Hoare triple {43025#(< 60 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {43021#(< 58 main_~y~0)} is VALID [2022-04-28 03:57:16,504 INFO L290 TraceCheckUtils]: 13: Hoare triple {43029#(< 62 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {43025#(< 60 main_~y~0)} is VALID [2022-04-28 03:57:16,504 INFO L290 TraceCheckUtils]: 12: Hoare triple {43033#(< 64 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {43029#(< 62 main_~y~0)} is VALID [2022-04-28 03:57:16,505 INFO L290 TraceCheckUtils]: 11: Hoare triple {43037#(< 66 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {43033#(< 64 main_~y~0)} is VALID [2022-04-28 03:57:16,505 INFO L290 TraceCheckUtils]: 10: Hoare triple {43041#(< 68 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {43037#(< 66 main_~y~0)} is VALID [2022-04-28 03:57:16,506 INFO L290 TraceCheckUtils]: 9: Hoare triple {43045#(or (< 68 main_~y~0) (< main_~x~0 1000000))} [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[] {43041#(< 68 main_~y~0)} is VALID [2022-04-28 03:57:16,506 INFO L290 TraceCheckUtils]: 8: Hoare triple {43049#(and (or (< main_~x~0 (+ main_~y~0 999932)) (<= 68 main_~y~0) (not (<= 50000 main_~x~0))) (or (< 68 main_~y~0) (< main_~x~0 1000000)))} [194] L11-2-->L18-1_primed: Formula: (let ((.cse4 (<= 50000 v_main_~x~0_2193)) (.cse0 (= v_main_~x~0_2193 v_main_~x~0_2192)) (.cse1 (= |v_main_#t~post5_235| |v_main_#t~post5_234|)) (.cse2 (= v_main_~y~0_2467 v_main_~y~0_2466)) (.cse3 (= |v_main_#t~post6_235| |v_main_#t~post6_234|))) (or (and .cse0 .cse1 .cse2 .cse3 (or (not .cse4) (not (< v_main_~x~0_2193 1000000)))) (and (< v_main_~x~0_2193 v_main_~x~0_2192) .cse4 (< v_main_~x~0_2192 1000001) (= (+ v_main_~x~0_2192 v_main_~y~0_2467) (+ v_main_~x~0_2193 v_main_~y~0_2466))) (and .cse0 .cse1 .cse2 .cse3))) InVars {main_~y~0=v_main_~y~0_2467, main_#t~post5=|v_main_#t~post5_235|, main_~x~0=v_main_~x~0_2193, main_#t~post6=|v_main_#t~post6_235|} OutVars{main_~y~0=v_main_~y~0_2466, main_#t~post5=|v_main_#t~post5_234|, main_~x~0=v_main_~x~0_2192, main_#t~post6=|v_main_#t~post6_234|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {43045#(or (< 68 main_~y~0) (< main_~x~0 1000000))} is VALID [2022-04-28 03:57:16,507 INFO L290 TraceCheckUtils]: 7: Hoare triple {43049#(and (or (< main_~x~0 (+ main_~y~0 999932)) (<= 68 main_~y~0) (not (<= 50000 main_~x~0))) (or (< 68 main_~y~0) (< main_~x~0 1000000)))} [193] L18-1_primed-->L11-2: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {43049#(and (or (< main_~x~0 (+ main_~y~0 999932)) (<= 68 main_~y~0) (not (<= 50000 main_~x~0))) (or (< 68 main_~y~0) (< main_~x~0 1000000)))} is VALID [2022-04-28 03:57:16,508 INFO L290 TraceCheckUtils]: 6: Hoare triple {43056#(and (or (< 68 main_~y~0) (< main_~x~0 1000000)) (<= 0 (+ 949931 main_~y~0)) (or (< main_~x~0 (+ main_~y~0 999932)) (<= 68 main_~y~0)))} [192] L11-2-->L18-1_primed: Formula: (let ((.cse0 (= v_main_~x~0_2191 v_main_~x~0_2190)) (.cse1 (= |v_main_#t~post4_215| |v_main_#t~post4_214|))) (or (and (< v_main_~x~0_2190 50001) (< v_main_~x~0_2191 v_main_~x~0_2190)) (and .cse0 (<= 50000 v_main_~x~0_2191) .cse1) (and .cse0 .cse1))) InVars {main_~x~0=v_main_~x~0_2191, main_#t~post4=|v_main_#t~post4_215|} OutVars{main_~x~0=v_main_~x~0_2190, main_#t~post4=|v_main_#t~post4_214|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {43049#(and (or (< main_~x~0 (+ main_~y~0 999932)) (<= 68 main_~y~0) (not (<= 50000 main_~x~0))) (or (< 68 main_~y~0) (< main_~x~0 1000000)))} is VALID [2022-04-28 03:57:16,508 INFO L290 TraceCheckUtils]: 5: Hoare triple {42664#true} ~x~0 := 0;~y~0 := 50000;~z~0 := 0;~x~0 := 0; {43056#(and (or (< 68 main_~y~0) (< main_~x~0 1000000)) (<= 0 (+ 949931 main_~y~0)) (or (< main_~x~0 (+ main_~y~0 999932)) (<= 68 main_~y~0)))} is VALID [2022-04-28 03:57:16,508 INFO L272 TraceCheckUtils]: 4: Hoare triple {42664#true} call #t~ret7 := main(); {42664#true} is VALID [2022-04-28 03:57:16,508 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {42664#true} {42664#true} #52#return; {42664#true} is VALID [2022-04-28 03:57:16,508 INFO L290 TraceCheckUtils]: 2: Hoare triple {42664#true} assume true; {42664#true} is VALID [2022-04-28 03:57:16,508 INFO L290 TraceCheckUtils]: 1: Hoare triple {42664#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); {42664#true} is VALID [2022-04-28 03:57:16,508 INFO L272 TraceCheckUtils]: 0: Hoare triple {42664#true} call ULTIMATE.init(); {42664#true} is VALID [2022-04-28 03:57:16,509 INFO L134 CoverageAnalysis]: Checked inductivity of 597 backedges. 0 proven. 597 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 03:57:16,509 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [314924672] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 03:57:16,509 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 03:57:16,509 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [41, 40, 40] total 117 [2022-04-28 03:57:20,322 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 03:57:20,322 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [535860864] [2022-04-28 03:57:20,322 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [535860864] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 03:57:20,322 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 03:57:20,322 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [102] imperfect sequences [] total 102 [2022-04-28 03:57:20,322 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [436573337] [2022-04-28 03:57:20,322 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 03:57:20,323 INFO L78 Accepts]: Start accepts. Automaton has has 102 states, 102 states have (on average 1.6470588235294117) internal successors, (168), 101 states have internal predecessors, (168), 2 states have call successors, (3), 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 172 [2022-04-28 03:57:20,323 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 03:57:20,323 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 102 states, 102 states have (on average 1.6470588235294117) internal successors, (168), 101 states have internal predecessors, (168), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:57:20,441 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 172 edges. 172 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 03:57:20,442 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 102 states [2022-04-28 03:57:20,442 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 03:57:20,442 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 102 interpolants. [2022-04-28 03:57:20,444 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11321, Invalid=21259, Unknown=0, NotChecked=0, Total=32580 [2022-04-28 03:57:20,444 INFO L87 Difference]: Start difference. First operand 173 states and 176 transitions. Second operand has 102 states, 102 states have (on average 1.6470588235294117) internal successors, (168), 101 states have internal predecessors, (168), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:57:38,147 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:57:38,148 INFO L93 Difference]: Finished difference Result 465 states and 476 transitions. [2022-04-28 03:57:38,148 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 102 states. [2022-04-28 03:57:38,148 INFO L78 Accepts]: Start accepts. Automaton has has 102 states, 102 states have (on average 1.6470588235294117) internal successors, (168), 101 states have internal predecessors, (168), 2 states have call successors, (3), 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 172 [2022-04-28 03:57:38,148 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 03:57:38,148 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 102 states, 102 states have (on average 1.6470588235294117) internal successors, (168), 101 states have internal predecessors, (168), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:57:38,149 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 194 transitions. [2022-04-28 03:57:38,149 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 102 states, 102 states have (on average 1.6470588235294117) internal successors, (168), 101 states have internal predecessors, (168), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:57:38,161 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 194 transitions. [2022-04-28 03:57:38,162 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 102 states and 194 transitions. [2022-04-28 03:57:38,327 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 194 edges. 194 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 03:57:38,331 INFO L225 Difference]: With dead ends: 465 [2022-04-28 03:57:38,331 INFO L226 Difference]: Without dead ends: 300 [2022-04-28 03:57:38,335 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 369 GetRequests, 90 SyntacticMatches, 1 SemanticMatches, 278 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26869 ImplicationChecksByTransitivity, 10.4s TimeCoverageRelationStatistics Valid=21346, Invalid=56774, Unknown=0, NotChecked=0, Total=78120 [2022-04-28 03:57:38,335 INFO L413 NwaCegarLoop]: 12 mSDtfsCounter, 400 mSDsluCounter, 27 mSDsCounter, 0 mSdLazyCounter, 8485 mSolverCounterSat, 436 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 400 SdHoareTripleChecker+Valid, 39 SdHoareTripleChecker+Invalid, 8921 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 436 IncrementalHoareTripleChecker+Valid, 8485 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6.7s IncrementalHoareTripleChecker+Time [2022-04-28 03:57:38,335 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [400 Valid, 39 Invalid, 8921 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [436 Valid, 8485 Invalid, 0 Unknown, 0 Unchecked, 6.7s Time] [2022-04-28 03:57:38,336 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 300 states. [2022-04-28 03:57:38,859 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 300 to 300. [2022-04-28 03:57:38,859 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 03:57:38,860 INFO L82 GeneralOperation]: Start isEquivalent. First operand 300 states. Second operand has 300 states, 295 states have (on average 1.0169491525423728) internal successors, (300), 295 states have internal predecessors, (300), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:57:38,860 INFO L74 IsIncluded]: Start isIncluded. First operand 300 states. Second operand has 300 states, 295 states have (on average 1.0169491525423728) internal successors, (300), 295 states have internal predecessors, (300), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:57:38,860 INFO L87 Difference]: Start difference. First operand 300 states. Second operand has 300 states, 295 states have (on average 1.0169491525423728) internal successors, (300), 295 states have internal predecessors, (300), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:57:38,863 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:57:38,863 INFO L93 Difference]: Finished difference Result 300 states and 304 transitions. [2022-04-28 03:57:38,863 INFO L276 IsEmpty]: Start isEmpty. Operand 300 states and 304 transitions. [2022-04-28 03:57:38,864 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:57:38,864 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:57:38,864 INFO L74 IsIncluded]: Start isIncluded. First operand has 300 states, 295 states have (on average 1.0169491525423728) internal successors, (300), 295 states have internal predecessors, (300), 3 states have call successors, (3), 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 300 states. [2022-04-28 03:57:38,864 INFO L87 Difference]: Start difference. First operand has 300 states, 295 states have (on average 1.0169491525423728) internal successors, (300), 295 states have internal predecessors, (300), 3 states have call successors, (3), 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 300 states. [2022-04-28 03:57:38,867 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:57:38,867 INFO L93 Difference]: Finished difference Result 300 states and 304 transitions. [2022-04-28 03:57:38,867 INFO L276 IsEmpty]: Start isEmpty. Operand 300 states and 304 transitions. [2022-04-28 03:57:38,867 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:57:38,867 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:57:38,867 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 03:57:38,867 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 03:57:38,868 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 300 states, 295 states have (on average 1.0169491525423728) internal successors, (300), 295 states have internal predecessors, (300), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:57:38,871 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 300 states to 300 states and 304 transitions. [2022-04-28 03:57:38,871 INFO L78 Accepts]: Start accepts. Automaton has 300 states and 304 transitions. Word has length 172 [2022-04-28 03:57:38,872 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 03:57:38,872 INFO L495 AbstractCegarLoop]: Abstraction has 300 states and 304 transitions. [2022-04-28 03:57:38,872 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 102 states, 102 states have (on average 1.6470588235294117) internal successors, (168), 101 states have internal predecessors, (168), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:57:38,872 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 300 states and 304 transitions. [2022-04-28 03:57:39,134 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 304 edges. 304 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 03:57:39,135 INFO L276 IsEmpty]: Start isEmpty. Operand 300 states and 304 transitions. [2022-04-28 03:57:39,135 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 176 [2022-04-28 03:57:39,135 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 03:57:39,135 INFO L195 NwaCegarLoop]: trace histogram [64, 63, 35, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 03:57:39,154 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (35)] Ended with exit code 0 [2022-04-28 03:57:39,336 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 35 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable36 [2022-04-28 03:57:39,336 INFO L420 AbstractCegarLoop]: === Iteration 38 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 03:57:39,336 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 03:57:39,336 INFO L85 PathProgramCache]: Analyzing trace with hash -2049932562, now seen corresponding path program 35 times [2022-04-28 03:57:39,336 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 03:57:39,337 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1320786263] [2022-04-28 03:57:39,456 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 1 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 03:57:39,680 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={1=1, 2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 03:57:39,681 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-28 03:57:39,683 INFO L85 PathProgramCache]: Analyzing trace with hash -567032222, now seen corresponding path program 1 times [2022-04-28 03:57:39,683 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 03:57:39,683 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [271362350] [2022-04-28 03:57:39,683 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:57:39,683 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 03:57:39,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:57:40,332 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 03:57:40,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:57:40,335 INFO L290 TraceCheckUtils]: 0: Hoare triple {45510#(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); {45469#true} is VALID [2022-04-28 03:57:40,335 INFO L290 TraceCheckUtils]: 1: Hoare triple {45469#true} assume true; {45469#true} is VALID [2022-04-28 03:57:40,335 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {45469#true} {45469#true} #52#return; {45469#true} is VALID [2022-04-28 03:57:40,336 INFO L272 TraceCheckUtils]: 0: Hoare triple {45469#true} call ULTIMATE.init(); {45510#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 03:57:40,336 INFO L290 TraceCheckUtils]: 1: Hoare triple {45510#(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); {45469#true} is VALID [2022-04-28 03:57:40,336 INFO L290 TraceCheckUtils]: 2: Hoare triple {45469#true} assume true; {45469#true} is VALID [2022-04-28 03:57:40,336 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {45469#true} {45469#true} #52#return; {45469#true} is VALID [2022-04-28 03:57:40,336 INFO L272 TraceCheckUtils]: 4: Hoare triple {45469#true} call #t~ret7 := main(); {45469#true} is VALID [2022-04-28 03:57:40,336 INFO L290 TraceCheckUtils]: 5: Hoare triple {45469#true} ~x~0 := 0;~y~0 := 50000;~z~0 := 0;~x~0 := 0; {45474#(<= 50000 main_~y~0)} is VALID [2022-04-28 03:57:40,336 INFO L290 TraceCheckUtils]: 6: Hoare triple {45474#(<= 50000 main_~y~0)} [196] L11-2-->L18-1_primed: Formula: (let ((.cse0 (= v_main_~x~0_2305 v_main_~x~0_2304)) (.cse1 (= |v_main_#t~post4_222| |v_main_#t~post4_221|))) (or (and .cse0 .cse1) (and (not (< v_main_~x~0_2305 50000)) .cse0 .cse1) (and (< v_main_~x~0_2304 50001) (< v_main_~x~0_2305 v_main_~x~0_2304)))) InVars {main_~x~0=v_main_~x~0_2305, main_#t~post4=|v_main_#t~post4_222|} OutVars{main_~x~0=v_main_~x~0_2304, main_#t~post4=|v_main_#t~post4_221|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {45474#(<= 50000 main_~y~0)} is VALID [2022-04-28 03:57:40,337 INFO L290 TraceCheckUtils]: 7: Hoare triple {45474#(<= 50000 main_~y~0)} [197] L18-1_primed-->L11-2: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {45474#(<= 50000 main_~y~0)} is VALID [2022-04-28 03:57:40,337 INFO L290 TraceCheckUtils]: 8: Hoare triple {45474#(<= 50000 main_~y~0)} [198] L11-2-->L18-1_primed: Formula: (let ((.cse3 (<= 50000 v_main_~x~0_2307)) (.cse0 (= v_main_~x~0_2307 v_main_~x~0_2306)) (.cse1 (= |v_main_#t~post6_242| |v_main_#t~post6_241|)) (.cse2 (= v_main_~y~0_2606 v_main_~y~0_2605)) (.cse4 (= |v_main_#t~post5_242| |v_main_#t~post5_241|))) (or (and .cse0 .cse1 .cse2 (or (not .cse3) (not (< v_main_~x~0_2307 1000000))) .cse4) (let ((.cse5 (+ v_main_~x~0_2307 v_main_~y~0_2605))) (and .cse3 (= .cse5 (+ v_main_~x~0_2306 v_main_~y~0_2606)) (< v_main_~y~0_2606 v_main_~y~0_2605) (< .cse5 (+ 1000001 v_main_~y~0_2606)))) (and .cse0 .cse1 .cse2 .cse4))) InVars {main_~y~0=v_main_~y~0_2606, main_#t~post5=|v_main_#t~post5_242|, main_~x~0=v_main_~x~0_2307, main_#t~post6=|v_main_#t~post6_242|} OutVars{main_~y~0=v_main_~y~0_2605, main_#t~post5=|v_main_#t~post5_241|, main_~x~0=v_main_~x~0_2306, main_#t~post6=|v_main_#t~post6_241|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {45474#(<= 50000 main_~y~0)} is VALID [2022-04-28 03:57:40,338 INFO L290 TraceCheckUtils]: 9: Hoare triple {45474#(<= 50000 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[] {45474#(<= 50000 main_~y~0)} is VALID [2022-04-28 03:57:40,338 INFO L290 TraceCheckUtils]: 10: Hoare triple {45474#(<= 50000 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {45475#(<= 49998 main_~y~0)} is VALID [2022-04-28 03:57:40,339 INFO L290 TraceCheckUtils]: 11: Hoare triple {45475#(<= 49998 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {45476#(<= 49996 main_~y~0)} is VALID [2022-04-28 03:57:40,339 INFO L290 TraceCheckUtils]: 12: Hoare triple {45476#(<= 49996 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {45477#(<= 49994 main_~y~0)} is VALID [2022-04-28 03:57:40,339 INFO L290 TraceCheckUtils]: 13: Hoare triple {45477#(<= 49994 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {45478#(<= 49992 main_~y~0)} is VALID [2022-04-28 03:57:40,340 INFO L290 TraceCheckUtils]: 14: Hoare triple {45478#(<= 49992 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {45479#(<= 49990 main_~y~0)} is VALID [2022-04-28 03:57:40,340 INFO L290 TraceCheckUtils]: 15: Hoare triple {45479#(<= 49990 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {45480#(<= 49988 main_~y~0)} is VALID [2022-04-28 03:57:40,341 INFO L290 TraceCheckUtils]: 16: Hoare triple {45480#(<= 49988 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {45481#(<= 49986 main_~y~0)} is VALID [2022-04-28 03:57:40,341 INFO L290 TraceCheckUtils]: 17: Hoare triple {45481#(<= 49986 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {45482#(<= 49984 main_~y~0)} is VALID [2022-04-28 03:57:40,342 INFO L290 TraceCheckUtils]: 18: Hoare triple {45482#(<= 49984 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {45483#(<= 49982 main_~y~0)} is VALID [2022-04-28 03:57:40,342 INFO L290 TraceCheckUtils]: 19: Hoare triple {45483#(<= 49982 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {45484#(<= 49980 main_~y~0)} is VALID [2022-04-28 03:57:40,343 INFO L290 TraceCheckUtils]: 20: Hoare triple {45484#(<= 49980 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {45485#(<= 49978 main_~y~0)} is VALID [2022-04-28 03:57:40,343 INFO L290 TraceCheckUtils]: 21: Hoare triple {45485#(<= 49978 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {45486#(<= 49976 main_~y~0)} is VALID [2022-04-28 03:57:40,344 INFO L290 TraceCheckUtils]: 22: Hoare triple {45486#(<= 49976 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {45487#(<= 49974 main_~y~0)} is VALID [2022-04-28 03:57:40,344 INFO L290 TraceCheckUtils]: 23: Hoare triple {45487#(<= 49974 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {45488#(<= 49972 main_~y~0)} is VALID [2022-04-28 03:57:40,345 INFO L290 TraceCheckUtils]: 24: Hoare triple {45488#(<= 49972 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {45489#(<= 49970 main_~y~0)} is VALID [2022-04-28 03:57:40,345 INFO L290 TraceCheckUtils]: 25: Hoare triple {45489#(<= 49970 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {45490#(<= 49968 main_~y~0)} is VALID [2022-04-28 03:57:40,346 INFO L290 TraceCheckUtils]: 26: Hoare triple {45490#(<= 49968 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {45491#(<= 49966 main_~y~0)} is VALID [2022-04-28 03:57:40,346 INFO L290 TraceCheckUtils]: 27: Hoare triple {45491#(<= 49966 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {45492#(<= 49964 main_~y~0)} is VALID [2022-04-28 03:57:40,346 INFO L290 TraceCheckUtils]: 28: Hoare triple {45492#(<= 49964 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {45493#(<= 49962 main_~y~0)} is VALID [2022-04-28 03:57:40,347 INFO L290 TraceCheckUtils]: 29: Hoare triple {45493#(<= 49962 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {45494#(<= 49960 main_~y~0)} is VALID [2022-04-28 03:57:40,347 INFO L290 TraceCheckUtils]: 30: Hoare triple {45494#(<= 49960 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {45495#(<= 49958 main_~y~0)} is VALID [2022-04-28 03:57:40,348 INFO L290 TraceCheckUtils]: 31: Hoare triple {45495#(<= 49958 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {45496#(<= 49956 main_~y~0)} is VALID [2022-04-28 03:57:40,348 INFO L290 TraceCheckUtils]: 32: Hoare triple {45496#(<= 49956 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {45497#(<= 49954 main_~y~0)} is VALID [2022-04-28 03:57:40,348 INFO L290 TraceCheckUtils]: 33: Hoare triple {45497#(<= 49954 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {45498#(<= 49952 main_~y~0)} is VALID [2022-04-28 03:57:40,349 INFO L290 TraceCheckUtils]: 34: Hoare triple {45498#(<= 49952 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {45499#(<= 49950 main_~y~0)} is VALID [2022-04-28 03:57:40,349 INFO L290 TraceCheckUtils]: 35: Hoare triple {45499#(<= 49950 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {45500#(<= 49948 main_~y~0)} is VALID [2022-04-28 03:57:40,350 INFO L290 TraceCheckUtils]: 36: Hoare triple {45500#(<= 49948 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {45501#(<= 49946 main_~y~0)} is VALID [2022-04-28 03:57:40,350 INFO L290 TraceCheckUtils]: 37: Hoare triple {45501#(<= 49946 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {45502#(<= 49944 main_~y~0)} is VALID [2022-04-28 03:57:40,351 INFO L290 TraceCheckUtils]: 38: Hoare triple {45502#(<= 49944 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {45503#(<= 49942 main_~y~0)} is VALID [2022-04-28 03:57:40,351 INFO L290 TraceCheckUtils]: 39: Hoare triple {45503#(<= 49942 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {45504#(<= 49940 main_~y~0)} is VALID [2022-04-28 03:57:40,351 INFO L290 TraceCheckUtils]: 40: Hoare triple {45504#(<= 49940 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {45505#(<= 49938 main_~y~0)} is VALID [2022-04-28 03:57:40,352 INFO L290 TraceCheckUtils]: 41: Hoare triple {45505#(<= 49938 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {45506#(<= 49936 main_~y~0)} is VALID [2022-04-28 03:57:40,352 INFO L290 TraceCheckUtils]: 42: Hoare triple {45506#(<= 49936 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {45507#(<= 49934 main_~y~0)} is VALID [2022-04-28 03:57:40,353 INFO L290 TraceCheckUtils]: 43: Hoare triple {45507#(<= 49934 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {45508#(<= 49932 main_~y~0)} is VALID [2022-04-28 03:57:40,353 INFO L290 TraceCheckUtils]: 44: Hoare triple {45508#(<= 49932 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {45509#(<= 49930 main_~y~0)} is VALID [2022-04-28 03:57:40,353 INFO L290 TraceCheckUtils]: 45: Hoare triple {45509#(<= 49930 main_~y~0)} assume !(~y~0 > 0); {45470#false} is VALID [2022-04-28 03:57:40,354 INFO L272 TraceCheckUtils]: 46: Hoare triple {45470#false} call __VERIFIER_assert((if ~z~0 == ~x~0 then 1 else 0)); {45470#false} is VALID [2022-04-28 03:57:40,354 INFO L290 TraceCheckUtils]: 47: Hoare triple {45470#false} ~cond := #in~cond; {45470#false} is VALID [2022-04-28 03:57:40,354 INFO L290 TraceCheckUtils]: 48: Hoare triple {45470#false} assume 0 == ~cond; {45470#false} is VALID [2022-04-28 03:57:40,354 INFO L290 TraceCheckUtils]: 49: Hoare triple {45470#false} assume !false; {45470#false} is VALID [2022-04-28 03:57:40,354 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-28 03:57:40,354 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 03:57:40,354 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [271362350] [2022-04-28 03:57:40,354 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [271362350] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 03:57:40,354 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [46053511] [2022-04-28 03:57:40,354 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:57:40,354 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 03:57:40,354 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 03:57:40,355 INFO L229 MonitoredProcess]: Starting monitored process 36 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 03:57:40,356 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (36)] Waiting until timeout for monitored process [2022-04-28 03:57:40,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:57:40,413 INFO L263 TraceCheckSpWp]: Trace formula consists of 234 conjuncts, 38 conjunts are in the unsatisfiable core [2022-04-28 03:57:40,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:57:40,432 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 03:57:40,877 INFO L272 TraceCheckUtils]: 0: Hoare triple {45469#true} call ULTIMATE.init(); {45469#true} is VALID [2022-04-28 03:57:40,878 INFO L290 TraceCheckUtils]: 1: Hoare triple {45469#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); {45469#true} is VALID [2022-04-28 03:57:40,878 INFO L290 TraceCheckUtils]: 2: Hoare triple {45469#true} assume true; {45469#true} is VALID [2022-04-28 03:57:40,878 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {45469#true} {45469#true} #52#return; {45469#true} is VALID [2022-04-28 03:57:40,878 INFO L272 TraceCheckUtils]: 4: Hoare triple {45469#true} call #t~ret7 := main(); {45469#true} is VALID [2022-04-28 03:57:40,878 INFO L290 TraceCheckUtils]: 5: Hoare triple {45469#true} ~x~0 := 0;~y~0 := 50000;~z~0 := 0;~x~0 := 0; {45474#(<= 50000 main_~y~0)} is VALID [2022-04-28 03:57:40,878 INFO L290 TraceCheckUtils]: 6: Hoare triple {45474#(<= 50000 main_~y~0)} [196] L11-2-->L18-1_primed: Formula: (let ((.cse0 (= v_main_~x~0_2305 v_main_~x~0_2304)) (.cse1 (= |v_main_#t~post4_222| |v_main_#t~post4_221|))) (or (and .cse0 .cse1) (and (not (< v_main_~x~0_2305 50000)) .cse0 .cse1) (and (< v_main_~x~0_2304 50001) (< v_main_~x~0_2305 v_main_~x~0_2304)))) InVars {main_~x~0=v_main_~x~0_2305, main_#t~post4=|v_main_#t~post4_222|} OutVars{main_~x~0=v_main_~x~0_2304, main_#t~post4=|v_main_#t~post4_221|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {45474#(<= 50000 main_~y~0)} is VALID [2022-04-28 03:57:40,879 INFO L290 TraceCheckUtils]: 7: Hoare triple {45474#(<= 50000 main_~y~0)} [197] L18-1_primed-->L11-2: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {45474#(<= 50000 main_~y~0)} is VALID [2022-04-28 03:57:40,879 INFO L290 TraceCheckUtils]: 8: Hoare triple {45474#(<= 50000 main_~y~0)} [198] L11-2-->L18-1_primed: Formula: (let ((.cse3 (<= 50000 v_main_~x~0_2307)) (.cse0 (= v_main_~x~0_2307 v_main_~x~0_2306)) (.cse1 (= |v_main_#t~post6_242| |v_main_#t~post6_241|)) (.cse2 (= v_main_~y~0_2606 v_main_~y~0_2605)) (.cse4 (= |v_main_#t~post5_242| |v_main_#t~post5_241|))) (or (and .cse0 .cse1 .cse2 (or (not .cse3) (not (< v_main_~x~0_2307 1000000))) .cse4) (let ((.cse5 (+ v_main_~x~0_2307 v_main_~y~0_2605))) (and .cse3 (= .cse5 (+ v_main_~x~0_2306 v_main_~y~0_2606)) (< v_main_~y~0_2606 v_main_~y~0_2605) (< .cse5 (+ 1000001 v_main_~y~0_2606)))) (and .cse0 .cse1 .cse2 .cse4))) InVars {main_~y~0=v_main_~y~0_2606, main_#t~post5=|v_main_#t~post5_242|, main_~x~0=v_main_~x~0_2307, main_#t~post6=|v_main_#t~post6_242|} OutVars{main_~y~0=v_main_~y~0_2605, main_#t~post5=|v_main_#t~post5_241|, main_~x~0=v_main_~x~0_2306, main_#t~post6=|v_main_#t~post6_241|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {45474#(<= 50000 main_~y~0)} is VALID [2022-04-28 03:57:40,880 INFO L290 TraceCheckUtils]: 9: Hoare triple {45474#(<= 50000 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[] {45474#(<= 50000 main_~y~0)} is VALID [2022-04-28 03:57:40,880 INFO L290 TraceCheckUtils]: 10: Hoare triple {45474#(<= 50000 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {45475#(<= 49998 main_~y~0)} is VALID [2022-04-28 03:57:40,881 INFO L290 TraceCheckUtils]: 11: Hoare triple {45475#(<= 49998 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {45476#(<= 49996 main_~y~0)} is VALID [2022-04-28 03:57:40,881 INFO L290 TraceCheckUtils]: 12: Hoare triple {45476#(<= 49996 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {45477#(<= 49994 main_~y~0)} is VALID [2022-04-28 03:57:40,881 INFO L290 TraceCheckUtils]: 13: Hoare triple {45477#(<= 49994 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {45478#(<= 49992 main_~y~0)} is VALID [2022-04-28 03:57:40,882 INFO L290 TraceCheckUtils]: 14: Hoare triple {45478#(<= 49992 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {45479#(<= 49990 main_~y~0)} is VALID [2022-04-28 03:57:40,882 INFO L290 TraceCheckUtils]: 15: Hoare triple {45479#(<= 49990 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {45480#(<= 49988 main_~y~0)} is VALID [2022-04-28 03:57:40,883 INFO L290 TraceCheckUtils]: 16: Hoare triple {45480#(<= 49988 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {45481#(<= 49986 main_~y~0)} is VALID [2022-04-28 03:57:40,883 INFO L290 TraceCheckUtils]: 17: Hoare triple {45481#(<= 49986 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {45482#(<= 49984 main_~y~0)} is VALID [2022-04-28 03:57:40,883 INFO L290 TraceCheckUtils]: 18: Hoare triple {45482#(<= 49984 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {45483#(<= 49982 main_~y~0)} is VALID [2022-04-28 03:57:40,884 INFO L290 TraceCheckUtils]: 19: Hoare triple {45483#(<= 49982 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {45484#(<= 49980 main_~y~0)} is VALID [2022-04-28 03:57:40,884 INFO L290 TraceCheckUtils]: 20: Hoare triple {45484#(<= 49980 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {45485#(<= 49978 main_~y~0)} is VALID [2022-04-28 03:57:40,885 INFO L290 TraceCheckUtils]: 21: Hoare triple {45485#(<= 49978 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {45486#(<= 49976 main_~y~0)} is VALID [2022-04-28 03:57:40,885 INFO L290 TraceCheckUtils]: 22: Hoare triple {45486#(<= 49976 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {45487#(<= 49974 main_~y~0)} is VALID [2022-04-28 03:57:40,886 INFO L290 TraceCheckUtils]: 23: Hoare triple {45487#(<= 49974 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {45488#(<= 49972 main_~y~0)} is VALID [2022-04-28 03:57:40,886 INFO L290 TraceCheckUtils]: 24: Hoare triple {45488#(<= 49972 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {45489#(<= 49970 main_~y~0)} is VALID [2022-04-28 03:57:40,886 INFO L290 TraceCheckUtils]: 25: Hoare triple {45489#(<= 49970 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {45490#(<= 49968 main_~y~0)} is VALID [2022-04-28 03:57:40,887 INFO L290 TraceCheckUtils]: 26: Hoare triple {45490#(<= 49968 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {45491#(<= 49966 main_~y~0)} is VALID [2022-04-28 03:57:40,887 INFO L290 TraceCheckUtils]: 27: Hoare triple {45491#(<= 49966 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {45492#(<= 49964 main_~y~0)} is VALID [2022-04-28 03:57:40,888 INFO L290 TraceCheckUtils]: 28: Hoare triple {45492#(<= 49964 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {45493#(<= 49962 main_~y~0)} is VALID [2022-04-28 03:57:40,888 INFO L290 TraceCheckUtils]: 29: Hoare triple {45493#(<= 49962 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {45494#(<= 49960 main_~y~0)} is VALID [2022-04-28 03:57:40,888 INFO L290 TraceCheckUtils]: 30: Hoare triple {45494#(<= 49960 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {45495#(<= 49958 main_~y~0)} is VALID [2022-04-28 03:57:40,889 INFO L290 TraceCheckUtils]: 31: Hoare triple {45495#(<= 49958 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {45496#(<= 49956 main_~y~0)} is VALID [2022-04-28 03:57:40,889 INFO L290 TraceCheckUtils]: 32: Hoare triple {45496#(<= 49956 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {45497#(<= 49954 main_~y~0)} is VALID [2022-04-28 03:57:40,890 INFO L290 TraceCheckUtils]: 33: Hoare triple {45497#(<= 49954 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {45498#(<= 49952 main_~y~0)} is VALID [2022-04-28 03:57:40,890 INFO L290 TraceCheckUtils]: 34: Hoare triple {45498#(<= 49952 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {45499#(<= 49950 main_~y~0)} is VALID [2022-04-28 03:57:40,890 INFO L290 TraceCheckUtils]: 35: Hoare triple {45499#(<= 49950 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {45500#(<= 49948 main_~y~0)} is VALID [2022-04-28 03:57:40,891 INFO L290 TraceCheckUtils]: 36: Hoare triple {45500#(<= 49948 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {45501#(<= 49946 main_~y~0)} is VALID [2022-04-28 03:57:40,891 INFO L290 TraceCheckUtils]: 37: Hoare triple {45501#(<= 49946 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {45502#(<= 49944 main_~y~0)} is VALID [2022-04-28 03:57:40,892 INFO L290 TraceCheckUtils]: 38: Hoare triple {45502#(<= 49944 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {45503#(<= 49942 main_~y~0)} is VALID [2022-04-28 03:57:40,892 INFO L290 TraceCheckUtils]: 39: Hoare triple {45503#(<= 49942 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {45504#(<= 49940 main_~y~0)} is VALID [2022-04-28 03:57:40,893 INFO L290 TraceCheckUtils]: 40: Hoare triple {45504#(<= 49940 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {45505#(<= 49938 main_~y~0)} is VALID [2022-04-28 03:57:40,893 INFO L290 TraceCheckUtils]: 41: Hoare triple {45505#(<= 49938 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {45506#(<= 49936 main_~y~0)} is VALID [2022-04-28 03:57:40,893 INFO L290 TraceCheckUtils]: 42: Hoare triple {45506#(<= 49936 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {45507#(<= 49934 main_~y~0)} is VALID [2022-04-28 03:57:40,894 INFO L290 TraceCheckUtils]: 43: Hoare triple {45507#(<= 49934 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {45508#(<= 49932 main_~y~0)} is VALID [2022-04-28 03:57:40,894 INFO L290 TraceCheckUtils]: 44: Hoare triple {45508#(<= 49932 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {45509#(<= 49930 main_~y~0)} is VALID [2022-04-28 03:57:40,895 INFO L290 TraceCheckUtils]: 45: Hoare triple {45509#(<= 49930 main_~y~0)} assume !(~y~0 > 0); {45470#false} is VALID [2022-04-28 03:57:40,895 INFO L272 TraceCheckUtils]: 46: Hoare triple {45470#false} call __VERIFIER_assert((if ~z~0 == ~x~0 then 1 else 0)); {45470#false} is VALID [2022-04-28 03:57:40,895 INFO L290 TraceCheckUtils]: 47: Hoare triple {45470#false} ~cond := #in~cond; {45470#false} is VALID [2022-04-28 03:57:40,895 INFO L290 TraceCheckUtils]: 48: Hoare triple {45470#false} assume 0 == ~cond; {45470#false} is VALID [2022-04-28 03:57:40,895 INFO L290 TraceCheckUtils]: 49: Hoare triple {45470#false} assume !false; {45470#false} is VALID [2022-04-28 03:57:40,895 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-28 03:57:40,895 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 03:57:42,603 INFO L290 TraceCheckUtils]: 49: Hoare triple {45470#false} assume !false; {45470#false} is VALID [2022-04-28 03:57:42,603 INFO L290 TraceCheckUtils]: 48: Hoare triple {45470#false} assume 0 == ~cond; {45470#false} is VALID [2022-04-28 03:57:42,603 INFO L290 TraceCheckUtils]: 47: Hoare triple {45470#false} ~cond := #in~cond; {45470#false} is VALID [2022-04-28 03:57:42,603 INFO L272 TraceCheckUtils]: 46: Hoare triple {45470#false} call __VERIFIER_assert((if ~z~0 == ~x~0 then 1 else 0)); {45470#false} is VALID [2022-04-28 03:57:42,603 INFO L290 TraceCheckUtils]: 45: Hoare triple {45673#(< 0 main_~y~0)} assume !(~y~0 > 0); {45470#false} is VALID [2022-04-28 03:57:42,604 INFO L290 TraceCheckUtils]: 44: Hoare triple {45677#(< 2 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {45673#(< 0 main_~y~0)} is VALID [2022-04-28 03:57:42,604 INFO L290 TraceCheckUtils]: 43: Hoare triple {45681#(< 4 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {45677#(< 2 main_~y~0)} is VALID [2022-04-28 03:57:42,605 INFO L290 TraceCheckUtils]: 42: Hoare triple {45685#(< 6 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {45681#(< 4 main_~y~0)} is VALID [2022-04-28 03:57:42,605 INFO L290 TraceCheckUtils]: 41: Hoare triple {45689#(< 8 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {45685#(< 6 main_~y~0)} is VALID [2022-04-28 03:57:42,605 INFO L290 TraceCheckUtils]: 40: Hoare triple {45693#(< 10 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {45689#(< 8 main_~y~0)} is VALID [2022-04-28 03:57:42,606 INFO L290 TraceCheckUtils]: 39: Hoare triple {45697#(< 12 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {45693#(< 10 main_~y~0)} is VALID [2022-04-28 03:57:42,606 INFO L290 TraceCheckUtils]: 38: Hoare triple {45701#(< 14 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {45697#(< 12 main_~y~0)} is VALID [2022-04-28 03:57:42,607 INFO L290 TraceCheckUtils]: 37: Hoare triple {45705#(< 16 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {45701#(< 14 main_~y~0)} is VALID [2022-04-28 03:57:42,607 INFO L290 TraceCheckUtils]: 36: Hoare triple {45709#(< 18 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {45705#(< 16 main_~y~0)} is VALID [2022-04-28 03:57:42,608 INFO L290 TraceCheckUtils]: 35: Hoare triple {45713#(< 20 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {45709#(< 18 main_~y~0)} is VALID [2022-04-28 03:57:42,608 INFO L290 TraceCheckUtils]: 34: Hoare triple {45717#(< 22 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {45713#(< 20 main_~y~0)} is VALID [2022-04-28 03:57:42,608 INFO L290 TraceCheckUtils]: 33: Hoare triple {45721#(< 24 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {45717#(< 22 main_~y~0)} is VALID [2022-04-28 03:57:42,609 INFO L290 TraceCheckUtils]: 32: Hoare triple {45725#(< 26 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {45721#(< 24 main_~y~0)} is VALID [2022-04-28 03:57:42,609 INFO L290 TraceCheckUtils]: 31: Hoare triple {45729#(< 28 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {45725#(< 26 main_~y~0)} is VALID [2022-04-28 03:57:42,610 INFO L290 TraceCheckUtils]: 30: Hoare triple {45733#(< 30 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {45729#(< 28 main_~y~0)} is VALID [2022-04-28 03:57:42,610 INFO L290 TraceCheckUtils]: 29: Hoare triple {45737#(< 32 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {45733#(< 30 main_~y~0)} is VALID [2022-04-28 03:57:42,610 INFO L290 TraceCheckUtils]: 28: Hoare triple {45741#(< 34 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {45737#(< 32 main_~y~0)} is VALID [2022-04-28 03:57:42,611 INFO L290 TraceCheckUtils]: 27: Hoare triple {45745#(< 36 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {45741#(< 34 main_~y~0)} is VALID [2022-04-28 03:57:42,611 INFO L290 TraceCheckUtils]: 26: Hoare triple {45749#(< 38 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {45745#(< 36 main_~y~0)} is VALID [2022-04-28 03:57:42,612 INFO L290 TraceCheckUtils]: 25: Hoare triple {45753#(< 40 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {45749#(< 38 main_~y~0)} is VALID [2022-04-28 03:57:42,612 INFO L290 TraceCheckUtils]: 24: Hoare triple {45757#(< 42 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {45753#(< 40 main_~y~0)} is VALID [2022-04-28 03:57:42,612 INFO L290 TraceCheckUtils]: 23: Hoare triple {45761#(< 44 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {45757#(< 42 main_~y~0)} is VALID [2022-04-28 03:57:42,613 INFO L290 TraceCheckUtils]: 22: Hoare triple {45765#(< 46 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {45761#(< 44 main_~y~0)} is VALID [2022-04-28 03:57:42,613 INFO L290 TraceCheckUtils]: 21: Hoare triple {45769#(< 48 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {45765#(< 46 main_~y~0)} is VALID [2022-04-28 03:57:42,614 INFO L290 TraceCheckUtils]: 20: Hoare triple {45773#(< 50 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {45769#(< 48 main_~y~0)} is VALID [2022-04-28 03:57:42,614 INFO L290 TraceCheckUtils]: 19: Hoare triple {45777#(< 52 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {45773#(< 50 main_~y~0)} is VALID [2022-04-28 03:57:42,614 INFO L290 TraceCheckUtils]: 18: Hoare triple {45781#(< 54 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {45777#(< 52 main_~y~0)} is VALID [2022-04-28 03:57:42,615 INFO L290 TraceCheckUtils]: 17: Hoare triple {45785#(< 56 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {45781#(< 54 main_~y~0)} is VALID [2022-04-28 03:57:42,615 INFO L290 TraceCheckUtils]: 16: Hoare triple {45789#(< 58 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {45785#(< 56 main_~y~0)} is VALID [2022-04-28 03:57:42,616 INFO L290 TraceCheckUtils]: 15: Hoare triple {45793#(< 60 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {45789#(< 58 main_~y~0)} is VALID [2022-04-28 03:57:42,616 INFO L290 TraceCheckUtils]: 14: Hoare triple {45797#(< 62 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {45793#(< 60 main_~y~0)} is VALID [2022-04-28 03:57:42,616 INFO L290 TraceCheckUtils]: 13: Hoare triple {45801#(< 64 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {45797#(< 62 main_~y~0)} is VALID [2022-04-28 03:57:42,617 INFO L290 TraceCheckUtils]: 12: Hoare triple {45805#(< 66 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {45801#(< 64 main_~y~0)} is VALID [2022-04-28 03:57:42,617 INFO L290 TraceCheckUtils]: 11: Hoare triple {45809#(< 68 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {45805#(< 66 main_~y~0)} is VALID [2022-04-28 03:57:42,618 INFO L290 TraceCheckUtils]: 10: Hoare triple {45813#(< 70 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {45809#(< 68 main_~y~0)} is VALID [2022-04-28 03:57:42,618 INFO L290 TraceCheckUtils]: 9: Hoare triple {45813#(< 70 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[] {45813#(< 70 main_~y~0)} is VALID [2022-04-28 03:57:42,619 INFO L290 TraceCheckUtils]: 8: Hoare triple {45813#(< 70 main_~y~0)} [198] L11-2-->L18-1_primed: Formula: (let ((.cse3 (<= 50000 v_main_~x~0_2307)) (.cse0 (= v_main_~x~0_2307 v_main_~x~0_2306)) (.cse1 (= |v_main_#t~post6_242| |v_main_#t~post6_241|)) (.cse2 (= v_main_~y~0_2606 v_main_~y~0_2605)) (.cse4 (= |v_main_#t~post5_242| |v_main_#t~post5_241|))) (or (and .cse0 .cse1 .cse2 (or (not .cse3) (not (< v_main_~x~0_2307 1000000))) .cse4) (let ((.cse5 (+ v_main_~x~0_2307 v_main_~y~0_2605))) (and .cse3 (= .cse5 (+ v_main_~x~0_2306 v_main_~y~0_2606)) (< v_main_~y~0_2606 v_main_~y~0_2605) (< .cse5 (+ 1000001 v_main_~y~0_2606)))) (and .cse0 .cse1 .cse2 .cse4))) InVars {main_~y~0=v_main_~y~0_2606, main_#t~post5=|v_main_#t~post5_242|, main_~x~0=v_main_~x~0_2307, main_#t~post6=|v_main_#t~post6_242|} OutVars{main_~y~0=v_main_~y~0_2605, main_#t~post5=|v_main_#t~post5_241|, main_~x~0=v_main_~x~0_2306, main_#t~post6=|v_main_#t~post6_241|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {45813#(< 70 main_~y~0)} is VALID [2022-04-28 03:57:42,619 INFO L290 TraceCheckUtils]: 7: Hoare triple {45813#(< 70 main_~y~0)} [197] L18-1_primed-->L11-2: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {45813#(< 70 main_~y~0)} is VALID [2022-04-28 03:57:42,619 INFO L290 TraceCheckUtils]: 6: Hoare triple {45813#(< 70 main_~y~0)} [196] L11-2-->L18-1_primed: Formula: (let ((.cse0 (= v_main_~x~0_2305 v_main_~x~0_2304)) (.cse1 (= |v_main_#t~post4_222| |v_main_#t~post4_221|))) (or (and .cse0 .cse1) (and (not (< v_main_~x~0_2305 50000)) .cse0 .cse1) (and (< v_main_~x~0_2304 50001) (< v_main_~x~0_2305 v_main_~x~0_2304)))) InVars {main_~x~0=v_main_~x~0_2305, main_#t~post4=|v_main_#t~post4_222|} OutVars{main_~x~0=v_main_~x~0_2304, main_#t~post4=|v_main_#t~post4_221|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {45813#(< 70 main_~y~0)} is VALID [2022-04-28 03:57:42,620 INFO L290 TraceCheckUtils]: 5: Hoare triple {45469#true} ~x~0 := 0;~y~0 := 50000;~z~0 := 0;~x~0 := 0; {45813#(< 70 main_~y~0)} is VALID [2022-04-28 03:57:42,620 INFO L272 TraceCheckUtils]: 4: Hoare triple {45469#true} call #t~ret7 := main(); {45469#true} is VALID [2022-04-28 03:57:42,620 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {45469#true} {45469#true} #52#return; {45469#true} is VALID [2022-04-28 03:57:42,620 INFO L290 TraceCheckUtils]: 2: Hoare triple {45469#true} assume true; {45469#true} is VALID [2022-04-28 03:57:42,620 INFO L290 TraceCheckUtils]: 1: Hoare triple {45469#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); {45469#true} is VALID [2022-04-28 03:57:42,620 INFO L272 TraceCheckUtils]: 0: Hoare triple {45469#true} call ULTIMATE.init(); {45469#true} is VALID [2022-04-28 03:57:42,620 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-28 03:57:42,621 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [46053511] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 03:57:42,621 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 03:57:42,621 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [39, 38, 38] total 75 [2022-04-28 03:57:45,537 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 03:57:45,538 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1320786263] [2022-04-28 03:57:45,538 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1320786263] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 03:57:45,538 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 03:57:45,538 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [104] imperfect sequences [] total 104 [2022-04-28 03:57:45,538 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1655096993] [2022-04-28 03:57:45,538 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 03:57:45,538 INFO L78 Accepts]: Start accepts. Automaton has has 104 states, 104 states have (on average 1.6442307692307692) internal successors, (171), 103 states have internal predecessors, (171), 2 states have call successors, (3), 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 175 [2022-04-28 03:57:45,539 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 03:57:45,539 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 104 states, 104 states have (on average 1.6442307692307692) internal successors, (171), 103 states have internal predecessors, (171), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:57:45,656 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 175 edges. 175 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 03:57:45,657 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 104 states [2022-04-28 03:57:45,657 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 03:57:45,657 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 104 interpolants. [2022-04-28 03:57:45,659 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7577, Invalid=11883, Unknown=0, NotChecked=0, Total=19460 [2022-04-28 03:57:45,659 INFO L87 Difference]: Start difference. First operand 300 states and 304 transitions. Second operand has 104 states, 104 states have (on average 1.6442307692307692) internal successors, (171), 103 states have internal predecessors, (171), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:58:01,981 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:58:01,981 INFO L93 Difference]: Finished difference Result 473 states and 487 transitions. [2022-04-28 03:58:01,981 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 104 states. [2022-04-28 03:58:01,981 INFO L78 Accepts]: Start accepts. Automaton has has 104 states, 104 states have (on average 1.6442307692307692) internal successors, (171), 103 states have internal predecessors, (171), 2 states have call successors, (3), 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 175 [2022-04-28 03:58:01,982 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 03:58:01,982 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 104 states, 104 states have (on average 1.6442307692307692) internal successors, (171), 103 states have internal predecessors, (171), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:58:01,983 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 199 transitions. [2022-04-28 03:58:01,983 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 104 states, 104 states have (on average 1.6442307692307692) internal successors, (171), 103 states have internal predecessors, (171), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:58:01,984 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 199 transitions. [2022-04-28 03:58:01,984 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 104 states and 199 transitions. [2022-04-28 03:58:02,140 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 199 edges. 199 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 03:58:02,144 INFO L225 Difference]: With dead ends: 473 [2022-04-28 03:58:02,144 INFO L226 Difference]: Without dead ends: 307 [2022-04-28 03:58:02,147 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 374 GetRequests, 134 SyntacticMatches, 1 SemanticMatches, 239 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16796 ImplicationChecksByTransitivity, 7.8s TimeCoverageRelationStatistics Valid=17685, Invalid=40155, Unknown=0, NotChecked=0, Total=57840 [2022-04-28 03:58:02,148 INFO L413 NwaCegarLoop]: 12 mSDtfsCounter, 274 mSDsluCounter, 32 mSDsCounter, 0 mSdLazyCounter, 8407 mSolverCounterSat, 248 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 274 SdHoareTripleChecker+Valid, 44 SdHoareTripleChecker+Invalid, 8655 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 248 IncrementalHoareTripleChecker+Valid, 8407 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6.5s IncrementalHoareTripleChecker+Time [2022-04-28 03:58:02,149 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [274 Valid, 44 Invalid, 8655 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [248 Valid, 8407 Invalid, 0 Unknown, 0 Unchecked, 6.5s Time] [2022-04-28 03:58:02,149 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 307 states. [2022-04-28 03:58:02,413 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 307 to 181. [2022-04-28 03:58:02,413 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 03:58:02,413 INFO L82 GeneralOperation]: Start isEquivalent. First operand 307 states. Second operand has 181 states, 176 states have (on average 1.0227272727272727) internal successors, (180), 176 states have internal predecessors, (180), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:58:02,413 INFO L74 IsIncluded]: Start isIncluded. First operand 307 states. Second operand has 181 states, 176 states have (on average 1.0227272727272727) internal successors, (180), 176 states have internal predecessors, (180), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:58:02,413 INFO L87 Difference]: Start difference. First operand 307 states. Second operand has 181 states, 176 states have (on average 1.0227272727272727) internal successors, (180), 176 states have internal predecessors, (180), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:58:02,416 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:58:02,417 INFO L93 Difference]: Finished difference Result 307 states and 311 transitions. [2022-04-28 03:58:02,417 INFO L276 IsEmpty]: Start isEmpty. Operand 307 states and 311 transitions. [2022-04-28 03:58:02,417 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:58:02,417 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:58:02,417 INFO L74 IsIncluded]: Start isIncluded. First operand has 181 states, 176 states have (on average 1.0227272727272727) internal successors, (180), 176 states have internal predecessors, (180), 3 states have call successors, (3), 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 307 states. [2022-04-28 03:58:02,417 INFO L87 Difference]: Start difference. First operand has 181 states, 176 states have (on average 1.0227272727272727) internal successors, (180), 176 states have internal predecessors, (180), 3 states have call successors, (3), 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 307 states. [2022-04-28 03:58:02,420 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:58:02,420 INFO L93 Difference]: Finished difference Result 307 states and 311 transitions. [2022-04-28 03:58:02,420 INFO L276 IsEmpty]: Start isEmpty. Operand 307 states and 311 transitions. [2022-04-28 03:58:02,420 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:58:02,420 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:58:02,420 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 03:58:02,420 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 03:58:02,421 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 181 states, 176 states have (on average 1.0227272727272727) internal successors, (180), 176 states have internal predecessors, (180), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:58:02,422 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 181 states to 181 states and 184 transitions. [2022-04-28 03:58:02,422 INFO L78 Accepts]: Start accepts. Automaton has 181 states and 184 transitions. Word has length 175 [2022-04-28 03:58:02,422 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 03:58:02,422 INFO L495 AbstractCegarLoop]: Abstraction has 181 states and 184 transitions. [2022-04-28 03:58:02,422 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 104 states, 104 states have (on average 1.6442307692307692) internal successors, (171), 103 states have internal predecessors, (171), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:58:02,423 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 181 states and 184 transitions. [2022-04-28 03:58:02,565 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 184 edges. 184 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 03:58:02,565 INFO L276 IsEmpty]: Start isEmpty. Operand 181 states and 184 transitions. [2022-04-28 03:58:02,566 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 181 [2022-04-28 03:58:02,566 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 03:58:02,566 INFO L195 NwaCegarLoop]: trace histogram [66, 65, 36, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 03:58:02,582 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (36)] Forceful destruction successful, exit code 0 [2022-04-28 03:58:02,766 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 36 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable37 [2022-04-28 03:58:02,766 INFO L420 AbstractCegarLoop]: === Iteration 39 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 03:58:02,767 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 03:58:02,767 INFO L85 PathProgramCache]: Analyzing trace with hash 777000959, now seen corresponding path program 36 times [2022-04-28 03:58:02,767 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 03:58:02,767 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [453909804] [2022-04-28 03:58:06,830 WARN L977 rdanLoopAcceleration]: Unable to prove correctness of quantifier elimination. [2022-04-28 03:58:06,881 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 1 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 03:58:07,107 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={1=1, 2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 03:58:07,108 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-28 03:58:07,111 INFO L85 PathProgramCache]: Analyzing trace with hash 322078785, now seen corresponding path program 1 times [2022-04-28 03:58:07,112 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 03:58:07,112 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [260592293] [2022-04-28 03:58:07,112 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:58:07,112 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 03:58:07,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:58:07,756 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 03:58:07,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:58:07,763 INFO L290 TraceCheckUtils]: 0: Hoare triple {48077#(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); {48035#true} is VALID [2022-04-28 03:58:07,764 INFO L290 TraceCheckUtils]: 1: Hoare triple {48035#true} assume true; {48035#true} is VALID [2022-04-28 03:58:07,764 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {48035#true} {48035#true} #52#return; {48035#true} is VALID [2022-04-28 03:58:07,764 INFO L272 TraceCheckUtils]: 0: Hoare triple {48035#true} call ULTIMATE.init(); {48077#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 03:58:07,764 INFO L290 TraceCheckUtils]: 1: Hoare triple {48077#(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); {48035#true} is VALID [2022-04-28 03:58:07,764 INFO L290 TraceCheckUtils]: 2: Hoare triple {48035#true} assume true; {48035#true} is VALID [2022-04-28 03:58:07,764 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {48035#true} {48035#true} #52#return; {48035#true} is VALID [2022-04-28 03:58:07,764 INFO L272 TraceCheckUtils]: 4: Hoare triple {48035#true} call #t~ret7 := main(); {48035#true} is VALID [2022-04-28 03:58:07,765 INFO L290 TraceCheckUtils]: 5: Hoare triple {48035#true} ~x~0 := 0;~y~0 := 50000;~z~0 := 0;~x~0 := 0; {48040#(<= 50000 main_~y~0)} is VALID [2022-04-28 03:58:07,765 INFO L290 TraceCheckUtils]: 6: Hoare triple {48040#(<= 50000 main_~y~0)} [200] L11-2-->L18-1_primed: Formula: (let ((.cse0 (= |v_main_#t~post4_228| |v_main_#t~post4_227|))) (or (and (= v_main_~x~0_2420 v_main_~x~0_2419) .cse0) (and (= v_main_~x~0_2419 v_main_~x~0_2420) .cse0 (<= 50000 v_main_~x~0_2420)) (and (< v_main_~x~0_2420 v_main_~x~0_2419) (< v_main_~x~0_2419 50001)))) InVars {main_~x~0=v_main_~x~0_2420, main_#t~post4=|v_main_#t~post4_228|} OutVars{main_~x~0=v_main_~x~0_2419, main_#t~post4=|v_main_#t~post4_227|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {48040#(<= 50000 main_~y~0)} is VALID [2022-04-28 03:58:07,765 INFO L290 TraceCheckUtils]: 7: Hoare triple {48040#(<= 50000 main_~y~0)} [201] L18-1_primed-->L11-2: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {48040#(<= 50000 main_~y~0)} is VALID [2022-04-28 03:58:07,766 INFO L290 TraceCheckUtils]: 8: Hoare triple {48040#(<= 50000 main_~y~0)} [202] L11-2-->L18-1_primed: Formula: (let ((.cse2 (= v_main_~y~0_2748 v_main_~y~0_2747)) (.cse3 (= v_main_~x~0_2422 v_main_~x~0_2421)) (.cse4 (= |v_main_#t~post6_249| |v_main_#t~post6_248|)) (.cse1 (<= 50000 v_main_~x~0_2422)) (.cse5 (= |v_main_#t~post5_249| |v_main_#t~post5_248|))) (or (let ((.cse0 (+ v_main_~x~0_2422 v_main_~y~0_2747))) (and (< .cse0 (+ 1000001 v_main_~y~0_2748)) (< v_main_~y~0_2748 v_main_~y~0_2747) (= .cse0 (+ v_main_~x~0_2421 v_main_~y~0_2748)) .cse1)) (and .cse2 .cse3 .cse4 .cse5) (and .cse2 .cse3 .cse4 (or (not .cse1) (not (< v_main_~x~0_2422 1000000))) .cse5))) InVars {main_~y~0=v_main_~y~0_2748, main_#t~post5=|v_main_#t~post5_249|, main_~x~0=v_main_~x~0_2422, main_#t~post6=|v_main_#t~post6_249|} OutVars{main_~y~0=v_main_~y~0_2747, main_#t~post5=|v_main_#t~post5_248|, main_~x~0=v_main_~x~0_2421, main_#t~post6=|v_main_#t~post6_248|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {48040#(<= 50000 main_~y~0)} is VALID [2022-04-28 03:58:07,766 INFO L290 TraceCheckUtils]: 9: Hoare triple {48040#(<= 50000 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[] {48040#(<= 50000 main_~y~0)} is VALID [2022-04-28 03:58:07,767 INFO L290 TraceCheckUtils]: 10: Hoare triple {48040#(<= 50000 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {48041#(<= 49998 main_~y~0)} is VALID [2022-04-28 03:58:07,767 INFO L290 TraceCheckUtils]: 11: Hoare triple {48041#(<= 49998 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {48042#(<= 49996 main_~y~0)} is VALID [2022-04-28 03:58:07,768 INFO L290 TraceCheckUtils]: 12: Hoare triple {48042#(<= 49996 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {48043#(<= 49994 main_~y~0)} is VALID [2022-04-28 03:58:07,768 INFO L290 TraceCheckUtils]: 13: Hoare triple {48043#(<= 49994 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {48044#(<= 49992 main_~y~0)} is VALID [2022-04-28 03:58:07,768 INFO L290 TraceCheckUtils]: 14: Hoare triple {48044#(<= 49992 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {48045#(<= 49990 main_~y~0)} is VALID [2022-04-28 03:58:07,769 INFO L290 TraceCheckUtils]: 15: Hoare triple {48045#(<= 49990 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {48046#(<= 49988 main_~y~0)} is VALID [2022-04-28 03:58:07,769 INFO L290 TraceCheckUtils]: 16: Hoare triple {48046#(<= 49988 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {48047#(<= 49986 main_~y~0)} is VALID [2022-04-28 03:58:07,770 INFO L290 TraceCheckUtils]: 17: Hoare triple {48047#(<= 49986 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {48048#(<= 49984 main_~y~0)} is VALID [2022-04-28 03:58:07,770 INFO L290 TraceCheckUtils]: 18: Hoare triple {48048#(<= 49984 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {48049#(<= 49982 main_~y~0)} is VALID [2022-04-28 03:58:07,770 INFO L290 TraceCheckUtils]: 19: Hoare triple {48049#(<= 49982 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {48050#(<= 49980 main_~y~0)} is VALID [2022-04-28 03:58:07,771 INFO L290 TraceCheckUtils]: 20: Hoare triple {48050#(<= 49980 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {48051#(<= 49978 main_~y~0)} is VALID [2022-04-28 03:58:07,771 INFO L290 TraceCheckUtils]: 21: Hoare triple {48051#(<= 49978 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {48052#(<= 49976 main_~y~0)} is VALID [2022-04-28 03:58:07,772 INFO L290 TraceCheckUtils]: 22: Hoare triple {48052#(<= 49976 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {48053#(<= 49974 main_~y~0)} is VALID [2022-04-28 03:58:07,772 INFO L290 TraceCheckUtils]: 23: Hoare triple {48053#(<= 49974 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {48054#(<= 49972 main_~y~0)} is VALID [2022-04-28 03:58:07,773 INFO L290 TraceCheckUtils]: 24: Hoare triple {48054#(<= 49972 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {48055#(<= 49970 main_~y~0)} is VALID [2022-04-28 03:58:07,773 INFO L290 TraceCheckUtils]: 25: Hoare triple {48055#(<= 49970 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {48056#(<= 49968 main_~y~0)} is VALID [2022-04-28 03:58:07,773 INFO L290 TraceCheckUtils]: 26: Hoare triple {48056#(<= 49968 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {48057#(<= 49966 main_~y~0)} is VALID [2022-04-28 03:58:07,774 INFO L290 TraceCheckUtils]: 27: Hoare triple {48057#(<= 49966 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {48058#(<= 49964 main_~y~0)} is VALID [2022-04-28 03:58:07,774 INFO L290 TraceCheckUtils]: 28: Hoare triple {48058#(<= 49964 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {48059#(<= 49962 main_~y~0)} is VALID [2022-04-28 03:58:07,775 INFO L290 TraceCheckUtils]: 29: Hoare triple {48059#(<= 49962 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {48060#(<= 49960 main_~y~0)} is VALID [2022-04-28 03:58:07,775 INFO L290 TraceCheckUtils]: 30: Hoare triple {48060#(<= 49960 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {48061#(<= 49958 main_~y~0)} is VALID [2022-04-28 03:58:07,776 INFO L290 TraceCheckUtils]: 31: Hoare triple {48061#(<= 49958 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {48062#(<= 49956 main_~y~0)} is VALID [2022-04-28 03:58:07,776 INFO L290 TraceCheckUtils]: 32: Hoare triple {48062#(<= 49956 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {48063#(<= 49954 main_~y~0)} is VALID [2022-04-28 03:58:07,776 INFO L290 TraceCheckUtils]: 33: Hoare triple {48063#(<= 49954 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {48064#(<= 49952 main_~y~0)} is VALID [2022-04-28 03:58:07,777 INFO L290 TraceCheckUtils]: 34: Hoare triple {48064#(<= 49952 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {48065#(<= 49950 main_~y~0)} is VALID [2022-04-28 03:58:07,777 INFO L290 TraceCheckUtils]: 35: Hoare triple {48065#(<= 49950 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {48066#(<= 49948 main_~y~0)} is VALID [2022-04-28 03:58:07,778 INFO L290 TraceCheckUtils]: 36: Hoare triple {48066#(<= 49948 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {48067#(<= 49946 main_~y~0)} is VALID [2022-04-28 03:58:07,778 INFO L290 TraceCheckUtils]: 37: Hoare triple {48067#(<= 49946 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {48068#(<= 49944 main_~y~0)} is VALID [2022-04-28 03:58:07,779 INFO L290 TraceCheckUtils]: 38: Hoare triple {48068#(<= 49944 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {48069#(<= 49942 main_~y~0)} is VALID [2022-04-28 03:58:07,779 INFO L290 TraceCheckUtils]: 39: Hoare triple {48069#(<= 49942 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {48070#(<= 49940 main_~y~0)} is VALID [2022-04-28 03:58:07,779 INFO L290 TraceCheckUtils]: 40: Hoare triple {48070#(<= 49940 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {48071#(<= 49938 main_~y~0)} is VALID [2022-04-28 03:58:07,780 INFO L290 TraceCheckUtils]: 41: Hoare triple {48071#(<= 49938 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {48072#(<= 49936 main_~y~0)} is VALID [2022-04-28 03:58:07,780 INFO L290 TraceCheckUtils]: 42: Hoare triple {48072#(<= 49936 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {48073#(<= 49934 main_~y~0)} is VALID [2022-04-28 03:58:07,781 INFO L290 TraceCheckUtils]: 43: Hoare triple {48073#(<= 49934 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {48074#(<= 49932 main_~y~0)} is VALID [2022-04-28 03:58:07,781 INFO L290 TraceCheckUtils]: 44: Hoare triple {48074#(<= 49932 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {48075#(<= 49930 main_~y~0)} is VALID [2022-04-28 03:58:07,782 INFO L290 TraceCheckUtils]: 45: Hoare triple {48075#(<= 49930 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {48076#(<= 49928 main_~y~0)} is VALID [2022-04-28 03:58:07,782 INFO L290 TraceCheckUtils]: 46: Hoare triple {48076#(<= 49928 main_~y~0)} assume !(~y~0 > 0); {48036#false} is VALID [2022-04-28 03:58:07,782 INFO L272 TraceCheckUtils]: 47: Hoare triple {48036#false} call __VERIFIER_assert((if ~z~0 == ~x~0 then 1 else 0)); {48036#false} is VALID [2022-04-28 03:58:07,782 INFO L290 TraceCheckUtils]: 48: Hoare triple {48036#false} ~cond := #in~cond; {48036#false} is VALID [2022-04-28 03:58:07,782 INFO L290 TraceCheckUtils]: 49: Hoare triple {48036#false} assume 0 == ~cond; {48036#false} is VALID [2022-04-28 03:58:07,782 INFO L290 TraceCheckUtils]: 50: Hoare triple {48036#false} assume !false; {48036#false} is VALID [2022-04-28 03:58:07,782 INFO L134 CoverageAnalysis]: Checked inductivity of 668 backedges. 0 proven. 666 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-04-28 03:58:07,782 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 03:58:07,783 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [260592293] [2022-04-28 03:58:07,783 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [260592293] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 03:58:07,783 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2034159376] [2022-04-28 03:58:07,783 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:58:07,783 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 03:58:07,783 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 03:58:07,784 INFO L229 MonitoredProcess]: Starting monitored process 37 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 03:58:07,784 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (37)] Waiting until timeout for monitored process [2022-04-28 03:58:07,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:58:07,838 INFO L263 TraceCheckSpWp]: Trace formula consists of 239 conjuncts, 39 conjunts are in the unsatisfiable core [2022-04-28 03:58:07,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:58:07,859 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 03:58:08,372 INFO L272 TraceCheckUtils]: 0: Hoare triple {48035#true} call ULTIMATE.init(); {48035#true} is VALID [2022-04-28 03:58:08,372 INFO L290 TraceCheckUtils]: 1: Hoare triple {48035#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); {48035#true} is VALID [2022-04-28 03:58:08,372 INFO L290 TraceCheckUtils]: 2: Hoare triple {48035#true} assume true; {48035#true} is VALID [2022-04-28 03:58:08,373 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {48035#true} {48035#true} #52#return; {48035#true} is VALID [2022-04-28 03:58:08,373 INFO L272 TraceCheckUtils]: 4: Hoare triple {48035#true} call #t~ret7 := main(); {48035#true} is VALID [2022-04-28 03:58:08,373 INFO L290 TraceCheckUtils]: 5: Hoare triple {48035#true} ~x~0 := 0;~y~0 := 50000;~z~0 := 0;~x~0 := 0; {48040#(<= 50000 main_~y~0)} is VALID [2022-04-28 03:58:08,373 INFO L290 TraceCheckUtils]: 6: Hoare triple {48040#(<= 50000 main_~y~0)} [200] L11-2-->L18-1_primed: Formula: (let ((.cse0 (= |v_main_#t~post4_228| |v_main_#t~post4_227|))) (or (and (= v_main_~x~0_2420 v_main_~x~0_2419) .cse0) (and (= v_main_~x~0_2419 v_main_~x~0_2420) .cse0 (<= 50000 v_main_~x~0_2420)) (and (< v_main_~x~0_2420 v_main_~x~0_2419) (< v_main_~x~0_2419 50001)))) InVars {main_~x~0=v_main_~x~0_2420, main_#t~post4=|v_main_#t~post4_228|} OutVars{main_~x~0=v_main_~x~0_2419, main_#t~post4=|v_main_#t~post4_227|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {48040#(<= 50000 main_~y~0)} is VALID [2022-04-28 03:58:08,374 INFO L290 TraceCheckUtils]: 7: Hoare triple {48040#(<= 50000 main_~y~0)} [201] L18-1_primed-->L11-2: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {48040#(<= 50000 main_~y~0)} is VALID [2022-04-28 03:58:08,374 INFO L290 TraceCheckUtils]: 8: Hoare triple {48040#(<= 50000 main_~y~0)} [202] L11-2-->L18-1_primed: Formula: (let ((.cse2 (= v_main_~y~0_2748 v_main_~y~0_2747)) (.cse3 (= v_main_~x~0_2422 v_main_~x~0_2421)) (.cse4 (= |v_main_#t~post6_249| |v_main_#t~post6_248|)) (.cse1 (<= 50000 v_main_~x~0_2422)) (.cse5 (= |v_main_#t~post5_249| |v_main_#t~post5_248|))) (or (let ((.cse0 (+ v_main_~x~0_2422 v_main_~y~0_2747))) (and (< .cse0 (+ 1000001 v_main_~y~0_2748)) (< v_main_~y~0_2748 v_main_~y~0_2747) (= .cse0 (+ v_main_~x~0_2421 v_main_~y~0_2748)) .cse1)) (and .cse2 .cse3 .cse4 .cse5) (and .cse2 .cse3 .cse4 (or (not .cse1) (not (< v_main_~x~0_2422 1000000))) .cse5))) InVars {main_~y~0=v_main_~y~0_2748, main_#t~post5=|v_main_#t~post5_249|, main_~x~0=v_main_~x~0_2422, main_#t~post6=|v_main_#t~post6_249|} OutVars{main_~y~0=v_main_~y~0_2747, main_#t~post5=|v_main_#t~post5_248|, main_~x~0=v_main_~x~0_2421, main_#t~post6=|v_main_#t~post6_248|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {48040#(<= 50000 main_~y~0)} is VALID [2022-04-28 03:58:08,375 INFO L290 TraceCheckUtils]: 9: Hoare triple {48040#(<= 50000 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[] {48040#(<= 50000 main_~y~0)} is VALID [2022-04-28 03:58:08,375 INFO L290 TraceCheckUtils]: 10: Hoare triple {48040#(<= 50000 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {48041#(<= 49998 main_~y~0)} is VALID [2022-04-28 03:58:08,375 INFO L290 TraceCheckUtils]: 11: Hoare triple {48041#(<= 49998 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {48042#(<= 49996 main_~y~0)} is VALID [2022-04-28 03:58:08,376 INFO L290 TraceCheckUtils]: 12: Hoare triple {48042#(<= 49996 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {48043#(<= 49994 main_~y~0)} is VALID [2022-04-28 03:58:08,376 INFO L290 TraceCheckUtils]: 13: Hoare triple {48043#(<= 49994 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {48044#(<= 49992 main_~y~0)} is VALID [2022-04-28 03:58:08,377 INFO L290 TraceCheckUtils]: 14: Hoare triple {48044#(<= 49992 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {48045#(<= 49990 main_~y~0)} is VALID [2022-04-28 03:58:08,377 INFO L290 TraceCheckUtils]: 15: Hoare triple {48045#(<= 49990 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {48046#(<= 49988 main_~y~0)} is VALID [2022-04-28 03:58:08,378 INFO L290 TraceCheckUtils]: 16: Hoare triple {48046#(<= 49988 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {48047#(<= 49986 main_~y~0)} is VALID [2022-04-28 03:58:08,378 INFO L290 TraceCheckUtils]: 17: Hoare triple {48047#(<= 49986 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {48048#(<= 49984 main_~y~0)} is VALID [2022-04-28 03:58:08,378 INFO L290 TraceCheckUtils]: 18: Hoare triple {48048#(<= 49984 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {48049#(<= 49982 main_~y~0)} is VALID [2022-04-28 03:58:08,379 INFO L290 TraceCheckUtils]: 19: Hoare triple {48049#(<= 49982 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {48050#(<= 49980 main_~y~0)} is VALID [2022-04-28 03:58:08,379 INFO L290 TraceCheckUtils]: 20: Hoare triple {48050#(<= 49980 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {48051#(<= 49978 main_~y~0)} is VALID [2022-04-28 03:58:08,380 INFO L290 TraceCheckUtils]: 21: Hoare triple {48051#(<= 49978 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {48052#(<= 49976 main_~y~0)} is VALID [2022-04-28 03:58:08,380 INFO L290 TraceCheckUtils]: 22: Hoare triple {48052#(<= 49976 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {48053#(<= 49974 main_~y~0)} is VALID [2022-04-28 03:58:08,380 INFO L290 TraceCheckUtils]: 23: Hoare triple {48053#(<= 49974 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {48054#(<= 49972 main_~y~0)} is VALID [2022-04-28 03:58:08,381 INFO L290 TraceCheckUtils]: 24: Hoare triple {48054#(<= 49972 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {48055#(<= 49970 main_~y~0)} is VALID [2022-04-28 03:58:08,381 INFO L290 TraceCheckUtils]: 25: Hoare triple {48055#(<= 49970 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {48056#(<= 49968 main_~y~0)} is VALID [2022-04-28 03:58:08,382 INFO L290 TraceCheckUtils]: 26: Hoare triple {48056#(<= 49968 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {48057#(<= 49966 main_~y~0)} is VALID [2022-04-28 03:58:08,382 INFO L290 TraceCheckUtils]: 27: Hoare triple {48057#(<= 49966 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {48058#(<= 49964 main_~y~0)} is VALID [2022-04-28 03:58:08,383 INFO L290 TraceCheckUtils]: 28: Hoare triple {48058#(<= 49964 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {48059#(<= 49962 main_~y~0)} is VALID [2022-04-28 03:58:08,383 INFO L290 TraceCheckUtils]: 29: Hoare triple {48059#(<= 49962 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {48060#(<= 49960 main_~y~0)} is VALID [2022-04-28 03:58:08,383 INFO L290 TraceCheckUtils]: 30: Hoare triple {48060#(<= 49960 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {48061#(<= 49958 main_~y~0)} is VALID [2022-04-28 03:58:08,384 INFO L290 TraceCheckUtils]: 31: Hoare triple {48061#(<= 49958 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {48062#(<= 49956 main_~y~0)} is VALID [2022-04-28 03:58:08,384 INFO L290 TraceCheckUtils]: 32: Hoare triple {48062#(<= 49956 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {48063#(<= 49954 main_~y~0)} is VALID [2022-04-28 03:58:08,385 INFO L290 TraceCheckUtils]: 33: Hoare triple {48063#(<= 49954 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {48064#(<= 49952 main_~y~0)} is VALID [2022-04-28 03:58:08,385 INFO L290 TraceCheckUtils]: 34: Hoare triple {48064#(<= 49952 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {48065#(<= 49950 main_~y~0)} is VALID [2022-04-28 03:58:08,386 INFO L290 TraceCheckUtils]: 35: Hoare triple {48065#(<= 49950 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {48066#(<= 49948 main_~y~0)} is VALID [2022-04-28 03:58:08,386 INFO L290 TraceCheckUtils]: 36: Hoare triple {48066#(<= 49948 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {48067#(<= 49946 main_~y~0)} is VALID [2022-04-28 03:58:08,386 INFO L290 TraceCheckUtils]: 37: Hoare triple {48067#(<= 49946 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {48068#(<= 49944 main_~y~0)} is VALID [2022-04-28 03:58:08,387 INFO L290 TraceCheckUtils]: 38: Hoare triple {48068#(<= 49944 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {48069#(<= 49942 main_~y~0)} is VALID [2022-04-28 03:58:08,387 INFO L290 TraceCheckUtils]: 39: Hoare triple {48069#(<= 49942 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {48070#(<= 49940 main_~y~0)} is VALID [2022-04-28 03:58:08,388 INFO L290 TraceCheckUtils]: 40: Hoare triple {48070#(<= 49940 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {48071#(<= 49938 main_~y~0)} is VALID [2022-04-28 03:58:08,388 INFO L290 TraceCheckUtils]: 41: Hoare triple {48071#(<= 49938 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {48072#(<= 49936 main_~y~0)} is VALID [2022-04-28 03:58:08,389 INFO L290 TraceCheckUtils]: 42: Hoare triple {48072#(<= 49936 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {48073#(<= 49934 main_~y~0)} is VALID [2022-04-28 03:58:08,389 INFO L290 TraceCheckUtils]: 43: Hoare triple {48073#(<= 49934 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {48074#(<= 49932 main_~y~0)} is VALID [2022-04-28 03:58:08,389 INFO L290 TraceCheckUtils]: 44: Hoare triple {48074#(<= 49932 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {48075#(<= 49930 main_~y~0)} is VALID [2022-04-28 03:58:08,390 INFO L290 TraceCheckUtils]: 45: Hoare triple {48075#(<= 49930 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {48076#(<= 49928 main_~y~0)} is VALID [2022-04-28 03:58:08,390 INFO L290 TraceCheckUtils]: 46: Hoare triple {48076#(<= 49928 main_~y~0)} assume !(~y~0 > 0); {48036#false} is VALID [2022-04-28 03:58:08,390 INFO L272 TraceCheckUtils]: 47: Hoare triple {48036#false} call __VERIFIER_assert((if ~z~0 == ~x~0 then 1 else 0)); {48036#false} is VALID [2022-04-28 03:58:08,390 INFO L290 TraceCheckUtils]: 48: Hoare triple {48036#false} ~cond := #in~cond; {48036#false} is VALID [2022-04-28 03:58:08,390 INFO L290 TraceCheckUtils]: 49: Hoare triple {48036#false} assume 0 == ~cond; {48036#false} is VALID [2022-04-28 03:58:08,390 INFO L290 TraceCheckUtils]: 50: Hoare triple {48036#false} assume !false; {48036#false} is VALID [2022-04-28 03:58:08,391 INFO L134 CoverageAnalysis]: Checked inductivity of 668 backedges. 0 proven. 666 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-04-28 03:58:08,391 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 03:58:10,296 INFO L290 TraceCheckUtils]: 50: Hoare triple {48036#false} assume !false; {48036#false} is VALID [2022-04-28 03:58:10,296 INFO L290 TraceCheckUtils]: 49: Hoare triple {48036#false} assume 0 == ~cond; {48036#false} is VALID [2022-04-28 03:58:10,296 INFO L290 TraceCheckUtils]: 48: Hoare triple {48036#false} ~cond := #in~cond; {48036#false} is VALID [2022-04-28 03:58:10,296 INFO L272 TraceCheckUtils]: 47: Hoare triple {48036#false} call __VERIFIER_assert((if ~z~0 == ~x~0 then 1 else 0)); {48036#false} is VALID [2022-04-28 03:58:10,296 INFO L290 TraceCheckUtils]: 46: Hoare triple {48243#(< 0 main_~y~0)} assume !(~y~0 > 0); {48036#false} is VALID [2022-04-28 03:58:10,297 INFO L290 TraceCheckUtils]: 45: Hoare triple {48247#(< 2 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {48243#(< 0 main_~y~0)} is VALID [2022-04-28 03:58:10,297 INFO L290 TraceCheckUtils]: 44: Hoare triple {48251#(< 4 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {48247#(< 2 main_~y~0)} is VALID [2022-04-28 03:58:10,298 INFO L290 TraceCheckUtils]: 43: Hoare triple {48255#(< 6 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {48251#(< 4 main_~y~0)} is VALID [2022-04-28 03:58:10,298 INFO L290 TraceCheckUtils]: 42: Hoare triple {48259#(< 8 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {48255#(< 6 main_~y~0)} is VALID [2022-04-28 03:58:10,298 INFO L290 TraceCheckUtils]: 41: Hoare triple {48263#(< 10 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {48259#(< 8 main_~y~0)} is VALID [2022-04-28 03:58:10,299 INFO L290 TraceCheckUtils]: 40: Hoare triple {48267#(< 12 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {48263#(< 10 main_~y~0)} is VALID [2022-04-28 03:58:10,299 INFO L290 TraceCheckUtils]: 39: Hoare triple {48271#(< 14 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {48267#(< 12 main_~y~0)} is VALID [2022-04-28 03:58:10,300 INFO L290 TraceCheckUtils]: 38: Hoare triple {48275#(< 16 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {48271#(< 14 main_~y~0)} is VALID [2022-04-28 03:58:10,300 INFO L290 TraceCheckUtils]: 37: Hoare triple {48279#(< 18 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {48275#(< 16 main_~y~0)} is VALID [2022-04-28 03:58:10,300 INFO L290 TraceCheckUtils]: 36: Hoare triple {48283#(< 20 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {48279#(< 18 main_~y~0)} is VALID [2022-04-28 03:58:10,301 INFO L290 TraceCheckUtils]: 35: Hoare triple {48287#(< 22 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {48283#(< 20 main_~y~0)} is VALID [2022-04-28 03:58:10,301 INFO L290 TraceCheckUtils]: 34: Hoare triple {48291#(< 24 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {48287#(< 22 main_~y~0)} is VALID [2022-04-28 03:58:10,302 INFO L290 TraceCheckUtils]: 33: Hoare triple {48295#(< 26 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {48291#(< 24 main_~y~0)} is VALID [2022-04-28 03:58:10,302 INFO L290 TraceCheckUtils]: 32: Hoare triple {48299#(< 28 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {48295#(< 26 main_~y~0)} is VALID [2022-04-28 03:58:10,302 INFO L290 TraceCheckUtils]: 31: Hoare triple {48303#(< 30 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {48299#(< 28 main_~y~0)} is VALID [2022-04-28 03:58:10,303 INFO L290 TraceCheckUtils]: 30: Hoare triple {48307#(< 32 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {48303#(< 30 main_~y~0)} is VALID [2022-04-28 03:58:10,303 INFO L290 TraceCheckUtils]: 29: Hoare triple {48311#(< 34 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {48307#(< 32 main_~y~0)} is VALID [2022-04-28 03:58:10,304 INFO L290 TraceCheckUtils]: 28: Hoare triple {48315#(< 36 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {48311#(< 34 main_~y~0)} is VALID [2022-04-28 03:58:10,304 INFO L290 TraceCheckUtils]: 27: Hoare triple {48319#(< 38 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {48315#(< 36 main_~y~0)} is VALID [2022-04-28 03:58:10,305 INFO L290 TraceCheckUtils]: 26: Hoare triple {48323#(< 40 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {48319#(< 38 main_~y~0)} is VALID [2022-04-28 03:58:10,305 INFO L290 TraceCheckUtils]: 25: Hoare triple {48327#(< 42 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {48323#(< 40 main_~y~0)} is VALID [2022-04-28 03:58:10,305 INFO L290 TraceCheckUtils]: 24: Hoare triple {48331#(< 44 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {48327#(< 42 main_~y~0)} is VALID [2022-04-28 03:58:10,306 INFO L290 TraceCheckUtils]: 23: Hoare triple {48335#(< 46 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {48331#(< 44 main_~y~0)} is VALID [2022-04-28 03:58:10,306 INFO L290 TraceCheckUtils]: 22: Hoare triple {48339#(< 48 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {48335#(< 46 main_~y~0)} is VALID [2022-04-28 03:58:10,307 INFO L290 TraceCheckUtils]: 21: Hoare triple {48343#(< 50 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {48339#(< 48 main_~y~0)} is VALID [2022-04-28 03:58:10,307 INFO L290 TraceCheckUtils]: 20: Hoare triple {48347#(< 52 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {48343#(< 50 main_~y~0)} is VALID [2022-04-28 03:58:10,307 INFO L290 TraceCheckUtils]: 19: Hoare triple {48351#(< 54 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {48347#(< 52 main_~y~0)} is VALID [2022-04-28 03:58:10,308 INFO L290 TraceCheckUtils]: 18: Hoare triple {48355#(< 56 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {48351#(< 54 main_~y~0)} is VALID [2022-04-28 03:58:10,308 INFO L290 TraceCheckUtils]: 17: Hoare triple {48359#(< 58 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {48355#(< 56 main_~y~0)} is VALID [2022-04-28 03:58:10,309 INFO L290 TraceCheckUtils]: 16: Hoare triple {48363#(< 60 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {48359#(< 58 main_~y~0)} is VALID [2022-04-28 03:58:10,309 INFO L290 TraceCheckUtils]: 15: Hoare triple {48367#(< 62 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {48363#(< 60 main_~y~0)} is VALID [2022-04-28 03:58:10,309 INFO L290 TraceCheckUtils]: 14: Hoare triple {48371#(< 64 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {48367#(< 62 main_~y~0)} is VALID [2022-04-28 03:58:10,310 INFO L290 TraceCheckUtils]: 13: Hoare triple {48375#(< 66 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {48371#(< 64 main_~y~0)} is VALID [2022-04-28 03:58:10,310 INFO L290 TraceCheckUtils]: 12: Hoare triple {48379#(< 68 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {48375#(< 66 main_~y~0)} is VALID [2022-04-28 03:58:10,311 INFO L290 TraceCheckUtils]: 11: Hoare triple {48383#(< 70 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {48379#(< 68 main_~y~0)} is VALID [2022-04-28 03:58:10,311 INFO L290 TraceCheckUtils]: 10: Hoare triple {48387#(< 72 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {48383#(< 70 main_~y~0)} is VALID [2022-04-28 03:58:10,311 INFO L290 TraceCheckUtils]: 9: Hoare triple {48387#(< 72 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[] {48387#(< 72 main_~y~0)} is VALID [2022-04-28 03:58:10,312 INFO L290 TraceCheckUtils]: 8: Hoare triple {48387#(< 72 main_~y~0)} [202] L11-2-->L18-1_primed: Formula: (let ((.cse2 (= v_main_~y~0_2748 v_main_~y~0_2747)) (.cse3 (= v_main_~x~0_2422 v_main_~x~0_2421)) (.cse4 (= |v_main_#t~post6_249| |v_main_#t~post6_248|)) (.cse1 (<= 50000 v_main_~x~0_2422)) (.cse5 (= |v_main_#t~post5_249| |v_main_#t~post5_248|))) (or (let ((.cse0 (+ v_main_~x~0_2422 v_main_~y~0_2747))) (and (< .cse0 (+ 1000001 v_main_~y~0_2748)) (< v_main_~y~0_2748 v_main_~y~0_2747) (= .cse0 (+ v_main_~x~0_2421 v_main_~y~0_2748)) .cse1)) (and .cse2 .cse3 .cse4 .cse5) (and .cse2 .cse3 .cse4 (or (not .cse1) (not (< v_main_~x~0_2422 1000000))) .cse5))) InVars {main_~y~0=v_main_~y~0_2748, main_#t~post5=|v_main_#t~post5_249|, main_~x~0=v_main_~x~0_2422, main_#t~post6=|v_main_#t~post6_249|} OutVars{main_~y~0=v_main_~y~0_2747, main_#t~post5=|v_main_#t~post5_248|, main_~x~0=v_main_~x~0_2421, main_#t~post6=|v_main_#t~post6_248|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {48387#(< 72 main_~y~0)} is VALID [2022-04-28 03:58:10,312 INFO L290 TraceCheckUtils]: 7: Hoare triple {48387#(< 72 main_~y~0)} [201] L18-1_primed-->L11-2: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {48387#(< 72 main_~y~0)} is VALID [2022-04-28 03:58:10,313 INFO L290 TraceCheckUtils]: 6: Hoare triple {48387#(< 72 main_~y~0)} [200] L11-2-->L18-1_primed: Formula: (let ((.cse0 (= |v_main_#t~post4_228| |v_main_#t~post4_227|))) (or (and (= v_main_~x~0_2420 v_main_~x~0_2419) .cse0) (and (= v_main_~x~0_2419 v_main_~x~0_2420) .cse0 (<= 50000 v_main_~x~0_2420)) (and (< v_main_~x~0_2420 v_main_~x~0_2419) (< v_main_~x~0_2419 50001)))) InVars {main_~x~0=v_main_~x~0_2420, main_#t~post4=|v_main_#t~post4_228|} OutVars{main_~x~0=v_main_~x~0_2419, main_#t~post4=|v_main_#t~post4_227|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {48387#(< 72 main_~y~0)} is VALID [2022-04-28 03:58:10,313 INFO L290 TraceCheckUtils]: 5: Hoare triple {48035#true} ~x~0 := 0;~y~0 := 50000;~z~0 := 0;~x~0 := 0; {48387#(< 72 main_~y~0)} is VALID [2022-04-28 03:58:10,313 INFO L272 TraceCheckUtils]: 4: Hoare triple {48035#true} call #t~ret7 := main(); {48035#true} is VALID [2022-04-28 03:58:10,313 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {48035#true} {48035#true} #52#return; {48035#true} is VALID [2022-04-28 03:58:10,313 INFO L290 TraceCheckUtils]: 2: Hoare triple {48035#true} assume true; {48035#true} is VALID [2022-04-28 03:58:10,313 INFO L290 TraceCheckUtils]: 1: Hoare triple {48035#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); {48035#true} is VALID [2022-04-28 03:58:10,313 INFO L272 TraceCheckUtils]: 0: Hoare triple {48035#true} call ULTIMATE.init(); {48035#true} is VALID [2022-04-28 03:58:10,313 INFO L134 CoverageAnalysis]: Checked inductivity of 668 backedges. 0 proven. 666 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-04-28 03:58:10,314 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2034159376] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 03:58:10,314 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 03:58:10,314 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [40, 39, 39] total 77 [2022-04-28 03:58:13,347 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 03:58:13,347 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [453909804] [2022-04-28 03:58:13,347 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [453909804] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 03:58:13,347 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 03:58:13,347 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [107] imperfect sequences [] total 107 [2022-04-28 03:58:13,347 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2003791622] [2022-04-28 03:58:13,347 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 03:58:13,348 INFO L78 Accepts]: Start accepts. Automaton has has 107 states, 107 states have (on average 1.644859813084112) internal successors, (176), 106 states have internal predecessors, (176), 2 states have call successors, (3), 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 180 [2022-04-28 03:58:13,348 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 03:58:13,348 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 107 states, 107 states have (on average 1.644859813084112) internal successors, (176), 106 states have internal predecessors, (176), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:58:13,473 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 180 edges. 180 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 03:58:13,473 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 107 states [2022-04-28 03:58:13,473 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 03:58:13,474 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 107 interpolants. [2022-04-28 03:58:13,476 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8010, Invalid=12582, Unknown=0, NotChecked=0, Total=20592 [2022-04-28 03:58:13,476 INFO L87 Difference]: Start difference. First operand 181 states and 184 transitions. Second operand has 107 states, 107 states have (on average 1.644859813084112) internal successors, (176), 106 states have internal predecessors, (176), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:58:31,122 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:58:31,122 INFO L93 Difference]: Finished difference Result 359 states and 370 transitions. [2022-04-28 03:58:31,122 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 107 states. [2022-04-28 03:58:31,122 INFO L78 Accepts]: Start accepts. Automaton has has 107 states, 107 states have (on average 1.644859813084112) internal successors, (176), 106 states have internal predecessors, (176), 2 states have call successors, (3), 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 180 [2022-04-28 03:58:31,122 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 03:58:31,122 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 107 states, 107 states have (on average 1.644859813084112) internal successors, (176), 106 states have internal predecessors, (176), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:58:31,124 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 202 transitions. [2022-04-28 03:58:31,124 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 107 states, 107 states have (on average 1.644859813084112) internal successors, (176), 106 states have internal predecessors, (176), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:58:31,126 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 202 transitions. [2022-04-28 03:58:31,126 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 107 states and 202 transitions. [2022-04-28 03:58:31,283 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 202 edges. 202 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 03:58:31,285 INFO L225 Difference]: With dead ends: 359 [2022-04-28 03:58:31,285 INFO L226 Difference]: Without dead ends: 186 [2022-04-28 03:58:31,289 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 384 GetRequests, 137 SyntacticMatches, 1 SemanticMatches, 246 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17798 ImplicationChecksByTransitivity, 8.3s TimeCoverageRelationStatistics Valid=18696, Invalid=42560, Unknown=0, NotChecked=0, Total=61256 [2022-04-28 03:58:31,289 INFO L413 NwaCegarLoop]: 12 mSDtfsCounter, 351 mSDsluCounter, 42 mSDsCounter, 0 mSdLazyCounter, 9035 mSolverCounterSat, 460 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 7.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 351 SdHoareTripleChecker+Valid, 54 SdHoareTripleChecker+Invalid, 9495 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 460 IncrementalHoareTripleChecker+Valid, 9035 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 7.2s IncrementalHoareTripleChecker+Time [2022-04-28 03:58:31,289 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [351 Valid, 54 Invalid, 9495 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [460 Valid, 9035 Invalid, 0 Unknown, 0 Unchecked, 7.2s Time] [2022-04-28 03:58:31,289 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 186 states. [2022-04-28 03:58:31,554 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 186 to 186. [2022-04-28 03:58:31,554 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 03:58:31,555 INFO L82 GeneralOperation]: Start isEquivalent. First operand 186 states. Second operand has 186 states, 181 states have (on average 1.022099447513812) internal successors, (185), 181 states have internal predecessors, (185), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:58:31,555 INFO L74 IsIncluded]: Start isIncluded. First operand 186 states. Second operand has 186 states, 181 states have (on average 1.022099447513812) internal successors, (185), 181 states have internal predecessors, (185), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:58:31,555 INFO L87 Difference]: Start difference. First operand 186 states. Second operand has 186 states, 181 states have (on average 1.022099447513812) internal successors, (185), 181 states have internal predecessors, (185), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:58:31,557 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:58:31,557 INFO L93 Difference]: Finished difference Result 186 states and 189 transitions. [2022-04-28 03:58:31,557 INFO L276 IsEmpty]: Start isEmpty. Operand 186 states and 189 transitions. [2022-04-28 03:58:31,557 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:58:31,557 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:58:31,557 INFO L74 IsIncluded]: Start isIncluded. First operand has 186 states, 181 states have (on average 1.022099447513812) internal successors, (185), 181 states have internal predecessors, (185), 3 states have call successors, (3), 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 186 states. [2022-04-28 03:58:31,557 INFO L87 Difference]: Start difference. First operand has 186 states, 181 states have (on average 1.022099447513812) internal successors, (185), 181 states have internal predecessors, (185), 3 states have call successors, (3), 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 186 states. [2022-04-28 03:58:31,558 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:58:31,559 INFO L93 Difference]: Finished difference Result 186 states and 189 transitions. [2022-04-28 03:58:31,559 INFO L276 IsEmpty]: Start isEmpty. Operand 186 states and 189 transitions. [2022-04-28 03:58:31,559 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:58:31,559 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:58:31,559 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 03:58:31,559 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 03:58:31,559 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 186 states, 181 states have (on average 1.022099447513812) internal successors, (185), 181 states have internal predecessors, (185), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:58:31,561 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 186 states to 186 states and 189 transitions. [2022-04-28 03:58:31,561 INFO L78 Accepts]: Start accepts. Automaton has 186 states and 189 transitions. Word has length 180 [2022-04-28 03:58:31,561 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 03:58:31,561 INFO L495 AbstractCegarLoop]: Abstraction has 186 states and 189 transitions. [2022-04-28 03:58:31,561 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 107 states, 107 states have (on average 1.644859813084112) internal successors, (176), 106 states have internal predecessors, (176), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:58:31,561 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 186 states and 189 transitions. [2022-04-28 03:58:31,714 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 189 edges. 189 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 03:58:31,714 INFO L276 IsEmpty]: Start isEmpty. Operand 186 states and 189 transitions. [2022-04-28 03:58:31,715 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 186 [2022-04-28 03:58:31,715 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 03:58:31,715 INFO L195 NwaCegarLoop]: trace histogram [68, 67, 37, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 03:58:31,733 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (37)] Forceful destruction successful, exit code 0 [2022-04-28 03:58:31,915 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 37 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable38 [2022-04-28 03:58:31,915 INFO L420 AbstractCegarLoop]: === Iteration 40 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 03:58:31,915 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 03:58:31,916 INFO L85 PathProgramCache]: Analyzing trace with hash 870694842, now seen corresponding path program 37 times [2022-04-28 03:58:31,916 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 03:58:31,916 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [789109398] [2022-04-28 03:58:32,017 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 1 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 03:58:32,248 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={1=1, 2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 03:58:32,249 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-28 03:58:32,251 INFO L85 PathProgramCache]: Analyzing trace with hash 1180001346, now seen corresponding path program 1 times [2022-04-28 03:58:32,251 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 03:58:32,251 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [284645113] [2022-04-28 03:58:32,251 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:58:32,251 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 03:58:32,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:58:32,876 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 03:58:32,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:58:32,888 INFO L290 TraceCheckUtils]: 0: Hoare triple {50200#(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); {50157#true} is VALID [2022-04-28 03:58:32,888 INFO L290 TraceCheckUtils]: 1: Hoare triple {50157#true} assume true; {50157#true} is VALID [2022-04-28 03:58:32,888 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {50157#true} {50157#true} #52#return; {50157#true} is VALID [2022-04-28 03:58:32,889 INFO L272 TraceCheckUtils]: 0: Hoare triple {50157#true} call ULTIMATE.init(); {50200#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 03:58:32,889 INFO L290 TraceCheckUtils]: 1: Hoare triple {50200#(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); {50157#true} is VALID [2022-04-28 03:58:32,889 INFO L290 TraceCheckUtils]: 2: Hoare triple {50157#true} assume true; {50157#true} is VALID [2022-04-28 03:58:32,889 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {50157#true} {50157#true} #52#return; {50157#true} is VALID [2022-04-28 03:58:32,889 INFO L272 TraceCheckUtils]: 4: Hoare triple {50157#true} call #t~ret7 := main(); {50157#true} is VALID [2022-04-28 03:58:32,889 INFO L290 TraceCheckUtils]: 5: Hoare triple {50157#true} ~x~0 := 0;~y~0 := 50000;~z~0 := 0;~x~0 := 0; {50162#(<= 50000 main_~y~0)} is VALID [2022-04-28 03:58:32,890 INFO L290 TraceCheckUtils]: 6: Hoare triple {50162#(<= 50000 main_~y~0)} [204] L11-2-->L18-1_primed: Formula: (let ((.cse0 (= v_main_~x~0_2538 v_main_~x~0_2537)) (.cse1 (= |v_main_#t~post4_234| |v_main_#t~post4_233|))) (or (and .cse0 .cse1) (and (< v_main_~x~0_2537 50001) (< v_main_~x~0_2538 v_main_~x~0_2537)) (and (<= 50000 v_main_~x~0_2538) .cse0 .cse1))) InVars {main_~x~0=v_main_~x~0_2538, main_#t~post4=|v_main_#t~post4_234|} OutVars{main_~x~0=v_main_~x~0_2537, main_#t~post4=|v_main_#t~post4_233|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {50162#(<= 50000 main_~y~0)} is VALID [2022-04-28 03:58:32,890 INFO L290 TraceCheckUtils]: 7: Hoare triple {50162#(<= 50000 main_~y~0)} [205] L18-1_primed-->L11-2: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {50162#(<= 50000 main_~y~0)} is VALID [2022-04-28 03:58:32,892 INFO L290 TraceCheckUtils]: 8: Hoare triple {50162#(<= 50000 main_~y~0)} [206] L11-2-->L18-1_primed: Formula: (let ((.cse0 (= |v_main_#t~post6_256| |v_main_#t~post6_255|)) (.cse1 (= v_main_~y~0_2894 v_main_~y~0_2893)) (.cse2 (= |v_main_#t~post5_256| |v_main_#t~post5_255|)) (.cse5 (<= 50000 v_main_~x~0_2540)) (.cse3 (= v_main_~x~0_2540 v_main_~x~0_2539))) (or (and .cse0 .cse1 .cse2 .cse3) (let ((.cse4 (+ v_main_~x~0_2540 v_main_~y~0_2893))) (and (< .cse4 (+ 1000001 v_main_~y~0_2894)) .cse5 (= (+ v_main_~x~0_2539 v_main_~y~0_2894) .cse4) (< v_main_~y~0_2894 v_main_~y~0_2893))) (and .cse0 .cse1 .cse2 (or (not (< v_main_~x~0_2540 1000000)) (not .cse5)) .cse3))) InVars {main_~y~0=v_main_~y~0_2894, main_#t~post5=|v_main_#t~post5_256|, main_~x~0=v_main_~x~0_2540, main_#t~post6=|v_main_#t~post6_256|} OutVars{main_~y~0=v_main_~y~0_2893, main_#t~post5=|v_main_#t~post5_255|, main_~x~0=v_main_~x~0_2539, main_#t~post6=|v_main_#t~post6_255|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {50162#(<= 50000 main_~y~0)} is VALID [2022-04-28 03:58:32,892 INFO L290 TraceCheckUtils]: 9: Hoare triple {50162#(<= 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[] {50162#(<= 50000 main_~y~0)} is VALID [2022-04-28 03:58:32,893 INFO L290 TraceCheckUtils]: 10: Hoare triple {50162#(<= 50000 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {50163#(<= 49998 main_~y~0)} is VALID [2022-04-28 03:58:32,894 INFO L290 TraceCheckUtils]: 11: Hoare triple {50163#(<= 49998 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {50164#(<= 49996 main_~y~0)} is VALID [2022-04-28 03:58:32,895 INFO L290 TraceCheckUtils]: 12: Hoare triple {50164#(<= 49996 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {50165#(<= 49994 main_~y~0)} is VALID [2022-04-28 03:58:32,895 INFO L290 TraceCheckUtils]: 13: Hoare triple {50165#(<= 49994 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {50166#(<= 49992 main_~y~0)} is VALID [2022-04-28 03:58:32,896 INFO L290 TraceCheckUtils]: 14: Hoare triple {50166#(<= 49992 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {50167#(<= 49990 main_~y~0)} is VALID [2022-04-28 03:58:32,897 INFO L290 TraceCheckUtils]: 15: Hoare triple {50167#(<= 49990 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {50168#(<= 49988 main_~y~0)} is VALID [2022-04-28 03:58:32,897 INFO L290 TraceCheckUtils]: 16: Hoare triple {50168#(<= 49988 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {50169#(<= 49986 main_~y~0)} is VALID [2022-04-28 03:58:32,898 INFO L290 TraceCheckUtils]: 17: Hoare triple {50169#(<= 49986 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {50170#(<= 49984 main_~y~0)} is VALID [2022-04-28 03:58:32,898 INFO L290 TraceCheckUtils]: 18: Hoare triple {50170#(<= 49984 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {50171#(<= 49982 main_~y~0)} is VALID [2022-04-28 03:58:32,899 INFO L290 TraceCheckUtils]: 19: Hoare triple {50171#(<= 49982 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {50172#(<= 49980 main_~y~0)} is VALID [2022-04-28 03:58:32,899 INFO L290 TraceCheckUtils]: 20: Hoare triple {50172#(<= 49980 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {50173#(<= 49978 main_~y~0)} is VALID [2022-04-28 03:58:32,900 INFO L290 TraceCheckUtils]: 21: Hoare triple {50173#(<= 49978 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {50174#(<= 49976 main_~y~0)} is VALID [2022-04-28 03:58:32,900 INFO L290 TraceCheckUtils]: 22: Hoare triple {50174#(<= 49976 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {50175#(<= 49974 main_~y~0)} is VALID [2022-04-28 03:58:32,900 INFO L290 TraceCheckUtils]: 23: Hoare triple {50175#(<= 49974 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {50176#(<= 49972 main_~y~0)} is VALID [2022-04-28 03:58:32,901 INFO L290 TraceCheckUtils]: 24: Hoare triple {50176#(<= 49972 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {50177#(<= 49970 main_~y~0)} is VALID [2022-04-28 03:58:32,901 INFO L290 TraceCheckUtils]: 25: Hoare triple {50177#(<= 49970 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {50178#(<= 49968 main_~y~0)} is VALID [2022-04-28 03:58:32,902 INFO L290 TraceCheckUtils]: 26: Hoare triple {50178#(<= 49968 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {50179#(<= 49966 main_~y~0)} is VALID [2022-04-28 03:58:32,902 INFO L290 TraceCheckUtils]: 27: Hoare triple {50179#(<= 49966 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {50180#(<= 49964 main_~y~0)} is VALID [2022-04-28 03:58:32,903 INFO L290 TraceCheckUtils]: 28: Hoare triple {50180#(<= 49964 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {50181#(<= 49962 main_~y~0)} is VALID [2022-04-28 03:58:32,903 INFO L290 TraceCheckUtils]: 29: Hoare triple {50181#(<= 49962 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {50182#(<= 49960 main_~y~0)} is VALID [2022-04-28 03:58:32,903 INFO L290 TraceCheckUtils]: 30: Hoare triple {50182#(<= 49960 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {50183#(<= 49958 main_~y~0)} is VALID [2022-04-28 03:58:32,904 INFO L290 TraceCheckUtils]: 31: Hoare triple {50183#(<= 49958 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {50184#(<= 49956 main_~y~0)} is VALID [2022-04-28 03:58:32,904 INFO L290 TraceCheckUtils]: 32: Hoare triple {50184#(<= 49956 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {50185#(<= 49954 main_~y~0)} is VALID [2022-04-28 03:58:32,905 INFO L290 TraceCheckUtils]: 33: Hoare triple {50185#(<= 49954 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {50186#(<= 49952 main_~y~0)} is VALID [2022-04-28 03:58:32,905 INFO L290 TraceCheckUtils]: 34: Hoare triple {50186#(<= 49952 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {50187#(<= 49950 main_~y~0)} is VALID [2022-04-28 03:58:32,906 INFO L290 TraceCheckUtils]: 35: Hoare triple {50187#(<= 49950 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {50188#(<= 49948 main_~y~0)} is VALID [2022-04-28 03:58:32,906 INFO L290 TraceCheckUtils]: 36: Hoare triple {50188#(<= 49948 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {50189#(<= 49946 main_~y~0)} is VALID [2022-04-28 03:58:32,906 INFO L290 TraceCheckUtils]: 37: Hoare triple {50189#(<= 49946 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {50190#(<= 49944 main_~y~0)} is VALID [2022-04-28 03:58:32,907 INFO L290 TraceCheckUtils]: 38: Hoare triple {50190#(<= 49944 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {50191#(<= 49942 main_~y~0)} is VALID [2022-04-28 03:58:32,907 INFO L290 TraceCheckUtils]: 39: Hoare triple {50191#(<= 49942 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {50192#(<= 49940 main_~y~0)} is VALID [2022-04-28 03:58:32,908 INFO L290 TraceCheckUtils]: 40: Hoare triple {50192#(<= 49940 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {50193#(<= 49938 main_~y~0)} is VALID [2022-04-28 03:58:32,908 INFO L290 TraceCheckUtils]: 41: Hoare triple {50193#(<= 49938 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {50194#(<= 49936 main_~y~0)} is VALID [2022-04-28 03:58:32,908 INFO L290 TraceCheckUtils]: 42: Hoare triple {50194#(<= 49936 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {50195#(<= 49934 main_~y~0)} is VALID [2022-04-28 03:58:32,909 INFO L290 TraceCheckUtils]: 43: Hoare triple {50195#(<= 49934 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {50196#(<= 49932 main_~y~0)} is VALID [2022-04-28 03:58:32,909 INFO L290 TraceCheckUtils]: 44: Hoare triple {50196#(<= 49932 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {50197#(<= 49930 main_~y~0)} is VALID [2022-04-28 03:58:32,910 INFO L290 TraceCheckUtils]: 45: Hoare triple {50197#(<= 49930 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {50198#(<= 49928 main_~y~0)} is VALID [2022-04-28 03:58:32,910 INFO L290 TraceCheckUtils]: 46: Hoare triple {50198#(<= 49928 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {50199#(<= 49926 main_~y~0)} is VALID [2022-04-28 03:58:32,910 INFO L290 TraceCheckUtils]: 47: Hoare triple {50199#(<= 49926 main_~y~0)} assume !(~y~0 > 0); {50158#false} is VALID [2022-04-28 03:58:32,911 INFO L272 TraceCheckUtils]: 48: Hoare triple {50158#false} call __VERIFIER_assert((if ~z~0 == ~x~0 then 1 else 0)); {50158#false} is VALID [2022-04-28 03:58:32,911 INFO L290 TraceCheckUtils]: 49: Hoare triple {50158#false} ~cond := #in~cond; {50158#false} is VALID [2022-04-28 03:58:32,911 INFO L290 TraceCheckUtils]: 50: Hoare triple {50158#false} assume 0 == ~cond; {50158#false} is VALID [2022-04-28 03:58:32,911 INFO L290 TraceCheckUtils]: 51: Hoare triple {50158#false} assume !false; {50158#false} is VALID [2022-04-28 03:58:32,911 INFO L134 CoverageAnalysis]: Checked inductivity of 705 backedges. 0 proven. 703 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-04-28 03:58:32,911 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 03:58:32,911 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [284645113] [2022-04-28 03:58:32,911 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [284645113] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 03:58:32,911 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1839183704] [2022-04-28 03:58:32,911 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:58:32,911 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 03:58:32,912 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 03:58:32,912 INFO L229 MonitoredProcess]: Starting monitored process 38 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 03:58:32,913 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (38)] Waiting until timeout for monitored process [2022-04-28 03:58:32,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:58:32,965 INFO L263 TraceCheckSpWp]: Trace formula consists of 244 conjuncts, 40 conjunts are in the unsatisfiable core [2022-04-28 03:58:32,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:58:32,985 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 03:58:33,476 INFO L272 TraceCheckUtils]: 0: Hoare triple {50157#true} call ULTIMATE.init(); {50157#true} is VALID [2022-04-28 03:58:33,476 INFO L290 TraceCheckUtils]: 1: Hoare triple {50157#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); {50157#true} is VALID [2022-04-28 03:58:33,476 INFO L290 TraceCheckUtils]: 2: Hoare triple {50157#true} assume true; {50157#true} is VALID [2022-04-28 03:58:33,476 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {50157#true} {50157#true} #52#return; {50157#true} is VALID [2022-04-28 03:58:33,476 INFO L272 TraceCheckUtils]: 4: Hoare triple {50157#true} call #t~ret7 := main(); {50157#true} is VALID [2022-04-28 03:58:33,476 INFO L290 TraceCheckUtils]: 5: Hoare triple {50157#true} ~x~0 := 0;~y~0 := 50000;~z~0 := 0;~x~0 := 0; {50162#(<= 50000 main_~y~0)} is VALID [2022-04-28 03:58:33,477 INFO L290 TraceCheckUtils]: 6: Hoare triple {50162#(<= 50000 main_~y~0)} [204] L11-2-->L18-1_primed: Formula: (let ((.cse0 (= v_main_~x~0_2538 v_main_~x~0_2537)) (.cse1 (= |v_main_#t~post4_234| |v_main_#t~post4_233|))) (or (and .cse0 .cse1) (and (< v_main_~x~0_2537 50001) (< v_main_~x~0_2538 v_main_~x~0_2537)) (and (<= 50000 v_main_~x~0_2538) .cse0 .cse1))) InVars {main_~x~0=v_main_~x~0_2538, main_#t~post4=|v_main_#t~post4_234|} OutVars{main_~x~0=v_main_~x~0_2537, main_#t~post4=|v_main_#t~post4_233|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {50162#(<= 50000 main_~y~0)} is VALID [2022-04-28 03:58:33,477 INFO L290 TraceCheckUtils]: 7: Hoare triple {50162#(<= 50000 main_~y~0)} [205] L18-1_primed-->L11-2: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {50162#(<= 50000 main_~y~0)} is VALID [2022-04-28 03:58:33,478 INFO L290 TraceCheckUtils]: 8: Hoare triple {50162#(<= 50000 main_~y~0)} [206] L11-2-->L18-1_primed: Formula: (let ((.cse0 (= |v_main_#t~post6_256| |v_main_#t~post6_255|)) (.cse1 (= v_main_~y~0_2894 v_main_~y~0_2893)) (.cse2 (= |v_main_#t~post5_256| |v_main_#t~post5_255|)) (.cse5 (<= 50000 v_main_~x~0_2540)) (.cse3 (= v_main_~x~0_2540 v_main_~x~0_2539))) (or (and .cse0 .cse1 .cse2 .cse3) (let ((.cse4 (+ v_main_~x~0_2540 v_main_~y~0_2893))) (and (< .cse4 (+ 1000001 v_main_~y~0_2894)) .cse5 (= (+ v_main_~x~0_2539 v_main_~y~0_2894) .cse4) (< v_main_~y~0_2894 v_main_~y~0_2893))) (and .cse0 .cse1 .cse2 (or (not (< v_main_~x~0_2540 1000000)) (not .cse5)) .cse3))) InVars {main_~y~0=v_main_~y~0_2894, main_#t~post5=|v_main_#t~post5_256|, main_~x~0=v_main_~x~0_2540, main_#t~post6=|v_main_#t~post6_256|} OutVars{main_~y~0=v_main_~y~0_2893, main_#t~post5=|v_main_#t~post5_255|, main_~x~0=v_main_~x~0_2539, main_#t~post6=|v_main_#t~post6_255|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {50162#(<= 50000 main_~y~0)} is VALID [2022-04-28 03:58:33,478 INFO L290 TraceCheckUtils]: 9: Hoare triple {50162#(<= 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[] {50162#(<= 50000 main_~y~0)} is VALID [2022-04-28 03:58:33,479 INFO L290 TraceCheckUtils]: 10: Hoare triple {50162#(<= 50000 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {50163#(<= 49998 main_~y~0)} is VALID [2022-04-28 03:58:33,479 INFO L290 TraceCheckUtils]: 11: Hoare triple {50163#(<= 49998 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {50164#(<= 49996 main_~y~0)} is VALID [2022-04-28 03:58:33,479 INFO L290 TraceCheckUtils]: 12: Hoare triple {50164#(<= 49996 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {50165#(<= 49994 main_~y~0)} is VALID [2022-04-28 03:58:33,480 INFO L290 TraceCheckUtils]: 13: Hoare triple {50165#(<= 49994 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {50166#(<= 49992 main_~y~0)} is VALID [2022-04-28 03:58:33,480 INFO L290 TraceCheckUtils]: 14: Hoare triple {50166#(<= 49992 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {50167#(<= 49990 main_~y~0)} is VALID [2022-04-28 03:58:33,481 INFO L290 TraceCheckUtils]: 15: Hoare triple {50167#(<= 49990 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {50168#(<= 49988 main_~y~0)} is VALID [2022-04-28 03:58:33,481 INFO L290 TraceCheckUtils]: 16: Hoare triple {50168#(<= 49988 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {50169#(<= 49986 main_~y~0)} is VALID [2022-04-28 03:58:33,482 INFO L290 TraceCheckUtils]: 17: Hoare triple {50169#(<= 49986 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {50170#(<= 49984 main_~y~0)} is VALID [2022-04-28 03:58:33,482 INFO L290 TraceCheckUtils]: 18: Hoare triple {50170#(<= 49984 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {50171#(<= 49982 main_~y~0)} is VALID [2022-04-28 03:58:33,482 INFO L290 TraceCheckUtils]: 19: Hoare triple {50171#(<= 49982 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {50172#(<= 49980 main_~y~0)} is VALID [2022-04-28 03:58:33,483 INFO L290 TraceCheckUtils]: 20: Hoare triple {50172#(<= 49980 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {50173#(<= 49978 main_~y~0)} is VALID [2022-04-28 03:58:33,492 INFO L290 TraceCheckUtils]: 21: Hoare triple {50173#(<= 49978 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {50174#(<= 49976 main_~y~0)} is VALID [2022-04-28 03:58:33,493 INFO L290 TraceCheckUtils]: 22: Hoare triple {50174#(<= 49976 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {50175#(<= 49974 main_~y~0)} is VALID [2022-04-28 03:58:33,493 INFO L290 TraceCheckUtils]: 23: Hoare triple {50175#(<= 49974 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {50176#(<= 49972 main_~y~0)} is VALID [2022-04-28 03:58:33,494 INFO L290 TraceCheckUtils]: 24: Hoare triple {50176#(<= 49972 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {50177#(<= 49970 main_~y~0)} is VALID [2022-04-28 03:58:33,494 INFO L290 TraceCheckUtils]: 25: Hoare triple {50177#(<= 49970 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {50178#(<= 49968 main_~y~0)} is VALID [2022-04-28 03:58:33,495 INFO L290 TraceCheckUtils]: 26: Hoare triple {50178#(<= 49968 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {50179#(<= 49966 main_~y~0)} is VALID [2022-04-28 03:58:33,495 INFO L290 TraceCheckUtils]: 27: Hoare triple {50179#(<= 49966 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {50180#(<= 49964 main_~y~0)} is VALID [2022-04-28 03:58:33,495 INFO L290 TraceCheckUtils]: 28: Hoare triple {50180#(<= 49964 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {50181#(<= 49962 main_~y~0)} is VALID [2022-04-28 03:58:33,496 INFO L290 TraceCheckUtils]: 29: Hoare triple {50181#(<= 49962 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {50182#(<= 49960 main_~y~0)} is VALID [2022-04-28 03:58:33,496 INFO L290 TraceCheckUtils]: 30: Hoare triple {50182#(<= 49960 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {50183#(<= 49958 main_~y~0)} is VALID [2022-04-28 03:58:33,497 INFO L290 TraceCheckUtils]: 31: Hoare triple {50183#(<= 49958 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {50184#(<= 49956 main_~y~0)} is VALID [2022-04-28 03:58:33,497 INFO L290 TraceCheckUtils]: 32: Hoare triple {50184#(<= 49956 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {50185#(<= 49954 main_~y~0)} is VALID [2022-04-28 03:58:33,498 INFO L290 TraceCheckUtils]: 33: Hoare triple {50185#(<= 49954 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {50186#(<= 49952 main_~y~0)} is VALID [2022-04-28 03:58:33,498 INFO L290 TraceCheckUtils]: 34: Hoare triple {50186#(<= 49952 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {50187#(<= 49950 main_~y~0)} is VALID [2022-04-28 03:58:33,498 INFO L290 TraceCheckUtils]: 35: Hoare triple {50187#(<= 49950 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {50188#(<= 49948 main_~y~0)} is VALID [2022-04-28 03:58:33,499 INFO L290 TraceCheckUtils]: 36: Hoare triple {50188#(<= 49948 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {50189#(<= 49946 main_~y~0)} is VALID [2022-04-28 03:58:33,499 INFO L290 TraceCheckUtils]: 37: Hoare triple {50189#(<= 49946 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {50190#(<= 49944 main_~y~0)} is VALID [2022-04-28 03:58:33,500 INFO L290 TraceCheckUtils]: 38: Hoare triple {50190#(<= 49944 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {50191#(<= 49942 main_~y~0)} is VALID [2022-04-28 03:58:33,500 INFO L290 TraceCheckUtils]: 39: Hoare triple {50191#(<= 49942 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {50192#(<= 49940 main_~y~0)} is VALID [2022-04-28 03:58:33,501 INFO L290 TraceCheckUtils]: 40: Hoare triple {50192#(<= 49940 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {50193#(<= 49938 main_~y~0)} is VALID [2022-04-28 03:58:33,501 INFO L290 TraceCheckUtils]: 41: Hoare triple {50193#(<= 49938 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {50194#(<= 49936 main_~y~0)} is VALID [2022-04-28 03:58:33,501 INFO L290 TraceCheckUtils]: 42: Hoare triple {50194#(<= 49936 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {50195#(<= 49934 main_~y~0)} is VALID [2022-04-28 03:58:33,502 INFO L290 TraceCheckUtils]: 43: Hoare triple {50195#(<= 49934 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {50196#(<= 49932 main_~y~0)} is VALID [2022-04-28 03:58:33,502 INFO L290 TraceCheckUtils]: 44: Hoare triple {50196#(<= 49932 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {50197#(<= 49930 main_~y~0)} is VALID [2022-04-28 03:58:33,503 INFO L290 TraceCheckUtils]: 45: Hoare triple {50197#(<= 49930 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {50198#(<= 49928 main_~y~0)} is VALID [2022-04-28 03:58:33,503 INFO L290 TraceCheckUtils]: 46: Hoare triple {50198#(<= 49928 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {50199#(<= 49926 main_~y~0)} is VALID [2022-04-28 03:58:33,503 INFO L290 TraceCheckUtils]: 47: Hoare triple {50199#(<= 49926 main_~y~0)} assume !(~y~0 > 0); {50158#false} is VALID [2022-04-28 03:58:33,503 INFO L272 TraceCheckUtils]: 48: Hoare triple {50158#false} call __VERIFIER_assert((if ~z~0 == ~x~0 then 1 else 0)); {50158#false} is VALID [2022-04-28 03:58:33,503 INFO L290 TraceCheckUtils]: 49: Hoare triple {50158#false} ~cond := #in~cond; {50158#false} is VALID [2022-04-28 03:58:33,504 INFO L290 TraceCheckUtils]: 50: Hoare triple {50158#false} assume 0 == ~cond; {50158#false} is VALID [2022-04-28 03:58:33,504 INFO L290 TraceCheckUtils]: 51: Hoare triple {50158#false} assume !false; {50158#false} is VALID [2022-04-28 03:58:33,504 INFO L134 CoverageAnalysis]: Checked inductivity of 705 backedges. 0 proven. 703 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-04-28 03:58:33,504 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 03:58:35,430 INFO L290 TraceCheckUtils]: 51: Hoare triple {50158#false} assume !false; {50158#false} is VALID [2022-04-28 03:58:35,430 INFO L290 TraceCheckUtils]: 50: Hoare triple {50158#false} assume 0 == ~cond; {50158#false} is VALID [2022-04-28 03:58:35,430 INFO L290 TraceCheckUtils]: 49: Hoare triple {50158#false} ~cond := #in~cond; {50158#false} is VALID [2022-04-28 03:58:35,430 INFO L272 TraceCheckUtils]: 48: Hoare triple {50158#false} call __VERIFIER_assert((if ~z~0 == ~x~0 then 1 else 0)); {50158#false} is VALID [2022-04-28 03:58:35,431 INFO L290 TraceCheckUtils]: 47: Hoare triple {50369#(< 0 main_~y~0)} assume !(~y~0 > 0); {50158#false} is VALID [2022-04-28 03:58:35,431 INFO L290 TraceCheckUtils]: 46: Hoare triple {50373#(< 2 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {50369#(< 0 main_~y~0)} is VALID [2022-04-28 03:58:35,432 INFO L290 TraceCheckUtils]: 45: Hoare triple {50377#(< 4 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {50373#(< 2 main_~y~0)} is VALID [2022-04-28 03:58:35,432 INFO L290 TraceCheckUtils]: 44: Hoare triple {50381#(< 6 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {50377#(< 4 main_~y~0)} is VALID [2022-04-28 03:58:35,433 INFO L290 TraceCheckUtils]: 43: Hoare triple {50385#(< 8 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {50381#(< 6 main_~y~0)} is VALID [2022-04-28 03:58:35,433 INFO L290 TraceCheckUtils]: 42: Hoare triple {50389#(< 10 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {50385#(< 8 main_~y~0)} is VALID [2022-04-28 03:58:35,433 INFO L290 TraceCheckUtils]: 41: Hoare triple {50393#(< 12 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {50389#(< 10 main_~y~0)} is VALID [2022-04-28 03:58:35,434 INFO L290 TraceCheckUtils]: 40: Hoare triple {50397#(< 14 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {50393#(< 12 main_~y~0)} is VALID [2022-04-28 03:58:35,434 INFO L290 TraceCheckUtils]: 39: Hoare triple {50401#(< 16 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {50397#(< 14 main_~y~0)} is VALID [2022-04-28 03:58:35,435 INFO L290 TraceCheckUtils]: 38: Hoare triple {50405#(< 18 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {50401#(< 16 main_~y~0)} is VALID [2022-04-28 03:58:35,435 INFO L290 TraceCheckUtils]: 37: Hoare triple {50409#(< 20 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {50405#(< 18 main_~y~0)} is VALID [2022-04-28 03:58:35,435 INFO L290 TraceCheckUtils]: 36: Hoare triple {50413#(< 22 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {50409#(< 20 main_~y~0)} is VALID [2022-04-28 03:58:35,436 INFO L290 TraceCheckUtils]: 35: Hoare triple {50417#(< 24 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {50413#(< 22 main_~y~0)} is VALID [2022-04-28 03:58:35,436 INFO L290 TraceCheckUtils]: 34: Hoare triple {50421#(< 26 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {50417#(< 24 main_~y~0)} is VALID [2022-04-28 03:58:35,437 INFO L290 TraceCheckUtils]: 33: Hoare triple {50425#(< 28 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {50421#(< 26 main_~y~0)} is VALID [2022-04-28 03:58:35,437 INFO L290 TraceCheckUtils]: 32: Hoare triple {50429#(< 30 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {50425#(< 28 main_~y~0)} is VALID [2022-04-28 03:58:35,438 INFO L290 TraceCheckUtils]: 31: Hoare triple {50433#(< 32 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {50429#(< 30 main_~y~0)} is VALID [2022-04-28 03:58:35,438 INFO L290 TraceCheckUtils]: 30: Hoare triple {50437#(< 34 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {50433#(< 32 main_~y~0)} is VALID [2022-04-28 03:58:35,438 INFO L290 TraceCheckUtils]: 29: Hoare triple {50441#(< 36 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {50437#(< 34 main_~y~0)} is VALID [2022-04-28 03:58:35,439 INFO L290 TraceCheckUtils]: 28: Hoare triple {50445#(< 38 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {50441#(< 36 main_~y~0)} is VALID [2022-04-28 03:58:35,439 INFO L290 TraceCheckUtils]: 27: Hoare triple {50449#(< 40 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {50445#(< 38 main_~y~0)} is VALID [2022-04-28 03:58:35,440 INFO L290 TraceCheckUtils]: 26: Hoare triple {50453#(< 42 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {50449#(< 40 main_~y~0)} is VALID [2022-04-28 03:58:35,440 INFO L290 TraceCheckUtils]: 25: Hoare triple {50457#(< 44 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {50453#(< 42 main_~y~0)} is VALID [2022-04-28 03:58:35,441 INFO L290 TraceCheckUtils]: 24: Hoare triple {50461#(< 46 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {50457#(< 44 main_~y~0)} is VALID [2022-04-28 03:58:35,441 INFO L290 TraceCheckUtils]: 23: Hoare triple {50465#(< 48 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {50461#(< 46 main_~y~0)} is VALID [2022-04-28 03:58:35,441 INFO L290 TraceCheckUtils]: 22: Hoare triple {50469#(< 50 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {50465#(< 48 main_~y~0)} is VALID [2022-04-28 03:58:35,442 INFO L290 TraceCheckUtils]: 21: Hoare triple {50473#(< 52 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {50469#(< 50 main_~y~0)} is VALID [2022-04-28 03:58:35,442 INFO L290 TraceCheckUtils]: 20: Hoare triple {50477#(< 54 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {50473#(< 52 main_~y~0)} is VALID [2022-04-28 03:58:35,443 INFO L290 TraceCheckUtils]: 19: Hoare triple {50481#(< 56 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {50477#(< 54 main_~y~0)} is VALID [2022-04-28 03:58:35,443 INFO L290 TraceCheckUtils]: 18: Hoare triple {50485#(< 58 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {50481#(< 56 main_~y~0)} is VALID [2022-04-28 03:58:35,443 INFO L290 TraceCheckUtils]: 17: Hoare triple {50489#(< 60 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {50485#(< 58 main_~y~0)} is VALID [2022-04-28 03:58:35,444 INFO L290 TraceCheckUtils]: 16: Hoare triple {50493#(< 62 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {50489#(< 60 main_~y~0)} is VALID [2022-04-28 03:58:35,444 INFO L290 TraceCheckUtils]: 15: Hoare triple {50497#(< 64 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {50493#(< 62 main_~y~0)} is VALID [2022-04-28 03:58:35,445 INFO L290 TraceCheckUtils]: 14: Hoare triple {50501#(< 66 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {50497#(< 64 main_~y~0)} is VALID [2022-04-28 03:58:35,445 INFO L290 TraceCheckUtils]: 13: Hoare triple {50505#(< 68 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {50501#(< 66 main_~y~0)} is VALID [2022-04-28 03:58:35,445 INFO L290 TraceCheckUtils]: 12: Hoare triple {50509#(< 70 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {50505#(< 68 main_~y~0)} is VALID [2022-04-28 03:58:35,446 INFO L290 TraceCheckUtils]: 11: Hoare triple {50513#(< 72 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {50509#(< 70 main_~y~0)} is VALID [2022-04-28 03:58:35,446 INFO L290 TraceCheckUtils]: 10: Hoare triple {50517#(< 74 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {50513#(< 72 main_~y~0)} is VALID [2022-04-28 03:58:35,447 INFO L290 TraceCheckUtils]: 9: Hoare triple {50517#(< 74 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[] {50517#(< 74 main_~y~0)} is VALID [2022-04-28 03:58:35,447 INFO L290 TraceCheckUtils]: 8: Hoare triple {50517#(< 74 main_~y~0)} [206] L11-2-->L18-1_primed: Formula: (let ((.cse0 (= |v_main_#t~post6_256| |v_main_#t~post6_255|)) (.cse1 (= v_main_~y~0_2894 v_main_~y~0_2893)) (.cse2 (= |v_main_#t~post5_256| |v_main_#t~post5_255|)) (.cse5 (<= 50000 v_main_~x~0_2540)) (.cse3 (= v_main_~x~0_2540 v_main_~x~0_2539))) (or (and .cse0 .cse1 .cse2 .cse3) (let ((.cse4 (+ v_main_~x~0_2540 v_main_~y~0_2893))) (and (< .cse4 (+ 1000001 v_main_~y~0_2894)) .cse5 (= (+ v_main_~x~0_2539 v_main_~y~0_2894) .cse4) (< v_main_~y~0_2894 v_main_~y~0_2893))) (and .cse0 .cse1 .cse2 (or (not (< v_main_~x~0_2540 1000000)) (not .cse5)) .cse3))) InVars {main_~y~0=v_main_~y~0_2894, main_#t~post5=|v_main_#t~post5_256|, main_~x~0=v_main_~x~0_2540, main_#t~post6=|v_main_#t~post6_256|} OutVars{main_~y~0=v_main_~y~0_2893, main_#t~post5=|v_main_#t~post5_255|, main_~x~0=v_main_~x~0_2539, main_#t~post6=|v_main_#t~post6_255|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {50517#(< 74 main_~y~0)} is VALID [2022-04-28 03:58:35,448 INFO L290 TraceCheckUtils]: 7: Hoare triple {50517#(< 74 main_~y~0)} [205] L18-1_primed-->L11-2: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {50517#(< 74 main_~y~0)} is VALID [2022-04-28 03:58:35,448 INFO L290 TraceCheckUtils]: 6: Hoare triple {50517#(< 74 main_~y~0)} [204] L11-2-->L18-1_primed: Formula: (let ((.cse0 (= v_main_~x~0_2538 v_main_~x~0_2537)) (.cse1 (= |v_main_#t~post4_234| |v_main_#t~post4_233|))) (or (and .cse0 .cse1) (and (< v_main_~x~0_2537 50001) (< v_main_~x~0_2538 v_main_~x~0_2537)) (and (<= 50000 v_main_~x~0_2538) .cse0 .cse1))) InVars {main_~x~0=v_main_~x~0_2538, main_#t~post4=|v_main_#t~post4_234|} OutVars{main_~x~0=v_main_~x~0_2537, main_#t~post4=|v_main_#t~post4_233|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {50517#(< 74 main_~y~0)} is VALID [2022-04-28 03:58:35,448 INFO L290 TraceCheckUtils]: 5: Hoare triple {50157#true} ~x~0 := 0;~y~0 := 50000;~z~0 := 0;~x~0 := 0; {50517#(< 74 main_~y~0)} is VALID [2022-04-28 03:58:35,448 INFO L272 TraceCheckUtils]: 4: Hoare triple {50157#true} call #t~ret7 := main(); {50157#true} is VALID [2022-04-28 03:58:35,448 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {50157#true} {50157#true} #52#return; {50157#true} is VALID [2022-04-28 03:58:35,448 INFO L290 TraceCheckUtils]: 2: Hoare triple {50157#true} assume true; {50157#true} is VALID [2022-04-28 03:58:35,448 INFO L290 TraceCheckUtils]: 1: Hoare triple {50157#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); {50157#true} is VALID [2022-04-28 03:58:35,449 INFO L272 TraceCheckUtils]: 0: Hoare triple {50157#true} call ULTIMATE.init(); {50157#true} is VALID [2022-04-28 03:58:35,449 INFO L134 CoverageAnalysis]: Checked inductivity of 705 backedges. 0 proven. 703 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-04-28 03:58:35,449 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1839183704] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 03:58:35,449 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 03:58:35,449 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [41, 40, 40] total 79 [2022-04-28 03:58:38,634 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 03:58:38,634 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [789109398] [2022-04-28 03:58:38,634 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [789109398] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 03:58:38,634 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 03:58:38,635 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [110] imperfect sequences [] total 110 [2022-04-28 03:58:38,635 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [682230464] [2022-04-28 03:58:38,635 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 03:58:38,635 INFO L78 Accepts]: Start accepts. Automaton has has 110 states, 110 states have (on average 1.6454545454545455) internal successors, (181), 109 states have internal predecessors, (181), 2 states have call successors, (3), 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 185 [2022-04-28 03:58:38,635 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 03:58:38,635 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 110 states, 110 states have (on average 1.6454545454545455) internal successors, (181), 109 states have internal predecessors, (181), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:58:38,772 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 185 edges. 185 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 03:58:38,773 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 110 states [2022-04-28 03:58:38,773 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 03:58:38,774 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 110 interpolants. [2022-04-28 03:58:38,775 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8455, Invalid=13301, Unknown=0, NotChecked=0, Total=21756 [2022-04-28 03:58:38,775 INFO L87 Difference]: Start difference. First operand 186 states and 189 transitions. Second operand has 110 states, 110 states have (on average 1.6454545454545455) internal successors, (181), 109 states have internal predecessors, (181), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:58:57,162 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:58:57,162 INFO L93 Difference]: Finished difference Result 369 states and 380 transitions. [2022-04-28 03:58:57,162 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 110 states. [2022-04-28 03:58:57,162 INFO L78 Accepts]: Start accepts. Automaton has has 110 states, 110 states have (on average 1.6454545454545455) internal successors, (181), 109 states have internal predecessors, (181), 2 states have call successors, (3), 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 185 [2022-04-28 03:58:57,162 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 03:58:57,162 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 110 states, 110 states have (on average 1.6454545454545455) internal successors, (181), 109 states have internal predecessors, (181), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:58:57,164 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 110 states and 207 transitions. [2022-04-28 03:58:57,164 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 110 states, 110 states have (on average 1.6454545454545455) internal successors, (181), 109 states have internal predecessors, (181), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:58:57,165 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 110 states and 207 transitions. [2022-04-28 03:58:57,165 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 110 states and 207 transitions. [2022-04-28 03:58:57,332 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 207 edges. 207 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 03:58:57,334 INFO L225 Difference]: With dead ends: 369 [2022-04-28 03:58:57,334 INFO L226 Difference]: Without dead ends: 191 [2022-04-28 03:58:57,338 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 394 GetRequests, 140 SyntacticMatches, 1 SemanticMatches, 253 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18829 ImplicationChecksByTransitivity, 8.7s TimeCoverageRelationStatistics Valid=19735, Invalid=45035, Unknown=0, NotChecked=0, Total=64770 [2022-04-28 03:58:57,338 INFO L413 NwaCegarLoop]: 12 mSDtfsCounter, 291 mSDsluCounter, 42 mSDsCounter, 0 mSdLazyCounter, 9542 mSolverCounterSat, 403 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 7.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 291 SdHoareTripleChecker+Valid, 54 SdHoareTripleChecker+Invalid, 9945 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 403 IncrementalHoareTripleChecker+Valid, 9542 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 7.5s IncrementalHoareTripleChecker+Time [2022-04-28 03:58:57,338 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [291 Valid, 54 Invalid, 9945 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [403 Valid, 9542 Invalid, 0 Unknown, 0 Unchecked, 7.5s Time] [2022-04-28 03:58:57,338 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 191 states. [2022-04-28 03:58:57,620 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 191 to 191. [2022-04-28 03:58:57,620 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 03:58:57,621 INFO L82 GeneralOperation]: Start isEquivalent. First operand 191 states. Second operand has 191 states, 186 states have (on average 1.021505376344086) internal successors, (190), 186 states have internal predecessors, (190), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:58:57,621 INFO L74 IsIncluded]: Start isIncluded. First operand 191 states. Second operand has 191 states, 186 states have (on average 1.021505376344086) internal successors, (190), 186 states have internal predecessors, (190), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:58:57,621 INFO L87 Difference]: Start difference. First operand 191 states. Second operand has 191 states, 186 states have (on average 1.021505376344086) internal successors, (190), 186 states have internal predecessors, (190), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:58:57,623 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:58:57,623 INFO L93 Difference]: Finished difference Result 191 states and 194 transitions. [2022-04-28 03:58:57,623 INFO L276 IsEmpty]: Start isEmpty. Operand 191 states and 194 transitions. [2022-04-28 03:58:57,623 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:58:57,623 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:58:57,623 INFO L74 IsIncluded]: Start isIncluded. First operand has 191 states, 186 states have (on average 1.021505376344086) internal successors, (190), 186 states have internal predecessors, (190), 3 states have call successors, (3), 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 191 states. [2022-04-28 03:58:57,623 INFO L87 Difference]: Start difference. First operand has 191 states, 186 states have (on average 1.021505376344086) internal successors, (190), 186 states have internal predecessors, (190), 3 states have call successors, (3), 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 191 states. [2022-04-28 03:58:57,624 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:58:57,625 INFO L93 Difference]: Finished difference Result 191 states and 194 transitions. [2022-04-28 03:58:57,625 INFO L276 IsEmpty]: Start isEmpty. Operand 191 states and 194 transitions. [2022-04-28 03:58:57,625 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:58:57,625 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:58:57,625 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 03:58:57,625 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 03:58:57,625 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 191 states, 186 states have (on average 1.021505376344086) internal successors, (190), 186 states have internal predecessors, (190), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:58:57,627 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 191 states to 191 states and 194 transitions. [2022-04-28 03:58:57,627 INFO L78 Accepts]: Start accepts. Automaton has 191 states and 194 transitions. Word has length 185 [2022-04-28 03:58:57,627 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 03:58:57,627 INFO L495 AbstractCegarLoop]: Abstraction has 191 states and 194 transitions. [2022-04-28 03:58:57,627 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 110 states, 110 states have (on average 1.6454545454545455) internal successors, (181), 109 states have internal predecessors, (181), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:58:57,627 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 191 states and 194 transitions. [2022-04-28 03:58:57,793 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 194 edges. 194 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 03:58:57,793 INFO L276 IsEmpty]: Start isEmpty. Operand 191 states and 194 transitions. [2022-04-28 03:58:57,793 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 191 [2022-04-28 03:58:57,793 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 03:58:57,794 INFO L195 NwaCegarLoop]: trace histogram [70, 69, 38, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 03:58:57,810 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (38)] Forceful destruction successful, exit code 0 [2022-04-28 03:58:57,994 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 38 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable39 [2022-04-28 03:58:57,994 INFO L420 AbstractCegarLoop]: === Iteration 41 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 03:58:57,994 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 03:58:57,994 INFO L85 PathProgramCache]: Analyzing trace with hash -1208729549, now seen corresponding path program 38 times [2022-04-28 03:58:57,994 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 03:58:57,994 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1125762213] [2022-04-28 03:58:58,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-28 03:58:58,342 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={1=1, 2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 03:58:58,343 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-28 03:58:58,345 INFO L85 PathProgramCache]: Analyzing trace with hash -1200560543, now seen corresponding path program 1 times [2022-04-28 03:58:58,345 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 03:58:58,345 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1955682599] [2022-04-28 03:58:58,345 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:58:58,345 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 03:58:58,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:58:59,156 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 03:58:59,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:58:59,159 INFO L290 TraceCheckUtils]: 0: Hoare triple {52382#(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); {52335#true} is VALID [2022-04-28 03:58:59,159 INFO L290 TraceCheckUtils]: 1: Hoare triple {52335#true} assume true; {52335#true} is VALID [2022-04-28 03:58:59,159 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {52335#true} {52335#true} #52#return; {52335#true} is VALID [2022-04-28 03:58:59,159 INFO L272 TraceCheckUtils]: 0: Hoare triple {52335#true} call ULTIMATE.init(); {52382#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 03:58:59,160 INFO L290 TraceCheckUtils]: 1: Hoare triple {52382#(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); {52335#true} is VALID [2022-04-28 03:58:59,160 INFO L290 TraceCheckUtils]: 2: Hoare triple {52335#true} assume true; {52335#true} is VALID [2022-04-28 03:58:59,160 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {52335#true} {52335#true} #52#return; {52335#true} is VALID [2022-04-28 03:58:59,160 INFO L272 TraceCheckUtils]: 4: Hoare triple {52335#true} call #t~ret7 := main(); {52335#true} is VALID [2022-04-28 03:58:59,160 INFO L290 TraceCheckUtils]: 5: Hoare triple {52335#true} ~x~0 := 0;~y~0 := 50000;~z~0 := 0;~x~0 := 0; {52340#(and (= main_~x~0 0) (<= 50000 main_~y~0))} is VALID [2022-04-28 03:58:59,161 INFO L290 TraceCheckUtils]: 6: Hoare triple {52340#(and (= main_~x~0 0) (<= 50000 main_~y~0))} [208] L11-2-->L18-1_primed: Formula: (let ((.cse0 (= v_main_~x~0_2659 v_main_~x~0_2658))) (or (and (< v_main_~x~0_2658 50001) (< v_main_~x~0_2659 v_main_~x~0_2658)) (and .cse0 (= |v_main_#t~post4_240| |v_main_#t~post4_239|)) (and .cse0 (not (< v_main_~x~0_2659 50000)) (= |v_main_#t~post4_239| |v_main_#t~post4_240|)))) InVars {main_~x~0=v_main_~x~0_2659, main_#t~post4=|v_main_#t~post4_240|} OutVars{main_~x~0=v_main_~x~0_2658, main_#t~post4=|v_main_#t~post4_239|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {52341#(and (<= main_~x~0 main_~y~0) (<= 50000 main_~y~0))} is VALID [2022-04-28 03:58:59,161 INFO L290 TraceCheckUtils]: 7: Hoare triple {52341#(and (<= main_~x~0 main_~y~0) (<= 50000 main_~y~0))} [209] L18-1_primed-->L11-2: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {52341#(and (<= main_~x~0 main_~y~0) (<= 50000 main_~y~0))} is VALID [2022-04-28 03:58:59,162 INFO L290 TraceCheckUtils]: 8: Hoare triple {52341#(and (<= main_~x~0 main_~y~0) (<= 50000 main_~y~0))} [210] L11-2-->L18-1_primed: Formula: (let ((.cse4 (<= 50000 v_main_~x~0_2661)) (.cse0 (= |v_main_#t~post6_263| |v_main_#t~post6_262|)) (.cse1 (= v_main_~y~0_3044 v_main_~y~0_3043)) (.cse2 (= v_main_~x~0_2661 v_main_~x~0_2660)) (.cse3 (= |v_main_#t~post5_263| |v_main_#t~post5_262|))) (or (and .cse0 .cse1 .cse2 .cse3 (or (not .cse4) (not (< v_main_~x~0_2661 1000000)))) (and (< v_main_~x~0_2660 1000001) (= (+ v_main_~x~0_2661 v_main_~y~0_3043) (+ v_main_~x~0_2660 v_main_~y~0_3044)) .cse4 (< v_main_~x~0_2661 v_main_~x~0_2660)) (and .cse0 .cse1 .cse2 .cse3))) InVars {main_~y~0=v_main_~y~0_3044, main_#t~post5=|v_main_#t~post5_263|, main_~x~0=v_main_~x~0_2661, main_#t~post6=|v_main_#t~post6_263|} OutVars{main_~y~0=v_main_~y~0_3043, main_#t~post5=|v_main_#t~post5_262|, main_~x~0=v_main_~x~0_2660, main_#t~post6=|v_main_#t~post6_262|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {52342#(or (<= main_~x~0 main_~y~0) (<= 50000 main_~y~0))} is VALID [2022-04-28 03:58:59,162 INFO L290 TraceCheckUtils]: 9: Hoare triple {52342#(or (<= main_~x~0 main_~y~0) (<= 50000 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[] {52343#(<= 50000 main_~y~0)} is VALID [2022-04-28 03:58:59,163 INFO L290 TraceCheckUtils]: 10: Hoare triple {52343#(<= 50000 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {52344#(<= 49998 main_~y~0)} is VALID [2022-04-28 03:58:59,163 INFO L290 TraceCheckUtils]: 11: Hoare triple {52344#(<= 49998 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {52345#(<= 49996 main_~y~0)} is VALID [2022-04-28 03:58:59,163 INFO L290 TraceCheckUtils]: 12: Hoare triple {52345#(<= 49996 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {52346#(<= 49994 main_~y~0)} is VALID [2022-04-28 03:58:59,164 INFO L290 TraceCheckUtils]: 13: Hoare triple {52346#(<= 49994 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {52347#(<= 49992 main_~y~0)} is VALID [2022-04-28 03:58:59,164 INFO L290 TraceCheckUtils]: 14: Hoare triple {52347#(<= 49992 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {52348#(<= 49990 main_~y~0)} is VALID [2022-04-28 03:58:59,165 INFO L290 TraceCheckUtils]: 15: Hoare triple {52348#(<= 49990 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {52349#(<= 49988 main_~y~0)} is VALID [2022-04-28 03:58:59,165 INFO L290 TraceCheckUtils]: 16: Hoare triple {52349#(<= 49988 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {52350#(<= 49986 main_~y~0)} is VALID [2022-04-28 03:58:59,166 INFO L290 TraceCheckUtils]: 17: Hoare triple {52350#(<= 49986 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {52351#(<= 49984 main_~y~0)} is VALID [2022-04-28 03:58:59,166 INFO L290 TraceCheckUtils]: 18: Hoare triple {52351#(<= 49984 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {52352#(<= 49982 main_~y~0)} is VALID [2022-04-28 03:58:59,166 INFO L290 TraceCheckUtils]: 19: Hoare triple {52352#(<= 49982 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {52353#(<= 49980 main_~y~0)} is VALID [2022-04-28 03:58:59,167 INFO L290 TraceCheckUtils]: 20: Hoare triple {52353#(<= 49980 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {52354#(<= 49978 main_~y~0)} is VALID [2022-04-28 03:58:59,167 INFO L290 TraceCheckUtils]: 21: Hoare triple {52354#(<= 49978 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {52355#(<= 49976 main_~y~0)} is VALID [2022-04-28 03:58:59,168 INFO L290 TraceCheckUtils]: 22: Hoare triple {52355#(<= 49976 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {52356#(<= 49974 main_~y~0)} is VALID [2022-04-28 03:58:59,168 INFO L290 TraceCheckUtils]: 23: Hoare triple {52356#(<= 49974 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {52357#(<= 49972 main_~y~0)} is VALID [2022-04-28 03:58:59,168 INFO L290 TraceCheckUtils]: 24: Hoare triple {52357#(<= 49972 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {52358#(<= 49970 main_~y~0)} is VALID [2022-04-28 03:58:59,169 INFO L290 TraceCheckUtils]: 25: Hoare triple {52358#(<= 49970 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {52359#(<= 49968 main_~y~0)} is VALID [2022-04-28 03:58:59,169 INFO L290 TraceCheckUtils]: 26: Hoare triple {52359#(<= 49968 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {52360#(<= 49966 main_~y~0)} is VALID [2022-04-28 03:58:59,170 INFO L290 TraceCheckUtils]: 27: Hoare triple {52360#(<= 49966 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {52361#(<= 49964 main_~y~0)} is VALID [2022-04-28 03:58:59,170 INFO L290 TraceCheckUtils]: 28: Hoare triple {52361#(<= 49964 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {52362#(<= 49962 main_~y~0)} is VALID [2022-04-28 03:58:59,171 INFO L290 TraceCheckUtils]: 29: Hoare triple {52362#(<= 49962 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {52363#(<= 49960 main_~y~0)} is VALID [2022-04-28 03:58:59,171 INFO L290 TraceCheckUtils]: 30: Hoare triple {52363#(<= 49960 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {52364#(<= 49958 main_~y~0)} is VALID [2022-04-28 03:58:59,172 INFO L290 TraceCheckUtils]: 31: Hoare triple {52364#(<= 49958 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {52365#(<= 49956 main_~y~0)} is VALID [2022-04-28 03:58:59,172 INFO L290 TraceCheckUtils]: 32: Hoare triple {52365#(<= 49956 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {52366#(<= 49954 main_~y~0)} is VALID [2022-04-28 03:58:59,172 INFO L290 TraceCheckUtils]: 33: Hoare triple {52366#(<= 49954 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {52367#(<= 49952 main_~y~0)} is VALID [2022-04-28 03:58:59,173 INFO L290 TraceCheckUtils]: 34: Hoare triple {52367#(<= 49952 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {52368#(<= 49950 main_~y~0)} is VALID [2022-04-28 03:58:59,173 INFO L290 TraceCheckUtils]: 35: Hoare triple {52368#(<= 49950 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {52369#(<= 49948 main_~y~0)} is VALID [2022-04-28 03:58:59,174 INFO L290 TraceCheckUtils]: 36: Hoare triple {52369#(<= 49948 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {52370#(<= 49946 main_~y~0)} is VALID [2022-04-28 03:58:59,174 INFO L290 TraceCheckUtils]: 37: Hoare triple {52370#(<= 49946 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {52371#(<= 49944 main_~y~0)} is VALID [2022-04-28 03:58:59,175 INFO L290 TraceCheckUtils]: 38: Hoare triple {52371#(<= 49944 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {52372#(<= 49942 main_~y~0)} is VALID [2022-04-28 03:58:59,175 INFO L290 TraceCheckUtils]: 39: Hoare triple {52372#(<= 49942 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {52373#(<= 49940 main_~y~0)} is VALID [2022-04-28 03:58:59,176 INFO L290 TraceCheckUtils]: 40: Hoare triple {52373#(<= 49940 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {52374#(<= 49938 main_~y~0)} is VALID [2022-04-28 03:58:59,176 INFO L290 TraceCheckUtils]: 41: Hoare triple {52374#(<= 49938 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {52375#(<= 49936 main_~y~0)} is VALID [2022-04-28 03:58:59,177 INFO L290 TraceCheckUtils]: 42: Hoare triple {52375#(<= 49936 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {52376#(<= 49934 main_~y~0)} is VALID [2022-04-28 03:58:59,177 INFO L290 TraceCheckUtils]: 43: Hoare triple {52376#(<= 49934 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {52377#(<= 49932 main_~y~0)} is VALID [2022-04-28 03:58:59,177 INFO L290 TraceCheckUtils]: 44: Hoare triple {52377#(<= 49932 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {52378#(<= 49930 main_~y~0)} is VALID [2022-04-28 03:58:59,178 INFO L290 TraceCheckUtils]: 45: Hoare triple {52378#(<= 49930 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {52379#(<= 49928 main_~y~0)} is VALID [2022-04-28 03:58:59,178 INFO L290 TraceCheckUtils]: 46: Hoare triple {52379#(<= 49928 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {52380#(<= 49926 main_~y~0)} is VALID [2022-04-28 03:58:59,179 INFO L290 TraceCheckUtils]: 47: Hoare triple {52380#(<= 49926 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {52381#(<= 49924 main_~y~0)} is VALID [2022-04-28 03:58:59,179 INFO L290 TraceCheckUtils]: 48: Hoare triple {52381#(<= 49924 main_~y~0)} assume !(~y~0 > 0); {52336#false} is VALID [2022-04-28 03:58:59,179 INFO L272 TraceCheckUtils]: 49: Hoare triple {52336#false} call __VERIFIER_assert((if ~z~0 == ~x~0 then 1 else 0)); {52336#false} is VALID [2022-04-28 03:58:59,179 INFO L290 TraceCheckUtils]: 50: Hoare triple {52336#false} ~cond := #in~cond; {52336#false} is VALID [2022-04-28 03:58:59,179 INFO L290 TraceCheckUtils]: 51: Hoare triple {52336#false} assume 0 == ~cond; {52336#false} is VALID [2022-04-28 03:58:59,179 INFO L290 TraceCheckUtils]: 52: Hoare triple {52336#false} assume !false; {52336#false} is VALID [2022-04-28 03:58:59,180 INFO L134 CoverageAnalysis]: Checked inductivity of 743 backedges. 0 proven. 743 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 03:58:59,180 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 03:58:59,180 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1955682599] [2022-04-28 03:58:59,180 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1955682599] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 03:58:59,180 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [822440762] [2022-04-28 03:58:59,180 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:58:59,180 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 03:58:59,180 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 03:58:59,181 INFO L229 MonitoredProcess]: Starting monitored process 39 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 03:58:59,182 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (39)] Waiting until timeout for monitored process [2022-04-28 03:58:59,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:58:59,236 INFO L263 TraceCheckSpWp]: Trace formula consists of 249 conjuncts, 41 conjunts are in the unsatisfiable core [2022-04-28 03:58:59,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:58:59,258 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 03:58:59,739 INFO L272 TraceCheckUtils]: 0: Hoare triple {52335#true} call ULTIMATE.init(); {52335#true} is VALID [2022-04-28 03:58:59,739 INFO L290 TraceCheckUtils]: 1: Hoare triple {52335#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); {52335#true} is VALID [2022-04-28 03:58:59,739 INFO L290 TraceCheckUtils]: 2: Hoare triple {52335#true} assume true; {52335#true} is VALID [2022-04-28 03:58:59,740 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {52335#true} {52335#true} #52#return; {52335#true} is VALID [2022-04-28 03:58:59,740 INFO L272 TraceCheckUtils]: 4: Hoare triple {52335#true} call #t~ret7 := main(); {52335#true} is VALID [2022-04-28 03:58:59,740 INFO L290 TraceCheckUtils]: 5: Hoare triple {52335#true} ~x~0 := 0;~y~0 := 50000;~z~0 := 0;~x~0 := 0; {52343#(<= 50000 main_~y~0)} is VALID [2022-04-28 03:58:59,740 INFO L290 TraceCheckUtils]: 6: Hoare triple {52343#(<= 50000 main_~y~0)} [208] L11-2-->L18-1_primed: Formula: (let ((.cse0 (= v_main_~x~0_2659 v_main_~x~0_2658))) (or (and (< v_main_~x~0_2658 50001) (< v_main_~x~0_2659 v_main_~x~0_2658)) (and .cse0 (= |v_main_#t~post4_240| |v_main_#t~post4_239|)) (and .cse0 (not (< v_main_~x~0_2659 50000)) (= |v_main_#t~post4_239| |v_main_#t~post4_240|)))) InVars {main_~x~0=v_main_~x~0_2659, main_#t~post4=|v_main_#t~post4_240|} OutVars{main_~x~0=v_main_~x~0_2658, main_#t~post4=|v_main_#t~post4_239|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {52343#(<= 50000 main_~y~0)} is VALID [2022-04-28 03:58:59,740 INFO L290 TraceCheckUtils]: 7: Hoare triple {52343#(<= 50000 main_~y~0)} [209] L18-1_primed-->L11-2: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {52343#(<= 50000 main_~y~0)} is VALID [2022-04-28 03:58:59,741 INFO L290 TraceCheckUtils]: 8: Hoare triple {52343#(<= 50000 main_~y~0)} [210] L11-2-->L18-1_primed: Formula: (let ((.cse4 (<= 50000 v_main_~x~0_2661)) (.cse0 (= |v_main_#t~post6_263| |v_main_#t~post6_262|)) (.cse1 (= v_main_~y~0_3044 v_main_~y~0_3043)) (.cse2 (= v_main_~x~0_2661 v_main_~x~0_2660)) (.cse3 (= |v_main_#t~post5_263| |v_main_#t~post5_262|))) (or (and .cse0 .cse1 .cse2 .cse3 (or (not .cse4) (not (< v_main_~x~0_2661 1000000)))) (and (< v_main_~x~0_2660 1000001) (= (+ v_main_~x~0_2661 v_main_~y~0_3043) (+ v_main_~x~0_2660 v_main_~y~0_3044)) .cse4 (< v_main_~x~0_2661 v_main_~x~0_2660)) (and .cse0 .cse1 .cse2 .cse3))) InVars {main_~y~0=v_main_~y~0_3044, main_#t~post5=|v_main_#t~post5_263|, main_~x~0=v_main_~x~0_2661, main_#t~post6=|v_main_#t~post6_263|} OutVars{main_~y~0=v_main_~y~0_3043, main_#t~post5=|v_main_#t~post5_262|, main_~x~0=v_main_~x~0_2660, main_#t~post6=|v_main_#t~post6_262|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {52343#(<= 50000 main_~y~0)} is VALID [2022-04-28 03:58:59,741 INFO L290 TraceCheckUtils]: 9: Hoare triple {52343#(<= 50000 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[] {52343#(<= 50000 main_~y~0)} is VALID [2022-04-28 03:58:59,742 INFO L290 TraceCheckUtils]: 10: Hoare triple {52343#(<= 50000 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {52344#(<= 49998 main_~y~0)} is VALID [2022-04-28 03:58:59,742 INFO L290 TraceCheckUtils]: 11: Hoare triple {52344#(<= 49998 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {52345#(<= 49996 main_~y~0)} is VALID [2022-04-28 03:58:59,743 INFO L290 TraceCheckUtils]: 12: Hoare triple {52345#(<= 49996 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {52346#(<= 49994 main_~y~0)} is VALID [2022-04-28 03:58:59,743 INFO L290 TraceCheckUtils]: 13: Hoare triple {52346#(<= 49994 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {52347#(<= 49992 main_~y~0)} is VALID [2022-04-28 03:58:59,743 INFO L290 TraceCheckUtils]: 14: Hoare triple {52347#(<= 49992 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {52348#(<= 49990 main_~y~0)} is VALID [2022-04-28 03:58:59,744 INFO L290 TraceCheckUtils]: 15: Hoare triple {52348#(<= 49990 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {52349#(<= 49988 main_~y~0)} is VALID [2022-04-28 03:58:59,744 INFO L290 TraceCheckUtils]: 16: Hoare triple {52349#(<= 49988 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {52350#(<= 49986 main_~y~0)} is VALID [2022-04-28 03:58:59,745 INFO L290 TraceCheckUtils]: 17: Hoare triple {52350#(<= 49986 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {52351#(<= 49984 main_~y~0)} is VALID [2022-04-28 03:58:59,745 INFO L290 TraceCheckUtils]: 18: Hoare triple {52351#(<= 49984 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {52352#(<= 49982 main_~y~0)} is VALID [2022-04-28 03:58:59,746 INFO L290 TraceCheckUtils]: 19: Hoare triple {52352#(<= 49982 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {52353#(<= 49980 main_~y~0)} is VALID [2022-04-28 03:58:59,746 INFO L290 TraceCheckUtils]: 20: Hoare triple {52353#(<= 49980 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {52354#(<= 49978 main_~y~0)} is VALID [2022-04-28 03:58:59,746 INFO L290 TraceCheckUtils]: 21: Hoare triple {52354#(<= 49978 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {52355#(<= 49976 main_~y~0)} is VALID [2022-04-28 03:58:59,747 INFO L290 TraceCheckUtils]: 22: Hoare triple {52355#(<= 49976 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {52356#(<= 49974 main_~y~0)} is VALID [2022-04-28 03:58:59,747 INFO L290 TraceCheckUtils]: 23: Hoare triple {52356#(<= 49974 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {52357#(<= 49972 main_~y~0)} is VALID [2022-04-28 03:58:59,748 INFO L290 TraceCheckUtils]: 24: Hoare triple {52357#(<= 49972 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {52358#(<= 49970 main_~y~0)} is VALID [2022-04-28 03:58:59,748 INFO L290 TraceCheckUtils]: 25: Hoare triple {52358#(<= 49970 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {52359#(<= 49968 main_~y~0)} is VALID [2022-04-28 03:58:59,748 INFO L290 TraceCheckUtils]: 26: Hoare triple {52359#(<= 49968 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {52360#(<= 49966 main_~y~0)} is VALID [2022-04-28 03:58:59,749 INFO L290 TraceCheckUtils]: 27: Hoare triple {52360#(<= 49966 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {52361#(<= 49964 main_~y~0)} is VALID [2022-04-28 03:58:59,749 INFO L290 TraceCheckUtils]: 28: Hoare triple {52361#(<= 49964 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {52362#(<= 49962 main_~y~0)} is VALID [2022-04-28 03:58:59,750 INFO L290 TraceCheckUtils]: 29: Hoare triple {52362#(<= 49962 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {52363#(<= 49960 main_~y~0)} is VALID [2022-04-28 03:58:59,750 INFO L290 TraceCheckUtils]: 30: Hoare triple {52363#(<= 49960 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {52364#(<= 49958 main_~y~0)} is VALID [2022-04-28 03:58:59,751 INFO L290 TraceCheckUtils]: 31: Hoare triple {52364#(<= 49958 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {52365#(<= 49956 main_~y~0)} is VALID [2022-04-28 03:58:59,751 INFO L290 TraceCheckUtils]: 32: Hoare triple {52365#(<= 49956 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {52366#(<= 49954 main_~y~0)} is VALID [2022-04-28 03:58:59,751 INFO L290 TraceCheckUtils]: 33: Hoare triple {52366#(<= 49954 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {52367#(<= 49952 main_~y~0)} is VALID [2022-04-28 03:58:59,752 INFO L290 TraceCheckUtils]: 34: Hoare triple {52367#(<= 49952 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {52368#(<= 49950 main_~y~0)} is VALID [2022-04-28 03:58:59,752 INFO L290 TraceCheckUtils]: 35: Hoare triple {52368#(<= 49950 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {52369#(<= 49948 main_~y~0)} is VALID [2022-04-28 03:58:59,753 INFO L290 TraceCheckUtils]: 36: Hoare triple {52369#(<= 49948 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {52370#(<= 49946 main_~y~0)} is VALID [2022-04-28 03:58:59,753 INFO L290 TraceCheckUtils]: 37: Hoare triple {52370#(<= 49946 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {52371#(<= 49944 main_~y~0)} is VALID [2022-04-28 03:58:59,754 INFO L290 TraceCheckUtils]: 38: Hoare triple {52371#(<= 49944 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {52372#(<= 49942 main_~y~0)} is VALID [2022-04-28 03:58:59,754 INFO L290 TraceCheckUtils]: 39: Hoare triple {52372#(<= 49942 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {52373#(<= 49940 main_~y~0)} is VALID [2022-04-28 03:58:59,754 INFO L290 TraceCheckUtils]: 40: Hoare triple {52373#(<= 49940 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {52374#(<= 49938 main_~y~0)} is VALID [2022-04-28 03:58:59,755 INFO L290 TraceCheckUtils]: 41: Hoare triple {52374#(<= 49938 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {52375#(<= 49936 main_~y~0)} is VALID [2022-04-28 03:58:59,755 INFO L290 TraceCheckUtils]: 42: Hoare triple {52375#(<= 49936 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {52376#(<= 49934 main_~y~0)} is VALID [2022-04-28 03:58:59,756 INFO L290 TraceCheckUtils]: 43: Hoare triple {52376#(<= 49934 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {52377#(<= 49932 main_~y~0)} is VALID [2022-04-28 03:58:59,756 INFO L290 TraceCheckUtils]: 44: Hoare triple {52377#(<= 49932 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {52378#(<= 49930 main_~y~0)} is VALID [2022-04-28 03:58:59,756 INFO L290 TraceCheckUtils]: 45: Hoare triple {52378#(<= 49930 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {52379#(<= 49928 main_~y~0)} is VALID [2022-04-28 03:58:59,757 INFO L290 TraceCheckUtils]: 46: Hoare triple {52379#(<= 49928 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {52380#(<= 49926 main_~y~0)} is VALID [2022-04-28 03:58:59,757 INFO L290 TraceCheckUtils]: 47: Hoare triple {52380#(<= 49926 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {52381#(<= 49924 main_~y~0)} is VALID [2022-04-28 03:58:59,758 INFO L290 TraceCheckUtils]: 48: Hoare triple {52381#(<= 49924 main_~y~0)} assume !(~y~0 > 0); {52336#false} is VALID [2022-04-28 03:58:59,758 INFO L272 TraceCheckUtils]: 49: Hoare triple {52336#false} call __VERIFIER_assert((if ~z~0 == ~x~0 then 1 else 0)); {52336#false} is VALID [2022-04-28 03:58:59,758 INFO L290 TraceCheckUtils]: 50: Hoare triple {52336#false} ~cond := #in~cond; {52336#false} is VALID [2022-04-28 03:58:59,758 INFO L290 TraceCheckUtils]: 51: Hoare triple {52336#false} assume 0 == ~cond; {52336#false} is VALID [2022-04-28 03:58:59,758 INFO L290 TraceCheckUtils]: 52: Hoare triple {52336#false} assume !false; {52336#false} is VALID [2022-04-28 03:58:59,758 INFO L134 CoverageAnalysis]: Checked inductivity of 743 backedges. 0 proven. 741 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-04-28 03:58:59,758 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 03:59:01,812 INFO L290 TraceCheckUtils]: 52: Hoare triple {52336#false} assume !false; {52336#false} is VALID [2022-04-28 03:59:01,812 INFO L290 TraceCheckUtils]: 51: Hoare triple {52336#false} assume 0 == ~cond; {52336#false} is VALID [2022-04-28 03:59:01,812 INFO L290 TraceCheckUtils]: 50: Hoare triple {52336#false} ~cond := #in~cond; {52336#false} is VALID [2022-04-28 03:59:01,812 INFO L272 TraceCheckUtils]: 49: Hoare triple {52336#false} call __VERIFIER_assert((if ~z~0 == ~x~0 then 1 else 0)); {52336#false} is VALID [2022-04-28 03:59:01,812 INFO L290 TraceCheckUtils]: 48: Hoare triple {52554#(< 0 main_~y~0)} assume !(~y~0 > 0); {52336#false} is VALID [2022-04-28 03:59:01,813 INFO L290 TraceCheckUtils]: 47: Hoare triple {52558#(< 2 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {52554#(< 0 main_~y~0)} is VALID [2022-04-28 03:59:01,813 INFO L290 TraceCheckUtils]: 46: Hoare triple {52562#(< 4 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {52558#(< 2 main_~y~0)} is VALID [2022-04-28 03:59:01,814 INFO L290 TraceCheckUtils]: 45: Hoare triple {52566#(< 6 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {52562#(< 4 main_~y~0)} is VALID [2022-04-28 03:59:01,814 INFO L290 TraceCheckUtils]: 44: Hoare triple {52570#(< 8 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {52566#(< 6 main_~y~0)} is VALID [2022-04-28 03:59:01,814 INFO L290 TraceCheckUtils]: 43: Hoare triple {52574#(< 10 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {52570#(< 8 main_~y~0)} is VALID [2022-04-28 03:59:01,815 INFO L290 TraceCheckUtils]: 42: Hoare triple {52578#(< 12 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {52574#(< 10 main_~y~0)} is VALID [2022-04-28 03:59:01,815 INFO L290 TraceCheckUtils]: 41: Hoare triple {52582#(< 14 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {52578#(< 12 main_~y~0)} is VALID [2022-04-28 03:59:01,816 INFO L290 TraceCheckUtils]: 40: Hoare triple {52586#(< 16 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {52582#(< 14 main_~y~0)} is VALID [2022-04-28 03:59:01,816 INFO L290 TraceCheckUtils]: 39: Hoare triple {52590#(< 18 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {52586#(< 16 main_~y~0)} is VALID [2022-04-28 03:59:01,816 INFO L290 TraceCheckUtils]: 38: Hoare triple {52594#(< 20 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {52590#(< 18 main_~y~0)} is VALID [2022-04-28 03:59:01,817 INFO L290 TraceCheckUtils]: 37: Hoare triple {52598#(< 22 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {52594#(< 20 main_~y~0)} is VALID [2022-04-28 03:59:01,817 INFO L290 TraceCheckUtils]: 36: Hoare triple {52602#(< 24 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {52598#(< 22 main_~y~0)} is VALID [2022-04-28 03:59:01,818 INFO L290 TraceCheckUtils]: 35: Hoare triple {52606#(< 26 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {52602#(< 24 main_~y~0)} is VALID [2022-04-28 03:59:01,818 INFO L290 TraceCheckUtils]: 34: Hoare triple {52610#(< 28 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {52606#(< 26 main_~y~0)} is VALID [2022-04-28 03:59:01,819 INFO L290 TraceCheckUtils]: 33: Hoare triple {52614#(< 30 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {52610#(< 28 main_~y~0)} is VALID [2022-04-28 03:59:01,819 INFO L290 TraceCheckUtils]: 32: Hoare triple {52618#(< 32 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {52614#(< 30 main_~y~0)} is VALID [2022-04-28 03:59:01,819 INFO L290 TraceCheckUtils]: 31: Hoare triple {52622#(< 34 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {52618#(< 32 main_~y~0)} is VALID [2022-04-28 03:59:01,820 INFO L290 TraceCheckUtils]: 30: Hoare triple {52626#(< 36 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {52622#(< 34 main_~y~0)} is VALID [2022-04-28 03:59:01,820 INFO L290 TraceCheckUtils]: 29: Hoare triple {52630#(< 38 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {52626#(< 36 main_~y~0)} is VALID [2022-04-28 03:59:01,821 INFO L290 TraceCheckUtils]: 28: Hoare triple {52634#(< 40 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {52630#(< 38 main_~y~0)} is VALID [2022-04-28 03:59:01,821 INFO L290 TraceCheckUtils]: 27: Hoare triple {52638#(< 42 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {52634#(< 40 main_~y~0)} is VALID [2022-04-28 03:59:01,821 INFO L290 TraceCheckUtils]: 26: Hoare triple {52642#(< 44 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {52638#(< 42 main_~y~0)} is VALID [2022-04-28 03:59:01,822 INFO L290 TraceCheckUtils]: 25: Hoare triple {52646#(< 46 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {52642#(< 44 main_~y~0)} is VALID [2022-04-28 03:59:01,822 INFO L290 TraceCheckUtils]: 24: Hoare triple {52650#(< 48 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {52646#(< 46 main_~y~0)} is VALID [2022-04-28 03:59:01,823 INFO L290 TraceCheckUtils]: 23: Hoare triple {52654#(< 50 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {52650#(< 48 main_~y~0)} is VALID [2022-04-28 03:59:01,823 INFO L290 TraceCheckUtils]: 22: Hoare triple {52658#(< 52 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {52654#(< 50 main_~y~0)} is VALID [2022-04-28 03:59:01,823 INFO L290 TraceCheckUtils]: 21: Hoare triple {52662#(< 54 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {52658#(< 52 main_~y~0)} is VALID [2022-04-28 03:59:01,824 INFO L290 TraceCheckUtils]: 20: Hoare triple {52666#(< 56 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {52662#(< 54 main_~y~0)} is VALID [2022-04-28 03:59:01,824 INFO L290 TraceCheckUtils]: 19: Hoare triple {52670#(< 58 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {52666#(< 56 main_~y~0)} is VALID [2022-04-28 03:59:01,825 INFO L290 TraceCheckUtils]: 18: Hoare triple {52674#(< 60 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {52670#(< 58 main_~y~0)} is VALID [2022-04-28 03:59:01,825 INFO L290 TraceCheckUtils]: 17: Hoare triple {52678#(< 62 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {52674#(< 60 main_~y~0)} is VALID [2022-04-28 03:59:01,826 INFO L290 TraceCheckUtils]: 16: Hoare triple {52682#(< 64 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {52678#(< 62 main_~y~0)} is VALID [2022-04-28 03:59:01,826 INFO L290 TraceCheckUtils]: 15: Hoare triple {52686#(< 66 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {52682#(< 64 main_~y~0)} is VALID [2022-04-28 03:59:01,826 INFO L290 TraceCheckUtils]: 14: Hoare triple {52690#(< 68 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {52686#(< 66 main_~y~0)} is VALID [2022-04-28 03:59:01,827 INFO L290 TraceCheckUtils]: 13: Hoare triple {52694#(< 70 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {52690#(< 68 main_~y~0)} is VALID [2022-04-28 03:59:01,827 INFO L290 TraceCheckUtils]: 12: Hoare triple {52698#(< 72 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {52694#(< 70 main_~y~0)} is VALID [2022-04-28 03:59:01,828 INFO L290 TraceCheckUtils]: 11: Hoare triple {52702#(< 74 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {52698#(< 72 main_~y~0)} is VALID [2022-04-28 03:59:01,828 INFO L290 TraceCheckUtils]: 10: Hoare triple {52706#(< 76 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {52702#(< 74 main_~y~0)} is VALID [2022-04-28 03:59:01,828 INFO L290 TraceCheckUtils]: 9: Hoare triple {52706#(< 76 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[] {52706#(< 76 main_~y~0)} is VALID [2022-04-28 03:59:01,829 INFO L290 TraceCheckUtils]: 8: Hoare triple {52706#(< 76 main_~y~0)} [210] L11-2-->L18-1_primed: Formula: (let ((.cse4 (<= 50000 v_main_~x~0_2661)) (.cse0 (= |v_main_#t~post6_263| |v_main_#t~post6_262|)) (.cse1 (= v_main_~y~0_3044 v_main_~y~0_3043)) (.cse2 (= v_main_~x~0_2661 v_main_~x~0_2660)) (.cse3 (= |v_main_#t~post5_263| |v_main_#t~post5_262|))) (or (and .cse0 .cse1 .cse2 .cse3 (or (not .cse4) (not (< v_main_~x~0_2661 1000000)))) (and (< v_main_~x~0_2660 1000001) (= (+ v_main_~x~0_2661 v_main_~y~0_3043) (+ v_main_~x~0_2660 v_main_~y~0_3044)) .cse4 (< v_main_~x~0_2661 v_main_~x~0_2660)) (and .cse0 .cse1 .cse2 .cse3))) InVars {main_~y~0=v_main_~y~0_3044, main_#t~post5=|v_main_#t~post5_263|, main_~x~0=v_main_~x~0_2661, main_#t~post6=|v_main_#t~post6_263|} OutVars{main_~y~0=v_main_~y~0_3043, main_#t~post5=|v_main_#t~post5_262|, main_~x~0=v_main_~x~0_2660, main_#t~post6=|v_main_#t~post6_262|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {52706#(< 76 main_~y~0)} is VALID [2022-04-28 03:59:01,829 INFO L290 TraceCheckUtils]: 7: Hoare triple {52706#(< 76 main_~y~0)} [209] L18-1_primed-->L11-2: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {52706#(< 76 main_~y~0)} is VALID [2022-04-28 03:59:01,830 INFO L290 TraceCheckUtils]: 6: Hoare triple {52706#(< 76 main_~y~0)} [208] L11-2-->L18-1_primed: Formula: (let ((.cse0 (= v_main_~x~0_2659 v_main_~x~0_2658))) (or (and (< v_main_~x~0_2658 50001) (< v_main_~x~0_2659 v_main_~x~0_2658)) (and .cse0 (= |v_main_#t~post4_240| |v_main_#t~post4_239|)) (and .cse0 (not (< v_main_~x~0_2659 50000)) (= |v_main_#t~post4_239| |v_main_#t~post4_240|)))) InVars {main_~x~0=v_main_~x~0_2659, main_#t~post4=|v_main_#t~post4_240|} OutVars{main_~x~0=v_main_~x~0_2658, main_#t~post4=|v_main_#t~post4_239|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {52706#(< 76 main_~y~0)} is VALID [2022-04-28 03:59:01,830 INFO L290 TraceCheckUtils]: 5: Hoare triple {52335#true} ~x~0 := 0;~y~0 := 50000;~z~0 := 0;~x~0 := 0; {52706#(< 76 main_~y~0)} is VALID [2022-04-28 03:59:01,830 INFO L272 TraceCheckUtils]: 4: Hoare triple {52335#true} call #t~ret7 := main(); {52335#true} is VALID [2022-04-28 03:59:01,830 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {52335#true} {52335#true} #52#return; {52335#true} is VALID [2022-04-28 03:59:01,830 INFO L290 TraceCheckUtils]: 2: Hoare triple {52335#true} assume true; {52335#true} is VALID [2022-04-28 03:59:01,830 INFO L290 TraceCheckUtils]: 1: Hoare triple {52335#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); {52335#true} is VALID [2022-04-28 03:59:01,830 INFO L272 TraceCheckUtils]: 0: Hoare triple {52335#true} call ULTIMATE.init(); {52335#true} is VALID [2022-04-28 03:59:01,831 INFO L134 CoverageAnalysis]: Checked inductivity of 743 backedges. 0 proven. 741 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-04-28 03:59:01,831 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [822440762] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 03:59:01,831 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 03:59:01,831 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [45, 41, 41] total 84 [2022-04-28 03:59:05,438 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 03:59:05,438 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1125762213] [2022-04-28 03:59:05,438 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1125762213] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 03:59:05,438 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 03:59:05,438 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [113] imperfect sequences [] total 113 [2022-04-28 03:59:05,438 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1066400184] [2022-04-28 03:59:05,438 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 03:59:05,439 INFO L78 Accepts]: Start accepts. Automaton has has 113 states, 113 states have (on average 1.6460176991150441) internal successors, (186), 112 states have internal predecessors, (186), 2 states have call successors, (3), 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 190 [2022-04-28 03:59:05,439 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 03:59:05,439 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 113 states, 113 states have (on average 1.6460176991150441) internal successors, (186), 112 states have internal predecessors, (186), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:59:05,592 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 190 edges. 190 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 03:59:05,593 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 113 states [2022-04-28 03:59:05,593 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 03:59:05,594 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 113 interpolants. [2022-04-28 03:59:05,596 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9152, Invalid=14718, Unknown=0, NotChecked=0, Total=23870 [2022-04-28 03:59:05,596 INFO L87 Difference]: Start difference. First operand 191 states and 194 transitions. Second operand has 113 states, 113 states have (on average 1.6460176991150441) internal successors, (186), 112 states have internal predecessors, (186), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:59:26,118 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:59:26,118 INFO L93 Difference]: Finished difference Result 515 states and 526 transitions. [2022-04-28 03:59:26,118 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 113 states. [2022-04-28 03:59:26,119 INFO L78 Accepts]: Start accepts. Automaton has has 113 states, 113 states have (on average 1.6460176991150441) internal successors, (186), 112 states have internal predecessors, (186), 2 states have call successors, (3), 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 190 [2022-04-28 03:59:26,119 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 03:59:26,119 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 113 states, 113 states have (on average 1.6460176991150441) internal successors, (186), 112 states have internal predecessors, (186), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:59:26,120 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 212 transitions. [2022-04-28 03:59:26,120 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 113 states, 113 states have (on average 1.6460176991150441) internal successors, (186), 112 states have internal predecessors, (186), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:59:26,121 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 212 transitions. [2022-04-28 03:59:26,122 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 113 states and 212 transitions. [2022-04-28 03:59:26,282 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 212 edges. 212 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 03:59:26,286 INFO L225 Difference]: With dead ends: 515 [2022-04-28 03:59:26,286 INFO L226 Difference]: Without dead ends: 332 [2022-04-28 03:59:26,291 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 406 GetRequests, 142 SyntacticMatches, 1 SemanticMatches, 263 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20613 ImplicationChecksByTransitivity, 9.7s TimeCoverageRelationStatistics Valid=21047, Invalid=48913, Unknown=0, NotChecked=0, Total=69960 [2022-04-28 03:59:26,291 INFO L413 NwaCegarLoop]: 12 mSDtfsCounter, 297 mSDsluCounter, 42 mSDsCounter, 0 mSdLazyCounter, 10440 mSolverCounterSat, 335 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 8.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 297 SdHoareTripleChecker+Valid, 54 SdHoareTripleChecker+Invalid, 10775 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 335 IncrementalHoareTripleChecker+Valid, 10440 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 8.3s IncrementalHoareTripleChecker+Time [2022-04-28 03:59:26,291 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [297 Valid, 54 Invalid, 10775 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [335 Valid, 10440 Invalid, 0 Unknown, 0 Unchecked, 8.3s Time] [2022-04-28 03:59:26,291 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 332 states. [2022-04-28 03:59:26,861 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 332 to 332. [2022-04-28 03:59:26,861 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 03:59:26,861 INFO L82 GeneralOperation]: Start isEquivalent. First operand 332 states. Second operand has 332 states, 327 states have (on average 1.0152905198776758) internal successors, (332), 327 states have internal predecessors, (332), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:59:26,861 INFO L74 IsIncluded]: Start isIncluded. First operand 332 states. Second operand has 332 states, 327 states have (on average 1.0152905198776758) internal successors, (332), 327 states have internal predecessors, (332), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:59:26,862 INFO L87 Difference]: Start difference. First operand 332 states. Second operand has 332 states, 327 states have (on average 1.0152905198776758) internal successors, (332), 327 states have internal predecessors, (332), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:59:26,870 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:59:26,870 INFO L93 Difference]: Finished difference Result 332 states and 336 transitions. [2022-04-28 03:59:26,870 INFO L276 IsEmpty]: Start isEmpty. Operand 332 states and 336 transitions. [2022-04-28 03:59:26,870 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:59:26,870 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:59:26,871 INFO L74 IsIncluded]: Start isIncluded. First operand has 332 states, 327 states have (on average 1.0152905198776758) internal successors, (332), 327 states have internal predecessors, (332), 3 states have call successors, (3), 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 332 states. [2022-04-28 03:59:26,871 INFO L87 Difference]: Start difference. First operand has 332 states, 327 states have (on average 1.0152905198776758) internal successors, (332), 327 states have internal predecessors, (332), 3 states have call successors, (3), 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 332 states. [2022-04-28 03:59:26,874 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:59:26,874 INFO L93 Difference]: Finished difference Result 332 states and 336 transitions. [2022-04-28 03:59:26,874 INFO L276 IsEmpty]: Start isEmpty. Operand 332 states and 336 transitions. [2022-04-28 03:59:26,874 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:59:26,874 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:59:26,874 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 03:59:26,874 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 03:59:26,875 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 332 states, 327 states have (on average 1.0152905198776758) internal successors, (332), 327 states have internal predecessors, (332), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:59:26,879 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 332 states to 332 states and 336 transitions. [2022-04-28 03:59:26,879 INFO L78 Accepts]: Start accepts. Automaton has 332 states and 336 transitions. Word has length 190 [2022-04-28 03:59:26,879 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 03:59:26,879 INFO L495 AbstractCegarLoop]: Abstraction has 332 states and 336 transitions. [2022-04-28 03:59:26,879 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 113 states, 113 states have (on average 1.6460176991150441) internal successors, (186), 112 states have internal predecessors, (186), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:59:26,879 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 332 states and 336 transitions. [2022-04-28 03:59:27,141 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 336 edges. 336 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 03:59:27,142 INFO L276 IsEmpty]: Start isEmpty. Operand 332 states and 336 transitions. [2022-04-28 03:59:27,142 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 194 [2022-04-28 03:59:27,142 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 03:59:27,143 INFO L195 NwaCegarLoop]: trace histogram [71, 70, 39, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 03:59:27,162 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-28 03:59:27,343 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 39 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable40 [2022-04-28 03:59:27,343 INFO L420 AbstractCegarLoop]: === Iteration 42 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 03:59:27,343 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 03:59:27,343 INFO L85 PathProgramCache]: Analyzing trace with hash -410416277, now seen corresponding path program 39 times [2022-04-28 03:59:27,344 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 03:59:27,344 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [210218337] [2022-04-28 03:59:27,451 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 1 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 03:59:31,569 WARN L977 rdanLoopAcceleration]: Unable to prove correctness of quantifier elimination. [2022-04-28 03:59:31,668 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={1=1, 2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 03:59:31,669 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-28 03:59:31,671 INFO L85 PathProgramCache]: Analyzing trace with hash 1698597410, now seen corresponding path program 1 times [2022-04-28 03:59:31,671 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 03:59:31,671 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1637210768] [2022-04-28 03:59:31,671 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:59:31,671 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 03:59:31,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:59:32,392 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 03:59:32,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:59:32,396 INFO L290 TraceCheckUtils]: 0: Hoare triple {55433#(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); {55388#true} is VALID [2022-04-28 03:59:32,396 INFO L290 TraceCheckUtils]: 1: Hoare triple {55388#true} assume true; {55388#true} is VALID [2022-04-28 03:59:32,396 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {55388#true} {55388#true} #52#return; {55388#true} is VALID [2022-04-28 03:59:32,396 INFO L272 TraceCheckUtils]: 0: Hoare triple {55388#true} call ULTIMATE.init(); {55433#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 03:59:32,397 INFO L290 TraceCheckUtils]: 1: Hoare triple {55433#(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); {55388#true} is VALID [2022-04-28 03:59:32,397 INFO L290 TraceCheckUtils]: 2: Hoare triple {55388#true} assume true; {55388#true} is VALID [2022-04-28 03:59:32,397 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {55388#true} {55388#true} #52#return; {55388#true} is VALID [2022-04-28 03:59:32,397 INFO L272 TraceCheckUtils]: 4: Hoare triple {55388#true} call #t~ret7 := main(); {55388#true} is VALID [2022-04-28 03:59:32,397 INFO L290 TraceCheckUtils]: 5: Hoare triple {55388#true} ~x~0 := 0;~y~0 := 50000;~z~0 := 0;~x~0 := 0; {55393#(<= 50000 main_~y~0)} is VALID [2022-04-28 03:59:32,397 INFO L290 TraceCheckUtils]: 6: Hoare triple {55393#(<= 50000 main_~y~0)} [212] L11-2-->L18-1_primed: Formula: (let ((.cse0 (= v_main_~x~0_2783 v_main_~x~0_2782)) (.cse1 (= |v_main_#t~post4_246| |v_main_#t~post4_245|))) (or (and .cse0 .cse1 (not (< v_main_~x~0_2783 50000))) (and .cse0 .cse1) (and (< v_main_~x~0_2783 v_main_~x~0_2782) (< v_main_~x~0_2782 50001)))) InVars {main_~x~0=v_main_~x~0_2783, main_#t~post4=|v_main_#t~post4_246|} OutVars{main_~x~0=v_main_~x~0_2782, main_#t~post4=|v_main_#t~post4_245|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {55393#(<= 50000 main_~y~0)} is VALID [2022-04-28 03:59:32,398 INFO L290 TraceCheckUtils]: 7: Hoare triple {55393#(<= 50000 main_~y~0)} [213] L18-1_primed-->L11-2: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {55393#(<= 50000 main_~y~0)} is VALID [2022-04-28 03:59:32,398 INFO L290 TraceCheckUtils]: 8: Hoare triple {55393#(<= 50000 main_~y~0)} [214] L11-2-->L18-1_primed: Formula: (let ((.cse0 (= v_main_~y~0_3198 v_main_~y~0_3197)) (.cse1 (= v_main_~x~0_2785 v_main_~x~0_2784)) (.cse2 (= |v_main_#t~post6_270| |v_main_#t~post6_269|)) (.cse4 (<= 50000 v_main_~x~0_2785)) (.cse3 (= |v_main_#t~post5_270| |v_main_#t~post5_269|))) (or (and .cse0 .cse1 .cse2 .cse3) (and (< v_main_~x~0_2784 1000001) (< v_main_~x~0_2785 v_main_~x~0_2784) .cse4 (= (+ v_main_~x~0_2785 v_main_~y~0_3197) (+ v_main_~x~0_2784 v_main_~y~0_3198))) (and .cse0 .cse1 .cse2 (or (not (< v_main_~x~0_2785 1000000)) (not .cse4)) .cse3))) InVars {main_~y~0=v_main_~y~0_3198, main_#t~post5=|v_main_#t~post5_270|, main_~x~0=v_main_~x~0_2785, main_#t~post6=|v_main_#t~post6_270|} OutVars{main_~y~0=v_main_~y~0_3197, main_#t~post5=|v_main_#t~post5_269|, main_~x~0=v_main_~x~0_2784, main_#t~post6=|v_main_#t~post6_269|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {55393#(<= 50000 main_~y~0)} is VALID [2022-04-28 03:59:32,399 INFO L290 TraceCheckUtils]: 9: Hoare triple {55393#(<= 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[] {55393#(<= 50000 main_~y~0)} is VALID [2022-04-28 03:59:32,399 INFO L290 TraceCheckUtils]: 10: Hoare triple {55393#(<= 50000 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {55394#(<= 49998 main_~y~0)} is VALID [2022-04-28 03:59:32,399 INFO L290 TraceCheckUtils]: 11: Hoare triple {55394#(<= 49998 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {55395#(<= 49996 main_~y~0)} is VALID [2022-04-28 03:59:32,400 INFO L290 TraceCheckUtils]: 12: Hoare triple {55395#(<= 49996 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {55396#(<= 49994 main_~y~0)} is VALID [2022-04-28 03:59:32,400 INFO L290 TraceCheckUtils]: 13: Hoare triple {55396#(<= 49994 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {55397#(<= 49992 main_~y~0)} is VALID [2022-04-28 03:59:32,401 INFO L290 TraceCheckUtils]: 14: Hoare triple {55397#(<= 49992 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {55398#(<= 49990 main_~y~0)} is VALID [2022-04-28 03:59:32,401 INFO L290 TraceCheckUtils]: 15: Hoare triple {55398#(<= 49990 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {55399#(<= 49988 main_~y~0)} is VALID [2022-04-28 03:59:32,402 INFO L290 TraceCheckUtils]: 16: Hoare triple {55399#(<= 49988 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {55400#(<= 49986 main_~y~0)} is VALID [2022-04-28 03:59:32,402 INFO L290 TraceCheckUtils]: 17: Hoare triple {55400#(<= 49986 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {55401#(<= 49984 main_~y~0)} is VALID [2022-04-28 03:59:32,402 INFO L290 TraceCheckUtils]: 18: Hoare triple {55401#(<= 49984 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {55402#(<= 49982 main_~y~0)} is VALID [2022-04-28 03:59:32,403 INFO L290 TraceCheckUtils]: 19: Hoare triple {55402#(<= 49982 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {55403#(<= 49980 main_~y~0)} is VALID [2022-04-28 03:59:32,403 INFO L290 TraceCheckUtils]: 20: Hoare triple {55403#(<= 49980 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {55404#(<= 49978 main_~y~0)} is VALID [2022-04-28 03:59:32,404 INFO L290 TraceCheckUtils]: 21: Hoare triple {55404#(<= 49978 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {55405#(<= 49976 main_~y~0)} is VALID [2022-04-28 03:59:32,404 INFO L290 TraceCheckUtils]: 22: Hoare triple {55405#(<= 49976 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {55406#(<= 49974 main_~y~0)} is VALID [2022-04-28 03:59:32,405 INFO L290 TraceCheckUtils]: 23: Hoare triple {55406#(<= 49974 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {55407#(<= 49972 main_~y~0)} is VALID [2022-04-28 03:59:32,405 INFO L290 TraceCheckUtils]: 24: Hoare triple {55407#(<= 49972 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {55408#(<= 49970 main_~y~0)} is VALID [2022-04-28 03:59:32,405 INFO L290 TraceCheckUtils]: 25: Hoare triple {55408#(<= 49970 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {55409#(<= 49968 main_~y~0)} is VALID [2022-04-28 03:59:32,406 INFO L290 TraceCheckUtils]: 26: Hoare triple {55409#(<= 49968 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {55410#(<= 49966 main_~y~0)} is VALID [2022-04-28 03:59:32,406 INFO L290 TraceCheckUtils]: 27: Hoare triple {55410#(<= 49966 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {55411#(<= 49964 main_~y~0)} is VALID [2022-04-28 03:59:32,407 INFO L290 TraceCheckUtils]: 28: Hoare triple {55411#(<= 49964 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {55412#(<= 49962 main_~y~0)} is VALID [2022-04-28 03:59:32,407 INFO L290 TraceCheckUtils]: 29: Hoare triple {55412#(<= 49962 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {55413#(<= 49960 main_~y~0)} is VALID [2022-04-28 03:59:32,407 INFO L290 TraceCheckUtils]: 30: Hoare triple {55413#(<= 49960 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {55414#(<= 49958 main_~y~0)} is VALID [2022-04-28 03:59:32,408 INFO L290 TraceCheckUtils]: 31: Hoare triple {55414#(<= 49958 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {55415#(<= 49956 main_~y~0)} is VALID [2022-04-28 03:59:32,408 INFO L290 TraceCheckUtils]: 32: Hoare triple {55415#(<= 49956 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {55416#(<= 49954 main_~y~0)} is VALID [2022-04-28 03:59:32,409 INFO L290 TraceCheckUtils]: 33: Hoare triple {55416#(<= 49954 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {55417#(<= 49952 main_~y~0)} is VALID [2022-04-28 03:59:32,409 INFO L290 TraceCheckUtils]: 34: Hoare triple {55417#(<= 49952 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {55418#(<= 49950 main_~y~0)} is VALID [2022-04-28 03:59:32,410 INFO L290 TraceCheckUtils]: 35: Hoare triple {55418#(<= 49950 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {55419#(<= 49948 main_~y~0)} is VALID [2022-04-28 03:59:32,410 INFO L290 TraceCheckUtils]: 36: Hoare triple {55419#(<= 49948 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {55420#(<= 49946 main_~y~0)} is VALID [2022-04-28 03:59:32,410 INFO L290 TraceCheckUtils]: 37: Hoare triple {55420#(<= 49946 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {55421#(<= 49944 main_~y~0)} is VALID [2022-04-28 03:59:32,411 INFO L290 TraceCheckUtils]: 38: Hoare triple {55421#(<= 49944 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {55422#(<= 49942 main_~y~0)} is VALID [2022-04-28 03:59:32,411 INFO L290 TraceCheckUtils]: 39: Hoare triple {55422#(<= 49942 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {55423#(<= 49940 main_~y~0)} is VALID [2022-04-28 03:59:32,412 INFO L290 TraceCheckUtils]: 40: Hoare triple {55423#(<= 49940 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {55424#(<= 49938 main_~y~0)} is VALID [2022-04-28 03:59:32,412 INFO L290 TraceCheckUtils]: 41: Hoare triple {55424#(<= 49938 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {55425#(<= 49936 main_~y~0)} is VALID [2022-04-28 03:59:32,412 INFO L290 TraceCheckUtils]: 42: Hoare triple {55425#(<= 49936 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {55426#(<= 49934 main_~y~0)} is VALID [2022-04-28 03:59:32,413 INFO L290 TraceCheckUtils]: 43: Hoare triple {55426#(<= 49934 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {55427#(<= 49932 main_~y~0)} is VALID [2022-04-28 03:59:32,413 INFO L290 TraceCheckUtils]: 44: Hoare triple {55427#(<= 49932 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {55428#(<= 49930 main_~y~0)} is VALID [2022-04-28 03:59:32,414 INFO L290 TraceCheckUtils]: 45: Hoare triple {55428#(<= 49930 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {55429#(<= 49928 main_~y~0)} is VALID [2022-04-28 03:59:32,414 INFO L290 TraceCheckUtils]: 46: Hoare triple {55429#(<= 49928 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {55430#(<= 49926 main_~y~0)} is VALID [2022-04-28 03:59:32,415 INFO L290 TraceCheckUtils]: 47: Hoare triple {55430#(<= 49926 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {55431#(<= 49924 main_~y~0)} is VALID [2022-04-28 03:59:32,415 INFO L290 TraceCheckUtils]: 48: Hoare triple {55431#(<= 49924 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {55432#(<= 49922 main_~y~0)} is VALID [2022-04-28 03:59:32,415 INFO L290 TraceCheckUtils]: 49: Hoare triple {55432#(<= 49922 main_~y~0)} assume !(~y~0 > 0); {55389#false} is VALID [2022-04-28 03:59:32,415 INFO L272 TraceCheckUtils]: 50: Hoare triple {55389#false} call __VERIFIER_assert((if ~z~0 == ~x~0 then 1 else 0)); {55389#false} is VALID [2022-04-28 03:59:32,416 INFO L290 TraceCheckUtils]: 51: Hoare triple {55389#false} ~cond := #in~cond; {55389#false} is VALID [2022-04-28 03:59:32,416 INFO L290 TraceCheckUtils]: 52: Hoare triple {55389#false} assume 0 == ~cond; {55389#false} is VALID [2022-04-28 03:59:32,416 INFO L290 TraceCheckUtils]: 53: Hoare triple {55389#false} assume !false; {55389#false} is VALID [2022-04-28 03:59:32,416 INFO L134 CoverageAnalysis]: Checked inductivity of 782 backedges. 0 proven. 780 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-04-28 03:59:32,416 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 03:59:32,416 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1637210768] [2022-04-28 03:59:32,416 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1637210768] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 03:59:32,416 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1637384254] [2022-04-28 03:59:32,416 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:59:32,416 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 03:59:32,416 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 03:59:32,417 INFO L229 MonitoredProcess]: Starting monitored process 40 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 03:59:32,418 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (40)] Waiting until timeout for monitored process [2022-04-28 03:59:32,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:59:32,471 INFO L263 TraceCheckSpWp]: Trace formula consists of 254 conjuncts, 45 conjunts are in the unsatisfiable core [2022-04-28 03:59:32,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:59:32,493 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 03:59:33,721 INFO L272 TraceCheckUtils]: 0: Hoare triple {55388#true} call ULTIMATE.init(); {55388#true} is VALID [2022-04-28 03:59:33,721 INFO L290 TraceCheckUtils]: 1: Hoare triple {55388#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); {55388#true} is VALID [2022-04-28 03:59:33,721 INFO L290 TraceCheckUtils]: 2: Hoare triple {55388#true} assume true; {55388#true} is VALID [2022-04-28 03:59:33,721 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {55388#true} {55388#true} #52#return; {55388#true} is VALID [2022-04-28 03:59:33,721 INFO L272 TraceCheckUtils]: 4: Hoare triple {55388#true} call #t~ret7 := main(); {55388#true} is VALID [2022-04-28 03:59:33,722 INFO L290 TraceCheckUtils]: 5: Hoare triple {55388#true} ~x~0 := 0;~y~0 := 50000;~z~0 := 0;~x~0 := 0; {55452#(and (<= main_~x~0 0) (<= 50000 main_~y~0))} is VALID [2022-04-28 03:59:33,722 INFO L290 TraceCheckUtils]: 6: Hoare triple {55452#(and (<= main_~x~0 0) (<= 50000 main_~y~0))} [212] L11-2-->L18-1_primed: Formula: (let ((.cse0 (= v_main_~x~0_2783 v_main_~x~0_2782)) (.cse1 (= |v_main_#t~post4_246| |v_main_#t~post4_245|))) (or (and .cse0 .cse1 (not (< v_main_~x~0_2783 50000))) (and .cse0 .cse1) (and (< v_main_~x~0_2783 v_main_~x~0_2782) (< v_main_~x~0_2782 50001)))) InVars {main_~x~0=v_main_~x~0_2783, main_#t~post4=|v_main_#t~post4_246|} OutVars{main_~x~0=v_main_~x~0_2782, main_#t~post4=|v_main_#t~post4_245|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {55456#(and (< main_~x~0 50001) (<= 50000 main_~y~0))} is VALID [2022-04-28 03:59:33,723 INFO L290 TraceCheckUtils]: 7: Hoare triple {55456#(and (< main_~x~0 50001) (<= 50000 main_~y~0))} [213] L18-1_primed-->L11-2: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {55456#(and (< main_~x~0 50001) (<= 50000 main_~y~0))} is VALID [2022-04-28 03:59:33,723 INFO L290 TraceCheckUtils]: 8: Hoare triple {55456#(and (< main_~x~0 50001) (<= 50000 main_~y~0))} [214] L11-2-->L18-1_primed: Formula: (let ((.cse0 (= v_main_~y~0_3198 v_main_~y~0_3197)) (.cse1 (= v_main_~x~0_2785 v_main_~x~0_2784)) (.cse2 (= |v_main_#t~post6_270| |v_main_#t~post6_269|)) (.cse4 (<= 50000 v_main_~x~0_2785)) (.cse3 (= |v_main_#t~post5_270| |v_main_#t~post5_269|))) (or (and .cse0 .cse1 .cse2 .cse3) (and (< v_main_~x~0_2784 1000001) (< v_main_~x~0_2785 v_main_~x~0_2784) .cse4 (= (+ v_main_~x~0_2785 v_main_~y~0_3197) (+ v_main_~x~0_2784 v_main_~y~0_3198))) (and .cse0 .cse1 .cse2 (or (not (< v_main_~x~0_2785 1000000)) (not .cse4)) .cse3))) InVars {main_~y~0=v_main_~y~0_3198, main_#t~post5=|v_main_#t~post5_270|, main_~x~0=v_main_~x~0_2785, main_#t~post6=|v_main_#t~post6_270|} OutVars{main_~y~0=v_main_~y~0_3197, main_#t~post5=|v_main_#t~post5_269|, main_~x~0=v_main_~x~0_2784, main_#t~post6=|v_main_#t~post6_269|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {55463#(or (and (< main_~x~0 50001) (<= 50000 main_~y~0)) (and (< main_~x~0 (+ main_~y~0 1)) (< main_~x~0 1000001) (< 50000 main_~x~0)))} is VALID [2022-04-28 03:59:33,724 INFO L290 TraceCheckUtils]: 9: Hoare triple {55463#(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)))} [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[] {55467#(< 999999 main_~y~0)} is VALID [2022-04-28 03:59:33,724 INFO L290 TraceCheckUtils]: 10: Hoare triple {55467#(< 999999 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {55471#(< 999997 main_~y~0)} is VALID [2022-04-28 03:59:33,725 INFO L290 TraceCheckUtils]: 11: Hoare triple {55471#(< 999997 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {55475#(< 999995 main_~y~0)} is VALID [2022-04-28 03:59:33,725 INFO L290 TraceCheckUtils]: 12: Hoare triple {55475#(< 999995 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {55479#(< 999993 main_~y~0)} is VALID [2022-04-28 03:59:33,726 INFO L290 TraceCheckUtils]: 13: Hoare triple {55479#(< 999993 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {55483#(< 999991 main_~y~0)} is VALID [2022-04-28 03:59:33,726 INFO L290 TraceCheckUtils]: 14: Hoare triple {55483#(< 999991 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {55487#(< 999989 main_~y~0)} is VALID [2022-04-28 03:59:33,726 INFO L290 TraceCheckUtils]: 15: Hoare triple {55487#(< 999989 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {55491#(< 999987 main_~y~0)} is VALID [2022-04-28 03:59:33,727 INFO L290 TraceCheckUtils]: 16: Hoare triple {55491#(< 999987 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {55495#(< 999985 main_~y~0)} is VALID [2022-04-28 03:59:33,727 INFO L290 TraceCheckUtils]: 17: Hoare triple {55495#(< 999985 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {55499#(< 999983 main_~y~0)} is VALID [2022-04-28 03:59:33,728 INFO L290 TraceCheckUtils]: 18: Hoare triple {55499#(< 999983 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {55503#(< 999981 main_~y~0)} is VALID [2022-04-28 03:59:33,728 INFO L290 TraceCheckUtils]: 19: Hoare triple {55503#(< 999981 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {55507#(< 999979 main_~y~0)} is VALID [2022-04-28 03:59:33,728 INFO L290 TraceCheckUtils]: 20: Hoare triple {55507#(< 999979 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {55511#(< 999977 main_~y~0)} is VALID [2022-04-28 03:59:33,729 INFO L290 TraceCheckUtils]: 21: Hoare triple {55511#(< 999977 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {55515#(< 999975 main_~y~0)} is VALID [2022-04-28 03:59:33,729 INFO L290 TraceCheckUtils]: 22: Hoare triple {55515#(< 999975 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {55519#(< 999973 main_~y~0)} is VALID [2022-04-28 03:59:33,730 INFO L290 TraceCheckUtils]: 23: Hoare triple {55519#(< 999973 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {55523#(< 999971 main_~y~0)} is VALID [2022-04-28 03:59:33,730 INFO L290 TraceCheckUtils]: 24: Hoare triple {55523#(< 999971 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {55527#(< 999969 main_~y~0)} is VALID [2022-04-28 03:59:33,731 INFO L290 TraceCheckUtils]: 25: Hoare triple {55527#(< 999969 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {55531#(< 999967 main_~y~0)} is VALID [2022-04-28 03:59:33,731 INFO L290 TraceCheckUtils]: 26: Hoare triple {55531#(< 999967 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {55535#(< 999965 main_~y~0)} is VALID [2022-04-28 03:59:33,731 INFO L290 TraceCheckUtils]: 27: Hoare triple {55535#(< 999965 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {55539#(< 999963 main_~y~0)} is VALID [2022-04-28 03:59:33,732 INFO L290 TraceCheckUtils]: 28: Hoare triple {55539#(< 999963 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {55543#(< 999961 main_~y~0)} is VALID [2022-04-28 03:59:33,732 INFO L290 TraceCheckUtils]: 29: Hoare triple {55543#(< 999961 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {55547#(< 999959 main_~y~0)} is VALID [2022-04-28 03:59:33,733 INFO L290 TraceCheckUtils]: 30: Hoare triple {55547#(< 999959 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {55551#(< 999957 main_~y~0)} is VALID [2022-04-28 03:59:33,733 INFO L290 TraceCheckUtils]: 31: Hoare triple {55551#(< 999957 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {55555#(< 999955 main_~y~0)} is VALID [2022-04-28 03:59:33,734 INFO L290 TraceCheckUtils]: 32: Hoare triple {55555#(< 999955 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {55559#(< 999953 main_~y~0)} is VALID [2022-04-28 03:59:33,734 INFO L290 TraceCheckUtils]: 33: Hoare triple {55559#(< 999953 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {55563#(< 999951 main_~y~0)} is VALID [2022-04-28 03:59:33,735 INFO L290 TraceCheckUtils]: 34: Hoare triple {55563#(< 999951 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {55567#(< 999949 main_~y~0)} is VALID [2022-04-28 03:59:33,735 INFO L290 TraceCheckUtils]: 35: Hoare triple {55567#(< 999949 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {55571#(< 999947 main_~y~0)} is VALID [2022-04-28 03:59:33,736 INFO L290 TraceCheckUtils]: 36: Hoare triple {55571#(< 999947 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {55575#(< 999945 main_~y~0)} is VALID [2022-04-28 03:59:33,736 INFO L290 TraceCheckUtils]: 37: Hoare triple {55575#(< 999945 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {55579#(< 999943 main_~y~0)} is VALID [2022-04-28 03:59:33,737 INFO L290 TraceCheckUtils]: 38: Hoare triple {55579#(< 999943 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {55583#(< 999941 main_~y~0)} is VALID [2022-04-28 03:59:33,737 INFO L290 TraceCheckUtils]: 39: Hoare triple {55583#(< 999941 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {55587#(< 999939 main_~y~0)} is VALID [2022-04-28 03:59:33,737 INFO L290 TraceCheckUtils]: 40: Hoare triple {55587#(< 999939 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {55591#(< 999937 main_~y~0)} is VALID [2022-04-28 03:59:33,738 INFO L290 TraceCheckUtils]: 41: Hoare triple {55591#(< 999937 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {55595#(< 999935 main_~y~0)} is VALID [2022-04-28 03:59:33,738 INFO L290 TraceCheckUtils]: 42: Hoare triple {55595#(< 999935 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {55599#(< 999933 main_~y~0)} is VALID [2022-04-28 03:59:33,739 INFO L290 TraceCheckUtils]: 43: Hoare triple {55599#(< 999933 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {55603#(< 999931 main_~y~0)} is VALID [2022-04-28 03:59:33,739 INFO L290 TraceCheckUtils]: 44: Hoare triple {55603#(< 999931 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {55607#(< 999929 main_~y~0)} is VALID [2022-04-28 03:59:33,740 INFO L290 TraceCheckUtils]: 45: Hoare triple {55607#(< 999929 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {55611#(< 999927 main_~y~0)} is VALID [2022-04-28 03:59:33,740 INFO L290 TraceCheckUtils]: 46: Hoare triple {55611#(< 999927 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {55615#(< 999925 main_~y~0)} is VALID [2022-04-28 03:59:33,741 INFO L290 TraceCheckUtils]: 47: Hoare triple {55615#(< 999925 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {55619#(< 999923 main_~y~0)} is VALID [2022-04-28 03:59:33,741 INFO L290 TraceCheckUtils]: 48: Hoare triple {55619#(< 999923 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {55623#(< 999921 main_~y~0)} is VALID [2022-04-28 03:59:33,742 INFO L290 TraceCheckUtils]: 49: Hoare triple {55623#(< 999921 main_~y~0)} assume !(~y~0 > 0); {55389#false} is VALID [2022-04-28 03:59:33,742 INFO L272 TraceCheckUtils]: 50: Hoare triple {55389#false} call __VERIFIER_assert((if ~z~0 == ~x~0 then 1 else 0)); {55389#false} is VALID [2022-04-28 03:59:33,742 INFO L290 TraceCheckUtils]: 51: Hoare triple {55389#false} ~cond := #in~cond; {55389#false} is VALID [2022-04-28 03:59:33,742 INFO L290 TraceCheckUtils]: 52: Hoare triple {55389#false} assume 0 == ~cond; {55389#false} is VALID [2022-04-28 03:59:33,742 INFO L290 TraceCheckUtils]: 53: Hoare triple {55389#false} assume !false; {55389#false} is VALID [2022-04-28 03:59:33,742 INFO L134 CoverageAnalysis]: Checked inductivity of 782 backedges. 0 proven. 782 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 03:59:33,742 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 03:59:36,197 INFO L290 TraceCheckUtils]: 53: Hoare triple {55389#false} assume !false; {55389#false} is VALID [2022-04-28 03:59:36,197 INFO L290 TraceCheckUtils]: 52: Hoare triple {55389#false} assume 0 == ~cond; {55389#false} is VALID [2022-04-28 03:59:36,197 INFO L290 TraceCheckUtils]: 51: Hoare triple {55389#false} ~cond := #in~cond; {55389#false} is VALID [2022-04-28 03:59:36,197 INFO L272 TraceCheckUtils]: 50: Hoare triple {55389#false} call __VERIFIER_assert((if ~z~0 == ~x~0 then 1 else 0)); {55389#false} is VALID [2022-04-28 03:59:36,198 INFO L290 TraceCheckUtils]: 49: Hoare triple {55651#(< 0 main_~y~0)} assume !(~y~0 > 0); {55389#false} is VALID [2022-04-28 03:59:36,198 INFO L290 TraceCheckUtils]: 48: Hoare triple {55655#(< 2 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {55651#(< 0 main_~y~0)} is VALID [2022-04-28 03:59:36,199 INFO L290 TraceCheckUtils]: 47: Hoare triple {55659#(< 4 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {55655#(< 2 main_~y~0)} is VALID [2022-04-28 03:59:36,199 INFO L290 TraceCheckUtils]: 46: Hoare triple {55663#(< 6 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {55659#(< 4 main_~y~0)} is VALID [2022-04-28 03:59:36,199 INFO L290 TraceCheckUtils]: 45: Hoare triple {55667#(< 8 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {55663#(< 6 main_~y~0)} is VALID [2022-04-28 03:59:36,200 INFO L290 TraceCheckUtils]: 44: Hoare triple {55671#(< 10 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {55667#(< 8 main_~y~0)} is VALID [2022-04-28 03:59:36,200 INFO L290 TraceCheckUtils]: 43: Hoare triple {55675#(< 12 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {55671#(< 10 main_~y~0)} is VALID [2022-04-28 03:59:36,201 INFO L290 TraceCheckUtils]: 42: Hoare triple {55679#(< 14 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {55675#(< 12 main_~y~0)} is VALID [2022-04-28 03:59:36,201 INFO L290 TraceCheckUtils]: 41: Hoare triple {55683#(< 16 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {55679#(< 14 main_~y~0)} is VALID [2022-04-28 03:59:36,202 INFO L290 TraceCheckUtils]: 40: Hoare triple {55687#(< 18 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {55683#(< 16 main_~y~0)} is VALID [2022-04-28 03:59:36,202 INFO L290 TraceCheckUtils]: 39: Hoare triple {55691#(< 20 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {55687#(< 18 main_~y~0)} is VALID [2022-04-28 03:59:36,202 INFO L290 TraceCheckUtils]: 38: Hoare triple {55695#(< 22 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {55691#(< 20 main_~y~0)} is VALID [2022-04-28 03:59:36,203 INFO L290 TraceCheckUtils]: 37: Hoare triple {55699#(< 24 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {55695#(< 22 main_~y~0)} is VALID [2022-04-28 03:59:36,203 INFO L290 TraceCheckUtils]: 36: Hoare triple {55703#(< 26 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {55699#(< 24 main_~y~0)} is VALID [2022-04-28 03:59:36,204 INFO L290 TraceCheckUtils]: 35: Hoare triple {55707#(< 28 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {55703#(< 26 main_~y~0)} is VALID [2022-04-28 03:59:36,204 INFO L290 TraceCheckUtils]: 34: Hoare triple {55711#(< 30 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {55707#(< 28 main_~y~0)} is VALID [2022-04-28 03:59:36,204 INFO L290 TraceCheckUtils]: 33: Hoare triple {55715#(< 32 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {55711#(< 30 main_~y~0)} is VALID [2022-04-28 03:59:36,205 INFO L290 TraceCheckUtils]: 32: Hoare triple {55719#(< 34 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {55715#(< 32 main_~y~0)} is VALID [2022-04-28 03:59:36,205 INFO L290 TraceCheckUtils]: 31: Hoare triple {55723#(< 36 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {55719#(< 34 main_~y~0)} is VALID [2022-04-28 03:59:36,215 INFO L290 TraceCheckUtils]: 30: Hoare triple {55727#(< 38 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {55723#(< 36 main_~y~0)} is VALID [2022-04-28 03:59:36,216 INFO L290 TraceCheckUtils]: 29: Hoare triple {55731#(< 40 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {55727#(< 38 main_~y~0)} is VALID [2022-04-28 03:59:36,217 INFO L290 TraceCheckUtils]: 28: Hoare triple {55735#(< 42 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {55731#(< 40 main_~y~0)} is VALID [2022-04-28 03:59:36,217 INFO L290 TraceCheckUtils]: 27: Hoare triple {55739#(< 44 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {55735#(< 42 main_~y~0)} is VALID [2022-04-28 03:59:36,217 INFO L290 TraceCheckUtils]: 26: Hoare triple {55743#(< 46 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {55739#(< 44 main_~y~0)} is VALID [2022-04-28 03:59:36,218 INFO L290 TraceCheckUtils]: 25: Hoare triple {55747#(< 48 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {55743#(< 46 main_~y~0)} is VALID [2022-04-28 03:59:36,218 INFO L290 TraceCheckUtils]: 24: Hoare triple {55751#(< 50 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {55747#(< 48 main_~y~0)} is VALID [2022-04-28 03:59:36,219 INFO L290 TraceCheckUtils]: 23: Hoare triple {55755#(< 52 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {55751#(< 50 main_~y~0)} is VALID [2022-04-28 03:59:36,219 INFO L290 TraceCheckUtils]: 22: Hoare triple {55759#(< 54 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {55755#(< 52 main_~y~0)} is VALID [2022-04-28 03:59:36,220 INFO L290 TraceCheckUtils]: 21: Hoare triple {55763#(< 56 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {55759#(< 54 main_~y~0)} is VALID [2022-04-28 03:59:36,220 INFO L290 TraceCheckUtils]: 20: Hoare triple {55767#(< 58 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {55763#(< 56 main_~y~0)} is VALID [2022-04-28 03:59:36,220 INFO L290 TraceCheckUtils]: 19: Hoare triple {55771#(< 60 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {55767#(< 58 main_~y~0)} is VALID [2022-04-28 03:59:36,221 INFO L290 TraceCheckUtils]: 18: Hoare triple {55775#(< 62 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {55771#(< 60 main_~y~0)} is VALID [2022-04-28 03:59:36,221 INFO L290 TraceCheckUtils]: 17: Hoare triple {55779#(< 64 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {55775#(< 62 main_~y~0)} is VALID [2022-04-28 03:59:36,222 INFO L290 TraceCheckUtils]: 16: Hoare triple {55783#(< 66 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {55779#(< 64 main_~y~0)} is VALID [2022-04-28 03:59:36,222 INFO L290 TraceCheckUtils]: 15: Hoare triple {55787#(< 68 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {55783#(< 66 main_~y~0)} is VALID [2022-04-28 03:59:36,223 INFO L290 TraceCheckUtils]: 14: Hoare triple {55791#(< 70 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {55787#(< 68 main_~y~0)} is VALID [2022-04-28 03:59:36,223 INFO L290 TraceCheckUtils]: 13: Hoare triple {55795#(< 72 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {55791#(< 70 main_~y~0)} is VALID [2022-04-28 03:59:36,223 INFO L290 TraceCheckUtils]: 12: Hoare triple {55799#(< 74 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {55795#(< 72 main_~y~0)} is VALID [2022-04-28 03:59:36,224 INFO L290 TraceCheckUtils]: 11: Hoare triple {55803#(< 76 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {55799#(< 74 main_~y~0)} is VALID [2022-04-28 03:59:36,224 INFO L290 TraceCheckUtils]: 10: Hoare triple {55807#(< 78 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {55803#(< 76 main_~y~0)} is VALID [2022-04-28 03:59:36,225 INFO L290 TraceCheckUtils]: 9: Hoare triple {55811#(or (< main_~x~0 1000000) (< 78 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[] {55807#(< 78 main_~y~0)} is VALID [2022-04-28 03:59:36,225 INFO L290 TraceCheckUtils]: 8: Hoare triple {55815#(and (or (<= 1000000 main_~x~0) (not (<= 50000 main_~x~0)) (< main_~x~0 (+ main_~y~0 999922))) (or (< main_~x~0 1000000) (< 78 main_~y~0)))} [214] L11-2-->L18-1_primed: Formula: (let ((.cse0 (= v_main_~y~0_3198 v_main_~y~0_3197)) (.cse1 (= v_main_~x~0_2785 v_main_~x~0_2784)) (.cse2 (= |v_main_#t~post6_270| |v_main_#t~post6_269|)) (.cse4 (<= 50000 v_main_~x~0_2785)) (.cse3 (= |v_main_#t~post5_270| |v_main_#t~post5_269|))) (or (and .cse0 .cse1 .cse2 .cse3) (and (< v_main_~x~0_2784 1000001) (< v_main_~x~0_2785 v_main_~x~0_2784) .cse4 (= (+ v_main_~x~0_2785 v_main_~y~0_3197) (+ v_main_~x~0_2784 v_main_~y~0_3198))) (and .cse0 .cse1 .cse2 (or (not (< v_main_~x~0_2785 1000000)) (not .cse4)) .cse3))) InVars {main_~y~0=v_main_~y~0_3198, main_#t~post5=|v_main_#t~post5_270|, main_~x~0=v_main_~x~0_2785, main_#t~post6=|v_main_#t~post6_270|} OutVars{main_~y~0=v_main_~y~0_3197, main_#t~post5=|v_main_#t~post5_269|, main_~x~0=v_main_~x~0_2784, main_#t~post6=|v_main_#t~post6_269|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {55811#(or (< main_~x~0 1000000) (< 78 main_~y~0))} is VALID [2022-04-28 03:59:36,226 INFO L290 TraceCheckUtils]: 7: Hoare triple {55815#(and (or (<= 1000000 main_~x~0) (not (<= 50000 main_~x~0)) (< main_~x~0 (+ main_~y~0 999922))) (or (< main_~x~0 1000000) (< 78 main_~y~0)))} [213] L18-1_primed-->L11-2: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {55815#(and (or (<= 1000000 main_~x~0) (not (<= 50000 main_~x~0)) (< main_~x~0 (+ main_~y~0 999922))) (or (< main_~x~0 1000000) (< 78 main_~y~0)))} is VALID [2022-04-28 03:59:36,227 INFO L290 TraceCheckUtils]: 6: Hoare triple {55822#(and (<= 0 (+ main_~y~0 949921)) (or (<= 1000000 main_~x~0) (< main_~x~0 (+ main_~y~0 999922))) (or (< main_~x~0 1000000) (< 78 main_~y~0)))} [212] L11-2-->L18-1_primed: Formula: (let ((.cse0 (= v_main_~x~0_2783 v_main_~x~0_2782)) (.cse1 (= |v_main_#t~post4_246| |v_main_#t~post4_245|))) (or (and .cse0 .cse1 (not (< v_main_~x~0_2783 50000))) (and .cse0 .cse1) (and (< v_main_~x~0_2783 v_main_~x~0_2782) (< v_main_~x~0_2782 50001)))) InVars {main_~x~0=v_main_~x~0_2783, main_#t~post4=|v_main_#t~post4_246|} OutVars{main_~x~0=v_main_~x~0_2782, main_#t~post4=|v_main_#t~post4_245|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {55815#(and (or (<= 1000000 main_~x~0) (not (<= 50000 main_~x~0)) (< main_~x~0 (+ main_~y~0 999922))) (or (< main_~x~0 1000000) (< 78 main_~y~0)))} is VALID [2022-04-28 03:59:36,227 INFO L290 TraceCheckUtils]: 5: Hoare triple {55388#true} ~x~0 := 0;~y~0 := 50000;~z~0 := 0;~x~0 := 0; {55822#(and (<= 0 (+ main_~y~0 949921)) (or (<= 1000000 main_~x~0) (< main_~x~0 (+ main_~y~0 999922))) (or (< main_~x~0 1000000) (< 78 main_~y~0)))} is VALID [2022-04-28 03:59:36,227 INFO L272 TraceCheckUtils]: 4: Hoare triple {55388#true} call #t~ret7 := main(); {55388#true} is VALID [2022-04-28 03:59:36,227 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {55388#true} {55388#true} #52#return; {55388#true} is VALID [2022-04-28 03:59:36,227 INFO L290 TraceCheckUtils]: 2: Hoare triple {55388#true} assume true; {55388#true} is VALID [2022-04-28 03:59:36,227 INFO L290 TraceCheckUtils]: 1: Hoare triple {55388#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); {55388#true} is VALID [2022-04-28 03:59:36,227 INFO L272 TraceCheckUtils]: 0: Hoare triple {55388#true} call ULTIMATE.init(); {55388#true} is VALID [2022-04-28 03:59:36,228 INFO L134 CoverageAnalysis]: Checked inductivity of 782 backedges. 0 proven. 782 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 03:59:36,228 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1637384254] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 03:59:36,228 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 03:59:36,228 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [43, 45, 45] total 129 [2022-04-28 03:59:40,962 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 03:59:40,962 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [210218337] [2022-04-28 03:59:40,962 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [210218337] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 03:59:40,962 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 03:59:40,963 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [115] imperfect sequences [] total 115 [2022-04-28 03:59:40,963 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1940333252] [2022-04-28 03:59:40,963 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 03:59:40,963 INFO L78 Accepts]: Start accepts. Automaton has has 115 states, 115 states have (on average 1.6434782608695653) internal successors, (189), 114 states have internal predecessors, (189), 2 states have call successors, (3), 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 193 [2022-04-28 03:59:40,963 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 03:59:40,963 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 115 states, 115 states have (on average 1.6434782608695653) internal successors, (189), 114 states have internal predecessors, (189), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:59:41,092 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-28 03:59:41,092 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 115 states [2022-04-28 03:59:41,092 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 03:59:41,093 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 115 interpolants. [2022-04-28 03:59:41,095 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14070, Invalid=25730, Unknown=0, NotChecked=0, Total=39800 [2022-04-28 03:59:41,096 INFO L87 Difference]: Start difference. First operand 332 states and 336 transitions. Second operand has 115 states, 115 states have (on average 1.6434782608695653) internal successors, (189), 114 states have internal predecessors, (189), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 04:00:02,451 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 04:00:02,452 INFO L93 Difference]: Finished difference Result 523 states and 537 transitions. [2022-04-28 04:00:02,452 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 115 states. [2022-04-28 04:00:02,452 INFO L78 Accepts]: Start accepts. Automaton has has 115 states, 115 states have (on average 1.6434782608695653) internal successors, (189), 114 states have internal predecessors, (189), 2 states have call successors, (3), 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 193 [2022-04-28 04:00:02,452 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 04:00:02,452 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 115 states, 115 states have (on average 1.6434782608695653) internal successors, (189), 114 states have internal predecessors, (189), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 04:00:02,453 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 115 states and 217 transitions. [2022-04-28 04:00:02,453 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 115 states, 115 states have (on average 1.6434782608695653) internal successors, (189), 114 states have internal predecessors, (189), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 04:00:02,455 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 115 states and 217 transitions. [2022-04-28 04:00:02,455 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 115 states and 217 transitions. [2022-04-28 04:00:02,626 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 217 edges. 217 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 04:00:02,631 INFO L225 Difference]: With dead ends: 523 [2022-04-28 04:00:02,631 INFO L226 Difference]: Without dead ends: 339 [2022-04-28 04:00:02,636 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 411 GetRequests, 100 SyntacticMatches, 1 SemanticMatches, 310 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32919 ImplicationChecksByTransitivity, 12.9s TimeCoverageRelationStatistics Valid=26867, Invalid=70165, Unknown=0, NotChecked=0, Total=97032 [2022-04-28 04:00:02,636 INFO L413 NwaCegarLoop]: 12 mSDtfsCounter, 377 mSDsluCounter, 37 mSDsCounter, 0 mSdLazyCounter, 10336 mSolverCounterSat, 348 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 7.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 377 SdHoareTripleChecker+Valid, 49 SdHoareTripleChecker+Invalid, 10684 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 348 IncrementalHoareTripleChecker+Valid, 10336 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 8.0s IncrementalHoareTripleChecker+Time [2022-04-28 04:00:02,636 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [377 Valid, 49 Invalid, 10684 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [348 Valid, 10336 Invalid, 0 Unknown, 0 Unchecked, 8.0s Time] [2022-04-28 04:00:02,637 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 339 states. [2022-04-28 04:00:02,922 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 339 to 199. [2022-04-28 04:00:02,922 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 04:00:02,922 INFO L82 GeneralOperation]: Start isEquivalent. First operand 339 states. Second operand has 199 states, 194 states have (on average 1.0206185567010309) internal successors, (198), 194 states have internal predecessors, (198), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 04:00:02,923 INFO L74 IsIncluded]: Start isIncluded. First operand 339 states. Second operand has 199 states, 194 states have (on average 1.0206185567010309) internal successors, (198), 194 states have internal predecessors, (198), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 04:00:02,923 INFO L87 Difference]: Start difference. First operand 339 states. Second operand has 199 states, 194 states have (on average 1.0206185567010309) internal successors, (198), 194 states have internal predecessors, (198), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 04:00:02,926 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 04:00:02,926 INFO L93 Difference]: Finished difference Result 339 states and 343 transitions. [2022-04-28 04:00:02,926 INFO L276 IsEmpty]: Start isEmpty. Operand 339 states and 343 transitions. [2022-04-28 04:00:02,927 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 04:00:02,927 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 04:00:02,927 INFO L74 IsIncluded]: Start isIncluded. First operand has 199 states, 194 states have (on average 1.0206185567010309) internal successors, (198), 194 states have internal predecessors, (198), 3 states have call successors, (3), 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 339 states. [2022-04-28 04:00:02,927 INFO L87 Difference]: Start difference. First operand has 199 states, 194 states have (on average 1.0206185567010309) internal successors, (198), 194 states have internal predecessors, (198), 3 states have call successors, (3), 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 339 states. [2022-04-28 04:00:02,930 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 04:00:02,930 INFO L93 Difference]: Finished difference Result 339 states and 343 transitions. [2022-04-28 04:00:02,930 INFO L276 IsEmpty]: Start isEmpty. Operand 339 states and 343 transitions. [2022-04-28 04:00:02,931 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 04:00:02,931 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 04:00:02,931 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 04:00:02,931 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 04:00:02,931 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 199 states, 194 states have (on average 1.0206185567010309) internal successors, (198), 194 states have internal predecessors, (198), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 04:00:02,933 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 199 states to 199 states and 202 transitions. [2022-04-28 04:00:02,933 INFO L78 Accepts]: Start accepts. Automaton has 199 states and 202 transitions. Word has length 193 [2022-04-28 04:00:02,933 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 04:00:02,933 INFO L495 AbstractCegarLoop]: Abstraction has 199 states and 202 transitions. [2022-04-28 04:00:02,933 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 115 states, 115 states have (on average 1.6434782608695653) internal successors, (189), 114 states have internal predecessors, (189), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 04:00:02,933 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 199 states and 202 transitions. [2022-04-28 04:00:03,090 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 202 edges. 202 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 04:00:03,090 INFO L276 IsEmpty]: Start isEmpty. Operand 199 states and 202 transitions. [2022-04-28 04:00:03,091 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 199 [2022-04-28 04:00:03,091 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 04:00:03,091 INFO L195 NwaCegarLoop]: trace histogram [73, 72, 40, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 04:00:03,107 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (40)] Ended with exit code 0 [2022-04-28 04:00:03,298 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 40 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable41 [2022-04-28 04:00:03,299 INFO L420 AbstractCegarLoop]: === Iteration 43 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 04:00:03,299 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 04:00:03,299 INFO L85 PathProgramCache]: Analyzing trace with hash 1258094754, now seen corresponding path program 40 times [2022-04-28 04:00:03,299 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 04:00:03,299 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1429321359] [2022-04-28 04:00:05,491 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 1 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 04:00:09,625 WARN L977 rdanLoopAcceleration]: Unable to prove correctness of quantifier elimination. [2022-04-28 04:00:09,752 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={1=1, 2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 04:00:09,754 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-28 04:00:09,756 INFO L85 PathProgramCache]: Analyzing trace with hash -439829375, now seen corresponding path program 1 times [2022-04-28 04:00:09,756 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 04:00:09,756 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [99041835] [2022-04-28 04:00:09,756 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 04:00:09,756 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 04:00:09,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 04:00:10,520 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 04:00:10,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 04:00:10,523 INFO L290 TraceCheckUtils]: 0: Hoare triple {58306#(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); {58260#true} is VALID [2022-04-28 04:00:10,523 INFO L290 TraceCheckUtils]: 1: Hoare triple {58260#true} assume true; {58260#true} is VALID [2022-04-28 04:00:10,523 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {58260#true} {58260#true} #52#return; {58260#true} is VALID [2022-04-28 04:00:10,523 INFO L272 TraceCheckUtils]: 0: Hoare triple {58260#true} call ULTIMATE.init(); {58306#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 04:00:10,523 INFO L290 TraceCheckUtils]: 1: Hoare triple {58306#(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); {58260#true} is VALID [2022-04-28 04:00:10,523 INFO L290 TraceCheckUtils]: 2: Hoare triple {58260#true} assume true; {58260#true} is VALID [2022-04-28 04:00:10,524 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {58260#true} {58260#true} #52#return; {58260#true} is VALID [2022-04-28 04:00:10,524 INFO L272 TraceCheckUtils]: 4: Hoare triple {58260#true} call #t~ret7 := main(); {58260#true} is VALID [2022-04-28 04:00:10,524 INFO L290 TraceCheckUtils]: 5: Hoare triple {58260#true} ~x~0 := 0;~y~0 := 50000;~z~0 := 0;~x~0 := 0; {58265#(<= 50000 main_~y~0)} is VALID [2022-04-28 04:00:10,524 INFO L290 TraceCheckUtils]: 6: Hoare triple {58265#(<= 50000 main_~y~0)} [216] L11-2-->L18-1_primed: Formula: (let ((.cse0 (= |v_main_#t~post4_253| |v_main_#t~post4_252|))) (or (and (= v_main_~x~0_2909 v_main_~x~0_2910) .cse0 (<= 50000 v_main_~x~0_2910)) (and .cse0 (= v_main_~x~0_2910 v_main_~x~0_2909)) (and (< v_main_~x~0_2909 50001) (< v_main_~x~0_2910 v_main_~x~0_2909)))) InVars {main_~x~0=v_main_~x~0_2910, main_#t~post4=|v_main_#t~post4_253|} OutVars{main_~x~0=v_main_~x~0_2909, main_#t~post4=|v_main_#t~post4_252|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {58265#(<= 50000 main_~y~0)} is VALID [2022-04-28 04:00:10,524 INFO L290 TraceCheckUtils]: 7: Hoare triple {58265#(<= 50000 main_~y~0)} [217] L18-1_primed-->L11-2: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {58265#(<= 50000 main_~y~0)} is VALID [2022-04-28 04:00:10,525 INFO L290 TraceCheckUtils]: 8: Hoare triple {58265#(<= 50000 main_~y~0)} [218] L11-2-->L18-1_primed: Formula: (let ((.cse0 (= v_main_~y~0_3355 v_main_~y~0_3354)) (.cse1 (= |v_main_#t~post6_277| |v_main_#t~post6_276|)) (.cse2 (= v_main_~x~0_2912 v_main_~x~0_2911)) (.cse4 (<= 50000 v_main_~x~0_2912)) (.cse3 (= |v_main_#t~post5_277| |v_main_#t~post5_276|))) (or (and .cse0 .cse1 .cse2 .cse3) (and (< v_main_~x~0_2912 v_main_~x~0_2911) (= (+ v_main_~x~0_2911 v_main_~y~0_3355) (+ v_main_~x~0_2912 v_main_~y~0_3354)) .cse4 (< v_main_~x~0_2911 1000001)) (and .cse0 .cse1 .cse2 (or (not .cse4) (not (< v_main_~x~0_2912 1000000))) .cse3))) InVars {main_~y~0=v_main_~y~0_3355, main_#t~post5=|v_main_#t~post5_277|, main_~x~0=v_main_~x~0_2912, main_#t~post6=|v_main_#t~post6_277|} OutVars{main_~y~0=v_main_~y~0_3354, main_#t~post5=|v_main_#t~post5_276|, main_~x~0=v_main_~x~0_2911, main_#t~post6=|v_main_#t~post6_276|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {58265#(<= 50000 main_~y~0)} is VALID [2022-04-28 04:00:10,525 INFO L290 TraceCheckUtils]: 9: Hoare triple {58265#(<= 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[] {58265#(<= 50000 main_~y~0)} is VALID [2022-04-28 04:00:10,526 INFO L290 TraceCheckUtils]: 10: Hoare triple {58265#(<= 50000 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {58266#(<= 49998 main_~y~0)} is VALID [2022-04-28 04:00:10,526 INFO L290 TraceCheckUtils]: 11: Hoare triple {58266#(<= 49998 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {58267#(<= 49996 main_~y~0)} is VALID [2022-04-28 04:00:10,527 INFO L290 TraceCheckUtils]: 12: Hoare triple {58267#(<= 49996 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {58268#(<= 49994 main_~y~0)} is VALID [2022-04-28 04:00:10,527 INFO L290 TraceCheckUtils]: 13: Hoare triple {58268#(<= 49994 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {58269#(<= 49992 main_~y~0)} is VALID [2022-04-28 04:00:10,528 INFO L290 TraceCheckUtils]: 14: Hoare triple {58269#(<= 49992 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {58270#(<= 49990 main_~y~0)} is VALID [2022-04-28 04:00:10,528 INFO L290 TraceCheckUtils]: 15: Hoare triple {58270#(<= 49990 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {58271#(<= 49988 main_~y~0)} is VALID [2022-04-28 04:00:10,528 INFO L290 TraceCheckUtils]: 16: Hoare triple {58271#(<= 49988 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {58272#(<= 49986 main_~y~0)} is VALID [2022-04-28 04:00:10,529 INFO L290 TraceCheckUtils]: 17: Hoare triple {58272#(<= 49986 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {58273#(<= 49984 main_~y~0)} is VALID [2022-04-28 04:00:10,529 INFO L290 TraceCheckUtils]: 18: Hoare triple {58273#(<= 49984 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {58274#(<= 49982 main_~y~0)} is VALID [2022-04-28 04:00:10,530 INFO L290 TraceCheckUtils]: 19: Hoare triple {58274#(<= 49982 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {58275#(<= 49980 main_~y~0)} is VALID [2022-04-28 04:00:10,530 INFO L290 TraceCheckUtils]: 20: Hoare triple {58275#(<= 49980 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {58276#(<= 49978 main_~y~0)} is VALID [2022-04-28 04:00:10,531 INFO L290 TraceCheckUtils]: 21: Hoare triple {58276#(<= 49978 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {58277#(<= 49976 main_~y~0)} is VALID [2022-04-28 04:00:10,531 INFO L290 TraceCheckUtils]: 22: Hoare triple {58277#(<= 49976 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {58278#(<= 49974 main_~y~0)} is VALID [2022-04-28 04:00:10,531 INFO L290 TraceCheckUtils]: 23: Hoare triple {58278#(<= 49974 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {58279#(<= 49972 main_~y~0)} is VALID [2022-04-28 04:00:10,532 INFO L290 TraceCheckUtils]: 24: Hoare triple {58279#(<= 49972 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {58280#(<= 49970 main_~y~0)} is VALID [2022-04-28 04:00:10,532 INFO L290 TraceCheckUtils]: 25: Hoare triple {58280#(<= 49970 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {58281#(<= 49968 main_~y~0)} is VALID [2022-04-28 04:00:10,533 INFO L290 TraceCheckUtils]: 26: Hoare triple {58281#(<= 49968 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {58282#(<= 49966 main_~y~0)} is VALID [2022-04-28 04:00:10,533 INFO L290 TraceCheckUtils]: 27: Hoare triple {58282#(<= 49966 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {58283#(<= 49964 main_~y~0)} is VALID [2022-04-28 04:00:10,533 INFO L290 TraceCheckUtils]: 28: Hoare triple {58283#(<= 49964 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {58284#(<= 49962 main_~y~0)} is VALID [2022-04-28 04:00:10,534 INFO L290 TraceCheckUtils]: 29: Hoare triple {58284#(<= 49962 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {58285#(<= 49960 main_~y~0)} is VALID [2022-04-28 04:00:10,534 INFO L290 TraceCheckUtils]: 30: Hoare triple {58285#(<= 49960 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {58286#(<= 49958 main_~y~0)} is VALID [2022-04-28 04:00:10,535 INFO L290 TraceCheckUtils]: 31: Hoare triple {58286#(<= 49958 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {58287#(<= 49956 main_~y~0)} is VALID [2022-04-28 04:00:10,535 INFO L290 TraceCheckUtils]: 32: Hoare triple {58287#(<= 49956 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {58288#(<= 49954 main_~y~0)} is VALID [2022-04-28 04:00:10,536 INFO L290 TraceCheckUtils]: 33: Hoare triple {58288#(<= 49954 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {58289#(<= 49952 main_~y~0)} is VALID [2022-04-28 04:00:10,536 INFO L290 TraceCheckUtils]: 34: Hoare triple {58289#(<= 49952 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {58290#(<= 49950 main_~y~0)} is VALID [2022-04-28 04:00:10,536 INFO L290 TraceCheckUtils]: 35: Hoare triple {58290#(<= 49950 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {58291#(<= 49948 main_~y~0)} is VALID [2022-04-28 04:00:10,537 INFO L290 TraceCheckUtils]: 36: Hoare triple {58291#(<= 49948 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {58292#(<= 49946 main_~y~0)} is VALID [2022-04-28 04:00:10,537 INFO L290 TraceCheckUtils]: 37: Hoare triple {58292#(<= 49946 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {58293#(<= 49944 main_~y~0)} is VALID [2022-04-28 04:00:10,538 INFO L290 TraceCheckUtils]: 38: Hoare triple {58293#(<= 49944 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {58294#(<= 49942 main_~y~0)} is VALID [2022-04-28 04:00:10,538 INFO L290 TraceCheckUtils]: 39: Hoare triple {58294#(<= 49942 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {58295#(<= 49940 main_~y~0)} is VALID [2022-04-28 04:00:10,538 INFO L290 TraceCheckUtils]: 40: Hoare triple {58295#(<= 49940 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {58296#(<= 49938 main_~y~0)} is VALID [2022-04-28 04:00:10,539 INFO L290 TraceCheckUtils]: 41: Hoare triple {58296#(<= 49938 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {58297#(<= 49936 main_~y~0)} is VALID [2022-04-28 04:00:10,539 INFO L290 TraceCheckUtils]: 42: Hoare triple {58297#(<= 49936 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {58298#(<= 49934 main_~y~0)} is VALID [2022-04-28 04:00:10,540 INFO L290 TraceCheckUtils]: 43: Hoare triple {58298#(<= 49934 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {58299#(<= 49932 main_~y~0)} is VALID [2022-04-28 04:00:10,540 INFO L290 TraceCheckUtils]: 44: Hoare triple {58299#(<= 49932 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {58300#(<= 49930 main_~y~0)} is VALID [2022-04-28 04:00:10,541 INFO L290 TraceCheckUtils]: 45: Hoare triple {58300#(<= 49930 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {58301#(<= 49928 main_~y~0)} is VALID [2022-04-28 04:00:10,541 INFO L290 TraceCheckUtils]: 46: Hoare triple {58301#(<= 49928 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {58302#(<= 49926 main_~y~0)} is VALID [2022-04-28 04:00:10,541 INFO L290 TraceCheckUtils]: 47: Hoare triple {58302#(<= 49926 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {58303#(<= 49924 main_~y~0)} is VALID [2022-04-28 04:00:10,542 INFO L290 TraceCheckUtils]: 48: Hoare triple {58303#(<= 49924 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {58304#(<= 49922 main_~y~0)} is VALID [2022-04-28 04:00:10,542 INFO L290 TraceCheckUtils]: 49: Hoare triple {58304#(<= 49922 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {58305#(<= 49920 main_~y~0)} is VALID [2022-04-28 04:00:10,543 INFO L290 TraceCheckUtils]: 50: Hoare triple {58305#(<= 49920 main_~y~0)} assume !(~y~0 > 0); {58261#false} is VALID [2022-04-28 04:00:10,543 INFO L272 TraceCheckUtils]: 51: Hoare triple {58261#false} call __VERIFIER_assert((if ~z~0 == ~x~0 then 1 else 0)); {58261#false} is VALID [2022-04-28 04:00:10,543 INFO L290 TraceCheckUtils]: 52: Hoare triple {58261#false} ~cond := #in~cond; {58261#false} is VALID [2022-04-28 04:00:10,543 INFO L290 TraceCheckUtils]: 53: Hoare triple {58261#false} assume 0 == ~cond; {58261#false} is VALID [2022-04-28 04:00:10,543 INFO L290 TraceCheckUtils]: 54: Hoare triple {58261#false} assume !false; {58261#false} is VALID [2022-04-28 04:00:10,543 INFO L134 CoverageAnalysis]: Checked inductivity of 822 backedges. 0 proven. 820 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-04-28 04:00:10,543 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 04:00:10,543 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [99041835] [2022-04-28 04:00:10,543 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [99041835] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 04:00:10,543 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [472723581] [2022-04-28 04:00:10,543 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 04:00:10,543 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 04:00:10,544 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 04:00:10,544 INFO L229 MonitoredProcess]: Starting monitored process 41 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 04:00:10,545 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (41)] Waiting until timeout for monitored process [2022-04-28 04:00:10,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 04:00:10,601 INFO L263 TraceCheckSpWp]: Trace formula consists of 259 conjuncts, 43 conjunts are in the unsatisfiable core [2022-04-28 04:00:10,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 04:00:10,624 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 04:00:11,159 INFO L272 TraceCheckUtils]: 0: Hoare triple {58260#true} call ULTIMATE.init(); {58260#true} is VALID [2022-04-28 04:00:11,159 INFO L290 TraceCheckUtils]: 1: Hoare triple {58260#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); {58260#true} is VALID [2022-04-28 04:00:11,159 INFO L290 TraceCheckUtils]: 2: Hoare triple {58260#true} assume true; {58260#true} is VALID [2022-04-28 04:00:11,159 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {58260#true} {58260#true} #52#return; {58260#true} is VALID [2022-04-28 04:00:11,159 INFO L272 TraceCheckUtils]: 4: Hoare triple {58260#true} call #t~ret7 := main(); {58260#true} is VALID [2022-04-28 04:00:11,160 INFO L290 TraceCheckUtils]: 5: Hoare triple {58260#true} ~x~0 := 0;~y~0 := 50000;~z~0 := 0;~x~0 := 0; {58265#(<= 50000 main_~y~0)} is VALID [2022-04-28 04:00:11,160 INFO L290 TraceCheckUtils]: 6: Hoare triple {58265#(<= 50000 main_~y~0)} [216] L11-2-->L18-1_primed: Formula: (let ((.cse0 (= |v_main_#t~post4_253| |v_main_#t~post4_252|))) (or (and (= v_main_~x~0_2909 v_main_~x~0_2910) .cse0 (<= 50000 v_main_~x~0_2910)) (and .cse0 (= v_main_~x~0_2910 v_main_~x~0_2909)) (and (< v_main_~x~0_2909 50001) (< v_main_~x~0_2910 v_main_~x~0_2909)))) InVars {main_~x~0=v_main_~x~0_2910, main_#t~post4=|v_main_#t~post4_253|} OutVars{main_~x~0=v_main_~x~0_2909, main_#t~post4=|v_main_#t~post4_252|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {58265#(<= 50000 main_~y~0)} is VALID [2022-04-28 04:00:11,160 INFO L290 TraceCheckUtils]: 7: Hoare triple {58265#(<= 50000 main_~y~0)} [217] L18-1_primed-->L11-2: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {58265#(<= 50000 main_~y~0)} is VALID [2022-04-28 04:00:11,161 INFO L290 TraceCheckUtils]: 8: Hoare triple {58265#(<= 50000 main_~y~0)} [218] L11-2-->L18-1_primed: Formula: (let ((.cse0 (= v_main_~y~0_3355 v_main_~y~0_3354)) (.cse1 (= |v_main_#t~post6_277| |v_main_#t~post6_276|)) (.cse2 (= v_main_~x~0_2912 v_main_~x~0_2911)) (.cse4 (<= 50000 v_main_~x~0_2912)) (.cse3 (= |v_main_#t~post5_277| |v_main_#t~post5_276|))) (or (and .cse0 .cse1 .cse2 .cse3) (and (< v_main_~x~0_2912 v_main_~x~0_2911) (= (+ v_main_~x~0_2911 v_main_~y~0_3355) (+ v_main_~x~0_2912 v_main_~y~0_3354)) .cse4 (< v_main_~x~0_2911 1000001)) (and .cse0 .cse1 .cse2 (or (not .cse4) (not (< v_main_~x~0_2912 1000000))) .cse3))) InVars {main_~y~0=v_main_~y~0_3355, main_#t~post5=|v_main_#t~post5_277|, main_~x~0=v_main_~x~0_2912, main_#t~post6=|v_main_#t~post6_277|} OutVars{main_~y~0=v_main_~y~0_3354, main_#t~post5=|v_main_#t~post5_276|, main_~x~0=v_main_~x~0_2911, main_#t~post6=|v_main_#t~post6_276|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {58265#(<= 50000 main_~y~0)} is VALID [2022-04-28 04:00:11,161 INFO L290 TraceCheckUtils]: 9: Hoare triple {58265#(<= 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[] {58265#(<= 50000 main_~y~0)} is VALID [2022-04-28 04:00:11,162 INFO L290 TraceCheckUtils]: 10: Hoare triple {58265#(<= 50000 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {58266#(<= 49998 main_~y~0)} is VALID [2022-04-28 04:00:11,162 INFO L290 TraceCheckUtils]: 11: Hoare triple {58266#(<= 49998 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {58267#(<= 49996 main_~y~0)} is VALID [2022-04-28 04:00:11,162 INFO L290 TraceCheckUtils]: 12: Hoare triple {58267#(<= 49996 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {58268#(<= 49994 main_~y~0)} is VALID [2022-04-28 04:00:11,163 INFO L290 TraceCheckUtils]: 13: Hoare triple {58268#(<= 49994 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {58269#(<= 49992 main_~y~0)} is VALID [2022-04-28 04:00:11,163 INFO L290 TraceCheckUtils]: 14: Hoare triple {58269#(<= 49992 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {58270#(<= 49990 main_~y~0)} is VALID [2022-04-28 04:00:11,164 INFO L290 TraceCheckUtils]: 15: Hoare triple {58270#(<= 49990 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {58271#(<= 49988 main_~y~0)} is VALID [2022-04-28 04:00:11,164 INFO L290 TraceCheckUtils]: 16: Hoare triple {58271#(<= 49988 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {58272#(<= 49986 main_~y~0)} is VALID [2022-04-28 04:00:11,164 INFO L290 TraceCheckUtils]: 17: Hoare triple {58272#(<= 49986 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {58273#(<= 49984 main_~y~0)} is VALID [2022-04-28 04:00:11,165 INFO L290 TraceCheckUtils]: 18: Hoare triple {58273#(<= 49984 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {58274#(<= 49982 main_~y~0)} is VALID [2022-04-28 04:00:11,165 INFO L290 TraceCheckUtils]: 19: Hoare triple {58274#(<= 49982 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {58275#(<= 49980 main_~y~0)} is VALID [2022-04-28 04:00:11,166 INFO L290 TraceCheckUtils]: 20: Hoare triple {58275#(<= 49980 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {58276#(<= 49978 main_~y~0)} is VALID [2022-04-28 04:00:11,166 INFO L290 TraceCheckUtils]: 21: Hoare triple {58276#(<= 49978 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {58277#(<= 49976 main_~y~0)} is VALID [2022-04-28 04:00:11,167 INFO L290 TraceCheckUtils]: 22: Hoare triple {58277#(<= 49976 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {58278#(<= 49974 main_~y~0)} is VALID [2022-04-28 04:00:11,167 INFO L290 TraceCheckUtils]: 23: Hoare triple {58278#(<= 49974 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {58279#(<= 49972 main_~y~0)} is VALID [2022-04-28 04:00:11,167 INFO L290 TraceCheckUtils]: 24: Hoare triple {58279#(<= 49972 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {58280#(<= 49970 main_~y~0)} is VALID [2022-04-28 04:00:11,168 INFO L290 TraceCheckUtils]: 25: Hoare triple {58280#(<= 49970 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {58281#(<= 49968 main_~y~0)} is VALID [2022-04-28 04:00:11,168 INFO L290 TraceCheckUtils]: 26: Hoare triple {58281#(<= 49968 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {58282#(<= 49966 main_~y~0)} is VALID [2022-04-28 04:00:11,169 INFO L290 TraceCheckUtils]: 27: Hoare triple {58282#(<= 49966 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {58283#(<= 49964 main_~y~0)} is VALID [2022-04-28 04:00:11,169 INFO L290 TraceCheckUtils]: 28: Hoare triple {58283#(<= 49964 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {58284#(<= 49962 main_~y~0)} is VALID [2022-04-28 04:00:11,169 INFO L290 TraceCheckUtils]: 29: Hoare triple {58284#(<= 49962 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {58285#(<= 49960 main_~y~0)} is VALID [2022-04-28 04:00:11,170 INFO L290 TraceCheckUtils]: 30: Hoare triple {58285#(<= 49960 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {58286#(<= 49958 main_~y~0)} is VALID [2022-04-28 04:00:11,170 INFO L290 TraceCheckUtils]: 31: Hoare triple {58286#(<= 49958 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {58287#(<= 49956 main_~y~0)} is VALID [2022-04-28 04:00:11,171 INFO L290 TraceCheckUtils]: 32: Hoare triple {58287#(<= 49956 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {58288#(<= 49954 main_~y~0)} is VALID [2022-04-28 04:00:11,171 INFO L290 TraceCheckUtils]: 33: Hoare triple {58288#(<= 49954 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {58289#(<= 49952 main_~y~0)} is VALID [2022-04-28 04:00:11,172 INFO L290 TraceCheckUtils]: 34: Hoare triple {58289#(<= 49952 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {58290#(<= 49950 main_~y~0)} is VALID [2022-04-28 04:00:11,172 INFO L290 TraceCheckUtils]: 35: Hoare triple {58290#(<= 49950 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {58291#(<= 49948 main_~y~0)} is VALID [2022-04-28 04:00:11,172 INFO L290 TraceCheckUtils]: 36: Hoare triple {58291#(<= 49948 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {58292#(<= 49946 main_~y~0)} is VALID [2022-04-28 04:00:11,173 INFO L290 TraceCheckUtils]: 37: Hoare triple {58292#(<= 49946 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {58293#(<= 49944 main_~y~0)} is VALID [2022-04-28 04:00:11,173 INFO L290 TraceCheckUtils]: 38: Hoare triple {58293#(<= 49944 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {58294#(<= 49942 main_~y~0)} is VALID [2022-04-28 04:00:11,174 INFO L290 TraceCheckUtils]: 39: Hoare triple {58294#(<= 49942 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {58295#(<= 49940 main_~y~0)} is VALID [2022-04-28 04:00:11,174 INFO L290 TraceCheckUtils]: 40: Hoare triple {58295#(<= 49940 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {58296#(<= 49938 main_~y~0)} is VALID [2022-04-28 04:00:11,175 INFO L290 TraceCheckUtils]: 41: Hoare triple {58296#(<= 49938 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {58297#(<= 49936 main_~y~0)} is VALID [2022-04-28 04:00:11,175 INFO L290 TraceCheckUtils]: 42: Hoare triple {58297#(<= 49936 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {58298#(<= 49934 main_~y~0)} is VALID [2022-04-28 04:00:11,175 INFO L290 TraceCheckUtils]: 43: Hoare triple {58298#(<= 49934 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {58299#(<= 49932 main_~y~0)} is VALID [2022-04-28 04:00:11,176 INFO L290 TraceCheckUtils]: 44: Hoare triple {58299#(<= 49932 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {58300#(<= 49930 main_~y~0)} is VALID [2022-04-28 04:00:11,176 INFO L290 TraceCheckUtils]: 45: Hoare triple {58300#(<= 49930 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {58301#(<= 49928 main_~y~0)} is VALID [2022-04-28 04:00:11,177 INFO L290 TraceCheckUtils]: 46: Hoare triple {58301#(<= 49928 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {58302#(<= 49926 main_~y~0)} is VALID [2022-04-28 04:00:11,177 INFO L290 TraceCheckUtils]: 47: Hoare triple {58302#(<= 49926 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {58303#(<= 49924 main_~y~0)} is VALID [2022-04-28 04:00:11,177 INFO L290 TraceCheckUtils]: 48: Hoare triple {58303#(<= 49924 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {58304#(<= 49922 main_~y~0)} is VALID [2022-04-28 04:00:11,178 INFO L290 TraceCheckUtils]: 49: Hoare triple {58304#(<= 49922 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {58305#(<= 49920 main_~y~0)} is VALID [2022-04-28 04:00:11,178 INFO L290 TraceCheckUtils]: 50: Hoare triple {58305#(<= 49920 main_~y~0)} assume !(~y~0 > 0); {58261#false} is VALID [2022-04-28 04:00:11,178 INFO L272 TraceCheckUtils]: 51: Hoare triple {58261#false} call __VERIFIER_assert((if ~z~0 == ~x~0 then 1 else 0)); {58261#false} is VALID [2022-04-28 04:00:11,178 INFO L290 TraceCheckUtils]: 52: Hoare triple {58261#false} ~cond := #in~cond; {58261#false} is VALID [2022-04-28 04:00:11,178 INFO L290 TraceCheckUtils]: 53: Hoare triple {58261#false} assume 0 == ~cond; {58261#false} is VALID [2022-04-28 04:00:11,178 INFO L290 TraceCheckUtils]: 54: Hoare triple {58261#false} assume !false; {58261#false} is VALID [2022-04-28 04:00:11,179 INFO L134 CoverageAnalysis]: Checked inductivity of 822 backedges. 0 proven. 820 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-04-28 04:00:11,179 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 04:00:13,473 INFO L290 TraceCheckUtils]: 54: Hoare triple {58261#false} assume !false; {58261#false} is VALID [2022-04-28 04:00:13,473 INFO L290 TraceCheckUtils]: 53: Hoare triple {58261#false} assume 0 == ~cond; {58261#false} is VALID [2022-04-28 04:00:13,473 INFO L290 TraceCheckUtils]: 52: Hoare triple {58261#false} ~cond := #in~cond; {58261#false} is VALID [2022-04-28 04:00:13,473 INFO L272 TraceCheckUtils]: 51: Hoare triple {58261#false} call __VERIFIER_assert((if ~z~0 == ~x~0 then 1 else 0)); {58261#false} is VALID [2022-04-28 04:00:13,473 INFO L290 TraceCheckUtils]: 50: Hoare triple {58484#(< 0 main_~y~0)} assume !(~y~0 > 0); {58261#false} is VALID [2022-04-28 04:00:13,474 INFO L290 TraceCheckUtils]: 49: Hoare triple {58488#(< 2 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {58484#(< 0 main_~y~0)} is VALID [2022-04-28 04:00:13,474 INFO L290 TraceCheckUtils]: 48: Hoare triple {58492#(< 4 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {58488#(< 2 main_~y~0)} is VALID [2022-04-28 04:00:13,475 INFO L290 TraceCheckUtils]: 47: Hoare triple {58496#(< 6 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {58492#(< 4 main_~y~0)} is VALID [2022-04-28 04:00:13,475 INFO L290 TraceCheckUtils]: 46: Hoare triple {58500#(< 8 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {58496#(< 6 main_~y~0)} is VALID [2022-04-28 04:00:13,476 INFO L290 TraceCheckUtils]: 45: Hoare triple {58504#(< 10 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {58500#(< 8 main_~y~0)} is VALID [2022-04-28 04:00:13,476 INFO L290 TraceCheckUtils]: 44: Hoare triple {58508#(< 12 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {58504#(< 10 main_~y~0)} is VALID [2022-04-28 04:00:13,476 INFO L290 TraceCheckUtils]: 43: Hoare triple {58512#(< 14 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {58508#(< 12 main_~y~0)} is VALID [2022-04-28 04:00:13,477 INFO L290 TraceCheckUtils]: 42: Hoare triple {58516#(< 16 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {58512#(< 14 main_~y~0)} is VALID [2022-04-28 04:00:13,477 INFO L290 TraceCheckUtils]: 41: Hoare triple {58520#(< 18 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {58516#(< 16 main_~y~0)} is VALID [2022-04-28 04:00:13,478 INFO L290 TraceCheckUtils]: 40: Hoare triple {58524#(< 20 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {58520#(< 18 main_~y~0)} is VALID [2022-04-28 04:00:13,478 INFO L290 TraceCheckUtils]: 39: Hoare triple {58528#(< 22 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {58524#(< 20 main_~y~0)} is VALID [2022-04-28 04:00:13,478 INFO L290 TraceCheckUtils]: 38: Hoare triple {58532#(< 24 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {58528#(< 22 main_~y~0)} is VALID [2022-04-28 04:00:13,479 INFO L290 TraceCheckUtils]: 37: Hoare triple {58536#(< 26 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {58532#(< 24 main_~y~0)} is VALID [2022-04-28 04:00:13,479 INFO L290 TraceCheckUtils]: 36: Hoare triple {58540#(< 28 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {58536#(< 26 main_~y~0)} is VALID [2022-04-28 04:00:13,480 INFO L290 TraceCheckUtils]: 35: Hoare triple {58544#(< 30 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {58540#(< 28 main_~y~0)} is VALID [2022-04-28 04:00:13,480 INFO L290 TraceCheckUtils]: 34: Hoare triple {58548#(< 32 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {58544#(< 30 main_~y~0)} is VALID [2022-04-28 04:00:13,481 INFO L290 TraceCheckUtils]: 33: Hoare triple {58552#(< 34 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {58548#(< 32 main_~y~0)} is VALID [2022-04-28 04:00:13,481 INFO L290 TraceCheckUtils]: 32: Hoare triple {58556#(< 36 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {58552#(< 34 main_~y~0)} is VALID [2022-04-28 04:00:13,481 INFO L290 TraceCheckUtils]: 31: Hoare triple {58560#(< 38 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {58556#(< 36 main_~y~0)} is VALID [2022-04-28 04:00:13,482 INFO L290 TraceCheckUtils]: 30: Hoare triple {58564#(< 40 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {58560#(< 38 main_~y~0)} is VALID [2022-04-28 04:00:13,482 INFO L290 TraceCheckUtils]: 29: Hoare triple {58568#(< 42 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {58564#(< 40 main_~y~0)} is VALID [2022-04-28 04:00:13,483 INFO L290 TraceCheckUtils]: 28: Hoare triple {58572#(< 44 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {58568#(< 42 main_~y~0)} is VALID [2022-04-28 04:00:13,483 INFO L290 TraceCheckUtils]: 27: Hoare triple {58576#(< 46 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {58572#(< 44 main_~y~0)} is VALID [2022-04-28 04:00:13,483 INFO L290 TraceCheckUtils]: 26: Hoare triple {58580#(< 48 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {58576#(< 46 main_~y~0)} is VALID [2022-04-28 04:00:13,484 INFO L290 TraceCheckUtils]: 25: Hoare triple {58584#(< 50 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {58580#(< 48 main_~y~0)} is VALID [2022-04-28 04:00:13,484 INFO L290 TraceCheckUtils]: 24: Hoare triple {58588#(< 52 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {58584#(< 50 main_~y~0)} is VALID [2022-04-28 04:00:13,485 INFO L290 TraceCheckUtils]: 23: Hoare triple {58592#(< 54 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {58588#(< 52 main_~y~0)} is VALID [2022-04-28 04:00:13,485 INFO L290 TraceCheckUtils]: 22: Hoare triple {58596#(< 56 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {58592#(< 54 main_~y~0)} is VALID [2022-04-28 04:00:13,486 INFO L290 TraceCheckUtils]: 21: Hoare triple {58600#(< 58 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {58596#(< 56 main_~y~0)} is VALID [2022-04-28 04:00:13,486 INFO L290 TraceCheckUtils]: 20: Hoare triple {58604#(< 60 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {58600#(< 58 main_~y~0)} is VALID [2022-04-28 04:00:13,486 INFO L290 TraceCheckUtils]: 19: Hoare triple {58608#(< 62 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {58604#(< 60 main_~y~0)} is VALID [2022-04-28 04:00:13,487 INFO L290 TraceCheckUtils]: 18: Hoare triple {58612#(< 64 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {58608#(< 62 main_~y~0)} is VALID [2022-04-28 04:00:13,487 INFO L290 TraceCheckUtils]: 17: Hoare triple {58616#(< 66 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {58612#(< 64 main_~y~0)} is VALID [2022-04-28 04:00:13,488 INFO L290 TraceCheckUtils]: 16: Hoare triple {58620#(< 68 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {58616#(< 66 main_~y~0)} is VALID [2022-04-28 04:00:13,488 INFO L290 TraceCheckUtils]: 15: Hoare triple {58624#(< 70 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {58620#(< 68 main_~y~0)} is VALID [2022-04-28 04:00:13,489 INFO L290 TraceCheckUtils]: 14: Hoare triple {58628#(< 72 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {58624#(< 70 main_~y~0)} is VALID [2022-04-28 04:00:13,489 INFO L290 TraceCheckUtils]: 13: Hoare triple {58632#(< 74 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {58628#(< 72 main_~y~0)} is VALID [2022-04-28 04:00:13,489 INFO L290 TraceCheckUtils]: 12: Hoare triple {58636#(< 76 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {58632#(< 74 main_~y~0)} is VALID [2022-04-28 04:00:13,490 INFO L290 TraceCheckUtils]: 11: Hoare triple {58640#(< 78 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {58636#(< 76 main_~y~0)} is VALID [2022-04-28 04:00:13,490 INFO L290 TraceCheckUtils]: 10: Hoare triple {58644#(< 80 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {58640#(< 78 main_~y~0)} is VALID [2022-04-28 04:00:13,490 INFO L290 TraceCheckUtils]: 9: Hoare triple {58644#(< 80 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[] {58644#(< 80 main_~y~0)} is VALID [2022-04-28 04:00:13,491 INFO L290 TraceCheckUtils]: 8: Hoare triple {58644#(< 80 main_~y~0)} [218] L11-2-->L18-1_primed: Formula: (let ((.cse0 (= v_main_~y~0_3355 v_main_~y~0_3354)) (.cse1 (= |v_main_#t~post6_277| |v_main_#t~post6_276|)) (.cse2 (= v_main_~x~0_2912 v_main_~x~0_2911)) (.cse4 (<= 50000 v_main_~x~0_2912)) (.cse3 (= |v_main_#t~post5_277| |v_main_#t~post5_276|))) (or (and .cse0 .cse1 .cse2 .cse3) (and (< v_main_~x~0_2912 v_main_~x~0_2911) (= (+ v_main_~x~0_2911 v_main_~y~0_3355) (+ v_main_~x~0_2912 v_main_~y~0_3354)) .cse4 (< v_main_~x~0_2911 1000001)) (and .cse0 .cse1 .cse2 (or (not .cse4) (not (< v_main_~x~0_2912 1000000))) .cse3))) InVars {main_~y~0=v_main_~y~0_3355, main_#t~post5=|v_main_#t~post5_277|, main_~x~0=v_main_~x~0_2912, main_#t~post6=|v_main_#t~post6_277|} OutVars{main_~y~0=v_main_~y~0_3354, main_#t~post5=|v_main_#t~post5_276|, main_~x~0=v_main_~x~0_2911, main_#t~post6=|v_main_#t~post6_276|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {58644#(< 80 main_~y~0)} is VALID [2022-04-28 04:00:13,491 INFO L290 TraceCheckUtils]: 7: Hoare triple {58644#(< 80 main_~y~0)} [217] L18-1_primed-->L11-2: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {58644#(< 80 main_~y~0)} is VALID [2022-04-28 04:00:13,492 INFO L290 TraceCheckUtils]: 6: Hoare triple {58644#(< 80 main_~y~0)} [216] L11-2-->L18-1_primed: Formula: (let ((.cse0 (= |v_main_#t~post4_253| |v_main_#t~post4_252|))) (or (and (= v_main_~x~0_2909 v_main_~x~0_2910) .cse0 (<= 50000 v_main_~x~0_2910)) (and .cse0 (= v_main_~x~0_2910 v_main_~x~0_2909)) (and (< v_main_~x~0_2909 50001) (< v_main_~x~0_2910 v_main_~x~0_2909)))) InVars {main_~x~0=v_main_~x~0_2910, main_#t~post4=|v_main_#t~post4_253|} OutVars{main_~x~0=v_main_~x~0_2909, main_#t~post4=|v_main_#t~post4_252|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {58644#(< 80 main_~y~0)} is VALID [2022-04-28 04:00:13,492 INFO L290 TraceCheckUtils]: 5: Hoare triple {58260#true} ~x~0 := 0;~y~0 := 50000;~z~0 := 0;~x~0 := 0; {58644#(< 80 main_~y~0)} is VALID [2022-04-28 04:00:13,492 INFO L272 TraceCheckUtils]: 4: Hoare triple {58260#true} call #t~ret7 := main(); {58260#true} is VALID [2022-04-28 04:00:13,492 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {58260#true} {58260#true} #52#return; {58260#true} is VALID [2022-04-28 04:00:13,492 INFO L290 TraceCheckUtils]: 2: Hoare triple {58260#true} assume true; {58260#true} is VALID [2022-04-28 04:00:13,492 INFO L290 TraceCheckUtils]: 1: Hoare triple {58260#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); {58260#true} is VALID [2022-04-28 04:00:13,492 INFO L272 TraceCheckUtils]: 0: Hoare triple {58260#true} call ULTIMATE.init(); {58260#true} is VALID [2022-04-28 04:00:13,493 INFO L134 CoverageAnalysis]: Checked inductivity of 822 backedges. 0 proven. 820 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-04-28 04:00:13,493 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [472723581] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 04:00:13,493 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 04:00:13,493 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [44, 43, 43] total 85 [2022-04-28 04:00:17,355 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 04:00:17,355 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1429321359] [2022-04-28 04:00:17,355 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1429321359] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 04:00:17,355 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 04:00:17,355 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [118] imperfect sequences [] total 118 [2022-04-28 04:00:17,355 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [944090387] [2022-04-28 04:00:17,355 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 04:00:17,356 INFO L78 Accepts]: Start accepts. Automaton has has 118 states, 118 states have (on average 1.6440677966101696) internal successors, (194), 117 states have internal predecessors, (194), 2 states have call successors, (3), 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 198 [2022-04-28 04:00:17,356 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 04:00:17,356 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 118 states, 118 states have (on average 1.6440677966101696) internal successors, (194), 117 states have internal predecessors, (194), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 04:00:17,501 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 198 edges. 198 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 04:00:17,501 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 118 states [2022-04-28 04:00:17,502 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 04:00:17,502 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 118 interpolants. [2022-04-28 04:00:17,504 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9777, Invalid=15345, Unknown=0, NotChecked=0, Total=25122 [2022-04-28 04:00:17,504 INFO L87 Difference]: Start difference. First operand 199 states and 202 transitions. Second operand has 118 states, 118 states have (on average 1.6440677966101696) internal successors, (194), 117 states have internal predecessors, (194), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 04:00:39,237 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 04:00:39,237 INFO L93 Difference]: Finished difference Result 395 states and 406 transitions. [2022-04-28 04:00:39,237 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 118 states. [2022-04-28 04:00:39,237 INFO L78 Accepts]: Start accepts. Automaton has has 118 states, 118 states have (on average 1.6440677966101696) internal successors, (194), 117 states have internal predecessors, (194), 2 states have call successors, (3), 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 198 [2022-04-28 04:00:39,238 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 04:00:39,238 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 118 states, 118 states have (on average 1.6440677966101696) internal successors, (194), 117 states have internal predecessors, (194), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 04:00:39,239 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 118 states to 118 states and 220 transitions. [2022-04-28 04:00:39,240 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 118 states, 118 states have (on average 1.6440677966101696) internal successors, (194), 117 states have internal predecessors, (194), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 04:00:39,241 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 118 states to 118 states and 220 transitions. [2022-04-28 04:00:39,241 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 118 states and 220 transitions. [2022-04-28 04:00:39,428 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 220 edges. 220 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 04:00:39,430 INFO L225 Difference]: With dead ends: 395 [2022-04-28 04:00:39,430 INFO L226 Difference]: Without dead ends: 204 [2022-04-28 04:00:39,435 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 421 GetRequests, 148 SyntacticMatches, 1 SemanticMatches, 272 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21778 ImplicationChecksByTransitivity, 10.6s TimeCoverageRelationStatistics Valid=22806, Invalid=51996, Unknown=0, NotChecked=0, Total=74802 [2022-04-28 04:00:39,437 INFO L413 NwaCegarLoop]: 12 mSDtfsCounter, 310 mSDsluCounter, 37 mSDsCounter, 0 mSdLazyCounter, 11021 mSolverCounterSat, 354 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 8.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 310 SdHoareTripleChecker+Valid, 49 SdHoareTripleChecker+Invalid, 11375 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 354 IncrementalHoareTripleChecker+Valid, 11021 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 8.8s IncrementalHoareTripleChecker+Time [2022-04-28 04:00:39,437 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [310 Valid, 49 Invalid, 11375 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [354 Valid, 11021 Invalid, 0 Unknown, 0 Unchecked, 8.8s Time] [2022-04-28 04:00:39,438 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 204 states. [2022-04-28 04:00:39,784 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 204 to 204. [2022-04-28 04:00:39,785 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 04:00:39,785 INFO L82 GeneralOperation]: Start isEquivalent. First operand 204 states. Second operand has 204 states, 199 states have (on average 1.020100502512563) internal successors, (203), 199 states have internal predecessors, (203), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 04:00:39,785 INFO L74 IsIncluded]: Start isIncluded. First operand 204 states. Second operand has 204 states, 199 states have (on average 1.020100502512563) internal successors, (203), 199 states have internal predecessors, (203), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 04:00:39,787 INFO L87 Difference]: Start difference. First operand 204 states. Second operand has 204 states, 199 states have (on average 1.020100502512563) internal successors, (203), 199 states have internal predecessors, (203), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 04:00:39,791 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 04:00:39,791 INFO L93 Difference]: Finished difference Result 204 states and 207 transitions. [2022-04-28 04:00:39,791 INFO L276 IsEmpty]: Start isEmpty. Operand 204 states and 207 transitions. [2022-04-28 04:00:39,791 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 04:00:39,792 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 04:00:39,792 INFO L74 IsIncluded]: Start isIncluded. First operand has 204 states, 199 states have (on average 1.020100502512563) internal successors, (203), 199 states have internal predecessors, (203), 3 states have call successors, (3), 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 204 states. [2022-04-28 04:00:39,792 INFO L87 Difference]: Start difference. First operand has 204 states, 199 states have (on average 1.020100502512563) internal successors, (203), 199 states have internal predecessors, (203), 3 states have call successors, (3), 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 204 states. [2022-04-28 04:00:39,795 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 04:00:39,795 INFO L93 Difference]: Finished difference Result 204 states and 207 transitions. [2022-04-28 04:00:39,795 INFO L276 IsEmpty]: Start isEmpty. Operand 204 states and 207 transitions. [2022-04-28 04:00:39,795 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 04:00:39,795 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 04:00:39,795 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 04:00:39,795 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 04:00:39,795 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 204 states, 199 states have (on average 1.020100502512563) internal successors, (203), 199 states have internal predecessors, (203), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 04:00:39,798 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 204 states to 204 states and 207 transitions. [2022-04-28 04:00:39,799 INFO L78 Accepts]: Start accepts. Automaton has 204 states and 207 transitions. Word has length 198 [2022-04-28 04:00:39,799 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 04:00:39,799 INFO L495 AbstractCegarLoop]: Abstraction has 204 states and 207 transitions. [2022-04-28 04:00:39,799 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 118 states, 118 states have (on average 1.6440677966101696) internal successors, (194), 117 states have internal predecessors, (194), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 04:00:39,799 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 204 states and 207 transitions. [2022-04-28 04:00:39,982 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 207 edges. 207 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 04:00:39,982 INFO L276 IsEmpty]: Start isEmpty. Operand 204 states and 207 transitions. [2022-04-28 04:00:39,983 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 204 [2022-04-28 04:00:39,983 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 04:00:39,983 INFO L195 NwaCegarLoop]: trace histogram [75, 74, 41, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 04:00:40,007 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (41)] Ended with exit code 0 [2022-04-28 04:00:40,183 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 41 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable42 [2022-04-28 04:00:40,184 INFO L420 AbstractCegarLoop]: === Iteration 44 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 04:00:40,184 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 04:00:40,184 INFO L85 PathProgramCache]: Analyzing trace with hash 484571639, now seen corresponding path program 41 times [2022-04-28 04:00:40,184 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 04:00:40,184 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [927747751] [2022-04-28 04:00:40,292 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 1 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 04:00:40,488 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={1=1, 2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 04:00:40,489 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-28 04:00:40,491 INFO L85 PathProgramCache]: Analyzing trace with hash 1464678402, now seen corresponding path program 1 times [2022-04-28 04:00:40,491 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 04:00:40,491 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [281452651] [2022-04-28 04:00:40,491 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 04:00:40,491 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 04:00:40,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 04:00:41,417 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 04:00:41,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 04:00:41,421 INFO L290 TraceCheckUtils]: 0: Hoare triple {60637#(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); {60587#true} is VALID [2022-04-28 04:00:41,421 INFO L290 TraceCheckUtils]: 1: Hoare triple {60587#true} assume true; {60587#true} is VALID [2022-04-28 04:00:41,421 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {60587#true} {60587#true} #52#return; {60587#true} is VALID [2022-04-28 04:00:41,423 INFO L272 TraceCheckUtils]: 0: Hoare triple {60587#true} call ULTIMATE.init(); {60637#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 04:00:41,423 INFO L290 TraceCheckUtils]: 1: Hoare triple {60637#(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); {60587#true} is VALID [2022-04-28 04:00:41,423 INFO L290 TraceCheckUtils]: 2: Hoare triple {60587#true} assume true; {60587#true} is VALID [2022-04-28 04:00:41,423 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {60587#true} {60587#true} #52#return; {60587#true} is VALID [2022-04-28 04:00:41,423 INFO L272 TraceCheckUtils]: 4: Hoare triple {60587#true} call #t~ret7 := main(); {60587#true} is VALID [2022-04-28 04:00:41,423 INFO L290 TraceCheckUtils]: 5: Hoare triple {60587#true} ~x~0 := 0;~y~0 := 50000;~z~0 := 0;~x~0 := 0; {60592#(and (= main_~x~0 0) (<= 50000 main_~y~0))} is VALID [2022-04-28 04:00:41,424 INFO L290 TraceCheckUtils]: 6: Hoare triple {60592#(and (= main_~x~0 0) (<= 50000 main_~y~0))} [220] L11-2-->L18-1_primed: Formula: (let ((.cse0 (= |v_main_#t~post4_259| |v_main_#t~post4_258|)) (.cse1 (= v_main_~x~0_3039 v_main_~x~0_3038))) (or (and (< v_main_~x~0_3038 50001) (< v_main_~x~0_3039 v_main_~x~0_3038)) (and .cse0 (<= 50000 v_main_~x~0_3039) .cse1) (and .cse0 .cse1))) InVars {main_~x~0=v_main_~x~0_3039, main_#t~post4=|v_main_#t~post4_259|} OutVars{main_~x~0=v_main_~x~0_3038, main_#t~post4=|v_main_#t~post4_258|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {60593#(and (<= main_~x~0 main_~y~0) (<= 50000 main_~y~0))} is VALID [2022-04-28 04:00:41,424 INFO L290 TraceCheckUtils]: 7: Hoare triple {60593#(and (<= main_~x~0 main_~y~0) (<= 50000 main_~y~0))} [221] L18-1_primed-->L11-2: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {60593#(and (<= main_~x~0 main_~y~0) (<= 50000 main_~y~0))} is VALID [2022-04-28 04:00:41,425 INFO L290 TraceCheckUtils]: 8: Hoare triple {60593#(and (<= main_~x~0 main_~y~0) (<= 50000 main_~y~0))} [222] L11-2-->L18-1_primed: Formula: (let ((.cse0 (<= 50000 v_main_~x~0_3041)) (.cse1 (= v_main_~y~0_3516 v_main_~y~0_3515)) (.cse2 (= |v_main_#t~post5_284| |v_main_#t~post5_283|)) (.cse3 (= |v_main_#t~post6_284| |v_main_#t~post6_283|))) (or (and .cse0 (< v_main_~x~0_3041 v_main_~x~0_3040) (= (+ v_main_~x~0_3041 v_main_~y~0_3515) (+ v_main_~x~0_3040 v_main_~y~0_3516)) (< v_main_~x~0_3040 1000001)) (and (= v_main_~x~0_3041 v_main_~x~0_3040) .cse1 .cse2 .cse3) (and (or (not (< v_main_~x~0_3041 1000000)) (not .cse0)) (= v_main_~x~0_3040 v_main_~x~0_3041) .cse1 .cse2 .cse3))) InVars {main_~y~0=v_main_~y~0_3516, main_#t~post5=|v_main_#t~post5_284|, main_~x~0=v_main_~x~0_3041, main_#t~post6=|v_main_#t~post6_284|} OutVars{main_~y~0=v_main_~y~0_3515, main_#t~post5=|v_main_#t~post5_283|, main_~x~0=v_main_~x~0_3040, main_#t~post6=|v_main_#t~post6_283|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {60594#(or (<= main_~x~0 main_~y~0) (<= 50000 main_~y~0))} is VALID [2022-04-28 04:00:41,425 INFO L290 TraceCheckUtils]: 9: Hoare triple {60594#(or (<= main_~x~0 main_~y~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[] {60595#(<= 50000 main_~y~0)} is VALID [2022-04-28 04:00:41,426 INFO L290 TraceCheckUtils]: 10: Hoare triple {60595#(<= 50000 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {60596#(<= 49998 main_~y~0)} is VALID [2022-04-28 04:00:41,426 INFO L290 TraceCheckUtils]: 11: Hoare triple {60596#(<= 49998 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {60597#(<= 49996 main_~y~0)} is VALID [2022-04-28 04:00:41,427 INFO L290 TraceCheckUtils]: 12: Hoare triple {60597#(<= 49996 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {60598#(<= 49994 main_~y~0)} is VALID [2022-04-28 04:00:41,427 INFO L290 TraceCheckUtils]: 13: Hoare triple {60598#(<= 49994 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {60599#(<= 49992 main_~y~0)} is VALID [2022-04-28 04:00:41,428 INFO L290 TraceCheckUtils]: 14: Hoare triple {60599#(<= 49992 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {60600#(<= 49990 main_~y~0)} is VALID [2022-04-28 04:00:41,428 INFO L290 TraceCheckUtils]: 15: Hoare triple {60600#(<= 49990 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {60601#(<= 49988 main_~y~0)} is VALID [2022-04-28 04:00:41,429 INFO L290 TraceCheckUtils]: 16: Hoare triple {60601#(<= 49988 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {60602#(<= 49986 main_~y~0)} is VALID [2022-04-28 04:00:41,429 INFO L290 TraceCheckUtils]: 17: Hoare triple {60602#(<= 49986 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {60603#(<= 49984 main_~y~0)} is VALID [2022-04-28 04:00:41,430 INFO L290 TraceCheckUtils]: 18: Hoare triple {60603#(<= 49984 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {60604#(<= 49982 main_~y~0)} is VALID [2022-04-28 04:00:41,430 INFO L290 TraceCheckUtils]: 19: Hoare triple {60604#(<= 49982 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {60605#(<= 49980 main_~y~0)} is VALID [2022-04-28 04:00:41,431 INFO L290 TraceCheckUtils]: 20: Hoare triple {60605#(<= 49980 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {60606#(<= 49978 main_~y~0)} is VALID [2022-04-28 04:00:41,431 INFO L290 TraceCheckUtils]: 21: Hoare triple {60606#(<= 49978 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {60607#(<= 49976 main_~y~0)} is VALID [2022-04-28 04:00:41,432 INFO L290 TraceCheckUtils]: 22: Hoare triple {60607#(<= 49976 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {60608#(<= 49974 main_~y~0)} is VALID [2022-04-28 04:00:41,432 INFO L290 TraceCheckUtils]: 23: Hoare triple {60608#(<= 49974 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {60609#(<= 49972 main_~y~0)} is VALID [2022-04-28 04:00:41,432 INFO L290 TraceCheckUtils]: 24: Hoare triple {60609#(<= 49972 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {60610#(<= 49970 main_~y~0)} is VALID [2022-04-28 04:00:41,433 INFO L290 TraceCheckUtils]: 25: Hoare triple {60610#(<= 49970 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {60611#(<= 49968 main_~y~0)} is VALID [2022-04-28 04:00:41,433 INFO L290 TraceCheckUtils]: 26: Hoare triple {60611#(<= 49968 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {60612#(<= 49966 main_~y~0)} is VALID [2022-04-28 04:00:41,434 INFO L290 TraceCheckUtils]: 27: Hoare triple {60612#(<= 49966 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {60613#(<= 49964 main_~y~0)} is VALID [2022-04-28 04:00:41,434 INFO L290 TraceCheckUtils]: 28: Hoare triple {60613#(<= 49964 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {60614#(<= 49962 main_~y~0)} is VALID [2022-04-28 04:00:41,435 INFO L290 TraceCheckUtils]: 29: Hoare triple {60614#(<= 49962 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {60615#(<= 49960 main_~y~0)} is VALID [2022-04-28 04:00:41,435 INFO L290 TraceCheckUtils]: 30: Hoare triple {60615#(<= 49960 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {60616#(<= 49958 main_~y~0)} is VALID [2022-04-28 04:00:41,436 INFO L290 TraceCheckUtils]: 31: Hoare triple {60616#(<= 49958 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {60617#(<= 49956 main_~y~0)} is VALID [2022-04-28 04:00:41,436 INFO L290 TraceCheckUtils]: 32: Hoare triple {60617#(<= 49956 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {60618#(<= 49954 main_~y~0)} is VALID [2022-04-28 04:00:41,437 INFO L290 TraceCheckUtils]: 33: Hoare triple {60618#(<= 49954 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {60619#(<= 49952 main_~y~0)} is VALID [2022-04-28 04:00:41,437 INFO L290 TraceCheckUtils]: 34: Hoare triple {60619#(<= 49952 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {60620#(<= 49950 main_~y~0)} is VALID [2022-04-28 04:00:41,437 INFO L290 TraceCheckUtils]: 35: Hoare triple {60620#(<= 49950 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {60621#(<= 49948 main_~y~0)} is VALID [2022-04-28 04:00:41,438 INFO L290 TraceCheckUtils]: 36: Hoare triple {60621#(<= 49948 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {60622#(<= 49946 main_~y~0)} is VALID [2022-04-28 04:00:41,438 INFO L290 TraceCheckUtils]: 37: Hoare triple {60622#(<= 49946 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {60623#(<= 49944 main_~y~0)} is VALID [2022-04-28 04:00:41,439 INFO L290 TraceCheckUtils]: 38: Hoare triple {60623#(<= 49944 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {60624#(<= 49942 main_~y~0)} is VALID [2022-04-28 04:00:41,439 INFO L290 TraceCheckUtils]: 39: Hoare triple {60624#(<= 49942 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {60625#(<= 49940 main_~y~0)} is VALID [2022-04-28 04:00:41,440 INFO L290 TraceCheckUtils]: 40: Hoare triple {60625#(<= 49940 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {60626#(<= 49938 main_~y~0)} is VALID [2022-04-28 04:00:41,440 INFO L290 TraceCheckUtils]: 41: Hoare triple {60626#(<= 49938 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {60627#(<= 49936 main_~y~0)} is VALID [2022-04-28 04:00:41,440 INFO L290 TraceCheckUtils]: 42: Hoare triple {60627#(<= 49936 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {60628#(<= 49934 main_~y~0)} is VALID [2022-04-28 04:00:41,441 INFO L290 TraceCheckUtils]: 43: Hoare triple {60628#(<= 49934 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {60629#(<= 49932 main_~y~0)} is VALID [2022-04-28 04:00:41,441 INFO L290 TraceCheckUtils]: 44: Hoare triple {60629#(<= 49932 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {60630#(<= 49930 main_~y~0)} is VALID [2022-04-28 04:00:41,442 INFO L290 TraceCheckUtils]: 45: Hoare triple {60630#(<= 49930 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {60631#(<= 49928 main_~y~0)} is VALID [2022-04-28 04:00:41,442 INFO L290 TraceCheckUtils]: 46: Hoare triple {60631#(<= 49928 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {60632#(<= 49926 main_~y~0)} is VALID [2022-04-28 04:00:41,442 INFO L290 TraceCheckUtils]: 47: Hoare triple {60632#(<= 49926 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {60633#(<= 49924 main_~y~0)} is VALID [2022-04-28 04:00:41,443 INFO L290 TraceCheckUtils]: 48: Hoare triple {60633#(<= 49924 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {60634#(<= 49922 main_~y~0)} is VALID [2022-04-28 04:00:41,443 INFO L290 TraceCheckUtils]: 49: Hoare triple {60634#(<= 49922 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {60635#(<= 49920 main_~y~0)} is VALID [2022-04-28 04:00:41,444 INFO L290 TraceCheckUtils]: 50: Hoare triple {60635#(<= 49920 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {60636#(<= 49918 main_~y~0)} is VALID [2022-04-28 04:00:41,444 INFO L290 TraceCheckUtils]: 51: Hoare triple {60636#(<= 49918 main_~y~0)} assume !(~y~0 > 0); {60588#false} is VALID [2022-04-28 04:00:41,444 INFO L272 TraceCheckUtils]: 52: Hoare triple {60588#false} call __VERIFIER_assert((if ~z~0 == ~x~0 then 1 else 0)); {60588#false} is VALID [2022-04-28 04:00:41,444 INFO L290 TraceCheckUtils]: 53: Hoare triple {60588#false} ~cond := #in~cond; {60588#false} is VALID [2022-04-28 04:00:41,444 INFO L290 TraceCheckUtils]: 54: Hoare triple {60588#false} assume 0 == ~cond; {60588#false} is VALID [2022-04-28 04:00:41,444 INFO L290 TraceCheckUtils]: 55: Hoare triple {60588#false} assume !false; {60588#false} is VALID [2022-04-28 04:00:41,445 INFO L134 CoverageAnalysis]: Checked inductivity of 863 backedges. 0 proven. 863 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 04:00:41,445 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 04:00:41,445 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [281452651] [2022-04-28 04:00:41,445 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [281452651] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 04:00:41,445 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [544111830] [2022-04-28 04:00:41,445 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 04:00:41,445 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 04:00:41,445 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 04:00:41,446 INFO L229 MonitoredProcess]: Starting monitored process 42 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 04:00:41,449 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (42)] Waiting until timeout for monitored process [2022-04-28 04:00:41,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 04:00:41,503 INFO L263 TraceCheckSpWp]: Trace formula consists of 264 conjuncts, 44 conjunts are in the unsatisfiable core [2022-04-28 04:00:41,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 04:00:41,544 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 04:00:42,056 INFO L272 TraceCheckUtils]: 0: Hoare triple {60587#true} call ULTIMATE.init(); {60587#true} is VALID [2022-04-28 04:00:42,056 INFO L290 TraceCheckUtils]: 1: Hoare triple {60587#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); {60587#true} is VALID [2022-04-28 04:00:42,056 INFO L290 TraceCheckUtils]: 2: Hoare triple {60587#true} assume true; {60587#true} is VALID [2022-04-28 04:00:42,056 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {60587#true} {60587#true} #52#return; {60587#true} is VALID [2022-04-28 04:00:42,056 INFO L272 TraceCheckUtils]: 4: Hoare triple {60587#true} call #t~ret7 := main(); {60587#true} is VALID [2022-04-28 04:00:42,057 INFO L290 TraceCheckUtils]: 5: Hoare triple {60587#true} ~x~0 := 0;~y~0 := 50000;~z~0 := 0;~x~0 := 0; {60595#(<= 50000 main_~y~0)} is VALID [2022-04-28 04:00:42,057 INFO L290 TraceCheckUtils]: 6: Hoare triple {60595#(<= 50000 main_~y~0)} [220] L11-2-->L18-1_primed: Formula: (let ((.cse0 (= |v_main_#t~post4_259| |v_main_#t~post4_258|)) (.cse1 (= v_main_~x~0_3039 v_main_~x~0_3038))) (or (and (< v_main_~x~0_3038 50001) (< v_main_~x~0_3039 v_main_~x~0_3038)) (and .cse0 (<= 50000 v_main_~x~0_3039) .cse1) (and .cse0 .cse1))) InVars {main_~x~0=v_main_~x~0_3039, main_#t~post4=|v_main_#t~post4_259|} OutVars{main_~x~0=v_main_~x~0_3038, main_#t~post4=|v_main_#t~post4_258|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {60595#(<= 50000 main_~y~0)} is VALID [2022-04-28 04:00:42,057 INFO L290 TraceCheckUtils]: 7: Hoare triple {60595#(<= 50000 main_~y~0)} [221] L18-1_primed-->L11-2: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {60595#(<= 50000 main_~y~0)} is VALID [2022-04-28 04:00:42,058 INFO L290 TraceCheckUtils]: 8: Hoare triple {60595#(<= 50000 main_~y~0)} [222] L11-2-->L18-1_primed: Formula: (let ((.cse0 (<= 50000 v_main_~x~0_3041)) (.cse1 (= v_main_~y~0_3516 v_main_~y~0_3515)) (.cse2 (= |v_main_#t~post5_284| |v_main_#t~post5_283|)) (.cse3 (= |v_main_#t~post6_284| |v_main_#t~post6_283|))) (or (and .cse0 (< v_main_~x~0_3041 v_main_~x~0_3040) (= (+ v_main_~x~0_3041 v_main_~y~0_3515) (+ v_main_~x~0_3040 v_main_~y~0_3516)) (< v_main_~x~0_3040 1000001)) (and (= v_main_~x~0_3041 v_main_~x~0_3040) .cse1 .cse2 .cse3) (and (or (not (< v_main_~x~0_3041 1000000)) (not .cse0)) (= v_main_~x~0_3040 v_main_~x~0_3041) .cse1 .cse2 .cse3))) InVars {main_~y~0=v_main_~y~0_3516, main_#t~post5=|v_main_#t~post5_284|, main_~x~0=v_main_~x~0_3041, main_#t~post6=|v_main_#t~post6_284|} OutVars{main_~y~0=v_main_~y~0_3515, main_#t~post5=|v_main_#t~post5_283|, main_~x~0=v_main_~x~0_3040, main_#t~post6=|v_main_#t~post6_283|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {60595#(<= 50000 main_~y~0)} is VALID [2022-04-28 04:00:42,058 INFO L290 TraceCheckUtils]: 9: Hoare triple {60595#(<= 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[] {60595#(<= 50000 main_~y~0)} is VALID [2022-04-28 04:00:42,059 INFO L290 TraceCheckUtils]: 10: Hoare triple {60595#(<= 50000 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {60596#(<= 49998 main_~y~0)} is VALID [2022-04-28 04:00:42,059 INFO L290 TraceCheckUtils]: 11: Hoare triple {60596#(<= 49998 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {60597#(<= 49996 main_~y~0)} is VALID [2022-04-28 04:00:42,060 INFO L290 TraceCheckUtils]: 12: Hoare triple {60597#(<= 49996 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {60598#(<= 49994 main_~y~0)} is VALID [2022-04-28 04:00:42,060 INFO L290 TraceCheckUtils]: 13: Hoare triple {60598#(<= 49994 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {60599#(<= 49992 main_~y~0)} is VALID [2022-04-28 04:00:42,061 INFO L290 TraceCheckUtils]: 14: Hoare triple {60599#(<= 49992 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {60600#(<= 49990 main_~y~0)} is VALID [2022-04-28 04:00:42,061 INFO L290 TraceCheckUtils]: 15: Hoare triple {60600#(<= 49990 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {60601#(<= 49988 main_~y~0)} is VALID [2022-04-28 04:00:42,062 INFO L290 TraceCheckUtils]: 16: Hoare triple {60601#(<= 49988 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {60602#(<= 49986 main_~y~0)} is VALID [2022-04-28 04:00:42,062 INFO L290 TraceCheckUtils]: 17: Hoare triple {60602#(<= 49986 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {60603#(<= 49984 main_~y~0)} is VALID [2022-04-28 04:00:42,063 INFO L290 TraceCheckUtils]: 18: Hoare triple {60603#(<= 49984 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {60604#(<= 49982 main_~y~0)} is VALID [2022-04-28 04:00:42,063 INFO L290 TraceCheckUtils]: 19: Hoare triple {60604#(<= 49982 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {60605#(<= 49980 main_~y~0)} is VALID [2022-04-28 04:00:42,064 INFO L290 TraceCheckUtils]: 20: Hoare triple {60605#(<= 49980 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {60606#(<= 49978 main_~y~0)} is VALID [2022-04-28 04:00:42,064 INFO L290 TraceCheckUtils]: 21: Hoare triple {60606#(<= 49978 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {60607#(<= 49976 main_~y~0)} is VALID [2022-04-28 04:00:42,065 INFO L290 TraceCheckUtils]: 22: Hoare triple {60607#(<= 49976 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {60608#(<= 49974 main_~y~0)} is VALID [2022-04-28 04:00:42,065 INFO L290 TraceCheckUtils]: 23: Hoare triple {60608#(<= 49974 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {60609#(<= 49972 main_~y~0)} is VALID [2022-04-28 04:00:42,066 INFO L290 TraceCheckUtils]: 24: Hoare triple {60609#(<= 49972 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {60610#(<= 49970 main_~y~0)} is VALID [2022-04-28 04:00:42,066 INFO L290 TraceCheckUtils]: 25: Hoare triple {60610#(<= 49970 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {60611#(<= 49968 main_~y~0)} is VALID [2022-04-28 04:00:42,066 INFO L290 TraceCheckUtils]: 26: Hoare triple {60611#(<= 49968 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {60612#(<= 49966 main_~y~0)} is VALID [2022-04-28 04:00:42,067 INFO L290 TraceCheckUtils]: 27: Hoare triple {60612#(<= 49966 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {60613#(<= 49964 main_~y~0)} is VALID [2022-04-28 04:00:42,067 INFO L290 TraceCheckUtils]: 28: Hoare triple {60613#(<= 49964 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {60614#(<= 49962 main_~y~0)} is VALID [2022-04-28 04:00:42,068 INFO L290 TraceCheckUtils]: 29: Hoare triple {60614#(<= 49962 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {60615#(<= 49960 main_~y~0)} is VALID [2022-04-28 04:00:42,068 INFO L290 TraceCheckUtils]: 30: Hoare triple {60615#(<= 49960 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {60616#(<= 49958 main_~y~0)} is VALID [2022-04-28 04:00:42,069 INFO L290 TraceCheckUtils]: 31: Hoare triple {60616#(<= 49958 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {60617#(<= 49956 main_~y~0)} is VALID [2022-04-28 04:00:42,069 INFO L290 TraceCheckUtils]: 32: Hoare triple {60617#(<= 49956 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {60618#(<= 49954 main_~y~0)} is VALID [2022-04-28 04:00:42,070 INFO L290 TraceCheckUtils]: 33: Hoare triple {60618#(<= 49954 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {60619#(<= 49952 main_~y~0)} is VALID [2022-04-28 04:00:42,070 INFO L290 TraceCheckUtils]: 34: Hoare triple {60619#(<= 49952 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {60620#(<= 49950 main_~y~0)} is VALID [2022-04-28 04:00:42,070 INFO L290 TraceCheckUtils]: 35: Hoare triple {60620#(<= 49950 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {60621#(<= 49948 main_~y~0)} is VALID [2022-04-28 04:00:42,071 INFO L290 TraceCheckUtils]: 36: Hoare triple {60621#(<= 49948 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {60622#(<= 49946 main_~y~0)} is VALID [2022-04-28 04:00:42,071 INFO L290 TraceCheckUtils]: 37: Hoare triple {60622#(<= 49946 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {60623#(<= 49944 main_~y~0)} is VALID [2022-04-28 04:00:42,072 INFO L290 TraceCheckUtils]: 38: Hoare triple {60623#(<= 49944 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {60624#(<= 49942 main_~y~0)} is VALID [2022-04-28 04:00:42,072 INFO L290 TraceCheckUtils]: 39: Hoare triple {60624#(<= 49942 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {60625#(<= 49940 main_~y~0)} is VALID [2022-04-28 04:00:42,072 INFO L290 TraceCheckUtils]: 40: Hoare triple {60625#(<= 49940 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {60626#(<= 49938 main_~y~0)} is VALID [2022-04-28 04:00:42,073 INFO L290 TraceCheckUtils]: 41: Hoare triple {60626#(<= 49938 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {60627#(<= 49936 main_~y~0)} is VALID [2022-04-28 04:00:42,073 INFO L290 TraceCheckUtils]: 42: Hoare triple {60627#(<= 49936 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {60628#(<= 49934 main_~y~0)} is VALID [2022-04-28 04:00:42,074 INFO L290 TraceCheckUtils]: 43: Hoare triple {60628#(<= 49934 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {60629#(<= 49932 main_~y~0)} is VALID [2022-04-28 04:00:42,074 INFO L290 TraceCheckUtils]: 44: Hoare triple {60629#(<= 49932 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {60630#(<= 49930 main_~y~0)} is VALID [2022-04-28 04:00:42,075 INFO L290 TraceCheckUtils]: 45: Hoare triple {60630#(<= 49930 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {60631#(<= 49928 main_~y~0)} is VALID [2022-04-28 04:00:42,075 INFO L290 TraceCheckUtils]: 46: Hoare triple {60631#(<= 49928 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {60632#(<= 49926 main_~y~0)} is VALID [2022-04-28 04:00:42,075 INFO L290 TraceCheckUtils]: 47: Hoare triple {60632#(<= 49926 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {60633#(<= 49924 main_~y~0)} is VALID [2022-04-28 04:00:42,076 INFO L290 TraceCheckUtils]: 48: Hoare triple {60633#(<= 49924 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {60634#(<= 49922 main_~y~0)} is VALID [2022-04-28 04:00:42,076 INFO L290 TraceCheckUtils]: 49: Hoare triple {60634#(<= 49922 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {60635#(<= 49920 main_~y~0)} is VALID [2022-04-28 04:00:42,077 INFO L290 TraceCheckUtils]: 50: Hoare triple {60635#(<= 49920 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {60636#(<= 49918 main_~y~0)} is VALID [2022-04-28 04:00:42,077 INFO L290 TraceCheckUtils]: 51: Hoare triple {60636#(<= 49918 main_~y~0)} assume !(~y~0 > 0); {60588#false} is VALID [2022-04-28 04:00:42,077 INFO L272 TraceCheckUtils]: 52: Hoare triple {60588#false} call __VERIFIER_assert((if ~z~0 == ~x~0 then 1 else 0)); {60588#false} is VALID [2022-04-28 04:00:42,077 INFO L290 TraceCheckUtils]: 53: Hoare triple {60588#false} ~cond := #in~cond; {60588#false} is VALID [2022-04-28 04:00:42,077 INFO L290 TraceCheckUtils]: 54: Hoare triple {60588#false} assume 0 == ~cond; {60588#false} is VALID [2022-04-28 04:00:42,077 INFO L290 TraceCheckUtils]: 55: Hoare triple {60588#false} assume !false; {60588#false} is VALID [2022-04-28 04:00:42,078 INFO L134 CoverageAnalysis]: Checked inductivity of 863 backedges. 0 proven. 861 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-04-28 04:00:42,078 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 04:00:44,487 INFO L290 TraceCheckUtils]: 55: Hoare triple {60588#false} assume !false; {60588#false} is VALID [2022-04-28 04:00:44,487 INFO L290 TraceCheckUtils]: 54: Hoare triple {60588#false} assume 0 == ~cond; {60588#false} is VALID [2022-04-28 04:00:44,487 INFO L290 TraceCheckUtils]: 53: Hoare triple {60588#false} ~cond := #in~cond; {60588#false} is VALID [2022-04-28 04:00:44,487 INFO L272 TraceCheckUtils]: 52: Hoare triple {60588#false} call __VERIFIER_assert((if ~z~0 == ~x~0 then 1 else 0)); {60588#false} is VALID [2022-04-28 04:00:44,487 INFO L290 TraceCheckUtils]: 51: Hoare triple {60818#(< 0 main_~y~0)} assume !(~y~0 > 0); {60588#false} is VALID [2022-04-28 04:00:44,488 INFO L290 TraceCheckUtils]: 50: Hoare triple {60822#(< 2 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {60818#(< 0 main_~y~0)} is VALID [2022-04-28 04:00:44,488 INFO L290 TraceCheckUtils]: 49: Hoare triple {60826#(< 4 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {60822#(< 2 main_~y~0)} is VALID [2022-04-28 04:00:44,489 INFO L290 TraceCheckUtils]: 48: Hoare triple {60830#(< 6 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {60826#(< 4 main_~y~0)} is VALID [2022-04-28 04:00:44,489 INFO L290 TraceCheckUtils]: 47: Hoare triple {60834#(< 8 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {60830#(< 6 main_~y~0)} is VALID [2022-04-28 04:00:44,490 INFO L290 TraceCheckUtils]: 46: Hoare triple {60838#(< 10 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {60834#(< 8 main_~y~0)} is VALID [2022-04-28 04:00:44,490 INFO L290 TraceCheckUtils]: 45: Hoare triple {60842#(< 12 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {60838#(< 10 main_~y~0)} is VALID [2022-04-28 04:00:44,491 INFO L290 TraceCheckUtils]: 44: Hoare triple {60846#(< 14 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {60842#(< 12 main_~y~0)} is VALID [2022-04-28 04:00:44,491 INFO L290 TraceCheckUtils]: 43: Hoare triple {60850#(< 16 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {60846#(< 14 main_~y~0)} is VALID [2022-04-28 04:00:44,492 INFO L290 TraceCheckUtils]: 42: Hoare triple {60854#(< 18 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {60850#(< 16 main_~y~0)} is VALID [2022-04-28 04:00:44,492 INFO L290 TraceCheckUtils]: 41: Hoare triple {60858#(< 20 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {60854#(< 18 main_~y~0)} is VALID [2022-04-28 04:00:44,492 INFO L290 TraceCheckUtils]: 40: Hoare triple {60862#(< 22 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {60858#(< 20 main_~y~0)} is VALID [2022-04-28 04:00:44,493 INFO L290 TraceCheckUtils]: 39: Hoare triple {60866#(< 24 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {60862#(< 22 main_~y~0)} is VALID [2022-04-28 04:00:44,493 INFO L290 TraceCheckUtils]: 38: Hoare triple {60870#(< 26 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {60866#(< 24 main_~y~0)} is VALID [2022-04-28 04:00:44,494 INFO L290 TraceCheckUtils]: 37: Hoare triple {60874#(< 28 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {60870#(< 26 main_~y~0)} is VALID [2022-04-28 04:00:44,494 INFO L290 TraceCheckUtils]: 36: Hoare triple {60878#(< 30 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {60874#(< 28 main_~y~0)} is VALID [2022-04-28 04:00:44,495 INFO L290 TraceCheckUtils]: 35: Hoare triple {60882#(< 32 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {60878#(< 30 main_~y~0)} is VALID [2022-04-28 04:00:44,495 INFO L290 TraceCheckUtils]: 34: Hoare triple {60886#(< 34 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {60882#(< 32 main_~y~0)} is VALID [2022-04-28 04:00:44,495 INFO L290 TraceCheckUtils]: 33: Hoare triple {60890#(< 36 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {60886#(< 34 main_~y~0)} is VALID [2022-04-28 04:00:44,496 INFO L290 TraceCheckUtils]: 32: Hoare triple {60894#(< 38 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {60890#(< 36 main_~y~0)} is VALID [2022-04-28 04:00:44,496 INFO L290 TraceCheckUtils]: 31: Hoare triple {60898#(< 40 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {60894#(< 38 main_~y~0)} is VALID [2022-04-28 04:00:44,497 INFO L290 TraceCheckUtils]: 30: Hoare triple {60902#(< 42 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {60898#(< 40 main_~y~0)} is VALID [2022-04-28 04:00:44,497 INFO L290 TraceCheckUtils]: 29: Hoare triple {60906#(< 44 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {60902#(< 42 main_~y~0)} is VALID [2022-04-28 04:00:44,498 INFO L290 TraceCheckUtils]: 28: Hoare triple {60910#(< 46 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {60906#(< 44 main_~y~0)} is VALID [2022-04-28 04:00:44,498 INFO L290 TraceCheckUtils]: 27: Hoare triple {60914#(< 48 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {60910#(< 46 main_~y~0)} is VALID [2022-04-28 04:00:44,498 INFO L290 TraceCheckUtils]: 26: Hoare triple {60918#(< 50 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {60914#(< 48 main_~y~0)} is VALID [2022-04-28 04:00:44,499 INFO L290 TraceCheckUtils]: 25: Hoare triple {60922#(< 52 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {60918#(< 50 main_~y~0)} is VALID [2022-04-28 04:00:44,499 INFO L290 TraceCheckUtils]: 24: Hoare triple {60926#(< 54 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {60922#(< 52 main_~y~0)} is VALID [2022-04-28 04:00:44,500 INFO L290 TraceCheckUtils]: 23: Hoare triple {60930#(< 56 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {60926#(< 54 main_~y~0)} is VALID [2022-04-28 04:00:44,500 INFO L290 TraceCheckUtils]: 22: Hoare triple {60934#(< 58 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {60930#(< 56 main_~y~0)} is VALID [2022-04-28 04:00:44,501 INFO L290 TraceCheckUtils]: 21: Hoare triple {60938#(< 60 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {60934#(< 58 main_~y~0)} is VALID [2022-04-28 04:00:44,501 INFO L290 TraceCheckUtils]: 20: Hoare triple {60942#(< 62 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {60938#(< 60 main_~y~0)} is VALID [2022-04-28 04:00:44,502 INFO L290 TraceCheckUtils]: 19: Hoare triple {60946#(< 64 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {60942#(< 62 main_~y~0)} is VALID [2022-04-28 04:00:44,502 INFO L290 TraceCheckUtils]: 18: Hoare triple {60950#(< 66 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {60946#(< 64 main_~y~0)} is VALID [2022-04-28 04:00:44,502 INFO L290 TraceCheckUtils]: 17: Hoare triple {60954#(< 68 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {60950#(< 66 main_~y~0)} is VALID [2022-04-28 04:00:44,503 INFO L290 TraceCheckUtils]: 16: Hoare triple {60958#(< 70 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {60954#(< 68 main_~y~0)} is VALID [2022-04-28 04:00:44,503 INFO L290 TraceCheckUtils]: 15: Hoare triple {60962#(< 72 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {60958#(< 70 main_~y~0)} is VALID [2022-04-28 04:00:44,504 INFO L290 TraceCheckUtils]: 14: Hoare triple {60966#(< 74 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {60962#(< 72 main_~y~0)} is VALID [2022-04-28 04:00:44,504 INFO L290 TraceCheckUtils]: 13: Hoare triple {60970#(< 76 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {60966#(< 74 main_~y~0)} is VALID [2022-04-28 04:00:44,505 INFO L290 TraceCheckUtils]: 12: Hoare triple {60974#(< 78 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {60970#(< 76 main_~y~0)} is VALID [2022-04-28 04:00:44,505 INFO L290 TraceCheckUtils]: 11: Hoare triple {60978#(< 80 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {60974#(< 78 main_~y~0)} is VALID [2022-04-28 04:00:44,505 INFO L290 TraceCheckUtils]: 10: Hoare triple {60982#(< 82 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {60978#(< 80 main_~y~0)} is VALID [2022-04-28 04:00:44,506 INFO L290 TraceCheckUtils]: 9: Hoare triple {60982#(< 82 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[] {60982#(< 82 main_~y~0)} is VALID [2022-04-28 04:00:44,506 INFO L290 TraceCheckUtils]: 8: Hoare triple {60982#(< 82 main_~y~0)} [222] L11-2-->L18-1_primed: Formula: (let ((.cse0 (<= 50000 v_main_~x~0_3041)) (.cse1 (= v_main_~y~0_3516 v_main_~y~0_3515)) (.cse2 (= |v_main_#t~post5_284| |v_main_#t~post5_283|)) (.cse3 (= |v_main_#t~post6_284| |v_main_#t~post6_283|))) (or (and .cse0 (< v_main_~x~0_3041 v_main_~x~0_3040) (= (+ v_main_~x~0_3041 v_main_~y~0_3515) (+ v_main_~x~0_3040 v_main_~y~0_3516)) (< v_main_~x~0_3040 1000001)) (and (= v_main_~x~0_3041 v_main_~x~0_3040) .cse1 .cse2 .cse3) (and (or (not (< v_main_~x~0_3041 1000000)) (not .cse0)) (= v_main_~x~0_3040 v_main_~x~0_3041) .cse1 .cse2 .cse3))) InVars {main_~y~0=v_main_~y~0_3516, main_#t~post5=|v_main_#t~post5_284|, main_~x~0=v_main_~x~0_3041, main_#t~post6=|v_main_#t~post6_284|} OutVars{main_~y~0=v_main_~y~0_3515, main_#t~post5=|v_main_#t~post5_283|, main_~x~0=v_main_~x~0_3040, main_#t~post6=|v_main_#t~post6_283|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {60982#(< 82 main_~y~0)} is VALID [2022-04-28 04:00:44,507 INFO L290 TraceCheckUtils]: 7: Hoare triple {60982#(< 82 main_~y~0)} [221] L18-1_primed-->L11-2: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {60982#(< 82 main_~y~0)} is VALID [2022-04-28 04:00:44,507 INFO L290 TraceCheckUtils]: 6: Hoare triple {60982#(< 82 main_~y~0)} [220] L11-2-->L18-1_primed: Formula: (let ((.cse0 (= |v_main_#t~post4_259| |v_main_#t~post4_258|)) (.cse1 (= v_main_~x~0_3039 v_main_~x~0_3038))) (or (and (< v_main_~x~0_3038 50001) (< v_main_~x~0_3039 v_main_~x~0_3038)) (and .cse0 (<= 50000 v_main_~x~0_3039) .cse1) (and .cse0 .cse1))) InVars {main_~x~0=v_main_~x~0_3039, main_#t~post4=|v_main_#t~post4_259|} OutVars{main_~x~0=v_main_~x~0_3038, main_#t~post4=|v_main_#t~post4_258|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {60982#(< 82 main_~y~0)} is VALID [2022-04-28 04:00:44,507 INFO L290 TraceCheckUtils]: 5: Hoare triple {60587#true} ~x~0 := 0;~y~0 := 50000;~z~0 := 0;~x~0 := 0; {60982#(< 82 main_~y~0)} is VALID [2022-04-28 04:00:44,507 INFO L272 TraceCheckUtils]: 4: Hoare triple {60587#true} call #t~ret7 := main(); {60587#true} is VALID [2022-04-28 04:00:44,507 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {60587#true} {60587#true} #52#return; {60587#true} is VALID [2022-04-28 04:00:44,507 INFO L290 TraceCheckUtils]: 2: Hoare triple {60587#true} assume true; {60587#true} is VALID [2022-04-28 04:00:44,507 INFO L290 TraceCheckUtils]: 1: Hoare triple {60587#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); {60587#true} is VALID [2022-04-28 04:00:44,508 INFO L272 TraceCheckUtils]: 0: Hoare triple {60587#true} call ULTIMATE.init(); {60587#true} is VALID [2022-04-28 04:00:44,508 INFO L134 CoverageAnalysis]: Checked inductivity of 863 backedges. 0 proven. 861 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-04-28 04:00:44,508 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [544111830] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 04:00:44,508 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 04:00:44,508 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [48, 44, 44] total 90 [2022-04-28 04:00:48,509 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 04:00:48,509 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [927747751] [2022-04-28 04:00:48,509 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [927747751] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 04:00:48,509 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 04:00:48,509 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [121] imperfect sequences [] total 121 [2022-04-28 04:00:48,509 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [171405797] [2022-04-28 04:00:48,509 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 04:00:48,510 INFO L78 Accepts]: Start accepts. Automaton has has 121 states, 121 states have (on average 1.6446280991735538) internal successors, (199), 120 states have internal predecessors, (199), 2 states have call successors, (3), 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 203 [2022-04-28 04:00:48,510 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 04:00:48,510 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 121 states, 121 states have (on average 1.6446280991735538) internal successors, (199), 120 states have internal predecessors, (199), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 04:00:48,658 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 203 edges. 203 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 04:00:48,658 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 121 states [2022-04-28 04:00:48,658 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 04:00:48,659 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 121 interpolants. [2022-04-28 04:00:48,661 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10525, Invalid=16865, Unknown=0, NotChecked=0, Total=27390 [2022-04-28 04:00:48,661 INFO L87 Difference]: Start difference. First operand 204 states and 207 transitions. Second operand has 121 states, 121 states have (on average 1.6446280991735538) internal successors, (199), 120 states have internal predecessors, (199), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 04:01:12,684 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 04:01:12,685 INFO L93 Difference]: Finished difference Result 551 states and 562 transitions. [2022-04-28 04:01:12,685 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 121 states. [2022-04-28 04:01:12,685 INFO L78 Accepts]: Start accepts. Automaton has has 121 states, 121 states have (on average 1.6446280991735538) internal successors, (199), 120 states have internal predecessors, (199), 2 states have call successors, (3), 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 203 [2022-04-28 04:01:12,685 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 04:01:12,685 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 121 states, 121 states have (on average 1.6446280991735538) internal successors, (199), 120 states have internal predecessors, (199), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 04:01:12,687 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 121 states to 121 states and 225 transitions. [2022-04-28 04:01:12,687 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 121 states, 121 states have (on average 1.6446280991735538) internal successors, (199), 120 states have internal predecessors, (199), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 04:01:12,689 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 121 states to 121 states and 225 transitions. [2022-04-28 04:01:12,689 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 121 states and 225 transitions. [2022-04-28 04:01:12,892 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 225 edges. 225 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 04:01:12,899 INFO L225 Difference]: With dead ends: 551 [2022-04-28 04:01:12,899 INFO L226 Difference]: Without dead ends: 355 [2022-04-28 04:01:12,906 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 433 GetRequests, 150 SyntacticMatches, 1 SemanticMatches, 282 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23693 ImplicationChecksByTransitivity, 11.7s TimeCoverageRelationStatistics Valid=24214, Invalid=56158, Unknown=0, NotChecked=0, Total=80372 [2022-04-28 04:01:12,906 INFO L413 NwaCegarLoop]: 12 mSDtfsCounter, 241 mSDsluCounter, 27 mSDsCounter, 0 mSdLazyCounter, 11871 mSolverCounterSat, 281 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 9.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 241 SdHoareTripleChecker+Valid, 39 SdHoareTripleChecker+Invalid, 12152 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 281 IncrementalHoareTripleChecker+Valid, 11871 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 9.5s IncrementalHoareTripleChecker+Time [2022-04-28 04:01:12,907 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [241 Valid, 39 Invalid, 12152 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [281 Valid, 11871 Invalid, 0 Unknown, 0 Unchecked, 9.5s Time] [2022-04-28 04:01:12,907 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 355 states. [2022-04-28 04:01:13,619 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 355 to 355. [2022-04-28 04:01:13,619 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 04:01:13,620 INFO L82 GeneralOperation]: Start isEquivalent. First operand 355 states. Second operand has 355 states, 350 states have (on average 1.0142857142857142) internal successors, (355), 350 states have internal predecessors, (355), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 04:01:13,620 INFO L74 IsIncluded]: Start isIncluded. First operand 355 states. Second operand has 355 states, 350 states have (on average 1.0142857142857142) internal successors, (355), 350 states have internal predecessors, (355), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 04:01:13,620 INFO L87 Difference]: Start difference. First operand 355 states. Second operand has 355 states, 350 states have (on average 1.0142857142857142) internal successors, (355), 350 states have internal predecessors, (355), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 04:01:13,625 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 04:01:13,626 INFO L93 Difference]: Finished difference Result 355 states and 359 transitions. [2022-04-28 04:01:13,626 INFO L276 IsEmpty]: Start isEmpty. Operand 355 states and 359 transitions. [2022-04-28 04:01:13,626 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 04:01:13,626 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 04:01:13,626 INFO L74 IsIncluded]: Start isIncluded. First operand has 355 states, 350 states have (on average 1.0142857142857142) internal successors, (355), 350 states have internal predecessors, (355), 3 states have call successors, (3), 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 355 states. [2022-04-28 04:01:13,627 INFO L87 Difference]: Start difference. First operand has 355 states, 350 states have (on average 1.0142857142857142) internal successors, (355), 350 states have internal predecessors, (355), 3 states have call successors, (3), 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 355 states. [2022-04-28 04:01:13,632 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 04:01:13,632 INFO L93 Difference]: Finished difference Result 355 states and 359 transitions. [2022-04-28 04:01:13,632 INFO L276 IsEmpty]: Start isEmpty. Operand 355 states and 359 transitions. [2022-04-28 04:01:13,632 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 04:01:13,632 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 04:01:13,633 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 04:01:13,633 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 04:01:13,633 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 355 states, 350 states have (on average 1.0142857142857142) internal successors, (355), 350 states have internal predecessors, (355), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 04:01:13,640 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 355 states to 355 states and 359 transitions. [2022-04-28 04:01:13,640 INFO L78 Accepts]: Start accepts. Automaton has 355 states and 359 transitions. Word has length 203 [2022-04-28 04:01:13,640 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 04:01:13,640 INFO L495 AbstractCegarLoop]: Abstraction has 355 states and 359 transitions. [2022-04-28 04:01:13,640 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 121 states, 121 states have (on average 1.6446280991735538) internal successors, (199), 120 states have internal predecessors, (199), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 04:01:13,641 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 355 states and 359 transitions. [2022-04-28 04:01:13,973 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 359 edges. 359 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 04:01:13,973 INFO L276 IsEmpty]: Start isEmpty. Operand 355 states and 359 transitions. [2022-04-28 04:01:13,974 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 207 [2022-04-28 04:01:13,974 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 04:01:13,974 INFO L195 NwaCegarLoop]: trace histogram [76, 75, 42, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 04:01:13,997 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (42)] Forceful destruction successful, exit code 0 [2022-04-28 04:01:14,187 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable43,42 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 04:01:14,188 INFO L420 AbstractCegarLoop]: === Iteration 45 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 04:01:14,188 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 04:01:14,188 INFO L85 PathProgramCache]: Analyzing trace with hash -212262319, now seen corresponding path program 42 times [2022-04-28 04:01:14,188 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 04:01:14,188 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1734601229] [2022-04-28 04:01:18,265 WARN L977 rdanLoopAcceleration]: Unable to prove correctness of quantifier elimination. [2022-04-28 04:01:18,319 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 1 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 04:01:18,543 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={1=1, 2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 04:01:18,544 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-28 04:01:18,546 INFO L85 PathProgramCache]: Analyzing trace with hash 1318849185, now seen corresponding path program 1 times [2022-04-28 04:01:18,546 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 04:01:18,546 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1591208290] [2022-04-28 04:01:18,546 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 04:01:18,546 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 04:01:18,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 04:01:19,382 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 04:01:19,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 04:01:19,385 INFO L290 TraceCheckUtils]: 0: Hoare triple {63897#(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); {63849#true} is VALID [2022-04-28 04:01:19,385 INFO L290 TraceCheckUtils]: 1: Hoare triple {63849#true} assume true; {63849#true} is VALID [2022-04-28 04:01:19,385 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {63849#true} {63849#true} #52#return; {63849#true} is VALID [2022-04-28 04:01:19,385 INFO L272 TraceCheckUtils]: 0: Hoare triple {63849#true} call ULTIMATE.init(); {63897#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 04:01:19,385 INFO L290 TraceCheckUtils]: 1: Hoare triple {63897#(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); {63849#true} is VALID [2022-04-28 04:01:19,385 INFO L290 TraceCheckUtils]: 2: Hoare triple {63849#true} assume true; {63849#true} is VALID [2022-04-28 04:01:19,385 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {63849#true} {63849#true} #52#return; {63849#true} is VALID [2022-04-28 04:01:19,385 INFO L272 TraceCheckUtils]: 4: Hoare triple {63849#true} call #t~ret7 := main(); {63849#true} is VALID [2022-04-28 04:01:19,386 INFO L290 TraceCheckUtils]: 5: Hoare triple {63849#true} ~x~0 := 0;~y~0 := 50000;~z~0 := 0;~x~0 := 0; {63854#(<= 50000 main_~y~0)} is VALID [2022-04-28 04:01:19,386 INFO L290 TraceCheckUtils]: 6: Hoare triple {63854#(<= 50000 main_~y~0)} [224] L11-2-->L18-1_primed: Formula: (let ((.cse0 (= v_main_~x~0_3171 v_main_~x~0_3170)) (.cse1 (= |v_main_#t~post4_265| |v_main_#t~post4_264|))) (or (and .cse0 .cse1) (and (< v_main_~x~0_3171 v_main_~x~0_3170) (< v_main_~x~0_3170 50001)) (and (not (< v_main_~x~0_3171 50000)) .cse0 .cse1))) InVars {main_~x~0=v_main_~x~0_3171, main_#t~post4=|v_main_#t~post4_265|} OutVars{main_~x~0=v_main_~x~0_3170, main_#t~post4=|v_main_#t~post4_264|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {63854#(<= 50000 main_~y~0)} is VALID [2022-04-28 04:01:19,386 INFO L290 TraceCheckUtils]: 7: Hoare triple {63854#(<= 50000 main_~y~0)} [225] L18-1_primed-->L11-2: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {63854#(<= 50000 main_~y~0)} is VALID [2022-04-28 04:01:19,387 INFO L290 TraceCheckUtils]: 8: Hoare triple {63854#(<= 50000 main_~y~0)} [226] L11-2-->L18-1_primed: Formula: (let ((.cse0 (= |v_main_#t~post6_291| |v_main_#t~post6_290|)) (.cse1 (= v_main_~y~0_3681 v_main_~y~0_3680)) (.cse2 (<= 50000 v_main_~x~0_3173))) (or (and (= |v_main_#t~post5_291| |v_main_#t~post5_290|) .cse0 (= v_main_~x~0_3173 v_main_~x~0_3172) .cse1) (and (= |v_main_#t~post5_290| |v_main_#t~post5_291|) .cse0 (= v_main_~x~0_3172 v_main_~x~0_3173) .cse1 (or (not (< v_main_~x~0_3173 1000000)) (not .cse2))) (and .cse2 (< v_main_~x~0_3173 v_main_~x~0_3172) (= (+ v_main_~x~0_3173 v_main_~y~0_3680) (+ v_main_~x~0_3172 v_main_~y~0_3681)) (< v_main_~x~0_3172 1000001)))) InVars {main_~y~0=v_main_~y~0_3681, main_#t~post5=|v_main_#t~post5_291|, main_~x~0=v_main_~x~0_3173, main_#t~post6=|v_main_#t~post6_291|} OutVars{main_~y~0=v_main_~y~0_3680, main_#t~post5=|v_main_#t~post5_290|, main_~x~0=v_main_~x~0_3172, main_#t~post6=|v_main_#t~post6_290|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {63854#(<= 50000 main_~y~0)} is VALID [2022-04-28 04:01:19,387 INFO L290 TraceCheckUtils]: 9: Hoare triple {63854#(<= 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[] {63854#(<= 50000 main_~y~0)} is VALID [2022-04-28 04:01:19,388 INFO L290 TraceCheckUtils]: 10: Hoare triple {63854#(<= 50000 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {63855#(<= 49998 main_~y~0)} is VALID [2022-04-28 04:01:19,388 INFO L290 TraceCheckUtils]: 11: Hoare triple {63855#(<= 49998 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {63856#(<= 49996 main_~y~0)} is VALID [2022-04-28 04:01:19,388 INFO L290 TraceCheckUtils]: 12: Hoare triple {63856#(<= 49996 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {63857#(<= 49994 main_~y~0)} is VALID [2022-04-28 04:01:19,389 INFO L290 TraceCheckUtils]: 13: Hoare triple {63857#(<= 49994 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {63858#(<= 49992 main_~y~0)} is VALID [2022-04-28 04:01:19,389 INFO L290 TraceCheckUtils]: 14: Hoare triple {63858#(<= 49992 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {63859#(<= 49990 main_~y~0)} is VALID [2022-04-28 04:01:19,390 INFO L290 TraceCheckUtils]: 15: Hoare triple {63859#(<= 49990 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {63860#(<= 49988 main_~y~0)} is VALID [2022-04-28 04:01:19,390 INFO L290 TraceCheckUtils]: 16: Hoare triple {63860#(<= 49988 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {63861#(<= 49986 main_~y~0)} is VALID [2022-04-28 04:01:19,390 INFO L290 TraceCheckUtils]: 17: Hoare triple {63861#(<= 49986 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {63862#(<= 49984 main_~y~0)} is VALID [2022-04-28 04:01:19,391 INFO L290 TraceCheckUtils]: 18: Hoare triple {63862#(<= 49984 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {63863#(<= 49982 main_~y~0)} is VALID [2022-04-28 04:01:19,391 INFO L290 TraceCheckUtils]: 19: Hoare triple {63863#(<= 49982 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {63864#(<= 49980 main_~y~0)} is VALID [2022-04-28 04:01:19,392 INFO L290 TraceCheckUtils]: 20: Hoare triple {63864#(<= 49980 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {63865#(<= 49978 main_~y~0)} is VALID [2022-04-28 04:01:19,392 INFO L290 TraceCheckUtils]: 21: Hoare triple {63865#(<= 49978 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {63866#(<= 49976 main_~y~0)} is VALID [2022-04-28 04:01:19,393 INFO L290 TraceCheckUtils]: 22: Hoare triple {63866#(<= 49976 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {63867#(<= 49974 main_~y~0)} is VALID [2022-04-28 04:01:19,393 INFO L290 TraceCheckUtils]: 23: Hoare triple {63867#(<= 49974 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {63868#(<= 49972 main_~y~0)} is VALID [2022-04-28 04:01:19,393 INFO L290 TraceCheckUtils]: 24: Hoare triple {63868#(<= 49972 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {63869#(<= 49970 main_~y~0)} is VALID [2022-04-28 04:01:19,394 INFO L290 TraceCheckUtils]: 25: Hoare triple {63869#(<= 49970 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {63870#(<= 49968 main_~y~0)} is VALID [2022-04-28 04:01:19,394 INFO L290 TraceCheckUtils]: 26: Hoare triple {63870#(<= 49968 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {63871#(<= 49966 main_~y~0)} is VALID [2022-04-28 04:01:19,395 INFO L290 TraceCheckUtils]: 27: Hoare triple {63871#(<= 49966 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {63872#(<= 49964 main_~y~0)} is VALID [2022-04-28 04:01:19,395 INFO L290 TraceCheckUtils]: 28: Hoare triple {63872#(<= 49964 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {63873#(<= 49962 main_~y~0)} is VALID [2022-04-28 04:01:19,395 INFO L290 TraceCheckUtils]: 29: Hoare triple {63873#(<= 49962 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {63874#(<= 49960 main_~y~0)} is VALID [2022-04-28 04:01:19,396 INFO L290 TraceCheckUtils]: 30: Hoare triple {63874#(<= 49960 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {63875#(<= 49958 main_~y~0)} is VALID [2022-04-28 04:01:19,396 INFO L290 TraceCheckUtils]: 31: Hoare triple {63875#(<= 49958 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {63876#(<= 49956 main_~y~0)} is VALID [2022-04-28 04:01:19,397 INFO L290 TraceCheckUtils]: 32: Hoare triple {63876#(<= 49956 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {63877#(<= 49954 main_~y~0)} is VALID [2022-04-28 04:01:19,397 INFO L290 TraceCheckUtils]: 33: Hoare triple {63877#(<= 49954 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {63878#(<= 49952 main_~y~0)} is VALID [2022-04-28 04:01:19,397 INFO L290 TraceCheckUtils]: 34: Hoare triple {63878#(<= 49952 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {63879#(<= 49950 main_~y~0)} is VALID [2022-04-28 04:01:19,398 INFO L290 TraceCheckUtils]: 35: Hoare triple {63879#(<= 49950 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {63880#(<= 49948 main_~y~0)} is VALID [2022-04-28 04:01:19,398 INFO L290 TraceCheckUtils]: 36: Hoare triple {63880#(<= 49948 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {63881#(<= 49946 main_~y~0)} is VALID [2022-04-28 04:01:19,399 INFO L290 TraceCheckUtils]: 37: Hoare triple {63881#(<= 49946 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {63882#(<= 49944 main_~y~0)} is VALID [2022-04-28 04:01:19,399 INFO L290 TraceCheckUtils]: 38: Hoare triple {63882#(<= 49944 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {63883#(<= 49942 main_~y~0)} is VALID [2022-04-28 04:01:19,399 INFO L290 TraceCheckUtils]: 39: Hoare triple {63883#(<= 49942 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {63884#(<= 49940 main_~y~0)} is VALID [2022-04-28 04:01:19,400 INFO L290 TraceCheckUtils]: 40: Hoare triple {63884#(<= 49940 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {63885#(<= 49938 main_~y~0)} is VALID [2022-04-28 04:01:19,400 INFO L290 TraceCheckUtils]: 41: Hoare triple {63885#(<= 49938 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {63886#(<= 49936 main_~y~0)} is VALID [2022-04-28 04:01:19,401 INFO L290 TraceCheckUtils]: 42: Hoare triple {63886#(<= 49936 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {63887#(<= 49934 main_~y~0)} is VALID [2022-04-28 04:01:19,401 INFO L290 TraceCheckUtils]: 43: Hoare triple {63887#(<= 49934 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {63888#(<= 49932 main_~y~0)} is VALID [2022-04-28 04:01:19,401 INFO L290 TraceCheckUtils]: 44: Hoare triple {63888#(<= 49932 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {63889#(<= 49930 main_~y~0)} is VALID [2022-04-28 04:01:19,402 INFO L290 TraceCheckUtils]: 45: Hoare triple {63889#(<= 49930 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {63890#(<= 49928 main_~y~0)} is VALID [2022-04-28 04:01:19,402 INFO L290 TraceCheckUtils]: 46: Hoare triple {63890#(<= 49928 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {63891#(<= 49926 main_~y~0)} is VALID [2022-04-28 04:01:19,403 INFO L290 TraceCheckUtils]: 47: Hoare triple {63891#(<= 49926 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {63892#(<= 49924 main_~y~0)} is VALID [2022-04-28 04:01:19,403 INFO L290 TraceCheckUtils]: 48: Hoare triple {63892#(<= 49924 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {63893#(<= 49922 main_~y~0)} is VALID [2022-04-28 04:01:19,404 INFO L290 TraceCheckUtils]: 49: Hoare triple {63893#(<= 49922 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {63894#(<= 49920 main_~y~0)} is VALID [2022-04-28 04:01:19,404 INFO L290 TraceCheckUtils]: 50: Hoare triple {63894#(<= 49920 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {63895#(<= 49918 main_~y~0)} is VALID [2022-04-28 04:01:19,404 INFO L290 TraceCheckUtils]: 51: Hoare triple {63895#(<= 49918 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {63896#(<= 49916 main_~y~0)} is VALID [2022-04-28 04:01:19,405 INFO L290 TraceCheckUtils]: 52: Hoare triple {63896#(<= 49916 main_~y~0)} assume !(~y~0 > 0); {63850#false} is VALID [2022-04-28 04:01:19,405 INFO L272 TraceCheckUtils]: 53: Hoare triple {63850#false} call __VERIFIER_assert((if ~z~0 == ~x~0 then 1 else 0)); {63850#false} is VALID [2022-04-28 04:01:19,405 INFO L290 TraceCheckUtils]: 54: Hoare triple {63850#false} ~cond := #in~cond; {63850#false} is VALID [2022-04-28 04:01:19,405 INFO L290 TraceCheckUtils]: 55: Hoare triple {63850#false} assume 0 == ~cond; {63850#false} is VALID [2022-04-28 04:01:19,405 INFO L290 TraceCheckUtils]: 56: Hoare triple {63850#false} assume !false; {63850#false} is VALID [2022-04-28 04:01:19,405 INFO L134 CoverageAnalysis]: Checked inductivity of 905 backedges. 0 proven. 903 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-04-28 04:01:19,405 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 04:01:19,405 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1591208290] [2022-04-28 04:01:19,405 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1591208290] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 04:01:19,405 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1135473987] [2022-04-28 04:01:19,405 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 04:01:19,405 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 04:01:19,406 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 04:01:19,406 INFO L229 MonitoredProcess]: Starting monitored process 43 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 04:01:19,407 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (43)] Waiting until timeout for monitored process [2022-04-28 04:01:19,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 04:01:19,461 INFO L263 TraceCheckSpWp]: Trace formula consists of 269 conjuncts, 48 conjunts are in the unsatisfiable core [2022-04-28 04:01:19,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 04:01:19,483 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 04:01:20,870 INFO L272 TraceCheckUtils]: 0: Hoare triple {63849#true} call ULTIMATE.init(); {63849#true} is VALID [2022-04-28 04:01:20,871 INFO L290 TraceCheckUtils]: 1: Hoare triple {63849#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); {63849#true} is VALID [2022-04-28 04:01:20,871 INFO L290 TraceCheckUtils]: 2: Hoare triple {63849#true} assume true; {63849#true} is VALID [2022-04-28 04:01:20,871 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {63849#true} {63849#true} #52#return; {63849#true} is VALID [2022-04-28 04:01:20,871 INFO L272 TraceCheckUtils]: 4: Hoare triple {63849#true} call #t~ret7 := main(); {63849#true} is VALID [2022-04-28 04:01:20,871 INFO L290 TraceCheckUtils]: 5: Hoare triple {63849#true} ~x~0 := 0;~y~0 := 50000;~z~0 := 0;~x~0 := 0; {63916#(and (<= main_~x~0 0) (<= 50000 main_~y~0))} is VALID [2022-04-28 04:01:20,872 INFO L290 TraceCheckUtils]: 6: Hoare triple {63916#(and (<= main_~x~0 0) (<= 50000 main_~y~0))} [224] L11-2-->L18-1_primed: Formula: (let ((.cse0 (= v_main_~x~0_3171 v_main_~x~0_3170)) (.cse1 (= |v_main_#t~post4_265| |v_main_#t~post4_264|))) (or (and .cse0 .cse1) (and (< v_main_~x~0_3171 v_main_~x~0_3170) (< v_main_~x~0_3170 50001)) (and (not (< v_main_~x~0_3171 50000)) .cse0 .cse1))) InVars {main_~x~0=v_main_~x~0_3171, main_#t~post4=|v_main_#t~post4_265|} OutVars{main_~x~0=v_main_~x~0_3170, main_#t~post4=|v_main_#t~post4_264|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {63920#(and (< main_~x~0 50001) (<= 50000 main_~y~0))} is VALID [2022-04-28 04:01:20,872 INFO L290 TraceCheckUtils]: 7: Hoare triple {63920#(and (< main_~x~0 50001) (<= 50000 main_~y~0))} [225] L18-1_primed-->L11-2: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {63920#(and (< main_~x~0 50001) (<= 50000 main_~y~0))} is VALID [2022-04-28 04:01:20,873 INFO L290 TraceCheckUtils]: 8: Hoare triple {63920#(and (< main_~x~0 50001) (<= 50000 main_~y~0))} [226] L11-2-->L18-1_primed: Formula: (let ((.cse0 (= |v_main_#t~post6_291| |v_main_#t~post6_290|)) (.cse1 (= v_main_~y~0_3681 v_main_~y~0_3680)) (.cse2 (<= 50000 v_main_~x~0_3173))) (or (and (= |v_main_#t~post5_291| |v_main_#t~post5_290|) .cse0 (= v_main_~x~0_3173 v_main_~x~0_3172) .cse1) (and (= |v_main_#t~post5_290| |v_main_#t~post5_291|) .cse0 (= v_main_~x~0_3172 v_main_~x~0_3173) .cse1 (or (not (< v_main_~x~0_3173 1000000)) (not .cse2))) (and .cse2 (< v_main_~x~0_3173 v_main_~x~0_3172) (= (+ v_main_~x~0_3173 v_main_~y~0_3680) (+ v_main_~x~0_3172 v_main_~y~0_3681)) (< v_main_~x~0_3172 1000001)))) InVars {main_~y~0=v_main_~y~0_3681, main_#t~post5=|v_main_#t~post5_291|, main_~x~0=v_main_~x~0_3173, main_#t~post6=|v_main_#t~post6_291|} OutVars{main_~y~0=v_main_~y~0_3680, main_#t~post5=|v_main_#t~post5_290|, main_~x~0=v_main_~x~0_3172, main_#t~post6=|v_main_#t~post6_290|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {63927#(or (and (< main_~x~0 50001) (<= 50000 main_~y~0)) (and (< main_~x~0 (+ main_~y~0 1)) (< main_~x~0 1000001) (< 50000 main_~x~0)))} is VALID [2022-04-28 04:01:20,873 INFO L290 TraceCheckUtils]: 9: Hoare triple {63927#(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)))} [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[] {63931#(< 999999 main_~y~0)} is VALID [2022-04-28 04:01:20,874 INFO L290 TraceCheckUtils]: 10: Hoare triple {63931#(< 999999 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {63935#(< 999997 main_~y~0)} is VALID [2022-04-28 04:01:20,874 INFO L290 TraceCheckUtils]: 11: Hoare triple {63935#(< 999997 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {63939#(< 999995 main_~y~0)} is VALID [2022-04-28 04:01:20,874 INFO L290 TraceCheckUtils]: 12: Hoare triple {63939#(< 999995 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {63943#(< 999993 main_~y~0)} is VALID [2022-04-28 04:01:20,875 INFO L290 TraceCheckUtils]: 13: Hoare triple {63943#(< 999993 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {63947#(< 999991 main_~y~0)} is VALID [2022-04-28 04:01:20,875 INFO L290 TraceCheckUtils]: 14: Hoare triple {63947#(< 999991 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {63951#(< 999989 main_~y~0)} is VALID [2022-04-28 04:01:20,876 INFO L290 TraceCheckUtils]: 15: Hoare triple {63951#(< 999989 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {63955#(< 999987 main_~y~0)} is VALID [2022-04-28 04:01:20,876 INFO L290 TraceCheckUtils]: 16: Hoare triple {63955#(< 999987 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {63959#(< 999985 main_~y~0)} is VALID [2022-04-28 04:01:20,877 INFO L290 TraceCheckUtils]: 17: Hoare triple {63959#(< 999985 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {63963#(< 999983 main_~y~0)} is VALID [2022-04-28 04:01:20,877 INFO L290 TraceCheckUtils]: 18: Hoare triple {63963#(< 999983 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {63967#(< 999981 main_~y~0)} is VALID [2022-04-28 04:01:20,877 INFO L290 TraceCheckUtils]: 19: Hoare triple {63967#(< 999981 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {63971#(< 999979 main_~y~0)} is VALID [2022-04-28 04:01:20,878 INFO L290 TraceCheckUtils]: 20: Hoare triple {63971#(< 999979 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {63975#(< 999977 main_~y~0)} is VALID [2022-04-28 04:01:20,878 INFO L290 TraceCheckUtils]: 21: Hoare triple {63975#(< 999977 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {63979#(< 999975 main_~y~0)} is VALID [2022-04-28 04:01:20,879 INFO L290 TraceCheckUtils]: 22: Hoare triple {63979#(< 999975 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {63983#(< 999973 main_~y~0)} is VALID [2022-04-28 04:01:20,879 INFO L290 TraceCheckUtils]: 23: Hoare triple {63983#(< 999973 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {63987#(< 999971 main_~y~0)} is VALID [2022-04-28 04:01:20,879 INFO L290 TraceCheckUtils]: 24: Hoare triple {63987#(< 999971 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {63991#(< 999969 main_~y~0)} is VALID [2022-04-28 04:01:20,880 INFO L290 TraceCheckUtils]: 25: Hoare triple {63991#(< 999969 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {63995#(< 999967 main_~y~0)} is VALID [2022-04-28 04:01:20,880 INFO L290 TraceCheckUtils]: 26: Hoare triple {63995#(< 999967 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {63999#(< 999965 main_~y~0)} is VALID [2022-04-28 04:01:20,881 INFO L290 TraceCheckUtils]: 27: Hoare triple {63999#(< 999965 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {64003#(< 999963 main_~y~0)} is VALID [2022-04-28 04:01:20,881 INFO L290 TraceCheckUtils]: 28: Hoare triple {64003#(< 999963 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {64007#(< 999961 main_~y~0)} is VALID [2022-04-28 04:01:20,881 INFO L290 TraceCheckUtils]: 29: Hoare triple {64007#(< 999961 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {64011#(< 999959 main_~y~0)} is VALID [2022-04-28 04:01:20,882 INFO L290 TraceCheckUtils]: 30: Hoare triple {64011#(< 999959 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {64015#(< 999957 main_~y~0)} is VALID [2022-04-28 04:01:20,882 INFO L290 TraceCheckUtils]: 31: Hoare triple {64015#(< 999957 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {64019#(< 999955 main_~y~0)} is VALID [2022-04-28 04:01:20,883 INFO L290 TraceCheckUtils]: 32: Hoare triple {64019#(< 999955 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {64023#(< 999953 main_~y~0)} is VALID [2022-04-28 04:01:20,883 INFO L290 TraceCheckUtils]: 33: Hoare triple {64023#(< 999953 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {64027#(< 999951 main_~y~0)} is VALID [2022-04-28 04:01:20,884 INFO L290 TraceCheckUtils]: 34: Hoare triple {64027#(< 999951 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {64031#(< 999949 main_~y~0)} is VALID [2022-04-28 04:01:20,884 INFO L290 TraceCheckUtils]: 35: Hoare triple {64031#(< 999949 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {64035#(< 999947 main_~y~0)} is VALID [2022-04-28 04:01:20,884 INFO L290 TraceCheckUtils]: 36: Hoare triple {64035#(< 999947 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {64039#(< 999945 main_~y~0)} is VALID [2022-04-28 04:01:20,885 INFO L290 TraceCheckUtils]: 37: Hoare triple {64039#(< 999945 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {64043#(< 999943 main_~y~0)} is VALID [2022-04-28 04:01:20,885 INFO L290 TraceCheckUtils]: 38: Hoare triple {64043#(< 999943 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {64047#(< 999941 main_~y~0)} is VALID [2022-04-28 04:01:20,886 INFO L290 TraceCheckUtils]: 39: Hoare triple {64047#(< 999941 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {64051#(< 999939 main_~y~0)} is VALID [2022-04-28 04:01:20,886 INFO L290 TraceCheckUtils]: 40: Hoare triple {64051#(< 999939 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {64055#(< 999937 main_~y~0)} is VALID [2022-04-28 04:01:20,886 INFO L290 TraceCheckUtils]: 41: Hoare triple {64055#(< 999937 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {64059#(< 999935 main_~y~0)} is VALID [2022-04-28 04:01:20,887 INFO L290 TraceCheckUtils]: 42: Hoare triple {64059#(< 999935 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {64063#(< 999933 main_~y~0)} is VALID [2022-04-28 04:01:20,887 INFO L290 TraceCheckUtils]: 43: Hoare triple {64063#(< 999933 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {64067#(< 999931 main_~y~0)} is VALID [2022-04-28 04:01:20,888 INFO L290 TraceCheckUtils]: 44: Hoare triple {64067#(< 999931 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {64071#(< 999929 main_~y~0)} is VALID [2022-04-28 04:01:20,888 INFO L290 TraceCheckUtils]: 45: Hoare triple {64071#(< 999929 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {64075#(< 999927 main_~y~0)} is VALID [2022-04-28 04:01:20,888 INFO L290 TraceCheckUtils]: 46: Hoare triple {64075#(< 999927 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {64079#(< 999925 main_~y~0)} is VALID [2022-04-28 04:01:20,889 INFO L290 TraceCheckUtils]: 47: Hoare triple {64079#(< 999925 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {64083#(< 999923 main_~y~0)} is VALID [2022-04-28 04:01:20,889 INFO L290 TraceCheckUtils]: 48: Hoare triple {64083#(< 999923 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {64087#(< 999921 main_~y~0)} is VALID [2022-04-28 04:01:20,890 INFO L290 TraceCheckUtils]: 49: Hoare triple {64087#(< 999921 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {64091#(< 999919 main_~y~0)} is VALID [2022-04-28 04:01:20,890 INFO L290 TraceCheckUtils]: 50: Hoare triple {64091#(< 999919 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {64095#(< 999917 main_~y~0)} is VALID [2022-04-28 04:01:20,891 INFO L290 TraceCheckUtils]: 51: Hoare triple {64095#(< 999917 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {64099#(< 999915 main_~y~0)} is VALID [2022-04-28 04:01:20,891 INFO L290 TraceCheckUtils]: 52: Hoare triple {64099#(< 999915 main_~y~0)} assume !(~y~0 > 0); {63850#false} is VALID [2022-04-28 04:01:20,891 INFO L272 TraceCheckUtils]: 53: Hoare triple {63850#false} call __VERIFIER_assert((if ~z~0 == ~x~0 then 1 else 0)); {63850#false} is VALID [2022-04-28 04:01:20,891 INFO L290 TraceCheckUtils]: 54: Hoare triple {63850#false} ~cond := #in~cond; {63850#false} is VALID [2022-04-28 04:01:20,891 INFO L290 TraceCheckUtils]: 55: Hoare triple {63850#false} assume 0 == ~cond; {63850#false} is VALID [2022-04-28 04:01:20,891 INFO L290 TraceCheckUtils]: 56: Hoare triple {63850#false} assume !false; {63850#false} is VALID [2022-04-28 04:01:20,891 INFO L134 CoverageAnalysis]: Checked inductivity of 905 backedges. 0 proven. 905 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 04:01:20,891 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 04:01:23,618 INFO L290 TraceCheckUtils]: 56: Hoare triple {63850#false} assume !false; {63850#false} is VALID [2022-04-28 04:01:23,618 INFO L290 TraceCheckUtils]: 55: Hoare triple {63850#false} assume 0 == ~cond; {63850#false} is VALID [2022-04-28 04:01:23,618 INFO L290 TraceCheckUtils]: 54: Hoare triple {63850#false} ~cond := #in~cond; {63850#false} is VALID [2022-04-28 04:01:23,618 INFO L272 TraceCheckUtils]: 53: Hoare triple {63850#false} call __VERIFIER_assert((if ~z~0 == ~x~0 then 1 else 0)); {63850#false} is VALID [2022-04-28 04:01:23,618 INFO L290 TraceCheckUtils]: 52: Hoare triple {64127#(< 0 main_~y~0)} assume !(~y~0 > 0); {63850#false} is VALID [2022-04-28 04:01:23,619 INFO L290 TraceCheckUtils]: 51: Hoare triple {64131#(< 2 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {64127#(< 0 main_~y~0)} is VALID [2022-04-28 04:01:23,619 INFO L290 TraceCheckUtils]: 50: Hoare triple {64135#(< 4 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {64131#(< 2 main_~y~0)} is VALID [2022-04-28 04:01:23,620 INFO L290 TraceCheckUtils]: 49: Hoare triple {64139#(< 6 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {64135#(< 4 main_~y~0)} is VALID [2022-04-28 04:01:23,620 INFO L290 TraceCheckUtils]: 48: Hoare triple {64143#(< 8 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {64139#(< 6 main_~y~0)} is VALID [2022-04-28 04:01:23,621 INFO L290 TraceCheckUtils]: 47: Hoare triple {64147#(< 10 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {64143#(< 8 main_~y~0)} is VALID [2022-04-28 04:01:23,621 INFO L290 TraceCheckUtils]: 46: Hoare triple {64151#(< 12 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {64147#(< 10 main_~y~0)} is VALID [2022-04-28 04:01:23,621 INFO L290 TraceCheckUtils]: 45: Hoare triple {64155#(< 14 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {64151#(< 12 main_~y~0)} is VALID [2022-04-28 04:01:23,622 INFO L290 TraceCheckUtils]: 44: Hoare triple {64159#(< 16 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {64155#(< 14 main_~y~0)} is VALID [2022-04-28 04:01:23,622 INFO L290 TraceCheckUtils]: 43: Hoare triple {64163#(< 18 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {64159#(< 16 main_~y~0)} is VALID [2022-04-28 04:01:23,623 INFO L290 TraceCheckUtils]: 42: Hoare triple {64167#(< 20 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {64163#(< 18 main_~y~0)} is VALID [2022-04-28 04:01:23,623 INFO L290 TraceCheckUtils]: 41: Hoare triple {64171#(< 22 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {64167#(< 20 main_~y~0)} is VALID [2022-04-28 04:01:23,623 INFO L290 TraceCheckUtils]: 40: Hoare triple {64175#(< 24 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {64171#(< 22 main_~y~0)} is VALID [2022-04-28 04:01:23,624 INFO L290 TraceCheckUtils]: 39: Hoare triple {64179#(< 26 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {64175#(< 24 main_~y~0)} is VALID [2022-04-28 04:01:23,624 INFO L290 TraceCheckUtils]: 38: Hoare triple {64183#(< 28 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {64179#(< 26 main_~y~0)} is VALID [2022-04-28 04:01:23,625 INFO L290 TraceCheckUtils]: 37: Hoare triple {64187#(< 30 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {64183#(< 28 main_~y~0)} is VALID [2022-04-28 04:01:23,625 INFO L290 TraceCheckUtils]: 36: Hoare triple {64191#(< 32 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {64187#(< 30 main_~y~0)} is VALID [2022-04-28 04:01:23,626 INFO L290 TraceCheckUtils]: 35: Hoare triple {64195#(< 34 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {64191#(< 32 main_~y~0)} is VALID [2022-04-28 04:01:23,626 INFO L290 TraceCheckUtils]: 34: Hoare triple {64199#(< 36 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {64195#(< 34 main_~y~0)} is VALID [2022-04-28 04:01:23,626 INFO L290 TraceCheckUtils]: 33: Hoare triple {64203#(< 38 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {64199#(< 36 main_~y~0)} is VALID [2022-04-28 04:01:23,627 INFO L290 TraceCheckUtils]: 32: Hoare triple {64207#(< 40 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {64203#(< 38 main_~y~0)} is VALID [2022-04-28 04:01:23,627 INFO L290 TraceCheckUtils]: 31: Hoare triple {64211#(< 42 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {64207#(< 40 main_~y~0)} is VALID [2022-04-28 04:01:23,628 INFO L290 TraceCheckUtils]: 30: Hoare triple {64215#(< 44 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {64211#(< 42 main_~y~0)} is VALID [2022-04-28 04:01:23,628 INFO L290 TraceCheckUtils]: 29: Hoare triple {64219#(< 46 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {64215#(< 44 main_~y~0)} is VALID [2022-04-28 04:01:23,628 INFO L290 TraceCheckUtils]: 28: Hoare triple {64223#(< 48 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {64219#(< 46 main_~y~0)} is VALID [2022-04-28 04:01:23,629 INFO L290 TraceCheckUtils]: 27: Hoare triple {64227#(< 50 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {64223#(< 48 main_~y~0)} is VALID [2022-04-28 04:01:23,629 INFO L290 TraceCheckUtils]: 26: Hoare triple {64231#(< 52 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {64227#(< 50 main_~y~0)} is VALID [2022-04-28 04:01:23,630 INFO L290 TraceCheckUtils]: 25: Hoare triple {64235#(< 54 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {64231#(< 52 main_~y~0)} is VALID [2022-04-28 04:01:23,630 INFO L290 TraceCheckUtils]: 24: Hoare triple {64239#(< 56 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {64235#(< 54 main_~y~0)} is VALID [2022-04-28 04:01:23,630 INFO L290 TraceCheckUtils]: 23: Hoare triple {64243#(< 58 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {64239#(< 56 main_~y~0)} is VALID [2022-04-28 04:01:23,631 INFO L290 TraceCheckUtils]: 22: Hoare triple {64247#(< 60 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {64243#(< 58 main_~y~0)} is VALID [2022-04-28 04:01:23,631 INFO L290 TraceCheckUtils]: 21: Hoare triple {64251#(< 62 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {64247#(< 60 main_~y~0)} is VALID [2022-04-28 04:01:23,632 INFO L290 TraceCheckUtils]: 20: Hoare triple {64255#(< 64 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {64251#(< 62 main_~y~0)} is VALID [2022-04-28 04:01:23,632 INFO L290 TraceCheckUtils]: 19: Hoare triple {64259#(< 66 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {64255#(< 64 main_~y~0)} is VALID [2022-04-28 04:01:23,633 INFO L290 TraceCheckUtils]: 18: Hoare triple {64263#(< 68 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {64259#(< 66 main_~y~0)} is VALID [2022-04-28 04:01:23,633 INFO L290 TraceCheckUtils]: 17: Hoare triple {64267#(< 70 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {64263#(< 68 main_~y~0)} is VALID [2022-04-28 04:01:23,633 INFO L290 TraceCheckUtils]: 16: Hoare triple {64271#(< 72 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {64267#(< 70 main_~y~0)} is VALID [2022-04-28 04:01:23,634 INFO L290 TraceCheckUtils]: 15: Hoare triple {64275#(< 74 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {64271#(< 72 main_~y~0)} is VALID [2022-04-28 04:01:23,634 INFO L290 TraceCheckUtils]: 14: Hoare triple {64279#(< 76 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {64275#(< 74 main_~y~0)} is VALID [2022-04-28 04:01:23,635 INFO L290 TraceCheckUtils]: 13: Hoare triple {64283#(< 78 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {64279#(< 76 main_~y~0)} is VALID [2022-04-28 04:01:23,635 INFO L290 TraceCheckUtils]: 12: Hoare triple {64287#(< 80 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {64283#(< 78 main_~y~0)} is VALID [2022-04-28 04:01:23,635 INFO L290 TraceCheckUtils]: 11: Hoare triple {64291#(< 82 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {64287#(< 80 main_~y~0)} is VALID [2022-04-28 04:01:23,636 INFO L290 TraceCheckUtils]: 10: Hoare triple {64295#(< 84 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {64291#(< 82 main_~y~0)} is VALID [2022-04-28 04:01:23,636 INFO L290 TraceCheckUtils]: 9: Hoare triple {64299#(or (< 84 main_~y~0) (< main_~x~0 1000000))} [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[] {64295#(< 84 main_~y~0)} is VALID [2022-04-28 04:01:23,637 INFO L290 TraceCheckUtils]: 8: Hoare triple {64303#(and (or (<= 84 main_~y~0) (not (<= 50000 main_~x~0)) (< main_~x~0 (+ 999916 main_~y~0))) (or (< 84 main_~y~0) (< main_~x~0 1000000)))} [226] L11-2-->L18-1_primed: Formula: (let ((.cse0 (= |v_main_#t~post6_291| |v_main_#t~post6_290|)) (.cse1 (= v_main_~y~0_3681 v_main_~y~0_3680)) (.cse2 (<= 50000 v_main_~x~0_3173))) (or (and (= |v_main_#t~post5_291| |v_main_#t~post5_290|) .cse0 (= v_main_~x~0_3173 v_main_~x~0_3172) .cse1) (and (= |v_main_#t~post5_290| |v_main_#t~post5_291|) .cse0 (= v_main_~x~0_3172 v_main_~x~0_3173) .cse1 (or (not (< v_main_~x~0_3173 1000000)) (not .cse2))) (and .cse2 (< v_main_~x~0_3173 v_main_~x~0_3172) (= (+ v_main_~x~0_3173 v_main_~y~0_3680) (+ v_main_~x~0_3172 v_main_~y~0_3681)) (< v_main_~x~0_3172 1000001)))) InVars {main_~y~0=v_main_~y~0_3681, main_#t~post5=|v_main_#t~post5_291|, main_~x~0=v_main_~x~0_3173, main_#t~post6=|v_main_#t~post6_291|} OutVars{main_~y~0=v_main_~y~0_3680, main_#t~post5=|v_main_#t~post5_290|, main_~x~0=v_main_~x~0_3172, main_#t~post6=|v_main_#t~post6_290|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {64299#(or (< 84 main_~y~0) (< main_~x~0 1000000))} is VALID [2022-04-28 04:01:23,637 INFO L290 TraceCheckUtils]: 7: Hoare triple {64303#(and (or (<= 84 main_~y~0) (not (<= 50000 main_~x~0)) (< main_~x~0 (+ 999916 main_~y~0))) (or (< 84 main_~y~0) (< main_~x~0 1000000)))} [225] L18-1_primed-->L11-2: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {64303#(and (or (<= 84 main_~y~0) (not (<= 50000 main_~x~0)) (< main_~x~0 (+ 999916 main_~y~0))) (or (< 84 main_~y~0) (< main_~x~0 1000000)))} is VALID [2022-04-28 04:01:23,638 INFO L290 TraceCheckUtils]: 6: Hoare triple {64310#(and (or (<= 84 main_~y~0) (< main_~x~0 (+ 999916 main_~y~0))) (<= 0 (+ main_~y~0 949915)) (or (< 84 main_~y~0) (< main_~x~0 1000000)))} [224] L11-2-->L18-1_primed: Formula: (let ((.cse0 (= v_main_~x~0_3171 v_main_~x~0_3170)) (.cse1 (= |v_main_#t~post4_265| |v_main_#t~post4_264|))) (or (and .cse0 .cse1) (and (< v_main_~x~0_3171 v_main_~x~0_3170) (< v_main_~x~0_3170 50001)) (and (not (< v_main_~x~0_3171 50000)) .cse0 .cse1))) InVars {main_~x~0=v_main_~x~0_3171, main_#t~post4=|v_main_#t~post4_265|} OutVars{main_~x~0=v_main_~x~0_3170, main_#t~post4=|v_main_#t~post4_264|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {64303#(and (or (<= 84 main_~y~0) (not (<= 50000 main_~x~0)) (< main_~x~0 (+ 999916 main_~y~0))) (or (< 84 main_~y~0) (< main_~x~0 1000000)))} is VALID [2022-04-28 04:01:23,638 INFO L290 TraceCheckUtils]: 5: Hoare triple {63849#true} ~x~0 := 0;~y~0 := 50000;~z~0 := 0;~x~0 := 0; {64310#(and (or (<= 84 main_~y~0) (< main_~x~0 (+ 999916 main_~y~0))) (<= 0 (+ main_~y~0 949915)) (or (< 84 main_~y~0) (< main_~x~0 1000000)))} is VALID [2022-04-28 04:01:23,638 INFO L272 TraceCheckUtils]: 4: Hoare triple {63849#true} call #t~ret7 := main(); {63849#true} is VALID [2022-04-28 04:01:23,639 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {63849#true} {63849#true} #52#return; {63849#true} is VALID [2022-04-28 04:01:23,639 INFO L290 TraceCheckUtils]: 2: Hoare triple {63849#true} assume true; {63849#true} is VALID [2022-04-28 04:01:23,639 INFO L290 TraceCheckUtils]: 1: Hoare triple {63849#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); {63849#true} is VALID [2022-04-28 04:01:23,639 INFO L272 TraceCheckUtils]: 0: Hoare triple {63849#true} call ULTIMATE.init(); {63849#true} is VALID [2022-04-28 04:01:23,639 INFO L134 CoverageAnalysis]: Checked inductivity of 905 backedges. 0 proven. 905 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 04:01:23,639 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1135473987] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 04:01:23,639 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 04:01:23,639 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [46, 48, 48] total 138 [2022-04-28 04:01:28,980 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 04:01:28,980 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1734601229] [2022-04-28 04:01:28,980 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1734601229] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 04:01:28,980 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 04:01:28,980 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [123] imperfect sequences [] total 123 [2022-04-28 04:01:28,981 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2075134044] [2022-04-28 04:01:28,981 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 04:01:28,981 INFO L78 Accepts]: Start accepts. Automaton has has 123 states, 123 states have (on average 1.6422764227642277) internal successors, (202), 122 states have internal predecessors, (202), 2 states have call successors, (3), 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 206 [2022-04-28 04:01:28,981 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 04:01:28,981 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 123 states, 123 states have (on average 1.6422764227642277) internal successors, (202), 122 states have internal predecessors, (202), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 04:01:29,119 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 206 edges. 206 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 04:01:29,120 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 123 states [2022-04-28 04:01:29,120 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 04:01:29,121 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 123 interpolants. [2022-04-28 04:01:29,123 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16131, Invalid=29451, Unknown=0, NotChecked=0, Total=45582 [2022-04-28 04:01:29,124 INFO L87 Difference]: Start difference. First operand 355 states and 359 transitions. Second operand has 123 states, 123 states have (on average 1.6422764227642277) internal successors, (202), 122 states have internal predecessors, (202), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 04:01:53,848 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 04:01:53,849 INFO L93 Difference]: Finished difference Result 559 states and 573 transitions. [2022-04-28 04:01:53,849 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 123 states. [2022-04-28 04:01:53,849 INFO L78 Accepts]: Start accepts. Automaton has has 123 states, 123 states have (on average 1.6422764227642277) internal successors, (202), 122 states have internal predecessors, (202), 2 states have call successors, (3), 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 206 [2022-04-28 04:01:53,849 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 04:01:53,849 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 123 states, 123 states have (on average 1.6422764227642277) internal successors, (202), 122 states have internal predecessors, (202), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 04:01:53,851 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 123 states to 123 states and 230 transitions. [2022-04-28 04:01:53,851 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 123 states, 123 states have (on average 1.6422764227642277) internal successors, (202), 122 states have internal predecessors, (202), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 04:01:53,853 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 123 states to 123 states and 230 transitions. [2022-04-28 04:01:53,853 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 123 states and 230 transitions. [2022-04-28 04:01:54,059 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 230 edges. 230 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 04:01:54,071 INFO L225 Difference]: With dead ends: 559 [2022-04-28 04:01:54,071 INFO L226 Difference]: Without dead ends: 362 [2022-04-28 04:01:54,080 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 438 GetRequests, 105 SyntacticMatches, 1 SemanticMatches, 332 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37778 ImplicationChecksByTransitivity, 15.0s TimeCoverageRelationStatistics Valid=30787, Invalid=80435, Unknown=0, NotChecked=0, Total=111222 [2022-04-28 04:01:54,080 INFO L413 NwaCegarLoop]: 12 mSDtfsCounter, 401 mSDsluCounter, 42 mSDsCounter, 0 mSdLazyCounter, 11812 mSolverCounterSat, 450 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 9.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 401 SdHoareTripleChecker+Valid, 54 SdHoareTripleChecker+Invalid, 12262 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 450 IncrementalHoareTripleChecker+Valid, 11812 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 9.3s IncrementalHoareTripleChecker+Time [2022-04-28 04:01:54,080 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [401 Valid, 54 Invalid, 12262 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [450 Valid, 11812 Invalid, 0 Unknown, 0 Unchecked, 9.3s Time] [2022-04-28 04:01:54,081 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 362 states. [2022-04-28 04:01:54,398 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 362 to 212. [2022-04-28 04:01:54,398 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 04:01:54,398 INFO L82 GeneralOperation]: Start isEquivalent. First operand 362 states. Second operand has 212 states, 207 states have (on average 1.0193236714975846) internal successors, (211), 207 states have internal predecessors, (211), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 04:01:54,399 INFO L74 IsIncluded]: Start isIncluded. First operand 362 states. Second operand has 212 states, 207 states have (on average 1.0193236714975846) internal successors, (211), 207 states have internal predecessors, (211), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 04:01:54,399 INFO L87 Difference]: Start difference. First operand 362 states. Second operand has 212 states, 207 states have (on average 1.0193236714975846) internal successors, (211), 207 states have internal predecessors, (211), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 04:01:54,403 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 04:01:54,403 INFO L93 Difference]: Finished difference Result 362 states and 366 transitions. [2022-04-28 04:01:54,403 INFO L276 IsEmpty]: Start isEmpty. Operand 362 states and 366 transitions. [2022-04-28 04:01:54,403 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 04:01:54,403 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 04:01:54,403 INFO L74 IsIncluded]: Start isIncluded. First operand has 212 states, 207 states have (on average 1.0193236714975846) internal successors, (211), 207 states have internal predecessors, (211), 3 states have call successors, (3), 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 362 states. [2022-04-28 04:01:54,403 INFO L87 Difference]: Start difference. First operand has 212 states, 207 states have (on average 1.0193236714975846) internal successors, (211), 207 states have internal predecessors, (211), 3 states have call successors, (3), 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 362 states. [2022-04-28 04:01:54,407 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 04:01:54,407 INFO L93 Difference]: Finished difference Result 362 states and 366 transitions. [2022-04-28 04:01:54,407 INFO L276 IsEmpty]: Start isEmpty. Operand 362 states and 366 transitions. [2022-04-28 04:01:54,407 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 04:01:54,407 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 04:01:54,408 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 04:01:54,408 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 04:01:54,408 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 212 states, 207 states have (on average 1.0193236714975846) internal successors, (211), 207 states have internal predecessors, (211), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 04:01:54,410 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 212 states to 212 states and 215 transitions. [2022-04-28 04:01:54,410 INFO L78 Accepts]: Start accepts. Automaton has 212 states and 215 transitions. Word has length 206 [2022-04-28 04:01:54,410 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 04:01:54,410 INFO L495 AbstractCegarLoop]: Abstraction has 212 states and 215 transitions. [2022-04-28 04:01:54,410 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 123 states, 123 states have (on average 1.6422764227642277) internal successors, (202), 122 states have internal predecessors, (202), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 04:01:54,410 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 212 states and 215 transitions. [2022-04-28 04:01:54,579 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 215 edges. 215 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 04:01:54,579 INFO L276 IsEmpty]: Start isEmpty. Operand 212 states and 215 transitions. [2022-04-28 04:01:54,579 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 212 [2022-04-28 04:01:54,579 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 04:01:54,580 INFO L195 NwaCegarLoop]: trace histogram [78, 77, 43, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 04:01:54,596 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (43)] Forceful destruction successful, exit code 0 [2022-04-28 04:01:54,780 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable44,43 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 04:01:54,780 INFO L420 AbstractCegarLoop]: === Iteration 46 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 04:01:54,780 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 04:01:54,780 INFO L85 PathProgramCache]: Analyzing trace with hash 671791144, now seen corresponding path program 43 times [2022-04-28 04:01:54,780 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 04:01:54,780 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1451550292] [2022-04-28 04:01:58,847 WARN L977 rdanLoopAcceleration]: Unable to prove correctness of quantifier elimination. [2022-04-28 04:01:58,897 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 1 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 04:01:59,092 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={1=1, 2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 04:01:59,093 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-28 04:01:59,095 INFO L85 PathProgramCache]: Analyzing trace with hash 291466722, now seen corresponding path program 1 times [2022-04-28 04:01:59,095 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 04:01:59,095 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1364418971] [2022-04-28 04:01:59,095 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 04:01:59,095 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 04:01:59,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 04:01:59,937 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 04:01:59,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 04:01:59,940 INFO L290 TraceCheckUtils]: 0: Hoare triple {66962#(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); {66913#true} is VALID [2022-04-28 04:01:59,940 INFO L290 TraceCheckUtils]: 1: Hoare triple {66913#true} assume true; {66913#true} is VALID [2022-04-28 04:01:59,940 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {66913#true} {66913#true} #52#return; {66913#true} is VALID [2022-04-28 04:01:59,940 INFO L272 TraceCheckUtils]: 0: Hoare triple {66913#true} call ULTIMATE.init(); {66962#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 04:01:59,940 INFO L290 TraceCheckUtils]: 1: Hoare triple {66962#(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); {66913#true} is VALID [2022-04-28 04:01:59,940 INFO L290 TraceCheckUtils]: 2: Hoare triple {66913#true} assume true; {66913#true} is VALID [2022-04-28 04:01:59,940 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {66913#true} {66913#true} #52#return; {66913#true} is VALID [2022-04-28 04:01:59,940 INFO L272 TraceCheckUtils]: 4: Hoare triple {66913#true} call #t~ret7 := main(); {66913#true} is VALID [2022-04-28 04:01:59,941 INFO L290 TraceCheckUtils]: 5: Hoare triple {66913#true} ~x~0 := 0;~y~0 := 50000;~z~0 := 0;~x~0 := 0; {66918#(<= 50000 main_~y~0)} is VALID [2022-04-28 04:01:59,941 INFO L290 TraceCheckUtils]: 6: Hoare triple {66918#(<= 50000 main_~y~0)} [228] L11-2-->L18-1_primed: Formula: (let ((.cse0 (= v_main_~x~0_3306 v_main_~x~0_3305)) (.cse1 (= |v_main_#t~post4_272| |v_main_#t~post4_271|))) (or (and (not (< v_main_~x~0_3306 50000)) .cse0 .cse1) (and (< v_main_~x~0_3305 50001) (< v_main_~x~0_3306 v_main_~x~0_3305)) (and .cse0 .cse1))) InVars {main_~x~0=v_main_~x~0_3306, main_#t~post4=|v_main_#t~post4_272|} OutVars{main_~x~0=v_main_~x~0_3305, main_#t~post4=|v_main_#t~post4_271|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {66918#(<= 50000 main_~y~0)} is VALID [2022-04-28 04:01:59,941 INFO L290 TraceCheckUtils]: 7: Hoare triple {66918#(<= 50000 main_~y~0)} [229] L18-1_primed-->L11-2: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {66918#(<= 50000 main_~y~0)} is VALID [2022-04-28 04:01:59,942 INFO L290 TraceCheckUtils]: 8: Hoare triple {66918#(<= 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|)) (.cse3 (= v_main_~x~0_3308 v_main_~x~0_3307)) (.cse4 (= v_main_~y~0_3849 v_main_~y~0_3848)) (.cse2 (<= 50000 v_main_~x~0_3308))) (or (and .cse0 .cse1 (or (not (< v_main_~x~0_3308 1000000)) (not .cse2)) .cse3 .cse4) (and .cse0 .cse1 .cse3 .cse4) (let ((.cse5 (+ v_main_~x~0_3308 v_main_~y~0_3848))) (and (= (+ v_main_~x~0_3307 v_main_~y~0_3849) .cse5) (< v_main_~y~0_3849 v_main_~y~0_3848) (< .cse5 (+ 1000001 v_main_~y~0_3849)) .cse2)))) InVars {main_~y~0=v_main_~y~0_3849, main_#t~post5=|v_main_#t~post5_298|, main_~x~0=v_main_~x~0_3308, main_#t~post6=|v_main_#t~post6_298|} OutVars{main_~y~0=v_main_~y~0_3848, main_#t~post5=|v_main_#t~post5_297|, main_~x~0=v_main_~x~0_3307, main_#t~post6=|v_main_#t~post6_297|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {66918#(<= 50000 main_~y~0)} is VALID [2022-04-28 04:01:59,942 INFO L290 TraceCheckUtils]: 9: Hoare triple {66918#(<= 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[] {66918#(<= 50000 main_~y~0)} is VALID [2022-04-28 04:01:59,943 INFO L290 TraceCheckUtils]: 10: Hoare triple {66918#(<= 50000 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {66919#(<= 49998 main_~y~0)} is VALID [2022-04-28 04:01:59,943 INFO L290 TraceCheckUtils]: 11: Hoare triple {66919#(<= 49998 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {66920#(<= 49996 main_~y~0)} is VALID [2022-04-28 04:01:59,944 INFO L290 TraceCheckUtils]: 12: Hoare triple {66920#(<= 49996 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {66921#(<= 49994 main_~y~0)} is VALID [2022-04-28 04:01:59,944 INFO L290 TraceCheckUtils]: 13: Hoare triple {66921#(<= 49994 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {66922#(<= 49992 main_~y~0)} is VALID [2022-04-28 04:01:59,944 INFO L290 TraceCheckUtils]: 14: Hoare triple {66922#(<= 49992 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {66923#(<= 49990 main_~y~0)} is VALID [2022-04-28 04:01:59,945 INFO L290 TraceCheckUtils]: 15: Hoare triple {66923#(<= 49990 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {66924#(<= 49988 main_~y~0)} is VALID [2022-04-28 04:01:59,945 INFO L290 TraceCheckUtils]: 16: Hoare triple {66924#(<= 49988 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {66925#(<= 49986 main_~y~0)} is VALID [2022-04-28 04:01:59,946 INFO L290 TraceCheckUtils]: 17: Hoare triple {66925#(<= 49986 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {66926#(<= 49984 main_~y~0)} is VALID [2022-04-28 04:01:59,946 INFO L290 TraceCheckUtils]: 18: Hoare triple {66926#(<= 49984 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {66927#(<= 49982 main_~y~0)} is VALID [2022-04-28 04:01:59,947 INFO L290 TraceCheckUtils]: 19: Hoare triple {66927#(<= 49982 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {66928#(<= 49980 main_~y~0)} is VALID [2022-04-28 04:01:59,947 INFO L290 TraceCheckUtils]: 20: Hoare triple {66928#(<= 49980 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {66929#(<= 49978 main_~y~0)} is VALID [2022-04-28 04:01:59,947 INFO L290 TraceCheckUtils]: 21: Hoare triple {66929#(<= 49978 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {66930#(<= 49976 main_~y~0)} is VALID [2022-04-28 04:01:59,948 INFO L290 TraceCheckUtils]: 22: Hoare triple {66930#(<= 49976 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {66931#(<= 49974 main_~y~0)} is VALID [2022-04-28 04:01:59,948 INFO L290 TraceCheckUtils]: 23: Hoare triple {66931#(<= 49974 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {66932#(<= 49972 main_~y~0)} is VALID [2022-04-28 04:01:59,949 INFO L290 TraceCheckUtils]: 24: Hoare triple {66932#(<= 49972 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {66933#(<= 49970 main_~y~0)} is VALID [2022-04-28 04:01:59,949 INFO L290 TraceCheckUtils]: 25: Hoare triple {66933#(<= 49970 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {66934#(<= 49968 main_~y~0)} is VALID [2022-04-28 04:01:59,949 INFO L290 TraceCheckUtils]: 26: Hoare triple {66934#(<= 49968 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {66935#(<= 49966 main_~y~0)} is VALID [2022-04-28 04:01:59,962 INFO L290 TraceCheckUtils]: 27: Hoare triple {66935#(<= 49966 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {66936#(<= 49964 main_~y~0)} is VALID [2022-04-28 04:01:59,962 INFO L290 TraceCheckUtils]: 28: Hoare triple {66936#(<= 49964 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {66937#(<= 49962 main_~y~0)} is VALID [2022-04-28 04:01:59,963 INFO L290 TraceCheckUtils]: 29: Hoare triple {66937#(<= 49962 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {66938#(<= 49960 main_~y~0)} is VALID [2022-04-28 04:01:59,963 INFO L290 TraceCheckUtils]: 30: Hoare triple {66938#(<= 49960 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {66939#(<= 49958 main_~y~0)} is VALID [2022-04-28 04:01:59,964 INFO L290 TraceCheckUtils]: 31: Hoare triple {66939#(<= 49958 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {66940#(<= 49956 main_~y~0)} is VALID [2022-04-28 04:01:59,964 INFO L290 TraceCheckUtils]: 32: Hoare triple {66940#(<= 49956 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {66941#(<= 49954 main_~y~0)} is VALID [2022-04-28 04:01:59,965 INFO L290 TraceCheckUtils]: 33: Hoare triple {66941#(<= 49954 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {66942#(<= 49952 main_~y~0)} is VALID [2022-04-28 04:01:59,965 INFO L290 TraceCheckUtils]: 34: Hoare triple {66942#(<= 49952 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {66943#(<= 49950 main_~y~0)} is VALID [2022-04-28 04:01:59,965 INFO L290 TraceCheckUtils]: 35: Hoare triple {66943#(<= 49950 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {66944#(<= 49948 main_~y~0)} is VALID [2022-04-28 04:01:59,966 INFO L290 TraceCheckUtils]: 36: Hoare triple {66944#(<= 49948 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {66945#(<= 49946 main_~y~0)} is VALID [2022-04-28 04:01:59,966 INFO L290 TraceCheckUtils]: 37: Hoare triple {66945#(<= 49946 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {66946#(<= 49944 main_~y~0)} is VALID [2022-04-28 04:01:59,967 INFO L290 TraceCheckUtils]: 38: Hoare triple {66946#(<= 49944 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {66947#(<= 49942 main_~y~0)} is VALID [2022-04-28 04:01:59,967 INFO L290 TraceCheckUtils]: 39: Hoare triple {66947#(<= 49942 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {66948#(<= 49940 main_~y~0)} is VALID [2022-04-28 04:01:59,968 INFO L290 TraceCheckUtils]: 40: Hoare triple {66948#(<= 49940 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {66949#(<= 49938 main_~y~0)} is VALID [2022-04-28 04:01:59,968 INFO L290 TraceCheckUtils]: 41: Hoare triple {66949#(<= 49938 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {66950#(<= 49936 main_~y~0)} is VALID [2022-04-28 04:01:59,968 INFO L290 TraceCheckUtils]: 42: Hoare triple {66950#(<= 49936 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {66951#(<= 49934 main_~y~0)} is VALID [2022-04-28 04:01:59,969 INFO L290 TraceCheckUtils]: 43: Hoare triple {66951#(<= 49934 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {66952#(<= 49932 main_~y~0)} is VALID [2022-04-28 04:01:59,969 INFO L290 TraceCheckUtils]: 44: Hoare triple {66952#(<= 49932 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {66953#(<= 49930 main_~y~0)} is VALID [2022-04-28 04:01:59,970 INFO L290 TraceCheckUtils]: 45: Hoare triple {66953#(<= 49930 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {66954#(<= 49928 main_~y~0)} is VALID [2022-04-28 04:01:59,970 INFO L290 TraceCheckUtils]: 46: Hoare triple {66954#(<= 49928 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {66955#(<= 49926 main_~y~0)} is VALID [2022-04-28 04:01:59,970 INFO L290 TraceCheckUtils]: 47: Hoare triple {66955#(<= 49926 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {66956#(<= 49924 main_~y~0)} is VALID [2022-04-28 04:01:59,971 INFO L290 TraceCheckUtils]: 48: Hoare triple {66956#(<= 49924 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {66957#(<= 49922 main_~y~0)} is VALID [2022-04-28 04:01:59,971 INFO L290 TraceCheckUtils]: 49: Hoare triple {66957#(<= 49922 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {66958#(<= 49920 main_~y~0)} is VALID [2022-04-28 04:01:59,972 INFO L290 TraceCheckUtils]: 50: Hoare triple {66958#(<= 49920 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {66959#(<= 49918 main_~y~0)} is VALID [2022-04-28 04:01:59,972 INFO L290 TraceCheckUtils]: 51: Hoare triple {66959#(<= 49918 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {66960#(<= 49916 main_~y~0)} is VALID [2022-04-28 04:01:59,973 INFO L290 TraceCheckUtils]: 52: Hoare triple {66960#(<= 49916 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {66961#(<= 49914 main_~y~0)} is VALID [2022-04-28 04:01:59,973 INFO L290 TraceCheckUtils]: 53: Hoare triple {66961#(<= 49914 main_~y~0)} assume !(~y~0 > 0); {66914#false} is VALID [2022-04-28 04:01:59,973 INFO L272 TraceCheckUtils]: 54: Hoare triple {66914#false} call __VERIFIER_assert((if ~z~0 == ~x~0 then 1 else 0)); {66914#false} is VALID [2022-04-28 04:01:59,973 INFO L290 TraceCheckUtils]: 55: Hoare triple {66914#false} ~cond := #in~cond; {66914#false} is VALID [2022-04-28 04:01:59,973 INFO L290 TraceCheckUtils]: 56: Hoare triple {66914#false} assume 0 == ~cond; {66914#false} is VALID [2022-04-28 04:01:59,973 INFO L290 TraceCheckUtils]: 57: Hoare triple {66914#false} assume !false; {66914#false} is VALID [2022-04-28 04:01:59,973 INFO L134 CoverageAnalysis]: Checked inductivity of 948 backedges. 0 proven. 946 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-04-28 04:01:59,973 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 04:01:59,973 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1364418971] [2022-04-28 04:01:59,974 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1364418971] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 04:01:59,974 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1354851378] [2022-04-28 04:01:59,974 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 04:01:59,974 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 04:01:59,974 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 04:01:59,975 INFO L229 MonitoredProcess]: Starting monitored process 44 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 04:01:59,975 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (44)] Waiting until timeout for monitored process [2022-04-28 04:02:00,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 04:02:00,032 INFO L263 TraceCheckSpWp]: Trace formula consists of 274 conjuncts, 46 conjunts are in the unsatisfiable core [2022-04-28 04:02:00,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 04:02:00,055 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 04:02:00,587 INFO L272 TraceCheckUtils]: 0: Hoare triple {66913#true} call ULTIMATE.init(); {66913#true} is VALID [2022-04-28 04:02:00,587 INFO L290 TraceCheckUtils]: 1: Hoare triple {66913#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); {66913#true} is VALID [2022-04-28 04:02:00,587 INFO L290 TraceCheckUtils]: 2: Hoare triple {66913#true} assume true; {66913#true} is VALID [2022-04-28 04:02:00,587 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {66913#true} {66913#true} #52#return; {66913#true} is VALID [2022-04-28 04:02:00,587 INFO L272 TraceCheckUtils]: 4: Hoare triple {66913#true} call #t~ret7 := main(); {66913#true} is VALID [2022-04-28 04:02:00,587 INFO L290 TraceCheckUtils]: 5: Hoare triple {66913#true} ~x~0 := 0;~y~0 := 50000;~z~0 := 0;~x~0 := 0; {66918#(<= 50000 main_~y~0)} is VALID [2022-04-28 04:02:00,588 INFO L290 TraceCheckUtils]: 6: Hoare triple {66918#(<= 50000 main_~y~0)} [228] L11-2-->L18-1_primed: Formula: (let ((.cse0 (= v_main_~x~0_3306 v_main_~x~0_3305)) (.cse1 (= |v_main_#t~post4_272| |v_main_#t~post4_271|))) (or (and (not (< v_main_~x~0_3306 50000)) .cse0 .cse1) (and (< v_main_~x~0_3305 50001) (< v_main_~x~0_3306 v_main_~x~0_3305)) (and .cse0 .cse1))) InVars {main_~x~0=v_main_~x~0_3306, main_#t~post4=|v_main_#t~post4_272|} OutVars{main_~x~0=v_main_~x~0_3305, main_#t~post4=|v_main_#t~post4_271|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {66918#(<= 50000 main_~y~0)} is VALID [2022-04-28 04:02:00,588 INFO L290 TraceCheckUtils]: 7: Hoare triple {66918#(<= 50000 main_~y~0)} [229] L18-1_primed-->L11-2: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {66918#(<= 50000 main_~y~0)} is VALID [2022-04-28 04:02:00,589 INFO L290 TraceCheckUtils]: 8: Hoare triple {66918#(<= 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|)) (.cse3 (= v_main_~x~0_3308 v_main_~x~0_3307)) (.cse4 (= v_main_~y~0_3849 v_main_~y~0_3848)) (.cse2 (<= 50000 v_main_~x~0_3308))) (or (and .cse0 .cse1 (or (not (< v_main_~x~0_3308 1000000)) (not .cse2)) .cse3 .cse4) (and .cse0 .cse1 .cse3 .cse4) (let ((.cse5 (+ v_main_~x~0_3308 v_main_~y~0_3848))) (and (= (+ v_main_~x~0_3307 v_main_~y~0_3849) .cse5) (< v_main_~y~0_3849 v_main_~y~0_3848) (< .cse5 (+ 1000001 v_main_~y~0_3849)) .cse2)))) InVars {main_~y~0=v_main_~y~0_3849, main_#t~post5=|v_main_#t~post5_298|, main_~x~0=v_main_~x~0_3308, main_#t~post6=|v_main_#t~post6_298|} OutVars{main_~y~0=v_main_~y~0_3848, main_#t~post5=|v_main_#t~post5_297|, main_~x~0=v_main_~x~0_3307, main_#t~post6=|v_main_#t~post6_297|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {66918#(<= 50000 main_~y~0)} is VALID [2022-04-28 04:02:00,589 INFO L290 TraceCheckUtils]: 9: Hoare triple {66918#(<= 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[] {66918#(<= 50000 main_~y~0)} is VALID [2022-04-28 04:02:00,589 INFO L290 TraceCheckUtils]: 10: Hoare triple {66918#(<= 50000 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {66919#(<= 49998 main_~y~0)} is VALID [2022-04-28 04:02:00,590 INFO L290 TraceCheckUtils]: 11: Hoare triple {66919#(<= 49998 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {66920#(<= 49996 main_~y~0)} is VALID [2022-04-28 04:02:00,590 INFO L290 TraceCheckUtils]: 12: Hoare triple {66920#(<= 49996 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {66921#(<= 49994 main_~y~0)} is VALID [2022-04-28 04:02:00,591 INFO L290 TraceCheckUtils]: 13: Hoare triple {66921#(<= 49994 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {66922#(<= 49992 main_~y~0)} is VALID [2022-04-28 04:02:00,591 INFO L290 TraceCheckUtils]: 14: Hoare triple {66922#(<= 49992 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {66923#(<= 49990 main_~y~0)} is VALID [2022-04-28 04:02:00,592 INFO L290 TraceCheckUtils]: 15: Hoare triple {66923#(<= 49990 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {66924#(<= 49988 main_~y~0)} is VALID [2022-04-28 04:02:00,592 INFO L290 TraceCheckUtils]: 16: Hoare triple {66924#(<= 49988 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {66925#(<= 49986 main_~y~0)} is VALID [2022-04-28 04:02:00,592 INFO L290 TraceCheckUtils]: 17: Hoare triple {66925#(<= 49986 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {66926#(<= 49984 main_~y~0)} is VALID [2022-04-28 04:02:00,593 INFO L290 TraceCheckUtils]: 18: Hoare triple {66926#(<= 49984 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {66927#(<= 49982 main_~y~0)} is VALID [2022-04-28 04:02:00,593 INFO L290 TraceCheckUtils]: 19: Hoare triple {66927#(<= 49982 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {66928#(<= 49980 main_~y~0)} is VALID [2022-04-28 04:02:00,594 INFO L290 TraceCheckUtils]: 20: Hoare triple {66928#(<= 49980 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {66929#(<= 49978 main_~y~0)} is VALID [2022-04-28 04:02:00,594 INFO L290 TraceCheckUtils]: 21: Hoare triple {66929#(<= 49978 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {66930#(<= 49976 main_~y~0)} is VALID [2022-04-28 04:02:00,595 INFO L290 TraceCheckUtils]: 22: Hoare triple {66930#(<= 49976 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {66931#(<= 49974 main_~y~0)} is VALID [2022-04-28 04:02:00,595 INFO L290 TraceCheckUtils]: 23: Hoare triple {66931#(<= 49974 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {66932#(<= 49972 main_~y~0)} is VALID [2022-04-28 04:02:00,595 INFO L290 TraceCheckUtils]: 24: Hoare triple {66932#(<= 49972 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {66933#(<= 49970 main_~y~0)} is VALID [2022-04-28 04:02:00,596 INFO L290 TraceCheckUtils]: 25: Hoare triple {66933#(<= 49970 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {66934#(<= 49968 main_~y~0)} is VALID [2022-04-28 04:02:00,596 INFO L290 TraceCheckUtils]: 26: Hoare triple {66934#(<= 49968 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {66935#(<= 49966 main_~y~0)} is VALID [2022-04-28 04:02:00,597 INFO L290 TraceCheckUtils]: 27: Hoare triple {66935#(<= 49966 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {66936#(<= 49964 main_~y~0)} is VALID [2022-04-28 04:02:00,597 INFO L290 TraceCheckUtils]: 28: Hoare triple {66936#(<= 49964 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {66937#(<= 49962 main_~y~0)} is VALID [2022-04-28 04:02:00,597 INFO L290 TraceCheckUtils]: 29: Hoare triple {66937#(<= 49962 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {66938#(<= 49960 main_~y~0)} is VALID [2022-04-28 04:02:00,598 INFO L290 TraceCheckUtils]: 30: Hoare triple {66938#(<= 49960 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {66939#(<= 49958 main_~y~0)} is VALID [2022-04-28 04:02:00,598 INFO L290 TraceCheckUtils]: 31: Hoare triple {66939#(<= 49958 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {66940#(<= 49956 main_~y~0)} is VALID [2022-04-28 04:02:00,599 INFO L290 TraceCheckUtils]: 32: Hoare triple {66940#(<= 49956 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {66941#(<= 49954 main_~y~0)} is VALID [2022-04-28 04:02:00,599 INFO L290 TraceCheckUtils]: 33: Hoare triple {66941#(<= 49954 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {66942#(<= 49952 main_~y~0)} is VALID [2022-04-28 04:02:00,600 INFO L290 TraceCheckUtils]: 34: Hoare triple {66942#(<= 49952 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {66943#(<= 49950 main_~y~0)} is VALID [2022-04-28 04:02:00,600 INFO L290 TraceCheckUtils]: 35: Hoare triple {66943#(<= 49950 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {66944#(<= 49948 main_~y~0)} is VALID [2022-04-28 04:02:00,600 INFO L290 TraceCheckUtils]: 36: Hoare triple {66944#(<= 49948 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {66945#(<= 49946 main_~y~0)} is VALID [2022-04-28 04:02:00,601 INFO L290 TraceCheckUtils]: 37: Hoare triple {66945#(<= 49946 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {66946#(<= 49944 main_~y~0)} is VALID [2022-04-28 04:02:00,601 INFO L290 TraceCheckUtils]: 38: Hoare triple {66946#(<= 49944 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {66947#(<= 49942 main_~y~0)} is VALID [2022-04-28 04:02:00,602 INFO L290 TraceCheckUtils]: 39: Hoare triple {66947#(<= 49942 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {66948#(<= 49940 main_~y~0)} is VALID [2022-04-28 04:02:00,602 INFO L290 TraceCheckUtils]: 40: Hoare triple {66948#(<= 49940 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {66949#(<= 49938 main_~y~0)} is VALID [2022-04-28 04:02:00,602 INFO L290 TraceCheckUtils]: 41: Hoare triple {66949#(<= 49938 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {66950#(<= 49936 main_~y~0)} is VALID [2022-04-28 04:02:00,603 INFO L290 TraceCheckUtils]: 42: Hoare triple {66950#(<= 49936 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {66951#(<= 49934 main_~y~0)} is VALID [2022-04-28 04:02:00,603 INFO L290 TraceCheckUtils]: 43: Hoare triple {66951#(<= 49934 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {66952#(<= 49932 main_~y~0)} is VALID [2022-04-28 04:02:00,604 INFO L290 TraceCheckUtils]: 44: Hoare triple {66952#(<= 49932 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {66953#(<= 49930 main_~y~0)} is VALID [2022-04-28 04:02:00,604 INFO L290 TraceCheckUtils]: 45: Hoare triple {66953#(<= 49930 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {66954#(<= 49928 main_~y~0)} is VALID [2022-04-28 04:02:00,604 INFO L290 TraceCheckUtils]: 46: Hoare triple {66954#(<= 49928 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {66955#(<= 49926 main_~y~0)} is VALID [2022-04-28 04:02:00,605 INFO L290 TraceCheckUtils]: 47: Hoare triple {66955#(<= 49926 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {66956#(<= 49924 main_~y~0)} is VALID [2022-04-28 04:02:00,605 INFO L290 TraceCheckUtils]: 48: Hoare triple {66956#(<= 49924 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {66957#(<= 49922 main_~y~0)} is VALID [2022-04-28 04:02:00,606 INFO L290 TraceCheckUtils]: 49: Hoare triple {66957#(<= 49922 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {66958#(<= 49920 main_~y~0)} is VALID [2022-04-28 04:02:00,606 INFO L290 TraceCheckUtils]: 50: Hoare triple {66958#(<= 49920 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {66959#(<= 49918 main_~y~0)} is VALID [2022-04-28 04:02:00,606 INFO L290 TraceCheckUtils]: 51: Hoare triple {66959#(<= 49918 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {66960#(<= 49916 main_~y~0)} is VALID [2022-04-28 04:02:00,607 INFO L290 TraceCheckUtils]: 52: Hoare triple {66960#(<= 49916 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {66961#(<= 49914 main_~y~0)} is VALID [2022-04-28 04:02:00,607 INFO L290 TraceCheckUtils]: 53: Hoare triple {66961#(<= 49914 main_~y~0)} assume !(~y~0 > 0); {66914#false} is VALID [2022-04-28 04:02:00,607 INFO L272 TraceCheckUtils]: 54: Hoare triple {66914#false} call __VERIFIER_assert((if ~z~0 == ~x~0 then 1 else 0)); {66914#false} is VALID [2022-04-28 04:02:00,607 INFO L290 TraceCheckUtils]: 55: Hoare triple {66914#false} ~cond := #in~cond; {66914#false} is VALID [2022-04-28 04:02:00,607 INFO L290 TraceCheckUtils]: 56: Hoare triple {66914#false} assume 0 == ~cond; {66914#false} is VALID [2022-04-28 04:02:00,607 INFO L290 TraceCheckUtils]: 57: Hoare triple {66914#false} assume !false; {66914#false} is VALID [2022-04-28 04:02:00,608 INFO L134 CoverageAnalysis]: Checked inductivity of 948 backedges. 0 proven. 946 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-04-28 04:02:00,608 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 04:02:03,015 INFO L290 TraceCheckUtils]: 57: Hoare triple {66914#false} assume !false; {66914#false} is VALID [2022-04-28 04:02:03,015 INFO L290 TraceCheckUtils]: 56: Hoare triple {66914#false} assume 0 == ~cond; {66914#false} is VALID [2022-04-28 04:02:03,015 INFO L290 TraceCheckUtils]: 55: Hoare triple {66914#false} ~cond := #in~cond; {66914#false} is VALID [2022-04-28 04:02:03,015 INFO L272 TraceCheckUtils]: 54: Hoare triple {66914#false} call __VERIFIER_assert((if ~z~0 == ~x~0 then 1 else 0)); {66914#false} is VALID [2022-04-28 04:02:03,015 INFO L290 TraceCheckUtils]: 53: Hoare triple {67149#(< 0 main_~y~0)} assume !(~y~0 > 0); {66914#false} is VALID [2022-04-28 04:02:03,016 INFO L290 TraceCheckUtils]: 52: Hoare triple {67153#(< 2 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {67149#(< 0 main_~y~0)} is VALID [2022-04-28 04:02:03,016 INFO L290 TraceCheckUtils]: 51: Hoare triple {67157#(< 4 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {67153#(< 2 main_~y~0)} is VALID [2022-04-28 04:02:03,017 INFO L290 TraceCheckUtils]: 50: Hoare triple {67161#(< 6 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {67157#(< 4 main_~y~0)} is VALID [2022-04-28 04:02:03,017 INFO L290 TraceCheckUtils]: 49: Hoare triple {67165#(< 8 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {67161#(< 6 main_~y~0)} is VALID [2022-04-28 04:02:03,018 INFO L290 TraceCheckUtils]: 48: Hoare triple {67169#(< 10 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {67165#(< 8 main_~y~0)} is VALID [2022-04-28 04:02:03,018 INFO L290 TraceCheckUtils]: 47: Hoare triple {67173#(< 12 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {67169#(< 10 main_~y~0)} is VALID [2022-04-28 04:02:03,018 INFO L290 TraceCheckUtils]: 46: Hoare triple {67177#(< 14 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {67173#(< 12 main_~y~0)} is VALID [2022-04-28 04:02:03,019 INFO L290 TraceCheckUtils]: 45: Hoare triple {67181#(< 16 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {67177#(< 14 main_~y~0)} is VALID [2022-04-28 04:02:03,019 INFO L290 TraceCheckUtils]: 44: Hoare triple {67185#(< 18 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {67181#(< 16 main_~y~0)} is VALID [2022-04-28 04:02:03,020 INFO L290 TraceCheckUtils]: 43: Hoare triple {67189#(< 20 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {67185#(< 18 main_~y~0)} is VALID [2022-04-28 04:02:03,020 INFO L290 TraceCheckUtils]: 42: Hoare triple {67193#(< 22 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {67189#(< 20 main_~y~0)} is VALID [2022-04-28 04:02:03,020 INFO L290 TraceCheckUtils]: 41: Hoare triple {67197#(< 24 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {67193#(< 22 main_~y~0)} is VALID [2022-04-28 04:02:03,021 INFO L290 TraceCheckUtils]: 40: Hoare triple {67201#(< 26 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {67197#(< 24 main_~y~0)} is VALID [2022-04-28 04:02:03,021 INFO L290 TraceCheckUtils]: 39: Hoare triple {67205#(< 28 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {67201#(< 26 main_~y~0)} is VALID [2022-04-28 04:02:03,022 INFO L290 TraceCheckUtils]: 38: Hoare triple {67209#(< 30 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {67205#(< 28 main_~y~0)} is VALID [2022-04-28 04:02:03,022 INFO L290 TraceCheckUtils]: 37: Hoare triple {67213#(< 32 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {67209#(< 30 main_~y~0)} is VALID [2022-04-28 04:02:03,022 INFO L290 TraceCheckUtils]: 36: Hoare triple {67217#(< 34 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {67213#(< 32 main_~y~0)} is VALID [2022-04-28 04:02:03,023 INFO L290 TraceCheckUtils]: 35: Hoare triple {67221#(< 36 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {67217#(< 34 main_~y~0)} is VALID [2022-04-28 04:02:03,023 INFO L290 TraceCheckUtils]: 34: Hoare triple {67225#(< 38 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {67221#(< 36 main_~y~0)} is VALID [2022-04-28 04:02:03,024 INFO L290 TraceCheckUtils]: 33: Hoare triple {67229#(< 40 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {67225#(< 38 main_~y~0)} is VALID [2022-04-28 04:02:03,024 INFO L290 TraceCheckUtils]: 32: Hoare triple {67233#(< 42 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {67229#(< 40 main_~y~0)} is VALID [2022-04-28 04:02:03,024 INFO L290 TraceCheckUtils]: 31: Hoare triple {67237#(< 44 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {67233#(< 42 main_~y~0)} is VALID [2022-04-28 04:02:03,025 INFO L290 TraceCheckUtils]: 30: Hoare triple {67241#(< 46 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {67237#(< 44 main_~y~0)} is VALID [2022-04-28 04:02:03,025 INFO L290 TraceCheckUtils]: 29: Hoare triple {67245#(< 48 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {67241#(< 46 main_~y~0)} is VALID [2022-04-28 04:02:03,026 INFO L290 TraceCheckUtils]: 28: Hoare triple {67249#(< 50 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {67245#(< 48 main_~y~0)} is VALID [2022-04-28 04:02:03,026 INFO L290 TraceCheckUtils]: 27: Hoare triple {67253#(< 52 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {67249#(< 50 main_~y~0)} is VALID [2022-04-28 04:02:03,026 INFO L290 TraceCheckUtils]: 26: Hoare triple {67257#(< 54 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {67253#(< 52 main_~y~0)} is VALID [2022-04-28 04:02:03,027 INFO L290 TraceCheckUtils]: 25: Hoare triple {67261#(< 56 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {67257#(< 54 main_~y~0)} is VALID [2022-04-28 04:02:03,027 INFO L290 TraceCheckUtils]: 24: Hoare triple {67265#(< 58 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {67261#(< 56 main_~y~0)} is VALID [2022-04-28 04:02:03,028 INFO L290 TraceCheckUtils]: 23: Hoare triple {67269#(< 60 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {67265#(< 58 main_~y~0)} is VALID [2022-04-28 04:02:03,028 INFO L290 TraceCheckUtils]: 22: Hoare triple {67273#(< 62 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {67269#(< 60 main_~y~0)} is VALID [2022-04-28 04:02:03,028 INFO L290 TraceCheckUtils]: 21: Hoare triple {67277#(< 64 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {67273#(< 62 main_~y~0)} is VALID [2022-04-28 04:02:03,029 INFO L290 TraceCheckUtils]: 20: Hoare triple {67281#(< 66 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {67277#(< 64 main_~y~0)} is VALID [2022-04-28 04:02:03,029 INFO L290 TraceCheckUtils]: 19: Hoare triple {67285#(< 68 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {67281#(< 66 main_~y~0)} is VALID [2022-04-28 04:02:03,030 INFO L290 TraceCheckUtils]: 18: Hoare triple {67289#(< 70 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {67285#(< 68 main_~y~0)} is VALID [2022-04-28 04:02:03,030 INFO L290 TraceCheckUtils]: 17: Hoare triple {67293#(< 72 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {67289#(< 70 main_~y~0)} is VALID [2022-04-28 04:02:03,030 INFO L290 TraceCheckUtils]: 16: Hoare triple {67297#(< 74 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {67293#(< 72 main_~y~0)} is VALID [2022-04-28 04:02:03,031 INFO L290 TraceCheckUtils]: 15: Hoare triple {67301#(< 76 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {67297#(< 74 main_~y~0)} is VALID [2022-04-28 04:02:03,031 INFO L290 TraceCheckUtils]: 14: Hoare triple {67305#(< 78 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {67301#(< 76 main_~y~0)} is VALID [2022-04-28 04:02:03,032 INFO L290 TraceCheckUtils]: 13: Hoare triple {67309#(< 80 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {67305#(< 78 main_~y~0)} is VALID [2022-04-28 04:02:03,032 INFO L290 TraceCheckUtils]: 12: Hoare triple {67313#(< 82 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {67309#(< 80 main_~y~0)} is VALID [2022-04-28 04:02:03,032 INFO L290 TraceCheckUtils]: 11: Hoare triple {67317#(< 84 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {67313#(< 82 main_~y~0)} is VALID [2022-04-28 04:02:03,033 INFO L290 TraceCheckUtils]: 10: Hoare triple {67321#(< 86 main_~y~0)} assume !!(~y~0 > 0);~y~0 := ~y~0 - 2;~x~0 := ~x~0 - 2; {67317#(< 84 main_~y~0)} is VALID [2022-04-28 04:02:03,033 INFO L290 TraceCheckUtils]: 9: Hoare triple {67321#(< 86 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[] {67321#(< 86 main_~y~0)} is VALID [2022-04-28 04:02:03,034 INFO L290 TraceCheckUtils]: 8: Hoare triple {67321#(< 86 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|)) (.cse3 (= v_main_~x~0_3308 v_main_~x~0_3307)) (.cse4 (= v_main_~y~0_3849 v_main_~y~0_3848)) (.cse2 (<= 50000 v_main_~x~0_3308))) (or (and .cse0 .cse1 (or (not (< v_main_~x~0_3308 1000000)) (not .cse2)) .cse3 .cse4) (and .cse0 .cse1 .cse3 .cse4) (let ((.cse5 (+ v_main_~x~0_3308 v_main_~y~0_3848))) (and (= (+ v_main_~x~0_3307 v_main_~y~0_3849) .cse5) (< v_main_~y~0_3849 v_main_~y~0_3848) (< .cse5 (+ 1000001 v_main_~y~0_3849)) .cse2)))) InVars {main_~y~0=v_main_~y~0_3849, main_#t~post5=|v_main_#t~post5_298|, main_~x~0=v_main_~x~0_3308, main_#t~post6=|v_main_#t~post6_298|} OutVars{main_~y~0=v_main_~y~0_3848, main_#t~post5=|v_main_#t~post5_297|, main_~x~0=v_main_~x~0_3307, main_#t~post6=|v_main_#t~post6_297|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {67321#(< 86 main_~y~0)} is VALID [2022-04-28 04:02:03,034 INFO L290 TraceCheckUtils]: 7: Hoare triple {67321#(< 86 main_~y~0)} [229] L18-1_primed-->L11-2: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {67321#(< 86 main_~y~0)} is VALID [2022-04-28 04:02:03,034 INFO L290 TraceCheckUtils]: 6: Hoare triple {67321#(< 86 main_~y~0)} [228] L11-2-->L18-1_primed: Formula: (let ((.cse0 (= v_main_~x~0_3306 v_main_~x~0_3305)) (.cse1 (= |v_main_#t~post4_272| |v_main_#t~post4_271|))) (or (and (not (< v_main_~x~0_3306 50000)) .cse0 .cse1) (and (< v_main_~x~0_3305 50001) (< v_main_~x~0_3306 v_main_~x~0_3305)) (and .cse0 .cse1))) InVars {main_~x~0=v_main_~x~0_3306, main_#t~post4=|v_main_#t~post4_272|} OutVars{main_~x~0=v_main_~x~0_3305, main_#t~post4=|v_main_#t~post4_271|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {67321#(< 86 main_~y~0)} is VALID [2022-04-28 04:02:03,035 INFO L290 TraceCheckUtils]: 5: Hoare triple {66913#true} ~x~0 := 0;~y~0 := 50000;~z~0 := 0;~x~0 := 0; {67321#(< 86 main_~y~0)} is VALID [2022-04-28 04:02:03,035 INFO L272 TraceCheckUtils]: 4: Hoare triple {66913#true} call #t~ret7 := main(); {66913#true} is VALID [2022-04-28 04:02:03,035 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {66913#true} {66913#true} #52#return; {66913#true} is VALID [2022-04-28 04:02:03,035 INFO L290 TraceCheckUtils]: 2: Hoare triple {66913#true} assume true; {66913#true} is VALID [2022-04-28 04:02:03,035 INFO L290 TraceCheckUtils]: 1: Hoare triple {66913#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); {66913#true} is VALID [2022-04-28 04:02:03,035 INFO L272 TraceCheckUtils]: 0: Hoare triple {66913#true} call ULTIMATE.init(); {66913#true} is VALID [2022-04-28 04:02:03,035 INFO L134 CoverageAnalysis]: Checked inductivity of 948 backedges. 0 proven. 946 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-04-28 04:02:03,035 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1354851378] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 04:02:03,036 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 04:02:03,036 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [47, 46, 46] total 91 [2022-04-28 04:02:07,074 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 04:02:07,075 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1451550292] [2022-04-28 04:02:07,075 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1451550292] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 04:02:07,075 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 04:02:07,075 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [126] imperfect sequences [] total 126 [2022-04-28 04:02:07,075 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2036521960] [2022-04-28 04:02:07,075 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 04:02:07,075 INFO L78 Accepts]: Start accepts. Automaton has has 126 states, 126 states have (on average 1.6428571428571428) internal successors, (207), 125 states have internal predecessors, (207), 2 states have call successors, (3), 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 211 [2022-04-28 04:02:07,076 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 04:02:07,076 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 126 states, 126 states have (on average 1.6428571428571428) internal successors, (207), 125 states have internal predecessors, (207), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 04:02:07,220 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 211 edges. 211 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 04:02:07,221 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 126 states [2022-04-28 04:02:07,221 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 04:02:07,222 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 126 interpolants. [2022-04-28 04:02:07,223 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11195, Invalid=17535, Unknown=0, NotChecked=0, Total=28730 [2022-04-28 04:02:07,224 INFO L87 Difference]: Start difference. First operand 212 states and 215 transitions. Second operand has 126 states, 126 states have (on average 1.6428571428571428) internal successors, (207), 125 states have internal predecessors, (207), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 04:02:30,801 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 04:02:30,801 INFO L93 Difference]: Finished difference Result 421 states and 432 transitions. [2022-04-28 04:02:30,801 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 126 states. [2022-04-28 04:02:30,801 INFO L78 Accepts]: Start accepts. Automaton has has 126 states, 126 states have (on average 1.6428571428571428) internal successors, (207), 125 states have internal predecessors, (207), 2 states have call successors, (3), 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 211 [2022-04-28 04:02:30,801 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 04:02:30,802 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 126 states, 126 states have (on average 1.6428571428571428) internal successors, (207), 125 states have internal predecessors, (207), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 04:02:30,803 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 126 states to 126 states and 233 transitions. [2022-04-28 04:02:30,803 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 126 states, 126 states have (on average 1.6428571428571428) internal successors, (207), 125 states have internal predecessors, (207), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 04:02:30,804 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 126 states to 126 states and 233 transitions. [2022-04-28 04:02:30,804 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 126 states and 233 transitions. [2022-04-28 04:02:30,981 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 233 edges. 233 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 04:02:30,983 INFO L225 Difference]: With dead ends: 421 [2022-04-28 04:02:30,983 INFO L226 Difference]: Without dead ends: 217 [2022-04-28 04:02:30,988 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 448 GetRequests, 155 SyntacticMatches, 2 SemanticMatches, 291 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25028 ImplicationChecksByTransitivity, 11.3s TimeCoverageRelationStatistics Valid=26099, Invalid=59457, Unknown=0, NotChecked=0, Total=85556 [2022-04-28 04:02:30,988 INFO L413 NwaCegarLoop]: 12 mSDtfsCounter, 408 mSDsluCounter, 32 mSDsCounter, 0 mSdLazyCounter, 12493 mSolverCounterSat, 297 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 9.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 408 SdHoareTripleChecker+Valid, 44 SdHoareTripleChecker+Invalid, 12790 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 297 IncrementalHoareTripleChecker+Valid, 12493 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 9.6s IncrementalHoareTripleChecker+Time [2022-04-28 04:02:30,988 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [408 Valid, 44 Invalid, 12790 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [297 Valid, 12493 Invalid, 0 Unknown, 0 Unchecked, 9.6s Time] [2022-04-28 04:02:30,989 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 217 states. [2022-04-28 04:02:31,323 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 217 to 217. [2022-04-28 04:02:31,323 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 04:02:31,323 INFO L82 GeneralOperation]: Start isEquivalent. First operand 217 states. Second operand has 217 states, 212 states have (on average 1.0188679245283019) internal successors, (216), 212 states have internal predecessors, (216), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 04:02:31,324 INFO L74 IsIncluded]: Start isIncluded. First operand 217 states. Second operand has 217 states, 212 states have (on average 1.0188679245283019) internal successors, (216), 212 states have internal predecessors, (216), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 04:02:31,324 INFO L87 Difference]: Start difference. First operand 217 states. Second operand has 217 states, 212 states have (on average 1.0188679245283019) internal successors, (216), 212 states have internal predecessors, (216), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 04:02:31,326 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 04:02:31,326 INFO L93 Difference]: Finished difference Result 217 states and 220 transitions. [2022-04-28 04:02:31,326 INFO L276 IsEmpty]: Start isEmpty. Operand 217 states and 220 transitions. [2022-04-28 04:02:31,326 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 04:02:31,326 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 04:02:31,326 INFO L74 IsIncluded]: Start isIncluded. First operand has 217 states, 212 states have (on average 1.0188679245283019) internal successors, (216), 212 states have internal predecessors, (216), 3 states have call successors, (3), 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 217 states. [2022-04-28 04:02:31,326 INFO L87 Difference]: Start difference. First operand has 217 states, 212 states have (on average 1.0188679245283019) internal successors, (216), 212 states have internal predecessors, (216), 3 states have call successors, (3), 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 217 states. [2022-04-28 04:02:31,328 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 04:02:31,328 INFO L93 Difference]: Finished difference Result 217 states and 220 transitions. [2022-04-28 04:02:31,328 INFO L276 IsEmpty]: Start isEmpty. Operand 217 states and 220 transitions. [2022-04-28 04:02:31,328 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 04:02:31,328 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 04:02:31,328 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 04:02:31,328 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 04:02:31,329 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 217 states, 212 states have (on average 1.0188679245283019) internal successors, (216), 212 states have internal predecessors, (216), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 04:02:31,331 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 217 states to 217 states and 220 transitions. [2022-04-28 04:02:31,331 INFO L78 Accepts]: Start accepts. Automaton has 217 states and 220 transitions. Word has length 211 [2022-04-28 04:02:31,331 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 04:02:31,331 INFO L495 AbstractCegarLoop]: Abstraction has 217 states and 220 transitions. [2022-04-28 04:02:31,331 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 126 states, 126 states have (on average 1.6428571428571428) internal successors, (207), 125 states have internal predecessors, (207), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 04:02:31,331 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 217 states and 220 transitions. [2022-04-28 04:02:31,501 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 220 edges. 220 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 04:02:31,501 INFO L276 IsEmpty]: Start isEmpty. Operand 217 states and 220 transitions. [2022-04-28 04:02:31,501 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 217 [2022-04-28 04:02:31,501 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 04:02:31,502 INFO L195 NwaCegarLoop]: trace histogram [80, 79, 44, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 04:02:31,518 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (44)] Forceful destruction successful, exit code 0 [2022-04-28 04:02:31,702 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 44 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable45 [2022-04-28 04:02:31,702 INFO L420 AbstractCegarLoop]: === Iteration 47 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 04:02:31,702 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 04:02:31,703 INFO L85 PathProgramCache]: Analyzing trace with hash 771812613, now seen corresponding path program 44 times [2022-04-28 04:02:31,703 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 04:02:31,703 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [809195901]