/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/loop-industry-pattern/nested-3.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-e106359-m [2022-04-15 06:26:26,094 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-04-15 06:26:26,097 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-04-15 06:26:26,123 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-04-15 06:26:26,124 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-04-15 06:26:26,125 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-04-15 06:26:26,125 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-04-15 06:26:26,126 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-04-15 06:26:26,127 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-04-15 06:26:26,128 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-04-15 06:26:26,128 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-04-15 06:26:26,129 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-04-15 06:26:26,129 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-04-15 06:26:26,130 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-04-15 06:26:26,131 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-04-15 06:26:26,131 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-04-15 06:26:26,132 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-04-15 06:26:26,132 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-04-15 06:26:26,133 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-04-15 06:26:26,134 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-04-15 06:26:26,138 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-04-15 06:26:26,141 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-04-15 06:26:26,143 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-04-15 06:26:26,145 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-04-15 06:26:26,147 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-04-15 06:26:26,151 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-04-15 06:26:26,152 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-04-15 06:26:26,152 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-04-15 06:26:26,152 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-04-15 06:26:26,152 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-04-15 06:26:26,153 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-04-15 06:26:26,153 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-04-15 06:26:26,154 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-04-15 06:26:26,154 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-04-15 06:26:26,154 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-04-15 06:26:26,155 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-04-15 06:26:26,155 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-04-15 06:26:26,155 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-04-15 06:26:26,156 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-04-15 06:26:26,156 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-04-15 06:26:26,156 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-04-15 06:26:26,172 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-04-15 06:26:26,172 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationJordan_32.epf [2022-04-15 06:26:26,178 INFO L113 SettingsManager]: Loading preferences was successful [2022-04-15 06:26:26,178 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-04-15 06:26:26,183 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-04-15 06:26:26,183 INFO L138 SettingsManager]: * sizeof long=4 [2022-04-15 06:26:26,183 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-04-15 06:26:26,183 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-04-15 06:26:26,184 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-04-15 06:26:26,184 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-04-15 06:26:26,184 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-04-15 06:26:26,184 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-04-15 06:26:26,184 INFO L138 SettingsManager]: * sizeof long double=12 [2022-04-15 06:26:26,184 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-04-15 06:26:26,184 INFO L138 SettingsManager]: * Use constant arrays=true [2022-04-15 06:26:26,184 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-04-15 06:26:26,184 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-04-15 06:26:26,184 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-04-15 06:26:26,184 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-04-15 06:26:26,185 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-04-15 06:26:26,185 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-15 06:26:26,185 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-04-15 06:26:26,185 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_NestedInterpolation [2022-04-15 06:26:26,185 INFO L138 SettingsManager]: * Trace refinement strategy=ACCELERATED_INTERPOLATION [2022-04-15 06:26:26,185 INFO L138 SettingsManager]: * Trace refinement strategy used in Accelerated Interpolation=CAMEL [2022-04-15 06:26:26,185 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-04-15 06:26:26,185 INFO L138 SettingsManager]: * Loop acceleration method that is used by accelerated interpolation=JORDAN [2022-04-15 06:26:26,185 INFO L138 SettingsManager]: * Use separate solver for trace checks=false WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.core: Log level for class -> de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=WARN; [2022-04-15 06:26:26,373 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-04-15 06:26:26,387 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-04-15 06:26:26,389 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-04-15 06:26:26,390 INFO L271 PluginConnector]: Initializing CDTParser... [2022-04-15 06:26:26,391 INFO L275 PluginConnector]: CDTParser initialized [2022-04-15 06:26:26,392 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/loop-industry-pattern/nested-3.c [2022-04-15 06:26:26,451 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/04d3ab8dd/ba91b7d6acc64a00b3791b52a4691ba7/FLAGb4adf4870 [2022-04-15 06:26:26,803 INFO L306 CDTParser]: Found 1 translation units. [2022-04-15 06:26:26,803 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loop-industry-pattern/nested-3.c [2022-04-15 06:26:26,814 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/04d3ab8dd/ba91b7d6acc64a00b3791b52a4691ba7/FLAGb4adf4870 [2022-04-15 06:26:26,822 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/04d3ab8dd/ba91b7d6acc64a00b3791b52a4691ba7 [2022-04-15 06:26:26,824 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-04-15 06:26:26,825 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2022-04-15 06:26:26,826 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-04-15 06:26:26,826 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-04-15 06:26:26,828 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-04-15 06:26:26,829 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.04 06:26:26" (1/1) ... [2022-04-15 06:26:26,830 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@69aa3a1c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 06:26:26, skipping insertion in model container [2022-04-15 06:26:26,830 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.04 06:26:26" (1/1) ... [2022-04-15 06:26:26,835 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-04-15 06:26:26,845 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-04-15 06:26:26,966 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loop-industry-pattern/nested-3.c[404,417] [2022-04-15 06:26:26,988 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-15 06:26:26,994 INFO L203 MainTranslator]: Completed pre-run [2022-04-15 06:26:27,002 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loop-industry-pattern/nested-3.c[404,417] [2022-04-15 06:26:27,005 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-15 06:26:27,015 INFO L208 MainTranslator]: Completed translation [2022-04-15 06:26:27,015 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 06:26:27 WrapperNode [2022-04-15 06:26:27,015 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-04-15 06:26:27,016 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-04-15 06:26:27,016 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-04-15 06:26:27,016 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-04-15 06:26:27,023 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 06:26:27" (1/1) ... [2022-04-15 06:26:27,023 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 06:26:27" (1/1) ... [2022-04-15 06:26:27,027 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 06:26:27" (1/1) ... [2022-04-15 06:26:27,027 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 06:26:27" (1/1) ... [2022-04-15 06:26:27,031 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 06:26:27" (1/1) ... [2022-04-15 06:26:27,033 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 06:26:27" (1/1) ... [2022-04-15 06:26:27,034 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 06:26:27" (1/1) ... [2022-04-15 06:26:27,035 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-04-15 06:26:27,036 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-04-15 06:26:27,036 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-04-15 06:26:27,036 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-04-15 06:26:27,037 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 06:26:27" (1/1) ... [2022-04-15 06:26:27,042 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-15 06:26:27,051 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 06:26:27,060 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-04-15 06:26:27,071 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-04-15 06:26:27,087 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-04-15 06:26:27,088 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-04-15 06:26:27,088 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-04-15 06:26:27,088 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-04-15 06:26:27,088 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-04-15 06:26:27,088 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-04-15 06:26:27,088 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-04-15 06:26:27,088 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-04-15 06:26:27,088 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-04-15 06:26:27,088 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2022-04-15 06:26:27,088 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-04-15 06:26:27,089 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-04-15 06:26:27,089 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-04-15 06:26:27,089 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-04-15 06:26:27,089 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-04-15 06:26:27,089 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-04-15 06:26:27,089 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-04-15 06:26:27,089 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-04-15 06:26:27,129 INFO L234 CfgBuilder]: Building ICFG [2022-04-15 06:26:27,130 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-04-15 06:26:27,273 INFO L275 CfgBuilder]: Performing block encoding [2022-04-15 06:26:27,277 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-04-15 06:26:27,277 INFO L299 CfgBuilder]: Removed 2 assume(true) statements. [2022-04-15 06:26:27,278 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.04 06:26:27 BoogieIcfgContainer [2022-04-15 06:26:27,279 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-04-15 06:26:27,280 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-04-15 06:26:27,280 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-04-15 06:26:27,305 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-04-15 06:26:27,305 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 15.04 06:26:26" (1/3) ... [2022-04-15 06:26:27,306 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@544c64c9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.04 06:26:27, skipping insertion in model container [2022-04-15 06:26:27,306 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 06:26:27" (2/3) ... [2022-04-15 06:26:27,306 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@544c64c9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.04 06:26:27, skipping insertion in model container [2022-04-15 06:26:27,306 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.04 06:26:27" (3/3) ... [2022-04-15 06:26:27,307 INFO L111 eAbstractionObserver]: Analyzing ICFG nested-3.c [2022-04-15 06:26:27,310 INFO L202 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2022-04-15 06:26:27,311 INFO L161 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-04-15 06:26:27,373 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-04-15 06:26:27,378 INFO L340 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=Craig_NestedInterpolation, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=FINITE_AUTOMATA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=All, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP [2022-04-15 06:26:27,378 INFO L341 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-04-15 06:26:27,403 INFO L276 IsEmpty]: Start isEmpty. Operand has 23 states, 15 states have (on average 1.6) internal successors, (24), 17 states have internal predecessors, (24), 3 states have call successors, (3), 3 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-15 06:26:27,408 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-04-15 06:26:27,409 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 06:26:27,409 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 06:26:27,409 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 06:26:27,413 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 06:26:27,413 INFO L85 PathProgramCache]: Analyzing trace with hash -1677248157, now seen corresponding path program 1 times [2022-04-15 06:26:27,423 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 06:26:27,424 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [413027816] [2022-04-15 06:26:27,431 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-15 06:26:27,432 INFO L85 PathProgramCache]: Analyzing trace with hash -1677248157, now seen corresponding path program 2 times [2022-04-15 06:26:27,434 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 06:26:27,434 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [558048745] [2022-04-15 06:26:27,434 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 06:26:27,435 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 06:26:27,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:26:27,631 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 06:26:27,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:26:27,662 INFO L290 TraceCheckUtils]: 0: Hoare triple {32#(and (= ~last~0 |old(~last~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(11, 2);call #Ultimate.allocInit(12, 3);~last~0 := 0; {26#true} is VALID [2022-04-15 06:26:27,662 INFO L290 TraceCheckUtils]: 1: Hoare triple {26#true} assume true; {26#true} is VALID [2022-04-15 06:26:27,662 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {26#true} {26#true} #66#return; {26#true} is VALID [2022-04-15 06:26:27,664 INFO L272 TraceCheckUtils]: 0: Hoare triple {26#true} call ULTIMATE.init(); {32#(and (= ~last~0 |old(~last~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 06:26:27,664 INFO L290 TraceCheckUtils]: 1: Hoare triple {32#(and (= ~last~0 |old(~last~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(11, 2);call #Ultimate.allocInit(12, 3);~last~0 := 0; {26#true} is VALID [2022-04-15 06:26:27,664 INFO L290 TraceCheckUtils]: 2: Hoare triple {26#true} assume true; {26#true} is VALID [2022-04-15 06:26:27,664 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {26#true} {26#true} #66#return; {26#true} is VALID [2022-04-15 06:26:27,665 INFO L272 TraceCheckUtils]: 4: Hoare triple {26#true} call #t~ret6 := main(); {26#true} is VALID [2022-04-15 06:26:27,665 INFO L290 TraceCheckUtils]: 5: Hoare triple {26#true} assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~last~0 := #t~nondet4;havoc #t~nondet4;~a~0 := 0;~b~0 := 0;~c~0 := 0;~st~0 := 0; {26#true} is VALID [2022-04-15 06:26:27,665 INFO L290 TraceCheckUtils]: 6: Hoare triple {26#true} assume !false;~st~0 := 1;~c~0 := 0; {31#(= main_~c~0 0)} is VALID [2022-04-15 06:26:27,666 INFO L290 TraceCheckUtils]: 7: Hoare triple {31#(= main_~c~0 0)} assume !(~c~0 < 200000); {27#false} is VALID [2022-04-15 06:26:27,666 INFO L290 TraceCheckUtils]: 8: Hoare triple {27#false} assume 0 == ~st~0 && ~c~0 == 1 + ~last~0;~a~0 := 3 + ~a~0;~b~0 := 3 + ~b~0; {27#false} is VALID [2022-04-15 06:26:27,666 INFO L290 TraceCheckUtils]: 9: Hoare triple {27#false} assume ~c~0 == ~last~0 && 0 == ~st~0;~a~0 := 1 + ~a~0; {27#false} is VALID [2022-04-15 06:26:27,667 INFO L272 TraceCheckUtils]: 10: Hoare triple {27#false} call __VERIFIER_assert((if ~a~0 == ~b~0 && 200000 == ~c~0 then 1 else 0)); {27#false} is VALID [2022-04-15 06:26:27,667 INFO L290 TraceCheckUtils]: 11: Hoare triple {27#false} ~cond := #in~cond; {27#false} is VALID [2022-04-15 06:26:27,667 INFO L290 TraceCheckUtils]: 12: Hoare triple {27#false} assume 0 == ~cond; {27#false} is VALID [2022-04-15 06:26:27,667 INFO L290 TraceCheckUtils]: 13: Hoare triple {27#false} assume !false; {27#false} is VALID [2022-04-15 06:26:27,667 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 06:26:27,668 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 06:26:27,668 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [558048745] [2022-04-15 06:26:27,668 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [558048745] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 06:26:27,669 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 06:26:27,669 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 06:26:27,672 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 06:26:27,672 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [413027816] [2022-04-15 06:26:27,672 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [413027816] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 06:26:27,672 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 06:26:27,672 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 06:26:27,673 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2053334781] [2022-04-15 06:26:27,673 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 06:26:27,676 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.5) internal successors, (10), 3 states have internal predecessors, (10), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 14 [2022-04-15 06:26:27,678 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 06:26:27,680 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 2.5) internal successors, (10), 3 states have internal predecessors, (10), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:26:27,705 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 14 edges. 14 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 06:26:27,706 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-15 06:26:27,706 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 06:26:27,725 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-15 06:26:27,725 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-15 06:26:27,727 INFO L87 Difference]: Start difference. First operand has 23 states, 15 states have (on average 1.6) internal successors, (24), 17 states have internal predecessors, (24), 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 4 states, 4 states have (on average 2.5) internal successors, (10), 3 states have internal predecessors, (10), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:26:27,844 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:26:27,844 INFO L93 Difference]: Finished difference Result 40 states and 61 transitions. [2022-04-15 06:26:27,844 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-15 06:26:27,844 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.5) internal successors, (10), 3 states have internal predecessors, (10), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 14 [2022-04-15 06:26:27,844 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 06:26:27,845 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 2.5) internal successors, (10), 3 states have internal predecessors, (10), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:26:27,854 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 61 transitions. [2022-04-15 06:26:27,855 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 2.5) internal successors, (10), 3 states have internal predecessors, (10), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:26:27,857 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 61 transitions. [2022-04-15 06:26:27,857 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 61 transitions. [2022-04-15 06:26:27,917 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 61 edges. 61 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 06:26:27,923 INFO L225 Difference]: With dead ends: 40 [2022-04-15 06:26:27,923 INFO L226 Difference]: Without dead ends: 23 [2022-04-15 06:26:27,925 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-15 06:26:27,927 INFO L913 BasicCegarLoop]: 19 mSDtfsCounter, 8 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 33 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 26 SdHoareTripleChecker+Invalid, 36 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 33 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-15 06:26:27,928 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [8 Valid, 26 Invalid, 36 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 33 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-15 06:26:27,937 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2022-04-15 06:26:27,946 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 20. [2022-04-15 06:26:27,946 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 06:26:27,946 INFO L82 GeneralOperation]: Start isEquivalent. First operand 23 states. Second operand has 20 states, 14 states have (on average 1.3571428571428572) internal successors, (19), 15 states have internal predecessors, (19), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-15 06:26:27,947 INFO L74 IsIncluded]: Start isIncluded. First operand 23 states. Second operand has 20 states, 14 states have (on average 1.3571428571428572) internal successors, (19), 15 states have internal predecessors, (19), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-15 06:26:27,947 INFO L87 Difference]: Start difference. First operand 23 states. Second operand has 20 states, 14 states have (on average 1.3571428571428572) internal successors, (19), 15 states have internal predecessors, (19), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-15 06:26:27,949 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:26:27,949 INFO L93 Difference]: Finished difference Result 23 states and 28 transitions. [2022-04-15 06:26:27,949 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 28 transitions. [2022-04-15 06:26:27,949 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 06:26:27,950 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 06:26:27,950 INFO L74 IsIncluded]: Start isIncluded. First operand has 20 states, 14 states have (on average 1.3571428571428572) internal successors, (19), 15 states have internal predecessors, (19), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand 23 states. [2022-04-15 06:26:27,950 INFO L87 Difference]: Start difference. First operand has 20 states, 14 states have (on average 1.3571428571428572) internal successors, (19), 15 states have internal predecessors, (19), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand 23 states. [2022-04-15 06:26:27,952 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:26:27,952 INFO L93 Difference]: Finished difference Result 23 states and 28 transitions. [2022-04-15 06:26:27,952 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 28 transitions. [2022-04-15 06:26:27,952 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 06:26:27,952 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 06:26:27,952 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 06:26:27,953 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 06:26:27,953 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20 states, 14 states have (on average 1.3571428571428572) internal successors, (19), 15 states have internal predecessors, (19), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-15 06:26:27,954 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 24 transitions. [2022-04-15 06:26:27,955 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 24 transitions. Word has length 14 [2022-04-15 06:26:27,955 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 06:26:27,955 INFO L478 AbstractCegarLoop]: Abstraction has 20 states and 24 transitions. [2022-04-15 06:26:27,955 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.5) internal successors, (10), 3 states have internal predecessors, (10), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:26:27,955 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 20 states and 24 transitions. [2022-04-15 06:26:27,973 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-15 06:26:27,974 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 24 transitions. [2022-04-15 06:26:27,974 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-04-15 06:26:27,974 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 06:26:27,974 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 06:26:27,975 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-04-15 06:26:27,975 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 06:26:27,975 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 06:26:27,975 INFO L85 PathProgramCache]: Analyzing trace with hash -946078686, now seen corresponding path program 1 times [2022-04-15 06:26:27,976 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 06:26:27,976 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1914146126] [2022-04-15 06:26:28,373 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {0={1=1}, 1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-15 06:26:28,375 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-15 06:26:28,378 INFO L85 PathProgramCache]: Analyzing trace with hash 2908935, now seen corresponding path program 1 times [2022-04-15 06:26:28,378 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 06:26:28,378 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [414291250] [2022-04-15 06:26:28,378 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 06:26:28,378 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 06:26:28,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:26:28,415 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 06:26:28,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:26:28,421 INFO L290 TraceCheckUtils]: 0: Hoare triple {207#(and (= ~last~0 |old(~last~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(11, 2);call #Ultimate.allocInit(12, 3);~last~0 := 0; {201#true} is VALID [2022-04-15 06:26:28,421 INFO L290 TraceCheckUtils]: 1: Hoare triple {201#true} assume true; {201#true} is VALID [2022-04-15 06:26:28,421 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {201#true} {201#true} #66#return; {201#true} is VALID [2022-04-15 06:26:28,422 INFO L272 TraceCheckUtils]: 0: Hoare triple {201#true} call ULTIMATE.init(); {207#(and (= ~last~0 |old(~last~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 06:26:28,422 INFO L290 TraceCheckUtils]: 1: Hoare triple {207#(and (= ~last~0 |old(~last~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(11, 2);call #Ultimate.allocInit(12, 3);~last~0 := 0; {201#true} is VALID [2022-04-15 06:26:28,422 INFO L290 TraceCheckUtils]: 2: Hoare triple {201#true} assume true; {201#true} is VALID [2022-04-15 06:26:28,422 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {201#true} {201#true} #66#return; {201#true} is VALID [2022-04-15 06:26:28,422 INFO L272 TraceCheckUtils]: 4: Hoare triple {201#true} call #t~ret6 := main(); {201#true} is VALID [2022-04-15 06:26:28,422 INFO L290 TraceCheckUtils]: 5: Hoare triple {201#true} assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~last~0 := #t~nondet4;havoc #t~nondet4;~a~0 := 0;~b~0 := 0;~c~0 := 0;~st~0 := 0; {201#true} is VALID [2022-04-15 06:26:28,423 INFO L290 TraceCheckUtils]: 6: Hoare triple {201#true} assume !false;~st~0 := 1;~c~0 := 0; {201#true} is VALID [2022-04-15 06:26:28,423 INFO L290 TraceCheckUtils]: 7: Hoare triple {201#true} [70] L23-3-->L23-4_primed: Formula: (let ((.cse0 (< v_main_~c~0_16 200000)) (.cse1 (= v_~last~0_13 v_main_~c~0_16)) (.cse2 (= v_main_~st~0_9 v_main_~st~0_8)) (.cse3 (= |v_main_#t~post5_4| |v_main_#t~post5_3|))) (or (and .cse0 (= v_main_~st~0_8 0) .cse1 (< v_main_~c~0_16 v_main_~c~0_15) (<= v_main_~c~0_15 (+ v_~last~0_13 1))) (and .cse2 (= v_main_~c~0_15 v_main_~c~0_16) (or (not .cse0) (not .cse1)) .cse3) (and .cse2 (= v_main_~c~0_16 v_main_~c~0_15) .cse3 (= v_~last~0_13 v_~last~0_13)))) InVars {main_~c~0=v_main_~c~0_16, main_#t~post5=|v_main_#t~post5_4|, main_~st~0=v_main_~st~0_9, ~last~0=v_~last~0_13} OutVars{main_#t~post5=|v_main_#t~post5_3|, main_~c~0=v_main_~c~0_15, main_~st~0=v_main_~st~0_8, ~last~0=v_~last~0_13} AuxVars[] AssignedVars[main_#t~post5, main_~c~0, main_~st~0] {201#true} is VALID [2022-04-15 06:26:28,423 INFO L290 TraceCheckUtils]: 8: Hoare triple {201#true} [69] L23-4_primed-->L23-4: Formula: (not (< v_main_~c~0_8 200000)) InVars {main_~c~0=v_main_~c~0_8} OutVars{main_~c~0=v_main_~c~0_8} AuxVars[] AssignedVars[] {201#true} is VALID [2022-04-15 06:26:28,424 INFO L290 TraceCheckUtils]: 9: Hoare triple {201#true} assume 0 == ~st~0 && ~c~0 == 1 + ~last~0;~a~0 := 3 + ~a~0;~b~0 := 3 + ~b~0; {206#(<= (+ ~last~0 1) main_~c~0)} is VALID [2022-04-15 06:26:28,425 INFO L290 TraceCheckUtils]: 10: Hoare triple {206#(<= (+ ~last~0 1) main_~c~0)} assume ~c~0 == ~last~0 && 0 == ~st~0;~a~0 := 1 + ~a~0; {202#false} is VALID [2022-04-15 06:26:28,425 INFO L272 TraceCheckUtils]: 11: Hoare triple {202#false} call __VERIFIER_assert((if ~a~0 == ~b~0 && 200000 == ~c~0 then 1 else 0)); {202#false} is VALID [2022-04-15 06:26:28,425 INFO L290 TraceCheckUtils]: 12: Hoare triple {202#false} ~cond := #in~cond; {202#false} is VALID [2022-04-15 06:26:28,425 INFO L290 TraceCheckUtils]: 13: Hoare triple {202#false} assume 0 == ~cond; {202#false} is VALID [2022-04-15 06:26:28,425 INFO L290 TraceCheckUtils]: 14: Hoare triple {202#false} assume !false; {202#false} is VALID [2022-04-15 06:26:28,425 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 06:26:28,425 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 06:26:28,425 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [414291250] [2022-04-15 06:26:28,426 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [414291250] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 06:26:28,426 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 06:26:28,426 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 06:26:28,461 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 06:26:28,462 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1914146126] [2022-04-15 06:26:28,462 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1914146126] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 06:26:28,462 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 06:26:28,462 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-04-15 06:26:28,462 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1504485228] [2022-04-15 06:26:28,462 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 06:26:28,463 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 1.8571428571428572) internal successors, (13), 6 states have internal predecessors, (13), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 17 [2022-04-15 06:26:28,463 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 06:26:28,463 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 7 states, 7 states have (on average 1.8571428571428572) internal successors, (13), 6 states have internal predecessors, (13), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:26:28,476 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 17 edges. 17 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 06:26:28,476 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-04-15 06:26:28,476 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 06:26:28,477 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-04-15 06:26:28,477 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-04-15 06:26:28,477 INFO L87 Difference]: Start difference. First operand 20 states and 24 transitions. Second operand has 7 states, 7 states have (on average 1.8571428571428572) internal successors, (13), 6 states have internal predecessors, (13), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:26:28,717 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:26:28,717 INFO L93 Difference]: Finished difference Result 50 states and 68 transitions. [2022-04-15 06:26:28,717 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-04-15 06:26:28,717 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 1.8571428571428572) internal successors, (13), 6 states have internal predecessors, (13), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 17 [2022-04-15 06:26:28,718 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 06:26:28,718 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 1.8571428571428572) internal successors, (13), 6 states have internal predecessors, (13), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:26:28,720 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 67 transitions. [2022-04-15 06:26:28,720 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 1.8571428571428572) internal successors, (13), 6 states have internal predecessors, (13), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:26:28,722 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 67 transitions. [2022-04-15 06:26:28,722 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 9 states and 67 transitions. [2022-04-15 06:26:28,768 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 67 edges. 67 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 06:26:28,771 INFO L225 Difference]: With dead ends: 50 [2022-04-15 06:26:28,771 INFO L226 Difference]: Without dead ends: 36 [2022-04-15 06:26:28,772 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2022-04-15 06:26:28,774 INFO L913 BasicCegarLoop]: 17 mSDtfsCounter, 17 mSDsluCounter, 15 mSDsCounter, 0 mSdLazyCounter, 103 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 32 SdHoareTripleChecker+Invalid, 118 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 103 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-15 06:26:28,774 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [19 Valid, 32 Invalid, 118 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 103 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-15 06:26:28,776 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2022-04-15 06:26:28,789 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 28. [2022-04-15 06:26:28,789 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 06:26:28,789 INFO L82 GeneralOperation]: Start isEquivalent. First operand 36 states. Second operand has 28 states, 22 states have (on average 1.3636363636363635) internal successors, (30), 23 states have internal predecessors, (30), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-15 06:26:28,790 INFO L74 IsIncluded]: Start isIncluded. First operand 36 states. Second operand has 28 states, 22 states have (on average 1.3636363636363635) internal successors, (30), 23 states have internal predecessors, (30), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-15 06:26:28,790 INFO L87 Difference]: Start difference. First operand 36 states. Second operand has 28 states, 22 states have (on average 1.3636363636363635) internal successors, (30), 23 states have internal predecessors, (30), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-15 06:26:28,794 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:26:28,794 INFO L93 Difference]: Finished difference Result 36 states and 45 transitions. [2022-04-15 06:26:28,794 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 45 transitions. [2022-04-15 06:26:28,795 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 06:26:28,795 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 06:26:28,795 INFO L74 IsIncluded]: Start isIncluded. First operand has 28 states, 22 states have (on average 1.3636363636363635) internal successors, (30), 23 states have internal predecessors, (30), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand 36 states. [2022-04-15 06:26:28,795 INFO L87 Difference]: Start difference. First operand has 28 states, 22 states have (on average 1.3636363636363635) internal successors, (30), 23 states have internal predecessors, (30), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand 36 states. [2022-04-15 06:26:28,797 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:26:28,797 INFO L93 Difference]: Finished difference Result 36 states and 45 transitions. [2022-04-15 06:26:28,797 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 45 transitions. [2022-04-15 06:26:28,797 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 06:26:28,798 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 06:26:28,798 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 06:26:28,798 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 06:26:28,798 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28 states, 22 states have (on average 1.3636363636363635) internal successors, (30), 23 states have internal predecessors, (30), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-15 06:26:28,799 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 35 transitions. [2022-04-15 06:26:28,799 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 35 transitions. Word has length 17 [2022-04-15 06:26:28,799 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 06:26:28,799 INFO L478 AbstractCegarLoop]: Abstraction has 28 states and 35 transitions. [2022-04-15 06:26:28,799 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 1.8571428571428572) internal successors, (13), 6 states have internal predecessors, (13), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:26:28,800 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 28 states and 35 transitions. [2022-04-15 06:26:28,855 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 35 edges. 35 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 06:26:28,855 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 35 transitions. [2022-04-15 06:26:28,856 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-04-15 06:26:28,856 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 06:26:28,856 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 06:26:28,856 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-04-15 06:26:28,856 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 06:26:28,856 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 06:26:28,857 INFO L85 PathProgramCache]: Analyzing trace with hash -944231644, now seen corresponding path program 1 times [2022-04-15 06:26:28,857 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 06:26:28,857 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1330580873] [2022-04-15 06:26:29,135 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {0={1=1}, 1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-15 06:26:29,137 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-15 06:26:29,138 INFO L85 PathProgramCache]: Analyzing trace with hash 970416713, now seen corresponding path program 1 times [2022-04-15 06:26:29,138 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 06:26:29,138 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2062994951] [2022-04-15 06:26:29,139 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 06:26:29,139 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 06:26:29,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:26:29,200 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 06:26:29,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:26:29,206 INFO L290 TraceCheckUtils]: 0: Hoare triple {453#(and (= ~last~0 |old(~last~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(11, 2);call #Ultimate.allocInit(12, 3);~last~0 := 0; {445#true} is VALID [2022-04-15 06:26:29,206 INFO L290 TraceCheckUtils]: 1: Hoare triple {445#true} assume true; {445#true} is VALID [2022-04-15 06:26:29,206 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {445#true} {445#true} #66#return; {445#true} is VALID [2022-04-15 06:26:29,207 INFO L272 TraceCheckUtils]: 0: Hoare triple {445#true} call ULTIMATE.init(); {453#(and (= ~last~0 |old(~last~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 06:26:29,207 INFO L290 TraceCheckUtils]: 1: Hoare triple {453#(and (= ~last~0 |old(~last~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(11, 2);call #Ultimate.allocInit(12, 3);~last~0 := 0; {445#true} is VALID [2022-04-15 06:26:29,207 INFO L290 TraceCheckUtils]: 2: Hoare triple {445#true} assume true; {445#true} is VALID [2022-04-15 06:26:29,207 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {445#true} {445#true} #66#return; {445#true} is VALID [2022-04-15 06:26:29,208 INFO L272 TraceCheckUtils]: 4: Hoare triple {445#true} call #t~ret6 := main(); {445#true} is VALID [2022-04-15 06:26:29,208 INFO L290 TraceCheckUtils]: 5: Hoare triple {445#true} assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~last~0 := #t~nondet4;havoc #t~nondet4;~a~0 := 0;~b~0 := 0;~c~0 := 0;~st~0 := 0; {445#true} is VALID [2022-04-15 06:26:29,208 INFO L290 TraceCheckUtils]: 6: Hoare triple {445#true} assume !false;~st~0 := 1;~c~0 := 0; {450#(= main_~c~0 0)} is VALID [2022-04-15 06:26:29,209 INFO L290 TraceCheckUtils]: 7: Hoare triple {450#(= main_~c~0 0)} [72] L23-3-->L23-4_primed: Formula: (let ((.cse0 (= v_~last~0_15 v_main_~c~0_23)) (.cse1 (< v_main_~c~0_23 200000)) (.cse2 (= v_main_~st~0_14 v_main_~st~0_13)) (.cse3 (= v_main_~c~0_23 v_main_~c~0_22)) (.cse4 (= |v_main_#t~post5_9| |v_main_#t~post5_8|))) (or (and (= 0 v_main_~st~0_13) .cse0 (< v_main_~c~0_23 v_main_~c~0_22) .cse1 (<= v_main_~c~0_22 (+ v_~last~0_15 1))) (and .cse2 (or (not .cse0) (not .cse1)) .cse3 .cse4) (and .cse2 .cse3 .cse4 (= v_~last~0_15 v_~last~0_15)))) InVars {main_~c~0=v_main_~c~0_23, main_#t~post5=|v_main_#t~post5_9|, main_~st~0=v_main_~st~0_14, ~last~0=v_~last~0_15} OutVars{main_#t~post5=|v_main_#t~post5_8|, main_~c~0=v_main_~c~0_22, main_~st~0=v_main_~st~0_13, ~last~0=v_~last~0_15} AuxVars[] AssignedVars[main_#t~post5, main_~c~0, main_~st~0] {451#(or (<= ~last~0 0) (<= main_~c~0 0))} is VALID [2022-04-15 06:26:29,209 INFO L290 TraceCheckUtils]: 8: Hoare triple {451#(or (<= ~last~0 0) (<= main_~c~0 0))} [71] L23-4_primed-->L23-4: Formula: (not (< v_main_~c~0_8 200000)) InVars {main_~c~0=v_main_~c~0_8} OutVars{main_~c~0=v_main_~c~0_8} AuxVars[] AssignedVars[] {452#(<= (+ ~last~0 200000) main_~c~0)} is VALID [2022-04-15 06:26:29,210 INFO L290 TraceCheckUtils]: 9: Hoare triple {452#(<= (+ ~last~0 200000) main_~c~0)} assume 0 == ~st~0 && ~c~0 == 1 + ~last~0;~a~0 := 3 + ~a~0;~b~0 := 3 + ~b~0; {446#false} is VALID [2022-04-15 06:26:29,210 INFO L290 TraceCheckUtils]: 10: Hoare triple {446#false} assume !(~c~0 == ~last~0 && 0 == ~st~0); {446#false} is VALID [2022-04-15 06:26:29,210 INFO L272 TraceCheckUtils]: 11: Hoare triple {446#false} call __VERIFIER_assert((if ~a~0 == ~b~0 && 200000 == ~c~0 then 1 else 0)); {446#false} is VALID [2022-04-15 06:26:29,210 INFO L290 TraceCheckUtils]: 12: Hoare triple {446#false} ~cond := #in~cond; {446#false} is VALID [2022-04-15 06:26:29,211 INFO L290 TraceCheckUtils]: 13: Hoare triple {446#false} assume 0 == ~cond; {446#false} is VALID [2022-04-15 06:26:29,211 INFO L290 TraceCheckUtils]: 14: Hoare triple {446#false} assume !false; {446#false} is VALID [2022-04-15 06:26:29,211 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 06:26:29,211 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 06:26:29,211 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2062994951] [2022-04-15 06:26:29,211 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2062994951] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 06:26:29,211 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 06:26:29,211 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-15 06:26:29,275 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 06:26:29,275 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1330580873] [2022-04-15 06:26:29,276 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1330580873] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 06:26:29,276 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 06:26:29,276 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-04-15 06:26:29,276 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1029468245] [2022-04-15 06:26:29,276 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 06:26:29,276 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 1.8571428571428572) internal successors, (13), 6 states have internal predecessors, (13), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 17 [2022-04-15 06:26:29,277 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 06:26:29,277 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 7 states, 7 states have (on average 1.8571428571428572) internal successors, (13), 6 states have internal predecessors, (13), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:26:29,288 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 17 edges. 17 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 06:26:29,288 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-04-15 06:26:29,288 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 06:26:29,288 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-04-15 06:26:29,288 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2022-04-15 06:26:29,289 INFO L87 Difference]: Start difference. First operand 28 states and 35 transitions. Second operand has 7 states, 7 states have (on average 1.8571428571428572) internal successors, (13), 6 states have internal predecessors, (13), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:26:29,485 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:26:29,486 INFO L93 Difference]: Finished difference Result 57 states and 73 transitions. [2022-04-15 06:26:29,486 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-04-15 06:26:29,486 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 1.8571428571428572) internal successors, (13), 6 states have internal predecessors, (13), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 17 [2022-04-15 06:26:29,486 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 06:26:29,486 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 1.8571428571428572) internal successors, (13), 6 states have internal predecessors, (13), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:26:29,488 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 50 transitions. [2022-04-15 06:26:29,488 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 1.8571428571428572) internal successors, (13), 6 states have internal predecessors, (13), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:26:29,489 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 50 transitions. [2022-04-15 06:26:29,489 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 6 states and 50 transitions. [2022-04-15 06:26:29,528 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-15 06:26:29,529 INFO L225 Difference]: With dead ends: 57 [2022-04-15 06:26:29,529 INFO L226 Difference]: Without dead ends: 35 [2022-04-15 06:26:29,529 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 8 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2022-04-15 06:26:29,530 INFO L913 BasicCegarLoop]: 19 mSDtfsCounter, 8 mSDsluCounter, 18 mSDsCounter, 0 mSdLazyCounter, 105 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 37 SdHoareTripleChecker+Invalid, 111 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 105 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-15 06:26:29,530 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [8 Valid, 37 Invalid, 111 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 105 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-15 06:26:29,531 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2022-04-15 06:26:29,545 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 31. [2022-04-15 06:26:29,546 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 06:26:29,546 INFO L82 GeneralOperation]: Start isEquivalent. First operand 35 states. Second operand has 31 states, 25 states have (on average 1.36) internal successors, (34), 26 states have internal predecessors, (34), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-15 06:26:29,546 INFO L74 IsIncluded]: Start isIncluded. First operand 35 states. Second operand has 31 states, 25 states have (on average 1.36) internal successors, (34), 26 states have internal predecessors, (34), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-15 06:26:29,547 INFO L87 Difference]: Start difference. First operand 35 states. Second operand has 31 states, 25 states have (on average 1.36) internal successors, (34), 26 states have internal predecessors, (34), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-15 06:26:29,556 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:26:29,557 INFO L93 Difference]: Finished difference Result 35 states and 43 transitions. [2022-04-15 06:26:29,557 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 43 transitions. [2022-04-15 06:26:29,557 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 06:26:29,557 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 06:26:29,558 INFO L74 IsIncluded]: Start isIncluded. First operand has 31 states, 25 states have (on average 1.36) internal successors, (34), 26 states have internal predecessors, (34), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand 35 states. [2022-04-15 06:26:29,558 INFO L87 Difference]: Start difference. First operand has 31 states, 25 states have (on average 1.36) internal successors, (34), 26 states have internal predecessors, (34), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand 35 states. [2022-04-15 06:26:29,565 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:26:29,566 INFO L93 Difference]: Finished difference Result 35 states and 43 transitions. [2022-04-15 06:26:29,566 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 43 transitions. [2022-04-15 06:26:29,568 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 06:26:29,568 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 06:26:29,569 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 06:26:29,569 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 06:26:29,569 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31 states, 25 states have (on average 1.36) internal successors, (34), 26 states have internal predecessors, (34), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-15 06:26:29,570 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 39 transitions. [2022-04-15 06:26:29,570 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 39 transitions. Word has length 17 [2022-04-15 06:26:29,570 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 06:26:29,570 INFO L478 AbstractCegarLoop]: Abstraction has 31 states and 39 transitions. [2022-04-15 06:26:29,570 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 1.8571428571428572) internal successors, (13), 6 states have internal predecessors, (13), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:26:29,570 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 31 states and 39 transitions. [2022-04-15 06:26:29,611 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 39 edges. 39 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 06:26:29,611 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 39 transitions. [2022-04-15 06:26:29,612 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-04-15 06:26:29,612 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 06:26:29,612 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 06:26:29,612 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-04-15 06:26:29,614 INFO L403 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 06:26:29,614 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 06:26:29,614 INFO L85 PathProgramCache]: Analyzing trace with hash -264173274, now seen corresponding path program 1 times [2022-04-15 06:26:29,614 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 06:26:29,617 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [725993905] [2022-04-15 06:26:33,744 WARN L977 rdanLoopAcceleration]: Unable to prove correctness of quantifier elimination. [2022-04-15 06:26:33,870 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 1 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-15 06:26:33,872 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-15 06:26:33,874 INFO L85 PathProgramCache]: Analyzing trace with hash 1936077449, now seen corresponding path program 1 times [2022-04-15 06:26:33,874 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 06:26:33,874 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [278305051] [2022-04-15 06:26:33,874 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 06:26:33,874 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 06:26:33,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:26:33,902 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 06:26:33,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:26:33,907 INFO L290 TraceCheckUtils]: 0: Hoare triple {711#(and (= ~last~0 |old(~last~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(11, 2);call #Ultimate.allocInit(12, 3);~last~0 := 0; {705#true} is VALID [2022-04-15 06:26:33,907 INFO L290 TraceCheckUtils]: 1: Hoare triple {705#true} assume true; {705#true} is VALID [2022-04-15 06:26:33,907 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {705#true} {705#true} #66#return; {705#true} is VALID [2022-04-15 06:26:33,908 INFO L272 TraceCheckUtils]: 0: Hoare triple {705#true} call ULTIMATE.init(); {711#(and (= ~last~0 |old(~last~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 06:26:33,908 INFO L290 TraceCheckUtils]: 1: Hoare triple {711#(and (= ~last~0 |old(~last~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(11, 2);call #Ultimate.allocInit(12, 3);~last~0 := 0; {705#true} is VALID [2022-04-15 06:26:33,908 INFO L290 TraceCheckUtils]: 2: Hoare triple {705#true} assume true; {705#true} is VALID [2022-04-15 06:26:33,908 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {705#true} {705#true} #66#return; {705#true} is VALID [2022-04-15 06:26:33,908 INFO L272 TraceCheckUtils]: 4: Hoare triple {705#true} call #t~ret6 := main(); {705#true} is VALID [2022-04-15 06:26:33,908 INFO L290 TraceCheckUtils]: 5: Hoare triple {705#true} assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~last~0 := #t~nondet4;havoc #t~nondet4;~a~0 := 0;~b~0 := 0;~c~0 := 0;~st~0 := 0; {705#true} is VALID [2022-04-15 06:26:33,909 INFO L290 TraceCheckUtils]: 6: Hoare triple {705#true} assume !false;~st~0 := 1;~c~0 := 0; {710#(= main_~st~0 1)} is VALID [2022-04-15 06:26:33,909 INFO L290 TraceCheckUtils]: 7: Hoare triple {710#(= main_~st~0 1)} [74] L23-3-->L23-4_primed: Formula: (let ((.cse1 (= |v_main_#t~post5_14| |v_main_#t~post5_13|)) (.cse0 (= v_~last~0_17 v_main_~c~0_30))) (or (and (or .cse0 (not (< v_main_~c~0_30 200000))) (= v_main_~c~0_29 v_main_~c~0_30) .cse1) (and (= v_main_~c~0_30 v_main_~c~0_29) (= v_~last~0_17 v_~last~0_17) .cse1) (and (< v_main_~c~0_29 200001) (< v_main_~c~0_30 v_main_~c~0_29) (or (not (<= (+ v_~last~0_17 1) v_main_~c~0_29)) (not (<= (+ 1 v_main_~c~0_30) v_~last~0_17))) (not .cse0)))) InVars {main_~c~0=v_main_~c~0_30, main_#t~post5=|v_main_#t~post5_14|, ~last~0=v_~last~0_17} OutVars{main_#t~post5=|v_main_#t~post5_13|, main_~c~0=v_main_~c~0_29, ~last~0=v_~last~0_17} AuxVars[] AssignedVars[main_#t~post5, main_~c~0] {710#(= main_~st~0 1)} is VALID [2022-04-15 06:26:33,909 INFO L290 TraceCheckUtils]: 8: Hoare triple {710#(= main_~st~0 1)} [73] L23-4_primed-->L23-4: Formula: (not (< v_main_~c~0_8 200000)) InVars {main_~c~0=v_main_~c~0_8} OutVars{main_~c~0=v_main_~c~0_8} AuxVars[] AssignedVars[] {710#(= main_~st~0 1)} is VALID [2022-04-15 06:26:33,910 INFO L290 TraceCheckUtils]: 9: Hoare triple {710#(= main_~st~0 1)} assume 0 == ~st~0 && ~c~0 == 1 + ~last~0;~a~0 := 3 + ~a~0;~b~0 := 3 + ~b~0; {706#false} is VALID [2022-04-15 06:26:33,910 INFO L290 TraceCheckUtils]: 10: Hoare triple {706#false} assume !(~c~0 == ~last~0 && 0 == ~st~0); {706#false} is VALID [2022-04-15 06:26:33,910 INFO L272 TraceCheckUtils]: 11: Hoare triple {706#false} call __VERIFIER_assert((if ~a~0 == ~b~0 && 200000 == ~c~0 then 1 else 0)); {706#false} is VALID [2022-04-15 06:26:33,910 INFO L290 TraceCheckUtils]: 12: Hoare triple {706#false} ~cond := #in~cond; {706#false} is VALID [2022-04-15 06:26:33,910 INFO L290 TraceCheckUtils]: 13: Hoare triple {706#false} assume 0 == ~cond; {706#false} is VALID [2022-04-15 06:26:33,910 INFO L290 TraceCheckUtils]: 14: Hoare triple {706#false} assume !false; {706#false} is VALID [2022-04-15 06:26:33,910 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 06:26:33,911 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 06:26:33,911 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [278305051] [2022-04-15 06:26:33,911 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [278305051] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 06:26:33,911 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 06:26:33,911 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 06:26:33,952 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 06:26:33,953 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [725993905] [2022-04-15 06:26:33,953 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [725993905] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 06:26:33,953 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 06:26:33,953 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-04-15 06:26:33,953 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1119482946] [2022-04-15 06:26:33,953 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 06:26:33,953 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 1.8571428571428572) internal successors, (13), 6 states have internal predecessors, (13), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 17 [2022-04-15 06:26:33,953 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 06:26:33,954 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 7 states, 7 states have (on average 1.8571428571428572) internal successors, (13), 6 states have internal predecessors, (13), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:26:33,964 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 17 edges. 17 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 06:26:33,964 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-04-15 06:26:33,964 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 06:26:33,964 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-04-15 06:26:33,964 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2022-04-15 06:26:33,965 INFO L87 Difference]: Start difference. First operand 31 states and 39 transitions. Second operand has 7 states, 7 states have (on average 1.8571428571428572) internal successors, (13), 6 states have internal predecessors, (13), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:26:34,154 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:26:34,154 INFO L93 Difference]: Finished difference Result 59 states and 76 transitions. [2022-04-15 06:26:34,154 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-04-15 06:26:34,155 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 1.8571428571428572) internal successors, (13), 6 states have internal predecessors, (13), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 17 [2022-04-15 06:26:34,155 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 06:26:34,155 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 1.8571428571428572) internal successors, (13), 6 states have internal predecessors, (13), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:26:34,156 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 54 transitions. [2022-04-15 06:26:34,157 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 1.8571428571428572) internal successors, (13), 6 states have internal predecessors, (13), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:26:34,158 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 54 transitions. [2022-04-15 06:26:34,158 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 8 states and 54 transitions. [2022-04-15 06:26:34,195 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 54 edges. 54 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 06:26:34,196 INFO L225 Difference]: With dead ends: 59 [2022-04-15 06:26:34,196 INFO L226 Difference]: Without dead ends: 34 [2022-04-15 06:26:34,197 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2022-04-15 06:26:34,197 INFO L913 BasicCegarLoop]: 17 mSDtfsCounter, 12 mSDsluCounter, 20 mSDsCounter, 0 mSdLazyCounter, 88 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 37 SdHoareTripleChecker+Invalid, 94 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 88 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-15 06:26:34,198 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [13 Valid, 37 Invalid, 94 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 88 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-15 06:26:34,198 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2022-04-15 06:26:34,216 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 30. [2022-04-15 06:26:34,216 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 06:26:34,217 INFO L82 GeneralOperation]: Start isEquivalent. First operand 34 states. Second operand has 30 states, 24 states have (on average 1.2916666666666667) internal successors, (31), 25 states have internal predecessors, (31), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-15 06:26:34,217 INFO L74 IsIncluded]: Start isIncluded. First operand 34 states. Second operand has 30 states, 24 states have (on average 1.2916666666666667) internal successors, (31), 25 states have internal predecessors, (31), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-15 06:26:34,217 INFO L87 Difference]: Start difference. First operand 34 states. Second operand has 30 states, 24 states have (on average 1.2916666666666667) internal successors, (31), 25 states have internal predecessors, (31), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-15 06:26:34,219 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:26:34,219 INFO L93 Difference]: Finished difference Result 34 states and 41 transitions. [2022-04-15 06:26:34,219 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 41 transitions. [2022-04-15 06:26:34,220 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 06:26:34,220 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 06:26:34,220 INFO L74 IsIncluded]: Start isIncluded. First operand has 30 states, 24 states have (on average 1.2916666666666667) internal successors, (31), 25 states have internal predecessors, (31), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand 34 states. [2022-04-15 06:26:34,220 INFO L87 Difference]: Start difference. First operand has 30 states, 24 states have (on average 1.2916666666666667) internal successors, (31), 25 states have internal predecessors, (31), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand 34 states. [2022-04-15 06:26:34,221 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:26:34,222 INFO L93 Difference]: Finished difference Result 34 states and 41 transitions. [2022-04-15 06:26:34,222 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 41 transitions. [2022-04-15 06:26:34,222 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 06:26:34,222 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 06:26:34,222 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 06:26:34,222 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 06:26:34,222 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30 states, 24 states have (on average 1.2916666666666667) internal successors, (31), 25 states have internal predecessors, (31), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-15 06:26:34,223 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 36 transitions. [2022-04-15 06:26:34,223 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 36 transitions. Word has length 17 [2022-04-15 06:26:34,224 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 06:26:34,224 INFO L478 AbstractCegarLoop]: Abstraction has 30 states and 36 transitions. [2022-04-15 06:26:34,224 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 1.8571428571428572) internal successors, (13), 6 states have internal predecessors, (13), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:26:34,224 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 30 states and 36 transitions. [2022-04-15 06:26:34,256 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 36 edges. 36 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 06:26:34,256 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 36 transitions. [2022-04-15 06:26:34,256 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-04-15 06:26:34,256 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 06:26:34,256 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 06:26:34,256 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-04-15 06:26:34,256 INFO L403 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 06:26:34,257 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 06:26:34,257 INFO L85 PathProgramCache]: Analyzing trace with hash -206914972, now seen corresponding path program 1 times [2022-04-15 06:26:34,257 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 06:26:34,257 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [408628361] [2022-04-15 06:26:35,197 WARN L970 rdanLoopAcceleration]: Unable to prove correctness of quantifier elimination. [2022-04-15 06:26:35,305 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 1 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-15 06:26:35,307 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-15 06:26:35,309 INFO L85 PathProgramCache]: Analyzing trace with hash -1335970809, now seen corresponding path program 1 times [2022-04-15 06:26:35,309 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 06:26:35,309 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1491733485] [2022-04-15 06:26:35,309 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 06:26:35,309 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 06:26:35,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:26:35,454 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 06:26:35,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:26:35,461 INFO L290 TraceCheckUtils]: 0: Hoare triple {979#(and (= ~last~0 |old(~last~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(11, 2);call #Ultimate.allocInit(12, 3);~last~0 := 0; {967#true} is VALID [2022-04-15 06:26:35,461 INFO L290 TraceCheckUtils]: 1: Hoare triple {967#true} assume true; {967#true} is VALID [2022-04-15 06:26:35,461 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {967#true} {967#true} #66#return; {967#true} is VALID [2022-04-15 06:26:35,461 INFO L272 TraceCheckUtils]: 0: Hoare triple {967#true} call ULTIMATE.init(); {979#(and (= ~last~0 |old(~last~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 06:26:35,462 INFO L290 TraceCheckUtils]: 1: Hoare triple {979#(and (= ~last~0 |old(~last~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(11, 2);call #Ultimate.allocInit(12, 3);~last~0 := 0; {967#true} is VALID [2022-04-15 06:26:35,462 INFO L290 TraceCheckUtils]: 2: Hoare triple {967#true} assume true; {967#true} is VALID [2022-04-15 06:26:35,462 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {967#true} {967#true} #66#return; {967#true} is VALID [2022-04-15 06:26:35,462 INFO L272 TraceCheckUtils]: 4: Hoare triple {967#true} call #t~ret6 := main(); {967#true} is VALID [2022-04-15 06:26:35,462 INFO L290 TraceCheckUtils]: 5: Hoare triple {967#true} assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~last~0 := #t~nondet4;havoc #t~nondet4;~a~0 := 0;~b~0 := 0;~c~0 := 0;~st~0 := 0; {972#(and (= main_~a~0 0) (= main_~b~0 0))} is VALID [2022-04-15 06:26:35,463 INFO L290 TraceCheckUtils]: 6: Hoare triple {972#(and (= main_~a~0 0) (= main_~b~0 0))} assume !false;~st~0 := 1;~c~0 := 0; {973#(and (= main_~a~0 0) (= main_~b~0 0) (= main_~c~0 0))} is VALID [2022-04-15 06:26:35,464 INFO L290 TraceCheckUtils]: 7: Hoare triple {973#(and (= main_~a~0 0) (= main_~b~0 0) (= main_~c~0 0))} [76] L23-3-->L23-4_primed: Formula: (let ((.cse0 (= v_main_~c~0_37 v_main_~c~0_36)) (.cse1 (= |v_main_#t~post5_19| |v_main_#t~post5_18|)) (.cse2 (= v_~last~0_19 v_main_~c~0_37))) (or (and .cse0 .cse1 (= v_~last~0_19 v_~last~0_19)) (and (or .cse2 (not (< v_main_~c~0_37 200000))) .cse0 .cse1) (and (or (not (<= (+ v_~last~0_19 1) v_main_~c~0_36)) (not (<= (+ 1 v_main_~c~0_37) v_~last~0_19))) (< v_main_~c~0_37 v_main_~c~0_36) (not .cse2) (< v_main_~c~0_36 200001)))) InVars {main_~c~0=v_main_~c~0_37, main_#t~post5=|v_main_#t~post5_19|, ~last~0=v_~last~0_19} OutVars{main_#t~post5=|v_main_#t~post5_18|, main_~c~0=v_main_~c~0_36, ~last~0=v_~last~0_19} AuxVars[] AssignedVars[main_#t~post5, main_~c~0] {974#(or (and (= main_~a~0 0) (= main_~b~0 0) (<= main_~c~0 200000)) (= main_~c~0 0))} is VALID [2022-04-15 06:26:35,464 INFO L290 TraceCheckUtils]: 8: Hoare triple {974#(or (and (= main_~a~0 0) (= main_~b~0 0) (<= main_~c~0 200000)) (= main_~c~0 0))} [75] L23-4_primed-->L23-4: Formula: (not (< v_main_~c~0_8 200000)) InVars {main_~c~0=v_main_~c~0_8} OutVars{main_~c~0=v_main_~c~0_8} AuxVars[] AssignedVars[] {975#(and (= main_~a~0 0) (= (+ main_~c~0 (- 200000)) 0) (= main_~b~0 0))} is VALID [2022-04-15 06:26:35,465 INFO L290 TraceCheckUtils]: 9: Hoare triple {975#(and (= main_~a~0 0) (= (+ main_~c~0 (- 200000)) 0) (= main_~b~0 0))} assume !(0 == ~st~0 && ~c~0 == 1 + ~last~0);~a~0 := 2 + ~a~0;~b~0 := 2 + ~b~0; {976#(and (= (+ main_~c~0 (- 200000)) 0) (<= main_~b~0 main_~a~0) (< main_~a~0 (+ main_~b~0 1)))} is VALID [2022-04-15 06:26:35,465 INFO L290 TraceCheckUtils]: 10: Hoare triple {976#(and (= (+ main_~c~0 (- 200000)) 0) (<= main_~b~0 main_~a~0) (< main_~a~0 (+ main_~b~0 1)))} assume !(~c~0 == ~last~0 && 0 == ~st~0); {976#(and (= (+ main_~c~0 (- 200000)) 0) (<= main_~b~0 main_~a~0) (< main_~a~0 (+ main_~b~0 1)))} is VALID [2022-04-15 06:26:35,467 INFO L272 TraceCheckUtils]: 11: Hoare triple {976#(and (= (+ main_~c~0 (- 200000)) 0) (<= main_~b~0 main_~a~0) (< main_~a~0 (+ main_~b~0 1)))} call __VERIFIER_assert((if ~a~0 == ~b~0 && 200000 == ~c~0 then 1 else 0)); {977#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-15 06:26:35,467 INFO L290 TraceCheckUtils]: 12: Hoare triple {977#(not (= |__VERIFIER_assert_#in~cond| 0))} ~cond := #in~cond; {978#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-15 06:26:35,468 INFO L290 TraceCheckUtils]: 13: Hoare triple {978#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {968#false} is VALID [2022-04-15 06:26:35,468 INFO L290 TraceCheckUtils]: 14: Hoare triple {968#false} assume !false; {968#false} is VALID [2022-04-15 06:26:35,468 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 06:26:35,468 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 06:26:35,468 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1491733485] [2022-04-15 06:26:35,468 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1491733485] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 06:26:35,468 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 06:26:35,468 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-04-15 06:26:35,638 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 06:26:35,638 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [408628361] [2022-04-15 06:26:35,638 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [408628361] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 06:26:35,638 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 06:26:35,638 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2022-04-15 06:26:35,639 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1256478401] [2022-04-15 06:26:35,639 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 06:26:35,639 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 1.0833333333333333) internal successors, (13), 10 states have internal predecessors, (13), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 17 [2022-04-15 06:26:35,639 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 06:26:35,639 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 12 states, 12 states have (on average 1.0833333333333333) internal successors, (13), 10 states have internal predecessors, (13), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:26:35,650 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 17 edges. 17 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 06:26:35,650 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-04-15 06:26:35,651 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 06:26:35,651 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-04-15 06:26:35,651 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=138, Unknown=0, NotChecked=0, Total=182 [2022-04-15 06:26:35,651 INFO L87 Difference]: Start difference. First operand 30 states and 36 transitions. Second operand has 12 states, 12 states have (on average 1.0833333333333333) internal successors, (13), 10 states have internal predecessors, (13), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:26:36,193 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:26:36,193 INFO L93 Difference]: Finished difference Result 56 states and 68 transitions. [2022-04-15 06:26:36,194 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-04-15 06:26:36,194 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 1.0833333333333333) internal successors, (13), 10 states have internal predecessors, (13), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 17 [2022-04-15 06:26:36,194 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 06:26:36,194 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12 states, 12 states have (on average 1.0833333333333333) internal successors, (13), 10 states have internal predecessors, (13), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:26:36,195 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 50 transitions. [2022-04-15 06:26:36,195 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12 states, 12 states have (on average 1.0833333333333333) internal successors, (13), 10 states have internal predecessors, (13), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:26:36,196 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 50 transitions. [2022-04-15 06:26:36,197 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 14 states and 50 transitions. [2022-04-15 06:26:36,243 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-15 06:26:36,244 INFO L225 Difference]: With dead ends: 56 [2022-04-15 06:26:36,244 INFO L226 Difference]: Without dead ends: 54 [2022-04-15 06:26:36,244 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 60 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=83, Invalid=297, Unknown=0, NotChecked=0, Total=380 [2022-04-15 06:26:36,245 INFO L913 BasicCegarLoop]: 13 mSDtfsCounter, 30 mSDsluCounter, 45 mSDsCounter, 0 mSdLazyCounter, 193 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 31 SdHoareTripleChecker+Valid, 58 SdHoareTripleChecker+Invalid, 203 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 193 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-04-15 06:26:36,245 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [31 Valid, 58 Invalid, 203 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 193 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-04-15 06:26:36,246 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2022-04-15 06:26:36,282 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 43. [2022-04-15 06:26:36,282 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 06:26:36,283 INFO L82 GeneralOperation]: Start isEquivalent. First operand 54 states. Second operand has 43 states, 35 states have (on average 1.2857142857142858) internal successors, (45), 36 states have internal predecessors, (45), 4 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-15 06:26:36,283 INFO L74 IsIncluded]: Start isIncluded. First operand 54 states. Second operand has 43 states, 35 states have (on average 1.2857142857142858) internal successors, (45), 36 states have internal predecessors, (45), 4 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-15 06:26:36,283 INFO L87 Difference]: Start difference. First operand 54 states. Second operand has 43 states, 35 states have (on average 1.2857142857142858) internal successors, (45), 36 states have internal predecessors, (45), 4 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-15 06:26:36,284 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:26:36,284 INFO L93 Difference]: Finished difference Result 54 states and 66 transitions. [2022-04-15 06:26:36,284 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 66 transitions. [2022-04-15 06:26:36,285 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 06:26:36,285 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 06:26:36,285 INFO L74 IsIncluded]: Start isIncluded. First operand has 43 states, 35 states have (on average 1.2857142857142858) internal successors, (45), 36 states have internal predecessors, (45), 4 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) Second operand 54 states. [2022-04-15 06:26:36,285 INFO L87 Difference]: Start difference. First operand has 43 states, 35 states have (on average 1.2857142857142858) internal successors, (45), 36 states have internal predecessors, (45), 4 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) Second operand 54 states. [2022-04-15 06:26:36,286 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:26:36,286 INFO L93 Difference]: Finished difference Result 54 states and 66 transitions. [2022-04-15 06:26:36,286 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 66 transitions. [2022-04-15 06:26:36,287 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 06:26:36,287 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 06:26:36,287 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 06:26:36,287 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 06:26:36,287 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 43 states, 35 states have (on average 1.2857142857142858) internal successors, (45), 36 states have internal predecessors, (45), 4 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-15 06:26:36,288 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 52 transitions. [2022-04-15 06:26:36,288 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 52 transitions. Word has length 17 [2022-04-15 06:26:36,288 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 06:26:36,288 INFO L478 AbstractCegarLoop]: Abstraction has 43 states and 52 transitions. [2022-04-15 06:26:36,288 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 1.0833333333333333) internal successors, (13), 10 states have internal predecessors, (13), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:26:36,288 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 43 states and 52 transitions. [2022-04-15 06:26:36,334 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 52 edges. 52 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 06:26:36,334 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 52 transitions. [2022-04-15 06:26:36,334 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-04-15 06:26:36,334 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 06:26:36,334 INFO L499 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 06:26:36,335 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-04-15 06:26:36,335 INFO L403 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 06:26:36,335 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 06:26:36,335 INFO L85 PathProgramCache]: Analyzing trace with hash -2068588025, now seen corresponding path program 1 times [2022-04-15 06:26:36,335 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 06:26:36,335 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1744154414] [2022-04-15 06:26:36,559 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 1 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-15 06:26:36,797 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {0={1=1}, 1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-15 06:26:36,798 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-15 06:26:36,801 INFO L85 PathProgramCache]: Analyzing trace with hash 1733775048, now seen corresponding path program 1 times [2022-04-15 06:26:36,801 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 06:26:36,801 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [190009691] [2022-04-15 06:26:36,801 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 06:26:36,801 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 06:26:36,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:26:36,955 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 06:26:36,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:26:36,961 INFO L290 TraceCheckUtils]: 0: Hoare triple {1316#(and (= ~last~0 |old(~last~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(11, 2);call #Ultimate.allocInit(12, 3);~last~0 := 0; {1304#true} is VALID [2022-04-15 06:26:36,961 INFO L290 TraceCheckUtils]: 1: Hoare triple {1304#true} assume true; {1304#true} is VALID [2022-04-15 06:26:36,961 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {1304#true} {1304#true} #66#return; {1304#true} is VALID [2022-04-15 06:26:36,962 INFO L272 TraceCheckUtils]: 0: Hoare triple {1304#true} call ULTIMATE.init(); {1316#(and (= ~last~0 |old(~last~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 06:26:36,962 INFO L290 TraceCheckUtils]: 1: Hoare triple {1316#(and (= ~last~0 |old(~last~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(11, 2);call #Ultimate.allocInit(12, 3);~last~0 := 0; {1304#true} is VALID [2022-04-15 06:26:36,962 INFO L290 TraceCheckUtils]: 2: Hoare triple {1304#true} assume true; {1304#true} is VALID [2022-04-15 06:26:36,962 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1304#true} {1304#true} #66#return; {1304#true} is VALID [2022-04-15 06:26:36,962 INFO L272 TraceCheckUtils]: 4: Hoare triple {1304#true} call #t~ret6 := main(); {1304#true} is VALID [2022-04-15 06:26:36,963 INFO L290 TraceCheckUtils]: 5: Hoare triple {1304#true} assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~last~0 := #t~nondet4;havoc #t~nondet4;~a~0 := 0;~b~0 := 0;~c~0 := 0;~st~0 := 0; {1309#(and (= main_~a~0 0) (= main_~b~0 0))} is VALID [2022-04-15 06:26:36,963 INFO L290 TraceCheckUtils]: 6: Hoare triple {1309#(and (= main_~a~0 0) (= main_~b~0 0))} assume !false;~st~0 := 1;~c~0 := 0; {1310#(and (= main_~a~0 0) (= main_~st~0 1) (= main_~b~0 0))} is VALID [2022-04-15 06:26:36,964 INFO L290 TraceCheckUtils]: 7: Hoare triple {1310#(and (= main_~a~0 0) (= main_~st~0 1) (= main_~b~0 0))} [78] L23-3-->L23-4_primed: Formula: (let ((.cse0 (= v_main_~c~0_44 v_main_~c~0_43)) (.cse1 (= |v_main_#t~post5_25| |v_main_#t~post5_23|)) (.cse2 (= v_~last~0_21 v_main_~c~0_44))) (or (and .cse0 (= v_~last~0_21 v_~last~0_21) .cse1) (and .cse0 (or .cse2 (not (< v_main_~c~0_44 200000))) .cse1) (and (< v_main_~c~0_43 200001) (< v_main_~c~0_44 v_main_~c~0_43) (or (not (<= (+ 1 v_main_~c~0_44) v_~last~0_21)) (not (<= (+ v_~last~0_21 1) v_main_~c~0_43))) (not .cse2)))) InVars {main_~c~0=v_main_~c~0_44, main_#t~post5=|v_main_#t~post5_25|, ~last~0=v_~last~0_21} OutVars{main_#t~post5=|v_main_#t~post5_23|, main_~c~0=v_main_~c~0_43, ~last~0=v_~last~0_21} AuxVars[] AssignedVars[main_#t~post5, main_~c~0] {1310#(and (= main_~a~0 0) (= main_~st~0 1) (= main_~b~0 0))} is VALID [2022-04-15 06:26:36,965 INFO L290 TraceCheckUtils]: 8: Hoare triple {1310#(and (= main_~a~0 0) (= main_~st~0 1) (= main_~b~0 0))} [79] L23-4_primed-->L23-3: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1310#(and (= main_~a~0 0) (= main_~st~0 1) (= main_~b~0 0))} is VALID [2022-04-15 06:26:36,965 INFO L290 TraceCheckUtils]: 9: Hoare triple {1310#(and (= main_~a~0 0) (= main_~st~0 1) (= main_~b~0 0))} [80] L23-3-->L23-4_primed: Formula: (let ((.cse0 (< v_main_~c~0_46 200000)) (.cse1 (= v_~last~0_22 v_main_~c~0_46)) (.cse2 (= v_main_~c~0_46 v_main_~c~0_45)) (.cse3 (= |v_main_#t~post5_28| |v_main_#t~post5_24|))) (or (and .cse0 (< v_main_~c~0_46 v_main_~c~0_45) (= 0 v_main_~st~0_19) (< v_main_~c~0_45 (+ 2 v_main_~c~0_46)) .cse1) (and .cse2 (= v_main_~st~0_19 v_main_~st~0_20) (or (not .cse0) (not .cse1)) .cse3) (and .cse2 (= v_main_~st~0_20 v_main_~st~0_19) (= v_~last~0_22 v_~last~0_22) .cse3))) InVars {main_~c~0=v_main_~c~0_46, main_#t~post5=|v_main_#t~post5_28|, main_~st~0=v_main_~st~0_20, ~last~0=v_~last~0_22} OutVars{main_#t~post5=|v_main_#t~post5_24|, main_~c~0=v_main_~c~0_45, main_~st~0=v_main_~st~0_19, ~last~0=v_~last~0_22} AuxVars[] AssignedVars[main_#t~post5, main_~c~0, main_~st~0] {1311#(or (= main_~st~0 1) (and (= main_~a~0 0) (or (<= ~last~0 199999) (<= main_~c~0 200000)) (= main_~b~0 0)))} is VALID [2022-04-15 06:26:36,966 INFO L290 TraceCheckUtils]: 10: Hoare triple {1311#(or (= main_~st~0 1) (and (= main_~a~0 0) (or (<= ~last~0 199999) (<= main_~c~0 200000)) (= main_~b~0 0)))} [77] L23-4_primed-->L23-4: Formula: (not (< v_main_~c~0_8 200000)) InVars {main_~c~0=v_main_~c~0_8} OutVars{main_~c~0=v_main_~c~0_8} AuxVars[] AssignedVars[] {1312#(or (= main_~st~0 1) (and (= main_~a~0 0) (or (<= ~last~0 199999) (<= main_~c~0 200000)) (= main_~b~0 0) (< 199999 main_~c~0)))} is VALID [2022-04-15 06:26:36,967 INFO L290 TraceCheckUtils]: 11: Hoare triple {1312#(or (= main_~st~0 1) (and (= main_~a~0 0) (or (<= ~last~0 199999) (<= main_~c~0 200000)) (= main_~b~0 0) (< 199999 main_~c~0)))} assume 0 == ~st~0 && ~c~0 == 1 + ~last~0;~a~0 := 3 + ~a~0;~b~0 := 3 + ~b~0; {1313#(and (<= main_~b~0 main_~a~0) (< main_~a~0 (+ main_~b~0 1)) (< 199999 main_~c~0) (<= main_~c~0 200000))} is VALID [2022-04-15 06:26:36,967 INFO L290 TraceCheckUtils]: 12: Hoare triple {1313#(and (<= main_~b~0 main_~a~0) (< main_~a~0 (+ main_~b~0 1)) (< 199999 main_~c~0) (<= main_~c~0 200000))} assume !(~c~0 == ~last~0 && 0 == ~st~0); {1313#(and (<= main_~b~0 main_~a~0) (< main_~a~0 (+ main_~b~0 1)) (< 199999 main_~c~0) (<= main_~c~0 200000))} is VALID [2022-04-15 06:26:36,968 INFO L272 TraceCheckUtils]: 13: Hoare triple {1313#(and (<= main_~b~0 main_~a~0) (< main_~a~0 (+ main_~b~0 1)) (< 199999 main_~c~0) (<= main_~c~0 200000))} call __VERIFIER_assert((if ~a~0 == ~b~0 && 200000 == ~c~0 then 1 else 0)); {1314#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-15 06:26:36,968 INFO L290 TraceCheckUtils]: 14: Hoare triple {1314#(not (= |__VERIFIER_assert_#in~cond| 0))} ~cond := #in~cond; {1315#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-15 06:26:36,969 INFO L290 TraceCheckUtils]: 15: Hoare triple {1315#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {1305#false} is VALID [2022-04-15 06:26:36,969 INFO L290 TraceCheckUtils]: 16: Hoare triple {1305#false} assume !false; {1305#false} is VALID [2022-04-15 06:26:36,969 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-04-15 06:26:36,969 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 06:26:36,969 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [190009691] [2022-04-15 06:26:36,969 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [190009691] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 06:26:36,970 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1849122154] [2022-04-15 06:26:36,970 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 06:26:36,970 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 06:26:36,970 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 06:26:36,971 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-15 06:26:36,997 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-04-15 06:26:37,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:26:37,011 INFO L263 TraceCheckSpWp]: Trace formula consists of 85 conjuncts, 18 conjunts are in the unsatisfiable core [2022-04-15 06:26:37,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:26:37,021 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 06:26:37,321 INFO L272 TraceCheckUtils]: 0: Hoare triple {1304#true} call ULTIMATE.init(); {1304#true} is VALID [2022-04-15 06:26:37,321 INFO L290 TraceCheckUtils]: 1: Hoare triple {1304#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(11, 2);call #Ultimate.allocInit(12, 3);~last~0 := 0; {1304#true} is VALID [2022-04-15 06:26:37,321 INFO L290 TraceCheckUtils]: 2: Hoare triple {1304#true} assume true; {1304#true} is VALID [2022-04-15 06:26:37,322 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1304#true} {1304#true} #66#return; {1304#true} is VALID [2022-04-15 06:26:37,322 INFO L272 TraceCheckUtils]: 4: Hoare triple {1304#true} call #t~ret6 := main(); {1304#true} is VALID [2022-04-15 06:26:37,322 INFO L290 TraceCheckUtils]: 5: Hoare triple {1304#true} assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~last~0 := #t~nondet4;havoc #t~nondet4;~a~0 := 0;~b~0 := 0;~c~0 := 0;~st~0 := 0; {1309#(and (= main_~a~0 0) (= main_~b~0 0))} is VALID [2022-04-15 06:26:37,323 INFO L290 TraceCheckUtils]: 6: Hoare triple {1309#(and (= main_~a~0 0) (= main_~b~0 0))} assume !false;~st~0 := 1;~c~0 := 0; {1310#(and (= main_~a~0 0) (= main_~st~0 1) (= main_~b~0 0))} is VALID [2022-04-15 06:26:37,324 INFO L290 TraceCheckUtils]: 7: Hoare triple {1310#(and (= main_~a~0 0) (= main_~st~0 1) (= main_~b~0 0))} [78] L23-3-->L23-4_primed: Formula: (let ((.cse0 (= v_main_~c~0_44 v_main_~c~0_43)) (.cse1 (= |v_main_#t~post5_25| |v_main_#t~post5_23|)) (.cse2 (= v_~last~0_21 v_main_~c~0_44))) (or (and .cse0 (= v_~last~0_21 v_~last~0_21) .cse1) (and .cse0 (or .cse2 (not (< v_main_~c~0_44 200000))) .cse1) (and (< v_main_~c~0_43 200001) (< v_main_~c~0_44 v_main_~c~0_43) (or (not (<= (+ 1 v_main_~c~0_44) v_~last~0_21)) (not (<= (+ v_~last~0_21 1) v_main_~c~0_43))) (not .cse2)))) InVars {main_~c~0=v_main_~c~0_44, main_#t~post5=|v_main_#t~post5_25|, ~last~0=v_~last~0_21} OutVars{main_#t~post5=|v_main_#t~post5_23|, main_~c~0=v_main_~c~0_43, ~last~0=v_~last~0_21} AuxVars[] AssignedVars[main_#t~post5, main_~c~0] {1310#(and (= main_~a~0 0) (= main_~st~0 1) (= main_~b~0 0))} is VALID [2022-04-15 06:26:37,324 INFO L290 TraceCheckUtils]: 8: Hoare triple {1310#(and (= main_~a~0 0) (= main_~st~0 1) (= main_~b~0 0))} [79] L23-4_primed-->L23-3: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1310#(and (= main_~a~0 0) (= main_~st~0 1) (= main_~b~0 0))} is VALID [2022-04-15 06:26:37,325 INFO L290 TraceCheckUtils]: 9: Hoare triple {1310#(and (= main_~a~0 0) (= main_~st~0 1) (= main_~b~0 0))} [80] L23-3-->L23-4_primed: Formula: (let ((.cse0 (< v_main_~c~0_46 200000)) (.cse1 (= v_~last~0_22 v_main_~c~0_46)) (.cse2 (= v_main_~c~0_46 v_main_~c~0_45)) (.cse3 (= |v_main_#t~post5_28| |v_main_#t~post5_24|))) (or (and .cse0 (< v_main_~c~0_46 v_main_~c~0_45) (= 0 v_main_~st~0_19) (< v_main_~c~0_45 (+ 2 v_main_~c~0_46)) .cse1) (and .cse2 (= v_main_~st~0_19 v_main_~st~0_20) (or (not .cse0) (not .cse1)) .cse3) (and .cse2 (= v_main_~st~0_20 v_main_~st~0_19) (= v_~last~0_22 v_~last~0_22) .cse3))) InVars {main_~c~0=v_main_~c~0_46, main_#t~post5=|v_main_#t~post5_28|, main_~st~0=v_main_~st~0_20, ~last~0=v_~last~0_22} OutVars{main_#t~post5=|v_main_#t~post5_24|, main_~c~0=v_main_~c~0_45, main_~st~0=v_main_~st~0_19, ~last~0=v_~last~0_22} AuxVars[] AssignedVars[main_#t~post5, main_~c~0, main_~st~0] {1347#(and (= main_~a~0 0) (= main_~b~0 0) (or (= main_~st~0 1) (and (< ~last~0 200000) (< ~last~0 main_~c~0) (< main_~c~0 (+ ~last~0 2)) (= main_~st~0 0))))} is VALID [2022-04-15 06:26:37,326 INFO L290 TraceCheckUtils]: 10: Hoare triple {1347#(and (= main_~a~0 0) (= main_~b~0 0) (or (= main_~st~0 1) (and (< ~last~0 200000) (< ~last~0 main_~c~0) (< main_~c~0 (+ ~last~0 2)) (= main_~st~0 0))))} [77] L23-4_primed-->L23-4: Formula: (not (< v_main_~c~0_8 200000)) InVars {main_~c~0=v_main_~c~0_8} OutVars{main_~c~0=v_main_~c~0_8} AuxVars[] AssignedVars[] {1351#(and (= main_~a~0 0) (or (and (< ~last~0 200000) (< main_~c~0 (+ ~last~0 2)) (= main_~st~0 0)) (= main_~st~0 1)) (= main_~b~0 0) (not (< main_~c~0 200000)))} is VALID [2022-04-15 06:26:37,326 INFO L290 TraceCheckUtils]: 11: Hoare triple {1351#(and (= main_~a~0 0) (or (and (< ~last~0 200000) (< main_~c~0 (+ ~last~0 2)) (= main_~st~0 0)) (= main_~st~0 1)) (= main_~b~0 0) (not (< main_~c~0 200000)))} assume 0 == ~st~0 && ~c~0 == 1 + ~last~0;~a~0 := 3 + ~a~0;~b~0 := 3 + ~b~0; {1355#(and (= main_~b~0 3) (<= 200000 main_~c~0) (< main_~c~0 200001) (= main_~a~0 3))} is VALID [2022-04-15 06:26:37,327 INFO L290 TraceCheckUtils]: 12: Hoare triple {1355#(and (= main_~b~0 3) (<= 200000 main_~c~0) (< main_~c~0 200001) (= main_~a~0 3))} assume !(~c~0 == ~last~0 && 0 == ~st~0); {1355#(and (= main_~b~0 3) (<= 200000 main_~c~0) (< main_~c~0 200001) (= main_~a~0 3))} is VALID [2022-04-15 06:26:37,327 INFO L272 TraceCheckUtils]: 13: Hoare triple {1355#(and (= main_~b~0 3) (<= 200000 main_~c~0) (< main_~c~0 200001) (= main_~a~0 3))} call __VERIFIER_assert((if ~a~0 == ~b~0 && 200000 == ~c~0 then 1 else 0)); {1362#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-15 06:26:37,328 INFO L290 TraceCheckUtils]: 14: Hoare triple {1362#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {1366#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-15 06:26:37,328 INFO L290 TraceCheckUtils]: 15: Hoare triple {1366#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {1305#false} is VALID [2022-04-15 06:26:37,328 INFO L290 TraceCheckUtils]: 16: Hoare triple {1305#false} assume !false; {1305#false} is VALID [2022-04-15 06:26:37,329 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-04-15 06:26:37,329 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 06:26:37,773 INFO L290 TraceCheckUtils]: 16: Hoare triple {1305#false} assume !false; {1305#false} is VALID [2022-04-15 06:26:37,774 INFO L290 TraceCheckUtils]: 15: Hoare triple {1366#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {1305#false} is VALID [2022-04-15 06:26:37,774 INFO L290 TraceCheckUtils]: 14: Hoare triple {1362#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {1366#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-15 06:26:37,775 INFO L272 TraceCheckUtils]: 13: Hoare triple {1313#(and (<= main_~b~0 main_~a~0) (< main_~a~0 (+ main_~b~0 1)) (< 199999 main_~c~0) (<= main_~c~0 200000))} call __VERIFIER_assert((if ~a~0 == ~b~0 && 200000 == ~c~0 then 1 else 0)); {1362#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-15 06:26:37,775 INFO L290 TraceCheckUtils]: 12: Hoare triple {1313#(and (<= main_~b~0 main_~a~0) (< main_~a~0 (+ main_~b~0 1)) (< 199999 main_~c~0) (<= main_~c~0 200000))} assume !(~c~0 == ~last~0 && 0 == ~st~0); {1313#(and (<= main_~b~0 main_~a~0) (< main_~a~0 (+ main_~b~0 1)) (< 199999 main_~c~0) (<= main_~c~0 200000))} is VALID [2022-04-15 06:26:37,776 INFO L290 TraceCheckUtils]: 11: Hoare triple {1388#(or (not (<= main_~c~0 (+ ~last~0 1))) (and (<= main_~b~0 main_~a~0) (< main_~a~0 (+ main_~b~0 1)) (< 199999 main_~c~0) (<= main_~c~0 200000)) (not (= main_~st~0 0)))} assume 0 == ~st~0 && ~c~0 == 1 + ~last~0;~a~0 := 3 + ~a~0;~b~0 := 3 + ~b~0; {1313#(and (<= main_~b~0 main_~a~0) (< main_~a~0 (+ main_~b~0 1)) (< 199999 main_~c~0) (<= main_~c~0 200000))} is VALID [2022-04-15 06:26:37,776 INFO L290 TraceCheckUtils]: 10: Hoare triple {1392#(or (not (<= main_~c~0 (+ ~last~0 1))) (and (<= main_~b~0 main_~a~0) (< main_~a~0 (+ main_~b~0 1)) (<= main_~c~0 200000)) (not (= main_~st~0 0)) (< main_~c~0 200000))} [77] L23-4_primed-->L23-4: Formula: (not (< v_main_~c~0_8 200000)) InVars {main_~c~0=v_main_~c~0_8} OutVars{main_~c~0=v_main_~c~0_8} AuxVars[] AssignedVars[] {1388#(or (not (<= main_~c~0 (+ ~last~0 1))) (and (<= main_~b~0 main_~a~0) (< main_~a~0 (+ main_~b~0 1)) (< 199999 main_~c~0) (<= main_~c~0 200000)) (not (= main_~st~0 0)))} is VALID [2022-04-15 06:26:37,792 INFO L290 TraceCheckUtils]: 9: Hoare triple {1396#(and (<= main_~b~0 main_~a~0) (< main_~a~0 (+ main_~b~0 1)) (not (= main_~st~0 0)))} [80] L23-3-->L23-4_primed: Formula: (let ((.cse0 (< v_main_~c~0_46 200000)) (.cse1 (= v_~last~0_22 v_main_~c~0_46)) (.cse2 (= v_main_~c~0_46 v_main_~c~0_45)) (.cse3 (= |v_main_#t~post5_28| |v_main_#t~post5_24|))) (or (and .cse0 (< v_main_~c~0_46 v_main_~c~0_45) (= 0 v_main_~st~0_19) (< v_main_~c~0_45 (+ 2 v_main_~c~0_46)) .cse1) (and .cse2 (= v_main_~st~0_19 v_main_~st~0_20) (or (not .cse0) (not .cse1)) .cse3) (and .cse2 (= v_main_~st~0_20 v_main_~st~0_19) (= v_~last~0_22 v_~last~0_22) .cse3))) InVars {main_~c~0=v_main_~c~0_46, main_#t~post5=|v_main_#t~post5_28|, main_~st~0=v_main_~st~0_20, ~last~0=v_~last~0_22} OutVars{main_#t~post5=|v_main_#t~post5_24|, main_~c~0=v_main_~c~0_45, main_~st~0=v_main_~st~0_19, ~last~0=v_~last~0_22} AuxVars[] AssignedVars[main_#t~post5, main_~c~0, main_~st~0] {1392#(or (not (<= main_~c~0 (+ ~last~0 1))) (and (<= main_~b~0 main_~a~0) (< main_~a~0 (+ main_~b~0 1)) (<= main_~c~0 200000)) (not (= main_~st~0 0)) (< main_~c~0 200000))} is VALID [2022-04-15 06:26:37,804 INFO L290 TraceCheckUtils]: 8: Hoare triple {1396#(and (<= main_~b~0 main_~a~0) (< main_~a~0 (+ main_~b~0 1)) (not (= main_~st~0 0)))} [79] L23-4_primed-->L23-3: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1396#(and (<= main_~b~0 main_~a~0) (< main_~a~0 (+ main_~b~0 1)) (not (= main_~st~0 0)))} is VALID [2022-04-15 06:26:37,804 INFO L290 TraceCheckUtils]: 7: Hoare triple {1396#(and (<= main_~b~0 main_~a~0) (< main_~a~0 (+ main_~b~0 1)) (not (= main_~st~0 0)))} [78] L23-3-->L23-4_primed: Formula: (let ((.cse0 (= v_main_~c~0_44 v_main_~c~0_43)) (.cse1 (= |v_main_#t~post5_25| |v_main_#t~post5_23|)) (.cse2 (= v_~last~0_21 v_main_~c~0_44))) (or (and .cse0 (= v_~last~0_21 v_~last~0_21) .cse1) (and .cse0 (or .cse2 (not (< v_main_~c~0_44 200000))) .cse1) (and (< v_main_~c~0_43 200001) (< v_main_~c~0_44 v_main_~c~0_43) (or (not (<= (+ 1 v_main_~c~0_44) v_~last~0_21)) (not (<= (+ v_~last~0_21 1) v_main_~c~0_43))) (not .cse2)))) InVars {main_~c~0=v_main_~c~0_44, main_#t~post5=|v_main_#t~post5_25|, ~last~0=v_~last~0_21} OutVars{main_#t~post5=|v_main_#t~post5_23|, main_~c~0=v_main_~c~0_43, ~last~0=v_~last~0_21} AuxVars[] AssignedVars[main_#t~post5, main_~c~0] {1396#(and (<= main_~b~0 main_~a~0) (< main_~a~0 (+ main_~b~0 1)) (not (= main_~st~0 0)))} is VALID [2022-04-15 06:26:37,805 INFO L290 TraceCheckUtils]: 6: Hoare triple {1406#(and (<= main_~b~0 main_~a~0) (< main_~a~0 (+ main_~b~0 1)))} assume !false;~st~0 := 1;~c~0 := 0; {1396#(and (<= main_~b~0 main_~a~0) (< main_~a~0 (+ main_~b~0 1)) (not (= main_~st~0 0)))} is VALID [2022-04-15 06:26:37,805 INFO L290 TraceCheckUtils]: 5: Hoare triple {1304#true} assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~last~0 := #t~nondet4;havoc #t~nondet4;~a~0 := 0;~b~0 := 0;~c~0 := 0;~st~0 := 0; {1406#(and (<= main_~b~0 main_~a~0) (< main_~a~0 (+ main_~b~0 1)))} is VALID [2022-04-15 06:26:37,805 INFO L272 TraceCheckUtils]: 4: Hoare triple {1304#true} call #t~ret6 := main(); {1304#true} is VALID [2022-04-15 06:26:37,805 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1304#true} {1304#true} #66#return; {1304#true} is VALID [2022-04-15 06:26:37,806 INFO L290 TraceCheckUtils]: 2: Hoare triple {1304#true} assume true; {1304#true} is VALID [2022-04-15 06:26:37,806 INFO L290 TraceCheckUtils]: 1: Hoare triple {1304#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(11, 2);call #Ultimate.allocInit(12, 3);~last~0 := 0; {1304#true} is VALID [2022-04-15 06:26:37,806 INFO L272 TraceCheckUtils]: 0: Hoare triple {1304#true} call ULTIMATE.init(); {1304#true} is VALID [2022-04-15 06:26:37,806 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-04-15 06:26:37,806 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1849122154] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 06:26:37,806 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 06:26:37,806 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9, 9] total 19 [2022-04-15 06:26:37,943 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 06:26:37,943 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1744154414] [2022-04-15 06:26:37,943 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1744154414] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 06:26:37,943 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 06:26:37,943 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2022-04-15 06:26:37,943 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1905458854] [2022-04-15 06:26:37,943 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 06:26:37,944 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 1.1428571428571428) internal successors, (16), 12 states have internal predecessors, (16), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 20 [2022-04-15 06:26:37,944 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 06:26:37,944 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 14 states, 14 states have (on average 1.1428571428571428) internal successors, (16), 12 states have internal predecessors, (16), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:26:37,957 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 20 edges. 20 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 06:26:37,957 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-04-15 06:26:37,957 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 06:26:37,958 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-04-15 06:26:37,958 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=111, Invalid=441, Unknown=0, NotChecked=0, Total=552 [2022-04-15 06:26:37,958 INFO L87 Difference]: Start difference. First operand 43 states and 52 transitions. Second operand has 14 states, 14 states have (on average 1.1428571428571428) internal successors, (16), 12 states have internal predecessors, (16), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:26:38,659 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:26:38,659 INFO L93 Difference]: Finished difference Result 91 states and 112 transitions. [2022-04-15 06:26:38,659 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-04-15 06:26:38,659 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 1.1428571428571428) internal successors, (16), 12 states have internal predecessors, (16), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 20 [2022-04-15 06:26:38,659 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 06:26:38,659 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 14 states have (on average 1.1428571428571428) internal successors, (16), 12 states have internal predecessors, (16), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:26:38,662 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 80 transitions. [2022-04-15 06:26:38,662 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 14 states have (on average 1.1428571428571428) internal successors, (16), 12 states have internal predecessors, (16), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:26:38,664 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 80 transitions. [2022-04-15 06:26:38,664 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 17 states and 80 transitions. [2022-04-15 06:26:38,761 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 80 edges. 80 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 06:26:38,762 INFO L225 Difference]: With dead ends: 91 [2022-04-15 06:26:38,763 INFO L226 Difference]: Without dead ends: 67 [2022-04-15 06:26:38,763 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 28 SyntacticMatches, 2 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 236 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=148, Invalid=664, Unknown=0, NotChecked=0, Total=812 [2022-04-15 06:26:38,764 INFO L913 BasicCegarLoop]: 19 mSDtfsCounter, 34 mSDsluCounter, 47 mSDsCounter, 0 mSdLazyCounter, 283 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 36 SdHoareTripleChecker+Valid, 66 SdHoareTripleChecker+Invalid, 303 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 283 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-04-15 06:26:38,764 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [36 Valid, 66 Invalid, 303 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 283 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-04-15 06:26:38,765 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2022-04-15 06:26:38,830 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 51. [2022-04-15 06:26:38,830 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 06:26:38,830 INFO L82 GeneralOperation]: Start isEquivalent. First operand 67 states. Second operand has 51 states, 43 states have (on average 1.2790697674418605) internal successors, (55), 44 states have internal predecessors, (55), 4 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-15 06:26:38,830 INFO L74 IsIncluded]: Start isIncluded. First operand 67 states. Second operand has 51 states, 43 states have (on average 1.2790697674418605) internal successors, (55), 44 states have internal predecessors, (55), 4 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-15 06:26:38,830 INFO L87 Difference]: Start difference. First operand 67 states. Second operand has 51 states, 43 states have (on average 1.2790697674418605) internal successors, (55), 44 states have internal predecessors, (55), 4 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-15 06:26:38,832 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:26:38,832 INFO L93 Difference]: Finished difference Result 67 states and 80 transitions. [2022-04-15 06:26:38,833 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 80 transitions. [2022-04-15 06:26:38,833 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 06:26:38,833 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 06:26:38,833 INFO L74 IsIncluded]: Start isIncluded. First operand has 51 states, 43 states have (on average 1.2790697674418605) internal successors, (55), 44 states have internal predecessors, (55), 4 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) Second operand 67 states. [2022-04-15 06:26:38,833 INFO L87 Difference]: Start difference. First operand has 51 states, 43 states have (on average 1.2790697674418605) internal successors, (55), 44 states have internal predecessors, (55), 4 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) Second operand 67 states. [2022-04-15 06:26:38,835 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:26:38,835 INFO L93 Difference]: Finished difference Result 67 states and 80 transitions. [2022-04-15 06:26:38,835 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 80 transitions. [2022-04-15 06:26:38,835 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 06:26:38,835 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 06:26:38,835 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 06:26:38,835 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 06:26:38,835 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 51 states, 43 states have (on average 1.2790697674418605) internal successors, (55), 44 states have internal predecessors, (55), 4 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-15 06:26:38,836 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 62 transitions. [2022-04-15 06:26:38,837 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 62 transitions. Word has length 20 [2022-04-15 06:26:38,837 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 06:26:38,837 INFO L478 AbstractCegarLoop]: Abstraction has 51 states and 62 transitions. [2022-04-15 06:26:38,837 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 1.1428571428571428) internal successors, (16), 12 states have internal predecessors, (16), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:26:38,837 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 51 states and 62 transitions. [2022-04-15 06:26:38,897 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 62 edges. 62 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 06:26:38,897 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 62 transitions. [2022-04-15 06:26:38,897 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-04-15 06:26:38,897 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 06:26:38,897 INFO L499 BasicCegarLoop]: trace histogram [3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 06:26:38,922 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-15 06:26:39,098 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2022-04-15 06:26:39,098 INFO L403 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 06:26:39,098 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 06:26:39,099 INFO L85 PathProgramCache]: Analyzing trace with hash -1319592892, now seen corresponding path program 2 times [2022-04-15 06:26:39,099 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 06:26:39,099 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1916495635] [2022-04-15 06:26:39,293 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 1 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-15 06:26:39,501 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {0={1=1}, 1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-15 06:26:39,502 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-15 06:26:39,504 INFO L85 PathProgramCache]: Analyzing trace with hash -55808056, now seen corresponding path program 1 times [2022-04-15 06:26:39,504 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 06:26:39,504 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1197902084] [2022-04-15 06:26:39,504 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 06:26:39,504 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 06:26:39,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:26:39,616 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 06:26:39,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:26:39,620 INFO L290 TraceCheckUtils]: 0: Hoare triple {1872#(and (= ~last~0 |old(~last~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(11, 2);call #Ultimate.allocInit(12, 3);~last~0 := 0; {1860#true} is VALID [2022-04-15 06:26:39,620 INFO L290 TraceCheckUtils]: 1: Hoare triple {1860#true} assume true; {1860#true} is VALID [2022-04-15 06:26:39,620 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {1860#true} {1860#true} #66#return; {1860#true} is VALID [2022-04-15 06:26:39,621 INFO L272 TraceCheckUtils]: 0: Hoare triple {1860#true} call ULTIMATE.init(); {1872#(and (= ~last~0 |old(~last~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 06:26:39,621 INFO L290 TraceCheckUtils]: 1: Hoare triple {1872#(and (= ~last~0 |old(~last~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(11, 2);call #Ultimate.allocInit(12, 3);~last~0 := 0; {1860#true} is VALID [2022-04-15 06:26:39,621 INFO L290 TraceCheckUtils]: 2: Hoare triple {1860#true} assume true; {1860#true} is VALID [2022-04-15 06:26:39,621 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1860#true} {1860#true} #66#return; {1860#true} is VALID [2022-04-15 06:26:39,621 INFO L272 TraceCheckUtils]: 4: Hoare triple {1860#true} call #t~ret6 := main(); {1860#true} is VALID [2022-04-15 06:26:39,622 INFO L290 TraceCheckUtils]: 5: Hoare triple {1860#true} assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~last~0 := #t~nondet4;havoc #t~nondet4;~a~0 := 0;~b~0 := 0;~c~0 := 0;~st~0 := 0; {1865#(and (= main_~a~0 0) (= main_~b~0 0))} is VALID [2022-04-15 06:26:39,622 INFO L290 TraceCheckUtils]: 6: Hoare triple {1865#(and (= main_~a~0 0) (= main_~b~0 0))} assume !false;~st~0 := 1;~c~0 := 0; {1866#(and (= main_~a~0 0) (= main_~b~0 0) (= main_~c~0 0))} is VALID [2022-04-15 06:26:39,623 INFO L290 TraceCheckUtils]: 7: Hoare triple {1866#(and (= main_~a~0 0) (= main_~b~0 0) (= main_~c~0 0))} [82] L23-3-->L23-4_primed: Formula: (let ((.cse1 (= v_main_~c~0_63 v_main_~c~0_62)) (.cse2 (= |v_main_#t~post5_38| |v_main_#t~post5_36|)) (.cse0 (= v_~last~0_29 v_main_~c~0_63))) (or (and (or (not (<= (+ 1 v_main_~c~0_63) v_~last~0_29)) (not (<= (+ v_~last~0_29 1) v_main_~c~0_62))) (< v_main_~c~0_62 200001) (< v_main_~c~0_63 v_main_~c~0_62) (not .cse0)) (and .cse1 .cse2 (= v_~last~0_29 v_~last~0_29)) (and .cse1 .cse2 (or .cse0 (not (< v_main_~c~0_63 200000)))))) InVars {main_~c~0=v_main_~c~0_63, main_#t~post5=|v_main_#t~post5_38|, ~last~0=v_~last~0_29} OutVars{main_#t~post5=|v_main_#t~post5_36|, main_~c~0=v_main_~c~0_62, ~last~0=v_~last~0_29} AuxVars[] AssignedVars[main_#t~post5, main_~c~0] {1867#(and (= main_~a~0 0) (= main_~b~0 0) (<= main_~c~0 200000))} is VALID [2022-04-15 06:26:39,623 INFO L290 TraceCheckUtils]: 8: Hoare triple {1867#(and (= main_~a~0 0) (= main_~b~0 0) (<= main_~c~0 200000))} [83] L23-4_primed-->L23-3: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1867#(and (= main_~a~0 0) (= main_~b~0 0) (<= main_~c~0 200000))} is VALID [2022-04-15 06:26:39,624 INFO L290 TraceCheckUtils]: 9: Hoare triple {1867#(and (= main_~a~0 0) (= main_~b~0 0) (<= main_~c~0 200000))} [84] L23-3-->L23-4_primed: Formula: (let ((.cse0 (= v_main_~c~0_65 v_main_~c~0_64)) (.cse1 (= v_main_~st~0_30 v_main_~st~0_29)) (.cse3 (= v_~last~0_30 v_main_~c~0_65)) (.cse2 (< v_main_~c~0_65 200000))) (or (and .cse0 .cse1 (or (not .cse2) (not .cse3)) (= |v_main_#t~post5_37| |v_main_#t~post5_41|)) (and (= v_~last~0_30 v_~last~0_30) .cse0 (= |v_main_#t~post5_41| |v_main_#t~post5_37|) .cse1) (and .cse3 (= 0 v_main_~st~0_29) .cse2 (< v_main_~c~0_64 (+ 2 v_main_~c~0_65)) (< v_main_~c~0_65 v_main_~c~0_64)))) InVars {main_~c~0=v_main_~c~0_65, main_#t~post5=|v_main_#t~post5_41|, main_~st~0=v_main_~st~0_30, ~last~0=v_~last~0_30} OutVars{main_#t~post5=|v_main_#t~post5_37|, main_~c~0=v_main_~c~0_64, main_~st~0=v_main_~st~0_29, ~last~0=v_~last~0_30} AuxVars[] AssignedVars[main_#t~post5, main_~c~0, main_~st~0] {1867#(and (= main_~a~0 0) (= main_~b~0 0) (<= main_~c~0 200000))} is VALID [2022-04-15 06:26:39,624 INFO L290 TraceCheckUtils]: 10: Hoare triple {1867#(and (= main_~a~0 0) (= main_~b~0 0) (<= main_~c~0 200000))} [81] L23-4_primed-->L23-4: Formula: (not (< v_main_~c~0_8 200000)) InVars {main_~c~0=v_main_~c~0_8} OutVars{main_~c~0=v_main_~c~0_8} AuxVars[] AssignedVars[] {1868#(and (= main_~a~0 0) (= main_~b~0 0) (< 199999 main_~c~0) (<= main_~c~0 200000))} is VALID [2022-04-15 06:26:39,625 INFO L290 TraceCheckUtils]: 11: Hoare triple {1868#(and (= main_~a~0 0) (= main_~b~0 0) (< 199999 main_~c~0) (<= main_~c~0 200000))} assume 0 == ~st~0 && ~c~0 == 1 + ~last~0;~a~0 := 3 + ~a~0;~b~0 := 3 + ~b~0; {1869#(and (<= main_~b~0 main_~a~0) (< main_~a~0 (+ main_~b~0 1)) (< 199999 main_~c~0) (<= main_~c~0 200000))} is VALID [2022-04-15 06:26:39,625 INFO L290 TraceCheckUtils]: 12: Hoare triple {1869#(and (<= main_~b~0 main_~a~0) (< main_~a~0 (+ main_~b~0 1)) (< 199999 main_~c~0) (<= main_~c~0 200000))} assume !(~c~0 == ~last~0 && 0 == ~st~0); {1869#(and (<= main_~b~0 main_~a~0) (< main_~a~0 (+ main_~b~0 1)) (< 199999 main_~c~0) (<= main_~c~0 200000))} is VALID [2022-04-15 06:26:39,626 INFO L272 TraceCheckUtils]: 13: Hoare triple {1869#(and (<= main_~b~0 main_~a~0) (< main_~a~0 (+ main_~b~0 1)) (< 199999 main_~c~0) (<= main_~c~0 200000))} call __VERIFIER_assert((if ~a~0 == ~b~0 && 200000 == ~c~0 then 1 else 0)); {1870#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-15 06:26:39,626 INFO L290 TraceCheckUtils]: 14: Hoare triple {1870#(not (= |__VERIFIER_assert_#in~cond| 0))} ~cond := #in~cond; {1871#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-15 06:26:39,627 INFO L290 TraceCheckUtils]: 15: Hoare triple {1871#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {1861#false} is VALID [2022-04-15 06:26:39,627 INFO L290 TraceCheckUtils]: 16: Hoare triple {1861#false} assume !false; {1861#false} is VALID [2022-04-15 06:26:39,627 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-04-15 06:26:39,627 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 06:26:39,627 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1197902084] [2022-04-15 06:26:39,627 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1197902084] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 06:26:39,627 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [812384095] [2022-04-15 06:26:39,627 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 06:26:39,627 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 06:26:39,627 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 06:26:39,628 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-15 06:26:39,644 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-04-15 06:26:39,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:26:39,672 INFO L263 TraceCheckSpWp]: Trace formula consists of 85 conjuncts, 18 conjunts are in the unsatisfiable core [2022-04-15 06:26:39,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:26:39,679 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 06:26:39,986 INFO L272 TraceCheckUtils]: 0: Hoare triple {1860#true} call ULTIMATE.init(); {1860#true} is VALID [2022-04-15 06:26:39,986 INFO L290 TraceCheckUtils]: 1: Hoare triple {1860#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(11, 2);call #Ultimate.allocInit(12, 3);~last~0 := 0; {1860#true} is VALID [2022-04-15 06:26:39,986 INFO L290 TraceCheckUtils]: 2: Hoare triple {1860#true} assume true; {1860#true} is VALID [2022-04-15 06:26:39,986 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1860#true} {1860#true} #66#return; {1860#true} is VALID [2022-04-15 06:26:39,986 INFO L272 TraceCheckUtils]: 4: Hoare triple {1860#true} call #t~ret6 := main(); {1860#true} is VALID [2022-04-15 06:26:39,986 INFO L290 TraceCheckUtils]: 5: Hoare triple {1860#true} assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~last~0 := #t~nondet4;havoc #t~nondet4;~a~0 := 0;~b~0 := 0;~c~0 := 0;~st~0 := 0; {1865#(and (= main_~a~0 0) (= main_~b~0 0))} is VALID [2022-04-15 06:26:39,987 INFO L290 TraceCheckUtils]: 6: Hoare triple {1865#(and (= main_~a~0 0) (= main_~b~0 0))} assume !false;~st~0 := 1;~c~0 := 0; {1894#(and (= main_~a~0 0) (= main_~st~0 1) (= main_~b~0 0))} is VALID [2022-04-15 06:26:39,987 INFO L290 TraceCheckUtils]: 7: Hoare triple {1894#(and (= main_~a~0 0) (= main_~st~0 1) (= main_~b~0 0))} [82] L23-3-->L23-4_primed: Formula: (let ((.cse1 (= v_main_~c~0_63 v_main_~c~0_62)) (.cse2 (= |v_main_#t~post5_38| |v_main_#t~post5_36|)) (.cse0 (= v_~last~0_29 v_main_~c~0_63))) (or (and (or (not (<= (+ 1 v_main_~c~0_63) v_~last~0_29)) (not (<= (+ v_~last~0_29 1) v_main_~c~0_62))) (< v_main_~c~0_62 200001) (< v_main_~c~0_63 v_main_~c~0_62) (not .cse0)) (and .cse1 .cse2 (= v_~last~0_29 v_~last~0_29)) (and .cse1 .cse2 (or .cse0 (not (< v_main_~c~0_63 200000)))))) InVars {main_~c~0=v_main_~c~0_63, main_#t~post5=|v_main_#t~post5_38|, ~last~0=v_~last~0_29} OutVars{main_#t~post5=|v_main_#t~post5_36|, main_~c~0=v_main_~c~0_62, ~last~0=v_~last~0_29} AuxVars[] AssignedVars[main_#t~post5, main_~c~0] {1894#(and (= main_~a~0 0) (= main_~st~0 1) (= main_~b~0 0))} is VALID [2022-04-15 06:26:39,988 INFO L290 TraceCheckUtils]: 8: Hoare triple {1894#(and (= main_~a~0 0) (= main_~st~0 1) (= main_~b~0 0))} [83] L23-4_primed-->L23-3: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1894#(and (= main_~a~0 0) (= main_~st~0 1) (= main_~b~0 0))} is VALID [2022-04-15 06:26:39,989 INFO L290 TraceCheckUtils]: 9: Hoare triple {1894#(and (= main_~a~0 0) (= main_~st~0 1) (= main_~b~0 0))} [84] L23-3-->L23-4_primed: Formula: (let ((.cse0 (= v_main_~c~0_65 v_main_~c~0_64)) (.cse1 (= v_main_~st~0_30 v_main_~st~0_29)) (.cse3 (= v_~last~0_30 v_main_~c~0_65)) (.cse2 (< v_main_~c~0_65 200000))) (or (and .cse0 .cse1 (or (not .cse2) (not .cse3)) (= |v_main_#t~post5_37| |v_main_#t~post5_41|)) (and (= v_~last~0_30 v_~last~0_30) .cse0 (= |v_main_#t~post5_41| |v_main_#t~post5_37|) .cse1) (and .cse3 (= 0 v_main_~st~0_29) .cse2 (< v_main_~c~0_64 (+ 2 v_main_~c~0_65)) (< v_main_~c~0_65 v_main_~c~0_64)))) InVars {main_~c~0=v_main_~c~0_65, main_#t~post5=|v_main_#t~post5_41|, main_~st~0=v_main_~st~0_30, ~last~0=v_~last~0_30} OutVars{main_#t~post5=|v_main_#t~post5_37|, main_~c~0=v_main_~c~0_64, main_~st~0=v_main_~st~0_29, ~last~0=v_~last~0_30} AuxVars[] AssignedVars[main_#t~post5, main_~c~0, main_~st~0] {1904#(and (= main_~a~0 0) (= main_~b~0 0) (or (= main_~st~0 1) (and (< ~last~0 200000) (< ~last~0 main_~c~0) (< main_~c~0 (+ ~last~0 2)) (= main_~st~0 0))))} is VALID [2022-04-15 06:26:39,989 INFO L290 TraceCheckUtils]: 10: Hoare triple {1904#(and (= main_~a~0 0) (= main_~b~0 0) (or (= main_~st~0 1) (and (< ~last~0 200000) (< ~last~0 main_~c~0) (< main_~c~0 (+ ~last~0 2)) (= main_~st~0 0))))} [81] L23-4_primed-->L23-4: Formula: (not (< v_main_~c~0_8 200000)) InVars {main_~c~0=v_main_~c~0_8} OutVars{main_~c~0=v_main_~c~0_8} AuxVars[] AssignedVars[] {1908#(and (= main_~a~0 0) (or (and (< ~last~0 200000) (< main_~c~0 (+ ~last~0 2)) (= main_~st~0 0)) (= main_~st~0 1)) (= main_~b~0 0) (not (< main_~c~0 200000)))} is VALID [2022-04-15 06:26:39,990 INFO L290 TraceCheckUtils]: 11: Hoare triple {1908#(and (= main_~a~0 0) (or (and (< ~last~0 200000) (< main_~c~0 (+ ~last~0 2)) (= main_~st~0 0)) (= main_~st~0 1)) (= main_~b~0 0) (not (< main_~c~0 200000)))} assume 0 == ~st~0 && ~c~0 == 1 + ~last~0;~a~0 := 3 + ~a~0;~b~0 := 3 + ~b~0; {1912#(and (= main_~b~0 3) (<= 200000 main_~c~0) (< main_~c~0 200001) (= main_~a~0 3))} is VALID [2022-04-15 06:26:39,990 INFO L290 TraceCheckUtils]: 12: Hoare triple {1912#(and (= main_~b~0 3) (<= 200000 main_~c~0) (< main_~c~0 200001) (= main_~a~0 3))} assume !(~c~0 == ~last~0 && 0 == ~st~0); {1912#(and (= main_~b~0 3) (<= 200000 main_~c~0) (< main_~c~0 200001) (= main_~a~0 3))} is VALID [2022-04-15 06:26:39,992 INFO L272 TraceCheckUtils]: 13: Hoare triple {1912#(and (= main_~b~0 3) (<= 200000 main_~c~0) (< main_~c~0 200001) (= main_~a~0 3))} call __VERIFIER_assert((if ~a~0 == ~b~0 && 200000 == ~c~0 then 1 else 0)); {1919#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-15 06:26:39,992 INFO L290 TraceCheckUtils]: 14: Hoare triple {1919#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {1923#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-15 06:26:39,993 INFO L290 TraceCheckUtils]: 15: Hoare triple {1923#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {1861#false} is VALID [2022-04-15 06:26:39,993 INFO L290 TraceCheckUtils]: 16: Hoare triple {1861#false} assume !false; {1861#false} is VALID [2022-04-15 06:26:39,993 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-04-15 06:26:39,993 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 06:26:40,340 INFO L290 TraceCheckUtils]: 16: Hoare triple {1861#false} assume !false; {1861#false} is VALID [2022-04-15 06:26:40,342 INFO L290 TraceCheckUtils]: 15: Hoare triple {1923#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {1861#false} is VALID [2022-04-15 06:26:40,342 INFO L290 TraceCheckUtils]: 14: Hoare triple {1919#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {1923#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-15 06:26:40,343 INFO L272 TraceCheckUtils]: 13: Hoare triple {1869#(and (<= main_~b~0 main_~a~0) (< main_~a~0 (+ main_~b~0 1)) (< 199999 main_~c~0) (<= main_~c~0 200000))} call __VERIFIER_assert((if ~a~0 == ~b~0 && 200000 == ~c~0 then 1 else 0)); {1919#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-15 06:26:40,344 INFO L290 TraceCheckUtils]: 12: Hoare triple {1869#(and (<= main_~b~0 main_~a~0) (< main_~a~0 (+ main_~b~0 1)) (< 199999 main_~c~0) (<= main_~c~0 200000))} assume !(~c~0 == ~last~0 && 0 == ~st~0); {1869#(and (<= main_~b~0 main_~a~0) (< main_~a~0 (+ main_~b~0 1)) (< 199999 main_~c~0) (<= main_~c~0 200000))} is VALID [2022-04-15 06:26:40,345 INFO L290 TraceCheckUtils]: 11: Hoare triple {1945#(or (not (<= main_~c~0 (+ ~last~0 1))) (and (<= main_~b~0 main_~a~0) (< main_~a~0 (+ main_~b~0 1)) (< 199999 main_~c~0) (<= main_~c~0 200000)) (not (= main_~st~0 0)))} assume 0 == ~st~0 && ~c~0 == 1 + ~last~0;~a~0 := 3 + ~a~0;~b~0 := 3 + ~b~0; {1869#(and (<= main_~b~0 main_~a~0) (< main_~a~0 (+ main_~b~0 1)) (< 199999 main_~c~0) (<= main_~c~0 200000))} is VALID [2022-04-15 06:26:40,345 INFO L290 TraceCheckUtils]: 10: Hoare triple {1949#(or (not (<= main_~c~0 (+ ~last~0 1))) (and (<= main_~b~0 main_~a~0) (< main_~a~0 (+ main_~b~0 1)) (<= main_~c~0 200000)) (not (= main_~st~0 0)) (< main_~c~0 200000))} [81] L23-4_primed-->L23-4: Formula: (not (< v_main_~c~0_8 200000)) InVars {main_~c~0=v_main_~c~0_8} OutVars{main_~c~0=v_main_~c~0_8} AuxVars[] AssignedVars[] {1945#(or (not (<= main_~c~0 (+ ~last~0 1))) (and (<= main_~b~0 main_~a~0) (< main_~a~0 (+ main_~b~0 1)) (< 199999 main_~c~0) (<= main_~c~0 200000)) (not (= main_~st~0 0)))} is VALID [2022-04-15 06:26:40,346 INFO L290 TraceCheckUtils]: 9: Hoare triple {1953#(and (<= main_~b~0 main_~a~0) (< main_~a~0 (+ main_~b~0 1)) (not (= main_~st~0 0)))} [84] L23-3-->L23-4_primed: Formula: (let ((.cse0 (= v_main_~c~0_65 v_main_~c~0_64)) (.cse1 (= v_main_~st~0_30 v_main_~st~0_29)) (.cse3 (= v_~last~0_30 v_main_~c~0_65)) (.cse2 (< v_main_~c~0_65 200000))) (or (and .cse0 .cse1 (or (not .cse2) (not .cse3)) (= |v_main_#t~post5_37| |v_main_#t~post5_41|)) (and (= v_~last~0_30 v_~last~0_30) .cse0 (= |v_main_#t~post5_41| |v_main_#t~post5_37|) .cse1) (and .cse3 (= 0 v_main_~st~0_29) .cse2 (< v_main_~c~0_64 (+ 2 v_main_~c~0_65)) (< v_main_~c~0_65 v_main_~c~0_64)))) InVars {main_~c~0=v_main_~c~0_65, main_#t~post5=|v_main_#t~post5_41|, main_~st~0=v_main_~st~0_30, ~last~0=v_~last~0_30} OutVars{main_#t~post5=|v_main_#t~post5_37|, main_~c~0=v_main_~c~0_64, main_~st~0=v_main_~st~0_29, ~last~0=v_~last~0_30} AuxVars[] AssignedVars[main_#t~post5, main_~c~0, main_~st~0] {1949#(or (not (<= main_~c~0 (+ ~last~0 1))) (and (<= main_~b~0 main_~a~0) (< main_~a~0 (+ main_~b~0 1)) (<= main_~c~0 200000)) (not (= main_~st~0 0)) (< main_~c~0 200000))} is VALID [2022-04-15 06:26:40,346 INFO L290 TraceCheckUtils]: 8: Hoare triple {1953#(and (<= main_~b~0 main_~a~0) (< main_~a~0 (+ main_~b~0 1)) (not (= main_~st~0 0)))} [83] L23-4_primed-->L23-3: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1953#(and (<= main_~b~0 main_~a~0) (< main_~a~0 (+ main_~b~0 1)) (not (= main_~st~0 0)))} is VALID [2022-04-15 06:26:40,347 INFO L290 TraceCheckUtils]: 7: Hoare triple {1953#(and (<= main_~b~0 main_~a~0) (< main_~a~0 (+ main_~b~0 1)) (not (= main_~st~0 0)))} [82] L23-3-->L23-4_primed: Formula: (let ((.cse1 (= v_main_~c~0_63 v_main_~c~0_62)) (.cse2 (= |v_main_#t~post5_38| |v_main_#t~post5_36|)) (.cse0 (= v_~last~0_29 v_main_~c~0_63))) (or (and (or (not (<= (+ 1 v_main_~c~0_63) v_~last~0_29)) (not (<= (+ v_~last~0_29 1) v_main_~c~0_62))) (< v_main_~c~0_62 200001) (< v_main_~c~0_63 v_main_~c~0_62) (not .cse0)) (and .cse1 .cse2 (= v_~last~0_29 v_~last~0_29)) (and .cse1 .cse2 (or .cse0 (not (< v_main_~c~0_63 200000)))))) InVars {main_~c~0=v_main_~c~0_63, main_#t~post5=|v_main_#t~post5_38|, ~last~0=v_~last~0_29} OutVars{main_#t~post5=|v_main_#t~post5_36|, main_~c~0=v_main_~c~0_62, ~last~0=v_~last~0_29} AuxVars[] AssignedVars[main_#t~post5, main_~c~0] {1953#(and (<= main_~b~0 main_~a~0) (< main_~a~0 (+ main_~b~0 1)) (not (= main_~st~0 0)))} is VALID [2022-04-15 06:26:40,347 INFO L290 TraceCheckUtils]: 6: Hoare triple {1963#(and (<= main_~b~0 main_~a~0) (< main_~a~0 (+ main_~b~0 1)))} assume !false;~st~0 := 1;~c~0 := 0; {1953#(and (<= main_~b~0 main_~a~0) (< main_~a~0 (+ main_~b~0 1)) (not (= main_~st~0 0)))} is VALID [2022-04-15 06:26:40,347 INFO L290 TraceCheckUtils]: 5: Hoare triple {1860#true} assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~last~0 := #t~nondet4;havoc #t~nondet4;~a~0 := 0;~b~0 := 0;~c~0 := 0;~st~0 := 0; {1963#(and (<= main_~b~0 main_~a~0) (< main_~a~0 (+ main_~b~0 1)))} is VALID [2022-04-15 06:26:40,348 INFO L272 TraceCheckUtils]: 4: Hoare triple {1860#true} call #t~ret6 := main(); {1860#true} is VALID [2022-04-15 06:26:40,348 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1860#true} {1860#true} #66#return; {1860#true} is VALID [2022-04-15 06:26:40,348 INFO L290 TraceCheckUtils]: 2: Hoare triple {1860#true} assume true; {1860#true} is VALID [2022-04-15 06:26:40,348 INFO L290 TraceCheckUtils]: 1: Hoare triple {1860#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(11, 2);call #Ultimate.allocInit(12, 3);~last~0 := 0; {1860#true} is VALID [2022-04-15 06:26:40,348 INFO L272 TraceCheckUtils]: 0: Hoare triple {1860#true} call ULTIMATE.init(); {1860#true} is VALID [2022-04-15 06:26:40,348 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-04-15 06:26:40,348 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [812384095] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 06:26:40,348 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 06:26:40,348 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9, 9] total 20 [2022-04-15 06:26:40,724 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 06:26:40,724 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1916495635] [2022-04-15 06:26:40,724 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1916495635] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 06:26:40,724 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 06:26:40,724 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2022-04-15 06:26:40,724 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1503234311] [2022-04-15 06:26:40,724 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 06:26:40,725 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 1.1875) internal successors, (19), 14 states have internal predecessors, (19), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 23 [2022-04-15 06:26:40,725 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 06:26:40,725 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 16 states, 16 states have (on average 1.1875) internal successors, (19), 14 states have internal predecessors, (19), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:26:40,743 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 23 edges. 23 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 06:26:40,743 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2022-04-15 06:26:40,743 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 06:26:40,743 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-04-15 06:26:40,744 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=138, Invalid=618, Unknown=0, NotChecked=0, Total=756 [2022-04-15 06:26:40,744 INFO L87 Difference]: Start difference. First operand 51 states and 62 transitions. Second operand has 16 states, 16 states have (on average 1.1875) internal successors, (19), 14 states have internal predecessors, (19), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:26:41,421 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:26:41,421 INFO L93 Difference]: Finished difference Result 103 states and 126 transitions. [2022-04-15 06:26:41,421 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-04-15 06:26:41,421 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 1.1875) internal successors, (19), 14 states have internal predecessors, (19), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 23 [2022-04-15 06:26:41,421 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 06:26:41,422 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16 states, 16 states have (on average 1.1875) internal successors, (19), 14 states have internal predecessors, (19), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:26:41,424 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 73 transitions. [2022-04-15 06:26:41,425 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16 states, 16 states have (on average 1.1875) internal successors, (19), 14 states have internal predecessors, (19), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:26:41,426 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 73 transitions. [2022-04-15 06:26:41,426 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 17 states and 73 transitions. [2022-04-15 06:26:41,511 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 73 edges. 73 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 06:26:41,514 INFO L225 Difference]: With dead ends: 103 [2022-04-15 06:26:41,514 INFO L226 Difference]: Without dead ends: 79 [2022-04-15 06:26:41,514 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 28 SyntacticMatches, 2 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 341 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=173, Invalid=883, Unknown=0, NotChecked=0, Total=1056 [2022-04-15 06:26:41,515 INFO L913 BasicCegarLoop]: 19 mSDtfsCounter, 27 mSDsluCounter, 55 mSDsCounter, 0 mSdLazyCounter, 300 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 28 SdHoareTripleChecker+Valid, 74 SdHoareTripleChecker+Invalid, 352 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 300 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 40 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-04-15 06:26:41,515 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [28 Valid, 74 Invalid, 352 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 300 Invalid, 0 Unknown, 40 Unchecked, 0.2s Time] [2022-04-15 06:26:41,517 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2022-04-15 06:26:41,595 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 54. [2022-04-15 06:26:41,595 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 06:26:41,595 INFO L82 GeneralOperation]: Start isEquivalent. First operand 79 states. Second operand has 54 states, 46 states have (on average 1.2826086956521738) internal successors, (59), 47 states have internal predecessors, (59), 4 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-15 06:26:41,595 INFO L74 IsIncluded]: Start isIncluded. First operand 79 states. Second operand has 54 states, 46 states have (on average 1.2826086956521738) internal successors, (59), 47 states have internal predecessors, (59), 4 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-15 06:26:41,596 INFO L87 Difference]: Start difference. First operand 79 states. Second operand has 54 states, 46 states have (on average 1.2826086956521738) internal successors, (59), 47 states have internal predecessors, (59), 4 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-15 06:26:41,604 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:26:41,605 INFO L93 Difference]: Finished difference Result 79 states and 94 transitions. [2022-04-15 06:26:41,605 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 94 transitions. [2022-04-15 06:26:41,605 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 06:26:41,605 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 06:26:41,605 INFO L74 IsIncluded]: Start isIncluded. First operand has 54 states, 46 states have (on average 1.2826086956521738) internal successors, (59), 47 states have internal predecessors, (59), 4 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) Second operand 79 states. [2022-04-15 06:26:41,605 INFO L87 Difference]: Start difference. First operand has 54 states, 46 states have (on average 1.2826086956521738) internal successors, (59), 47 states have internal predecessors, (59), 4 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) Second operand 79 states. [2022-04-15 06:26:41,607 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:26:41,607 INFO L93 Difference]: Finished difference Result 79 states and 94 transitions. [2022-04-15 06:26:41,607 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 94 transitions. [2022-04-15 06:26:41,608 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 06:26:41,608 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 06:26:41,608 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 06:26:41,608 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 06:26:41,608 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 54 states, 46 states have (on average 1.2826086956521738) internal successors, (59), 47 states have internal predecessors, (59), 4 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-15 06:26:41,610 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 66 transitions. [2022-04-15 06:26:41,610 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 66 transitions. Word has length 23 [2022-04-15 06:26:41,610 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 06:26:41,610 INFO L478 AbstractCegarLoop]: Abstraction has 54 states and 66 transitions. [2022-04-15 06:26:41,610 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 1.1875) internal successors, (19), 14 states have internal predecessors, (19), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:26:41,610 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 54 states and 66 transitions. [2022-04-15 06:26:41,688 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 66 edges. 66 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 06:26:41,688 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 66 transitions. [2022-04-15 06:26:41,688 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2022-04-15 06:26:41,688 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 06:26:41,688 INFO L499 BasicCegarLoop]: trace histogram [4, 4, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 06:26:41,707 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-15 06:26:41,904 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable6 [2022-04-15 06:26:41,905 INFO L403 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 06:26:41,905 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 06:26:41,905 INFO L85 PathProgramCache]: Analyzing trace with hash -360688409, now seen corresponding path program 3 times [2022-04-15 06:26:41,905 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 06:26:41,905 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1806274008] [2022-04-15 06:26:42,732 WARN L970 rdanLoopAcceleration]: Unable to prove correctness of quantifier elimination. [2022-04-15 06:26:46,750 WARN L977 rdanLoopAcceleration]: Unable to prove correctness of quantifier elimination. [2022-04-15 06:26:46,860 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 1 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-15 06:26:47,073 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {0={1=1}, 1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-15 06:26:47,074 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-15 06:26:47,076 INFO L85 PathProgramCache]: Analyzing trace with hash -1845391160, now seen corresponding path program 1 times [2022-04-15 06:26:47,076 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 06:26:47,076 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [58474028] [2022-04-15 06:26:47,076 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 06:26:47,077 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 06:26:47,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:26:47,189 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 06:26:47,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:26:47,198 INFO L290 TraceCheckUtils]: 0: Hoare triple {2486#(and (= ~last~0 |old(~last~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(11, 2);call #Ultimate.allocInit(12, 3);~last~0 := 0; {2474#true} is VALID [2022-04-15 06:26:47,198 INFO L290 TraceCheckUtils]: 1: Hoare triple {2474#true} assume true; {2474#true} is VALID [2022-04-15 06:26:47,198 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {2474#true} {2474#true} #66#return; {2474#true} is VALID [2022-04-15 06:26:47,199 INFO L272 TraceCheckUtils]: 0: Hoare triple {2474#true} call ULTIMATE.init(); {2486#(and (= ~last~0 |old(~last~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 06:26:47,199 INFO L290 TraceCheckUtils]: 1: Hoare triple {2486#(and (= ~last~0 |old(~last~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(11, 2);call #Ultimate.allocInit(12, 3);~last~0 := 0; {2474#true} is VALID [2022-04-15 06:26:47,199 INFO L290 TraceCheckUtils]: 2: Hoare triple {2474#true} assume true; {2474#true} is VALID [2022-04-15 06:26:47,199 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2474#true} {2474#true} #66#return; {2474#true} is VALID [2022-04-15 06:26:47,199 INFO L272 TraceCheckUtils]: 4: Hoare triple {2474#true} call #t~ret6 := main(); {2474#true} is VALID [2022-04-15 06:26:47,199 INFO L290 TraceCheckUtils]: 5: Hoare triple {2474#true} assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~last~0 := #t~nondet4;havoc #t~nondet4;~a~0 := 0;~b~0 := 0;~c~0 := 0;~st~0 := 0; {2479#(and (= main_~a~0 0) (= main_~b~0 0))} is VALID [2022-04-15 06:26:47,200 INFO L290 TraceCheckUtils]: 6: Hoare triple {2479#(and (= main_~a~0 0) (= main_~b~0 0))} assume !false;~st~0 := 1;~c~0 := 0; {2480#(and (= main_~a~0 0) (= main_~st~0 1) (= main_~b~0 0))} is VALID [2022-04-15 06:26:47,200 INFO L290 TraceCheckUtils]: 7: Hoare triple {2480#(and (= main_~a~0 0) (= main_~st~0 1) (= main_~b~0 0))} [86] L23-3-->L23-4_primed: Formula: (let ((.cse0 (= v_main_~c~0_83 v_main_~c~0_82)) (.cse2 (= |v_main_#t~post5_51| |v_main_#t~post5_49|)) (.cse1 (= v_~last~0_37 v_main_~c~0_83))) (or (and .cse0 (or (not (< v_main_~c~0_83 200000)) .cse1) .cse2) (and (= v_~last~0_37 v_~last~0_37) .cse0 .cse2) (and (or (not (<= (+ v_~last~0_37 1) v_main_~c~0_82)) (not (<= (+ 1 v_main_~c~0_83) v_~last~0_37))) (< v_main_~c~0_83 v_main_~c~0_82) (not .cse1) (< v_main_~c~0_82 200001)))) InVars {main_~c~0=v_main_~c~0_83, main_#t~post5=|v_main_#t~post5_51|, ~last~0=v_~last~0_37} OutVars{main_#t~post5=|v_main_#t~post5_49|, main_~c~0=v_main_~c~0_82, ~last~0=v_~last~0_37} AuxVars[] AssignedVars[main_#t~post5, main_~c~0] {2480#(and (= main_~a~0 0) (= main_~st~0 1) (= main_~b~0 0))} is VALID [2022-04-15 06:26:47,201 INFO L290 TraceCheckUtils]: 8: Hoare triple {2480#(and (= main_~a~0 0) (= main_~st~0 1) (= main_~b~0 0))} [87] L23-4_primed-->L23-3: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2480#(and (= main_~a~0 0) (= main_~st~0 1) (= main_~b~0 0))} is VALID [2022-04-15 06:26:47,202 INFO L290 TraceCheckUtils]: 9: Hoare triple {2480#(and (= main_~a~0 0) (= main_~st~0 1) (= main_~b~0 0))} [88] L23-3-->L23-4_primed: Formula: (let ((.cse1 (< v_main_~c~0_85 200000)) (.cse2 (= v_~last~0_38 v_main_~c~0_85)) (.cse0 (= |v_main_#t~post5_54| |v_main_#t~post5_50|)) (.cse3 (= v_main_~st~0_39 v_main_~st~0_38)) (.cse4 (= v_main_~c~0_85 v_main_~c~0_84))) (or (and .cse0 (or (not .cse1) (not .cse2)) .cse3 .cse4) (and (< v_main_~c~0_85 v_main_~c~0_84) .cse1 .cse2 (< v_main_~c~0_84 (+ 2 v_main_~c~0_85)) (= 0 v_main_~st~0_38)) (and .cse0 (= v_~last~0_38 v_~last~0_38) .cse3 .cse4))) InVars {main_~c~0=v_main_~c~0_85, main_#t~post5=|v_main_#t~post5_54|, main_~st~0=v_main_~st~0_39, ~last~0=v_~last~0_38} OutVars{main_#t~post5=|v_main_#t~post5_50|, main_~c~0=v_main_~c~0_84, main_~st~0=v_main_~st~0_38, ~last~0=v_~last~0_38} AuxVars[] AssignedVars[main_#t~post5, main_~c~0, main_~st~0] {2481#(or (and (= main_~a~0 0) (= main_~b~0 0) (<= main_~c~0 200000)) (= main_~st~0 1))} is VALID [2022-04-15 06:26:47,202 INFO L290 TraceCheckUtils]: 10: Hoare triple {2481#(or (and (= main_~a~0 0) (= main_~b~0 0) (<= main_~c~0 200000)) (= main_~st~0 1))} [85] L23-4_primed-->L23-4: Formula: (not (< v_main_~c~0_8 200000)) InVars {main_~c~0=v_main_~c~0_8} OutVars{main_~c~0=v_main_~c~0_8} AuxVars[] AssignedVars[] {2482#(or (and (= main_~a~0 0) (= main_~b~0 0) (< 199999 main_~c~0) (<= main_~c~0 200000)) (= main_~st~0 1))} is VALID [2022-04-15 06:26:47,203 INFO L290 TraceCheckUtils]: 11: Hoare triple {2482#(or (and (= main_~a~0 0) (= main_~b~0 0) (< 199999 main_~c~0) (<= main_~c~0 200000)) (= main_~st~0 1))} assume 0 == ~st~0 && ~c~0 == 1 + ~last~0;~a~0 := 3 + ~a~0;~b~0 := 3 + ~b~0; {2483#(and (<= main_~b~0 main_~a~0) (< main_~a~0 (+ main_~b~0 1)) (< 199999 main_~c~0) (<= main_~c~0 200000))} is VALID [2022-04-15 06:26:47,203 INFO L290 TraceCheckUtils]: 12: Hoare triple {2483#(and (<= main_~b~0 main_~a~0) (< main_~a~0 (+ main_~b~0 1)) (< 199999 main_~c~0) (<= main_~c~0 200000))} assume !(~c~0 == ~last~0 && 0 == ~st~0); {2483#(and (<= main_~b~0 main_~a~0) (< main_~a~0 (+ main_~b~0 1)) (< 199999 main_~c~0) (<= main_~c~0 200000))} is VALID [2022-04-15 06:26:47,204 INFO L272 TraceCheckUtils]: 13: Hoare triple {2483#(and (<= main_~b~0 main_~a~0) (< main_~a~0 (+ main_~b~0 1)) (< 199999 main_~c~0) (<= main_~c~0 200000))} call __VERIFIER_assert((if ~a~0 == ~b~0 && 200000 == ~c~0 then 1 else 0)); {2484#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-15 06:26:47,205 INFO L290 TraceCheckUtils]: 14: Hoare triple {2484#(not (= |__VERIFIER_assert_#in~cond| 0))} ~cond := #in~cond; {2485#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-15 06:26:47,205 INFO L290 TraceCheckUtils]: 15: Hoare triple {2485#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {2475#false} is VALID [2022-04-15 06:26:47,205 INFO L290 TraceCheckUtils]: 16: Hoare triple {2475#false} assume !false; {2475#false} is VALID [2022-04-15 06:26:47,205 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-04-15 06:26:47,206 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 06:26:47,206 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [58474028] [2022-04-15 06:26:47,206 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [58474028] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 06:26:47,206 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1220625774] [2022-04-15 06:26:47,206 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 06:26:47,206 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 06:26:47,206 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 06:26:47,207 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-15 06:26:47,208 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-04-15 06:26:47,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:26:47,248 INFO L263 TraceCheckSpWp]: Trace formula consists of 85 conjuncts, 18 conjunts are in the unsatisfiable core [2022-04-15 06:26:47,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:26:47,256 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 06:26:47,532 INFO L272 TraceCheckUtils]: 0: Hoare triple {2474#true} call ULTIMATE.init(); {2474#true} is VALID [2022-04-15 06:26:47,532 INFO L290 TraceCheckUtils]: 1: Hoare triple {2474#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(11, 2);call #Ultimate.allocInit(12, 3);~last~0 := 0; {2474#true} is VALID [2022-04-15 06:26:47,532 INFO L290 TraceCheckUtils]: 2: Hoare triple {2474#true} assume true; {2474#true} is VALID [2022-04-15 06:26:47,532 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2474#true} {2474#true} #66#return; {2474#true} is VALID [2022-04-15 06:26:47,532 INFO L272 TraceCheckUtils]: 4: Hoare triple {2474#true} call #t~ret6 := main(); {2474#true} is VALID [2022-04-15 06:26:47,533 INFO L290 TraceCheckUtils]: 5: Hoare triple {2474#true} assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~last~0 := #t~nondet4;havoc #t~nondet4;~a~0 := 0;~b~0 := 0;~c~0 := 0;~st~0 := 0; {2479#(and (= main_~a~0 0) (= main_~b~0 0))} is VALID [2022-04-15 06:26:47,533 INFO L290 TraceCheckUtils]: 6: Hoare triple {2479#(and (= main_~a~0 0) (= main_~b~0 0))} assume !false;~st~0 := 1;~c~0 := 0; {2480#(and (= main_~a~0 0) (= main_~st~0 1) (= main_~b~0 0))} is VALID [2022-04-15 06:26:47,534 INFO L290 TraceCheckUtils]: 7: Hoare triple {2480#(and (= main_~a~0 0) (= main_~st~0 1) (= main_~b~0 0))} [86] L23-3-->L23-4_primed: Formula: (let ((.cse0 (= v_main_~c~0_83 v_main_~c~0_82)) (.cse2 (= |v_main_#t~post5_51| |v_main_#t~post5_49|)) (.cse1 (= v_~last~0_37 v_main_~c~0_83))) (or (and .cse0 (or (not (< v_main_~c~0_83 200000)) .cse1) .cse2) (and (= v_~last~0_37 v_~last~0_37) .cse0 .cse2) (and (or (not (<= (+ v_~last~0_37 1) v_main_~c~0_82)) (not (<= (+ 1 v_main_~c~0_83) v_~last~0_37))) (< v_main_~c~0_83 v_main_~c~0_82) (not .cse1) (< v_main_~c~0_82 200001)))) InVars {main_~c~0=v_main_~c~0_83, main_#t~post5=|v_main_#t~post5_51|, ~last~0=v_~last~0_37} OutVars{main_#t~post5=|v_main_#t~post5_49|, main_~c~0=v_main_~c~0_82, ~last~0=v_~last~0_37} AuxVars[] AssignedVars[main_#t~post5, main_~c~0] {2480#(and (= main_~a~0 0) (= main_~st~0 1) (= main_~b~0 0))} is VALID [2022-04-15 06:26:47,534 INFO L290 TraceCheckUtils]: 8: Hoare triple {2480#(and (= main_~a~0 0) (= main_~st~0 1) (= main_~b~0 0))} [87] L23-4_primed-->L23-3: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2480#(and (= main_~a~0 0) (= main_~st~0 1) (= main_~b~0 0))} is VALID [2022-04-15 06:26:47,535 INFO L290 TraceCheckUtils]: 9: Hoare triple {2480#(and (= main_~a~0 0) (= main_~st~0 1) (= main_~b~0 0))} [88] L23-3-->L23-4_primed: Formula: (let ((.cse1 (< v_main_~c~0_85 200000)) (.cse2 (= v_~last~0_38 v_main_~c~0_85)) (.cse0 (= |v_main_#t~post5_54| |v_main_#t~post5_50|)) (.cse3 (= v_main_~st~0_39 v_main_~st~0_38)) (.cse4 (= v_main_~c~0_85 v_main_~c~0_84))) (or (and .cse0 (or (not .cse1) (not .cse2)) .cse3 .cse4) (and (< v_main_~c~0_85 v_main_~c~0_84) .cse1 .cse2 (< v_main_~c~0_84 (+ 2 v_main_~c~0_85)) (= 0 v_main_~st~0_38)) (and .cse0 (= v_~last~0_38 v_~last~0_38) .cse3 .cse4))) InVars {main_~c~0=v_main_~c~0_85, main_#t~post5=|v_main_#t~post5_54|, main_~st~0=v_main_~st~0_39, ~last~0=v_~last~0_38} OutVars{main_#t~post5=|v_main_#t~post5_50|, main_~c~0=v_main_~c~0_84, main_~st~0=v_main_~st~0_38, ~last~0=v_~last~0_38} AuxVars[] AssignedVars[main_#t~post5, main_~c~0, main_~st~0] {2517#(and (= main_~a~0 0) (= main_~b~0 0) (or (= main_~st~0 1) (and (< ~last~0 200000) (< ~last~0 main_~c~0) (< main_~c~0 (+ ~last~0 2)) (= main_~st~0 0))))} is VALID [2022-04-15 06:26:47,535 INFO L290 TraceCheckUtils]: 10: Hoare triple {2517#(and (= main_~a~0 0) (= main_~b~0 0) (or (= main_~st~0 1) (and (< ~last~0 200000) (< ~last~0 main_~c~0) (< main_~c~0 (+ ~last~0 2)) (= main_~st~0 0))))} [85] L23-4_primed-->L23-4: Formula: (not (< v_main_~c~0_8 200000)) InVars {main_~c~0=v_main_~c~0_8} OutVars{main_~c~0=v_main_~c~0_8} AuxVars[] AssignedVars[] {2521#(and (= main_~a~0 0) (or (and (< ~last~0 200000) (< main_~c~0 (+ ~last~0 2)) (= main_~st~0 0)) (= main_~st~0 1)) (= main_~b~0 0) (not (< main_~c~0 200000)))} is VALID [2022-04-15 06:26:47,536 INFO L290 TraceCheckUtils]: 11: Hoare triple {2521#(and (= main_~a~0 0) (or (and (< ~last~0 200000) (< main_~c~0 (+ ~last~0 2)) (= main_~st~0 0)) (= main_~st~0 1)) (= main_~b~0 0) (not (< main_~c~0 200000)))} assume 0 == ~st~0 && ~c~0 == 1 + ~last~0;~a~0 := 3 + ~a~0;~b~0 := 3 + ~b~0; {2525#(and (= main_~b~0 3) (<= 200000 main_~c~0) (< main_~c~0 200001) (= main_~a~0 3))} is VALID [2022-04-15 06:26:47,536 INFO L290 TraceCheckUtils]: 12: Hoare triple {2525#(and (= main_~b~0 3) (<= 200000 main_~c~0) (< main_~c~0 200001) (= main_~a~0 3))} assume !(~c~0 == ~last~0 && 0 == ~st~0); {2525#(and (= main_~b~0 3) (<= 200000 main_~c~0) (< main_~c~0 200001) (= main_~a~0 3))} is VALID [2022-04-15 06:26:47,537 INFO L272 TraceCheckUtils]: 13: Hoare triple {2525#(and (= main_~b~0 3) (<= 200000 main_~c~0) (< main_~c~0 200001) (= main_~a~0 3))} call __VERIFIER_assert((if ~a~0 == ~b~0 && 200000 == ~c~0 then 1 else 0)); {2532#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-15 06:26:47,537 INFO L290 TraceCheckUtils]: 14: Hoare triple {2532#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {2536#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-15 06:26:47,538 INFO L290 TraceCheckUtils]: 15: Hoare triple {2536#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {2475#false} is VALID [2022-04-15 06:26:47,538 INFO L290 TraceCheckUtils]: 16: Hoare triple {2475#false} assume !false; {2475#false} is VALID [2022-04-15 06:26:47,538 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-04-15 06:26:47,538 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 06:26:47,996 INFO L290 TraceCheckUtils]: 16: Hoare triple {2475#false} assume !false; {2475#false} is VALID [2022-04-15 06:26:47,997 INFO L290 TraceCheckUtils]: 15: Hoare triple {2536#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {2475#false} is VALID [2022-04-15 06:26:47,997 INFO L290 TraceCheckUtils]: 14: Hoare triple {2532#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {2536#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-15 06:26:47,998 INFO L272 TraceCheckUtils]: 13: Hoare triple {2483#(and (<= main_~b~0 main_~a~0) (< main_~a~0 (+ main_~b~0 1)) (< 199999 main_~c~0) (<= main_~c~0 200000))} call __VERIFIER_assert((if ~a~0 == ~b~0 && 200000 == ~c~0 then 1 else 0)); {2532#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-15 06:26:47,999 INFO L290 TraceCheckUtils]: 12: Hoare triple {2483#(and (<= main_~b~0 main_~a~0) (< main_~a~0 (+ main_~b~0 1)) (< 199999 main_~c~0) (<= main_~c~0 200000))} assume !(~c~0 == ~last~0 && 0 == ~st~0); {2483#(and (<= main_~b~0 main_~a~0) (< main_~a~0 (+ main_~b~0 1)) (< 199999 main_~c~0) (<= main_~c~0 200000))} is VALID [2022-04-15 06:26:48,000 INFO L290 TraceCheckUtils]: 11: Hoare triple {2558#(or (not (<= main_~c~0 (+ ~last~0 1))) (and (<= main_~b~0 main_~a~0) (< main_~a~0 (+ main_~b~0 1)) (< 199999 main_~c~0) (<= main_~c~0 200000)) (not (= main_~st~0 0)))} assume 0 == ~st~0 && ~c~0 == 1 + ~last~0;~a~0 := 3 + ~a~0;~b~0 := 3 + ~b~0; {2483#(and (<= main_~b~0 main_~a~0) (< main_~a~0 (+ main_~b~0 1)) (< 199999 main_~c~0) (<= main_~c~0 200000))} is VALID [2022-04-15 06:26:48,000 INFO L290 TraceCheckUtils]: 10: Hoare triple {2562#(or (not (<= main_~c~0 (+ ~last~0 1))) (and (<= main_~b~0 main_~a~0) (< main_~a~0 (+ main_~b~0 1)) (<= main_~c~0 200000)) (not (= main_~st~0 0)) (< main_~c~0 200000))} [85] L23-4_primed-->L23-4: Formula: (not (< v_main_~c~0_8 200000)) InVars {main_~c~0=v_main_~c~0_8} OutVars{main_~c~0=v_main_~c~0_8} AuxVars[] AssignedVars[] {2558#(or (not (<= main_~c~0 (+ ~last~0 1))) (and (<= main_~b~0 main_~a~0) (< main_~a~0 (+ main_~b~0 1)) (< 199999 main_~c~0) (<= main_~c~0 200000)) (not (= main_~st~0 0)))} is VALID [2022-04-15 06:26:48,001 INFO L290 TraceCheckUtils]: 9: Hoare triple {2566#(and (<= main_~b~0 main_~a~0) (< main_~a~0 (+ main_~b~0 1)) (not (= main_~st~0 0)))} [88] L23-3-->L23-4_primed: Formula: (let ((.cse1 (< v_main_~c~0_85 200000)) (.cse2 (= v_~last~0_38 v_main_~c~0_85)) (.cse0 (= |v_main_#t~post5_54| |v_main_#t~post5_50|)) (.cse3 (= v_main_~st~0_39 v_main_~st~0_38)) (.cse4 (= v_main_~c~0_85 v_main_~c~0_84))) (or (and .cse0 (or (not .cse1) (not .cse2)) .cse3 .cse4) (and (< v_main_~c~0_85 v_main_~c~0_84) .cse1 .cse2 (< v_main_~c~0_84 (+ 2 v_main_~c~0_85)) (= 0 v_main_~st~0_38)) (and .cse0 (= v_~last~0_38 v_~last~0_38) .cse3 .cse4))) InVars {main_~c~0=v_main_~c~0_85, main_#t~post5=|v_main_#t~post5_54|, main_~st~0=v_main_~st~0_39, ~last~0=v_~last~0_38} OutVars{main_#t~post5=|v_main_#t~post5_50|, main_~c~0=v_main_~c~0_84, main_~st~0=v_main_~st~0_38, ~last~0=v_~last~0_38} AuxVars[] AssignedVars[main_#t~post5, main_~c~0, main_~st~0] {2562#(or (not (<= main_~c~0 (+ ~last~0 1))) (and (<= main_~b~0 main_~a~0) (< main_~a~0 (+ main_~b~0 1)) (<= main_~c~0 200000)) (not (= main_~st~0 0)) (< main_~c~0 200000))} is VALID [2022-04-15 06:26:48,001 INFO L290 TraceCheckUtils]: 8: Hoare triple {2566#(and (<= main_~b~0 main_~a~0) (< main_~a~0 (+ main_~b~0 1)) (not (= main_~st~0 0)))} [87] L23-4_primed-->L23-3: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2566#(and (<= main_~b~0 main_~a~0) (< main_~a~0 (+ main_~b~0 1)) (not (= main_~st~0 0)))} is VALID [2022-04-15 06:26:48,002 INFO L290 TraceCheckUtils]: 7: Hoare triple {2566#(and (<= main_~b~0 main_~a~0) (< main_~a~0 (+ main_~b~0 1)) (not (= main_~st~0 0)))} [86] L23-3-->L23-4_primed: Formula: (let ((.cse0 (= v_main_~c~0_83 v_main_~c~0_82)) (.cse2 (= |v_main_#t~post5_51| |v_main_#t~post5_49|)) (.cse1 (= v_~last~0_37 v_main_~c~0_83))) (or (and .cse0 (or (not (< v_main_~c~0_83 200000)) .cse1) .cse2) (and (= v_~last~0_37 v_~last~0_37) .cse0 .cse2) (and (or (not (<= (+ v_~last~0_37 1) v_main_~c~0_82)) (not (<= (+ 1 v_main_~c~0_83) v_~last~0_37))) (< v_main_~c~0_83 v_main_~c~0_82) (not .cse1) (< v_main_~c~0_82 200001)))) InVars {main_~c~0=v_main_~c~0_83, main_#t~post5=|v_main_#t~post5_51|, ~last~0=v_~last~0_37} OutVars{main_#t~post5=|v_main_#t~post5_49|, main_~c~0=v_main_~c~0_82, ~last~0=v_~last~0_37} AuxVars[] AssignedVars[main_#t~post5, main_~c~0] {2566#(and (<= main_~b~0 main_~a~0) (< main_~a~0 (+ main_~b~0 1)) (not (= main_~st~0 0)))} is VALID [2022-04-15 06:26:48,003 INFO L290 TraceCheckUtils]: 6: Hoare triple {2576#(and (<= main_~b~0 main_~a~0) (< main_~a~0 (+ main_~b~0 1)))} assume !false;~st~0 := 1;~c~0 := 0; {2566#(and (<= main_~b~0 main_~a~0) (< main_~a~0 (+ main_~b~0 1)) (not (= main_~st~0 0)))} is VALID [2022-04-15 06:26:48,003 INFO L290 TraceCheckUtils]: 5: Hoare triple {2474#true} assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~last~0 := #t~nondet4;havoc #t~nondet4;~a~0 := 0;~b~0 := 0;~c~0 := 0;~st~0 := 0; {2576#(and (<= main_~b~0 main_~a~0) (< main_~a~0 (+ main_~b~0 1)))} is VALID [2022-04-15 06:26:48,003 INFO L272 TraceCheckUtils]: 4: Hoare triple {2474#true} call #t~ret6 := main(); {2474#true} is VALID [2022-04-15 06:26:48,003 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2474#true} {2474#true} #66#return; {2474#true} is VALID [2022-04-15 06:26:48,003 INFO L290 TraceCheckUtils]: 2: Hoare triple {2474#true} assume true; {2474#true} is VALID [2022-04-15 06:26:48,003 INFO L290 TraceCheckUtils]: 1: Hoare triple {2474#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(11, 2);call #Ultimate.allocInit(12, 3);~last~0 := 0; {2474#true} is VALID [2022-04-15 06:26:48,004 INFO L272 TraceCheckUtils]: 0: Hoare triple {2474#true} call ULTIMATE.init(); {2474#true} is VALID [2022-04-15 06:26:48,004 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-04-15 06:26:48,004 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1220625774] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 06:26:48,004 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 06:26:48,004 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9, 9] total 19 [2022-04-15 06:26:48,285 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 06:26:48,286 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1806274008] [2022-04-15 06:26:48,286 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1806274008] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 06:26:48,286 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 06:26:48,286 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2022-04-15 06:26:48,286 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1511246249] [2022-04-15 06:26:48,286 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 06:26:48,286 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 1.2222222222222223) internal successors, (22), 16 states have internal predecessors, (22), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 26 [2022-04-15 06:26:48,286 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 06:26:48,287 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 18 states, 18 states have (on average 1.2222222222222223) internal successors, (22), 16 states have internal predecessors, (22), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:26:48,308 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 26 edges. 26 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 06:26:48,308 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2022-04-15 06:26:48,308 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 06:26:48,309 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2022-04-15 06:26:48,309 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=141, Invalid=615, Unknown=0, NotChecked=0, Total=756 [2022-04-15 06:26:48,309 INFO L87 Difference]: Start difference. First operand 54 states and 66 transitions. Second operand has 18 states, 18 states have (on average 1.2222222222222223) internal successors, (22), 16 states have internal predecessors, (22), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:26:49,451 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:26:49,451 INFO L93 Difference]: Finished difference Result 112 states and 138 transitions. [2022-04-15 06:26:49,451 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2022-04-15 06:26:49,451 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 1.2222222222222223) internal successors, (22), 16 states have internal predecessors, (22), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 26 [2022-04-15 06:26:49,452 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 06:26:49,453 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18 states, 18 states have (on average 1.2222222222222223) internal successors, (22), 16 states have internal predecessors, (22), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:26:49,454 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 91 transitions. [2022-04-15 06:26:49,454 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18 states, 18 states have (on average 1.2222222222222223) internal successors, (22), 16 states have internal predecessors, (22), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:26:49,455 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 91 transitions. [2022-04-15 06:26:49,455 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 23 states and 91 transitions. [2022-04-15 06:26:49,517 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 91 edges. 91 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 06:26:49,518 INFO L225 Difference]: With dead ends: 112 [2022-04-15 06:26:49,518 INFO L226 Difference]: Without dead ends: 88 [2022-04-15 06:26:49,519 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 30 SyntacticMatches, 2 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 345 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=198, Invalid=992, Unknown=0, NotChecked=0, Total=1190 [2022-04-15 06:26:49,519 INFO L913 BasicCegarLoop]: 20 mSDtfsCounter, 33 mSDsluCounter, 72 mSDsCounter, 0 mSdLazyCounter, 595 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 35 SdHoareTripleChecker+Valid, 92 SdHoareTripleChecker+Invalid, 625 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 595 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-04-15 06:26:49,519 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [35 Valid, 92 Invalid, 625 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 595 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-04-15 06:26:49,520 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states. [2022-04-15 06:26:49,596 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 57. [2022-04-15 06:26:49,597 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 06:26:49,597 INFO L82 GeneralOperation]: Start isEquivalent. First operand 88 states. Second operand has 57 states, 49 states have (on average 1.2857142857142858) internal successors, (63), 50 states have internal predecessors, (63), 4 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-15 06:26:49,597 INFO L74 IsIncluded]: Start isIncluded. First operand 88 states. Second operand has 57 states, 49 states have (on average 1.2857142857142858) internal successors, (63), 50 states have internal predecessors, (63), 4 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-15 06:26:49,597 INFO L87 Difference]: Start difference. First operand 88 states. Second operand has 57 states, 49 states have (on average 1.2857142857142858) internal successors, (63), 50 states have internal predecessors, (63), 4 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-15 06:26:49,599 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:26:49,599 INFO L93 Difference]: Finished difference Result 88 states and 105 transitions. [2022-04-15 06:26:49,599 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 105 transitions. [2022-04-15 06:26:49,599 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 06:26:49,599 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 06:26:49,599 INFO L74 IsIncluded]: Start isIncluded. First operand has 57 states, 49 states have (on average 1.2857142857142858) internal successors, (63), 50 states have internal predecessors, (63), 4 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) Second operand 88 states. [2022-04-15 06:26:49,599 INFO L87 Difference]: Start difference. First operand has 57 states, 49 states have (on average 1.2857142857142858) internal successors, (63), 50 states have internal predecessors, (63), 4 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) Second operand 88 states. [2022-04-15 06:26:49,601 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:26:49,601 INFO L93 Difference]: Finished difference Result 88 states and 105 transitions. [2022-04-15 06:26:49,601 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 105 transitions. [2022-04-15 06:26:49,601 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 06:26:49,601 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 06:26:49,601 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 06:26:49,601 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 06:26:49,601 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 57 states, 49 states have (on average 1.2857142857142858) internal successors, (63), 50 states have internal predecessors, (63), 4 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-15 06:26:49,602 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 70 transitions. [2022-04-15 06:26:49,602 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 70 transitions. Word has length 26 [2022-04-15 06:26:49,602 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 06:26:49,603 INFO L478 AbstractCegarLoop]: Abstraction has 57 states and 70 transitions. [2022-04-15 06:26:49,603 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 1.2222222222222223) internal successors, (22), 16 states have internal predecessors, (22), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:26:49,603 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 57 states and 70 transitions. [2022-04-15 06:26:49,675 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 70 edges. 70 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 06:26:49,675 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 70 transitions. [2022-04-15 06:26:49,676 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2022-04-15 06:26:49,676 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 06:26:49,676 INFO L499 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 06:26:49,692 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2022-04-15 06:26:49,876 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 06:26:49,877 INFO L403 AbstractCegarLoop]: === Iteration 9 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 06:26:49,877 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 06:26:49,877 INFO L85 PathProgramCache]: Analyzing trace with hash -619739864, now seen corresponding path program 1 times [2022-04-15 06:26:49,877 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 06:26:49,877 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [127810467] [2022-04-15 06:26:49,960 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 4 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {0={1=2}, 1={1=1, 2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-15 06:26:50,003 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 4 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {0={1=2}, 1={1=1, 2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-15 06:26:50,003 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-15 06:26:50,003 INFO L85 PathProgramCache]: Analyzing trace with hash 256101655, now seen corresponding path program 1 times [2022-04-15 06:26:50,003 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 06:26:50,004 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [88503889] [2022-04-15 06:26:50,004 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 06:26:50,004 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 06:26:50,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:26:50,027 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 06:26:50,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:26:50,030 INFO L290 TraceCheckUtils]: 0: Hoare triple {3141#(and (= ~last~0 |old(~last~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(11, 2);call #Ultimate.allocInit(12, 3);~last~0 := 0; {3134#true} is VALID [2022-04-15 06:26:50,030 INFO L290 TraceCheckUtils]: 1: Hoare triple {3134#true} assume true; {3134#true} is VALID [2022-04-15 06:26:50,030 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {3134#true} {3134#true} #66#return; {3134#true} is VALID [2022-04-15 06:26:50,031 INFO L272 TraceCheckUtils]: 0: Hoare triple {3134#true} call ULTIMATE.init(); {3141#(and (= ~last~0 |old(~last~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 06:26:50,031 INFO L290 TraceCheckUtils]: 1: Hoare triple {3141#(and (= ~last~0 |old(~last~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(11, 2);call #Ultimate.allocInit(12, 3);~last~0 := 0; {3134#true} is VALID [2022-04-15 06:26:50,031 INFO L290 TraceCheckUtils]: 2: Hoare triple {3134#true} assume true; {3134#true} is VALID [2022-04-15 06:26:50,031 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3134#true} {3134#true} #66#return; {3134#true} is VALID [2022-04-15 06:26:50,031 INFO L272 TraceCheckUtils]: 4: Hoare triple {3134#true} call #t~ret6 := main(); {3134#true} is VALID [2022-04-15 06:26:50,031 INFO L290 TraceCheckUtils]: 5: Hoare triple {3134#true} assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~last~0 := #t~nondet4;havoc #t~nondet4;~a~0 := 0;~b~0 := 0;~c~0 := 0;~st~0 := 0; {3134#true} is VALID [2022-04-15 06:26:50,031 INFO L290 TraceCheckUtils]: 6: Hoare triple {3134#true} [90] L30-->L23-3_primed: Formula: (let ((.cse0 (= v_main_~b~0_22 v_main_~b~0_21)) (.cse1 (= v_main_~c~0_107 v_main_~c~0_105)) (.cse2 (= |v_main_#t~post5_63| |v_main_#t~post5_62|))) (or (and (= v_main_~st~0_49 v_main_~st~0_48) (= v_main_~a~0_25 v_main_~a~0_24) .cse0 .cse1 .cse2) (and (= v_main_~a~0_24 v_main_~a~0_25) .cse0 (= v_main_~st~0_48 v_main_~st~0_49) .cse1 .cse2))) InVars {main_~c~0=v_main_~c~0_107, main_#t~post5=|v_main_#t~post5_63|, main_~st~0=v_main_~st~0_49, main_~b~0=v_main_~b~0_22, main_~a~0=v_main_~a~0_25} OutVars{main_~c~0=v_main_~c~0_105, main_#t~post5=|v_main_#t~post5_62|, main_~st~0=v_main_~st~0_48, main_~b~0=v_main_~b~0_21, main_~a~0=v_main_~a~0_24} AuxVars[] AssignedVars[main_~c~0, main_#t~post5, main_~st~0, main_~b~0, main_~a~0] {3134#true} is VALID [2022-04-15 06:26:50,031 INFO L290 TraceCheckUtils]: 7: Hoare triple {3134#true} [91] L23-3_primed-->L30: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {3134#true} is VALID [2022-04-15 06:26:50,031 INFO L290 TraceCheckUtils]: 8: Hoare triple {3134#true} [92] L30-->L23-3_primed: Formula: (let ((.cse0 (= v_main_~st~0_52 v_main_~st~0_48)) (.cse1 (= v_main_~b~0_22 v_main_~b~0_21)) (.cse2 (= |v_main_#t~post5_66| |v_main_#t~post5_62|))) (or (and .cse0 (= v_main_~c~0_105 v_main_~c~0_110) (= v_main_~a~0_24 v_main_~a~0_25) .cse1 .cse2) (and .cse0 (= v_main_~a~0_25 v_main_~a~0_24) .cse1 (= v_main_~c~0_110 v_main_~c~0_105) .cse2))) InVars {main_~c~0=v_main_~c~0_110, main_#t~post5=|v_main_#t~post5_66|, main_~st~0=v_main_~st~0_52, main_~b~0=v_main_~b~0_22, main_~a~0=v_main_~a~0_25} OutVars{main_~c~0=v_main_~c~0_105, main_#t~post5=|v_main_#t~post5_62|, main_~st~0=v_main_~st~0_48, main_~b~0=v_main_~b~0_21, main_~a~0=v_main_~a~0_24} AuxVars[] AssignedVars[main_~c~0, main_#t~post5, main_~st~0, main_~b~0, main_~a~0] {3134#true} is VALID [2022-04-15 06:26:50,032 INFO L290 TraceCheckUtils]: 9: Hoare triple {3134#true} [89] L23-3_primed-->L23-3: Formula: (and (= v_main_~c~0_7 0) (= v_main_~st~0_6 1)) InVars {} OutVars{main_~c~0=v_main_~c~0_7, main_~st~0=v_main_~st~0_6} AuxVars[] AssignedVars[main_~c~0, main_~st~0] {3139#(= main_~c~0 0)} is VALID [2022-04-15 06:26:50,032 INFO L290 TraceCheckUtils]: 10: Hoare triple {3139#(= main_~c~0 0)} assume !!(~c~0 < 200000); {3139#(= main_~c~0 0)} is VALID [2022-04-15 06:26:50,032 INFO L290 TraceCheckUtils]: 11: Hoare triple {3139#(= main_~c~0 0)} assume !(~c~0 == ~last~0); {3139#(= main_~c~0 0)} is VALID [2022-04-15 06:26:50,033 INFO L290 TraceCheckUtils]: 12: Hoare triple {3139#(= main_~c~0 0)} #t~post5 := ~c~0;~c~0 := 1 + #t~post5;havoc #t~post5; {3140#(<= main_~c~0 1)} is VALID [2022-04-15 06:26:50,033 INFO L290 TraceCheckUtils]: 13: Hoare triple {3140#(<= main_~c~0 1)} assume !(~c~0 < 200000); {3135#false} is VALID [2022-04-15 06:26:50,033 INFO L290 TraceCheckUtils]: 14: Hoare triple {3135#false} assume !(0 == ~st~0 && ~c~0 == 1 + ~last~0);~a~0 := 2 + ~a~0;~b~0 := 2 + ~b~0; {3135#false} is VALID [2022-04-15 06:26:50,033 INFO L290 TraceCheckUtils]: 15: Hoare triple {3135#false} assume !(~c~0 == ~last~0 && 0 == ~st~0); {3135#false} is VALID [2022-04-15 06:26:50,033 INFO L272 TraceCheckUtils]: 16: Hoare triple {3135#false} call __VERIFIER_assert((if ~a~0 == ~b~0 && 200000 == ~c~0 then 1 else 0)); {3135#false} is VALID [2022-04-15 06:26:50,033 INFO L290 TraceCheckUtils]: 17: Hoare triple {3135#false} ~cond := #in~cond; {3135#false} is VALID [2022-04-15 06:26:50,033 INFO L290 TraceCheckUtils]: 18: Hoare triple {3135#false} assume 0 == ~cond; {3135#false} is VALID [2022-04-15 06:26:50,034 INFO L290 TraceCheckUtils]: 19: Hoare triple {3135#false} assume !false; {3135#false} is VALID [2022-04-15 06:26:50,034 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-04-15 06:26:50,034 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 06:26:50,034 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [88503889] [2022-04-15 06:26:50,034 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [88503889] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 06:26:50,034 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [796220218] [2022-04-15 06:26:50,034 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 06:26:50,034 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 06:26:50,034 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 06:26:50,035 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-15 06:26:50,051 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-04-15 06:26:50,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:26:50,077 INFO L263 TraceCheckSpWp]: Trace formula consists of 86 conjuncts, 3 conjunts are in the unsatisfiable core [2022-04-15 06:26:50,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:26:50,082 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 06:26:50,137 INFO L272 TraceCheckUtils]: 0: Hoare triple {3134#true} call ULTIMATE.init(); {3134#true} is VALID [2022-04-15 06:26:50,137 INFO L290 TraceCheckUtils]: 1: Hoare triple {3134#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(11, 2);call #Ultimate.allocInit(12, 3);~last~0 := 0; {3134#true} is VALID [2022-04-15 06:26:50,138 INFO L290 TraceCheckUtils]: 2: Hoare triple {3134#true} assume true; {3134#true} is VALID [2022-04-15 06:26:50,138 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3134#true} {3134#true} #66#return; {3134#true} is VALID [2022-04-15 06:26:50,138 INFO L272 TraceCheckUtils]: 4: Hoare triple {3134#true} call #t~ret6 := main(); {3134#true} is VALID [2022-04-15 06:26:50,138 INFO L290 TraceCheckUtils]: 5: Hoare triple {3134#true} assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~last~0 := #t~nondet4;havoc #t~nondet4;~a~0 := 0;~b~0 := 0;~c~0 := 0;~st~0 := 0; {3134#true} is VALID [2022-04-15 06:26:50,138 INFO L290 TraceCheckUtils]: 6: Hoare triple {3134#true} [90] L30-->L23-3_primed: Formula: (let ((.cse0 (= v_main_~b~0_22 v_main_~b~0_21)) (.cse1 (= v_main_~c~0_107 v_main_~c~0_105)) (.cse2 (= |v_main_#t~post5_63| |v_main_#t~post5_62|))) (or (and (= v_main_~st~0_49 v_main_~st~0_48) (= v_main_~a~0_25 v_main_~a~0_24) .cse0 .cse1 .cse2) (and (= v_main_~a~0_24 v_main_~a~0_25) .cse0 (= v_main_~st~0_48 v_main_~st~0_49) .cse1 .cse2))) InVars {main_~c~0=v_main_~c~0_107, main_#t~post5=|v_main_#t~post5_63|, main_~st~0=v_main_~st~0_49, main_~b~0=v_main_~b~0_22, main_~a~0=v_main_~a~0_25} OutVars{main_~c~0=v_main_~c~0_105, main_#t~post5=|v_main_#t~post5_62|, main_~st~0=v_main_~st~0_48, main_~b~0=v_main_~b~0_21, main_~a~0=v_main_~a~0_24} AuxVars[] AssignedVars[main_~c~0, main_#t~post5, main_~st~0, main_~b~0, main_~a~0] {3134#true} is VALID [2022-04-15 06:26:50,138 INFO L290 TraceCheckUtils]: 7: Hoare triple {3134#true} [91] L23-3_primed-->L30: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {3134#true} is VALID [2022-04-15 06:26:50,138 INFO L290 TraceCheckUtils]: 8: Hoare triple {3134#true} [92] L30-->L23-3_primed: Formula: (let ((.cse0 (= v_main_~st~0_52 v_main_~st~0_48)) (.cse1 (= v_main_~b~0_22 v_main_~b~0_21)) (.cse2 (= |v_main_#t~post5_66| |v_main_#t~post5_62|))) (or (and .cse0 (= v_main_~c~0_105 v_main_~c~0_110) (= v_main_~a~0_24 v_main_~a~0_25) .cse1 .cse2) (and .cse0 (= v_main_~a~0_25 v_main_~a~0_24) .cse1 (= v_main_~c~0_110 v_main_~c~0_105) .cse2))) InVars {main_~c~0=v_main_~c~0_110, main_#t~post5=|v_main_#t~post5_66|, main_~st~0=v_main_~st~0_52, main_~b~0=v_main_~b~0_22, main_~a~0=v_main_~a~0_25} OutVars{main_~c~0=v_main_~c~0_105, main_#t~post5=|v_main_#t~post5_62|, main_~st~0=v_main_~st~0_48, main_~b~0=v_main_~b~0_21, main_~a~0=v_main_~a~0_24} AuxVars[] AssignedVars[main_~c~0, main_#t~post5, main_~st~0, main_~b~0, main_~a~0] {3134#true} is VALID [2022-04-15 06:26:50,139 INFO L290 TraceCheckUtils]: 9: Hoare triple {3134#true} [89] L23-3_primed-->L23-3: Formula: (and (= v_main_~c~0_7 0) (= v_main_~st~0_6 1)) InVars {} OutVars{main_~c~0=v_main_~c~0_7, main_~st~0=v_main_~st~0_6} AuxVars[] AssignedVars[main_~c~0, main_~st~0] {3172#(<= main_~c~0 0)} is VALID [2022-04-15 06:26:50,139 INFO L290 TraceCheckUtils]: 10: Hoare triple {3172#(<= main_~c~0 0)} assume !!(~c~0 < 200000); {3172#(<= main_~c~0 0)} is VALID [2022-04-15 06:26:50,140 INFO L290 TraceCheckUtils]: 11: Hoare triple {3172#(<= main_~c~0 0)} assume !(~c~0 == ~last~0); {3172#(<= main_~c~0 0)} is VALID [2022-04-15 06:26:50,140 INFO L290 TraceCheckUtils]: 12: Hoare triple {3172#(<= main_~c~0 0)} #t~post5 := ~c~0;~c~0 := 1 + #t~post5;havoc #t~post5; {3140#(<= main_~c~0 1)} is VALID [2022-04-15 06:26:50,140 INFO L290 TraceCheckUtils]: 13: Hoare triple {3140#(<= main_~c~0 1)} assume !(~c~0 < 200000); {3135#false} is VALID [2022-04-15 06:26:50,141 INFO L290 TraceCheckUtils]: 14: Hoare triple {3135#false} assume !(0 == ~st~0 && ~c~0 == 1 + ~last~0);~a~0 := 2 + ~a~0;~b~0 := 2 + ~b~0; {3135#false} is VALID [2022-04-15 06:26:50,141 INFO L290 TraceCheckUtils]: 15: Hoare triple {3135#false} assume !(~c~0 == ~last~0 && 0 == ~st~0); {3135#false} is VALID [2022-04-15 06:26:50,141 INFO L272 TraceCheckUtils]: 16: Hoare triple {3135#false} call __VERIFIER_assert((if ~a~0 == ~b~0 && 200000 == ~c~0 then 1 else 0)); {3135#false} is VALID [2022-04-15 06:26:50,141 INFO L290 TraceCheckUtils]: 17: Hoare triple {3135#false} ~cond := #in~cond; {3135#false} is VALID [2022-04-15 06:26:50,141 INFO L290 TraceCheckUtils]: 18: Hoare triple {3135#false} assume 0 == ~cond; {3135#false} is VALID [2022-04-15 06:26:50,141 INFO L290 TraceCheckUtils]: 19: Hoare triple {3135#false} assume !false; {3135#false} is VALID [2022-04-15 06:26:50,141 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-04-15 06:26:50,141 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 06:26:50,210 INFO L290 TraceCheckUtils]: 19: Hoare triple {3135#false} assume !false; {3135#false} is VALID [2022-04-15 06:26:50,210 INFO L290 TraceCheckUtils]: 18: Hoare triple {3135#false} assume 0 == ~cond; {3135#false} is VALID [2022-04-15 06:26:50,210 INFO L290 TraceCheckUtils]: 17: Hoare triple {3135#false} ~cond := #in~cond; {3135#false} is VALID [2022-04-15 06:26:50,210 INFO L272 TraceCheckUtils]: 16: Hoare triple {3135#false} call __VERIFIER_assert((if ~a~0 == ~b~0 && 200000 == ~c~0 then 1 else 0)); {3135#false} is VALID [2022-04-15 06:26:50,210 INFO L290 TraceCheckUtils]: 15: Hoare triple {3135#false} assume !(~c~0 == ~last~0 && 0 == ~st~0); {3135#false} is VALID [2022-04-15 06:26:50,210 INFO L290 TraceCheckUtils]: 14: Hoare triple {3135#false} assume !(0 == ~st~0 && ~c~0 == 1 + ~last~0);~a~0 := 2 + ~a~0;~b~0 := 2 + ~b~0; {3135#false} is VALID [2022-04-15 06:26:50,210 INFO L290 TraceCheckUtils]: 13: Hoare triple {3221#(< main_~c~0 200000)} assume !(~c~0 < 200000); {3135#false} is VALID [2022-04-15 06:26:50,211 INFO L290 TraceCheckUtils]: 12: Hoare triple {3225#(< main_~c~0 199999)} #t~post5 := ~c~0;~c~0 := 1 + #t~post5;havoc #t~post5; {3221#(< main_~c~0 200000)} is VALID [2022-04-15 06:26:50,211 INFO L290 TraceCheckUtils]: 11: Hoare triple {3225#(< main_~c~0 199999)} assume !(~c~0 == ~last~0); {3225#(< main_~c~0 199999)} is VALID [2022-04-15 06:26:50,211 INFO L290 TraceCheckUtils]: 10: Hoare triple {3225#(< main_~c~0 199999)} assume !!(~c~0 < 200000); {3225#(< main_~c~0 199999)} is VALID [2022-04-15 06:26:50,212 INFO L290 TraceCheckUtils]: 9: Hoare triple {3134#true} [89] L23-3_primed-->L23-3: Formula: (and (= v_main_~c~0_7 0) (= v_main_~st~0_6 1)) InVars {} OutVars{main_~c~0=v_main_~c~0_7, main_~st~0=v_main_~st~0_6} AuxVars[] AssignedVars[main_~c~0, main_~st~0] {3225#(< main_~c~0 199999)} is VALID [2022-04-15 06:26:50,212 INFO L290 TraceCheckUtils]: 8: Hoare triple {3134#true} [92] L30-->L23-3_primed: Formula: (let ((.cse0 (= v_main_~st~0_52 v_main_~st~0_48)) (.cse1 (= v_main_~b~0_22 v_main_~b~0_21)) (.cse2 (= |v_main_#t~post5_66| |v_main_#t~post5_62|))) (or (and .cse0 (= v_main_~c~0_105 v_main_~c~0_110) (= v_main_~a~0_24 v_main_~a~0_25) .cse1 .cse2) (and .cse0 (= v_main_~a~0_25 v_main_~a~0_24) .cse1 (= v_main_~c~0_110 v_main_~c~0_105) .cse2))) InVars {main_~c~0=v_main_~c~0_110, main_#t~post5=|v_main_#t~post5_66|, main_~st~0=v_main_~st~0_52, main_~b~0=v_main_~b~0_22, main_~a~0=v_main_~a~0_25} OutVars{main_~c~0=v_main_~c~0_105, main_#t~post5=|v_main_#t~post5_62|, main_~st~0=v_main_~st~0_48, main_~b~0=v_main_~b~0_21, main_~a~0=v_main_~a~0_24} AuxVars[] AssignedVars[main_~c~0, main_#t~post5, main_~st~0, main_~b~0, main_~a~0] {3134#true} is VALID [2022-04-15 06:26:50,212 INFO L290 TraceCheckUtils]: 7: Hoare triple {3134#true} [91] L23-3_primed-->L30: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {3134#true} is VALID [2022-04-15 06:26:50,212 INFO L290 TraceCheckUtils]: 6: Hoare triple {3134#true} [90] L30-->L23-3_primed: Formula: (let ((.cse0 (= v_main_~b~0_22 v_main_~b~0_21)) (.cse1 (= v_main_~c~0_107 v_main_~c~0_105)) (.cse2 (= |v_main_#t~post5_63| |v_main_#t~post5_62|))) (or (and (= v_main_~st~0_49 v_main_~st~0_48) (= v_main_~a~0_25 v_main_~a~0_24) .cse0 .cse1 .cse2) (and (= v_main_~a~0_24 v_main_~a~0_25) .cse0 (= v_main_~st~0_48 v_main_~st~0_49) .cse1 .cse2))) InVars {main_~c~0=v_main_~c~0_107, main_#t~post5=|v_main_#t~post5_63|, main_~st~0=v_main_~st~0_49, main_~b~0=v_main_~b~0_22, main_~a~0=v_main_~a~0_25} OutVars{main_~c~0=v_main_~c~0_105, main_#t~post5=|v_main_#t~post5_62|, main_~st~0=v_main_~st~0_48, main_~b~0=v_main_~b~0_21, main_~a~0=v_main_~a~0_24} AuxVars[] AssignedVars[main_~c~0, main_#t~post5, main_~st~0, main_~b~0, main_~a~0] {3134#true} is VALID [2022-04-15 06:26:50,212 INFO L290 TraceCheckUtils]: 5: Hoare triple {3134#true} assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~last~0 := #t~nondet4;havoc #t~nondet4;~a~0 := 0;~b~0 := 0;~c~0 := 0;~st~0 := 0; {3134#true} is VALID [2022-04-15 06:26:50,212 INFO L272 TraceCheckUtils]: 4: Hoare triple {3134#true} call #t~ret6 := main(); {3134#true} is VALID [2022-04-15 06:26:50,212 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3134#true} {3134#true} #66#return; {3134#true} is VALID [2022-04-15 06:26:50,212 INFO L290 TraceCheckUtils]: 2: Hoare triple {3134#true} assume true; {3134#true} is VALID [2022-04-15 06:26:50,212 INFO L290 TraceCheckUtils]: 1: Hoare triple {3134#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(11, 2);call #Ultimate.allocInit(12, 3);~last~0 := 0; {3134#true} is VALID [2022-04-15 06:26:50,213 INFO L272 TraceCheckUtils]: 0: Hoare triple {3134#true} call ULTIMATE.init(); {3134#true} is VALID [2022-04-15 06:26:50,213 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-04-15 06:26:50,213 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [796220218] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 06:26:50,213 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 06:26:50,213 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4, 4] total 8 [2022-04-15 06:26:50,252 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 06:26:50,252 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [127810467] [2022-04-15 06:26:50,252 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [127810467] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 06:26:50,252 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 06:26:50,252 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-04-15 06:26:50,252 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1794399479] [2022-04-15 06:26:50,252 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 06:26:50,253 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 2.5) internal successors, (20), 7 states have internal predecessors, (20), 2 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 29 [2022-04-15 06:26:50,253 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 06:26:50,253 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 8 states, 8 states have (on average 2.5) internal successors, (20), 7 states have internal predecessors, (20), 2 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-15 06:26:50,272 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 25 edges. 25 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 06:26:50,272 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-04-15 06:26:50,272 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 06:26:50,272 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-04-15 06:26:50,272 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=67, Unknown=0, NotChecked=0, Total=110 [2022-04-15 06:26:50,273 INFO L87 Difference]: Start difference. First operand 57 states and 70 transitions. Second operand has 8 states, 8 states have (on average 2.5) internal successors, (20), 7 states have internal predecessors, (20), 2 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-15 06:26:50,482 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:26:50,483 INFO L93 Difference]: Finished difference Result 102 states and 125 transitions. [2022-04-15 06:26:50,483 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-04-15 06:26:50,483 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 2.5) internal successors, (20), 7 states have internal predecessors, (20), 2 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 29 [2022-04-15 06:26:50,483 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 06:26:50,483 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 2.5) internal successors, (20), 7 states have internal predecessors, (20), 2 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-15 06:26:50,484 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 52 transitions. [2022-04-15 06:26:50,484 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 2.5) internal successors, (20), 7 states have internal predecessors, (20), 2 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-15 06:26:50,485 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 52 transitions. [2022-04-15 06:26:50,485 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 8 states and 52 transitions. [2022-04-15 06:26:50,517 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 52 edges. 52 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 06:26:50,518 INFO L225 Difference]: With dead ends: 102 [2022-04-15 06:26:50,519 INFO L226 Difference]: Without dead ends: 71 [2022-04-15 06:26:50,519 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 56 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=43, Invalid=67, Unknown=0, NotChecked=0, Total=110 [2022-04-15 06:26:50,519 INFO L913 BasicCegarLoop]: 18 mSDtfsCounter, 12 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 67 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 25 SdHoareTripleChecker+Invalid, 78 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 67 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-15 06:26:50,520 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [12 Valid, 25 Invalid, 78 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 67 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-15 06:26:50,520 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2022-04-15 06:26:50,602 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 61. [2022-04-15 06:26:50,602 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 06:26:50,603 INFO L82 GeneralOperation]: Start isEquivalent. First operand 71 states. Second operand has 61 states, 53 states have (on average 1.2641509433962264) internal successors, (67), 54 states have internal predecessors, (67), 4 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-15 06:26:50,603 INFO L74 IsIncluded]: Start isIncluded. First operand 71 states. Second operand has 61 states, 53 states have (on average 1.2641509433962264) internal successors, (67), 54 states have internal predecessors, (67), 4 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-15 06:26:50,603 INFO L87 Difference]: Start difference. First operand 71 states. Second operand has 61 states, 53 states have (on average 1.2641509433962264) internal successors, (67), 54 states have internal predecessors, (67), 4 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-15 06:26:50,604 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:26:50,604 INFO L93 Difference]: Finished difference Result 71 states and 86 transitions. [2022-04-15 06:26:50,604 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 86 transitions. [2022-04-15 06:26:50,604 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 06:26:50,605 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 06:26:50,605 INFO L74 IsIncluded]: Start isIncluded. First operand has 61 states, 53 states have (on average 1.2641509433962264) internal successors, (67), 54 states have internal predecessors, (67), 4 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) Second operand 71 states. [2022-04-15 06:26:50,605 INFO L87 Difference]: Start difference. First operand has 61 states, 53 states have (on average 1.2641509433962264) internal successors, (67), 54 states have internal predecessors, (67), 4 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) Second operand 71 states. [2022-04-15 06:26:50,606 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:26:50,606 INFO L93 Difference]: Finished difference Result 71 states and 86 transitions. [2022-04-15 06:26:50,606 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 86 transitions. [2022-04-15 06:26:50,606 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 06:26:50,606 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 06:26:50,606 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 06:26:50,606 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 06:26:50,606 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 61 states, 53 states have (on average 1.2641509433962264) internal successors, (67), 54 states have internal predecessors, (67), 4 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-15 06:26:50,607 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 74 transitions. [2022-04-15 06:26:50,608 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 74 transitions. Word has length 29 [2022-04-15 06:26:50,608 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 06:26:50,608 INFO L478 AbstractCegarLoop]: Abstraction has 61 states and 74 transitions. [2022-04-15 06:26:50,608 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 2.5) internal successors, (20), 7 states have internal predecessors, (20), 2 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-15 06:26:50,608 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 61 states and 74 transitions. [2022-04-15 06:26:50,684 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 74 edges. 74 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 06:26:50,684 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 74 transitions. [2022-04-15 06:26:50,684 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2022-04-15 06:26:50,684 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 06:26:50,684 INFO L499 BasicCegarLoop]: trace histogram [5, 5, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 06:26:50,702 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2022-04-15 06:26:50,885 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 06:26:50,885 INFO L403 AbstractCegarLoop]: === Iteration 10 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 06:26:50,886 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 06:26:50,886 INFO L85 PathProgramCache]: Analyzing trace with hash 535278948, now seen corresponding path program 4 times [2022-04-15 06:26:50,886 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 06:26:50,886 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1843234858] [2022-04-15 06:26:51,143 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 1 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-15 06:26:51,361 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {0={1=1}, 1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-15 06:26:51,362 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-15 06:26:51,365 INFO L85 PathProgramCache]: Analyzing trace with hash -1129590072, now seen corresponding path program 1 times [2022-04-15 06:26:51,365 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 06:26:51,365 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1907188895] [2022-04-15 06:26:51,365 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 06:26:51,365 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 06:26:51,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:26:51,514 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 06:26:51,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:26:51,519 INFO L290 TraceCheckUtils]: 0: Hoare triple {3747#(and (= ~last~0 |old(~last~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(11, 2);call #Ultimate.allocInit(12, 3);~last~0 := 0; {3735#true} is VALID [2022-04-15 06:26:51,519 INFO L290 TraceCheckUtils]: 1: Hoare triple {3735#true} assume true; {3735#true} is VALID [2022-04-15 06:26:51,519 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {3735#true} {3735#true} #66#return; {3735#true} is VALID [2022-04-15 06:26:51,520 INFO L272 TraceCheckUtils]: 0: Hoare triple {3735#true} call ULTIMATE.init(); {3747#(and (= ~last~0 |old(~last~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 06:26:51,520 INFO L290 TraceCheckUtils]: 1: Hoare triple {3747#(and (= ~last~0 |old(~last~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(11, 2);call #Ultimate.allocInit(12, 3);~last~0 := 0; {3735#true} is VALID [2022-04-15 06:26:51,520 INFO L290 TraceCheckUtils]: 2: Hoare triple {3735#true} assume true; {3735#true} is VALID [2022-04-15 06:26:51,520 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3735#true} {3735#true} #66#return; {3735#true} is VALID [2022-04-15 06:26:51,520 INFO L272 TraceCheckUtils]: 4: Hoare triple {3735#true} call #t~ret6 := main(); {3735#true} is VALID [2022-04-15 06:26:51,520 INFO L290 TraceCheckUtils]: 5: Hoare triple {3735#true} assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~last~0 := #t~nondet4;havoc #t~nondet4;~a~0 := 0;~b~0 := 0;~c~0 := 0;~st~0 := 0; {3740#(and (= main_~a~0 0) (= main_~b~0 0))} is VALID [2022-04-15 06:26:51,521 INFO L290 TraceCheckUtils]: 6: Hoare triple {3740#(and (= main_~a~0 0) (= main_~b~0 0))} assume !false;~st~0 := 1;~c~0 := 0; {3741#(and (= main_~a~0 0) (= main_~st~0 1) (= main_~b~0 0))} is VALID [2022-04-15 06:26:51,521 INFO L290 TraceCheckUtils]: 7: Hoare triple {3741#(and (= main_~a~0 0) (= main_~st~0 1) (= main_~b~0 0))} [94] L23-3-->L23-4_primed: Formula: (let ((.cse0 (= v_main_~c~0_120 v_main_~c~0_119)) (.cse1 (= |v_main_#t~post5_74| |v_main_#t~post5_72|)) (.cse2 (= v_~last~0_51 v_main_~c~0_120))) (or (and .cse0 .cse1 (or (not (< v_main_~c~0_120 200000)) .cse2)) (and (= v_~last~0_51 v_~last~0_51) .cse0 .cse1) (and (< v_main_~c~0_119 200001) (< v_main_~c~0_120 v_main_~c~0_119) (or (not (<= (+ v_~last~0_51 1) v_main_~c~0_119)) (not (<= (+ v_main_~c~0_120 1) v_~last~0_51))) (not .cse2)))) InVars {main_~c~0=v_main_~c~0_120, main_#t~post5=|v_main_#t~post5_74|, ~last~0=v_~last~0_51} OutVars{main_#t~post5=|v_main_#t~post5_72|, main_~c~0=v_main_~c~0_119, ~last~0=v_~last~0_51} AuxVars[] AssignedVars[main_#t~post5, main_~c~0] {3741#(and (= main_~a~0 0) (= main_~st~0 1) (= main_~b~0 0))} is VALID [2022-04-15 06:26:51,522 INFO L290 TraceCheckUtils]: 8: Hoare triple {3741#(and (= main_~a~0 0) (= main_~st~0 1) (= main_~b~0 0))} [95] L23-4_primed-->L23-3: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {3741#(and (= main_~a~0 0) (= main_~st~0 1) (= main_~b~0 0))} is VALID [2022-04-15 06:26:51,522 INFO L290 TraceCheckUtils]: 9: Hoare triple {3741#(and (= main_~a~0 0) (= main_~st~0 1) (= main_~b~0 0))} [96] L23-3-->L23-4_primed: Formula: (let ((.cse2 (< v_main_~c~0_122 200000)) (.cse3 (= v_~last~0_52 v_main_~c~0_122)) (.cse0 (= v_main_~st~0_59 v_main_~st~0_58)) (.cse1 (= |v_main_#t~post5_77| |v_main_#t~post5_73|)) (.cse4 (= v_main_~c~0_122 v_main_~c~0_121))) (or (and .cse0 .cse1 (or (not .cse2) (not .cse3)) .cse4) (and .cse2 .cse3 (= 0 v_main_~st~0_58) (<= v_main_~c~0_121 (+ v_~last~0_52 1)) (< v_main_~c~0_122 v_main_~c~0_121)) (and .cse0 (= v_~last~0_52 v_~last~0_52) .cse1 .cse4))) InVars {main_~c~0=v_main_~c~0_122, main_#t~post5=|v_main_#t~post5_77|, main_~st~0=v_main_~st~0_59, ~last~0=v_~last~0_52} OutVars{main_#t~post5=|v_main_#t~post5_73|, main_~c~0=v_main_~c~0_121, main_~st~0=v_main_~st~0_58, ~last~0=v_~last~0_52} AuxVars[] AssignedVars[main_#t~post5, main_~c~0, main_~st~0] {3742#(or (= main_~st~0 1) (and (= main_~a~0 0) (or (<= ~last~0 199999) (<= main_~c~0 200000)) (= main_~b~0 0)))} is VALID [2022-04-15 06:26:51,523 INFO L290 TraceCheckUtils]: 10: Hoare triple {3742#(or (= main_~st~0 1) (and (= main_~a~0 0) (or (<= ~last~0 199999) (<= main_~c~0 200000)) (= main_~b~0 0)))} [93] L23-4_primed-->L23-4: Formula: (not (< v_main_~c~0_8 200000)) InVars {main_~c~0=v_main_~c~0_8} OutVars{main_~c~0=v_main_~c~0_8} AuxVars[] AssignedVars[] {3743#(or (= main_~st~0 1) (and (= main_~a~0 0) (or (<= ~last~0 199999) (<= main_~c~0 200000)) (= main_~b~0 0) (< 199999 main_~c~0)))} is VALID [2022-04-15 06:26:51,524 INFO L290 TraceCheckUtils]: 11: Hoare triple {3743#(or (= main_~st~0 1) (and (= main_~a~0 0) (or (<= ~last~0 199999) (<= main_~c~0 200000)) (= main_~b~0 0) (< 199999 main_~c~0)))} assume 0 == ~st~0 && ~c~0 == 1 + ~last~0;~a~0 := 3 + ~a~0;~b~0 := 3 + ~b~0; {3744#(and (<= main_~b~0 main_~a~0) (< main_~a~0 (+ main_~b~0 1)) (< 199999 main_~c~0) (<= main_~c~0 200000))} is VALID [2022-04-15 06:26:51,524 INFO L290 TraceCheckUtils]: 12: Hoare triple {3744#(and (<= main_~b~0 main_~a~0) (< main_~a~0 (+ main_~b~0 1)) (< 199999 main_~c~0) (<= main_~c~0 200000))} assume !(~c~0 == ~last~0 && 0 == ~st~0); {3744#(and (<= main_~b~0 main_~a~0) (< main_~a~0 (+ main_~b~0 1)) (< 199999 main_~c~0) (<= main_~c~0 200000))} is VALID [2022-04-15 06:26:51,525 INFO L272 TraceCheckUtils]: 13: Hoare triple {3744#(and (<= main_~b~0 main_~a~0) (< main_~a~0 (+ main_~b~0 1)) (< 199999 main_~c~0) (<= main_~c~0 200000))} call __VERIFIER_assert((if ~a~0 == ~b~0 && 200000 == ~c~0 then 1 else 0)); {3745#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-15 06:26:51,525 INFO L290 TraceCheckUtils]: 14: Hoare triple {3745#(not (= |__VERIFIER_assert_#in~cond| 0))} ~cond := #in~cond; {3746#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-15 06:26:51,525 INFO L290 TraceCheckUtils]: 15: Hoare triple {3746#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {3736#false} is VALID [2022-04-15 06:26:51,525 INFO L290 TraceCheckUtils]: 16: Hoare triple {3736#false} assume !false; {3736#false} is VALID [2022-04-15 06:26:51,526 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-04-15 06:26:51,526 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 06:26:51,526 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1907188895] [2022-04-15 06:26:51,526 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1907188895] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 06:26:51,526 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1932798097] [2022-04-15 06:26:51,526 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 06:26:51,526 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 06:26:51,526 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 06:26:51,527 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-15 06:26:51,529 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-04-15 06:26:51,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:26:51,556 INFO L263 TraceCheckSpWp]: Trace formula consists of 85 conjuncts, 18 conjunts are in the unsatisfiable core [2022-04-15 06:26:51,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:26:51,562 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 06:26:51,849 INFO L272 TraceCheckUtils]: 0: Hoare triple {3735#true} call ULTIMATE.init(); {3735#true} is VALID [2022-04-15 06:26:51,849 INFO L290 TraceCheckUtils]: 1: Hoare triple {3735#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(11, 2);call #Ultimate.allocInit(12, 3);~last~0 := 0; {3735#true} is VALID [2022-04-15 06:26:51,849 INFO L290 TraceCheckUtils]: 2: Hoare triple {3735#true} assume true; {3735#true} is VALID [2022-04-15 06:26:51,849 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3735#true} {3735#true} #66#return; {3735#true} is VALID [2022-04-15 06:26:51,849 INFO L272 TraceCheckUtils]: 4: Hoare triple {3735#true} call #t~ret6 := main(); {3735#true} is VALID [2022-04-15 06:26:51,850 INFO L290 TraceCheckUtils]: 5: Hoare triple {3735#true} assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~last~0 := #t~nondet4;havoc #t~nondet4;~a~0 := 0;~b~0 := 0;~c~0 := 0;~st~0 := 0; {3740#(and (= main_~a~0 0) (= main_~b~0 0))} is VALID [2022-04-15 06:26:51,850 INFO L290 TraceCheckUtils]: 6: Hoare triple {3740#(and (= main_~a~0 0) (= main_~b~0 0))} assume !false;~st~0 := 1;~c~0 := 0; {3741#(and (= main_~a~0 0) (= main_~st~0 1) (= main_~b~0 0))} is VALID [2022-04-15 06:26:51,851 INFO L290 TraceCheckUtils]: 7: Hoare triple {3741#(and (= main_~a~0 0) (= main_~st~0 1) (= main_~b~0 0))} [94] L23-3-->L23-4_primed: Formula: (let ((.cse0 (= v_main_~c~0_120 v_main_~c~0_119)) (.cse1 (= |v_main_#t~post5_74| |v_main_#t~post5_72|)) (.cse2 (= v_~last~0_51 v_main_~c~0_120))) (or (and .cse0 .cse1 (or (not (< v_main_~c~0_120 200000)) .cse2)) (and (= v_~last~0_51 v_~last~0_51) .cse0 .cse1) (and (< v_main_~c~0_119 200001) (< v_main_~c~0_120 v_main_~c~0_119) (or (not (<= (+ v_~last~0_51 1) v_main_~c~0_119)) (not (<= (+ v_main_~c~0_120 1) v_~last~0_51))) (not .cse2)))) InVars {main_~c~0=v_main_~c~0_120, main_#t~post5=|v_main_#t~post5_74|, ~last~0=v_~last~0_51} OutVars{main_#t~post5=|v_main_#t~post5_72|, main_~c~0=v_main_~c~0_119, ~last~0=v_~last~0_51} AuxVars[] AssignedVars[main_#t~post5, main_~c~0] {3741#(and (= main_~a~0 0) (= main_~st~0 1) (= main_~b~0 0))} is VALID [2022-04-15 06:26:51,851 INFO L290 TraceCheckUtils]: 8: Hoare triple {3741#(and (= main_~a~0 0) (= main_~st~0 1) (= main_~b~0 0))} [95] L23-4_primed-->L23-3: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {3741#(and (= main_~a~0 0) (= main_~st~0 1) (= main_~b~0 0))} is VALID [2022-04-15 06:26:51,852 INFO L290 TraceCheckUtils]: 9: Hoare triple {3741#(and (= main_~a~0 0) (= main_~st~0 1) (= main_~b~0 0))} [96] L23-3-->L23-4_primed: Formula: (let ((.cse2 (< v_main_~c~0_122 200000)) (.cse3 (= v_~last~0_52 v_main_~c~0_122)) (.cse0 (= v_main_~st~0_59 v_main_~st~0_58)) (.cse1 (= |v_main_#t~post5_77| |v_main_#t~post5_73|)) (.cse4 (= v_main_~c~0_122 v_main_~c~0_121))) (or (and .cse0 .cse1 (or (not .cse2) (not .cse3)) .cse4) (and .cse2 .cse3 (= 0 v_main_~st~0_58) (<= v_main_~c~0_121 (+ v_~last~0_52 1)) (< v_main_~c~0_122 v_main_~c~0_121)) (and .cse0 (= v_~last~0_52 v_~last~0_52) .cse1 .cse4))) InVars {main_~c~0=v_main_~c~0_122, main_#t~post5=|v_main_#t~post5_77|, main_~st~0=v_main_~st~0_59, ~last~0=v_~last~0_52} OutVars{main_#t~post5=|v_main_#t~post5_73|, main_~c~0=v_main_~c~0_121, main_~st~0=v_main_~st~0_58, ~last~0=v_~last~0_52} AuxVars[] AssignedVars[main_#t~post5, main_~c~0, main_~st~0] {3778#(and (= main_~a~0 0) (= main_~b~0 0) (or (and (< ~last~0 200000) (< ~last~0 main_~c~0) (<= main_~c~0 (+ ~last~0 1)) (= main_~st~0 0)) (= main_~st~0 1)))} is VALID [2022-04-15 06:26:51,852 INFO L290 TraceCheckUtils]: 10: Hoare triple {3778#(and (= main_~a~0 0) (= main_~b~0 0) (or (and (< ~last~0 200000) (< ~last~0 main_~c~0) (<= main_~c~0 (+ ~last~0 1)) (= main_~st~0 0)) (= main_~st~0 1)))} [93] L23-4_primed-->L23-4: Formula: (not (< v_main_~c~0_8 200000)) InVars {main_~c~0=v_main_~c~0_8} OutVars{main_~c~0=v_main_~c~0_8} AuxVars[] AssignedVars[] {3782#(and (= main_~a~0 0) (or (= main_~st~0 1) (and (< ~last~0 200000) (<= main_~c~0 (+ ~last~0 1)) (= main_~st~0 0))) (= main_~b~0 0) (not (< main_~c~0 200000)))} is VALID [2022-04-15 06:26:51,853 INFO L290 TraceCheckUtils]: 11: Hoare triple {3782#(and (= main_~a~0 0) (or (= main_~st~0 1) (and (< ~last~0 200000) (<= main_~c~0 (+ ~last~0 1)) (= main_~st~0 0))) (= main_~b~0 0) (not (< main_~c~0 200000)))} assume 0 == ~st~0 && ~c~0 == 1 + ~last~0;~a~0 := 3 + ~a~0;~b~0 := 3 + ~b~0; {3786#(and (= main_~b~0 3) (<= 200000 main_~c~0) (< main_~c~0 200001) (= main_~a~0 3))} is VALID [2022-04-15 06:26:51,853 INFO L290 TraceCheckUtils]: 12: Hoare triple {3786#(and (= main_~b~0 3) (<= 200000 main_~c~0) (< main_~c~0 200001) (= main_~a~0 3))} assume !(~c~0 == ~last~0 && 0 == ~st~0); {3786#(and (= main_~b~0 3) (<= 200000 main_~c~0) (< main_~c~0 200001) (= main_~a~0 3))} is VALID [2022-04-15 06:26:51,854 INFO L272 TraceCheckUtils]: 13: Hoare triple {3786#(and (= main_~b~0 3) (<= 200000 main_~c~0) (< main_~c~0 200001) (= main_~a~0 3))} call __VERIFIER_assert((if ~a~0 == ~b~0 && 200000 == ~c~0 then 1 else 0)); {3793#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-15 06:26:51,854 INFO L290 TraceCheckUtils]: 14: Hoare triple {3793#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {3797#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-15 06:26:51,855 INFO L290 TraceCheckUtils]: 15: Hoare triple {3797#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {3736#false} is VALID [2022-04-15 06:26:51,855 INFO L290 TraceCheckUtils]: 16: Hoare triple {3736#false} assume !false; {3736#false} is VALID [2022-04-15 06:26:51,855 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-04-15 06:26:51,855 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 06:26:52,244 INFO L290 TraceCheckUtils]: 16: Hoare triple {3736#false} assume !false; {3736#false} is VALID [2022-04-15 06:26:52,245 INFO L290 TraceCheckUtils]: 15: Hoare triple {3797#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {3736#false} is VALID [2022-04-15 06:26:52,245 INFO L290 TraceCheckUtils]: 14: Hoare triple {3793#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {3797#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-15 06:26:52,246 INFO L272 TraceCheckUtils]: 13: Hoare triple {3744#(and (<= main_~b~0 main_~a~0) (< main_~a~0 (+ main_~b~0 1)) (< 199999 main_~c~0) (<= main_~c~0 200000))} call __VERIFIER_assert((if ~a~0 == ~b~0 && 200000 == ~c~0 then 1 else 0)); {3793#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-15 06:26:52,246 INFO L290 TraceCheckUtils]: 12: Hoare triple {3744#(and (<= main_~b~0 main_~a~0) (< main_~a~0 (+ main_~b~0 1)) (< 199999 main_~c~0) (<= main_~c~0 200000))} assume !(~c~0 == ~last~0 && 0 == ~st~0); {3744#(and (<= main_~b~0 main_~a~0) (< main_~a~0 (+ main_~b~0 1)) (< 199999 main_~c~0) (<= main_~c~0 200000))} is VALID [2022-04-15 06:26:52,247 INFO L290 TraceCheckUtils]: 11: Hoare triple {3819#(or (not (<= main_~c~0 (+ ~last~0 1))) (and (<= main_~b~0 main_~a~0) (< main_~a~0 (+ main_~b~0 1)) (< 199999 main_~c~0) (<= main_~c~0 200000)) (not (= main_~st~0 0)))} assume 0 == ~st~0 && ~c~0 == 1 + ~last~0;~a~0 := 3 + ~a~0;~b~0 := 3 + ~b~0; {3744#(and (<= main_~b~0 main_~a~0) (< main_~a~0 (+ main_~b~0 1)) (< 199999 main_~c~0) (<= main_~c~0 200000))} is VALID [2022-04-15 06:26:52,247 INFO L290 TraceCheckUtils]: 10: Hoare triple {3823#(or (not (<= main_~c~0 (+ ~last~0 1))) (and (<= main_~b~0 main_~a~0) (< main_~a~0 (+ main_~b~0 1)) (<= main_~c~0 200000)) (not (= main_~st~0 0)) (< main_~c~0 200000))} [93] L23-4_primed-->L23-4: Formula: (not (< v_main_~c~0_8 200000)) InVars {main_~c~0=v_main_~c~0_8} OutVars{main_~c~0=v_main_~c~0_8} AuxVars[] AssignedVars[] {3819#(or (not (<= main_~c~0 (+ ~last~0 1))) (and (<= main_~b~0 main_~a~0) (< main_~a~0 (+ main_~b~0 1)) (< 199999 main_~c~0) (<= main_~c~0 200000)) (not (= main_~st~0 0)))} is VALID [2022-04-15 06:26:52,248 INFO L290 TraceCheckUtils]: 9: Hoare triple {3827#(and (<= main_~b~0 main_~a~0) (< main_~a~0 (+ main_~b~0 1)) (not (= main_~st~0 0)))} [96] L23-3-->L23-4_primed: Formula: (let ((.cse2 (< v_main_~c~0_122 200000)) (.cse3 (= v_~last~0_52 v_main_~c~0_122)) (.cse0 (= v_main_~st~0_59 v_main_~st~0_58)) (.cse1 (= |v_main_#t~post5_77| |v_main_#t~post5_73|)) (.cse4 (= v_main_~c~0_122 v_main_~c~0_121))) (or (and .cse0 .cse1 (or (not .cse2) (not .cse3)) .cse4) (and .cse2 .cse3 (= 0 v_main_~st~0_58) (<= v_main_~c~0_121 (+ v_~last~0_52 1)) (< v_main_~c~0_122 v_main_~c~0_121)) (and .cse0 (= v_~last~0_52 v_~last~0_52) .cse1 .cse4))) InVars {main_~c~0=v_main_~c~0_122, main_#t~post5=|v_main_#t~post5_77|, main_~st~0=v_main_~st~0_59, ~last~0=v_~last~0_52} OutVars{main_#t~post5=|v_main_#t~post5_73|, main_~c~0=v_main_~c~0_121, main_~st~0=v_main_~st~0_58, ~last~0=v_~last~0_52} AuxVars[] AssignedVars[main_#t~post5, main_~c~0, main_~st~0] {3823#(or (not (<= main_~c~0 (+ ~last~0 1))) (and (<= main_~b~0 main_~a~0) (< main_~a~0 (+ main_~b~0 1)) (<= main_~c~0 200000)) (not (= main_~st~0 0)) (< main_~c~0 200000))} is VALID [2022-04-15 06:26:52,248 INFO L290 TraceCheckUtils]: 8: Hoare triple {3827#(and (<= main_~b~0 main_~a~0) (< main_~a~0 (+ main_~b~0 1)) (not (= main_~st~0 0)))} [95] L23-4_primed-->L23-3: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {3827#(and (<= main_~b~0 main_~a~0) (< main_~a~0 (+ main_~b~0 1)) (not (= main_~st~0 0)))} is VALID [2022-04-15 06:26:52,249 INFO L290 TraceCheckUtils]: 7: Hoare triple {3827#(and (<= main_~b~0 main_~a~0) (< main_~a~0 (+ main_~b~0 1)) (not (= main_~st~0 0)))} [94] L23-3-->L23-4_primed: Formula: (let ((.cse0 (= v_main_~c~0_120 v_main_~c~0_119)) (.cse1 (= |v_main_#t~post5_74| |v_main_#t~post5_72|)) (.cse2 (= v_~last~0_51 v_main_~c~0_120))) (or (and .cse0 .cse1 (or (not (< v_main_~c~0_120 200000)) .cse2)) (and (= v_~last~0_51 v_~last~0_51) .cse0 .cse1) (and (< v_main_~c~0_119 200001) (< v_main_~c~0_120 v_main_~c~0_119) (or (not (<= (+ v_~last~0_51 1) v_main_~c~0_119)) (not (<= (+ v_main_~c~0_120 1) v_~last~0_51))) (not .cse2)))) InVars {main_~c~0=v_main_~c~0_120, main_#t~post5=|v_main_#t~post5_74|, ~last~0=v_~last~0_51} OutVars{main_#t~post5=|v_main_#t~post5_72|, main_~c~0=v_main_~c~0_119, ~last~0=v_~last~0_51} AuxVars[] AssignedVars[main_#t~post5, main_~c~0] {3827#(and (<= main_~b~0 main_~a~0) (< main_~a~0 (+ main_~b~0 1)) (not (= main_~st~0 0)))} is VALID [2022-04-15 06:26:52,249 INFO L290 TraceCheckUtils]: 6: Hoare triple {3837#(and (<= main_~b~0 main_~a~0) (< main_~a~0 (+ main_~b~0 1)))} assume !false;~st~0 := 1;~c~0 := 0; {3827#(and (<= main_~b~0 main_~a~0) (< main_~a~0 (+ main_~b~0 1)) (not (= main_~st~0 0)))} is VALID [2022-04-15 06:26:52,250 INFO L290 TraceCheckUtils]: 5: Hoare triple {3735#true} assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~last~0 := #t~nondet4;havoc #t~nondet4;~a~0 := 0;~b~0 := 0;~c~0 := 0;~st~0 := 0; {3837#(and (<= main_~b~0 main_~a~0) (< main_~a~0 (+ main_~b~0 1)))} is VALID [2022-04-15 06:26:52,250 INFO L272 TraceCheckUtils]: 4: Hoare triple {3735#true} call #t~ret6 := main(); {3735#true} is VALID [2022-04-15 06:26:52,250 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3735#true} {3735#true} #66#return; {3735#true} is VALID [2022-04-15 06:26:52,250 INFO L290 TraceCheckUtils]: 2: Hoare triple {3735#true} assume true; {3735#true} is VALID [2022-04-15 06:26:52,250 INFO L290 TraceCheckUtils]: 1: Hoare triple {3735#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(11, 2);call #Ultimate.allocInit(12, 3);~last~0 := 0; {3735#true} is VALID [2022-04-15 06:26:52,250 INFO L272 TraceCheckUtils]: 0: Hoare triple {3735#true} call ULTIMATE.init(); {3735#true} is VALID [2022-04-15 06:26:52,250 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-04-15 06:26:52,250 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1932798097] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 06:26:52,250 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 06:26:52,250 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9, 9] total 19 [2022-04-15 06:26:52,503 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 06:26:52,503 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1843234858] [2022-04-15 06:26:52,503 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1843234858] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 06:26:52,503 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 06:26:52,503 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [20] imperfect sequences [] total 20 [2022-04-15 06:26:52,508 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1890641163] [2022-04-15 06:26:52,508 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 06:26:52,508 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 20 states have (on average 1.25) internal successors, (25), 18 states have internal predecessors, (25), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 29 [2022-04-15 06:26:52,508 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 06:26:52,509 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 20 states, 20 states have (on average 1.25) internal successors, (25), 18 states have internal predecessors, (25), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:26:52,523 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 29 edges. 29 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 06:26:52,523 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2022-04-15 06:26:52,523 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 06:26:52,524 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2022-04-15 06:26:52,524 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=156, Invalid=714, Unknown=0, NotChecked=0, Total=870 [2022-04-15 06:26:52,525 INFO L87 Difference]: Start difference. First operand 61 states and 74 transitions. Second operand has 20 states, 20 states have (on average 1.25) internal successors, (25), 18 states have internal predecessors, (25), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:26:53,677 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:26:53,678 INFO L93 Difference]: Finished difference Result 114 states and 138 transitions. [2022-04-15 06:26:53,678 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2022-04-15 06:26:53,678 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 20 states have (on average 1.25) internal successors, (25), 18 states have internal predecessors, (25), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 29 [2022-04-15 06:26:53,678 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 06:26:53,678 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20 states, 20 states have (on average 1.25) internal successors, (25), 18 states have internal predecessors, (25), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:26:53,680 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 95 transitions. [2022-04-15 06:26:53,680 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20 states, 20 states have (on average 1.25) internal successors, (25), 18 states have internal predecessors, (25), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:26:53,681 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 95 transitions. [2022-04-15 06:26:53,681 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 26 states and 95 transitions. [2022-04-15 06:26:53,763 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 95 edges. 95 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 06:26:53,764 INFO L225 Difference]: With dead ends: 114 [2022-04-15 06:26:53,764 INFO L226 Difference]: Without dead ends: 88 [2022-04-15 06:26:53,765 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 31 SyntacticMatches, 2 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 408 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=223, Invalid=1183, Unknown=0, NotChecked=0, Total=1406 [2022-04-15 06:26:53,765 INFO L913 BasicCegarLoop]: 16 mSDtfsCounter, 56 mSDsluCounter, 50 mSDsCounter, 0 mSdLazyCounter, 545 mSolverCounterSat, 35 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 58 SdHoareTripleChecker+Valid, 66 SdHoareTripleChecker+Invalid, 580 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 35 IncrementalHoareTripleChecker+Valid, 545 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-04-15 06:26:53,765 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [58 Valid, 66 Invalid, 580 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [35 Valid, 545 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-04-15 06:26:53,766 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states. [2022-04-15 06:26:53,869 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 64. [2022-04-15 06:26:53,869 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 06:26:53,869 INFO L82 GeneralOperation]: Start isEquivalent. First operand 88 states. Second operand has 64 states, 56 states have (on average 1.2678571428571428) internal successors, (71), 57 states have internal predecessors, (71), 4 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-15 06:26:53,869 INFO L74 IsIncluded]: Start isIncluded. First operand 88 states. Second operand has 64 states, 56 states have (on average 1.2678571428571428) internal successors, (71), 57 states have internal predecessors, (71), 4 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-15 06:26:53,869 INFO L87 Difference]: Start difference. First operand 88 states. Second operand has 64 states, 56 states have (on average 1.2678571428571428) internal successors, (71), 57 states have internal predecessors, (71), 4 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-15 06:26:53,871 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:26:53,871 INFO L93 Difference]: Finished difference Result 88 states and 104 transitions. [2022-04-15 06:26:53,871 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 104 transitions. [2022-04-15 06:26:53,871 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 06:26:53,871 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 06:26:53,871 INFO L74 IsIncluded]: Start isIncluded. First operand has 64 states, 56 states have (on average 1.2678571428571428) internal successors, (71), 57 states have internal predecessors, (71), 4 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) Second operand 88 states. [2022-04-15 06:26:53,871 INFO L87 Difference]: Start difference. First operand has 64 states, 56 states have (on average 1.2678571428571428) internal successors, (71), 57 states have internal predecessors, (71), 4 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) Second operand 88 states. [2022-04-15 06:26:53,872 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:26:53,873 INFO L93 Difference]: Finished difference Result 88 states and 104 transitions. [2022-04-15 06:26:53,873 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 104 transitions. [2022-04-15 06:26:53,873 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 06:26:53,873 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 06:26:53,873 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 06:26:53,873 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 06:26:53,873 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 64 states, 56 states have (on average 1.2678571428571428) internal successors, (71), 57 states have internal predecessors, (71), 4 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-15 06:26:53,874 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 78 transitions. [2022-04-15 06:26:53,874 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 78 transitions. Word has length 29 [2022-04-15 06:26:53,874 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 06:26:53,874 INFO L478 AbstractCegarLoop]: Abstraction has 64 states and 78 transitions. [2022-04-15 06:26:53,874 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 1.25) internal successors, (25), 18 states have internal predecessors, (25), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:26:53,874 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 64 states and 78 transitions. [2022-04-15 06:26:53,966 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 78 edges. 78 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 06:26:53,966 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 78 transitions. [2022-04-15 06:26:53,967 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2022-04-15 06:26:53,967 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 06:26:53,967 INFO L499 BasicCegarLoop]: trace histogram [6, 6, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 06:26:53,993 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2022-04-15 06:26:54,168 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2022-04-15 06:26:54,168 INFO L403 AbstractCegarLoop]: === Iteration 11 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 06:26:54,168 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 06:26:54,168 INFO L85 PathProgramCache]: Analyzing trace with hash -922933305, now seen corresponding path program 5 times [2022-04-15 06:26:54,169 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 06:26:54,169 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1753787220] [2022-04-15 06:26:55,104 WARN L970 rdanLoopAcceleration]: Unable to prove correctness of quantifier elimination. [2022-04-15 06:26:59,141 WARN L977 rdanLoopAcceleration]: Unable to prove correctness of quantifier elimination. [2022-04-15 06:26:59,253 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 1 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-15 06:26:59,459 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {0={1=1}, 1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-15 06:26:59,460 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-15 06:26:59,462 INFO L85 PathProgramCache]: Analyzing trace with hash 1375794120, now seen corresponding path program 1 times [2022-04-15 06:26:59,463 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 06:26:59,463 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [820590110] [2022-04-15 06:26:59,463 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 06:26:59,463 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 06:26:59,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:26:59,593 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 06:26:59,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:26:59,609 INFO L290 TraceCheckUtils]: 0: Hoare triple {4429#(and (= ~last~0 |old(~last~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(11, 2);call #Ultimate.allocInit(12, 3);~last~0 := 0; {4417#true} is VALID [2022-04-15 06:26:59,609 INFO L290 TraceCheckUtils]: 1: Hoare triple {4417#true} assume true; {4417#true} is VALID [2022-04-15 06:26:59,609 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {4417#true} {4417#true} #66#return; {4417#true} is VALID [2022-04-15 06:26:59,610 INFO L272 TraceCheckUtils]: 0: Hoare triple {4417#true} call ULTIMATE.init(); {4429#(and (= ~last~0 |old(~last~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 06:26:59,610 INFO L290 TraceCheckUtils]: 1: Hoare triple {4429#(and (= ~last~0 |old(~last~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(11, 2);call #Ultimate.allocInit(12, 3);~last~0 := 0; {4417#true} is VALID [2022-04-15 06:26:59,610 INFO L290 TraceCheckUtils]: 2: Hoare triple {4417#true} assume true; {4417#true} is VALID [2022-04-15 06:26:59,610 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {4417#true} {4417#true} #66#return; {4417#true} is VALID [2022-04-15 06:26:59,610 INFO L272 TraceCheckUtils]: 4: Hoare triple {4417#true} call #t~ret6 := main(); {4417#true} is VALID [2022-04-15 06:26:59,611 INFO L290 TraceCheckUtils]: 5: Hoare triple {4417#true} assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~last~0 := #t~nondet4;havoc #t~nondet4;~a~0 := 0;~b~0 := 0;~c~0 := 0;~st~0 := 0; {4422#(and (= main_~a~0 0) (= main_~b~0 0))} is VALID [2022-04-15 06:26:59,611 INFO L290 TraceCheckUtils]: 6: Hoare triple {4422#(and (= main_~a~0 0) (= main_~b~0 0))} assume !false;~st~0 := 1;~c~0 := 0; {4423#(and (= main_~a~0 0) (= main_~st~0 1) (= main_~b~0 0))} is VALID [2022-04-15 06:26:59,611 INFO L290 TraceCheckUtils]: 7: Hoare triple {4423#(and (= main_~a~0 0) (= main_~st~0 1) (= main_~b~0 0))} [98] L23-3-->L23-4_primed: Formula: (let ((.cse0 (= |v_main_#t~post5_87| |v_main_#t~post5_85|)) (.cse1 (= v_main_~c~0_142 v_main_~c~0_141)) (.cse2 (= v_~last~0_59 v_main_~c~0_142))) (or (and .cse0 .cse1 (= v_~last~0_59 v_~last~0_59)) (and (or (not (<= (+ v_~last~0_59 1) v_main_~c~0_141)) (not (<= (+ v_main_~c~0_142 1) v_~last~0_59))) (not .cse2) (< v_main_~c~0_142 v_main_~c~0_141) (< v_main_~c~0_141 200001)) (and .cse0 .cse1 (or .cse2 (not (< v_main_~c~0_142 200000)))))) InVars {main_~c~0=v_main_~c~0_142, main_#t~post5=|v_main_#t~post5_87|, ~last~0=v_~last~0_59} OutVars{main_#t~post5=|v_main_#t~post5_85|, main_~c~0=v_main_~c~0_141, ~last~0=v_~last~0_59} AuxVars[] AssignedVars[main_#t~post5, main_~c~0] {4423#(and (= main_~a~0 0) (= main_~st~0 1) (= main_~b~0 0))} is VALID [2022-04-15 06:26:59,612 INFO L290 TraceCheckUtils]: 8: Hoare triple {4423#(and (= main_~a~0 0) (= main_~st~0 1) (= main_~b~0 0))} [99] L23-4_primed-->L23-3: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {4423#(and (= main_~a~0 0) (= main_~st~0 1) (= main_~b~0 0))} is VALID [2022-04-15 06:26:59,612 INFO L290 TraceCheckUtils]: 9: Hoare triple {4423#(and (= main_~a~0 0) (= main_~st~0 1) (= main_~b~0 0))} [100] L23-3-->L23-4_primed: Formula: (let ((.cse2 (= |v_main_#t~post5_90| |v_main_#t~post5_86|)) (.cse1 (= v_~last~0_60 v_main_~c~0_144)) (.cse0 (< v_main_~c~0_144 200000)) (.cse3 (= v_main_~c~0_144 v_main_~c~0_143)) (.cse4 (= v_main_~st~0_69 v_main_~st~0_68))) (or (and .cse0 .cse1 (< v_main_~c~0_143 (+ 2 v_main_~c~0_144)) (= 0 v_main_~st~0_68) (< v_main_~c~0_144 v_main_~c~0_143)) (and .cse2 (= v_~last~0_60 v_~last~0_60) .cse3 .cse4) (and .cse2 (or (not .cse1) (not .cse0)) .cse3 .cse4))) InVars {main_~c~0=v_main_~c~0_144, main_#t~post5=|v_main_#t~post5_90|, main_~st~0=v_main_~st~0_69, ~last~0=v_~last~0_60} OutVars{main_#t~post5=|v_main_#t~post5_86|, main_~c~0=v_main_~c~0_143, main_~st~0=v_main_~st~0_68, ~last~0=v_~last~0_60} AuxVars[] AssignedVars[main_#t~post5, main_~c~0, main_~st~0] {4424#(or (= main_~st~0 1) (and (= main_~a~0 0) (or (<= ~last~0 199999) (<= main_~c~0 200000)) (= main_~b~0 0)))} is VALID [2022-04-15 06:26:59,613 INFO L290 TraceCheckUtils]: 10: Hoare triple {4424#(or (= main_~st~0 1) (and (= main_~a~0 0) (or (<= ~last~0 199999) (<= main_~c~0 200000)) (= main_~b~0 0)))} [97] L23-4_primed-->L23-4: Formula: (not (< v_main_~c~0_8 200000)) InVars {main_~c~0=v_main_~c~0_8} OutVars{main_~c~0=v_main_~c~0_8} AuxVars[] AssignedVars[] {4425#(or (= main_~st~0 1) (and (= main_~a~0 0) (or (<= ~last~0 199999) (<= main_~c~0 200000)) (= main_~b~0 0) (< 199999 main_~c~0)))} is VALID [2022-04-15 06:26:59,613 INFO L290 TraceCheckUtils]: 11: Hoare triple {4425#(or (= main_~st~0 1) (and (= main_~a~0 0) (or (<= ~last~0 199999) (<= main_~c~0 200000)) (= main_~b~0 0) (< 199999 main_~c~0)))} assume 0 == ~st~0 && ~c~0 == 1 + ~last~0;~a~0 := 3 + ~a~0;~b~0 := 3 + ~b~0; {4426#(and (<= main_~b~0 main_~a~0) (< main_~a~0 (+ main_~b~0 1)) (< 199999 main_~c~0) (<= main_~c~0 200000))} is VALID [2022-04-15 06:26:59,614 INFO L290 TraceCheckUtils]: 12: Hoare triple {4426#(and (<= main_~b~0 main_~a~0) (< main_~a~0 (+ main_~b~0 1)) (< 199999 main_~c~0) (<= main_~c~0 200000))} assume !(~c~0 == ~last~0 && 0 == ~st~0); {4426#(and (<= main_~b~0 main_~a~0) (< main_~a~0 (+ main_~b~0 1)) (< 199999 main_~c~0) (<= main_~c~0 200000))} is VALID [2022-04-15 06:26:59,615 INFO L272 TraceCheckUtils]: 13: Hoare triple {4426#(and (<= main_~b~0 main_~a~0) (< main_~a~0 (+ main_~b~0 1)) (< 199999 main_~c~0) (<= main_~c~0 200000))} call __VERIFIER_assert((if ~a~0 == ~b~0 && 200000 == ~c~0 then 1 else 0)); {4427#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-15 06:26:59,615 INFO L290 TraceCheckUtils]: 14: Hoare triple {4427#(not (= |__VERIFIER_assert_#in~cond| 0))} ~cond := #in~cond; {4428#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-15 06:26:59,615 INFO L290 TraceCheckUtils]: 15: Hoare triple {4428#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {4418#false} is VALID [2022-04-15 06:26:59,615 INFO L290 TraceCheckUtils]: 16: Hoare triple {4418#false} assume !false; {4418#false} is VALID [2022-04-15 06:26:59,615 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-04-15 06:26:59,615 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 06:26:59,615 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [820590110] [2022-04-15 06:26:59,616 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [820590110] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 06:26:59,616 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [466109060] [2022-04-15 06:26:59,616 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 06:26:59,616 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 06:26:59,616 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 06:26:59,623 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-15 06:26:59,624 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2022-04-15 06:26:59,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:26:59,648 INFO L263 TraceCheckSpWp]: Trace formula consists of 85 conjuncts, 18 conjunts are in the unsatisfiable core [2022-04-15 06:26:59,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:26:59,655 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 06:26:59,958 INFO L272 TraceCheckUtils]: 0: Hoare triple {4417#true} call ULTIMATE.init(); {4417#true} is VALID [2022-04-15 06:26:59,958 INFO L290 TraceCheckUtils]: 1: Hoare triple {4417#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(11, 2);call #Ultimate.allocInit(12, 3);~last~0 := 0; {4417#true} is VALID [2022-04-15 06:26:59,958 INFO L290 TraceCheckUtils]: 2: Hoare triple {4417#true} assume true; {4417#true} is VALID [2022-04-15 06:26:59,959 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {4417#true} {4417#true} #66#return; {4417#true} is VALID [2022-04-15 06:26:59,959 INFO L272 TraceCheckUtils]: 4: Hoare triple {4417#true} call #t~ret6 := main(); {4417#true} is VALID [2022-04-15 06:26:59,959 INFO L290 TraceCheckUtils]: 5: Hoare triple {4417#true} assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~last~0 := #t~nondet4;havoc #t~nondet4;~a~0 := 0;~b~0 := 0;~c~0 := 0;~st~0 := 0; {4422#(and (= main_~a~0 0) (= main_~b~0 0))} is VALID [2022-04-15 06:26:59,959 INFO L290 TraceCheckUtils]: 6: Hoare triple {4422#(and (= main_~a~0 0) (= main_~b~0 0))} assume !false;~st~0 := 1;~c~0 := 0; {4423#(and (= main_~a~0 0) (= main_~st~0 1) (= main_~b~0 0))} is VALID [2022-04-15 06:26:59,960 INFO L290 TraceCheckUtils]: 7: Hoare triple {4423#(and (= main_~a~0 0) (= main_~st~0 1) (= main_~b~0 0))} [98] L23-3-->L23-4_primed: Formula: (let ((.cse0 (= |v_main_#t~post5_87| |v_main_#t~post5_85|)) (.cse1 (= v_main_~c~0_142 v_main_~c~0_141)) (.cse2 (= v_~last~0_59 v_main_~c~0_142))) (or (and .cse0 .cse1 (= v_~last~0_59 v_~last~0_59)) (and (or (not (<= (+ v_~last~0_59 1) v_main_~c~0_141)) (not (<= (+ v_main_~c~0_142 1) v_~last~0_59))) (not .cse2) (< v_main_~c~0_142 v_main_~c~0_141) (< v_main_~c~0_141 200001)) (and .cse0 .cse1 (or .cse2 (not (< v_main_~c~0_142 200000)))))) InVars {main_~c~0=v_main_~c~0_142, main_#t~post5=|v_main_#t~post5_87|, ~last~0=v_~last~0_59} OutVars{main_#t~post5=|v_main_#t~post5_85|, main_~c~0=v_main_~c~0_141, ~last~0=v_~last~0_59} AuxVars[] AssignedVars[main_#t~post5, main_~c~0] {4423#(and (= main_~a~0 0) (= main_~st~0 1) (= main_~b~0 0))} is VALID [2022-04-15 06:26:59,960 INFO L290 TraceCheckUtils]: 8: Hoare triple {4423#(and (= main_~a~0 0) (= main_~st~0 1) (= main_~b~0 0))} [99] L23-4_primed-->L23-3: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {4423#(and (= main_~a~0 0) (= main_~st~0 1) (= main_~b~0 0))} is VALID [2022-04-15 06:26:59,961 INFO L290 TraceCheckUtils]: 9: Hoare triple {4423#(and (= main_~a~0 0) (= main_~st~0 1) (= main_~b~0 0))} [100] L23-3-->L23-4_primed: Formula: (let ((.cse2 (= |v_main_#t~post5_90| |v_main_#t~post5_86|)) (.cse1 (= v_~last~0_60 v_main_~c~0_144)) (.cse0 (< v_main_~c~0_144 200000)) (.cse3 (= v_main_~c~0_144 v_main_~c~0_143)) (.cse4 (= v_main_~st~0_69 v_main_~st~0_68))) (or (and .cse0 .cse1 (< v_main_~c~0_143 (+ 2 v_main_~c~0_144)) (= 0 v_main_~st~0_68) (< v_main_~c~0_144 v_main_~c~0_143)) (and .cse2 (= v_~last~0_60 v_~last~0_60) .cse3 .cse4) (and .cse2 (or (not .cse1) (not .cse0)) .cse3 .cse4))) InVars {main_~c~0=v_main_~c~0_144, main_#t~post5=|v_main_#t~post5_90|, main_~st~0=v_main_~st~0_69, ~last~0=v_~last~0_60} OutVars{main_#t~post5=|v_main_#t~post5_86|, main_~c~0=v_main_~c~0_143, main_~st~0=v_main_~st~0_68, ~last~0=v_~last~0_60} AuxVars[] AssignedVars[main_#t~post5, main_~c~0, main_~st~0] {4460#(and (= main_~a~0 0) (= main_~b~0 0) (or (= main_~st~0 1) (and (< ~last~0 200000) (< ~last~0 main_~c~0) (< main_~c~0 (+ ~last~0 2)) (= main_~st~0 0))))} is VALID [2022-04-15 06:26:59,962 INFO L290 TraceCheckUtils]: 10: Hoare triple {4460#(and (= main_~a~0 0) (= main_~b~0 0) (or (= main_~st~0 1) (and (< ~last~0 200000) (< ~last~0 main_~c~0) (< main_~c~0 (+ ~last~0 2)) (= main_~st~0 0))))} [97] L23-4_primed-->L23-4: Formula: (not (< v_main_~c~0_8 200000)) InVars {main_~c~0=v_main_~c~0_8} OutVars{main_~c~0=v_main_~c~0_8} AuxVars[] AssignedVars[] {4464#(and (= main_~a~0 0) (or (and (< ~last~0 200000) (< main_~c~0 (+ ~last~0 2)) (= main_~st~0 0)) (= main_~st~0 1)) (= main_~b~0 0) (not (< main_~c~0 200000)))} is VALID [2022-04-15 06:26:59,962 INFO L290 TraceCheckUtils]: 11: Hoare triple {4464#(and (= main_~a~0 0) (or (and (< ~last~0 200000) (< main_~c~0 (+ ~last~0 2)) (= main_~st~0 0)) (= main_~st~0 1)) (= main_~b~0 0) (not (< main_~c~0 200000)))} assume 0 == ~st~0 && ~c~0 == 1 + ~last~0;~a~0 := 3 + ~a~0;~b~0 := 3 + ~b~0; {4468#(and (= main_~b~0 3) (<= 200000 main_~c~0) (< main_~c~0 200001) (= main_~a~0 3))} is VALID [2022-04-15 06:26:59,963 INFO L290 TraceCheckUtils]: 12: Hoare triple {4468#(and (= main_~b~0 3) (<= 200000 main_~c~0) (< main_~c~0 200001) (= main_~a~0 3))} assume !(~c~0 == ~last~0 && 0 == ~st~0); {4468#(and (= main_~b~0 3) (<= 200000 main_~c~0) (< main_~c~0 200001) (= main_~a~0 3))} is VALID [2022-04-15 06:26:59,964 INFO L272 TraceCheckUtils]: 13: Hoare triple {4468#(and (= main_~b~0 3) (<= 200000 main_~c~0) (< main_~c~0 200001) (= main_~a~0 3))} call __VERIFIER_assert((if ~a~0 == ~b~0 && 200000 == ~c~0 then 1 else 0)); {4475#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-15 06:26:59,964 INFO L290 TraceCheckUtils]: 14: Hoare triple {4475#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {4479#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-15 06:26:59,964 INFO L290 TraceCheckUtils]: 15: Hoare triple {4479#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {4418#false} is VALID [2022-04-15 06:26:59,964 INFO L290 TraceCheckUtils]: 16: Hoare triple {4418#false} assume !false; {4418#false} is VALID [2022-04-15 06:26:59,965 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-04-15 06:26:59,965 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 06:27:00,373 INFO L290 TraceCheckUtils]: 16: Hoare triple {4418#false} assume !false; {4418#false} is VALID [2022-04-15 06:27:00,373 INFO L290 TraceCheckUtils]: 15: Hoare triple {4479#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {4418#false} is VALID [2022-04-15 06:27:00,374 INFO L290 TraceCheckUtils]: 14: Hoare triple {4475#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {4479#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-15 06:27:00,374 INFO L272 TraceCheckUtils]: 13: Hoare triple {4426#(and (<= main_~b~0 main_~a~0) (< main_~a~0 (+ main_~b~0 1)) (< 199999 main_~c~0) (<= main_~c~0 200000))} call __VERIFIER_assert((if ~a~0 == ~b~0 && 200000 == ~c~0 then 1 else 0)); {4475#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-15 06:27:00,375 INFO L290 TraceCheckUtils]: 12: Hoare triple {4426#(and (<= main_~b~0 main_~a~0) (< main_~a~0 (+ main_~b~0 1)) (< 199999 main_~c~0) (<= main_~c~0 200000))} assume !(~c~0 == ~last~0 && 0 == ~st~0); {4426#(and (<= main_~b~0 main_~a~0) (< main_~a~0 (+ main_~b~0 1)) (< 199999 main_~c~0) (<= main_~c~0 200000))} is VALID [2022-04-15 06:27:00,376 INFO L290 TraceCheckUtils]: 11: Hoare triple {4501#(or (not (<= main_~c~0 (+ ~last~0 1))) (and (<= main_~b~0 main_~a~0) (< main_~a~0 (+ main_~b~0 1)) (< 199999 main_~c~0) (<= main_~c~0 200000)) (not (= main_~st~0 0)))} assume 0 == ~st~0 && ~c~0 == 1 + ~last~0;~a~0 := 3 + ~a~0;~b~0 := 3 + ~b~0; {4426#(and (<= main_~b~0 main_~a~0) (< main_~a~0 (+ main_~b~0 1)) (< 199999 main_~c~0) (<= main_~c~0 200000))} is VALID [2022-04-15 06:27:00,376 INFO L290 TraceCheckUtils]: 10: Hoare triple {4505#(or (not (<= main_~c~0 (+ ~last~0 1))) (and (<= main_~b~0 main_~a~0) (< main_~a~0 (+ main_~b~0 1)) (<= main_~c~0 200000)) (not (= main_~st~0 0)) (< main_~c~0 200000))} [97] L23-4_primed-->L23-4: Formula: (not (< v_main_~c~0_8 200000)) InVars {main_~c~0=v_main_~c~0_8} OutVars{main_~c~0=v_main_~c~0_8} AuxVars[] AssignedVars[] {4501#(or (not (<= main_~c~0 (+ ~last~0 1))) (and (<= main_~b~0 main_~a~0) (< main_~a~0 (+ main_~b~0 1)) (< 199999 main_~c~0) (<= main_~c~0 200000)) (not (= main_~st~0 0)))} is VALID [2022-04-15 06:27:00,377 INFO L290 TraceCheckUtils]: 9: Hoare triple {4509#(and (<= main_~b~0 main_~a~0) (< main_~a~0 (+ main_~b~0 1)) (not (= main_~st~0 0)))} [100] L23-3-->L23-4_primed: Formula: (let ((.cse2 (= |v_main_#t~post5_90| |v_main_#t~post5_86|)) (.cse1 (= v_~last~0_60 v_main_~c~0_144)) (.cse0 (< v_main_~c~0_144 200000)) (.cse3 (= v_main_~c~0_144 v_main_~c~0_143)) (.cse4 (= v_main_~st~0_69 v_main_~st~0_68))) (or (and .cse0 .cse1 (< v_main_~c~0_143 (+ 2 v_main_~c~0_144)) (= 0 v_main_~st~0_68) (< v_main_~c~0_144 v_main_~c~0_143)) (and .cse2 (= v_~last~0_60 v_~last~0_60) .cse3 .cse4) (and .cse2 (or (not .cse1) (not .cse0)) .cse3 .cse4))) InVars {main_~c~0=v_main_~c~0_144, main_#t~post5=|v_main_#t~post5_90|, main_~st~0=v_main_~st~0_69, ~last~0=v_~last~0_60} OutVars{main_#t~post5=|v_main_#t~post5_86|, main_~c~0=v_main_~c~0_143, main_~st~0=v_main_~st~0_68, ~last~0=v_~last~0_60} AuxVars[] AssignedVars[main_#t~post5, main_~c~0, main_~st~0] {4505#(or (not (<= main_~c~0 (+ ~last~0 1))) (and (<= main_~b~0 main_~a~0) (< main_~a~0 (+ main_~b~0 1)) (<= main_~c~0 200000)) (not (= main_~st~0 0)) (< main_~c~0 200000))} is VALID [2022-04-15 06:27:00,377 INFO L290 TraceCheckUtils]: 8: Hoare triple {4509#(and (<= main_~b~0 main_~a~0) (< main_~a~0 (+ main_~b~0 1)) (not (= main_~st~0 0)))} [99] L23-4_primed-->L23-3: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {4509#(and (<= main_~b~0 main_~a~0) (< main_~a~0 (+ main_~b~0 1)) (not (= main_~st~0 0)))} is VALID [2022-04-15 06:27:00,378 INFO L290 TraceCheckUtils]: 7: Hoare triple {4509#(and (<= main_~b~0 main_~a~0) (< main_~a~0 (+ main_~b~0 1)) (not (= main_~st~0 0)))} [98] L23-3-->L23-4_primed: Formula: (let ((.cse0 (= |v_main_#t~post5_87| |v_main_#t~post5_85|)) (.cse1 (= v_main_~c~0_142 v_main_~c~0_141)) (.cse2 (= v_~last~0_59 v_main_~c~0_142))) (or (and .cse0 .cse1 (= v_~last~0_59 v_~last~0_59)) (and (or (not (<= (+ v_~last~0_59 1) v_main_~c~0_141)) (not (<= (+ v_main_~c~0_142 1) v_~last~0_59))) (not .cse2) (< v_main_~c~0_142 v_main_~c~0_141) (< v_main_~c~0_141 200001)) (and .cse0 .cse1 (or .cse2 (not (< v_main_~c~0_142 200000)))))) InVars {main_~c~0=v_main_~c~0_142, main_#t~post5=|v_main_#t~post5_87|, ~last~0=v_~last~0_59} OutVars{main_#t~post5=|v_main_#t~post5_85|, main_~c~0=v_main_~c~0_141, ~last~0=v_~last~0_59} AuxVars[] AssignedVars[main_#t~post5, main_~c~0] {4509#(and (<= main_~b~0 main_~a~0) (< main_~a~0 (+ main_~b~0 1)) (not (= main_~st~0 0)))} is VALID [2022-04-15 06:27:00,378 INFO L290 TraceCheckUtils]: 6: Hoare triple {4519#(and (<= main_~b~0 main_~a~0) (< main_~a~0 (+ main_~b~0 1)))} assume !false;~st~0 := 1;~c~0 := 0; {4509#(and (<= main_~b~0 main_~a~0) (< main_~a~0 (+ main_~b~0 1)) (not (= main_~st~0 0)))} is VALID [2022-04-15 06:27:00,379 INFO L290 TraceCheckUtils]: 5: Hoare triple {4417#true} assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~last~0 := #t~nondet4;havoc #t~nondet4;~a~0 := 0;~b~0 := 0;~c~0 := 0;~st~0 := 0; {4519#(and (<= main_~b~0 main_~a~0) (< main_~a~0 (+ main_~b~0 1)))} is VALID [2022-04-15 06:27:00,379 INFO L272 TraceCheckUtils]: 4: Hoare triple {4417#true} call #t~ret6 := main(); {4417#true} is VALID [2022-04-15 06:27:00,379 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {4417#true} {4417#true} #66#return; {4417#true} is VALID [2022-04-15 06:27:00,379 INFO L290 TraceCheckUtils]: 2: Hoare triple {4417#true} assume true; {4417#true} is VALID [2022-04-15 06:27:00,379 INFO L290 TraceCheckUtils]: 1: Hoare triple {4417#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(11, 2);call #Ultimate.allocInit(12, 3);~last~0 := 0; {4417#true} is VALID [2022-04-15 06:27:00,379 INFO L272 TraceCheckUtils]: 0: Hoare triple {4417#true} call ULTIMATE.init(); {4417#true} is VALID [2022-04-15 06:27:00,379 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-04-15 06:27:00,379 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [466109060] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 06:27:00,379 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 06:27:00,379 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9, 9] total 19 [2022-04-15 06:27:00,779 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 06:27:00,779 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1753787220] [2022-04-15 06:27:00,779 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1753787220] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 06:27:00,779 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 06:27:00,779 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [22] imperfect sequences [] total 22 [2022-04-15 06:27:00,779 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [883740169] [2022-04-15 06:27:00,779 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 06:27:00,780 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 22 states have (on average 1.2727272727272727) internal successors, (28), 20 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-15 06:27:00,780 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 06:27:00,780 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 22 states, 22 states have (on average 1.2727272727272727) internal successors, (28), 20 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-15 06:27:00,803 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-15 06:27:00,804 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2022-04-15 06:27:00,804 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 06:27:00,804 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2022-04-15 06:27:00,804 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=171, Invalid=821, Unknown=0, NotChecked=0, Total=992 [2022-04-15 06:27:00,804 INFO L87 Difference]: Start difference. First operand 64 states and 78 transitions. Second operand has 22 states, 22 states have (on average 1.2727272727272727) internal successors, (28), 20 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-15 06:27:02,287 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:27:02,287 INFO L93 Difference]: Finished difference Result 118 states and 143 transitions. [2022-04-15 06:27:02,287 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2022-04-15 06:27:02,288 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 22 states have (on average 1.2727272727272727) internal successors, (28), 20 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-15 06:27:02,288 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 06:27:02,288 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22 states, 22 states have (on average 1.2727272727272727) internal successors, (28), 20 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-15 06:27:02,289 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 100 transitions. [2022-04-15 06:27:02,289 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22 states, 22 states have (on average 1.2727272727272727) internal successors, (28), 20 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-15 06:27:02,290 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 100 transitions. [2022-04-15 06:27:02,290 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 29 states and 100 transitions. [2022-04-15 06:27:02,363 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-15 06:27:02,364 INFO L225 Difference]: With dead ends: 118 [2022-04-15 06:27:02,364 INFO L226 Difference]: Without dead ends: 92 [2022-04-15 06:27:02,364 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 32 SyntacticMatches, 2 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 475 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=248, Invalid=1392, Unknown=0, NotChecked=0, Total=1640 [2022-04-15 06:27:02,365 INFO L913 BasicCegarLoop]: 16 mSDtfsCounter, 58 mSDsluCounter, 59 mSDsCounter, 0 mSdLazyCounter, 722 mSolverCounterSat, 37 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 60 SdHoareTripleChecker+Valid, 75 SdHoareTripleChecker+Invalid, 759 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 37 IncrementalHoareTripleChecker+Valid, 722 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-04-15 06:27:02,365 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [60 Valid, 75 Invalid, 759 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [37 Valid, 722 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-04-15 06:27:02,365 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2022-04-15 06:27:02,467 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 67. [2022-04-15 06:27:02,467 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 06:27:02,467 INFO L82 GeneralOperation]: Start isEquivalent. First operand 92 states. Second operand has 67 states, 59 states have (on average 1.271186440677966) internal successors, (75), 60 states have internal predecessors, (75), 4 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-15 06:27:02,467 INFO L74 IsIncluded]: Start isIncluded. First operand 92 states. Second operand has 67 states, 59 states have (on average 1.271186440677966) internal successors, (75), 60 states have internal predecessors, (75), 4 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-15 06:27:02,468 INFO L87 Difference]: Start difference. First operand 92 states. Second operand has 67 states, 59 states have (on average 1.271186440677966) internal successors, (75), 60 states have internal predecessors, (75), 4 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-15 06:27:02,469 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:27:02,469 INFO L93 Difference]: Finished difference Result 92 states and 109 transitions. [2022-04-15 06:27:02,469 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 109 transitions. [2022-04-15 06:27:02,469 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 06:27:02,469 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 06:27:02,469 INFO L74 IsIncluded]: Start isIncluded. First operand has 67 states, 59 states have (on average 1.271186440677966) internal successors, (75), 60 states have internal predecessors, (75), 4 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) Second operand 92 states. [2022-04-15 06:27:02,469 INFO L87 Difference]: Start difference. First operand has 67 states, 59 states have (on average 1.271186440677966) internal successors, (75), 60 states have internal predecessors, (75), 4 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) Second operand 92 states. [2022-04-15 06:27:02,470 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:27:02,471 INFO L93 Difference]: Finished difference Result 92 states and 109 transitions. [2022-04-15 06:27:02,471 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 109 transitions. [2022-04-15 06:27:02,471 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 06:27:02,471 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 06:27:02,471 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 06:27:02,471 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 06:27:02,471 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 67 states, 59 states have (on average 1.271186440677966) internal successors, (75), 60 states have internal predecessors, (75), 4 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-15 06:27:02,472 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 82 transitions. [2022-04-15 06:27:02,472 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 82 transitions. Word has length 32 [2022-04-15 06:27:02,472 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 06:27:02,472 INFO L478 AbstractCegarLoop]: Abstraction has 67 states and 82 transitions. [2022-04-15 06:27:02,472 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 22 states have (on average 1.2727272727272727) internal successors, (28), 20 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-15 06:27:02,472 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 67 states and 82 transitions. [2022-04-15 06:27:02,561 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-15 06:27:02,561 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 82 transitions. [2022-04-15 06:27:02,561 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2022-04-15 06:27:02,561 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 06:27:02,561 INFO L499 BasicCegarLoop]: trace histogram [4, 4, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 06:27:02,578 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-15 06:27:02,762 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 06:27:02,762 INFO L403 AbstractCegarLoop]: === Iteration 12 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 06:27:02,762 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 06:27:02,762 INFO L85 PathProgramCache]: Analyzing trace with hash -1916593726, now seen corresponding path program 1 times [2022-04-15 06:27:02,762 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 06:27:02,762 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1000464341] [2022-04-15 06:27:02,857 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 4 AssignedVariables, 1 ReadonlyVariables, Eigenvalues: {0={1=3}, 1={1=1, 2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-15 06:27:02,857 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-15 06:27:02,857 INFO L85 PathProgramCache]: Analyzing trace with hash 340858323, now seen corresponding path program 1 times [2022-04-15 06:27:02,857 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 06:27:02,857 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1892320913] [2022-04-15 06:27:02,857 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 06:27:02,857 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 06:27:02,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:27:02,887 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 06:27:02,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:27:02,891 INFO L290 TraceCheckUtils]: 0: Hoare triple {5133#(and (= ~last~0 |old(~last~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(11, 2);call #Ultimate.allocInit(12, 3);~last~0 := 0; {5125#true} is VALID [2022-04-15 06:27:02,891 INFO L290 TraceCheckUtils]: 1: Hoare triple {5125#true} assume true; {5125#true} is VALID [2022-04-15 06:27:02,891 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {5125#true} {5125#true} #66#return; {5125#true} is VALID [2022-04-15 06:27:02,891 INFO L272 TraceCheckUtils]: 0: Hoare triple {5125#true} call ULTIMATE.init(); {5133#(and (= ~last~0 |old(~last~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 06:27:02,891 INFO L290 TraceCheckUtils]: 1: Hoare triple {5133#(and (= ~last~0 |old(~last~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(11, 2);call #Ultimate.allocInit(12, 3);~last~0 := 0; {5125#true} is VALID [2022-04-15 06:27:02,891 INFO L290 TraceCheckUtils]: 2: Hoare triple {5125#true} assume true; {5125#true} is VALID [2022-04-15 06:27:02,891 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {5125#true} {5125#true} #66#return; {5125#true} is VALID [2022-04-15 06:27:02,892 INFO L272 TraceCheckUtils]: 4: Hoare triple {5125#true} call #t~ret6 := main(); {5125#true} is VALID [2022-04-15 06:27:02,892 INFO L290 TraceCheckUtils]: 5: Hoare triple {5125#true} assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~last~0 := #t~nondet4;havoc #t~nondet4;~a~0 := 0;~b~0 := 0;~c~0 := 0;~st~0 := 0; {5125#true} is VALID [2022-04-15 06:27:02,892 INFO L290 TraceCheckUtils]: 6: Hoare triple {5125#true} [102] L30-->L23-3_primed: Formula: (let ((.cse0 (= v_main_~b~0_41 v_main_~b~0_40)) (.cse1 (= v_main_~a~0_44 v_main_~a~0_43)) (.cse2 (= v_main_~c~0_169 v_main_~c~0_166))) (or (and .cse0 (= v_main_~st~0_78 v_main_~st~0_80) .cse1 .cse2 (= |v_main_#t~post5_98| |v_main_#t~post5_100|)) (and (= |v_main_#t~post5_100| |v_main_#t~post5_98|) .cse0 (= v_main_~st~0_80 v_main_~st~0_78) .cse1 .cse2))) InVars {main_~c~0=v_main_~c~0_169, main_#t~post5=|v_main_#t~post5_100|, main_~st~0=v_main_~st~0_80, main_~b~0=v_main_~b~0_41, main_~a~0=v_main_~a~0_44} OutVars{main_~c~0=v_main_~c~0_166, main_#t~post5=|v_main_#t~post5_98|, main_~st~0=v_main_~st~0_78, main_~b~0=v_main_~b~0_40, main_~a~0=v_main_~a~0_43} AuxVars[] AssignedVars[main_~c~0, main_#t~post5, main_~st~0, main_~b~0, main_~a~0] {5125#true} is VALID [2022-04-15 06:27:02,892 INFO L290 TraceCheckUtils]: 7: Hoare triple {5125#true} [101] L23-3_primed-->L23-3: Formula: (and (= v_main_~c~0_7 0) (= v_main_~st~0_6 1)) InVars {} OutVars{main_~c~0=v_main_~c~0_7, main_~st~0=v_main_~st~0_6} AuxVars[] AssignedVars[main_~c~0, main_~st~0] {5130#(= main_~c~0 0)} is VALID [2022-04-15 06:27:02,892 INFO L290 TraceCheckUtils]: 8: Hoare triple {5130#(= main_~c~0 0)} assume !!(~c~0 < 200000); {5130#(= main_~c~0 0)} is VALID [2022-04-15 06:27:02,893 INFO L290 TraceCheckUtils]: 9: Hoare triple {5130#(= main_~c~0 0)} assume ~c~0 == ~last~0;~st~0 := 0; {5130#(= main_~c~0 0)} is VALID [2022-04-15 06:27:02,893 INFO L290 TraceCheckUtils]: 10: Hoare triple {5130#(= main_~c~0 0)} #t~post5 := ~c~0;~c~0 := 1 + #t~post5;havoc #t~post5; {5131#(<= main_~c~0 1)} is VALID [2022-04-15 06:27:02,893 INFO L290 TraceCheckUtils]: 11: Hoare triple {5131#(<= main_~c~0 1)} assume !!(~c~0 < 200000); {5131#(<= main_~c~0 1)} is VALID [2022-04-15 06:27:02,894 INFO L290 TraceCheckUtils]: 12: Hoare triple {5131#(<= main_~c~0 1)} assume !(~c~0 == ~last~0); {5131#(<= main_~c~0 1)} is VALID [2022-04-15 06:27:02,894 INFO L290 TraceCheckUtils]: 13: Hoare triple {5131#(<= main_~c~0 1)} #t~post5 := ~c~0;~c~0 := 1 + #t~post5;havoc #t~post5; {5132#(<= main_~c~0 2)} is VALID [2022-04-15 06:27:02,894 INFO L290 TraceCheckUtils]: 14: Hoare triple {5132#(<= main_~c~0 2)} assume !(~c~0 < 200000); {5126#false} is VALID [2022-04-15 06:27:02,894 INFO L290 TraceCheckUtils]: 15: Hoare triple {5126#false} assume 0 == ~st~0 && ~c~0 == 1 + ~last~0;~a~0 := 3 + ~a~0;~b~0 := 3 + ~b~0; {5126#false} is VALID [2022-04-15 06:27:02,895 INFO L290 TraceCheckUtils]: 16: Hoare triple {5126#false} assume !(~c~0 == ~last~0 && 0 == ~st~0); {5126#false} is VALID [2022-04-15 06:27:02,895 INFO L272 TraceCheckUtils]: 17: Hoare triple {5126#false} call __VERIFIER_assert((if ~a~0 == ~b~0 && 200000 == ~c~0 then 1 else 0)); {5126#false} is VALID [2022-04-15 06:27:02,895 INFO L290 TraceCheckUtils]: 18: Hoare triple {5126#false} ~cond := #in~cond; {5126#false} is VALID [2022-04-15 06:27:02,895 INFO L290 TraceCheckUtils]: 19: Hoare triple {5126#false} assume 0 == ~cond; {5126#false} is VALID [2022-04-15 06:27:02,895 INFO L290 TraceCheckUtils]: 20: Hoare triple {5126#false} assume !false; {5126#false} is VALID [2022-04-15 06:27:02,895 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 06:27:02,895 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 06:27:02,896 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1892320913] [2022-04-15 06:27:02,896 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1892320913] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 06:27:02,896 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1597114577] [2022-04-15 06:27:02,896 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 06:27:02,896 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 06:27:02,896 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 06:27:02,897 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-15 06:27:02,898 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2022-04-15 06:27:02,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:27:02,926 INFO L263 TraceCheckSpWp]: Trace formula consists of 94 conjuncts, 4 conjunts are in the unsatisfiable core [2022-04-15 06:27:02,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:27:02,935 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 06:27:03,004 INFO L272 TraceCheckUtils]: 0: Hoare triple {5125#true} call ULTIMATE.init(); {5125#true} is VALID [2022-04-15 06:27:03,004 INFO L290 TraceCheckUtils]: 1: Hoare triple {5125#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(11, 2);call #Ultimate.allocInit(12, 3);~last~0 := 0; {5125#true} is VALID [2022-04-15 06:27:03,004 INFO L290 TraceCheckUtils]: 2: Hoare triple {5125#true} assume true; {5125#true} is VALID [2022-04-15 06:27:03,004 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {5125#true} {5125#true} #66#return; {5125#true} is VALID [2022-04-15 06:27:03,004 INFO L272 TraceCheckUtils]: 4: Hoare triple {5125#true} call #t~ret6 := main(); {5125#true} is VALID [2022-04-15 06:27:03,005 INFO L290 TraceCheckUtils]: 5: Hoare triple {5125#true} assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~last~0 := #t~nondet4;havoc #t~nondet4;~a~0 := 0;~b~0 := 0;~c~0 := 0;~st~0 := 0; {5125#true} is VALID [2022-04-15 06:27:03,005 INFO L290 TraceCheckUtils]: 6: Hoare triple {5125#true} [102] L30-->L23-3_primed: Formula: (let ((.cse0 (= v_main_~b~0_41 v_main_~b~0_40)) (.cse1 (= v_main_~a~0_44 v_main_~a~0_43)) (.cse2 (= v_main_~c~0_169 v_main_~c~0_166))) (or (and .cse0 (= v_main_~st~0_78 v_main_~st~0_80) .cse1 .cse2 (= |v_main_#t~post5_98| |v_main_#t~post5_100|)) (and (= |v_main_#t~post5_100| |v_main_#t~post5_98|) .cse0 (= v_main_~st~0_80 v_main_~st~0_78) .cse1 .cse2))) InVars {main_~c~0=v_main_~c~0_169, main_#t~post5=|v_main_#t~post5_100|, main_~st~0=v_main_~st~0_80, main_~b~0=v_main_~b~0_41, main_~a~0=v_main_~a~0_44} OutVars{main_~c~0=v_main_~c~0_166, main_#t~post5=|v_main_#t~post5_98|, main_~st~0=v_main_~st~0_78, main_~b~0=v_main_~b~0_40, main_~a~0=v_main_~a~0_43} AuxVars[] AssignedVars[main_~c~0, main_#t~post5, main_~st~0, main_~b~0, main_~a~0] {5125#true} is VALID [2022-04-15 06:27:03,005 INFO L290 TraceCheckUtils]: 7: Hoare triple {5125#true} [101] L23-3_primed-->L23-3: Formula: (and (= v_main_~c~0_7 0) (= v_main_~st~0_6 1)) InVars {} OutVars{main_~c~0=v_main_~c~0_7, main_~st~0=v_main_~st~0_6} AuxVars[] AssignedVars[main_~c~0, main_~st~0] {5158#(<= main_~c~0 0)} is VALID [2022-04-15 06:27:03,005 INFO L290 TraceCheckUtils]: 8: Hoare triple {5158#(<= main_~c~0 0)} assume !!(~c~0 < 200000); {5158#(<= main_~c~0 0)} is VALID [2022-04-15 06:27:03,006 INFO L290 TraceCheckUtils]: 9: Hoare triple {5158#(<= main_~c~0 0)} assume ~c~0 == ~last~0;~st~0 := 0; {5158#(<= main_~c~0 0)} is VALID [2022-04-15 06:27:03,006 INFO L290 TraceCheckUtils]: 10: Hoare triple {5158#(<= main_~c~0 0)} #t~post5 := ~c~0;~c~0 := 1 + #t~post5;havoc #t~post5; {5131#(<= main_~c~0 1)} is VALID [2022-04-15 06:27:03,007 INFO L290 TraceCheckUtils]: 11: Hoare triple {5131#(<= main_~c~0 1)} assume !!(~c~0 < 200000); {5131#(<= main_~c~0 1)} is VALID [2022-04-15 06:27:03,007 INFO L290 TraceCheckUtils]: 12: Hoare triple {5131#(<= main_~c~0 1)} assume !(~c~0 == ~last~0); {5131#(<= main_~c~0 1)} is VALID [2022-04-15 06:27:03,007 INFO L290 TraceCheckUtils]: 13: Hoare triple {5131#(<= main_~c~0 1)} #t~post5 := ~c~0;~c~0 := 1 + #t~post5;havoc #t~post5; {5132#(<= main_~c~0 2)} is VALID [2022-04-15 06:27:03,008 INFO L290 TraceCheckUtils]: 14: Hoare triple {5132#(<= main_~c~0 2)} assume !(~c~0 < 200000); {5126#false} is VALID [2022-04-15 06:27:03,008 INFO L290 TraceCheckUtils]: 15: Hoare triple {5126#false} assume 0 == ~st~0 && ~c~0 == 1 + ~last~0;~a~0 := 3 + ~a~0;~b~0 := 3 + ~b~0; {5126#false} is VALID [2022-04-15 06:27:03,008 INFO L290 TraceCheckUtils]: 16: Hoare triple {5126#false} assume !(~c~0 == ~last~0 && 0 == ~st~0); {5126#false} is VALID [2022-04-15 06:27:03,008 INFO L272 TraceCheckUtils]: 17: Hoare triple {5126#false} call __VERIFIER_assert((if ~a~0 == ~b~0 && 200000 == ~c~0 then 1 else 0)); {5126#false} is VALID [2022-04-15 06:27:03,008 INFO L290 TraceCheckUtils]: 18: Hoare triple {5126#false} ~cond := #in~cond; {5126#false} is VALID [2022-04-15 06:27:03,008 INFO L290 TraceCheckUtils]: 19: Hoare triple {5126#false} assume 0 == ~cond; {5126#false} is VALID [2022-04-15 06:27:03,008 INFO L290 TraceCheckUtils]: 20: Hoare triple {5126#false} assume !false; {5126#false} is VALID [2022-04-15 06:27:03,008 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 06:27:03,008 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 06:27:03,097 INFO L290 TraceCheckUtils]: 20: Hoare triple {5126#false} assume !false; {5126#false} is VALID [2022-04-15 06:27:03,098 INFO L290 TraceCheckUtils]: 19: Hoare triple {5126#false} assume 0 == ~cond; {5126#false} is VALID [2022-04-15 06:27:03,098 INFO L290 TraceCheckUtils]: 18: Hoare triple {5126#false} ~cond := #in~cond; {5126#false} is VALID [2022-04-15 06:27:03,098 INFO L272 TraceCheckUtils]: 17: Hoare triple {5126#false} call __VERIFIER_assert((if ~a~0 == ~b~0 && 200000 == ~c~0 then 1 else 0)); {5126#false} is VALID [2022-04-15 06:27:03,098 INFO L290 TraceCheckUtils]: 16: Hoare triple {5126#false} assume !(~c~0 == ~last~0 && 0 == ~st~0); {5126#false} is VALID [2022-04-15 06:27:03,098 INFO L290 TraceCheckUtils]: 15: Hoare triple {5126#false} assume 0 == ~st~0 && ~c~0 == 1 + ~last~0;~a~0 := 3 + ~a~0;~b~0 := 3 + ~b~0; {5126#false} is VALID [2022-04-15 06:27:03,098 INFO L290 TraceCheckUtils]: 14: Hoare triple {5216#(< main_~c~0 200000)} assume !(~c~0 < 200000); {5126#false} is VALID [2022-04-15 06:27:03,099 INFO L290 TraceCheckUtils]: 13: Hoare triple {5220#(< main_~c~0 199999)} #t~post5 := ~c~0;~c~0 := 1 + #t~post5;havoc #t~post5; {5216#(< main_~c~0 200000)} is VALID [2022-04-15 06:27:03,099 INFO L290 TraceCheckUtils]: 12: Hoare triple {5220#(< main_~c~0 199999)} assume !(~c~0 == ~last~0); {5220#(< main_~c~0 199999)} is VALID [2022-04-15 06:27:03,099 INFO L290 TraceCheckUtils]: 11: Hoare triple {5220#(< main_~c~0 199999)} assume !!(~c~0 < 200000); {5220#(< main_~c~0 199999)} is VALID [2022-04-15 06:27:03,100 INFO L290 TraceCheckUtils]: 10: Hoare triple {5230#(< main_~c~0 199998)} #t~post5 := ~c~0;~c~0 := 1 + #t~post5;havoc #t~post5; {5220#(< main_~c~0 199999)} is VALID [2022-04-15 06:27:03,100 INFO L290 TraceCheckUtils]: 9: Hoare triple {5230#(< main_~c~0 199998)} assume ~c~0 == ~last~0;~st~0 := 0; {5230#(< main_~c~0 199998)} is VALID [2022-04-15 06:27:03,100 INFO L290 TraceCheckUtils]: 8: Hoare triple {5230#(< main_~c~0 199998)} assume !!(~c~0 < 200000); {5230#(< main_~c~0 199998)} is VALID [2022-04-15 06:27:03,101 INFO L290 TraceCheckUtils]: 7: Hoare triple {5125#true} [101] L23-3_primed-->L23-3: Formula: (and (= v_main_~c~0_7 0) (= v_main_~st~0_6 1)) InVars {} OutVars{main_~c~0=v_main_~c~0_7, main_~st~0=v_main_~st~0_6} AuxVars[] AssignedVars[main_~c~0, main_~st~0] {5230#(< main_~c~0 199998)} is VALID [2022-04-15 06:27:03,101 INFO L290 TraceCheckUtils]: 6: Hoare triple {5125#true} [102] L30-->L23-3_primed: Formula: (let ((.cse0 (= v_main_~b~0_41 v_main_~b~0_40)) (.cse1 (= v_main_~a~0_44 v_main_~a~0_43)) (.cse2 (= v_main_~c~0_169 v_main_~c~0_166))) (or (and .cse0 (= v_main_~st~0_78 v_main_~st~0_80) .cse1 .cse2 (= |v_main_#t~post5_98| |v_main_#t~post5_100|)) (and (= |v_main_#t~post5_100| |v_main_#t~post5_98|) .cse0 (= v_main_~st~0_80 v_main_~st~0_78) .cse1 .cse2))) InVars {main_~c~0=v_main_~c~0_169, main_#t~post5=|v_main_#t~post5_100|, main_~st~0=v_main_~st~0_80, main_~b~0=v_main_~b~0_41, main_~a~0=v_main_~a~0_44} OutVars{main_~c~0=v_main_~c~0_166, main_#t~post5=|v_main_#t~post5_98|, main_~st~0=v_main_~st~0_78, main_~b~0=v_main_~b~0_40, main_~a~0=v_main_~a~0_43} AuxVars[] AssignedVars[main_~c~0, main_#t~post5, main_~st~0, main_~b~0, main_~a~0] {5125#true} is VALID [2022-04-15 06:27:03,101 INFO L290 TraceCheckUtils]: 5: Hoare triple {5125#true} assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~last~0 := #t~nondet4;havoc #t~nondet4;~a~0 := 0;~b~0 := 0;~c~0 := 0;~st~0 := 0; {5125#true} is VALID [2022-04-15 06:27:03,101 INFO L272 TraceCheckUtils]: 4: Hoare triple {5125#true} call #t~ret6 := main(); {5125#true} is VALID [2022-04-15 06:27:03,101 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {5125#true} {5125#true} #66#return; {5125#true} is VALID [2022-04-15 06:27:03,101 INFO L290 TraceCheckUtils]: 2: Hoare triple {5125#true} assume true; {5125#true} is VALID [2022-04-15 06:27:03,101 INFO L290 TraceCheckUtils]: 1: Hoare triple {5125#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(11, 2);call #Ultimate.allocInit(12, 3);~last~0 := 0; {5125#true} is VALID [2022-04-15 06:27:03,101 INFO L272 TraceCheckUtils]: 0: Hoare triple {5125#true} call ULTIMATE.init(); {5125#true} is VALID [2022-04-15 06:27:03,101 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 06:27:03,101 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1597114577] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 06:27:03,101 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 06:27:03,101 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 5] total 10 [2022-04-15 06:27:03,164 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 06:27:03,165 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1000464341] [2022-04-15 06:27:03,165 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1000464341] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 06:27:03,165 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 06:27:03,165 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-04-15 06:27:03,165 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1976995956] [2022-04-15 06:27:03,165 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 06:27:03,165 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 2.7) internal successors, (27), 9 states have internal predecessors, (27), 2 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 35 [2022-04-15 06:27:03,165 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 06:27:03,165 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 10 states, 10 states have (on average 2.7) internal successors, (27), 9 states have internal predecessors, (27), 2 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-15 06:27:03,186 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-15 06:27:03,186 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-04-15 06:27:03,187 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 06:27:03,187 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-04-15 06:27:03,187 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=69, Invalid=113, Unknown=0, NotChecked=0, Total=182 [2022-04-15 06:27:03,187 INFO L87 Difference]: Start difference. First operand 67 states and 82 transitions. Second operand has 10 states, 10 states have (on average 2.7) internal successors, (27), 9 states have internal predecessors, (27), 2 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-15 06:27:03,531 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:27:03,531 INFO L93 Difference]: Finished difference Result 131 states and 162 transitions. [2022-04-15 06:27:03,532 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-04-15 06:27:03,532 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 2.7) internal successors, (27), 9 states have internal predecessors, (27), 2 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 35 [2022-04-15 06:27:03,532 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 06:27:03,532 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 10 states have (on average 2.7) internal successors, (27), 9 states have internal predecessors, (27), 2 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-15 06:27:03,533 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 60 transitions. [2022-04-15 06:27:03,533 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 10 states have (on average 2.7) internal successors, (27), 9 states have internal predecessors, (27), 2 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-15 06:27:03,534 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 60 transitions. [2022-04-15 06:27:03,534 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 10 states and 60 transitions. [2022-04-15 06:27:03,573 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 60 edges. 60 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 06:27:03,574 INFO L225 Difference]: With dead ends: 131 [2022-04-15 06:27:03,574 INFO L226 Difference]: Without dead ends: 97 [2022-04-15 06:27:03,574 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 56 SyntacticMatches, 3 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 83 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=69, Invalid=113, Unknown=0, NotChecked=0, Total=182 [2022-04-15 06:27:03,574 INFO L913 BasicCegarLoop]: 18 mSDtfsCounter, 20 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 108 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 30 SdHoareTripleChecker+Invalid, 118 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 108 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-15 06:27:03,574 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [20 Valid, 30 Invalid, 118 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 108 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-15 06:27:03,575 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2022-04-15 06:27:03,688 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 81. [2022-04-15 06:27:03,688 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 06:27:03,688 INFO L82 GeneralOperation]: Start isEquivalent. First operand 97 states. Second operand has 81 states, 73 states have (on average 1.2465753424657535) internal successors, (91), 74 states have internal predecessors, (91), 4 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-15 06:27:03,688 INFO L74 IsIncluded]: Start isIncluded. First operand 97 states. Second operand has 81 states, 73 states have (on average 1.2465753424657535) internal successors, (91), 74 states have internal predecessors, (91), 4 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-15 06:27:03,689 INFO L87 Difference]: Start difference. First operand 97 states. Second operand has 81 states, 73 states have (on average 1.2465753424657535) internal successors, (91), 74 states have internal predecessors, (91), 4 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-15 06:27:03,690 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:27:03,690 INFO L93 Difference]: Finished difference Result 97 states and 116 transitions. [2022-04-15 06:27:03,690 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 116 transitions. [2022-04-15 06:27:03,690 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 06:27:03,690 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 06:27:03,690 INFO L74 IsIncluded]: Start isIncluded. First operand has 81 states, 73 states have (on average 1.2465753424657535) internal successors, (91), 74 states have internal predecessors, (91), 4 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) Second operand 97 states. [2022-04-15 06:27:03,691 INFO L87 Difference]: Start difference. First operand has 81 states, 73 states have (on average 1.2465753424657535) internal successors, (91), 74 states have internal predecessors, (91), 4 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) Second operand 97 states. [2022-04-15 06:27:03,692 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:27:03,692 INFO L93 Difference]: Finished difference Result 97 states and 116 transitions. [2022-04-15 06:27:03,692 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 116 transitions. [2022-04-15 06:27:03,692 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 06:27:03,692 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 06:27:03,692 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 06:27:03,692 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 06:27:03,692 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 81 states, 73 states have (on average 1.2465753424657535) internal successors, (91), 74 states have internal predecessors, (91), 4 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-15 06:27:03,693 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 98 transitions. [2022-04-15 06:27:03,693 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 98 transitions. Word has length 35 [2022-04-15 06:27:03,693 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 06:27:03,693 INFO L478 AbstractCegarLoop]: Abstraction has 81 states and 98 transitions. [2022-04-15 06:27:03,694 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 2.7) internal successors, (27), 9 states have internal predecessors, (27), 2 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-15 06:27:03,694 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 81 states and 98 transitions. [2022-04-15 06:27:03,814 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 98 edges. 98 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 06:27:03,815 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 98 transitions. [2022-04-15 06:27:03,815 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2022-04-15 06:27:03,815 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 06:27:03,815 INFO L499 BasicCegarLoop]: trace histogram [7, 7, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 06:27:03,831 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2022-04-15 06:27:04,015 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 06:27:04,016 INFO L403 AbstractCegarLoop]: === Iteration 13 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 06:27:04,016 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 06:27:04,016 INFO L85 PathProgramCache]: Analyzing trace with hash 1070036612, now seen corresponding path program 6 times [2022-04-15 06:27:04,016 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 06:27:04,016 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [433655727] [2022-04-15 06:27:04,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-15 06:27:04,429 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {0={1=1}, 1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-15 06:27:04,430 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-15 06:27:04,433 INFO L85 PathProgramCache]: Analyzing trace with hash 838903112, now seen corresponding path program 1 times [2022-04-15 06:27:04,433 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 06:27:04,433 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1822693257] [2022-04-15 06:27:04,433 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 06:27:04,433 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 06:27:04,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:27:04,552 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 06:27:04,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:27:04,556 INFO L290 TraceCheckUtils]: 0: Hoare triple {5897#(and (= ~last~0 |old(~last~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(11, 2);call #Ultimate.allocInit(12, 3);~last~0 := 0; {5885#true} is VALID [2022-04-15 06:27:04,556 INFO L290 TraceCheckUtils]: 1: Hoare triple {5885#true} assume true; {5885#true} is VALID [2022-04-15 06:27:04,556 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {5885#true} {5885#true} #66#return; {5885#true} is VALID [2022-04-15 06:27:04,556 INFO L272 TraceCheckUtils]: 0: Hoare triple {5885#true} call ULTIMATE.init(); {5897#(and (= ~last~0 |old(~last~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 06:27:04,557 INFO L290 TraceCheckUtils]: 1: Hoare triple {5897#(and (= ~last~0 |old(~last~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(11, 2);call #Ultimate.allocInit(12, 3);~last~0 := 0; {5885#true} is VALID [2022-04-15 06:27:04,557 INFO L290 TraceCheckUtils]: 2: Hoare triple {5885#true} assume true; {5885#true} is VALID [2022-04-15 06:27:04,557 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {5885#true} {5885#true} #66#return; {5885#true} is VALID [2022-04-15 06:27:04,557 INFO L272 TraceCheckUtils]: 4: Hoare triple {5885#true} call #t~ret6 := main(); {5885#true} is VALID [2022-04-15 06:27:04,557 INFO L290 TraceCheckUtils]: 5: Hoare triple {5885#true} assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~last~0 := #t~nondet4;havoc #t~nondet4;~a~0 := 0;~b~0 := 0;~c~0 := 0;~st~0 := 0; {5890#(and (= main_~a~0 0) (= main_~b~0 0))} is VALID [2022-04-15 06:27:04,558 INFO L290 TraceCheckUtils]: 6: Hoare triple {5890#(and (= main_~a~0 0) (= main_~b~0 0))} assume !false;~st~0 := 1;~c~0 := 0; {5891#(and (= main_~a~0 0) (= main_~st~0 1) (= main_~b~0 0))} is VALID [2022-04-15 06:27:04,558 INFO L290 TraceCheckUtils]: 7: Hoare triple {5891#(and (= main_~a~0 0) (= main_~st~0 1) (= main_~b~0 0))} [104] L23-3-->L23-4_primed: Formula: (let ((.cse1 (= v_~last~0_72 v_main_~c~0_181)) (.cse0 (= v_main_~c~0_181 v_main_~c~0_180)) (.cse2 (= |v_main_#t~post5_108| |v_main_#t~post5_106|))) (or (and .cse0 (or (not (< v_main_~c~0_181 200000)) .cse1) .cse2) (and (< v_main_~c~0_181 v_main_~c~0_180) (or (not (<= (+ v_~last~0_72 1) v_main_~c~0_180)) (not (<= (+ v_main_~c~0_181 1) v_~last~0_72))) (not .cse1) (< v_main_~c~0_180 200001)) (and .cse0 .cse2 (= v_~last~0_72 v_~last~0_72)))) InVars {main_~c~0=v_main_~c~0_181, main_#t~post5=|v_main_#t~post5_108|, ~last~0=v_~last~0_72} OutVars{main_#t~post5=|v_main_#t~post5_106|, main_~c~0=v_main_~c~0_180, ~last~0=v_~last~0_72} AuxVars[] AssignedVars[main_#t~post5, main_~c~0] {5891#(and (= main_~a~0 0) (= main_~st~0 1) (= main_~b~0 0))} is VALID [2022-04-15 06:27:04,559 INFO L290 TraceCheckUtils]: 8: Hoare triple {5891#(and (= main_~a~0 0) (= main_~st~0 1) (= main_~b~0 0))} [105] L23-4_primed-->L23-3: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {5891#(and (= main_~a~0 0) (= main_~st~0 1) (= main_~b~0 0))} is VALID [2022-04-15 06:27:04,559 INFO L290 TraceCheckUtils]: 9: Hoare triple {5891#(and (= main_~a~0 0) (= main_~st~0 1) (= main_~b~0 0))} [106] L23-3-->L23-4_primed: Formula: (let ((.cse0 (< v_main_~c~0_183 200000)) (.cse1 (= v_~last~0_73 v_main_~c~0_183)) (.cse2 (= v_main_~c~0_183 v_main_~c~0_182)) (.cse3 (= |v_main_#t~post5_111| |v_main_#t~post5_107|)) (.cse4 (= v_main_~st~0_88 v_main_~st~0_87))) (or (and (< v_main_~c~0_183 v_main_~c~0_182) .cse0 (= 0 v_main_~st~0_87) .cse1 (<= v_main_~c~0_182 (+ v_~last~0_73 1))) (and .cse2 (or (not .cse0) (not .cse1)) .cse3 .cse4) (and .cse2 (= v_~last~0_73 v_~last~0_73) .cse3 .cse4))) InVars {main_~c~0=v_main_~c~0_183, main_#t~post5=|v_main_#t~post5_111|, main_~st~0=v_main_~st~0_88, ~last~0=v_~last~0_73} OutVars{main_#t~post5=|v_main_#t~post5_107|, main_~c~0=v_main_~c~0_182, main_~st~0=v_main_~st~0_87, ~last~0=v_~last~0_73} AuxVars[] AssignedVars[main_#t~post5, main_~c~0, main_~st~0] {5892#(or (= main_~st~0 1) (and (= main_~a~0 0) (or (<= ~last~0 199999) (<= main_~c~0 200000)) (= main_~b~0 0)))} is VALID [2022-04-15 06:27:04,560 INFO L290 TraceCheckUtils]: 10: Hoare triple {5892#(or (= main_~st~0 1) (and (= main_~a~0 0) (or (<= ~last~0 199999) (<= main_~c~0 200000)) (= main_~b~0 0)))} [103] L23-4_primed-->L23-4: Formula: (not (< v_main_~c~0_8 200000)) InVars {main_~c~0=v_main_~c~0_8} OutVars{main_~c~0=v_main_~c~0_8} AuxVars[] AssignedVars[] {5893#(or (= main_~st~0 1) (and (= main_~a~0 0) (or (<= ~last~0 199999) (<= main_~c~0 200000)) (= main_~b~0 0) (< 199999 main_~c~0)))} is VALID [2022-04-15 06:27:04,560 INFO L290 TraceCheckUtils]: 11: Hoare triple {5893#(or (= main_~st~0 1) (and (= main_~a~0 0) (or (<= ~last~0 199999) (<= main_~c~0 200000)) (= main_~b~0 0) (< 199999 main_~c~0)))} assume 0 == ~st~0 && ~c~0 == 1 + ~last~0;~a~0 := 3 + ~a~0;~b~0 := 3 + ~b~0; {5894#(and (<= main_~b~0 main_~a~0) (< main_~a~0 (+ main_~b~0 1)) (< 199999 main_~c~0) (<= main_~c~0 200000))} is VALID [2022-04-15 06:27:04,561 INFO L290 TraceCheckUtils]: 12: Hoare triple {5894#(and (<= main_~b~0 main_~a~0) (< main_~a~0 (+ main_~b~0 1)) (< 199999 main_~c~0) (<= main_~c~0 200000))} assume !(~c~0 == ~last~0 && 0 == ~st~0); {5894#(and (<= main_~b~0 main_~a~0) (< main_~a~0 (+ main_~b~0 1)) (< 199999 main_~c~0) (<= main_~c~0 200000))} is VALID [2022-04-15 06:27:04,562 INFO L272 TraceCheckUtils]: 13: Hoare triple {5894#(and (<= main_~b~0 main_~a~0) (< main_~a~0 (+ main_~b~0 1)) (< 199999 main_~c~0) (<= main_~c~0 200000))} call __VERIFIER_assert((if ~a~0 == ~b~0 && 200000 == ~c~0 then 1 else 0)); {5895#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-15 06:27:04,562 INFO L290 TraceCheckUtils]: 14: Hoare triple {5895#(not (= |__VERIFIER_assert_#in~cond| 0))} ~cond := #in~cond; {5896#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-15 06:27:04,562 INFO L290 TraceCheckUtils]: 15: Hoare triple {5896#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {5886#false} is VALID [2022-04-15 06:27:04,562 INFO L290 TraceCheckUtils]: 16: Hoare triple {5886#false} assume !false; {5886#false} is VALID [2022-04-15 06:27:04,562 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-04-15 06:27:04,563 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 06:27:04,563 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1822693257] [2022-04-15 06:27:04,563 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1822693257] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 06:27:04,563 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1249106530] [2022-04-15 06:27:04,563 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 06:27:04,563 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 06:27:04,563 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 06:27:04,580 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-15 06:27:04,580 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2022-04-15 06:27:04,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:27:04,608 INFO L263 TraceCheckSpWp]: Trace formula consists of 85 conjuncts, 18 conjunts are in the unsatisfiable core [2022-04-15 06:27:04,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:27:04,614 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 06:27:04,883 INFO L272 TraceCheckUtils]: 0: Hoare triple {5885#true} call ULTIMATE.init(); {5885#true} is VALID [2022-04-15 06:27:04,884 INFO L290 TraceCheckUtils]: 1: Hoare triple {5885#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(11, 2);call #Ultimate.allocInit(12, 3);~last~0 := 0; {5885#true} is VALID [2022-04-15 06:27:04,884 INFO L290 TraceCheckUtils]: 2: Hoare triple {5885#true} assume true; {5885#true} is VALID [2022-04-15 06:27:04,884 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {5885#true} {5885#true} #66#return; {5885#true} is VALID [2022-04-15 06:27:04,884 INFO L272 TraceCheckUtils]: 4: Hoare triple {5885#true} call #t~ret6 := main(); {5885#true} is VALID [2022-04-15 06:27:04,884 INFO L290 TraceCheckUtils]: 5: Hoare triple {5885#true} assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~last~0 := #t~nondet4;havoc #t~nondet4;~a~0 := 0;~b~0 := 0;~c~0 := 0;~st~0 := 0; {5890#(and (= main_~a~0 0) (= main_~b~0 0))} is VALID [2022-04-15 06:27:04,885 INFO L290 TraceCheckUtils]: 6: Hoare triple {5890#(and (= main_~a~0 0) (= main_~b~0 0))} assume !false;~st~0 := 1;~c~0 := 0; {5891#(and (= main_~a~0 0) (= main_~st~0 1) (= main_~b~0 0))} is VALID [2022-04-15 06:27:04,885 INFO L290 TraceCheckUtils]: 7: Hoare triple {5891#(and (= main_~a~0 0) (= main_~st~0 1) (= main_~b~0 0))} [104] L23-3-->L23-4_primed: Formula: (let ((.cse1 (= v_~last~0_72 v_main_~c~0_181)) (.cse0 (= v_main_~c~0_181 v_main_~c~0_180)) (.cse2 (= |v_main_#t~post5_108| |v_main_#t~post5_106|))) (or (and .cse0 (or (not (< v_main_~c~0_181 200000)) .cse1) .cse2) (and (< v_main_~c~0_181 v_main_~c~0_180) (or (not (<= (+ v_~last~0_72 1) v_main_~c~0_180)) (not (<= (+ v_main_~c~0_181 1) v_~last~0_72))) (not .cse1) (< v_main_~c~0_180 200001)) (and .cse0 .cse2 (= v_~last~0_72 v_~last~0_72)))) InVars {main_~c~0=v_main_~c~0_181, main_#t~post5=|v_main_#t~post5_108|, ~last~0=v_~last~0_72} OutVars{main_#t~post5=|v_main_#t~post5_106|, main_~c~0=v_main_~c~0_180, ~last~0=v_~last~0_72} AuxVars[] AssignedVars[main_#t~post5, main_~c~0] {5891#(and (= main_~a~0 0) (= main_~st~0 1) (= main_~b~0 0))} is VALID [2022-04-15 06:27:04,885 INFO L290 TraceCheckUtils]: 8: Hoare triple {5891#(and (= main_~a~0 0) (= main_~st~0 1) (= main_~b~0 0))} [105] L23-4_primed-->L23-3: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {5891#(and (= main_~a~0 0) (= main_~st~0 1) (= main_~b~0 0))} is VALID [2022-04-15 06:27:04,886 INFO L290 TraceCheckUtils]: 9: Hoare triple {5891#(and (= main_~a~0 0) (= main_~st~0 1) (= main_~b~0 0))} [106] L23-3-->L23-4_primed: Formula: (let ((.cse0 (< v_main_~c~0_183 200000)) (.cse1 (= v_~last~0_73 v_main_~c~0_183)) (.cse2 (= v_main_~c~0_183 v_main_~c~0_182)) (.cse3 (= |v_main_#t~post5_111| |v_main_#t~post5_107|)) (.cse4 (= v_main_~st~0_88 v_main_~st~0_87))) (or (and (< v_main_~c~0_183 v_main_~c~0_182) .cse0 (= 0 v_main_~st~0_87) .cse1 (<= v_main_~c~0_182 (+ v_~last~0_73 1))) (and .cse2 (or (not .cse0) (not .cse1)) .cse3 .cse4) (and .cse2 (= v_~last~0_73 v_~last~0_73) .cse3 .cse4))) InVars {main_~c~0=v_main_~c~0_183, main_#t~post5=|v_main_#t~post5_111|, main_~st~0=v_main_~st~0_88, ~last~0=v_~last~0_73} OutVars{main_#t~post5=|v_main_#t~post5_107|, main_~c~0=v_main_~c~0_182, main_~st~0=v_main_~st~0_87, ~last~0=v_~last~0_73} AuxVars[] AssignedVars[main_#t~post5, main_~c~0, main_~st~0] {5928#(and (= main_~a~0 0) (= main_~b~0 0) (or (and (< ~last~0 200000) (< ~last~0 main_~c~0) (<= main_~c~0 (+ ~last~0 1)) (= main_~st~0 0)) (= main_~st~0 1)))} is VALID [2022-04-15 06:27:04,887 INFO L290 TraceCheckUtils]: 10: Hoare triple {5928#(and (= main_~a~0 0) (= main_~b~0 0) (or (and (< ~last~0 200000) (< ~last~0 main_~c~0) (<= main_~c~0 (+ ~last~0 1)) (= main_~st~0 0)) (= main_~st~0 1)))} [103] L23-4_primed-->L23-4: Formula: (not (< v_main_~c~0_8 200000)) InVars {main_~c~0=v_main_~c~0_8} OutVars{main_~c~0=v_main_~c~0_8} AuxVars[] AssignedVars[] {5932#(and (= main_~a~0 0) (or (= main_~st~0 1) (and (< ~last~0 200000) (<= main_~c~0 (+ ~last~0 1)) (= main_~st~0 0))) (= main_~b~0 0) (not (< main_~c~0 200000)))} is VALID [2022-04-15 06:27:04,887 INFO L290 TraceCheckUtils]: 11: Hoare triple {5932#(and (= main_~a~0 0) (or (= main_~st~0 1) (and (< ~last~0 200000) (<= main_~c~0 (+ ~last~0 1)) (= main_~st~0 0))) (= main_~b~0 0) (not (< main_~c~0 200000)))} assume 0 == ~st~0 && ~c~0 == 1 + ~last~0;~a~0 := 3 + ~a~0;~b~0 := 3 + ~b~0; {5936#(and (= main_~b~0 3) (<= 200000 main_~c~0) (< main_~c~0 200001) (= main_~a~0 3))} is VALID [2022-04-15 06:27:04,888 INFO L290 TraceCheckUtils]: 12: Hoare triple {5936#(and (= main_~b~0 3) (<= 200000 main_~c~0) (< main_~c~0 200001) (= main_~a~0 3))} assume !(~c~0 == ~last~0 && 0 == ~st~0); {5936#(and (= main_~b~0 3) (<= 200000 main_~c~0) (< main_~c~0 200001) (= main_~a~0 3))} is VALID [2022-04-15 06:27:04,888 INFO L272 TraceCheckUtils]: 13: Hoare triple {5936#(and (= main_~b~0 3) (<= 200000 main_~c~0) (< main_~c~0 200001) (= main_~a~0 3))} call __VERIFIER_assert((if ~a~0 == ~b~0 && 200000 == ~c~0 then 1 else 0)); {5943#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-15 06:27:04,889 INFO L290 TraceCheckUtils]: 14: Hoare triple {5943#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {5947#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-15 06:27:04,889 INFO L290 TraceCheckUtils]: 15: Hoare triple {5947#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {5886#false} is VALID [2022-04-15 06:27:04,889 INFO L290 TraceCheckUtils]: 16: Hoare triple {5886#false} assume !false; {5886#false} is VALID [2022-04-15 06:27:04,889 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-04-15 06:27:04,889 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 06:27:05,297 INFO L290 TraceCheckUtils]: 16: Hoare triple {5886#false} assume !false; {5886#false} is VALID [2022-04-15 06:27:05,297 INFO L290 TraceCheckUtils]: 15: Hoare triple {5947#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {5886#false} is VALID [2022-04-15 06:27:05,298 INFO L290 TraceCheckUtils]: 14: Hoare triple {5943#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {5947#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-15 06:27:05,298 INFO L272 TraceCheckUtils]: 13: Hoare triple {5894#(and (<= main_~b~0 main_~a~0) (< main_~a~0 (+ main_~b~0 1)) (< 199999 main_~c~0) (<= main_~c~0 200000))} call __VERIFIER_assert((if ~a~0 == ~b~0 && 200000 == ~c~0 then 1 else 0)); {5943#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-15 06:27:05,299 INFO L290 TraceCheckUtils]: 12: Hoare triple {5894#(and (<= main_~b~0 main_~a~0) (< main_~a~0 (+ main_~b~0 1)) (< 199999 main_~c~0) (<= main_~c~0 200000))} assume !(~c~0 == ~last~0 && 0 == ~st~0); {5894#(and (<= main_~b~0 main_~a~0) (< main_~a~0 (+ main_~b~0 1)) (< 199999 main_~c~0) (<= main_~c~0 200000))} is VALID [2022-04-15 06:27:05,299 INFO L290 TraceCheckUtils]: 11: Hoare triple {5969#(or (not (<= main_~c~0 (+ ~last~0 1))) (and (<= main_~b~0 main_~a~0) (< main_~a~0 (+ main_~b~0 1)) (< 199999 main_~c~0) (<= main_~c~0 200000)) (not (= main_~st~0 0)))} assume 0 == ~st~0 && ~c~0 == 1 + ~last~0;~a~0 := 3 + ~a~0;~b~0 := 3 + ~b~0; {5894#(and (<= main_~b~0 main_~a~0) (< main_~a~0 (+ main_~b~0 1)) (< 199999 main_~c~0) (<= main_~c~0 200000))} is VALID [2022-04-15 06:27:05,300 INFO L290 TraceCheckUtils]: 10: Hoare triple {5973#(or (not (<= main_~c~0 (+ ~last~0 1))) (and (<= main_~b~0 main_~a~0) (< main_~a~0 (+ main_~b~0 1)) (<= main_~c~0 200000)) (not (= main_~st~0 0)) (< main_~c~0 200000))} [103] L23-4_primed-->L23-4: Formula: (not (< v_main_~c~0_8 200000)) InVars {main_~c~0=v_main_~c~0_8} OutVars{main_~c~0=v_main_~c~0_8} AuxVars[] AssignedVars[] {5969#(or (not (<= main_~c~0 (+ ~last~0 1))) (and (<= main_~b~0 main_~a~0) (< main_~a~0 (+ main_~b~0 1)) (< 199999 main_~c~0) (<= main_~c~0 200000)) (not (= main_~st~0 0)))} is VALID [2022-04-15 06:27:05,301 INFO L290 TraceCheckUtils]: 9: Hoare triple {5977#(and (<= main_~b~0 main_~a~0) (< main_~a~0 (+ main_~b~0 1)) (not (= main_~st~0 0)))} [106] L23-3-->L23-4_primed: Formula: (let ((.cse0 (< v_main_~c~0_183 200000)) (.cse1 (= v_~last~0_73 v_main_~c~0_183)) (.cse2 (= v_main_~c~0_183 v_main_~c~0_182)) (.cse3 (= |v_main_#t~post5_111| |v_main_#t~post5_107|)) (.cse4 (= v_main_~st~0_88 v_main_~st~0_87))) (or (and (< v_main_~c~0_183 v_main_~c~0_182) .cse0 (= 0 v_main_~st~0_87) .cse1 (<= v_main_~c~0_182 (+ v_~last~0_73 1))) (and .cse2 (or (not .cse0) (not .cse1)) .cse3 .cse4) (and .cse2 (= v_~last~0_73 v_~last~0_73) .cse3 .cse4))) InVars {main_~c~0=v_main_~c~0_183, main_#t~post5=|v_main_#t~post5_111|, main_~st~0=v_main_~st~0_88, ~last~0=v_~last~0_73} OutVars{main_#t~post5=|v_main_#t~post5_107|, main_~c~0=v_main_~c~0_182, main_~st~0=v_main_~st~0_87, ~last~0=v_~last~0_73} AuxVars[] AssignedVars[main_#t~post5, main_~c~0, main_~st~0] {5973#(or (not (<= main_~c~0 (+ ~last~0 1))) (and (<= main_~b~0 main_~a~0) (< main_~a~0 (+ main_~b~0 1)) (<= main_~c~0 200000)) (not (= main_~st~0 0)) (< main_~c~0 200000))} is VALID [2022-04-15 06:27:05,301 INFO L290 TraceCheckUtils]: 8: Hoare triple {5977#(and (<= main_~b~0 main_~a~0) (< main_~a~0 (+ main_~b~0 1)) (not (= main_~st~0 0)))} [105] L23-4_primed-->L23-3: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {5977#(and (<= main_~b~0 main_~a~0) (< main_~a~0 (+ main_~b~0 1)) (not (= main_~st~0 0)))} is VALID [2022-04-15 06:27:05,301 INFO L290 TraceCheckUtils]: 7: Hoare triple {5977#(and (<= main_~b~0 main_~a~0) (< main_~a~0 (+ main_~b~0 1)) (not (= main_~st~0 0)))} [104] L23-3-->L23-4_primed: Formula: (let ((.cse1 (= v_~last~0_72 v_main_~c~0_181)) (.cse0 (= v_main_~c~0_181 v_main_~c~0_180)) (.cse2 (= |v_main_#t~post5_108| |v_main_#t~post5_106|))) (or (and .cse0 (or (not (< v_main_~c~0_181 200000)) .cse1) .cse2) (and (< v_main_~c~0_181 v_main_~c~0_180) (or (not (<= (+ v_~last~0_72 1) v_main_~c~0_180)) (not (<= (+ v_main_~c~0_181 1) v_~last~0_72))) (not .cse1) (< v_main_~c~0_180 200001)) (and .cse0 .cse2 (= v_~last~0_72 v_~last~0_72)))) InVars {main_~c~0=v_main_~c~0_181, main_#t~post5=|v_main_#t~post5_108|, ~last~0=v_~last~0_72} OutVars{main_#t~post5=|v_main_#t~post5_106|, main_~c~0=v_main_~c~0_180, ~last~0=v_~last~0_72} AuxVars[] AssignedVars[main_#t~post5, main_~c~0] {5977#(and (<= main_~b~0 main_~a~0) (< main_~a~0 (+ main_~b~0 1)) (not (= main_~st~0 0)))} is VALID [2022-04-15 06:27:05,302 INFO L290 TraceCheckUtils]: 6: Hoare triple {5987#(and (<= main_~b~0 main_~a~0) (< main_~a~0 (+ main_~b~0 1)))} assume !false;~st~0 := 1;~c~0 := 0; {5977#(and (<= main_~b~0 main_~a~0) (< main_~a~0 (+ main_~b~0 1)) (not (= main_~st~0 0)))} is VALID [2022-04-15 06:27:05,302 INFO L290 TraceCheckUtils]: 5: Hoare triple {5885#true} assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~last~0 := #t~nondet4;havoc #t~nondet4;~a~0 := 0;~b~0 := 0;~c~0 := 0;~st~0 := 0; {5987#(and (<= main_~b~0 main_~a~0) (< main_~a~0 (+ main_~b~0 1)))} is VALID [2022-04-15 06:27:05,302 INFO L272 TraceCheckUtils]: 4: Hoare triple {5885#true} call #t~ret6 := main(); {5885#true} is VALID [2022-04-15 06:27:05,302 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {5885#true} {5885#true} #66#return; {5885#true} is VALID [2022-04-15 06:27:05,302 INFO L290 TraceCheckUtils]: 2: Hoare triple {5885#true} assume true; {5885#true} is VALID [2022-04-15 06:27:05,302 INFO L290 TraceCheckUtils]: 1: Hoare triple {5885#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(11, 2);call #Ultimate.allocInit(12, 3);~last~0 := 0; {5885#true} is VALID [2022-04-15 06:27:05,303 INFO L272 TraceCheckUtils]: 0: Hoare triple {5885#true} call ULTIMATE.init(); {5885#true} is VALID [2022-04-15 06:27:05,303 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-04-15 06:27:05,303 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1249106530] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 06:27:05,303 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 06:27:05,303 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9, 9] total 19 [2022-04-15 06:27:05,776 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 06:27:05,776 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [433655727] [2022-04-15 06:27:05,776 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [433655727] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 06:27:05,776 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 06:27:05,776 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [24] imperfect sequences [] total 24 [2022-04-15 06:27:05,776 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2019572492] [2022-04-15 06:27:05,776 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 06:27:05,777 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 24 states have (on average 1.2916666666666667) internal successors, (31), 22 states have internal predecessors, (31), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 35 [2022-04-15 06:27:05,777 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 06:27:05,777 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 24 states, 24 states have (on average 1.2916666666666667) internal successors, (31), 22 states have internal predecessors, (31), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:27:05,802 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 35 edges. 35 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 06:27:05,802 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2022-04-15 06:27:05,803 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 06:27:05,803 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2022-04-15 06:27:05,803 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=186, Invalid=936, Unknown=0, NotChecked=0, Total=1122 [2022-04-15 06:27:05,803 INFO L87 Difference]: Start difference. First operand 81 states and 98 transitions. Second operand has 24 states, 24 states have (on average 1.2916666666666667) internal successors, (31), 22 states have internal predecessors, (31), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:27:07,422 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:27:07,422 INFO L93 Difference]: Finished difference Result 142 states and 171 transitions. [2022-04-15 06:27:07,422 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2022-04-15 06:27:07,422 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 24 states have (on average 1.2916666666666667) internal successors, (31), 22 states have internal predecessors, (31), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 35 [2022-04-15 06:27:07,422 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 06:27:07,422 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24 states, 24 states have (on average 1.2916666666666667) internal successors, (31), 22 states have internal predecessors, (31), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:27:07,423 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 105 transitions. [2022-04-15 06:27:07,423 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24 states, 24 states have (on average 1.2916666666666667) internal successors, (31), 22 states have internal predecessors, (31), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:27:07,424 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 105 transitions. [2022-04-15 06:27:07,424 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 32 states and 105 transitions. [2022-04-15 06:27:07,500 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 105 edges. 105 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 06:27:07,502 INFO L225 Difference]: With dead ends: 142 [2022-04-15 06:27:07,502 INFO L226 Difference]: Without dead ends: 110 [2022-04-15 06:27:07,502 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 77 GetRequests, 33 SyntacticMatches, 2 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 547 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=273, Invalid=1619, Unknown=0, NotChecked=0, Total=1892 [2022-04-15 06:27:07,503 INFO L913 BasicCegarLoop]: 16 mSDtfsCounter, 62 mSDsluCounter, 66 mSDsCounter, 0 mSdLazyCounter, 835 mSolverCounterSat, 43 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 64 SdHoareTripleChecker+Valid, 82 SdHoareTripleChecker+Invalid, 878 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 43 IncrementalHoareTripleChecker+Valid, 835 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-04-15 06:27:07,503 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [64 Valid, 82 Invalid, 878 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [43 Valid, 835 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-04-15 06:27:07,503 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110 states. [2022-04-15 06:27:07,655 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110 to 84. [2022-04-15 06:27:07,655 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 06:27:07,655 INFO L82 GeneralOperation]: Start isEquivalent. First operand 110 states. Second operand has 84 states, 76 states have (on average 1.25) internal successors, (95), 77 states have internal predecessors, (95), 4 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-15 06:27:07,655 INFO L74 IsIncluded]: Start isIncluded. First operand 110 states. Second operand has 84 states, 76 states have (on average 1.25) internal successors, (95), 77 states have internal predecessors, (95), 4 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-15 06:27:07,655 INFO L87 Difference]: Start difference. First operand 110 states. Second operand has 84 states, 76 states have (on average 1.25) internal successors, (95), 77 states have internal predecessors, (95), 4 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-15 06:27:07,657 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:27:07,657 INFO L93 Difference]: Finished difference Result 110 states and 130 transitions. [2022-04-15 06:27:07,657 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 130 transitions. [2022-04-15 06:27:07,657 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 06:27:07,657 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 06:27:07,657 INFO L74 IsIncluded]: Start isIncluded. First operand has 84 states, 76 states have (on average 1.25) internal successors, (95), 77 states have internal predecessors, (95), 4 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) Second operand 110 states. [2022-04-15 06:27:07,658 INFO L87 Difference]: Start difference. First operand has 84 states, 76 states have (on average 1.25) internal successors, (95), 77 states have internal predecessors, (95), 4 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) Second operand 110 states. [2022-04-15 06:27:07,659 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:27:07,659 INFO L93 Difference]: Finished difference Result 110 states and 130 transitions. [2022-04-15 06:27:07,659 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 130 transitions. [2022-04-15 06:27:07,659 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 06:27:07,659 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 06:27:07,659 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 06:27:07,659 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 06:27:07,660 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 84 states, 76 states have (on average 1.25) internal successors, (95), 77 states have internal predecessors, (95), 4 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-15 06:27:07,661 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 102 transitions. [2022-04-15 06:27:07,661 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 102 transitions. Word has length 35 [2022-04-15 06:27:07,661 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 06:27:07,661 INFO L478 AbstractCegarLoop]: Abstraction has 84 states and 102 transitions. [2022-04-15 06:27:07,661 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 24 states have (on average 1.2916666666666667) internal successors, (31), 22 states have internal predecessors, (31), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:27:07,661 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 84 states and 102 transitions. [2022-04-15 06:27:07,781 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-15 06:27:07,781 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 102 transitions. [2022-04-15 06:27:07,782 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2022-04-15 06:27:07,782 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 06:27:07,782 INFO L499 BasicCegarLoop]: trace histogram [8, 8, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 06:27:07,798 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2022-04-15 06:27:07,982 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2022-04-15 06:27:07,983 INFO L403 AbstractCegarLoop]: === Iteration 14 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 06:27:07,983 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 06:27:07,983 INFO L85 PathProgramCache]: Analyzing trace with hash 8934055, now seen corresponding path program 7 times [2022-04-15 06:27:07,983 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 06:27:07,983 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1105785548] [2022-04-15 06:27:08,190 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 1 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-15 06:27:08,402 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {0={1=1}, 1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-15 06:27:08,403 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-15 06:27:08,405 INFO L85 PathProgramCache]: Analyzing trace with hash -950679992, now seen corresponding path program 1 times [2022-04-15 06:27:08,405 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 06:27:08,406 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1787513959] [2022-04-15 06:27:08,406 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 06:27:08,406 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 06:27:08,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:27:08,530 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 06:27:08,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:27:08,534 INFO L290 TraceCheckUtils]: 0: Hoare triple {6727#(and (= ~last~0 |old(~last~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(11, 2);call #Ultimate.allocInit(12, 3);~last~0 := 0; {6715#true} is VALID [2022-04-15 06:27:08,534 INFO L290 TraceCheckUtils]: 1: Hoare triple {6715#true} assume true; {6715#true} is VALID [2022-04-15 06:27:08,534 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {6715#true} {6715#true} #66#return; {6715#true} is VALID [2022-04-15 06:27:08,535 INFO L272 TraceCheckUtils]: 0: Hoare triple {6715#true} call ULTIMATE.init(); {6727#(and (= ~last~0 |old(~last~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 06:27:08,535 INFO L290 TraceCheckUtils]: 1: Hoare triple {6727#(and (= ~last~0 |old(~last~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(11, 2);call #Ultimate.allocInit(12, 3);~last~0 := 0; {6715#true} is VALID [2022-04-15 06:27:08,535 INFO L290 TraceCheckUtils]: 2: Hoare triple {6715#true} assume true; {6715#true} is VALID [2022-04-15 06:27:08,535 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {6715#true} {6715#true} #66#return; {6715#true} is VALID [2022-04-15 06:27:08,535 INFO L272 TraceCheckUtils]: 4: Hoare triple {6715#true} call #t~ret6 := main(); {6715#true} is VALID [2022-04-15 06:27:08,536 INFO L290 TraceCheckUtils]: 5: Hoare triple {6715#true} assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~last~0 := #t~nondet4;havoc #t~nondet4;~a~0 := 0;~b~0 := 0;~c~0 := 0;~st~0 := 0; {6720#(and (= main_~a~0 0) (= main_~b~0 0))} is VALID [2022-04-15 06:27:08,536 INFO L290 TraceCheckUtils]: 6: Hoare triple {6720#(and (= main_~a~0 0) (= main_~b~0 0))} assume !false;~st~0 := 1;~c~0 := 0; {6721#(and (= main_~a~0 0) (= main_~st~0 1) (= main_~b~0 0))} is VALID [2022-04-15 06:27:08,537 INFO L290 TraceCheckUtils]: 7: Hoare triple {6721#(and (= main_~a~0 0) (= main_~st~0 1) (= main_~b~0 0))} [108] L23-3-->L23-4_primed: Formula: (let ((.cse0 (= v_main_~c~0_205 v_main_~c~0_204)) (.cse1 (= v_~last~0_80 v_main_~c~0_205))) (or (and (= |v_main_#t~post5_121| |v_main_#t~post5_119|) (= v_~last~0_80 v_~last~0_80) .cse0) (and (or (not (<= (+ v_~last~0_80 1) v_main_~c~0_204)) (not (<= (+ v_main_~c~0_205 1) v_~last~0_80))) (< v_main_~c~0_205 v_main_~c~0_204) (not .cse1) (< v_main_~c~0_204 200001)) (and .cse0 (= |v_main_#t~post5_119| |v_main_#t~post5_121|) (or (not (< v_main_~c~0_205 200000)) .cse1)))) InVars {main_~c~0=v_main_~c~0_205, main_#t~post5=|v_main_#t~post5_121|, ~last~0=v_~last~0_80} OutVars{main_#t~post5=|v_main_#t~post5_119|, main_~c~0=v_main_~c~0_204, ~last~0=v_~last~0_80} AuxVars[] AssignedVars[main_#t~post5, main_~c~0] {6721#(and (= main_~a~0 0) (= main_~st~0 1) (= main_~b~0 0))} is VALID [2022-04-15 06:27:08,537 INFO L290 TraceCheckUtils]: 8: Hoare triple {6721#(and (= main_~a~0 0) (= main_~st~0 1) (= main_~b~0 0))} [109] L23-4_primed-->L23-3: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {6721#(and (= main_~a~0 0) (= main_~st~0 1) (= main_~b~0 0))} is VALID [2022-04-15 06:27:08,538 INFO L290 TraceCheckUtils]: 9: Hoare triple {6721#(and (= main_~a~0 0) (= main_~st~0 1) (= main_~b~0 0))} [110] L23-3-->L23-4_primed: Formula: (let ((.cse1 (= v_~last~0_81 v_main_~c~0_207)) (.cse2 (< v_main_~c~0_207 200000)) (.cse0 (= |v_main_#t~post5_124| |v_main_#t~post5_120|)) (.cse3 (= v_main_~c~0_207 v_main_~c~0_206)) (.cse4 (= v_main_~st~0_98 v_main_~st~0_97))) (or (and .cse0 (or (not .cse1) (not .cse2)) .cse3 .cse4) (and .cse1 (< v_main_~c~0_207 v_main_~c~0_206) .cse2 (= 0 v_main_~st~0_97) (< v_main_~c~0_206 (+ 2 v_main_~c~0_207))) (and .cse0 (= v_~last~0_81 v_~last~0_81) .cse3 .cse4))) InVars {main_~c~0=v_main_~c~0_207, main_#t~post5=|v_main_#t~post5_124|, main_~st~0=v_main_~st~0_98, ~last~0=v_~last~0_81} OutVars{main_#t~post5=|v_main_#t~post5_120|, main_~c~0=v_main_~c~0_206, main_~st~0=v_main_~st~0_97, ~last~0=v_~last~0_81} AuxVars[] AssignedVars[main_#t~post5, main_~c~0, main_~st~0] {6722#(or (and (= main_~a~0 0) (= main_~b~0 0) (<= main_~c~0 200000)) (= main_~st~0 1))} is VALID [2022-04-15 06:27:08,539 INFO L290 TraceCheckUtils]: 10: Hoare triple {6722#(or (and (= main_~a~0 0) (= main_~b~0 0) (<= main_~c~0 200000)) (= main_~st~0 1))} [107] L23-4_primed-->L23-4: Formula: (not (< v_main_~c~0_8 200000)) InVars {main_~c~0=v_main_~c~0_8} OutVars{main_~c~0=v_main_~c~0_8} AuxVars[] AssignedVars[] {6723#(or (and (= main_~a~0 0) (= main_~b~0 0) (< 199999 main_~c~0) (<= main_~c~0 200000)) (= main_~st~0 1))} is VALID [2022-04-15 06:27:08,540 INFO L290 TraceCheckUtils]: 11: Hoare triple {6723#(or (and (= main_~a~0 0) (= main_~b~0 0) (< 199999 main_~c~0) (<= main_~c~0 200000)) (= main_~st~0 1))} assume 0 == ~st~0 && ~c~0 == 1 + ~last~0;~a~0 := 3 + ~a~0;~b~0 := 3 + ~b~0; {6724#(and (<= main_~b~0 main_~a~0) (< main_~a~0 (+ main_~b~0 1)) (< 199999 main_~c~0) (<= main_~c~0 200000))} is VALID [2022-04-15 06:27:08,540 INFO L290 TraceCheckUtils]: 12: Hoare triple {6724#(and (<= main_~b~0 main_~a~0) (< main_~a~0 (+ main_~b~0 1)) (< 199999 main_~c~0) (<= main_~c~0 200000))} assume !(~c~0 == ~last~0 && 0 == ~st~0); {6724#(and (<= main_~b~0 main_~a~0) (< main_~a~0 (+ main_~b~0 1)) (< 199999 main_~c~0) (<= main_~c~0 200000))} is VALID [2022-04-15 06:27:08,541 INFO L272 TraceCheckUtils]: 13: Hoare triple {6724#(and (<= main_~b~0 main_~a~0) (< main_~a~0 (+ main_~b~0 1)) (< 199999 main_~c~0) (<= main_~c~0 200000))} call __VERIFIER_assert((if ~a~0 == ~b~0 && 200000 == ~c~0 then 1 else 0)); {6725#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-15 06:27:08,541 INFO L290 TraceCheckUtils]: 14: Hoare triple {6725#(not (= |__VERIFIER_assert_#in~cond| 0))} ~cond := #in~cond; {6726#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-15 06:27:08,542 INFO L290 TraceCheckUtils]: 15: Hoare triple {6726#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {6716#false} is VALID [2022-04-15 06:27:08,542 INFO L290 TraceCheckUtils]: 16: Hoare triple {6716#false} assume !false; {6716#false} is VALID [2022-04-15 06:27:08,542 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-04-15 06:27:08,542 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 06:27:08,542 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1787513959] [2022-04-15 06:27:08,542 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1787513959] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 06:27:08,542 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1813976912] [2022-04-15 06:27:08,543 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 06:27:08,543 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 06:27:08,543 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 06:27:08,544 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-15 06:27:08,545 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2022-04-15 06:27:08,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:27:08,572 INFO L263 TraceCheckSpWp]: Trace formula consists of 85 conjuncts, 18 conjunts are in the unsatisfiable core [2022-04-15 06:27:08,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:27:08,579 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 06:27:08,884 INFO L272 TraceCheckUtils]: 0: Hoare triple {6715#true} call ULTIMATE.init(); {6715#true} is VALID [2022-04-15 06:27:08,884 INFO L290 TraceCheckUtils]: 1: Hoare triple {6715#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(11, 2);call #Ultimate.allocInit(12, 3);~last~0 := 0; {6715#true} is VALID [2022-04-15 06:27:08,884 INFO L290 TraceCheckUtils]: 2: Hoare triple {6715#true} assume true; {6715#true} is VALID [2022-04-15 06:27:08,884 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {6715#true} {6715#true} #66#return; {6715#true} is VALID [2022-04-15 06:27:08,884 INFO L272 TraceCheckUtils]: 4: Hoare triple {6715#true} call #t~ret6 := main(); {6715#true} is VALID [2022-04-15 06:27:08,885 INFO L290 TraceCheckUtils]: 5: Hoare triple {6715#true} assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~last~0 := #t~nondet4;havoc #t~nondet4;~a~0 := 0;~b~0 := 0;~c~0 := 0;~st~0 := 0; {6720#(and (= main_~a~0 0) (= main_~b~0 0))} is VALID [2022-04-15 06:27:08,885 INFO L290 TraceCheckUtils]: 6: Hoare triple {6720#(and (= main_~a~0 0) (= main_~b~0 0))} assume !false;~st~0 := 1;~c~0 := 0; {6721#(and (= main_~a~0 0) (= main_~st~0 1) (= main_~b~0 0))} is VALID [2022-04-15 06:27:08,886 INFO L290 TraceCheckUtils]: 7: Hoare triple {6721#(and (= main_~a~0 0) (= main_~st~0 1) (= main_~b~0 0))} [108] L23-3-->L23-4_primed: Formula: (let ((.cse0 (= v_main_~c~0_205 v_main_~c~0_204)) (.cse1 (= v_~last~0_80 v_main_~c~0_205))) (or (and (= |v_main_#t~post5_121| |v_main_#t~post5_119|) (= v_~last~0_80 v_~last~0_80) .cse0) (and (or (not (<= (+ v_~last~0_80 1) v_main_~c~0_204)) (not (<= (+ v_main_~c~0_205 1) v_~last~0_80))) (< v_main_~c~0_205 v_main_~c~0_204) (not .cse1) (< v_main_~c~0_204 200001)) (and .cse0 (= |v_main_#t~post5_119| |v_main_#t~post5_121|) (or (not (< v_main_~c~0_205 200000)) .cse1)))) InVars {main_~c~0=v_main_~c~0_205, main_#t~post5=|v_main_#t~post5_121|, ~last~0=v_~last~0_80} OutVars{main_#t~post5=|v_main_#t~post5_119|, main_~c~0=v_main_~c~0_204, ~last~0=v_~last~0_80} AuxVars[] AssignedVars[main_#t~post5, main_~c~0] {6721#(and (= main_~a~0 0) (= main_~st~0 1) (= main_~b~0 0))} is VALID [2022-04-15 06:27:08,886 INFO L290 TraceCheckUtils]: 8: Hoare triple {6721#(and (= main_~a~0 0) (= main_~st~0 1) (= main_~b~0 0))} [109] L23-4_primed-->L23-3: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {6721#(and (= main_~a~0 0) (= main_~st~0 1) (= main_~b~0 0))} is VALID [2022-04-15 06:27:08,887 INFO L290 TraceCheckUtils]: 9: Hoare triple {6721#(and (= main_~a~0 0) (= main_~st~0 1) (= main_~b~0 0))} [110] L23-3-->L23-4_primed: Formula: (let ((.cse1 (= v_~last~0_81 v_main_~c~0_207)) (.cse2 (< v_main_~c~0_207 200000)) (.cse0 (= |v_main_#t~post5_124| |v_main_#t~post5_120|)) (.cse3 (= v_main_~c~0_207 v_main_~c~0_206)) (.cse4 (= v_main_~st~0_98 v_main_~st~0_97))) (or (and .cse0 (or (not .cse1) (not .cse2)) .cse3 .cse4) (and .cse1 (< v_main_~c~0_207 v_main_~c~0_206) .cse2 (= 0 v_main_~st~0_97) (< v_main_~c~0_206 (+ 2 v_main_~c~0_207))) (and .cse0 (= v_~last~0_81 v_~last~0_81) .cse3 .cse4))) InVars {main_~c~0=v_main_~c~0_207, main_#t~post5=|v_main_#t~post5_124|, main_~st~0=v_main_~st~0_98, ~last~0=v_~last~0_81} OutVars{main_#t~post5=|v_main_#t~post5_120|, main_~c~0=v_main_~c~0_206, main_~st~0=v_main_~st~0_97, ~last~0=v_~last~0_81} AuxVars[] AssignedVars[main_#t~post5, main_~c~0, main_~st~0] {6758#(and (= main_~a~0 0) (= main_~b~0 0) (or (= main_~st~0 1) (and (< ~last~0 200000) (< ~last~0 main_~c~0) (< main_~c~0 (+ ~last~0 2)) (= main_~st~0 0))))} is VALID [2022-04-15 06:27:08,888 INFO L290 TraceCheckUtils]: 10: Hoare triple {6758#(and (= main_~a~0 0) (= main_~b~0 0) (or (= main_~st~0 1) (and (< ~last~0 200000) (< ~last~0 main_~c~0) (< main_~c~0 (+ ~last~0 2)) (= main_~st~0 0))))} [107] L23-4_primed-->L23-4: Formula: (not (< v_main_~c~0_8 200000)) InVars {main_~c~0=v_main_~c~0_8} OutVars{main_~c~0=v_main_~c~0_8} AuxVars[] AssignedVars[] {6762#(and (= main_~a~0 0) (or (and (< ~last~0 200000) (< main_~c~0 (+ ~last~0 2)) (= main_~st~0 0)) (= main_~st~0 1)) (= main_~b~0 0) (not (< main_~c~0 200000)))} is VALID [2022-04-15 06:27:08,889 INFO L290 TraceCheckUtils]: 11: Hoare triple {6762#(and (= main_~a~0 0) (or (and (< ~last~0 200000) (< main_~c~0 (+ ~last~0 2)) (= main_~st~0 0)) (= main_~st~0 1)) (= main_~b~0 0) (not (< main_~c~0 200000)))} assume 0 == ~st~0 && ~c~0 == 1 + ~last~0;~a~0 := 3 + ~a~0;~b~0 := 3 + ~b~0; {6766#(and (= main_~b~0 3) (<= 200000 main_~c~0) (< main_~c~0 200001) (= main_~a~0 3))} is VALID [2022-04-15 06:27:08,889 INFO L290 TraceCheckUtils]: 12: Hoare triple {6766#(and (= main_~b~0 3) (<= 200000 main_~c~0) (< main_~c~0 200001) (= main_~a~0 3))} assume !(~c~0 == ~last~0 && 0 == ~st~0); {6766#(and (= main_~b~0 3) (<= 200000 main_~c~0) (< main_~c~0 200001) (= main_~a~0 3))} is VALID [2022-04-15 06:27:08,890 INFO L272 TraceCheckUtils]: 13: Hoare triple {6766#(and (= main_~b~0 3) (<= 200000 main_~c~0) (< main_~c~0 200001) (= main_~a~0 3))} call __VERIFIER_assert((if ~a~0 == ~b~0 && 200000 == ~c~0 then 1 else 0)); {6773#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-15 06:27:08,890 INFO L290 TraceCheckUtils]: 14: Hoare triple {6773#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {6777#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-15 06:27:08,891 INFO L290 TraceCheckUtils]: 15: Hoare triple {6777#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {6716#false} is VALID [2022-04-15 06:27:08,891 INFO L290 TraceCheckUtils]: 16: Hoare triple {6716#false} assume !false; {6716#false} is VALID [2022-04-15 06:27:08,891 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-04-15 06:27:08,891 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 06:27:09,414 INFO L290 TraceCheckUtils]: 16: Hoare triple {6716#false} assume !false; {6716#false} is VALID [2022-04-15 06:27:09,415 INFO L290 TraceCheckUtils]: 15: Hoare triple {6777#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {6716#false} is VALID [2022-04-15 06:27:09,415 INFO L290 TraceCheckUtils]: 14: Hoare triple {6773#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {6777#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-15 06:27:09,416 INFO L272 TraceCheckUtils]: 13: Hoare triple {6724#(and (<= main_~b~0 main_~a~0) (< main_~a~0 (+ main_~b~0 1)) (< 199999 main_~c~0) (<= main_~c~0 200000))} call __VERIFIER_assert((if ~a~0 == ~b~0 && 200000 == ~c~0 then 1 else 0)); {6773#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-15 06:27:09,416 INFO L290 TraceCheckUtils]: 12: Hoare triple {6724#(and (<= main_~b~0 main_~a~0) (< main_~a~0 (+ main_~b~0 1)) (< 199999 main_~c~0) (<= main_~c~0 200000))} assume !(~c~0 == ~last~0 && 0 == ~st~0); {6724#(and (<= main_~b~0 main_~a~0) (< main_~a~0 (+ main_~b~0 1)) (< 199999 main_~c~0) (<= main_~c~0 200000))} is VALID [2022-04-15 06:27:09,417 INFO L290 TraceCheckUtils]: 11: Hoare triple {6799#(or (not (<= main_~c~0 (+ ~last~0 1))) (and (<= main_~b~0 main_~a~0) (< main_~a~0 (+ main_~b~0 1)) (< 199999 main_~c~0) (<= main_~c~0 200000)) (not (= main_~st~0 0)))} assume 0 == ~st~0 && ~c~0 == 1 + ~last~0;~a~0 := 3 + ~a~0;~b~0 := 3 + ~b~0; {6724#(and (<= main_~b~0 main_~a~0) (< main_~a~0 (+ main_~b~0 1)) (< 199999 main_~c~0) (<= main_~c~0 200000))} is VALID [2022-04-15 06:27:09,417 INFO L290 TraceCheckUtils]: 10: Hoare triple {6803#(or (not (<= main_~c~0 (+ ~last~0 1))) (and (<= main_~b~0 main_~a~0) (< main_~a~0 (+ main_~b~0 1)) (<= main_~c~0 200000)) (not (= main_~st~0 0)) (< main_~c~0 200000))} [107] L23-4_primed-->L23-4: Formula: (not (< v_main_~c~0_8 200000)) InVars {main_~c~0=v_main_~c~0_8} OutVars{main_~c~0=v_main_~c~0_8} AuxVars[] AssignedVars[] {6799#(or (not (<= main_~c~0 (+ ~last~0 1))) (and (<= main_~b~0 main_~a~0) (< main_~a~0 (+ main_~b~0 1)) (< 199999 main_~c~0) (<= main_~c~0 200000)) (not (= main_~st~0 0)))} is VALID [2022-04-15 06:27:09,418 INFO L290 TraceCheckUtils]: 9: Hoare triple {6807#(and (<= main_~b~0 main_~a~0) (< main_~a~0 (+ main_~b~0 1)) (not (= main_~st~0 0)))} [110] L23-3-->L23-4_primed: Formula: (let ((.cse1 (= v_~last~0_81 v_main_~c~0_207)) (.cse2 (< v_main_~c~0_207 200000)) (.cse0 (= |v_main_#t~post5_124| |v_main_#t~post5_120|)) (.cse3 (= v_main_~c~0_207 v_main_~c~0_206)) (.cse4 (= v_main_~st~0_98 v_main_~st~0_97))) (or (and .cse0 (or (not .cse1) (not .cse2)) .cse3 .cse4) (and .cse1 (< v_main_~c~0_207 v_main_~c~0_206) .cse2 (= 0 v_main_~st~0_97) (< v_main_~c~0_206 (+ 2 v_main_~c~0_207))) (and .cse0 (= v_~last~0_81 v_~last~0_81) .cse3 .cse4))) InVars {main_~c~0=v_main_~c~0_207, main_#t~post5=|v_main_#t~post5_124|, main_~st~0=v_main_~st~0_98, ~last~0=v_~last~0_81} OutVars{main_#t~post5=|v_main_#t~post5_120|, main_~c~0=v_main_~c~0_206, main_~st~0=v_main_~st~0_97, ~last~0=v_~last~0_81} AuxVars[] AssignedVars[main_#t~post5, main_~c~0, main_~st~0] {6803#(or (not (<= main_~c~0 (+ ~last~0 1))) (and (<= main_~b~0 main_~a~0) (< main_~a~0 (+ main_~b~0 1)) (<= main_~c~0 200000)) (not (= main_~st~0 0)) (< main_~c~0 200000))} is VALID [2022-04-15 06:27:09,418 INFO L290 TraceCheckUtils]: 8: Hoare triple {6807#(and (<= main_~b~0 main_~a~0) (< main_~a~0 (+ main_~b~0 1)) (not (= main_~st~0 0)))} [109] L23-4_primed-->L23-3: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {6807#(and (<= main_~b~0 main_~a~0) (< main_~a~0 (+ main_~b~0 1)) (not (= main_~st~0 0)))} is VALID [2022-04-15 06:27:09,419 INFO L290 TraceCheckUtils]: 7: Hoare triple {6807#(and (<= main_~b~0 main_~a~0) (< main_~a~0 (+ main_~b~0 1)) (not (= main_~st~0 0)))} [108] L23-3-->L23-4_primed: Formula: (let ((.cse0 (= v_main_~c~0_205 v_main_~c~0_204)) (.cse1 (= v_~last~0_80 v_main_~c~0_205))) (or (and (= |v_main_#t~post5_121| |v_main_#t~post5_119|) (= v_~last~0_80 v_~last~0_80) .cse0) (and (or (not (<= (+ v_~last~0_80 1) v_main_~c~0_204)) (not (<= (+ v_main_~c~0_205 1) v_~last~0_80))) (< v_main_~c~0_205 v_main_~c~0_204) (not .cse1) (< v_main_~c~0_204 200001)) (and .cse0 (= |v_main_#t~post5_119| |v_main_#t~post5_121|) (or (not (< v_main_~c~0_205 200000)) .cse1)))) InVars {main_~c~0=v_main_~c~0_205, main_#t~post5=|v_main_#t~post5_121|, ~last~0=v_~last~0_80} OutVars{main_#t~post5=|v_main_#t~post5_119|, main_~c~0=v_main_~c~0_204, ~last~0=v_~last~0_80} AuxVars[] AssignedVars[main_#t~post5, main_~c~0] {6807#(and (<= main_~b~0 main_~a~0) (< main_~a~0 (+ main_~b~0 1)) (not (= main_~st~0 0)))} is VALID [2022-04-15 06:27:09,419 INFO L290 TraceCheckUtils]: 6: Hoare triple {6817#(and (<= main_~b~0 main_~a~0) (< main_~a~0 (+ main_~b~0 1)))} assume !false;~st~0 := 1;~c~0 := 0; {6807#(and (<= main_~b~0 main_~a~0) (< main_~a~0 (+ main_~b~0 1)) (not (= main_~st~0 0)))} is VALID [2022-04-15 06:27:09,419 INFO L290 TraceCheckUtils]: 5: Hoare triple {6715#true} assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~last~0 := #t~nondet4;havoc #t~nondet4;~a~0 := 0;~b~0 := 0;~c~0 := 0;~st~0 := 0; {6817#(and (<= main_~b~0 main_~a~0) (< main_~a~0 (+ main_~b~0 1)))} is VALID [2022-04-15 06:27:09,420 INFO L272 TraceCheckUtils]: 4: Hoare triple {6715#true} call #t~ret6 := main(); {6715#true} is VALID [2022-04-15 06:27:09,420 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {6715#true} {6715#true} #66#return; {6715#true} is VALID [2022-04-15 06:27:09,420 INFO L290 TraceCheckUtils]: 2: Hoare triple {6715#true} assume true; {6715#true} is VALID [2022-04-15 06:27:09,420 INFO L290 TraceCheckUtils]: 1: Hoare triple {6715#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(11, 2);call #Ultimate.allocInit(12, 3);~last~0 := 0; {6715#true} is VALID [2022-04-15 06:27:09,420 INFO L272 TraceCheckUtils]: 0: Hoare triple {6715#true} call ULTIMATE.init(); {6715#true} is VALID [2022-04-15 06:27:09,420 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-04-15 06:27:09,420 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1813976912] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 06:27:09,420 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 06:27:09,420 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9, 9] total 19 [2022-04-15 06:27:09,804 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 06:27:09,804 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1105785548] [2022-04-15 06:27:09,804 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1105785548] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 06:27:09,804 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 06:27:09,804 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [26] imperfect sequences [] total 26 [2022-04-15 06:27:09,804 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1254638381] [2022-04-15 06:27:09,804 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 06:27:09,805 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 26 states have (on average 1.3076923076923077) internal successors, (34), 24 states have internal predecessors, (34), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 38 [2022-04-15 06:27:09,805 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 06:27:09,805 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 26 states, 26 states have (on average 1.3076923076923077) internal successors, (34), 24 states have internal predecessors, (34), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:27:09,824 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 38 edges. 38 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 06:27:09,824 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2022-04-15 06:27:09,824 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 06:27:09,824 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2022-04-15 06:27:09,825 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=201, Invalid=1059, Unknown=0, NotChecked=0, Total=1260 [2022-04-15 06:27:09,825 INFO L87 Difference]: Start difference. First operand 84 states and 102 transitions. Second operand has 26 states, 26 states have (on average 1.3076923076923077) internal successors, (34), 24 states have internal predecessors, (34), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:27:11,865 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:27:11,865 INFO L93 Difference]: Finished difference Result 146 states and 176 transitions. [2022-04-15 06:27:11,865 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2022-04-15 06:27:11,866 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 26 states have (on average 1.3076923076923077) internal successors, (34), 24 states have internal predecessors, (34), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 38 [2022-04-15 06:27:11,866 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 06:27:11,866 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26 states, 26 states have (on average 1.3076923076923077) internal successors, (34), 24 states have internal predecessors, (34), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:27:11,867 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 110 transitions. [2022-04-15 06:27:11,867 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26 states, 26 states have (on average 1.3076923076923077) internal successors, (34), 24 states have internal predecessors, (34), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:27:11,868 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 110 transitions. [2022-04-15 06:27:11,868 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 35 states and 110 transitions. [2022-04-15 06:27:11,952 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 110 edges. 110 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 06:27:11,953 INFO L225 Difference]: With dead ends: 146 [2022-04-15 06:27:11,953 INFO L226 Difference]: Without dead ends: 114 [2022-04-15 06:27:11,954 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 81 GetRequests, 34 SyntacticMatches, 2 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 624 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=298, Invalid=1864, Unknown=0, NotChecked=0, Total=2162 [2022-04-15 06:27:11,954 INFO L913 BasicCegarLoop]: 17 mSDtfsCounter, 50 mSDsluCounter, 84 mSDsCounter, 0 mSdLazyCounter, 1059 mSolverCounterSat, 45 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 52 SdHoareTripleChecker+Valid, 101 SdHoareTripleChecker+Invalid, 1104 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 45 IncrementalHoareTripleChecker+Valid, 1059 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2022-04-15 06:27:11,954 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [52 Valid, 101 Invalid, 1104 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [45 Valid, 1059 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2022-04-15 06:27:11,955 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114 states. [2022-04-15 06:27:12,113 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114 to 87. [2022-04-15 06:27:12,113 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 06:27:12,113 INFO L82 GeneralOperation]: Start isEquivalent. First operand 114 states. Second operand has 87 states, 79 states have (on average 1.2531645569620253) internal successors, (99), 80 states have internal predecessors, (99), 4 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-15 06:27:12,114 INFO L74 IsIncluded]: Start isIncluded. First operand 114 states. Second operand has 87 states, 79 states have (on average 1.2531645569620253) internal successors, (99), 80 states have internal predecessors, (99), 4 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-15 06:27:12,114 INFO L87 Difference]: Start difference. First operand 114 states. Second operand has 87 states, 79 states have (on average 1.2531645569620253) internal successors, (99), 80 states have internal predecessors, (99), 4 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-15 06:27:12,115 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:27:12,115 INFO L93 Difference]: Finished difference Result 114 states and 135 transitions. [2022-04-15 06:27:12,115 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 135 transitions. [2022-04-15 06:27:12,115 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 06:27:12,116 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 06:27:12,116 INFO L74 IsIncluded]: Start isIncluded. First operand has 87 states, 79 states have (on average 1.2531645569620253) internal successors, (99), 80 states have internal predecessors, (99), 4 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) Second operand 114 states. [2022-04-15 06:27:12,116 INFO L87 Difference]: Start difference. First operand has 87 states, 79 states have (on average 1.2531645569620253) internal successors, (99), 80 states have internal predecessors, (99), 4 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) Second operand 114 states. [2022-04-15 06:27:12,117 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:27:12,117 INFO L93 Difference]: Finished difference Result 114 states and 135 transitions. [2022-04-15 06:27:12,117 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 135 transitions. [2022-04-15 06:27:12,118 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 06:27:12,118 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 06:27:12,118 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 06:27:12,118 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 06:27:12,118 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 87 states, 79 states have (on average 1.2531645569620253) internal successors, (99), 80 states have internal predecessors, (99), 4 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-15 06:27:12,119 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 106 transitions. [2022-04-15 06:27:12,119 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 106 transitions. Word has length 38 [2022-04-15 06:27:12,119 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 06:27:12,119 INFO L478 AbstractCegarLoop]: Abstraction has 87 states and 106 transitions. [2022-04-15 06:27:12,119 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 26 states have (on average 1.3076923076923077) internal successors, (34), 24 states have internal predecessors, (34), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:27:12,119 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 87 states and 106 transitions. [2022-04-15 06:27:12,248 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 106 edges. 106 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 06:27:12,248 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 106 transitions. [2022-04-15 06:27:12,249 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2022-04-15 06:27:12,249 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 06:27:12,249 INFO L499 BasicCegarLoop]: trace histogram [6, 6, 4, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 06:27:12,266 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2022-04-15 06:27:12,462 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2022-04-15 06:27:12,463 INFO L403 AbstractCegarLoop]: === Iteration 15 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 06:27:12,463 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 06:27:12,463 INFO L85 PathProgramCache]: Analyzing trace with hash -499938394, now seen corresponding path program 2 times [2022-04-15 06:27:12,464 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 06:27:12,464 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [163285009] [2022-04-15 06:27:12,582 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 4 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {0={1=2}, 1={1=1, 2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-15 06:27:12,582 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-15 06:27:12,582 INFO L85 PathProgramCache]: Analyzing trace with hash 270515768, now seen corresponding path program 1 times [2022-04-15 06:27:12,582 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 06:27:12,582 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1843577909] [2022-04-15 06:27:12,582 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 06:27:12,582 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 06:27:12,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:27:12,635 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 06:27:12,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:27:12,639 INFO L290 TraceCheckUtils]: 0: Hoare triple {7580#(and (= ~last~0 |old(~last~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(11, 2);call #Ultimate.allocInit(12, 3);~last~0 := 0; {7571#true} is VALID [2022-04-15 06:27:12,640 INFO L290 TraceCheckUtils]: 1: Hoare triple {7571#true} assume true; {7571#true} is VALID [2022-04-15 06:27:12,640 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {7571#true} {7571#true} #66#return; {7571#true} is VALID [2022-04-15 06:27:12,640 INFO L272 TraceCheckUtils]: 0: Hoare triple {7571#true} call ULTIMATE.init(); {7580#(and (= ~last~0 |old(~last~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 06:27:12,640 INFO L290 TraceCheckUtils]: 1: Hoare triple {7580#(and (= ~last~0 |old(~last~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(11, 2);call #Ultimate.allocInit(12, 3);~last~0 := 0; {7571#true} is VALID [2022-04-15 06:27:12,640 INFO L290 TraceCheckUtils]: 2: Hoare triple {7571#true} assume true; {7571#true} is VALID [2022-04-15 06:27:12,640 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {7571#true} {7571#true} #66#return; {7571#true} is VALID [2022-04-15 06:27:12,640 INFO L272 TraceCheckUtils]: 4: Hoare triple {7571#true} call #t~ret6 := main(); {7571#true} is VALID [2022-04-15 06:27:12,640 INFO L290 TraceCheckUtils]: 5: Hoare triple {7571#true} assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~last~0 := #t~nondet4;havoc #t~nondet4;~a~0 := 0;~b~0 := 0;~c~0 := 0;~st~0 := 0; {7571#true} is VALID [2022-04-15 06:27:12,640 INFO L290 TraceCheckUtils]: 6: Hoare triple {7571#true} [112] L30-->L23-3_primed: Formula: (and (= v_main_~a~0_59 v_main_~a~0_58) (= |v_main_#t~post5_135| |v_main_#t~post5_132|) (= v_main_~b~0_56 v_main_~b~0_55) (= v_main_~st~0_109 v_main_~st~0_107) (= v_main_~c~0_235 v_main_~c~0_231)) InVars {main_~c~0=v_main_~c~0_235, main_#t~post5=|v_main_#t~post5_135|, main_~st~0=v_main_~st~0_109, main_~b~0=v_main_~b~0_56, main_~a~0=v_main_~a~0_59} OutVars{main_~c~0=v_main_~c~0_231, main_#t~post5=|v_main_#t~post5_132|, main_~st~0=v_main_~st~0_107, main_~b~0=v_main_~b~0_55, main_~a~0=v_main_~a~0_58} AuxVars[] AssignedVars[main_~c~0, main_#t~post5, main_~st~0, main_~b~0, main_~a~0] {7571#true} is VALID [2022-04-15 06:27:12,641 INFO L290 TraceCheckUtils]: 7: Hoare triple {7571#true} [111] L23-3_primed-->L23-3: Formula: (and (= v_main_~c~0_7 0) (= v_main_~st~0_6 1)) InVars {} OutVars{main_~c~0=v_main_~c~0_7, main_~st~0=v_main_~st~0_6} AuxVars[] AssignedVars[main_~c~0, main_~st~0] {7576#(= main_~c~0 0)} is VALID [2022-04-15 06:27:12,641 INFO L290 TraceCheckUtils]: 8: Hoare triple {7576#(= main_~c~0 0)} assume !!(~c~0 < 200000); {7576#(= main_~c~0 0)} is VALID [2022-04-15 06:27:12,641 INFO L290 TraceCheckUtils]: 9: Hoare triple {7576#(= main_~c~0 0)} assume ~c~0 == ~last~0;~st~0 := 0; {7576#(= main_~c~0 0)} is VALID [2022-04-15 06:27:12,641 INFO L290 TraceCheckUtils]: 10: Hoare triple {7576#(= main_~c~0 0)} #t~post5 := ~c~0;~c~0 := 1 + #t~post5;havoc #t~post5; {7577#(<= main_~c~0 1)} is VALID [2022-04-15 06:27:12,642 INFO L290 TraceCheckUtils]: 11: Hoare triple {7577#(<= main_~c~0 1)} assume !!(~c~0 < 200000); {7577#(<= main_~c~0 1)} is VALID [2022-04-15 06:27:12,642 INFO L290 TraceCheckUtils]: 12: Hoare triple {7577#(<= main_~c~0 1)} assume !(~c~0 == ~last~0); {7577#(<= main_~c~0 1)} is VALID [2022-04-15 06:27:12,642 INFO L290 TraceCheckUtils]: 13: Hoare triple {7577#(<= main_~c~0 1)} #t~post5 := ~c~0;~c~0 := 1 + #t~post5;havoc #t~post5; {7578#(<= main_~c~0 2)} is VALID [2022-04-15 06:27:12,642 INFO L290 TraceCheckUtils]: 14: Hoare triple {7578#(<= main_~c~0 2)} assume !!(~c~0 < 200000); {7578#(<= main_~c~0 2)} is VALID [2022-04-15 06:27:12,643 INFO L290 TraceCheckUtils]: 15: Hoare triple {7578#(<= main_~c~0 2)} assume !(~c~0 == ~last~0); {7578#(<= main_~c~0 2)} is VALID [2022-04-15 06:27:12,643 INFO L290 TraceCheckUtils]: 16: Hoare triple {7578#(<= main_~c~0 2)} #t~post5 := ~c~0;~c~0 := 1 + #t~post5;havoc #t~post5; {7579#(<= main_~c~0 3)} is VALID [2022-04-15 06:27:12,643 INFO L290 TraceCheckUtils]: 17: Hoare triple {7579#(<= main_~c~0 3)} assume !(~c~0 < 200000); {7572#false} is VALID [2022-04-15 06:27:12,643 INFO L290 TraceCheckUtils]: 18: Hoare triple {7572#false} assume 0 == ~st~0 && ~c~0 == 1 + ~last~0;~a~0 := 3 + ~a~0;~b~0 := 3 + ~b~0; {7572#false} is VALID [2022-04-15 06:27:12,643 INFO L290 TraceCheckUtils]: 19: Hoare triple {7572#false} assume !(~c~0 == ~last~0 && 0 == ~st~0); {7572#false} is VALID [2022-04-15 06:27:12,643 INFO L272 TraceCheckUtils]: 20: Hoare triple {7572#false} call __VERIFIER_assert((if ~a~0 == ~b~0 && 200000 == ~c~0 then 1 else 0)); {7572#false} is VALID [2022-04-15 06:27:12,643 INFO L290 TraceCheckUtils]: 21: Hoare triple {7572#false} ~cond := #in~cond; {7572#false} is VALID [2022-04-15 06:27:12,644 INFO L290 TraceCheckUtils]: 22: Hoare triple {7572#false} assume 0 == ~cond; {7572#false} is VALID [2022-04-15 06:27:12,644 INFO L290 TraceCheckUtils]: 23: Hoare triple {7572#false} assume !false; {7572#false} is VALID [2022-04-15 06:27:12,644 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 06:27:12,644 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 06:27:12,644 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1843577909] [2022-04-15 06:27:12,644 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1843577909] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 06:27:12,644 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [703187380] [2022-04-15 06:27:12,644 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 06:27:12,645 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 06:27:12,645 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 06:27:12,645 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-15 06:27:12,660 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2022-04-15 06:27:12,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:27:12,693 INFO L263 TraceCheckSpWp]: Trace formula consists of 107 conjuncts, 5 conjunts are in the unsatisfiable core [2022-04-15 06:27:12,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:27:12,698 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 06:27:12,759 INFO L272 TraceCheckUtils]: 0: Hoare triple {7571#true} call ULTIMATE.init(); {7571#true} is VALID [2022-04-15 06:27:12,760 INFO L290 TraceCheckUtils]: 1: Hoare triple {7571#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(11, 2);call #Ultimate.allocInit(12, 3);~last~0 := 0; {7571#true} is VALID [2022-04-15 06:27:12,760 INFO L290 TraceCheckUtils]: 2: Hoare triple {7571#true} assume true; {7571#true} is VALID [2022-04-15 06:27:12,760 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {7571#true} {7571#true} #66#return; {7571#true} is VALID [2022-04-15 06:27:12,760 INFO L272 TraceCheckUtils]: 4: Hoare triple {7571#true} call #t~ret6 := main(); {7571#true} is VALID [2022-04-15 06:27:12,760 INFO L290 TraceCheckUtils]: 5: Hoare triple {7571#true} assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~last~0 := #t~nondet4;havoc #t~nondet4;~a~0 := 0;~b~0 := 0;~c~0 := 0;~st~0 := 0; {7571#true} is VALID [2022-04-15 06:27:12,760 INFO L290 TraceCheckUtils]: 6: Hoare triple {7571#true} [112] L30-->L23-3_primed: Formula: (and (= v_main_~a~0_59 v_main_~a~0_58) (= |v_main_#t~post5_135| |v_main_#t~post5_132|) (= v_main_~b~0_56 v_main_~b~0_55) (= v_main_~st~0_109 v_main_~st~0_107) (= v_main_~c~0_235 v_main_~c~0_231)) InVars {main_~c~0=v_main_~c~0_235, main_#t~post5=|v_main_#t~post5_135|, main_~st~0=v_main_~st~0_109, main_~b~0=v_main_~b~0_56, main_~a~0=v_main_~a~0_59} OutVars{main_~c~0=v_main_~c~0_231, main_#t~post5=|v_main_#t~post5_132|, main_~st~0=v_main_~st~0_107, main_~b~0=v_main_~b~0_55, main_~a~0=v_main_~a~0_58} AuxVars[] AssignedVars[main_~c~0, main_#t~post5, main_~st~0, main_~b~0, main_~a~0] {7571#true} is VALID [2022-04-15 06:27:12,760 INFO L290 TraceCheckUtils]: 7: Hoare triple {7571#true} [111] L23-3_primed-->L23-3: Formula: (and (= v_main_~c~0_7 0) (= v_main_~st~0_6 1)) InVars {} OutVars{main_~c~0=v_main_~c~0_7, main_~st~0=v_main_~st~0_6} AuxVars[] AssignedVars[main_~c~0, main_~st~0] {7605#(<= main_~c~0 0)} is VALID [2022-04-15 06:27:12,762 INFO L290 TraceCheckUtils]: 8: Hoare triple {7605#(<= main_~c~0 0)} assume !!(~c~0 < 200000); {7605#(<= main_~c~0 0)} is VALID [2022-04-15 06:27:12,763 INFO L290 TraceCheckUtils]: 9: Hoare triple {7605#(<= main_~c~0 0)} assume ~c~0 == ~last~0;~st~0 := 0; {7605#(<= main_~c~0 0)} is VALID [2022-04-15 06:27:12,763 INFO L290 TraceCheckUtils]: 10: Hoare triple {7605#(<= main_~c~0 0)} #t~post5 := ~c~0;~c~0 := 1 + #t~post5;havoc #t~post5; {7577#(<= main_~c~0 1)} is VALID [2022-04-15 06:27:12,763 INFO L290 TraceCheckUtils]: 11: Hoare triple {7577#(<= main_~c~0 1)} assume !!(~c~0 < 200000); {7577#(<= main_~c~0 1)} is VALID [2022-04-15 06:27:12,764 INFO L290 TraceCheckUtils]: 12: Hoare triple {7577#(<= main_~c~0 1)} assume !(~c~0 == ~last~0); {7577#(<= main_~c~0 1)} is VALID [2022-04-15 06:27:12,764 INFO L290 TraceCheckUtils]: 13: Hoare triple {7577#(<= main_~c~0 1)} #t~post5 := ~c~0;~c~0 := 1 + #t~post5;havoc #t~post5; {7578#(<= main_~c~0 2)} is VALID [2022-04-15 06:27:12,764 INFO L290 TraceCheckUtils]: 14: Hoare triple {7578#(<= main_~c~0 2)} assume !!(~c~0 < 200000); {7578#(<= main_~c~0 2)} is VALID [2022-04-15 06:27:12,764 INFO L290 TraceCheckUtils]: 15: Hoare triple {7578#(<= main_~c~0 2)} assume !(~c~0 == ~last~0); {7578#(<= main_~c~0 2)} is VALID [2022-04-15 06:27:12,765 INFO L290 TraceCheckUtils]: 16: Hoare triple {7578#(<= main_~c~0 2)} #t~post5 := ~c~0;~c~0 := 1 + #t~post5;havoc #t~post5; {7579#(<= main_~c~0 3)} is VALID [2022-04-15 06:27:12,765 INFO L290 TraceCheckUtils]: 17: Hoare triple {7579#(<= main_~c~0 3)} assume !(~c~0 < 200000); {7572#false} is VALID [2022-04-15 06:27:12,765 INFO L290 TraceCheckUtils]: 18: Hoare triple {7572#false} assume 0 == ~st~0 && ~c~0 == 1 + ~last~0;~a~0 := 3 + ~a~0;~b~0 := 3 + ~b~0; {7572#false} is VALID [2022-04-15 06:27:12,765 INFO L290 TraceCheckUtils]: 19: Hoare triple {7572#false} assume !(~c~0 == ~last~0 && 0 == ~st~0); {7572#false} is VALID [2022-04-15 06:27:12,765 INFO L272 TraceCheckUtils]: 20: Hoare triple {7572#false} call __VERIFIER_assert((if ~a~0 == ~b~0 && 200000 == ~c~0 then 1 else 0)); {7572#false} is VALID [2022-04-15 06:27:12,765 INFO L290 TraceCheckUtils]: 21: Hoare triple {7572#false} ~cond := #in~cond; {7572#false} is VALID [2022-04-15 06:27:12,765 INFO L290 TraceCheckUtils]: 22: Hoare triple {7572#false} assume 0 == ~cond; {7572#false} is VALID [2022-04-15 06:27:12,765 INFO L290 TraceCheckUtils]: 23: Hoare triple {7572#false} assume !false; {7572#false} is VALID [2022-04-15 06:27:12,766 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 06:27:12,766 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 06:27:12,828 INFO L290 TraceCheckUtils]: 23: Hoare triple {7572#false} assume !false; {7572#false} is VALID [2022-04-15 06:27:12,829 INFO L290 TraceCheckUtils]: 22: Hoare triple {7572#false} assume 0 == ~cond; {7572#false} is VALID [2022-04-15 06:27:12,829 INFO L290 TraceCheckUtils]: 21: Hoare triple {7572#false} ~cond := #in~cond; {7572#false} is VALID [2022-04-15 06:27:12,829 INFO L272 TraceCheckUtils]: 20: Hoare triple {7572#false} call __VERIFIER_assert((if ~a~0 == ~b~0 && 200000 == ~c~0 then 1 else 0)); {7572#false} is VALID [2022-04-15 06:27:12,829 INFO L290 TraceCheckUtils]: 19: Hoare triple {7572#false} assume !(~c~0 == ~last~0 && 0 == ~st~0); {7572#false} is VALID [2022-04-15 06:27:12,829 INFO L290 TraceCheckUtils]: 18: Hoare triple {7572#false} assume 0 == ~st~0 && ~c~0 == 1 + ~last~0;~a~0 := 3 + ~a~0;~b~0 := 3 + ~b~0; {7572#false} is VALID [2022-04-15 06:27:12,831 INFO L290 TraceCheckUtils]: 17: Hoare triple {7672#(< main_~c~0 200000)} assume !(~c~0 < 200000); {7572#false} is VALID [2022-04-15 06:27:12,831 INFO L290 TraceCheckUtils]: 16: Hoare triple {7676#(< main_~c~0 199999)} #t~post5 := ~c~0;~c~0 := 1 + #t~post5;havoc #t~post5; {7672#(< main_~c~0 200000)} is VALID [2022-04-15 06:27:12,831 INFO L290 TraceCheckUtils]: 15: Hoare triple {7676#(< main_~c~0 199999)} assume !(~c~0 == ~last~0); {7676#(< main_~c~0 199999)} is VALID [2022-04-15 06:27:12,832 INFO L290 TraceCheckUtils]: 14: Hoare triple {7676#(< main_~c~0 199999)} assume !!(~c~0 < 200000); {7676#(< main_~c~0 199999)} is VALID [2022-04-15 06:27:12,832 INFO L290 TraceCheckUtils]: 13: Hoare triple {7686#(< main_~c~0 199998)} #t~post5 := ~c~0;~c~0 := 1 + #t~post5;havoc #t~post5; {7676#(< main_~c~0 199999)} is VALID [2022-04-15 06:27:12,832 INFO L290 TraceCheckUtils]: 12: Hoare triple {7686#(< main_~c~0 199998)} assume !(~c~0 == ~last~0); {7686#(< main_~c~0 199998)} is VALID [2022-04-15 06:27:12,832 INFO L290 TraceCheckUtils]: 11: Hoare triple {7686#(< main_~c~0 199998)} assume !!(~c~0 < 200000); {7686#(< main_~c~0 199998)} is VALID [2022-04-15 06:27:12,833 INFO L290 TraceCheckUtils]: 10: Hoare triple {7696#(< main_~c~0 199997)} #t~post5 := ~c~0;~c~0 := 1 + #t~post5;havoc #t~post5; {7686#(< main_~c~0 199998)} is VALID [2022-04-15 06:27:12,833 INFO L290 TraceCheckUtils]: 9: Hoare triple {7696#(< main_~c~0 199997)} assume ~c~0 == ~last~0;~st~0 := 0; {7696#(< main_~c~0 199997)} is VALID [2022-04-15 06:27:12,833 INFO L290 TraceCheckUtils]: 8: Hoare triple {7696#(< main_~c~0 199997)} assume !!(~c~0 < 200000); {7696#(< main_~c~0 199997)} is VALID [2022-04-15 06:27:12,833 INFO L290 TraceCheckUtils]: 7: Hoare triple {7571#true} [111] L23-3_primed-->L23-3: Formula: (and (= v_main_~c~0_7 0) (= v_main_~st~0_6 1)) InVars {} OutVars{main_~c~0=v_main_~c~0_7, main_~st~0=v_main_~st~0_6} AuxVars[] AssignedVars[main_~c~0, main_~st~0] {7696#(< main_~c~0 199997)} is VALID [2022-04-15 06:27:12,833 INFO L290 TraceCheckUtils]: 6: Hoare triple {7571#true} [112] L30-->L23-3_primed: Formula: (and (= v_main_~a~0_59 v_main_~a~0_58) (= |v_main_#t~post5_135| |v_main_#t~post5_132|) (= v_main_~b~0_56 v_main_~b~0_55) (= v_main_~st~0_109 v_main_~st~0_107) (= v_main_~c~0_235 v_main_~c~0_231)) InVars {main_~c~0=v_main_~c~0_235, main_#t~post5=|v_main_#t~post5_135|, main_~st~0=v_main_~st~0_109, main_~b~0=v_main_~b~0_56, main_~a~0=v_main_~a~0_59} OutVars{main_~c~0=v_main_~c~0_231, main_#t~post5=|v_main_#t~post5_132|, main_~st~0=v_main_~st~0_107, main_~b~0=v_main_~b~0_55, main_~a~0=v_main_~a~0_58} AuxVars[] AssignedVars[main_~c~0, main_#t~post5, main_~st~0, main_~b~0, main_~a~0] {7571#true} is VALID [2022-04-15 06:27:12,833 INFO L290 TraceCheckUtils]: 5: Hoare triple {7571#true} assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~last~0 := #t~nondet4;havoc #t~nondet4;~a~0 := 0;~b~0 := 0;~c~0 := 0;~st~0 := 0; {7571#true} is VALID [2022-04-15 06:27:12,833 INFO L272 TraceCheckUtils]: 4: Hoare triple {7571#true} call #t~ret6 := main(); {7571#true} is VALID [2022-04-15 06:27:12,833 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {7571#true} {7571#true} #66#return; {7571#true} is VALID [2022-04-15 06:27:12,833 INFO L290 TraceCheckUtils]: 2: Hoare triple {7571#true} assume true; {7571#true} is VALID [2022-04-15 06:27:12,834 INFO L290 TraceCheckUtils]: 1: Hoare triple {7571#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(11, 2);call #Ultimate.allocInit(12, 3);~last~0 := 0; {7571#true} is VALID [2022-04-15 06:27:12,834 INFO L272 TraceCheckUtils]: 0: Hoare triple {7571#true} call ULTIMATE.init(); {7571#true} is VALID [2022-04-15 06:27:12,834 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 06:27:12,834 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [703187380] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 06:27:12,834 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 06:27:12,834 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6, 6] total 12 [2022-04-15 06:27:12,893 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 06:27:12,894 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [163285009] [2022-04-15 06:27:12,894 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [163285009] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 06:27:12,894 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 06:27:12,894 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2022-04-15 06:27:12,894 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1439063632] [2022-04-15 06:27:12,894 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 06:27:12,894 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 2.75) internal successors, (33), 11 states have internal predecessors, (33), 2 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 41 [2022-04-15 06:27:12,894 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 06:27:12,894 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 12 states, 12 states have (on average 2.75) internal successors, (33), 11 states have internal predecessors, (33), 2 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-15 06:27:12,908 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 38 edges. 38 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 06:27:12,909 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-04-15 06:27:12,909 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 06:27:12,909 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-04-15 06:27:12,909 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=103, Invalid=169, Unknown=0, NotChecked=0, Total=272 [2022-04-15 06:27:12,909 INFO L87 Difference]: Start difference. First operand 87 states and 106 transitions. Second operand has 12 states, 12 states have (on average 2.75) internal successors, (33), 11 states have internal predecessors, (33), 2 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-15 06:27:13,402 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:27:13,402 INFO L93 Difference]: Finished difference Result 167 states and 205 transitions. [2022-04-15 06:27:13,402 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-04-15 06:27:13,402 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 2.75) internal successors, (33), 11 states have internal predecessors, (33), 2 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 41 [2022-04-15 06:27:13,402 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 06:27:13,402 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12 states, 12 states have (on average 2.75) internal successors, (33), 11 states have internal predecessors, (33), 2 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-15 06:27:13,403 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 67 transitions. [2022-04-15 06:27:13,403 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12 states, 12 states have (on average 2.75) internal successors, (33), 11 states have internal predecessors, (33), 2 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-15 06:27:13,404 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 67 transitions. [2022-04-15 06:27:13,404 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 12 states and 67 transitions. [2022-04-15 06:27:13,446 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 67 edges. 67 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 06:27:13,447 INFO L225 Difference]: With dead ends: 167 [2022-04-15 06:27:13,448 INFO L226 Difference]: Without dead ends: 127 [2022-04-15 06:27:13,448 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 81 GetRequests, 61 SyntacticMatches, 5 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 163 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=103, Invalid=169, Unknown=0, NotChecked=0, Total=272 [2022-04-15 06:27:13,450 INFO L913 BasicCegarLoop]: 18 mSDtfsCounter, 24 mSDsluCounter, 20 mSDsCounter, 0 mSdLazyCounter, 152 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 24 SdHoareTripleChecker+Valid, 38 SdHoareTripleChecker+Invalid, 162 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 152 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-15 06:27:13,450 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [24 Valid, 38 Invalid, 162 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 152 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-15 06:27:13,450 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 127 states. [2022-04-15 06:27:13,663 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 127 to 104. [2022-04-15 06:27:13,663 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 06:27:13,663 INFO L82 GeneralOperation]: Start isEquivalent. First operand 127 states. Second operand has 104 states, 96 states have (on average 1.2291666666666667) internal successors, (118), 97 states have internal predecessors, (118), 4 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-15 06:27:13,664 INFO L74 IsIncluded]: Start isIncluded. First operand 127 states. Second operand has 104 states, 96 states have (on average 1.2291666666666667) internal successors, (118), 97 states have internal predecessors, (118), 4 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-15 06:27:13,664 INFO L87 Difference]: Start difference. First operand 127 states. Second operand has 104 states, 96 states have (on average 1.2291666666666667) internal successors, (118), 97 states have internal predecessors, (118), 4 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-15 06:27:13,665 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:27:13,665 INFO L93 Difference]: Finished difference Result 127 states and 150 transitions. [2022-04-15 06:27:13,665 INFO L276 IsEmpty]: Start isEmpty. Operand 127 states and 150 transitions. [2022-04-15 06:27:13,666 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 06:27:13,666 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 06:27:13,666 INFO L74 IsIncluded]: Start isIncluded. First operand has 104 states, 96 states have (on average 1.2291666666666667) internal successors, (118), 97 states have internal predecessors, (118), 4 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) Second operand 127 states. [2022-04-15 06:27:13,666 INFO L87 Difference]: Start difference. First operand has 104 states, 96 states have (on average 1.2291666666666667) internal successors, (118), 97 states have internal predecessors, (118), 4 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) Second operand 127 states. [2022-04-15 06:27:13,667 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:27:13,667 INFO L93 Difference]: Finished difference Result 127 states and 150 transitions. [2022-04-15 06:27:13,667 INFO L276 IsEmpty]: Start isEmpty. Operand 127 states and 150 transitions. [2022-04-15 06:27:13,668 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 06:27:13,668 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 06:27:13,668 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 06:27:13,668 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 06:27:13,668 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 104 states, 96 states have (on average 1.2291666666666667) internal successors, (118), 97 states have internal predecessors, (118), 4 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-15 06:27:13,669 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 125 transitions. [2022-04-15 06:27:13,669 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 125 transitions. Word has length 41 [2022-04-15 06:27:13,669 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 06:27:13,669 INFO L478 AbstractCegarLoop]: Abstraction has 104 states and 125 transitions. [2022-04-15 06:27:13,669 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 2.75) internal successors, (33), 11 states have internal predecessors, (33), 2 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-15 06:27:13,669 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 104 states and 125 transitions. [2022-04-15 06:27:13,840 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 125 edges. 125 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 06:27:13,840 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 125 transitions. [2022-04-15 06:27:13,840 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2022-04-15 06:27:13,840 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 06:27:13,841 INFO L499 BasicCegarLoop]: trace histogram [9, 9, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 06:27:13,857 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2022-04-15 06:27:14,041 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2022-04-15 06:27:14,041 INFO L403 AbstractCegarLoop]: === Iteration 16 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 06:27:14,041 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 06:27:14,041 INFO L85 PathProgramCache]: Analyzing trace with hash -338042972, now seen corresponding path program 8 times [2022-04-15 06:27:14,042 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 06:27:14,042 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1401891520] [2022-04-15 06:27:14,231 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 1 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-15 06:27:14,388 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {0={1=1}, 1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-15 06:27:14,388 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-15 06:27:14,390 INFO L85 PathProgramCache]: Analyzing trace with hash -1487571000, now seen corresponding path program 1 times [2022-04-15 06:27:14,390 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 06:27:14,390 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [292906720] [2022-04-15 06:27:14,390 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 06:27:14,390 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 06:27:14,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:27:14,530 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 06:27:14,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:27:14,535 INFO L290 TraceCheckUtils]: 0: Hoare triple {8542#(and (= ~last~0 |old(~last~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(11, 2);call #Ultimate.allocInit(12, 3);~last~0 := 0; {8530#true} is VALID [2022-04-15 06:27:14,535 INFO L290 TraceCheckUtils]: 1: Hoare triple {8530#true} assume true; {8530#true} is VALID [2022-04-15 06:27:14,535 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {8530#true} {8530#true} #66#return; {8530#true} is VALID [2022-04-15 06:27:14,536 INFO L272 TraceCheckUtils]: 0: Hoare triple {8530#true} call ULTIMATE.init(); {8542#(and (= ~last~0 |old(~last~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 06:27:14,536 INFO L290 TraceCheckUtils]: 1: Hoare triple {8542#(and (= ~last~0 |old(~last~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(11, 2);call #Ultimate.allocInit(12, 3);~last~0 := 0; {8530#true} is VALID [2022-04-15 06:27:14,536 INFO L290 TraceCheckUtils]: 2: Hoare triple {8530#true} assume true; {8530#true} is VALID [2022-04-15 06:27:14,536 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {8530#true} {8530#true} #66#return; {8530#true} is VALID [2022-04-15 06:27:14,536 INFO L272 TraceCheckUtils]: 4: Hoare triple {8530#true} call #t~ret6 := main(); {8530#true} is VALID [2022-04-15 06:27:14,536 INFO L290 TraceCheckUtils]: 5: Hoare triple {8530#true} assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~last~0 := #t~nondet4;havoc #t~nondet4;~a~0 := 0;~b~0 := 0;~c~0 := 0;~st~0 := 0; {8535#(and (= main_~a~0 0) (= main_~b~0 0))} is VALID [2022-04-15 06:27:14,537 INFO L290 TraceCheckUtils]: 6: Hoare triple {8535#(and (= main_~a~0 0) (= main_~b~0 0))} assume !false;~st~0 := 1;~c~0 := 0; {8536#(and (= main_~a~0 0) (= main_~st~0 1) (= main_~b~0 0))} is VALID [2022-04-15 06:27:14,537 INFO L290 TraceCheckUtils]: 7: Hoare triple {8536#(and (= main_~a~0 0) (= main_~st~0 1) (= main_~b~0 0))} [114] L23-3-->L23-4_primed: Formula: (let ((.cse0 (= |v_main_#t~post5_144| |v_main_#t~post5_142|)) (.cse1 (= v_~last~0_93 v_main_~c~0_250))) (or (and (= v_~last~0_93 v_~last~0_93) .cse0 (= v_main_~c~0_250 v_main_~c~0_249)) (and (or (not (< v_main_~c~0_250 200000)) .cse1) .cse0 (= v_main_~c~0_249 v_main_~c~0_250)) (and (not .cse1) (< v_main_~c~0_249 200001) (< v_main_~c~0_250 v_main_~c~0_249) (or (not (<= (+ v_~last~0_93 1) v_main_~c~0_249)) (not (<= (+ v_main_~c~0_250 1) v_~last~0_93)))))) InVars {main_~c~0=v_main_~c~0_250, main_#t~post5=|v_main_#t~post5_144|, ~last~0=v_~last~0_93} OutVars{main_#t~post5=|v_main_#t~post5_142|, main_~c~0=v_main_~c~0_249, ~last~0=v_~last~0_93} AuxVars[] AssignedVars[main_#t~post5, main_~c~0] {8536#(and (= main_~a~0 0) (= main_~st~0 1) (= main_~b~0 0))} is VALID [2022-04-15 06:27:14,537 INFO L290 TraceCheckUtils]: 8: Hoare triple {8536#(and (= main_~a~0 0) (= main_~st~0 1) (= main_~b~0 0))} [115] L23-4_primed-->L23-3: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {8536#(and (= main_~a~0 0) (= main_~st~0 1) (= main_~b~0 0))} is VALID [2022-04-15 06:27:14,538 INFO L290 TraceCheckUtils]: 9: Hoare triple {8536#(and (= main_~a~0 0) (= main_~st~0 1) (= main_~b~0 0))} [116] L23-3-->L23-4_primed: Formula: (let ((.cse1 (< v_main_~c~0_252 200000)) (.cse0 (= v_~last~0_94 v_main_~c~0_252)) (.cse2 (= v_main_~c~0_252 v_main_~c~0_251)) (.cse3 (= |v_main_#t~post5_147| |v_main_#t~post5_143|)) (.cse4 (= v_main_~st~0_117 v_main_~st~0_116))) (or (and (< v_main_~c~0_252 v_main_~c~0_251) (= v_main_~st~0_116 0) .cse0 .cse1 (<= v_main_~c~0_251 (+ v_~last~0_94 1))) (and .cse2 .cse3 (or (not .cse1) (not .cse0)) .cse4) (and .cse2 .cse3 (= v_~last~0_94 v_~last~0_94) .cse4))) InVars {main_~c~0=v_main_~c~0_252, main_#t~post5=|v_main_#t~post5_147|, main_~st~0=v_main_~st~0_117, ~last~0=v_~last~0_94} OutVars{main_#t~post5=|v_main_#t~post5_143|, main_~c~0=v_main_~c~0_251, main_~st~0=v_main_~st~0_116, ~last~0=v_~last~0_94} AuxVars[] AssignedVars[main_#t~post5, main_~c~0, main_~st~0] {8537#(or (= main_~st~0 1) (and (= main_~a~0 0) (or (<= ~last~0 199999) (<= main_~c~0 200000)) (= main_~b~0 0)))} is VALID [2022-04-15 06:27:14,538 INFO L290 TraceCheckUtils]: 10: Hoare triple {8537#(or (= main_~st~0 1) (and (= main_~a~0 0) (or (<= ~last~0 199999) (<= main_~c~0 200000)) (= main_~b~0 0)))} [113] L23-4_primed-->L23-4: Formula: (not (< v_main_~c~0_8 200000)) InVars {main_~c~0=v_main_~c~0_8} OutVars{main_~c~0=v_main_~c~0_8} AuxVars[] AssignedVars[] {8538#(or (= main_~st~0 1) (and (= main_~a~0 0) (or (<= ~last~0 199999) (<= main_~c~0 200000)) (= main_~b~0 0) (< 199999 main_~c~0)))} is VALID [2022-04-15 06:27:14,539 INFO L290 TraceCheckUtils]: 11: Hoare triple {8538#(or (= main_~st~0 1) (and (= main_~a~0 0) (or (<= ~last~0 199999) (<= main_~c~0 200000)) (= main_~b~0 0) (< 199999 main_~c~0)))} assume 0 == ~st~0 && ~c~0 == 1 + ~last~0;~a~0 := 3 + ~a~0;~b~0 := 3 + ~b~0; {8539#(and (<= main_~b~0 main_~a~0) (< main_~a~0 (+ main_~b~0 1)) (< 199999 main_~c~0) (<= main_~c~0 200000))} is VALID [2022-04-15 06:27:14,539 INFO L290 TraceCheckUtils]: 12: Hoare triple {8539#(and (<= main_~b~0 main_~a~0) (< main_~a~0 (+ main_~b~0 1)) (< 199999 main_~c~0) (<= main_~c~0 200000))} assume !(~c~0 == ~last~0 && 0 == ~st~0); {8539#(and (<= main_~b~0 main_~a~0) (< main_~a~0 (+ main_~b~0 1)) (< 199999 main_~c~0) (<= main_~c~0 200000))} is VALID [2022-04-15 06:27:14,540 INFO L272 TraceCheckUtils]: 13: Hoare triple {8539#(and (<= main_~b~0 main_~a~0) (< main_~a~0 (+ main_~b~0 1)) (< 199999 main_~c~0) (<= main_~c~0 200000))} call __VERIFIER_assert((if ~a~0 == ~b~0 && 200000 == ~c~0 then 1 else 0)); {8540#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-15 06:27:14,540 INFO L290 TraceCheckUtils]: 14: Hoare triple {8540#(not (= |__VERIFIER_assert_#in~cond| 0))} ~cond := #in~cond; {8541#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-15 06:27:14,540 INFO L290 TraceCheckUtils]: 15: Hoare triple {8541#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {8531#false} is VALID [2022-04-15 06:27:14,540 INFO L290 TraceCheckUtils]: 16: Hoare triple {8531#false} assume !false; {8531#false} is VALID [2022-04-15 06:27:14,540 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-04-15 06:27:14,541 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 06:27:14,541 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [292906720] [2022-04-15 06:27:14,541 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [292906720] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 06:27:14,541 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1613108834] [2022-04-15 06:27:14,541 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 06:27:14,541 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 06:27:14,541 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 06:27:14,542 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-15 06:27:14,544 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2022-04-15 06:27:14,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:27:14,573 INFO L263 TraceCheckSpWp]: Trace formula consists of 85 conjuncts, 18 conjunts are in the unsatisfiable core [2022-04-15 06:27:14,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:27:14,585 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 06:27:14,829 INFO L272 TraceCheckUtils]: 0: Hoare triple {8530#true} call ULTIMATE.init(); {8530#true} is VALID [2022-04-15 06:27:14,829 INFO L290 TraceCheckUtils]: 1: Hoare triple {8530#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(11, 2);call #Ultimate.allocInit(12, 3);~last~0 := 0; {8530#true} is VALID [2022-04-15 06:27:14,829 INFO L290 TraceCheckUtils]: 2: Hoare triple {8530#true} assume true; {8530#true} is VALID [2022-04-15 06:27:14,829 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {8530#true} {8530#true} #66#return; {8530#true} is VALID [2022-04-15 06:27:14,829 INFO L272 TraceCheckUtils]: 4: Hoare triple {8530#true} call #t~ret6 := main(); {8530#true} is VALID [2022-04-15 06:27:14,830 INFO L290 TraceCheckUtils]: 5: Hoare triple {8530#true} assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~last~0 := #t~nondet4;havoc #t~nondet4;~a~0 := 0;~b~0 := 0;~c~0 := 0;~st~0 := 0; {8535#(and (= main_~a~0 0) (= main_~b~0 0))} is VALID [2022-04-15 06:27:14,830 INFO L290 TraceCheckUtils]: 6: Hoare triple {8535#(and (= main_~a~0 0) (= main_~b~0 0))} assume !false;~st~0 := 1;~c~0 := 0; {8536#(and (= main_~a~0 0) (= main_~st~0 1) (= main_~b~0 0))} is VALID [2022-04-15 06:27:14,831 INFO L290 TraceCheckUtils]: 7: Hoare triple {8536#(and (= main_~a~0 0) (= main_~st~0 1) (= main_~b~0 0))} [114] L23-3-->L23-4_primed: Formula: (let ((.cse0 (= |v_main_#t~post5_144| |v_main_#t~post5_142|)) (.cse1 (= v_~last~0_93 v_main_~c~0_250))) (or (and (= v_~last~0_93 v_~last~0_93) .cse0 (= v_main_~c~0_250 v_main_~c~0_249)) (and (or (not (< v_main_~c~0_250 200000)) .cse1) .cse0 (= v_main_~c~0_249 v_main_~c~0_250)) (and (not .cse1) (< v_main_~c~0_249 200001) (< v_main_~c~0_250 v_main_~c~0_249) (or (not (<= (+ v_~last~0_93 1) v_main_~c~0_249)) (not (<= (+ v_main_~c~0_250 1) v_~last~0_93)))))) InVars {main_~c~0=v_main_~c~0_250, main_#t~post5=|v_main_#t~post5_144|, ~last~0=v_~last~0_93} OutVars{main_#t~post5=|v_main_#t~post5_142|, main_~c~0=v_main_~c~0_249, ~last~0=v_~last~0_93} AuxVars[] AssignedVars[main_#t~post5, main_~c~0] {8536#(and (= main_~a~0 0) (= main_~st~0 1) (= main_~b~0 0))} is VALID [2022-04-15 06:27:14,831 INFO L290 TraceCheckUtils]: 8: Hoare triple {8536#(and (= main_~a~0 0) (= main_~st~0 1) (= main_~b~0 0))} [115] L23-4_primed-->L23-3: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {8536#(and (= main_~a~0 0) (= main_~st~0 1) (= main_~b~0 0))} is VALID [2022-04-15 06:27:14,832 INFO L290 TraceCheckUtils]: 9: Hoare triple {8536#(and (= main_~a~0 0) (= main_~st~0 1) (= main_~b~0 0))} [116] L23-3-->L23-4_primed: Formula: (let ((.cse1 (< v_main_~c~0_252 200000)) (.cse0 (= v_~last~0_94 v_main_~c~0_252)) (.cse2 (= v_main_~c~0_252 v_main_~c~0_251)) (.cse3 (= |v_main_#t~post5_147| |v_main_#t~post5_143|)) (.cse4 (= v_main_~st~0_117 v_main_~st~0_116))) (or (and (< v_main_~c~0_252 v_main_~c~0_251) (= v_main_~st~0_116 0) .cse0 .cse1 (<= v_main_~c~0_251 (+ v_~last~0_94 1))) (and .cse2 .cse3 (or (not .cse1) (not .cse0)) .cse4) (and .cse2 .cse3 (= v_~last~0_94 v_~last~0_94) .cse4))) InVars {main_~c~0=v_main_~c~0_252, main_#t~post5=|v_main_#t~post5_147|, main_~st~0=v_main_~st~0_117, ~last~0=v_~last~0_94} OutVars{main_#t~post5=|v_main_#t~post5_143|, main_~c~0=v_main_~c~0_251, main_~st~0=v_main_~st~0_116, ~last~0=v_~last~0_94} AuxVars[] AssignedVars[main_#t~post5, main_~c~0, main_~st~0] {8573#(and (= main_~a~0 0) (= main_~b~0 0) (or (and (< ~last~0 200000) (< ~last~0 main_~c~0) (<= main_~c~0 (+ ~last~0 1)) (= main_~st~0 0)) (= main_~st~0 1)))} is VALID [2022-04-15 06:27:14,832 INFO L290 TraceCheckUtils]: 10: Hoare triple {8573#(and (= main_~a~0 0) (= main_~b~0 0) (or (and (< ~last~0 200000) (< ~last~0 main_~c~0) (<= main_~c~0 (+ ~last~0 1)) (= main_~st~0 0)) (= main_~st~0 1)))} [113] L23-4_primed-->L23-4: Formula: (not (< v_main_~c~0_8 200000)) InVars {main_~c~0=v_main_~c~0_8} OutVars{main_~c~0=v_main_~c~0_8} AuxVars[] AssignedVars[] {8577#(and (= main_~a~0 0) (or (= main_~st~0 1) (and (< ~last~0 200000) (<= main_~c~0 (+ ~last~0 1)) (= main_~st~0 0))) (= main_~b~0 0) (not (< main_~c~0 200000)))} is VALID [2022-04-15 06:27:14,833 INFO L290 TraceCheckUtils]: 11: Hoare triple {8577#(and (= main_~a~0 0) (or (= main_~st~0 1) (and (< ~last~0 200000) (<= main_~c~0 (+ ~last~0 1)) (= main_~st~0 0))) (= main_~b~0 0) (not (< main_~c~0 200000)))} assume 0 == ~st~0 && ~c~0 == 1 + ~last~0;~a~0 := 3 + ~a~0;~b~0 := 3 + ~b~0; {8581#(and (= main_~b~0 3) (<= 200000 main_~c~0) (< main_~c~0 200001) (= main_~a~0 3))} is VALID [2022-04-15 06:27:14,833 INFO L290 TraceCheckUtils]: 12: Hoare triple {8581#(and (= main_~b~0 3) (<= 200000 main_~c~0) (< main_~c~0 200001) (= main_~a~0 3))} assume !(~c~0 == ~last~0 && 0 == ~st~0); {8581#(and (= main_~b~0 3) (<= 200000 main_~c~0) (< main_~c~0 200001) (= main_~a~0 3))} is VALID [2022-04-15 06:27:14,833 INFO L272 TraceCheckUtils]: 13: Hoare triple {8581#(and (= main_~b~0 3) (<= 200000 main_~c~0) (< main_~c~0 200001) (= main_~a~0 3))} call __VERIFIER_assert((if ~a~0 == ~b~0 && 200000 == ~c~0 then 1 else 0)); {8588#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-15 06:27:14,834 INFO L290 TraceCheckUtils]: 14: Hoare triple {8588#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {8592#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-15 06:27:14,834 INFO L290 TraceCheckUtils]: 15: Hoare triple {8592#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {8531#false} is VALID [2022-04-15 06:27:14,834 INFO L290 TraceCheckUtils]: 16: Hoare triple {8531#false} assume !false; {8531#false} is VALID [2022-04-15 06:27:14,834 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-04-15 06:27:14,834 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 06:27:15,208 INFO L290 TraceCheckUtils]: 16: Hoare triple {8531#false} assume !false; {8531#false} is VALID [2022-04-15 06:27:15,209 INFO L290 TraceCheckUtils]: 15: Hoare triple {8592#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {8531#false} is VALID [2022-04-15 06:27:15,209 INFO L290 TraceCheckUtils]: 14: Hoare triple {8588#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {8592#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-15 06:27:15,210 INFO L272 TraceCheckUtils]: 13: Hoare triple {8539#(and (<= main_~b~0 main_~a~0) (< main_~a~0 (+ main_~b~0 1)) (< 199999 main_~c~0) (<= main_~c~0 200000))} call __VERIFIER_assert((if ~a~0 == ~b~0 && 200000 == ~c~0 then 1 else 0)); {8588#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-15 06:27:15,210 INFO L290 TraceCheckUtils]: 12: Hoare triple {8539#(and (<= main_~b~0 main_~a~0) (< main_~a~0 (+ main_~b~0 1)) (< 199999 main_~c~0) (<= main_~c~0 200000))} assume !(~c~0 == ~last~0 && 0 == ~st~0); {8539#(and (<= main_~b~0 main_~a~0) (< main_~a~0 (+ main_~b~0 1)) (< 199999 main_~c~0) (<= main_~c~0 200000))} is VALID [2022-04-15 06:27:15,211 INFO L290 TraceCheckUtils]: 11: Hoare triple {8614#(or (not (<= main_~c~0 (+ ~last~0 1))) (and (<= main_~b~0 main_~a~0) (< main_~a~0 (+ main_~b~0 1)) (< 199999 main_~c~0) (<= main_~c~0 200000)) (not (= main_~st~0 0)))} assume 0 == ~st~0 && ~c~0 == 1 + ~last~0;~a~0 := 3 + ~a~0;~b~0 := 3 + ~b~0; {8539#(and (<= main_~b~0 main_~a~0) (< main_~a~0 (+ main_~b~0 1)) (< 199999 main_~c~0) (<= main_~c~0 200000))} is VALID [2022-04-15 06:27:15,212 INFO L290 TraceCheckUtils]: 10: Hoare triple {8618#(or (not (<= main_~c~0 (+ ~last~0 1))) (and (<= main_~b~0 main_~a~0) (< main_~a~0 (+ main_~b~0 1)) (<= main_~c~0 200000)) (not (= main_~st~0 0)) (< main_~c~0 200000))} [113] L23-4_primed-->L23-4: Formula: (not (< v_main_~c~0_8 200000)) InVars {main_~c~0=v_main_~c~0_8} OutVars{main_~c~0=v_main_~c~0_8} AuxVars[] AssignedVars[] {8614#(or (not (<= main_~c~0 (+ ~last~0 1))) (and (<= main_~b~0 main_~a~0) (< main_~a~0 (+ main_~b~0 1)) (< 199999 main_~c~0) (<= main_~c~0 200000)) (not (= main_~st~0 0)))} is VALID [2022-04-15 06:27:15,212 INFO L290 TraceCheckUtils]: 9: Hoare triple {8622#(and (<= main_~b~0 main_~a~0) (< main_~a~0 (+ main_~b~0 1)) (not (= main_~st~0 0)))} [116] L23-3-->L23-4_primed: Formula: (let ((.cse1 (< v_main_~c~0_252 200000)) (.cse0 (= v_~last~0_94 v_main_~c~0_252)) (.cse2 (= v_main_~c~0_252 v_main_~c~0_251)) (.cse3 (= |v_main_#t~post5_147| |v_main_#t~post5_143|)) (.cse4 (= v_main_~st~0_117 v_main_~st~0_116))) (or (and (< v_main_~c~0_252 v_main_~c~0_251) (= v_main_~st~0_116 0) .cse0 .cse1 (<= v_main_~c~0_251 (+ v_~last~0_94 1))) (and .cse2 .cse3 (or (not .cse1) (not .cse0)) .cse4) (and .cse2 .cse3 (= v_~last~0_94 v_~last~0_94) .cse4))) InVars {main_~c~0=v_main_~c~0_252, main_#t~post5=|v_main_#t~post5_147|, main_~st~0=v_main_~st~0_117, ~last~0=v_~last~0_94} OutVars{main_#t~post5=|v_main_#t~post5_143|, main_~c~0=v_main_~c~0_251, main_~st~0=v_main_~st~0_116, ~last~0=v_~last~0_94} AuxVars[] AssignedVars[main_#t~post5, main_~c~0, main_~st~0] {8618#(or (not (<= main_~c~0 (+ ~last~0 1))) (and (<= main_~b~0 main_~a~0) (< main_~a~0 (+ main_~b~0 1)) (<= main_~c~0 200000)) (not (= main_~st~0 0)) (< main_~c~0 200000))} is VALID [2022-04-15 06:27:15,213 INFO L290 TraceCheckUtils]: 8: Hoare triple {8622#(and (<= main_~b~0 main_~a~0) (< main_~a~0 (+ main_~b~0 1)) (not (= main_~st~0 0)))} [115] L23-4_primed-->L23-3: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {8622#(and (<= main_~b~0 main_~a~0) (< main_~a~0 (+ main_~b~0 1)) (not (= main_~st~0 0)))} is VALID [2022-04-15 06:27:15,213 INFO L290 TraceCheckUtils]: 7: Hoare triple {8622#(and (<= main_~b~0 main_~a~0) (< main_~a~0 (+ main_~b~0 1)) (not (= main_~st~0 0)))} [114] L23-3-->L23-4_primed: Formula: (let ((.cse0 (= |v_main_#t~post5_144| |v_main_#t~post5_142|)) (.cse1 (= v_~last~0_93 v_main_~c~0_250))) (or (and (= v_~last~0_93 v_~last~0_93) .cse0 (= v_main_~c~0_250 v_main_~c~0_249)) (and (or (not (< v_main_~c~0_250 200000)) .cse1) .cse0 (= v_main_~c~0_249 v_main_~c~0_250)) (and (not .cse1) (< v_main_~c~0_249 200001) (< v_main_~c~0_250 v_main_~c~0_249) (or (not (<= (+ v_~last~0_93 1) v_main_~c~0_249)) (not (<= (+ v_main_~c~0_250 1) v_~last~0_93)))))) InVars {main_~c~0=v_main_~c~0_250, main_#t~post5=|v_main_#t~post5_144|, ~last~0=v_~last~0_93} OutVars{main_#t~post5=|v_main_#t~post5_142|, main_~c~0=v_main_~c~0_249, ~last~0=v_~last~0_93} AuxVars[] AssignedVars[main_#t~post5, main_~c~0] {8622#(and (<= main_~b~0 main_~a~0) (< main_~a~0 (+ main_~b~0 1)) (not (= main_~st~0 0)))} is VALID [2022-04-15 06:27:15,213 INFO L290 TraceCheckUtils]: 6: Hoare triple {8632#(and (<= main_~b~0 main_~a~0) (< main_~a~0 (+ main_~b~0 1)))} assume !false;~st~0 := 1;~c~0 := 0; {8622#(and (<= main_~b~0 main_~a~0) (< main_~a~0 (+ main_~b~0 1)) (not (= main_~st~0 0)))} is VALID [2022-04-15 06:27:15,214 INFO L290 TraceCheckUtils]: 5: Hoare triple {8530#true} assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~last~0 := #t~nondet4;havoc #t~nondet4;~a~0 := 0;~b~0 := 0;~c~0 := 0;~st~0 := 0; {8632#(and (<= main_~b~0 main_~a~0) (< main_~a~0 (+ main_~b~0 1)))} is VALID [2022-04-15 06:27:15,214 INFO L272 TraceCheckUtils]: 4: Hoare triple {8530#true} call #t~ret6 := main(); {8530#true} is VALID [2022-04-15 06:27:15,214 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {8530#true} {8530#true} #66#return; {8530#true} is VALID [2022-04-15 06:27:15,214 INFO L290 TraceCheckUtils]: 2: Hoare triple {8530#true} assume true; {8530#true} is VALID [2022-04-15 06:27:15,214 INFO L290 TraceCheckUtils]: 1: Hoare triple {8530#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(11, 2);call #Ultimate.allocInit(12, 3);~last~0 := 0; {8530#true} is VALID [2022-04-15 06:27:15,214 INFO L272 TraceCheckUtils]: 0: Hoare triple {8530#true} call ULTIMATE.init(); {8530#true} is VALID [2022-04-15 06:27:15,214 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-04-15 06:27:15,214 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1613108834] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 06:27:15,215 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 06:27:15,215 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9, 9] total 19 [2022-04-15 06:27:15,789 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 06:27:15,790 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1401891520] [2022-04-15 06:27:15,790 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1401891520] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 06:27:15,790 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 06:27:15,790 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [28] imperfect sequences [] total 28 [2022-04-15 06:27:15,790 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [19132149] [2022-04-15 06:27:15,790 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 06:27:15,790 INFO L78 Accepts]: Start accepts. Automaton has has 28 states, 28 states have (on average 1.3214285714285714) internal successors, (37), 26 states have internal predecessors, (37), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 41 [2022-04-15 06:27:15,790 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 06:27:15,790 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 28 states, 28 states have (on average 1.3214285714285714) internal successors, (37), 26 states have internal predecessors, (37), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:27:15,818 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-15 06:27:15,818 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2022-04-15 06:27:15,818 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 06:27:15,819 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2022-04-15 06:27:15,819 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=216, Invalid=1190, Unknown=0, NotChecked=0, Total=1406 [2022-04-15 06:27:15,819 INFO L87 Difference]: Start difference. First operand 104 states and 125 transitions. Second operand has 28 states, 28 states have (on average 1.3214285714285714) internal successors, (37), 26 states have internal predecessors, (37), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:27:18,534 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:27:18,534 INFO L93 Difference]: Finished difference Result 173 states and 207 transitions. [2022-04-15 06:27:18,534 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2022-04-15 06:27:18,534 INFO L78 Accepts]: Start accepts. Automaton has has 28 states, 28 states have (on average 1.3214285714285714) internal successors, (37), 26 states have internal predecessors, (37), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 41 [2022-04-15 06:27:18,534 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 06:27:18,534 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28 states, 28 states have (on average 1.3214285714285714) internal successors, (37), 26 states have internal predecessors, (37), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:27:18,535 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 115 transitions. [2022-04-15 06:27:18,536 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28 states, 28 states have (on average 1.3214285714285714) internal successors, (37), 26 states have internal predecessors, (37), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:27:18,536 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 115 transitions. [2022-04-15 06:27:18,537 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 38 states and 115 transitions. [2022-04-15 06:27:18,618 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 115 edges. 115 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 06:27:18,620 INFO L225 Difference]: With dead ends: 173 [2022-04-15 06:27:18,620 INFO L226 Difference]: Without dead ends: 135 [2022-04-15 06:27:18,621 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 85 GetRequests, 35 SyntacticMatches, 2 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 706 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=323, Invalid=2127, Unknown=0, NotChecked=0, Total=2450 [2022-04-15 06:27:18,621 INFO L913 BasicCegarLoop]: 16 mSDtfsCounter, 56 mSDsluCounter, 103 mSDsCounter, 0 mSdLazyCounter, 1474 mSolverCounterSat, 48 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 58 SdHoareTripleChecker+Valid, 119 SdHoareTripleChecker+Invalid, 1522 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 48 IncrementalHoareTripleChecker+Valid, 1474 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2022-04-15 06:27:18,621 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [58 Valid, 119 Invalid, 1522 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [48 Valid, 1474 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2022-04-15 06:27:18,622 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 135 states. [2022-04-15 06:27:18,844 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 135 to 107. [2022-04-15 06:27:18,844 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 06:27:18,844 INFO L82 GeneralOperation]: Start isEquivalent. First operand 135 states. Second operand has 107 states, 99 states have (on average 1.2323232323232323) internal successors, (122), 100 states have internal predecessors, (122), 4 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-15 06:27:18,845 INFO L74 IsIncluded]: Start isIncluded. First operand 135 states. Second operand has 107 states, 99 states have (on average 1.2323232323232323) internal successors, (122), 100 states have internal predecessors, (122), 4 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-15 06:27:18,845 INFO L87 Difference]: Start difference. First operand 135 states. Second operand has 107 states, 99 states have (on average 1.2323232323232323) internal successors, (122), 100 states have internal predecessors, (122), 4 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-15 06:27:18,846 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:27:18,846 INFO L93 Difference]: Finished difference Result 135 states and 159 transitions. [2022-04-15 06:27:18,846 INFO L276 IsEmpty]: Start isEmpty. Operand 135 states and 159 transitions. [2022-04-15 06:27:18,847 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 06:27:18,847 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 06:27:18,847 INFO L74 IsIncluded]: Start isIncluded. First operand has 107 states, 99 states have (on average 1.2323232323232323) internal successors, (122), 100 states have internal predecessors, (122), 4 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) Second operand 135 states. [2022-04-15 06:27:18,847 INFO L87 Difference]: Start difference. First operand has 107 states, 99 states have (on average 1.2323232323232323) internal successors, (122), 100 states have internal predecessors, (122), 4 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) Second operand 135 states. [2022-04-15 06:27:18,848 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:27:18,849 INFO L93 Difference]: Finished difference Result 135 states and 159 transitions. [2022-04-15 06:27:18,849 INFO L276 IsEmpty]: Start isEmpty. Operand 135 states and 159 transitions. [2022-04-15 06:27:18,849 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 06:27:18,849 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 06:27:18,849 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 06:27:18,849 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 06:27:18,849 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 107 states, 99 states have (on average 1.2323232323232323) internal successors, (122), 100 states have internal predecessors, (122), 4 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-15 06:27:18,850 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 129 transitions. [2022-04-15 06:27:18,850 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 129 transitions. Word has length 41 [2022-04-15 06:27:18,850 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 06:27:18,850 INFO L478 AbstractCegarLoop]: Abstraction has 107 states and 129 transitions. [2022-04-15 06:27:18,851 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 28 states have (on average 1.3214285714285714) internal successors, (37), 26 states have internal predecessors, (37), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:27:18,851 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 107 states and 129 transitions. [2022-04-15 06:27:19,016 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-15 06:27:19,016 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 129 transitions. [2022-04-15 06:27:19,016 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2022-04-15 06:27:19,016 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 06:27:19,016 INFO L499 BasicCegarLoop]: trace histogram [10, 10, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 06:27:19,034 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2022-04-15 06:27:19,219 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2022-04-15 06:27:19,219 INFO L403 AbstractCegarLoop]: === Iteration 17 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 06:27:19,219 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 06:27:19,220 INFO L85 PathProgramCache]: Analyzing trace with hash 855627143, now seen corresponding path program 9 times [2022-04-15 06:27:19,220 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 06:27:19,220 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [709289588] [2022-04-15 06:27:19,425 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 1 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-15 06:27:19,633 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {0={1=1}, 1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-15 06:27:19,634 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-15 06:27:19,636 INFO L85 PathProgramCache]: Analyzing trace with hash 1017813192, now seen corresponding path program 1 times [2022-04-15 06:27:19,636 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 06:27:19,636 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [398311135] [2022-04-15 06:27:19,636 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 06:27:19,636 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 06:27:19,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:27:19,747 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 06:27:19,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:27:19,750 INFO L290 TraceCheckUtils]: 0: Hoare triple {9538#(and (= ~last~0 |old(~last~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(11, 2);call #Ultimate.allocInit(12, 3);~last~0 := 0; {9526#true} is VALID [2022-04-15 06:27:19,750 INFO L290 TraceCheckUtils]: 1: Hoare triple {9526#true} assume true; {9526#true} is VALID [2022-04-15 06:27:19,750 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {9526#true} {9526#true} #66#return; {9526#true} is VALID [2022-04-15 06:27:19,750 INFO L272 TraceCheckUtils]: 0: Hoare triple {9526#true} call ULTIMATE.init(); {9538#(and (= ~last~0 |old(~last~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 06:27:19,750 INFO L290 TraceCheckUtils]: 1: Hoare triple {9538#(and (= ~last~0 |old(~last~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(11, 2);call #Ultimate.allocInit(12, 3);~last~0 := 0; {9526#true} is VALID [2022-04-15 06:27:19,750 INFO L290 TraceCheckUtils]: 2: Hoare triple {9526#true} assume true; {9526#true} is VALID [2022-04-15 06:27:19,750 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {9526#true} {9526#true} #66#return; {9526#true} is VALID [2022-04-15 06:27:19,751 INFO L272 TraceCheckUtils]: 4: Hoare triple {9526#true} call #t~ret6 := main(); {9526#true} is VALID [2022-04-15 06:27:19,751 INFO L290 TraceCheckUtils]: 5: Hoare triple {9526#true} assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~last~0 := #t~nondet4;havoc #t~nondet4;~a~0 := 0;~b~0 := 0;~c~0 := 0;~st~0 := 0; {9531#(and (= main_~a~0 0) (= main_~b~0 0))} is VALID [2022-04-15 06:27:19,751 INFO L290 TraceCheckUtils]: 6: Hoare triple {9531#(and (= main_~a~0 0) (= main_~b~0 0))} assume !false;~st~0 := 1;~c~0 := 0; {9532#(and (= main_~a~0 0) (= main_~st~0 1) (= main_~b~0 0))} is VALID [2022-04-15 06:27:19,752 INFO L290 TraceCheckUtils]: 7: Hoare triple {9532#(and (= main_~a~0 0) (= main_~st~0 1) (= main_~b~0 0))} [118] L23-3-->L23-4_primed: Formula: (let ((.cse0 (= v_~last~0_101 v_main_~c~0_276)) (.cse1 (= |v_main_#t~post5_157| |v_main_#t~post5_155|)) (.cse2 (= v_main_~c~0_276 v_main_~c~0_275))) (or (and (or (not (< v_main_~c~0_276 200000)) .cse0) .cse1 .cse2) (and (not .cse0) (< v_main_~c~0_275 200001) (< v_main_~c~0_276 v_main_~c~0_275) (or (not (<= (+ v_main_~c~0_276 1) v_~last~0_101)) (not (<= (+ v_~last~0_101 1) v_main_~c~0_275)))) (and (= v_~last~0_101 v_~last~0_101) .cse1 .cse2))) InVars {main_~c~0=v_main_~c~0_276, main_#t~post5=|v_main_#t~post5_157|, ~last~0=v_~last~0_101} OutVars{main_#t~post5=|v_main_#t~post5_155|, main_~c~0=v_main_~c~0_275, ~last~0=v_~last~0_101} AuxVars[] AssignedVars[main_#t~post5, main_~c~0] {9532#(and (= main_~a~0 0) (= main_~st~0 1) (= main_~b~0 0))} is VALID [2022-04-15 06:27:19,752 INFO L290 TraceCheckUtils]: 8: Hoare triple {9532#(and (= main_~a~0 0) (= main_~st~0 1) (= main_~b~0 0))} [119] L23-4_primed-->L23-3: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {9532#(and (= main_~a~0 0) (= main_~st~0 1) (= main_~b~0 0))} is VALID [2022-04-15 06:27:19,753 INFO L290 TraceCheckUtils]: 9: Hoare triple {9532#(and (= main_~a~0 0) (= main_~st~0 1) (= main_~b~0 0))} [120] L23-3-->L23-4_primed: Formula: (let ((.cse3 (< v_main_~c~0_278 200000)) (.cse2 (= v_~last~0_102 v_main_~c~0_278)) (.cse0 (= v_main_~c~0_278 v_main_~c~0_277)) (.cse1 (= v_main_~st~0_127 v_main_~st~0_126))) (or (and .cse0 (= |v_main_#t~post5_156| |v_main_#t~post5_160|) .cse1 (or (not .cse2) (not .cse3))) (and .cse3 (< v_main_~c~0_278 v_main_~c~0_277) (= v_main_~st~0_126 0) .cse2 (< v_main_~c~0_277 (+ 2 v_main_~c~0_278))) (and .cse0 (= |v_main_#t~post5_160| |v_main_#t~post5_156|) .cse1 (= v_~last~0_102 v_~last~0_102)))) InVars {main_~c~0=v_main_~c~0_278, main_#t~post5=|v_main_#t~post5_160|, main_~st~0=v_main_~st~0_127, ~last~0=v_~last~0_102} OutVars{main_#t~post5=|v_main_#t~post5_156|, main_~c~0=v_main_~c~0_277, main_~st~0=v_main_~st~0_126, ~last~0=v_~last~0_102} AuxVars[] AssignedVars[main_#t~post5, main_~c~0, main_~st~0] {9533#(or (= main_~st~0 1) (and (= main_~a~0 0) (or (<= ~last~0 199999) (<= main_~c~0 200000)) (= main_~b~0 0)))} is VALID [2022-04-15 06:27:19,753 INFO L290 TraceCheckUtils]: 10: Hoare triple {9533#(or (= main_~st~0 1) (and (= main_~a~0 0) (or (<= ~last~0 199999) (<= main_~c~0 200000)) (= main_~b~0 0)))} [117] L23-4_primed-->L23-4: Formula: (not (< v_main_~c~0_8 200000)) InVars {main_~c~0=v_main_~c~0_8} OutVars{main_~c~0=v_main_~c~0_8} AuxVars[] AssignedVars[] {9534#(or (= main_~st~0 1) (and (= main_~a~0 0) (or (<= ~last~0 199999) (<= main_~c~0 200000)) (= main_~b~0 0) (< 199999 main_~c~0)))} is VALID [2022-04-15 06:27:19,754 INFO L290 TraceCheckUtils]: 11: Hoare triple {9534#(or (= main_~st~0 1) (and (= main_~a~0 0) (or (<= ~last~0 199999) (<= main_~c~0 200000)) (= main_~b~0 0) (< 199999 main_~c~0)))} assume 0 == ~st~0 && ~c~0 == 1 + ~last~0;~a~0 := 3 + ~a~0;~b~0 := 3 + ~b~0; {9535#(and (<= main_~b~0 main_~a~0) (< main_~a~0 (+ main_~b~0 1)) (< 199999 main_~c~0) (<= main_~c~0 200000))} is VALID [2022-04-15 06:27:19,754 INFO L290 TraceCheckUtils]: 12: Hoare triple {9535#(and (<= main_~b~0 main_~a~0) (< main_~a~0 (+ main_~b~0 1)) (< 199999 main_~c~0) (<= main_~c~0 200000))} assume !(~c~0 == ~last~0 && 0 == ~st~0); {9535#(and (<= main_~b~0 main_~a~0) (< main_~a~0 (+ main_~b~0 1)) (< 199999 main_~c~0) (<= main_~c~0 200000))} is VALID [2022-04-15 06:27:19,755 INFO L272 TraceCheckUtils]: 13: Hoare triple {9535#(and (<= main_~b~0 main_~a~0) (< main_~a~0 (+ main_~b~0 1)) (< 199999 main_~c~0) (<= main_~c~0 200000))} call __VERIFIER_assert((if ~a~0 == ~b~0 && 200000 == ~c~0 then 1 else 0)); {9536#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-15 06:27:19,755 INFO L290 TraceCheckUtils]: 14: Hoare triple {9536#(not (= |__VERIFIER_assert_#in~cond| 0))} ~cond := #in~cond; {9537#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-15 06:27:19,756 INFO L290 TraceCheckUtils]: 15: Hoare triple {9537#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {9527#false} is VALID [2022-04-15 06:27:19,756 INFO L290 TraceCheckUtils]: 16: Hoare triple {9527#false} assume !false; {9527#false} is VALID [2022-04-15 06:27:19,756 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-04-15 06:27:19,756 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 06:27:19,756 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [398311135] [2022-04-15 06:27:19,756 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [398311135] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 06:27:19,756 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [562162047] [2022-04-15 06:27:19,756 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 06:27:19,756 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 06:27:19,756 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 06:27:19,757 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-15 06:27:19,758 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2022-04-15 06:27:19,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:27:19,786 INFO L263 TraceCheckSpWp]: Trace formula consists of 85 conjuncts, 18 conjunts are in the unsatisfiable core [2022-04-15 06:27:19,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:27:19,792 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 06:27:20,017 INFO L272 TraceCheckUtils]: 0: Hoare triple {9526#true} call ULTIMATE.init(); {9526#true} is VALID [2022-04-15 06:27:20,017 INFO L290 TraceCheckUtils]: 1: Hoare triple {9526#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(11, 2);call #Ultimate.allocInit(12, 3);~last~0 := 0; {9526#true} is VALID [2022-04-15 06:27:20,017 INFO L290 TraceCheckUtils]: 2: Hoare triple {9526#true} assume true; {9526#true} is VALID [2022-04-15 06:27:20,017 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {9526#true} {9526#true} #66#return; {9526#true} is VALID [2022-04-15 06:27:20,017 INFO L272 TraceCheckUtils]: 4: Hoare triple {9526#true} call #t~ret6 := main(); {9526#true} is VALID [2022-04-15 06:27:20,017 INFO L290 TraceCheckUtils]: 5: Hoare triple {9526#true} assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~last~0 := #t~nondet4;havoc #t~nondet4;~a~0 := 0;~b~0 := 0;~c~0 := 0;~st~0 := 0; {9531#(and (= main_~a~0 0) (= main_~b~0 0))} is VALID [2022-04-15 06:27:20,018 INFO L290 TraceCheckUtils]: 6: Hoare triple {9531#(and (= main_~a~0 0) (= main_~b~0 0))} assume !false;~st~0 := 1;~c~0 := 0; {9532#(and (= main_~a~0 0) (= main_~st~0 1) (= main_~b~0 0))} is VALID [2022-04-15 06:27:20,018 INFO L290 TraceCheckUtils]: 7: Hoare triple {9532#(and (= main_~a~0 0) (= main_~st~0 1) (= main_~b~0 0))} [118] L23-3-->L23-4_primed: Formula: (let ((.cse0 (= v_~last~0_101 v_main_~c~0_276)) (.cse1 (= |v_main_#t~post5_157| |v_main_#t~post5_155|)) (.cse2 (= v_main_~c~0_276 v_main_~c~0_275))) (or (and (or (not (< v_main_~c~0_276 200000)) .cse0) .cse1 .cse2) (and (not .cse0) (< v_main_~c~0_275 200001) (< v_main_~c~0_276 v_main_~c~0_275) (or (not (<= (+ v_main_~c~0_276 1) v_~last~0_101)) (not (<= (+ v_~last~0_101 1) v_main_~c~0_275)))) (and (= v_~last~0_101 v_~last~0_101) .cse1 .cse2))) InVars {main_~c~0=v_main_~c~0_276, main_#t~post5=|v_main_#t~post5_157|, ~last~0=v_~last~0_101} OutVars{main_#t~post5=|v_main_#t~post5_155|, main_~c~0=v_main_~c~0_275, ~last~0=v_~last~0_101} AuxVars[] AssignedVars[main_#t~post5, main_~c~0] {9532#(and (= main_~a~0 0) (= main_~st~0 1) (= main_~b~0 0))} is VALID [2022-04-15 06:27:20,018 INFO L290 TraceCheckUtils]: 8: Hoare triple {9532#(and (= main_~a~0 0) (= main_~st~0 1) (= main_~b~0 0))} [119] L23-4_primed-->L23-3: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {9532#(and (= main_~a~0 0) (= main_~st~0 1) (= main_~b~0 0))} is VALID [2022-04-15 06:27:20,019 INFO L290 TraceCheckUtils]: 9: Hoare triple {9532#(and (= main_~a~0 0) (= main_~st~0 1) (= main_~b~0 0))} [120] L23-3-->L23-4_primed: Formula: (let ((.cse3 (< v_main_~c~0_278 200000)) (.cse2 (= v_~last~0_102 v_main_~c~0_278)) (.cse0 (= v_main_~c~0_278 v_main_~c~0_277)) (.cse1 (= v_main_~st~0_127 v_main_~st~0_126))) (or (and .cse0 (= |v_main_#t~post5_156| |v_main_#t~post5_160|) .cse1 (or (not .cse2) (not .cse3))) (and .cse3 (< v_main_~c~0_278 v_main_~c~0_277) (= v_main_~st~0_126 0) .cse2 (< v_main_~c~0_277 (+ 2 v_main_~c~0_278))) (and .cse0 (= |v_main_#t~post5_160| |v_main_#t~post5_156|) .cse1 (= v_~last~0_102 v_~last~0_102)))) InVars {main_~c~0=v_main_~c~0_278, main_#t~post5=|v_main_#t~post5_160|, main_~st~0=v_main_~st~0_127, ~last~0=v_~last~0_102} OutVars{main_#t~post5=|v_main_#t~post5_156|, main_~c~0=v_main_~c~0_277, main_~st~0=v_main_~st~0_126, ~last~0=v_~last~0_102} AuxVars[] AssignedVars[main_#t~post5, main_~c~0, main_~st~0] {9569#(and (= main_~a~0 0) (= main_~b~0 0) (or (= main_~st~0 1) (and (< ~last~0 200000) (< ~last~0 main_~c~0) (< main_~c~0 (+ ~last~0 2)) (= main_~st~0 0))))} is VALID [2022-04-15 06:27:20,020 INFO L290 TraceCheckUtils]: 10: Hoare triple {9569#(and (= main_~a~0 0) (= main_~b~0 0) (or (= main_~st~0 1) (and (< ~last~0 200000) (< ~last~0 main_~c~0) (< main_~c~0 (+ ~last~0 2)) (= main_~st~0 0))))} [117] L23-4_primed-->L23-4: Formula: (not (< v_main_~c~0_8 200000)) InVars {main_~c~0=v_main_~c~0_8} OutVars{main_~c~0=v_main_~c~0_8} AuxVars[] AssignedVars[] {9573#(and (= main_~a~0 0) (or (and (< ~last~0 200000) (< main_~c~0 (+ ~last~0 2)) (= main_~st~0 0)) (= main_~st~0 1)) (= main_~b~0 0) (not (< main_~c~0 200000)))} is VALID [2022-04-15 06:27:20,021 INFO L290 TraceCheckUtils]: 11: Hoare triple {9573#(and (= main_~a~0 0) (or (and (< ~last~0 200000) (< main_~c~0 (+ ~last~0 2)) (= main_~st~0 0)) (= main_~st~0 1)) (= main_~b~0 0) (not (< main_~c~0 200000)))} assume 0 == ~st~0 && ~c~0 == 1 + ~last~0;~a~0 := 3 + ~a~0;~b~0 := 3 + ~b~0; {9577#(and (= main_~b~0 3) (<= 200000 main_~c~0) (< main_~c~0 200001) (= main_~a~0 3))} is VALID [2022-04-15 06:27:20,021 INFO L290 TraceCheckUtils]: 12: Hoare triple {9577#(and (= main_~b~0 3) (<= 200000 main_~c~0) (< main_~c~0 200001) (= main_~a~0 3))} assume !(~c~0 == ~last~0 && 0 == ~st~0); {9577#(and (= main_~b~0 3) (<= 200000 main_~c~0) (< main_~c~0 200001) (= main_~a~0 3))} is VALID [2022-04-15 06:27:20,022 INFO L272 TraceCheckUtils]: 13: Hoare triple {9577#(and (= main_~b~0 3) (<= 200000 main_~c~0) (< main_~c~0 200001) (= main_~a~0 3))} call __VERIFIER_assert((if ~a~0 == ~b~0 && 200000 == ~c~0 then 1 else 0)); {9584#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-15 06:27:20,022 INFO L290 TraceCheckUtils]: 14: Hoare triple {9584#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {9588#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-15 06:27:20,022 INFO L290 TraceCheckUtils]: 15: Hoare triple {9588#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {9527#false} is VALID [2022-04-15 06:27:20,022 INFO L290 TraceCheckUtils]: 16: Hoare triple {9527#false} assume !false; {9527#false} is VALID [2022-04-15 06:27:20,022 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-04-15 06:27:20,022 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 06:27:20,353 INFO L290 TraceCheckUtils]: 16: Hoare triple {9527#false} assume !false; {9527#false} is VALID [2022-04-15 06:27:20,354 INFO L290 TraceCheckUtils]: 15: Hoare triple {9588#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {9527#false} is VALID [2022-04-15 06:27:20,354 INFO L290 TraceCheckUtils]: 14: Hoare triple {9584#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {9588#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-15 06:27:20,355 INFO L272 TraceCheckUtils]: 13: Hoare triple {9535#(and (<= main_~b~0 main_~a~0) (< main_~a~0 (+ main_~b~0 1)) (< 199999 main_~c~0) (<= main_~c~0 200000))} call __VERIFIER_assert((if ~a~0 == ~b~0 && 200000 == ~c~0 then 1 else 0)); {9584#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-15 06:27:20,355 INFO L290 TraceCheckUtils]: 12: Hoare triple {9535#(and (<= main_~b~0 main_~a~0) (< main_~a~0 (+ main_~b~0 1)) (< 199999 main_~c~0) (<= main_~c~0 200000))} assume !(~c~0 == ~last~0 && 0 == ~st~0); {9535#(and (<= main_~b~0 main_~a~0) (< main_~a~0 (+ main_~b~0 1)) (< 199999 main_~c~0) (<= main_~c~0 200000))} is VALID [2022-04-15 06:27:20,356 INFO L290 TraceCheckUtils]: 11: Hoare triple {9610#(or (not (<= main_~c~0 (+ ~last~0 1))) (and (<= main_~b~0 main_~a~0) (< main_~a~0 (+ main_~b~0 1)) (< 199999 main_~c~0) (<= main_~c~0 200000)) (not (= main_~st~0 0)))} assume 0 == ~st~0 && ~c~0 == 1 + ~last~0;~a~0 := 3 + ~a~0;~b~0 := 3 + ~b~0; {9535#(and (<= main_~b~0 main_~a~0) (< main_~a~0 (+ main_~b~0 1)) (< 199999 main_~c~0) (<= main_~c~0 200000))} is VALID [2022-04-15 06:27:20,356 INFO L290 TraceCheckUtils]: 10: Hoare triple {9614#(or (not (<= main_~c~0 (+ ~last~0 1))) (and (<= main_~b~0 main_~a~0) (< main_~a~0 (+ main_~b~0 1)) (<= main_~c~0 200000)) (not (= main_~st~0 0)) (< main_~c~0 200000))} [117] L23-4_primed-->L23-4: Formula: (not (< v_main_~c~0_8 200000)) InVars {main_~c~0=v_main_~c~0_8} OutVars{main_~c~0=v_main_~c~0_8} AuxVars[] AssignedVars[] {9610#(or (not (<= main_~c~0 (+ ~last~0 1))) (and (<= main_~b~0 main_~a~0) (< main_~a~0 (+ main_~b~0 1)) (< 199999 main_~c~0) (<= main_~c~0 200000)) (not (= main_~st~0 0)))} is VALID [2022-04-15 06:27:20,357 INFO L290 TraceCheckUtils]: 9: Hoare triple {9618#(and (<= main_~b~0 main_~a~0) (< main_~a~0 (+ main_~b~0 1)) (not (= main_~st~0 0)))} [120] L23-3-->L23-4_primed: Formula: (let ((.cse3 (< v_main_~c~0_278 200000)) (.cse2 (= v_~last~0_102 v_main_~c~0_278)) (.cse0 (= v_main_~c~0_278 v_main_~c~0_277)) (.cse1 (= v_main_~st~0_127 v_main_~st~0_126))) (or (and .cse0 (= |v_main_#t~post5_156| |v_main_#t~post5_160|) .cse1 (or (not .cse2) (not .cse3))) (and .cse3 (< v_main_~c~0_278 v_main_~c~0_277) (= v_main_~st~0_126 0) .cse2 (< v_main_~c~0_277 (+ 2 v_main_~c~0_278))) (and .cse0 (= |v_main_#t~post5_160| |v_main_#t~post5_156|) .cse1 (= v_~last~0_102 v_~last~0_102)))) InVars {main_~c~0=v_main_~c~0_278, main_#t~post5=|v_main_#t~post5_160|, main_~st~0=v_main_~st~0_127, ~last~0=v_~last~0_102} OutVars{main_#t~post5=|v_main_#t~post5_156|, main_~c~0=v_main_~c~0_277, main_~st~0=v_main_~st~0_126, ~last~0=v_~last~0_102} AuxVars[] AssignedVars[main_#t~post5, main_~c~0, main_~st~0] {9614#(or (not (<= main_~c~0 (+ ~last~0 1))) (and (<= main_~b~0 main_~a~0) (< main_~a~0 (+ main_~b~0 1)) (<= main_~c~0 200000)) (not (= main_~st~0 0)) (< main_~c~0 200000))} is VALID [2022-04-15 06:27:20,357 INFO L290 TraceCheckUtils]: 8: Hoare triple {9618#(and (<= main_~b~0 main_~a~0) (< main_~a~0 (+ main_~b~0 1)) (not (= main_~st~0 0)))} [119] L23-4_primed-->L23-3: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {9618#(and (<= main_~b~0 main_~a~0) (< main_~a~0 (+ main_~b~0 1)) (not (= main_~st~0 0)))} is VALID [2022-04-15 06:27:20,358 INFO L290 TraceCheckUtils]: 7: Hoare triple {9618#(and (<= main_~b~0 main_~a~0) (< main_~a~0 (+ main_~b~0 1)) (not (= main_~st~0 0)))} [118] L23-3-->L23-4_primed: Formula: (let ((.cse0 (= v_~last~0_101 v_main_~c~0_276)) (.cse1 (= |v_main_#t~post5_157| |v_main_#t~post5_155|)) (.cse2 (= v_main_~c~0_276 v_main_~c~0_275))) (or (and (or (not (< v_main_~c~0_276 200000)) .cse0) .cse1 .cse2) (and (not .cse0) (< v_main_~c~0_275 200001) (< v_main_~c~0_276 v_main_~c~0_275) (or (not (<= (+ v_main_~c~0_276 1) v_~last~0_101)) (not (<= (+ v_~last~0_101 1) v_main_~c~0_275)))) (and (= v_~last~0_101 v_~last~0_101) .cse1 .cse2))) InVars {main_~c~0=v_main_~c~0_276, main_#t~post5=|v_main_#t~post5_157|, ~last~0=v_~last~0_101} OutVars{main_#t~post5=|v_main_#t~post5_155|, main_~c~0=v_main_~c~0_275, ~last~0=v_~last~0_101} AuxVars[] AssignedVars[main_#t~post5, main_~c~0] {9618#(and (<= main_~b~0 main_~a~0) (< main_~a~0 (+ main_~b~0 1)) (not (= main_~st~0 0)))} is VALID [2022-04-15 06:27:20,358 INFO L290 TraceCheckUtils]: 6: Hoare triple {9628#(and (<= main_~b~0 main_~a~0) (< main_~a~0 (+ main_~b~0 1)))} assume !false;~st~0 := 1;~c~0 := 0; {9618#(and (<= main_~b~0 main_~a~0) (< main_~a~0 (+ main_~b~0 1)) (not (= main_~st~0 0)))} is VALID [2022-04-15 06:27:20,358 INFO L290 TraceCheckUtils]: 5: Hoare triple {9526#true} assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~last~0 := #t~nondet4;havoc #t~nondet4;~a~0 := 0;~b~0 := 0;~c~0 := 0;~st~0 := 0; {9628#(and (<= main_~b~0 main_~a~0) (< main_~a~0 (+ main_~b~0 1)))} is VALID [2022-04-15 06:27:20,358 INFO L272 TraceCheckUtils]: 4: Hoare triple {9526#true} call #t~ret6 := main(); {9526#true} is VALID [2022-04-15 06:27:20,358 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {9526#true} {9526#true} #66#return; {9526#true} is VALID [2022-04-15 06:27:20,359 INFO L290 TraceCheckUtils]: 2: Hoare triple {9526#true} assume true; {9526#true} is VALID [2022-04-15 06:27:20,359 INFO L290 TraceCheckUtils]: 1: Hoare triple {9526#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(11, 2);call #Ultimate.allocInit(12, 3);~last~0 := 0; {9526#true} is VALID [2022-04-15 06:27:20,359 INFO L272 TraceCheckUtils]: 0: Hoare triple {9526#true} call ULTIMATE.init(); {9526#true} is VALID [2022-04-15 06:27:20,359 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-04-15 06:27:20,359 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [562162047] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 06:27:20,359 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 06:27:20,359 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9, 9] total 19 [2022-04-15 06:27:20,977 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 06:27:20,977 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [709289588] [2022-04-15 06:27:20,977 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [709289588] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 06:27:20,977 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 06:27:20,977 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [30] imperfect sequences [] total 30 [2022-04-15 06:27:20,977 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [832625568] [2022-04-15 06:27:20,977 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 06:27:20,978 INFO L78 Accepts]: Start accepts. Automaton has has 30 states, 30 states have (on average 1.3333333333333333) internal successors, (40), 28 states have internal predecessors, (40), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 44 [2022-04-15 06:27:20,978 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 06:27:20,978 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 30 states, 30 states have (on average 1.3333333333333333) internal successors, (40), 28 states have internal predecessors, (40), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:27:21,022 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 44 edges. 44 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 06:27:21,022 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2022-04-15 06:27:21,022 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 06:27:21,022 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2022-04-15 06:27:21,023 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=231, Invalid=1329, Unknown=0, NotChecked=0, Total=1560 [2022-04-15 06:27:21,023 INFO L87 Difference]: Start difference. First operand 107 states and 129 transitions. Second operand has 30 states, 30 states have (on average 1.3333333333333333) internal successors, (40), 28 states have internal predecessors, (40), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:27:23,813 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:27:23,813 INFO L93 Difference]: Finished difference Result 177 states and 212 transitions. [2022-04-15 06:27:23,813 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2022-04-15 06:27:23,813 INFO L78 Accepts]: Start accepts. Automaton has has 30 states, 30 states have (on average 1.3333333333333333) internal successors, (40), 28 states have internal predecessors, (40), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 44 [2022-04-15 06:27:23,813 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 06:27:23,813 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30 states, 30 states have (on average 1.3333333333333333) internal successors, (40), 28 states have internal predecessors, (40), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:27:23,815 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 120 transitions. [2022-04-15 06:27:23,815 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30 states, 30 states have (on average 1.3333333333333333) internal successors, (40), 28 states have internal predecessors, (40), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:27:23,816 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 120 transitions. [2022-04-15 06:27:23,816 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 41 states and 120 transitions. [2022-04-15 06:27:23,914 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 120 edges. 120 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 06:27:23,916 INFO L225 Difference]: With dead ends: 177 [2022-04-15 06:27:23,916 INFO L226 Difference]: Without dead ends: 139 [2022-04-15 06:27:23,917 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 89 GetRequests, 36 SyntacticMatches, 2 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 793 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=348, Invalid=2408, Unknown=0, NotChecked=0, Total=2756 [2022-04-15 06:27:23,918 INFO L913 BasicCegarLoop]: 16 mSDtfsCounter, 75 mSDsluCounter, 83 mSDsCounter, 0 mSdLazyCounter, 1504 mSolverCounterSat, 53 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 77 SdHoareTripleChecker+Valid, 99 SdHoareTripleChecker+Invalid, 1557 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 53 IncrementalHoareTripleChecker+Valid, 1504 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2022-04-15 06:27:23,918 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [77 Valid, 99 Invalid, 1557 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [53 Valid, 1504 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2022-04-15 06:27:23,918 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 139 states. [2022-04-15 06:27:24,170 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 139 to 110. [2022-04-15 06:27:24,170 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 06:27:24,171 INFO L82 GeneralOperation]: Start isEquivalent. First operand 139 states. Second operand has 110 states, 102 states have (on average 1.2352941176470589) internal successors, (126), 103 states have internal predecessors, (126), 4 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-15 06:27:24,171 INFO L74 IsIncluded]: Start isIncluded. First operand 139 states. Second operand has 110 states, 102 states have (on average 1.2352941176470589) internal successors, (126), 103 states have internal predecessors, (126), 4 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-15 06:27:24,171 INFO L87 Difference]: Start difference. First operand 139 states. Second operand has 110 states, 102 states have (on average 1.2352941176470589) internal successors, (126), 103 states have internal predecessors, (126), 4 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-15 06:27:24,173 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:27:24,173 INFO L93 Difference]: Finished difference Result 139 states and 164 transitions. [2022-04-15 06:27:24,173 INFO L276 IsEmpty]: Start isEmpty. Operand 139 states and 164 transitions. [2022-04-15 06:27:24,173 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 06:27:24,173 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 06:27:24,173 INFO L74 IsIncluded]: Start isIncluded. First operand has 110 states, 102 states have (on average 1.2352941176470589) internal successors, (126), 103 states have internal predecessors, (126), 4 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) Second operand 139 states. [2022-04-15 06:27:24,173 INFO L87 Difference]: Start difference. First operand has 110 states, 102 states have (on average 1.2352941176470589) internal successors, (126), 103 states have internal predecessors, (126), 4 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) Second operand 139 states. [2022-04-15 06:27:24,175 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:27:24,175 INFO L93 Difference]: Finished difference Result 139 states and 164 transitions. [2022-04-15 06:27:24,175 INFO L276 IsEmpty]: Start isEmpty. Operand 139 states and 164 transitions. [2022-04-15 06:27:24,175 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 06:27:24,175 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 06:27:24,175 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 06:27:24,175 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 06:27:24,176 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 110 states, 102 states have (on average 1.2352941176470589) internal successors, (126), 103 states have internal predecessors, (126), 4 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-15 06:27:24,177 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 110 states and 133 transitions. [2022-04-15 06:27:24,177 INFO L78 Accepts]: Start accepts. Automaton has 110 states and 133 transitions. Word has length 44 [2022-04-15 06:27:24,177 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 06:27:24,177 INFO L478 AbstractCegarLoop]: Abstraction has 110 states and 133 transitions. [2022-04-15 06:27:24,177 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 30 states, 30 states have (on average 1.3333333333333333) internal successors, (40), 28 states have internal predecessors, (40), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:27:24,177 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 110 states and 133 transitions. [2022-04-15 06:27:24,352 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 133 edges. 133 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 06:27:24,352 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 133 transitions. [2022-04-15 06:27:24,352 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2022-04-15 06:27:24,352 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 06:27:24,353 INFO L499 BasicCegarLoop]: trace histogram [8, 8, 6, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 06:27:24,378 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Forceful destruction successful, exit code 0 [2022-04-15 06:27:24,553 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2022-04-15 06:27:24,553 INFO L403 AbstractCegarLoop]: === Iteration 18 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 06:27:24,553 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 06:27:24,553 INFO L85 PathProgramCache]: Analyzing trace with hash -625431166, now seen corresponding path program 3 times [2022-04-15 06:27:24,553 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 06:27:24,554 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [388850633] [2022-04-15 06:27:24,643 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 4 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {0={1=3}, 1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-15 06:27:24,644 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-15 06:27:24,644 INFO L85 PathProgramCache]: Analyzing trace with hash -602639053, now seen corresponding path program 1 times [2022-04-15 06:27:24,644 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 06:27:24,644 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [598305258] [2022-04-15 06:27:24,644 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 06:27:24,644 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 06:27:24,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:27:24,695 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 06:27:24,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:27:24,702 INFO L290 TraceCheckUtils]: 0: Hoare triple {10558#(and (= ~last~0 |old(~last~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(11, 2);call #Ultimate.allocInit(12, 3);~last~0 := 0; {10548#true} is VALID [2022-04-15 06:27:24,702 INFO L290 TraceCheckUtils]: 1: Hoare triple {10548#true} assume true; {10548#true} is VALID [2022-04-15 06:27:24,702 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {10548#true} {10548#true} #66#return; {10548#true} is VALID [2022-04-15 06:27:24,703 INFO L272 TraceCheckUtils]: 0: Hoare triple {10548#true} call ULTIMATE.init(); {10558#(and (= ~last~0 |old(~last~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 06:27:24,703 INFO L290 TraceCheckUtils]: 1: Hoare triple {10558#(and (= ~last~0 |old(~last~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(11, 2);call #Ultimate.allocInit(12, 3);~last~0 := 0; {10548#true} is VALID [2022-04-15 06:27:24,703 INFO L290 TraceCheckUtils]: 2: Hoare triple {10548#true} assume true; {10548#true} is VALID [2022-04-15 06:27:24,703 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {10548#true} {10548#true} #66#return; {10548#true} is VALID [2022-04-15 06:27:24,703 INFO L272 TraceCheckUtils]: 4: Hoare triple {10548#true} call #t~ret6 := main(); {10548#true} is VALID [2022-04-15 06:27:24,703 INFO L290 TraceCheckUtils]: 5: Hoare triple {10548#true} assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~last~0 := #t~nondet4;havoc #t~nondet4;~a~0 := 0;~b~0 := 0;~c~0 := 0;~st~0 := 0; {10548#true} is VALID [2022-04-15 06:27:24,703 INFO L290 TraceCheckUtils]: 6: Hoare triple {10548#true} [122] L30-->L23-3_primed: Formula: (let ((.cse0 (= v_main_~b~0_71 v_main_~b~0_70)) (.cse1 (= |v_main_#t~post5_172| |v_main_#t~post5_168|)) (.cse2 (= v_main_~a~0_74 v_main_~a~0_73)) (.cse3 (= v_main_~st~0_138 v_main_~st~0_136))) (or (and .cse0 (= v_main_~c~0_304 v_main_~c~0_309) .cse1 .cse2 .cse3) (and .cse0 (= v_main_~c~0_309 v_main_~c~0_304) .cse1 .cse2 .cse3))) InVars {main_~c~0=v_main_~c~0_309, main_#t~post5=|v_main_#t~post5_172|, main_~st~0=v_main_~st~0_138, main_~b~0=v_main_~b~0_71, main_~a~0=v_main_~a~0_74} OutVars{main_~c~0=v_main_~c~0_304, main_#t~post5=|v_main_#t~post5_168|, main_~st~0=v_main_~st~0_136, main_~b~0=v_main_~b~0_70, main_~a~0=v_main_~a~0_73} AuxVars[] AssignedVars[main_~c~0, main_#t~post5, main_~st~0, main_~b~0, main_~a~0] {10548#true} is VALID [2022-04-15 06:27:24,703 INFO L290 TraceCheckUtils]: 7: Hoare triple {10548#true} [121] L23-3_primed-->L23-3: Formula: (and (= v_main_~c~0_7 0) (= v_main_~st~0_6 1)) InVars {} OutVars{main_~c~0=v_main_~c~0_7, main_~st~0=v_main_~st~0_6} AuxVars[] AssignedVars[main_~c~0, main_~st~0] {10553#(= main_~c~0 0)} is VALID [2022-04-15 06:27:24,704 INFO L290 TraceCheckUtils]: 8: Hoare triple {10553#(= main_~c~0 0)} assume !!(~c~0 < 200000); {10553#(= main_~c~0 0)} is VALID [2022-04-15 06:27:24,704 INFO L290 TraceCheckUtils]: 9: Hoare triple {10553#(= main_~c~0 0)} assume ~c~0 == ~last~0;~st~0 := 0; {10553#(= main_~c~0 0)} is VALID [2022-04-15 06:27:24,705 INFO L290 TraceCheckUtils]: 10: Hoare triple {10553#(= main_~c~0 0)} #t~post5 := ~c~0;~c~0 := 1 + #t~post5;havoc #t~post5; {10554#(<= main_~c~0 1)} is VALID [2022-04-15 06:27:24,705 INFO L290 TraceCheckUtils]: 11: Hoare triple {10554#(<= main_~c~0 1)} assume !!(~c~0 < 200000); {10554#(<= main_~c~0 1)} is VALID [2022-04-15 06:27:24,705 INFO L290 TraceCheckUtils]: 12: Hoare triple {10554#(<= main_~c~0 1)} assume !(~c~0 == ~last~0); {10554#(<= main_~c~0 1)} is VALID [2022-04-15 06:27:24,706 INFO L290 TraceCheckUtils]: 13: Hoare triple {10554#(<= main_~c~0 1)} #t~post5 := ~c~0;~c~0 := 1 + #t~post5;havoc #t~post5; {10555#(<= main_~c~0 2)} is VALID [2022-04-15 06:27:24,706 INFO L290 TraceCheckUtils]: 14: Hoare triple {10555#(<= main_~c~0 2)} assume !!(~c~0 < 200000); {10555#(<= main_~c~0 2)} is VALID [2022-04-15 06:27:24,707 INFO L290 TraceCheckUtils]: 15: Hoare triple {10555#(<= main_~c~0 2)} assume !(~c~0 == ~last~0); {10555#(<= main_~c~0 2)} is VALID [2022-04-15 06:27:24,707 INFO L290 TraceCheckUtils]: 16: Hoare triple {10555#(<= main_~c~0 2)} #t~post5 := ~c~0;~c~0 := 1 + #t~post5;havoc #t~post5; {10556#(<= main_~c~0 3)} is VALID [2022-04-15 06:27:24,708 INFO L290 TraceCheckUtils]: 17: Hoare triple {10556#(<= main_~c~0 3)} assume !!(~c~0 < 200000); {10556#(<= main_~c~0 3)} is VALID [2022-04-15 06:27:24,708 INFO L290 TraceCheckUtils]: 18: Hoare triple {10556#(<= main_~c~0 3)} assume !(~c~0 == ~last~0); {10556#(<= main_~c~0 3)} is VALID [2022-04-15 06:27:24,709 INFO L290 TraceCheckUtils]: 19: Hoare triple {10556#(<= main_~c~0 3)} #t~post5 := ~c~0;~c~0 := 1 + #t~post5;havoc #t~post5; {10557#(<= main_~c~0 4)} is VALID [2022-04-15 06:27:24,709 INFO L290 TraceCheckUtils]: 20: Hoare triple {10557#(<= main_~c~0 4)} assume !(~c~0 < 200000); {10549#false} is VALID [2022-04-15 06:27:24,709 INFO L290 TraceCheckUtils]: 21: Hoare triple {10549#false} assume 0 == ~st~0 && ~c~0 == 1 + ~last~0;~a~0 := 3 + ~a~0;~b~0 := 3 + ~b~0; {10549#false} is VALID [2022-04-15 06:27:24,709 INFO L290 TraceCheckUtils]: 22: Hoare triple {10549#false} assume !(~c~0 == ~last~0 && 0 == ~st~0); {10549#false} is VALID [2022-04-15 06:27:24,709 INFO L272 TraceCheckUtils]: 23: Hoare triple {10549#false} call __VERIFIER_assert((if ~a~0 == ~b~0 && 200000 == ~c~0 then 1 else 0)); {10549#false} is VALID [2022-04-15 06:27:24,709 INFO L290 TraceCheckUtils]: 24: Hoare triple {10549#false} ~cond := #in~cond; {10549#false} is VALID [2022-04-15 06:27:24,709 INFO L290 TraceCheckUtils]: 25: Hoare triple {10549#false} assume 0 == ~cond; {10549#false} is VALID [2022-04-15 06:27:24,710 INFO L290 TraceCheckUtils]: 26: Hoare triple {10549#false} assume !false; {10549#false} is VALID [2022-04-15 06:27:24,710 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 06:27:24,710 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 06:27:24,710 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [598305258] [2022-04-15 06:27:24,710 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [598305258] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 06:27:24,711 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1396262277] [2022-04-15 06:27:24,711 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 06:27:24,711 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 06:27:24,711 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 06:27:24,712 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-15 06:27:24,713 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2022-04-15 06:27:24,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:27:24,743 INFO L263 TraceCheckSpWp]: Trace formula consists of 102 conjuncts, 6 conjunts are in the unsatisfiable core [2022-04-15 06:27:24,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:27:24,749 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 06:27:24,853 INFO L272 TraceCheckUtils]: 0: Hoare triple {10548#true} call ULTIMATE.init(); {10548#true} is VALID [2022-04-15 06:27:24,854 INFO L290 TraceCheckUtils]: 1: Hoare triple {10548#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(11, 2);call #Ultimate.allocInit(12, 3);~last~0 := 0; {10548#true} is VALID [2022-04-15 06:27:24,854 INFO L290 TraceCheckUtils]: 2: Hoare triple {10548#true} assume true; {10548#true} is VALID [2022-04-15 06:27:24,854 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {10548#true} {10548#true} #66#return; {10548#true} is VALID [2022-04-15 06:27:24,854 INFO L272 TraceCheckUtils]: 4: Hoare triple {10548#true} call #t~ret6 := main(); {10548#true} is VALID [2022-04-15 06:27:24,854 INFO L290 TraceCheckUtils]: 5: Hoare triple {10548#true} assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~last~0 := #t~nondet4;havoc #t~nondet4;~a~0 := 0;~b~0 := 0;~c~0 := 0;~st~0 := 0; {10548#true} is VALID [2022-04-15 06:27:24,854 INFO L290 TraceCheckUtils]: 6: Hoare triple {10548#true} [122] L30-->L23-3_primed: Formula: (let ((.cse0 (= v_main_~b~0_71 v_main_~b~0_70)) (.cse1 (= |v_main_#t~post5_172| |v_main_#t~post5_168|)) (.cse2 (= v_main_~a~0_74 v_main_~a~0_73)) (.cse3 (= v_main_~st~0_138 v_main_~st~0_136))) (or (and .cse0 (= v_main_~c~0_304 v_main_~c~0_309) .cse1 .cse2 .cse3) (and .cse0 (= v_main_~c~0_309 v_main_~c~0_304) .cse1 .cse2 .cse3))) InVars {main_~c~0=v_main_~c~0_309, main_#t~post5=|v_main_#t~post5_172|, main_~st~0=v_main_~st~0_138, main_~b~0=v_main_~b~0_71, main_~a~0=v_main_~a~0_74} OutVars{main_~c~0=v_main_~c~0_304, main_#t~post5=|v_main_#t~post5_168|, main_~st~0=v_main_~st~0_136, main_~b~0=v_main_~b~0_70, main_~a~0=v_main_~a~0_73} AuxVars[] AssignedVars[main_~c~0, main_#t~post5, main_~st~0, main_~b~0, main_~a~0] {10548#true} is VALID [2022-04-15 06:27:24,854 INFO L290 TraceCheckUtils]: 7: Hoare triple {10548#true} [121] L23-3_primed-->L23-3: Formula: (and (= v_main_~c~0_7 0) (= v_main_~st~0_6 1)) InVars {} OutVars{main_~c~0=v_main_~c~0_7, main_~st~0=v_main_~st~0_6} AuxVars[] AssignedVars[main_~c~0, main_~st~0] {10583#(<= main_~c~0 0)} is VALID [2022-04-15 06:27:24,855 INFO L290 TraceCheckUtils]: 8: Hoare triple {10583#(<= main_~c~0 0)} assume !!(~c~0 < 200000); {10583#(<= main_~c~0 0)} is VALID [2022-04-15 06:27:24,855 INFO L290 TraceCheckUtils]: 9: Hoare triple {10583#(<= main_~c~0 0)} assume ~c~0 == ~last~0;~st~0 := 0; {10583#(<= main_~c~0 0)} is VALID [2022-04-15 06:27:24,855 INFO L290 TraceCheckUtils]: 10: Hoare triple {10583#(<= main_~c~0 0)} #t~post5 := ~c~0;~c~0 := 1 + #t~post5;havoc #t~post5; {10554#(<= main_~c~0 1)} is VALID [2022-04-15 06:27:24,856 INFO L290 TraceCheckUtils]: 11: Hoare triple {10554#(<= main_~c~0 1)} assume !!(~c~0 < 200000); {10554#(<= main_~c~0 1)} is VALID [2022-04-15 06:27:24,856 INFO L290 TraceCheckUtils]: 12: Hoare triple {10554#(<= main_~c~0 1)} assume !(~c~0 == ~last~0); {10554#(<= main_~c~0 1)} is VALID [2022-04-15 06:27:24,856 INFO L290 TraceCheckUtils]: 13: Hoare triple {10554#(<= main_~c~0 1)} #t~post5 := ~c~0;~c~0 := 1 + #t~post5;havoc #t~post5; {10555#(<= main_~c~0 2)} is VALID [2022-04-15 06:27:24,857 INFO L290 TraceCheckUtils]: 14: Hoare triple {10555#(<= main_~c~0 2)} assume !!(~c~0 < 200000); {10555#(<= main_~c~0 2)} is VALID [2022-04-15 06:27:24,857 INFO L290 TraceCheckUtils]: 15: Hoare triple {10555#(<= main_~c~0 2)} assume !(~c~0 == ~last~0); {10555#(<= main_~c~0 2)} is VALID [2022-04-15 06:27:24,858 INFO L290 TraceCheckUtils]: 16: Hoare triple {10555#(<= main_~c~0 2)} #t~post5 := ~c~0;~c~0 := 1 + #t~post5;havoc #t~post5; {10556#(<= main_~c~0 3)} is VALID [2022-04-15 06:27:24,858 INFO L290 TraceCheckUtils]: 17: Hoare triple {10556#(<= main_~c~0 3)} assume !!(~c~0 < 200000); {10556#(<= main_~c~0 3)} is VALID [2022-04-15 06:27:24,858 INFO L290 TraceCheckUtils]: 18: Hoare triple {10556#(<= main_~c~0 3)} assume !(~c~0 == ~last~0); {10556#(<= main_~c~0 3)} is VALID [2022-04-15 06:27:24,859 INFO L290 TraceCheckUtils]: 19: Hoare triple {10556#(<= main_~c~0 3)} #t~post5 := ~c~0;~c~0 := 1 + #t~post5;havoc #t~post5; {10557#(<= main_~c~0 4)} is VALID [2022-04-15 06:27:24,859 INFO L290 TraceCheckUtils]: 20: Hoare triple {10557#(<= main_~c~0 4)} assume !(~c~0 < 200000); {10549#false} is VALID [2022-04-15 06:27:24,859 INFO L290 TraceCheckUtils]: 21: Hoare triple {10549#false} assume 0 == ~st~0 && ~c~0 == 1 + ~last~0;~a~0 := 3 + ~a~0;~b~0 := 3 + ~b~0; {10549#false} is VALID [2022-04-15 06:27:24,859 INFO L290 TraceCheckUtils]: 22: Hoare triple {10549#false} assume !(~c~0 == ~last~0 && 0 == ~st~0); {10549#false} is VALID [2022-04-15 06:27:24,859 INFO L272 TraceCheckUtils]: 23: Hoare triple {10549#false} call __VERIFIER_assert((if ~a~0 == ~b~0 && 200000 == ~c~0 then 1 else 0)); {10549#false} is VALID [2022-04-15 06:27:24,859 INFO L290 TraceCheckUtils]: 24: Hoare triple {10549#false} ~cond := #in~cond; {10549#false} is VALID [2022-04-15 06:27:24,859 INFO L290 TraceCheckUtils]: 25: Hoare triple {10549#false} assume 0 == ~cond; {10549#false} is VALID [2022-04-15 06:27:24,859 INFO L290 TraceCheckUtils]: 26: Hoare triple {10549#false} assume !false; {10549#false} is VALID [2022-04-15 06:27:24,860 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 06:27:24,860 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 06:27:25,007 INFO L290 TraceCheckUtils]: 26: Hoare triple {10549#false} assume !false; {10549#false} is VALID [2022-04-15 06:27:25,007 INFO L290 TraceCheckUtils]: 25: Hoare triple {10549#false} assume 0 == ~cond; {10549#false} is VALID [2022-04-15 06:27:25,007 INFO L290 TraceCheckUtils]: 24: Hoare triple {10549#false} ~cond := #in~cond; {10549#false} is VALID [2022-04-15 06:27:25,007 INFO L272 TraceCheckUtils]: 23: Hoare triple {10549#false} call __VERIFIER_assert((if ~a~0 == ~b~0 && 200000 == ~c~0 then 1 else 0)); {10549#false} is VALID [2022-04-15 06:27:25,007 INFO L290 TraceCheckUtils]: 22: Hoare triple {10549#false} assume !(~c~0 == ~last~0 && 0 == ~st~0); {10549#false} is VALID [2022-04-15 06:27:25,007 INFO L290 TraceCheckUtils]: 21: Hoare triple {10549#false} assume 0 == ~st~0 && ~c~0 == 1 + ~last~0;~a~0 := 3 + ~a~0;~b~0 := 3 + ~b~0; {10549#false} is VALID [2022-04-15 06:27:25,008 INFO L290 TraceCheckUtils]: 20: Hoare triple {10659#(< main_~c~0 200000)} assume !(~c~0 < 200000); {10549#false} is VALID [2022-04-15 06:27:25,008 INFO L290 TraceCheckUtils]: 19: Hoare triple {10663#(< main_~c~0 199999)} #t~post5 := ~c~0;~c~0 := 1 + #t~post5;havoc #t~post5; {10659#(< main_~c~0 200000)} is VALID [2022-04-15 06:27:25,008 INFO L290 TraceCheckUtils]: 18: Hoare triple {10663#(< main_~c~0 199999)} assume !(~c~0 == ~last~0); {10663#(< main_~c~0 199999)} is VALID [2022-04-15 06:27:25,009 INFO L290 TraceCheckUtils]: 17: Hoare triple {10663#(< main_~c~0 199999)} assume !!(~c~0 < 200000); {10663#(< main_~c~0 199999)} is VALID [2022-04-15 06:27:25,009 INFO L290 TraceCheckUtils]: 16: Hoare triple {10673#(< main_~c~0 199998)} #t~post5 := ~c~0;~c~0 := 1 + #t~post5;havoc #t~post5; {10663#(< main_~c~0 199999)} is VALID [2022-04-15 06:27:25,009 INFO L290 TraceCheckUtils]: 15: Hoare triple {10673#(< main_~c~0 199998)} assume !(~c~0 == ~last~0); {10673#(< main_~c~0 199998)} is VALID [2022-04-15 06:27:25,010 INFO L290 TraceCheckUtils]: 14: Hoare triple {10673#(< main_~c~0 199998)} assume !!(~c~0 < 200000); {10673#(< main_~c~0 199998)} is VALID [2022-04-15 06:27:25,010 INFO L290 TraceCheckUtils]: 13: Hoare triple {10683#(< main_~c~0 199997)} #t~post5 := ~c~0;~c~0 := 1 + #t~post5;havoc #t~post5; {10673#(< main_~c~0 199998)} is VALID [2022-04-15 06:27:25,010 INFO L290 TraceCheckUtils]: 12: Hoare triple {10683#(< main_~c~0 199997)} assume !(~c~0 == ~last~0); {10683#(< main_~c~0 199997)} is VALID [2022-04-15 06:27:25,011 INFO L290 TraceCheckUtils]: 11: Hoare triple {10683#(< main_~c~0 199997)} assume !!(~c~0 < 200000); {10683#(< main_~c~0 199997)} is VALID [2022-04-15 06:27:25,011 INFO L290 TraceCheckUtils]: 10: Hoare triple {10693#(< main_~c~0 199996)} #t~post5 := ~c~0;~c~0 := 1 + #t~post5;havoc #t~post5; {10683#(< main_~c~0 199997)} is VALID [2022-04-15 06:27:25,011 INFO L290 TraceCheckUtils]: 9: Hoare triple {10693#(< main_~c~0 199996)} assume ~c~0 == ~last~0;~st~0 := 0; {10693#(< main_~c~0 199996)} is VALID [2022-04-15 06:27:25,012 INFO L290 TraceCheckUtils]: 8: Hoare triple {10693#(< main_~c~0 199996)} assume !!(~c~0 < 200000); {10693#(< main_~c~0 199996)} is VALID [2022-04-15 06:27:25,012 INFO L290 TraceCheckUtils]: 7: Hoare triple {10548#true} [121] L23-3_primed-->L23-3: Formula: (and (= v_main_~c~0_7 0) (= v_main_~st~0_6 1)) InVars {} OutVars{main_~c~0=v_main_~c~0_7, main_~st~0=v_main_~st~0_6} AuxVars[] AssignedVars[main_~c~0, main_~st~0] {10693#(< main_~c~0 199996)} is VALID [2022-04-15 06:27:25,012 INFO L290 TraceCheckUtils]: 6: Hoare triple {10548#true} [122] L30-->L23-3_primed: Formula: (let ((.cse0 (= v_main_~b~0_71 v_main_~b~0_70)) (.cse1 (= |v_main_#t~post5_172| |v_main_#t~post5_168|)) (.cse2 (= v_main_~a~0_74 v_main_~a~0_73)) (.cse3 (= v_main_~st~0_138 v_main_~st~0_136))) (or (and .cse0 (= v_main_~c~0_304 v_main_~c~0_309) .cse1 .cse2 .cse3) (and .cse0 (= v_main_~c~0_309 v_main_~c~0_304) .cse1 .cse2 .cse3))) InVars {main_~c~0=v_main_~c~0_309, main_#t~post5=|v_main_#t~post5_172|, main_~st~0=v_main_~st~0_138, main_~b~0=v_main_~b~0_71, main_~a~0=v_main_~a~0_74} OutVars{main_~c~0=v_main_~c~0_304, main_#t~post5=|v_main_#t~post5_168|, main_~st~0=v_main_~st~0_136, main_~b~0=v_main_~b~0_70, main_~a~0=v_main_~a~0_73} AuxVars[] AssignedVars[main_~c~0, main_#t~post5, main_~st~0, main_~b~0, main_~a~0] {10548#true} is VALID [2022-04-15 06:27:25,012 INFO L290 TraceCheckUtils]: 5: Hoare triple {10548#true} assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~last~0 := #t~nondet4;havoc #t~nondet4;~a~0 := 0;~b~0 := 0;~c~0 := 0;~st~0 := 0; {10548#true} is VALID [2022-04-15 06:27:25,012 INFO L272 TraceCheckUtils]: 4: Hoare triple {10548#true} call #t~ret6 := main(); {10548#true} is VALID [2022-04-15 06:27:25,012 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {10548#true} {10548#true} #66#return; {10548#true} is VALID [2022-04-15 06:27:25,012 INFO L290 TraceCheckUtils]: 2: Hoare triple {10548#true} assume true; {10548#true} is VALID [2022-04-15 06:27:25,012 INFO L290 TraceCheckUtils]: 1: Hoare triple {10548#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(11, 2);call #Ultimate.allocInit(12, 3);~last~0 := 0; {10548#true} is VALID [2022-04-15 06:27:25,012 INFO L272 TraceCheckUtils]: 0: Hoare triple {10548#true} call ULTIMATE.init(); {10548#true} is VALID [2022-04-15 06:27:25,013 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 06:27:25,013 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1396262277] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 06:27:25,013 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 06:27:25,013 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7, 7] total 14 [2022-04-15 06:27:25,119 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 06:27:25,119 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [388850633] [2022-04-15 06:27:25,119 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [388850633] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 06:27:25,119 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 06:27:25,119 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2022-04-15 06:27:25,119 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [750750327] [2022-04-15 06:27:25,120 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 06:27:25,120 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 2.7857142857142856) internal successors, (39), 13 states have internal predecessors, (39), 2 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 47 [2022-04-15 06:27:25,120 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 06:27:25,120 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 14 states, 14 states have (on average 2.7857142857142856) internal successors, (39), 13 states have internal predecessors, (39), 2 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-15 06:27:25,148 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 44 edges. 44 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 06:27:25,149 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-04-15 06:27:25,149 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 06:27:25,149 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-04-15 06:27:25,149 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=144, Invalid=236, Unknown=0, NotChecked=0, Total=380 [2022-04-15 06:27:25,149 INFO L87 Difference]: Start difference. First operand 110 states and 133 transitions. Second operand has 14 states, 14 states have (on average 2.7857142857142856) internal successors, (39), 13 states have internal predecessors, (39), 2 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-15 06:27:25,806 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:27:25,807 INFO L93 Difference]: Finished difference Result 204 states and 248 transitions. [2022-04-15 06:27:25,807 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-04-15 06:27:25,807 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 2.7857142857142856) internal successors, (39), 13 states have internal predecessors, (39), 2 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 47 [2022-04-15 06:27:25,807 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 06:27:25,807 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 14 states have (on average 2.7857142857142856) internal successors, (39), 13 states have internal predecessors, (39), 2 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-15 06:27:25,808 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 74 transitions. [2022-04-15 06:27:25,808 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 14 states have (on average 2.7857142857142856) internal successors, (39), 13 states have internal predecessors, (39), 2 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-15 06:27:25,808 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 74 transitions. [2022-04-15 06:27:25,808 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 14 states and 74 transitions. [2022-04-15 06:27:25,864 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 74 edges. 74 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 06:27:25,866 INFO L225 Difference]: With dead ends: 204 [2022-04-15 06:27:25,866 INFO L226 Difference]: Without dead ends: 158 [2022-04-15 06:27:25,867 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 91 GetRequests, 67 SyntacticMatches, 6 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 246 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=144, Invalid=236, Unknown=0, NotChecked=0, Total=380 [2022-04-15 06:27:25,867 INFO L913 BasicCegarLoop]: 18 mSDtfsCounter, 32 mSDsluCounter, 24 mSDsCounter, 0 mSdLazyCounter, 209 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 32 SdHoareTripleChecker+Valid, 42 SdHoareTripleChecker+Invalid, 222 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 209 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-15 06:27:25,867 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [32 Valid, 42 Invalid, 222 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 209 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-15 06:27:25,867 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 158 states. [2022-04-15 06:27:26,133 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 158 to 130. [2022-04-15 06:27:26,133 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 06:27:26,133 INFO L82 GeneralOperation]: Start isEquivalent. First operand 158 states. Second operand has 130 states, 122 states have (on average 1.2131147540983607) internal successors, (148), 123 states have internal predecessors, (148), 4 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-15 06:27:26,133 INFO L74 IsIncluded]: Start isIncluded. First operand 158 states. Second operand has 130 states, 122 states have (on average 1.2131147540983607) internal successors, (148), 123 states have internal predecessors, (148), 4 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-15 06:27:26,134 INFO L87 Difference]: Start difference. First operand 158 states. Second operand has 130 states, 122 states have (on average 1.2131147540983607) internal successors, (148), 123 states have internal predecessors, (148), 4 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-15 06:27:26,135 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:27:26,135 INFO L93 Difference]: Finished difference Result 158 states and 185 transitions. [2022-04-15 06:27:26,136 INFO L276 IsEmpty]: Start isEmpty. Operand 158 states and 185 transitions. [2022-04-15 06:27:26,136 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 06:27:26,136 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 06:27:26,136 INFO L74 IsIncluded]: Start isIncluded. First operand has 130 states, 122 states have (on average 1.2131147540983607) internal successors, (148), 123 states have internal predecessors, (148), 4 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) Second operand 158 states. [2022-04-15 06:27:26,136 INFO L87 Difference]: Start difference. First operand has 130 states, 122 states have (on average 1.2131147540983607) internal successors, (148), 123 states have internal predecessors, (148), 4 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) Second operand 158 states. [2022-04-15 06:27:26,138 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:27:26,138 INFO L93 Difference]: Finished difference Result 158 states and 185 transitions. [2022-04-15 06:27:26,138 INFO L276 IsEmpty]: Start isEmpty. Operand 158 states and 185 transitions. [2022-04-15 06:27:26,138 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 06:27:26,138 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 06:27:26,138 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 06:27:26,138 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 06:27:26,138 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 130 states, 122 states have (on average 1.2131147540983607) internal successors, (148), 123 states have internal predecessors, (148), 4 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-15 06:27:26,140 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 130 states to 130 states and 155 transitions. [2022-04-15 06:27:26,140 INFO L78 Accepts]: Start accepts. Automaton has 130 states and 155 transitions. Word has length 47 [2022-04-15 06:27:26,140 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 06:27:26,140 INFO L478 AbstractCegarLoop]: Abstraction has 130 states and 155 transitions. [2022-04-15 06:27:26,140 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 2.7857142857142856) internal successors, (39), 13 states have internal predecessors, (39), 2 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-15 06:27:26,140 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 130 states and 155 transitions. [2022-04-15 06:27:26,345 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 155 edges. 155 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 06:27:26,346 INFO L276 IsEmpty]: Start isEmpty. Operand 130 states and 155 transitions. [2022-04-15 06:27:26,346 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2022-04-15 06:27:26,346 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 06:27:26,346 INFO L499 BasicCegarLoop]: trace histogram [11, 11, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 06:27:26,362 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Forceful destruction successful, exit code 0 [2022-04-15 06:27:26,546 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2022-04-15 06:27:26,547 INFO L403 AbstractCegarLoop]: === Iteration 19 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 06:27:26,547 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 06:27:26,547 INFO L85 PathProgramCache]: Analyzing trace with hash -847187772, now seen corresponding path program 10 times [2022-04-15 06:27:26,547 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 06:27:26,547 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [226298232] [2022-04-15 06:27:30,668 WARN L970 rdanLoopAcceleration]: Unable to prove correctness of quantifier elimination. [2022-04-15 06:27:33,293 WARN L977 rdanLoopAcceleration]: Unable to prove correctness of quantifier elimination. [2022-04-15 06:27:33,401 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 1 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-15 06:27:33,604 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {0={1=1}, 1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-15 06:27:33,605 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-15 06:27:33,608 INFO L85 PathProgramCache]: Analyzing trace with hash 480922184, now seen corresponding path program 1 times [2022-04-15 06:27:33,608 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 06:27:33,608 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2039787104] [2022-04-15 06:27:33,608 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 06:27:33,608 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 06:27:33,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:27:33,743 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 06:27:33,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:27:33,746 INFO L290 TraceCheckUtils]: 0: Hoare triple {11729#(and (= ~last~0 |old(~last~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(11, 2);call #Ultimate.allocInit(12, 3);~last~0 := 0; {11716#true} is VALID [2022-04-15 06:27:33,747 INFO L290 TraceCheckUtils]: 1: Hoare triple {11716#true} assume true; {11716#true} is VALID [2022-04-15 06:27:33,747 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {11716#true} {11716#true} #66#return; {11716#true} is VALID [2022-04-15 06:27:33,747 INFO L272 TraceCheckUtils]: 0: Hoare triple {11716#true} call ULTIMATE.init(); {11729#(and (= ~last~0 |old(~last~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 06:27:33,747 INFO L290 TraceCheckUtils]: 1: Hoare triple {11729#(and (= ~last~0 |old(~last~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(11, 2);call #Ultimate.allocInit(12, 3);~last~0 := 0; {11716#true} is VALID [2022-04-15 06:27:33,747 INFO L290 TraceCheckUtils]: 2: Hoare triple {11716#true} assume true; {11716#true} is VALID [2022-04-15 06:27:33,747 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {11716#true} {11716#true} #66#return; {11716#true} is VALID [2022-04-15 06:27:33,747 INFO L272 TraceCheckUtils]: 4: Hoare triple {11716#true} call #t~ret6 := main(); {11716#true} is VALID [2022-04-15 06:27:33,748 INFO L290 TraceCheckUtils]: 5: Hoare triple {11716#true} assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~last~0 := #t~nondet4;havoc #t~nondet4;~a~0 := 0;~b~0 := 0;~c~0 := 0;~st~0 := 0; {11721#(and (= main_~a~0 0) (= main_~b~0 0))} is VALID [2022-04-15 06:27:33,748 INFO L290 TraceCheckUtils]: 6: Hoare triple {11721#(and (= main_~a~0 0) (= main_~b~0 0))} assume !false;~st~0 := 1;~c~0 := 0; {11722#(and (= main_~a~0 0) (= main_~b~0 0) (= main_~c~0 0))} is VALID [2022-04-15 06:27:33,749 INFO L290 TraceCheckUtils]: 7: Hoare triple {11722#(and (= main_~a~0 0) (= main_~b~0 0) (= main_~c~0 0))} [124] L23-3-->L23-4_primed: Formula: (let ((.cse1 (= v_main_~c~0_327 v_main_~c~0_326)) (.cse0 (= v_~last~0_114 v_main_~c~0_327))) (or (and (< v_main_~c~0_326 200001) (or (not (<= (+ v_main_~c~0_327 1) v_~last~0_114)) (not (<= (+ v_~last~0_114 1) v_main_~c~0_326))) (not .cse0) (< v_main_~c~0_327 v_main_~c~0_326)) (and (= v_~last~0_114 v_~last~0_114) .cse1 (= |v_main_#t~post5_182| |v_main_#t~post5_180|)) (and .cse1 (or (not (< v_main_~c~0_327 200000)) .cse0) (= |v_main_#t~post5_180| |v_main_#t~post5_182|)))) InVars {main_~c~0=v_main_~c~0_327, main_#t~post5=|v_main_#t~post5_182|, ~last~0=v_~last~0_114} OutVars{main_#t~post5=|v_main_#t~post5_180|, main_~c~0=v_main_~c~0_326, ~last~0=v_~last~0_114} AuxVars[] AssignedVars[main_#t~post5, main_~c~0] {11723#(and (= main_~a~0 0) (= main_~b~0 0) (<= main_~c~0 200000))} is VALID [2022-04-15 06:27:33,749 INFO L290 TraceCheckUtils]: 8: Hoare triple {11723#(and (= main_~a~0 0) (= main_~b~0 0) (<= main_~c~0 200000))} [125] L23-4_primed-->L23-3: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {11723#(and (= main_~a~0 0) (= main_~b~0 0) (<= main_~c~0 200000))} is VALID [2022-04-15 06:27:33,750 INFO L290 TraceCheckUtils]: 9: Hoare triple {11723#(and (= main_~a~0 0) (= main_~b~0 0) (<= main_~c~0 200000))} [126] L23-3-->L23-4_primed: Formula: (let ((.cse0 (= v_main_~st~0_146 v_main_~st~0_145)) (.cse1 (= |v_main_#t~post5_185| |v_main_#t~post5_181|)) (.cse2 (= v_main_~c~0_329 v_main_~c~0_328)) (.cse4 (= v_~last~0_115 v_main_~c~0_329)) (.cse3 (< v_main_~c~0_329 200000))) (or (and .cse0 .cse1 .cse2 (= v_~last~0_115 v_~last~0_115)) (and .cse0 (or (not .cse3) (not .cse4)) .cse1 .cse2) (and .cse4 (< v_main_~c~0_329 v_main_~c~0_328) (= v_main_~st~0_145 0) (<= v_main_~c~0_328 (+ v_~last~0_115 1)) .cse3))) InVars {main_~c~0=v_main_~c~0_329, main_#t~post5=|v_main_#t~post5_185|, main_~st~0=v_main_~st~0_146, ~last~0=v_~last~0_115} OutVars{main_#t~post5=|v_main_#t~post5_181|, main_~c~0=v_main_~c~0_328, main_~st~0=v_main_~st~0_145, ~last~0=v_~last~0_115} AuxVars[] AssignedVars[main_#t~post5, main_~c~0, main_~st~0] {11724#(and (= main_~a~0 0) (or (<= ~last~0 199999) (<= main_~c~0 200000)) (= main_~b~0 0))} is VALID [2022-04-15 06:27:33,750 INFO L290 TraceCheckUtils]: 10: Hoare triple {11724#(and (= main_~a~0 0) (or (<= ~last~0 199999) (<= main_~c~0 200000)) (= main_~b~0 0))} [123] L23-4_primed-->L23-4: Formula: (not (< v_main_~c~0_8 200000)) InVars {main_~c~0=v_main_~c~0_8} OutVars{main_~c~0=v_main_~c~0_8} AuxVars[] AssignedVars[] {11725#(and (= main_~a~0 0) (= main_~b~0 0) (or (and (< 199999 main_~c~0) (<= main_~c~0 200000)) (and (<= ~last~0 199999) (< 199999 main_~c~0))))} is VALID [2022-04-15 06:27:33,751 INFO L290 TraceCheckUtils]: 11: Hoare triple {11725#(and (= main_~a~0 0) (= main_~b~0 0) (or (and (< 199999 main_~c~0) (<= main_~c~0 200000)) (and (<= ~last~0 199999) (< 199999 main_~c~0))))} assume 0 == ~st~0 && ~c~0 == 1 + ~last~0;~a~0 := 3 + ~a~0;~b~0 := 3 + ~b~0; {11726#(and (<= main_~b~0 main_~a~0) (< main_~a~0 (+ main_~b~0 1)) (< 199999 main_~c~0) (<= main_~c~0 200000))} is VALID [2022-04-15 06:27:33,751 INFO L290 TraceCheckUtils]: 12: Hoare triple {11726#(and (<= main_~b~0 main_~a~0) (< main_~a~0 (+ main_~b~0 1)) (< 199999 main_~c~0) (<= main_~c~0 200000))} assume !(~c~0 == ~last~0 && 0 == ~st~0); {11726#(and (<= main_~b~0 main_~a~0) (< main_~a~0 (+ main_~b~0 1)) (< 199999 main_~c~0) (<= main_~c~0 200000))} is VALID [2022-04-15 06:27:33,752 INFO L272 TraceCheckUtils]: 13: Hoare triple {11726#(and (<= main_~b~0 main_~a~0) (< main_~a~0 (+ main_~b~0 1)) (< 199999 main_~c~0) (<= main_~c~0 200000))} call __VERIFIER_assert((if ~a~0 == ~b~0 && 200000 == ~c~0 then 1 else 0)); {11727#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-15 06:27:33,752 INFO L290 TraceCheckUtils]: 14: Hoare triple {11727#(not (= |__VERIFIER_assert_#in~cond| 0))} ~cond := #in~cond; {11728#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-15 06:27:33,753 INFO L290 TraceCheckUtils]: 15: Hoare triple {11728#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {11717#false} is VALID [2022-04-15 06:27:33,753 INFO L290 TraceCheckUtils]: 16: Hoare triple {11717#false} assume !false; {11717#false} is VALID [2022-04-15 06:27:33,753 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 06:27:33,753 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 06:27:33,753 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2039787104] [2022-04-15 06:27:33,753 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2039787104] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 06:27:33,753 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1440307661] [2022-04-15 06:27:33,753 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 06:27:33,754 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 06:27:33,754 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 06:27:33,755 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-15 06:27:33,756 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2022-04-15 06:27:33,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:27:33,784 INFO L263 TraceCheckSpWp]: Trace formula consists of 85 conjuncts, 18 conjunts are in the unsatisfiable core [2022-04-15 06:27:33,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:27:33,790 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 06:27:34,076 INFO L272 TraceCheckUtils]: 0: Hoare triple {11716#true} call ULTIMATE.init(); {11716#true} is VALID [2022-04-15 06:27:34,077 INFO L290 TraceCheckUtils]: 1: Hoare triple {11716#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(11, 2);call #Ultimate.allocInit(12, 3);~last~0 := 0; {11716#true} is VALID [2022-04-15 06:27:34,077 INFO L290 TraceCheckUtils]: 2: Hoare triple {11716#true} assume true; {11716#true} is VALID [2022-04-15 06:27:34,077 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {11716#true} {11716#true} #66#return; {11716#true} is VALID [2022-04-15 06:27:34,077 INFO L272 TraceCheckUtils]: 4: Hoare triple {11716#true} call #t~ret6 := main(); {11716#true} is VALID [2022-04-15 06:27:34,077 INFO L290 TraceCheckUtils]: 5: Hoare triple {11716#true} assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~last~0 := #t~nondet4;havoc #t~nondet4;~a~0 := 0;~b~0 := 0;~c~0 := 0;~st~0 := 0; {11721#(and (= main_~a~0 0) (= main_~b~0 0))} is VALID [2022-04-15 06:27:34,078 INFO L290 TraceCheckUtils]: 6: Hoare triple {11721#(and (= main_~a~0 0) (= main_~b~0 0))} assume !false;~st~0 := 1;~c~0 := 0; {11751#(and (= main_~a~0 0) (= main_~st~0 1) (= main_~b~0 0))} is VALID [2022-04-15 06:27:34,078 INFO L290 TraceCheckUtils]: 7: Hoare triple {11751#(and (= main_~a~0 0) (= main_~st~0 1) (= main_~b~0 0))} [124] L23-3-->L23-4_primed: Formula: (let ((.cse1 (= v_main_~c~0_327 v_main_~c~0_326)) (.cse0 (= v_~last~0_114 v_main_~c~0_327))) (or (and (< v_main_~c~0_326 200001) (or (not (<= (+ v_main_~c~0_327 1) v_~last~0_114)) (not (<= (+ v_~last~0_114 1) v_main_~c~0_326))) (not .cse0) (< v_main_~c~0_327 v_main_~c~0_326)) (and (= v_~last~0_114 v_~last~0_114) .cse1 (= |v_main_#t~post5_182| |v_main_#t~post5_180|)) (and .cse1 (or (not (< v_main_~c~0_327 200000)) .cse0) (= |v_main_#t~post5_180| |v_main_#t~post5_182|)))) InVars {main_~c~0=v_main_~c~0_327, main_#t~post5=|v_main_#t~post5_182|, ~last~0=v_~last~0_114} OutVars{main_#t~post5=|v_main_#t~post5_180|, main_~c~0=v_main_~c~0_326, ~last~0=v_~last~0_114} AuxVars[] AssignedVars[main_#t~post5, main_~c~0] {11751#(and (= main_~a~0 0) (= main_~st~0 1) (= main_~b~0 0))} is VALID [2022-04-15 06:27:34,079 INFO L290 TraceCheckUtils]: 8: Hoare triple {11751#(and (= main_~a~0 0) (= main_~st~0 1) (= main_~b~0 0))} [125] L23-4_primed-->L23-3: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {11751#(and (= main_~a~0 0) (= main_~st~0 1) (= main_~b~0 0))} is VALID [2022-04-15 06:27:34,096 INFO L290 TraceCheckUtils]: 9: Hoare triple {11751#(and (= main_~a~0 0) (= main_~st~0 1) (= main_~b~0 0))} [126] L23-3-->L23-4_primed: Formula: (let ((.cse0 (= v_main_~st~0_146 v_main_~st~0_145)) (.cse1 (= |v_main_#t~post5_185| |v_main_#t~post5_181|)) (.cse2 (= v_main_~c~0_329 v_main_~c~0_328)) (.cse4 (= v_~last~0_115 v_main_~c~0_329)) (.cse3 (< v_main_~c~0_329 200000))) (or (and .cse0 .cse1 .cse2 (= v_~last~0_115 v_~last~0_115)) (and .cse0 (or (not .cse3) (not .cse4)) .cse1 .cse2) (and .cse4 (< v_main_~c~0_329 v_main_~c~0_328) (= v_main_~st~0_145 0) (<= v_main_~c~0_328 (+ v_~last~0_115 1)) .cse3))) InVars {main_~c~0=v_main_~c~0_329, main_#t~post5=|v_main_#t~post5_185|, main_~st~0=v_main_~st~0_146, ~last~0=v_~last~0_115} OutVars{main_#t~post5=|v_main_#t~post5_181|, main_~c~0=v_main_~c~0_328, main_~st~0=v_main_~st~0_145, ~last~0=v_~last~0_115} AuxVars[] AssignedVars[main_#t~post5, main_~c~0, main_~st~0] {11761#(and (= main_~a~0 0) (= main_~b~0 0) (or (and (< ~last~0 200000) (< ~last~0 main_~c~0) (<= main_~c~0 (+ ~last~0 1)) (= main_~st~0 0)) (= main_~st~0 1)))} is VALID [2022-04-15 06:27:34,097 INFO L290 TraceCheckUtils]: 10: Hoare triple {11761#(and (= main_~a~0 0) (= main_~b~0 0) (or (and (< ~last~0 200000) (< ~last~0 main_~c~0) (<= main_~c~0 (+ ~last~0 1)) (= main_~st~0 0)) (= main_~st~0 1)))} [123] L23-4_primed-->L23-4: Formula: (not (< v_main_~c~0_8 200000)) InVars {main_~c~0=v_main_~c~0_8} OutVars{main_~c~0=v_main_~c~0_8} AuxVars[] AssignedVars[] {11765#(and (= main_~a~0 0) (or (= main_~st~0 1) (and (< ~last~0 200000) (<= main_~c~0 (+ ~last~0 1)) (= main_~st~0 0))) (= main_~b~0 0) (not (< main_~c~0 200000)))} is VALID [2022-04-15 06:27:34,098 INFO L290 TraceCheckUtils]: 11: Hoare triple {11765#(and (= main_~a~0 0) (or (= main_~st~0 1) (and (< ~last~0 200000) (<= main_~c~0 (+ ~last~0 1)) (= main_~st~0 0))) (= main_~b~0 0) (not (< main_~c~0 200000)))} assume 0 == ~st~0 && ~c~0 == 1 + ~last~0;~a~0 := 3 + ~a~0;~b~0 := 3 + ~b~0; {11769#(and (= main_~b~0 3) (<= 200000 main_~c~0) (< main_~c~0 200001) (= main_~a~0 3))} is VALID [2022-04-15 06:27:34,098 INFO L290 TraceCheckUtils]: 12: Hoare triple {11769#(and (= main_~b~0 3) (<= 200000 main_~c~0) (< main_~c~0 200001) (= main_~a~0 3))} assume !(~c~0 == ~last~0 && 0 == ~st~0); {11769#(and (= main_~b~0 3) (<= 200000 main_~c~0) (< main_~c~0 200001) (= main_~a~0 3))} is VALID [2022-04-15 06:27:34,099 INFO L272 TraceCheckUtils]: 13: Hoare triple {11769#(and (= main_~b~0 3) (<= 200000 main_~c~0) (< main_~c~0 200001) (= main_~a~0 3))} call __VERIFIER_assert((if ~a~0 == ~b~0 && 200000 == ~c~0 then 1 else 0)); {11776#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-15 06:27:34,099 INFO L290 TraceCheckUtils]: 14: Hoare triple {11776#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {11780#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-15 06:27:34,099 INFO L290 TraceCheckUtils]: 15: Hoare triple {11780#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {11717#false} is VALID [2022-04-15 06:27:34,099 INFO L290 TraceCheckUtils]: 16: Hoare triple {11717#false} assume !false; {11717#false} is VALID [2022-04-15 06:27:34,100 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-04-15 06:27:34,100 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 06:27:34,498 INFO L290 TraceCheckUtils]: 16: Hoare triple {11717#false} assume !false; {11717#false} is VALID [2022-04-15 06:27:34,498 INFO L290 TraceCheckUtils]: 15: Hoare triple {11780#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {11717#false} is VALID [2022-04-15 06:27:34,499 INFO L290 TraceCheckUtils]: 14: Hoare triple {11776#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {11780#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-15 06:27:34,499 INFO L272 TraceCheckUtils]: 13: Hoare triple {11726#(and (<= main_~b~0 main_~a~0) (< main_~a~0 (+ main_~b~0 1)) (< 199999 main_~c~0) (<= main_~c~0 200000))} call __VERIFIER_assert((if ~a~0 == ~b~0 && 200000 == ~c~0 then 1 else 0)); {11776#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-15 06:27:34,500 INFO L290 TraceCheckUtils]: 12: Hoare triple {11726#(and (<= main_~b~0 main_~a~0) (< main_~a~0 (+ main_~b~0 1)) (< 199999 main_~c~0) (<= main_~c~0 200000))} assume !(~c~0 == ~last~0 && 0 == ~st~0); {11726#(and (<= main_~b~0 main_~a~0) (< main_~a~0 (+ main_~b~0 1)) (< 199999 main_~c~0) (<= main_~c~0 200000))} is VALID [2022-04-15 06:27:34,501 INFO L290 TraceCheckUtils]: 11: Hoare triple {11802#(or (not (<= main_~c~0 (+ ~last~0 1))) (and (<= main_~b~0 main_~a~0) (< main_~a~0 (+ main_~b~0 1)) (< 199999 main_~c~0) (<= main_~c~0 200000)) (not (= main_~st~0 0)))} assume 0 == ~st~0 && ~c~0 == 1 + ~last~0;~a~0 := 3 + ~a~0;~b~0 := 3 + ~b~0; {11726#(and (<= main_~b~0 main_~a~0) (< main_~a~0 (+ main_~b~0 1)) (< 199999 main_~c~0) (<= main_~c~0 200000))} is VALID [2022-04-15 06:27:34,501 INFO L290 TraceCheckUtils]: 10: Hoare triple {11806#(or (not (<= main_~c~0 (+ ~last~0 1))) (and (<= main_~b~0 main_~a~0) (< main_~a~0 (+ main_~b~0 1)) (<= main_~c~0 200000)) (not (= main_~st~0 0)) (< main_~c~0 200000))} [123] L23-4_primed-->L23-4: Formula: (not (< v_main_~c~0_8 200000)) InVars {main_~c~0=v_main_~c~0_8} OutVars{main_~c~0=v_main_~c~0_8} AuxVars[] AssignedVars[] {11802#(or (not (<= main_~c~0 (+ ~last~0 1))) (and (<= main_~b~0 main_~a~0) (< main_~a~0 (+ main_~b~0 1)) (< 199999 main_~c~0) (<= main_~c~0 200000)) (not (= main_~st~0 0)))} is VALID [2022-04-15 06:27:34,502 INFO L290 TraceCheckUtils]: 9: Hoare triple {11810#(and (<= main_~b~0 main_~a~0) (< main_~a~0 (+ main_~b~0 1)) (not (= main_~st~0 0)))} [126] L23-3-->L23-4_primed: Formula: (let ((.cse0 (= v_main_~st~0_146 v_main_~st~0_145)) (.cse1 (= |v_main_#t~post5_185| |v_main_#t~post5_181|)) (.cse2 (= v_main_~c~0_329 v_main_~c~0_328)) (.cse4 (= v_~last~0_115 v_main_~c~0_329)) (.cse3 (< v_main_~c~0_329 200000))) (or (and .cse0 .cse1 .cse2 (= v_~last~0_115 v_~last~0_115)) (and .cse0 (or (not .cse3) (not .cse4)) .cse1 .cse2) (and .cse4 (< v_main_~c~0_329 v_main_~c~0_328) (= v_main_~st~0_145 0) (<= v_main_~c~0_328 (+ v_~last~0_115 1)) .cse3))) InVars {main_~c~0=v_main_~c~0_329, main_#t~post5=|v_main_#t~post5_185|, main_~st~0=v_main_~st~0_146, ~last~0=v_~last~0_115} OutVars{main_#t~post5=|v_main_#t~post5_181|, main_~c~0=v_main_~c~0_328, main_~st~0=v_main_~st~0_145, ~last~0=v_~last~0_115} AuxVars[] AssignedVars[main_#t~post5, main_~c~0, main_~st~0] {11806#(or (not (<= main_~c~0 (+ ~last~0 1))) (and (<= main_~b~0 main_~a~0) (< main_~a~0 (+ main_~b~0 1)) (<= main_~c~0 200000)) (not (= main_~st~0 0)) (< main_~c~0 200000))} is VALID [2022-04-15 06:27:34,502 INFO L290 TraceCheckUtils]: 8: Hoare triple {11810#(and (<= main_~b~0 main_~a~0) (< main_~a~0 (+ main_~b~0 1)) (not (= main_~st~0 0)))} [125] L23-4_primed-->L23-3: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {11810#(and (<= main_~b~0 main_~a~0) (< main_~a~0 (+ main_~b~0 1)) (not (= main_~st~0 0)))} is VALID [2022-04-15 06:27:34,503 INFO L290 TraceCheckUtils]: 7: Hoare triple {11810#(and (<= main_~b~0 main_~a~0) (< main_~a~0 (+ main_~b~0 1)) (not (= main_~st~0 0)))} [124] L23-3-->L23-4_primed: Formula: (let ((.cse1 (= v_main_~c~0_327 v_main_~c~0_326)) (.cse0 (= v_~last~0_114 v_main_~c~0_327))) (or (and (< v_main_~c~0_326 200001) (or (not (<= (+ v_main_~c~0_327 1) v_~last~0_114)) (not (<= (+ v_~last~0_114 1) v_main_~c~0_326))) (not .cse0) (< v_main_~c~0_327 v_main_~c~0_326)) (and (= v_~last~0_114 v_~last~0_114) .cse1 (= |v_main_#t~post5_182| |v_main_#t~post5_180|)) (and .cse1 (or (not (< v_main_~c~0_327 200000)) .cse0) (= |v_main_#t~post5_180| |v_main_#t~post5_182|)))) InVars {main_~c~0=v_main_~c~0_327, main_#t~post5=|v_main_#t~post5_182|, ~last~0=v_~last~0_114} OutVars{main_#t~post5=|v_main_#t~post5_180|, main_~c~0=v_main_~c~0_326, ~last~0=v_~last~0_114} AuxVars[] AssignedVars[main_#t~post5, main_~c~0] {11810#(and (<= main_~b~0 main_~a~0) (< main_~a~0 (+ main_~b~0 1)) (not (= main_~st~0 0)))} is VALID [2022-04-15 06:27:34,503 INFO L290 TraceCheckUtils]: 6: Hoare triple {11820#(and (<= main_~b~0 main_~a~0) (< main_~a~0 (+ main_~b~0 1)))} assume !false;~st~0 := 1;~c~0 := 0; {11810#(and (<= main_~b~0 main_~a~0) (< main_~a~0 (+ main_~b~0 1)) (not (= main_~st~0 0)))} is VALID [2022-04-15 06:27:34,503 INFO L290 TraceCheckUtils]: 5: Hoare triple {11716#true} assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~last~0 := #t~nondet4;havoc #t~nondet4;~a~0 := 0;~b~0 := 0;~c~0 := 0;~st~0 := 0; {11820#(and (<= main_~b~0 main_~a~0) (< main_~a~0 (+ main_~b~0 1)))} is VALID [2022-04-15 06:27:34,503 INFO L272 TraceCheckUtils]: 4: Hoare triple {11716#true} call #t~ret6 := main(); {11716#true} is VALID [2022-04-15 06:27:34,504 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {11716#true} {11716#true} #66#return; {11716#true} is VALID [2022-04-15 06:27:34,504 INFO L290 TraceCheckUtils]: 2: Hoare triple {11716#true} assume true; {11716#true} is VALID [2022-04-15 06:27:34,504 INFO L290 TraceCheckUtils]: 1: Hoare triple {11716#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(11, 2);call #Ultimate.allocInit(12, 3);~last~0 := 0; {11716#true} is VALID [2022-04-15 06:27:34,504 INFO L272 TraceCheckUtils]: 0: Hoare triple {11716#true} call ULTIMATE.init(); {11716#true} is VALID [2022-04-15 06:27:34,504 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-04-15 06:27:34,504 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1440307661] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 06:27:34,504 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 06:27:34,504 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 9, 9] total 21 [2022-04-15 06:27:35,497 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 06:27:35,497 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [226298232] [2022-04-15 06:27:35,497 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [226298232] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 06:27:35,498 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 06:27:35,498 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [32] imperfect sequences [] total 32 [2022-04-15 06:27:35,498 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [138353387] [2022-04-15 06:27:35,498 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 06:27:35,498 INFO L78 Accepts]: Start accepts. Automaton has has 32 states, 32 states have (on average 1.34375) internal successors, (43), 30 states have internal predecessors, (43), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 47 [2022-04-15 06:27:35,498 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 06:27:35,498 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 32 states, 32 states have (on average 1.34375) internal successors, (43), 30 states have internal predecessors, (43), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:27:35,535 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 47 edges. 47 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 06:27:35,535 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2022-04-15 06:27:35,535 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 06:27:35,535 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2022-04-15 06:27:35,536 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=288, Invalid=1692, Unknown=0, NotChecked=0, Total=1980 [2022-04-15 06:27:35,536 INFO L87 Difference]: Start difference. First operand 130 states and 155 transitions. Second operand has 32 states, 32 states have (on average 1.34375) internal successors, (43), 30 states have internal predecessors, (43), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:27:37,480 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:27:37,480 INFO L93 Difference]: Finished difference Result 221 states and 266 transitions. [2022-04-15 06:27:37,480 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2022-04-15 06:27:37,480 INFO L78 Accepts]: Start accepts. Automaton has has 32 states, 32 states have (on average 1.34375) internal successors, (43), 30 states have internal predecessors, (43), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 47 [2022-04-15 06:27:37,480 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 06:27:37,480 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32 states, 32 states have (on average 1.34375) internal successors, (43), 30 states have internal predecessors, (43), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:27:37,482 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 107 transitions. [2022-04-15 06:27:37,482 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32 states, 32 states have (on average 1.34375) internal successors, (43), 30 states have internal predecessors, (43), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:27:37,483 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 107 transitions. [2022-04-15 06:27:37,484 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 38 states and 107 transitions. [2022-04-15 06:27:37,591 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 107 edges. 107 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 06:27:37,593 INFO L225 Difference]: With dead ends: 221 [2022-04-15 06:27:37,593 INFO L226 Difference]: Without dead ends: 177 [2022-04-15 06:27:37,594 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 90 GetRequests, 35 SyntacticMatches, 2 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 945 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=380, Invalid=2590, Unknown=0, NotChecked=0, Total=2970 [2022-04-15 06:27:37,595 INFO L913 BasicCegarLoop]: 13 mSDtfsCounter, 58 mSDsluCounter, 44 mSDsCounter, 0 mSdLazyCounter, 1144 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 59 SdHoareTripleChecker+Valid, 57 SdHoareTripleChecker+Invalid, 1174 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 1144 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-04-15 06:27:37,595 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [59 Valid, 57 Invalid, 1174 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 1144 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2022-04-15 06:27:37,595 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 177 states. [2022-04-15 06:27:37,841 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 177 to 122. [2022-04-15 06:27:37,841 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 06:27:37,842 INFO L82 GeneralOperation]: Start isEquivalent. First operand 177 states. Second operand has 122 states, 114 states have (on average 1.2280701754385965) internal successors, (140), 115 states have internal predecessors, (140), 4 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-15 06:27:37,843 INFO L74 IsIncluded]: Start isIncluded. First operand 177 states. Second operand has 122 states, 114 states have (on average 1.2280701754385965) internal successors, (140), 115 states have internal predecessors, (140), 4 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-15 06:27:37,843 INFO L87 Difference]: Start difference. First operand 177 states. Second operand has 122 states, 114 states have (on average 1.2280701754385965) internal successors, (140), 115 states have internal predecessors, (140), 4 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-15 06:27:37,845 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:27:37,845 INFO L93 Difference]: Finished difference Result 177 states and 211 transitions. [2022-04-15 06:27:37,845 INFO L276 IsEmpty]: Start isEmpty. Operand 177 states and 211 transitions. [2022-04-15 06:27:37,845 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 06:27:37,845 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 06:27:37,846 INFO L74 IsIncluded]: Start isIncluded. First operand has 122 states, 114 states have (on average 1.2280701754385965) internal successors, (140), 115 states have internal predecessors, (140), 4 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) Second operand 177 states. [2022-04-15 06:27:37,846 INFO L87 Difference]: Start difference. First operand has 122 states, 114 states have (on average 1.2280701754385965) internal successors, (140), 115 states have internal predecessors, (140), 4 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) Second operand 177 states. [2022-04-15 06:27:37,848 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:27:37,848 INFO L93 Difference]: Finished difference Result 177 states and 211 transitions. [2022-04-15 06:27:37,848 INFO L276 IsEmpty]: Start isEmpty. Operand 177 states and 211 transitions. [2022-04-15 06:27:37,848 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 06:27:37,848 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 06:27:37,848 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 06:27:37,848 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 06:27:37,848 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 122 states, 114 states have (on average 1.2280701754385965) internal successors, (140), 115 states have internal predecessors, (140), 4 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-15 06:27:37,849 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 122 states to 122 states and 147 transitions. [2022-04-15 06:27:37,850 INFO L78 Accepts]: Start accepts. Automaton has 122 states and 147 transitions. Word has length 47 [2022-04-15 06:27:37,850 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 06:27:37,850 INFO L478 AbstractCegarLoop]: Abstraction has 122 states and 147 transitions. [2022-04-15 06:27:37,850 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 32 states, 32 states have (on average 1.34375) internal successors, (43), 30 states have internal predecessors, (43), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:27:37,850 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 122 states and 147 transitions. [2022-04-15 06:27:38,145 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 147 edges. 147 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 06:27:38,146 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states and 147 transitions. [2022-04-15 06:27:38,146 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2022-04-15 06:27:38,146 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 06:27:38,146 INFO L499 BasicCegarLoop]: trace histogram [12, 12, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 06:27:38,181 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Forceful destruction successful, exit code 0 [2022-04-15 06:27:38,347 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 06:27:38,347 INFO L403 AbstractCegarLoop]: === Iteration 20 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 06:27:38,347 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 06:27:38,347 INFO L85 PathProgramCache]: Analyzing trace with hash -1547587481, now seen corresponding path program 11 times [2022-04-15 06:27:38,347 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 06:27:38,347 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1867867149] [2022-04-15 06:27:39,774 WARN L970 rdanLoopAcceleration]: Unable to prove correctness of quantifier elimination. [2022-04-15 06:27:43,793 WARN L977 rdanLoopAcceleration]: Unable to prove correctness of quantifier elimination. [2022-04-15 06:27:43,922 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 1 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-15 06:27:44,180 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {0={1=1}, 1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-15 06:27:44,181 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-15 06:27:44,183 INFO L85 PathProgramCache]: Analyzing trace with hash -1308660920, now seen corresponding path program 1 times [2022-04-15 06:27:44,183 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 06:27:44,184 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [770242712] [2022-04-15 06:27:44,184 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 06:27:44,184 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 06:27:44,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:27:44,341 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 06:27:44,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:27:44,346 INFO L290 TraceCheckUtils]: 0: Hoare triple {12937#(and (= ~last~0 |old(~last~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(11, 2);call #Ultimate.allocInit(12, 3);~last~0 := 0; {12925#true} is VALID [2022-04-15 06:27:44,346 INFO L290 TraceCheckUtils]: 1: Hoare triple {12925#true} assume true; {12925#true} is VALID [2022-04-15 06:27:44,346 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {12925#true} {12925#true} #66#return; {12925#true} is VALID [2022-04-15 06:27:44,347 INFO L272 TraceCheckUtils]: 0: Hoare triple {12925#true} call ULTIMATE.init(); {12937#(and (= ~last~0 |old(~last~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 06:27:44,347 INFO L290 TraceCheckUtils]: 1: Hoare triple {12937#(and (= ~last~0 |old(~last~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(11, 2);call #Ultimate.allocInit(12, 3);~last~0 := 0; {12925#true} is VALID [2022-04-15 06:27:44,347 INFO L290 TraceCheckUtils]: 2: Hoare triple {12925#true} assume true; {12925#true} is VALID [2022-04-15 06:27:44,347 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {12925#true} {12925#true} #66#return; {12925#true} is VALID [2022-04-15 06:27:44,347 INFO L272 TraceCheckUtils]: 4: Hoare triple {12925#true} call #t~ret6 := main(); {12925#true} is VALID [2022-04-15 06:27:44,348 INFO L290 TraceCheckUtils]: 5: Hoare triple {12925#true} assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~last~0 := #t~nondet4;havoc #t~nondet4;~a~0 := 0;~b~0 := 0;~c~0 := 0;~st~0 := 0; {12930#(and (= main_~a~0 0) (= main_~b~0 0))} is VALID [2022-04-15 06:27:44,348 INFO L290 TraceCheckUtils]: 6: Hoare triple {12930#(and (= main_~a~0 0) (= main_~b~0 0))} assume !false;~st~0 := 1;~c~0 := 0; {12931#(and (= main_~a~0 0) (= main_~st~0 1) (= main_~b~0 0))} is VALID [2022-04-15 06:27:44,349 INFO L290 TraceCheckUtils]: 7: Hoare triple {12931#(and (= main_~a~0 0) (= main_~st~0 1) (= main_~b~0 0))} [128] L23-3-->L23-4_primed: Formula: (let ((.cse0 (= |v_main_#t~post5_195| |v_main_#t~post5_193|)) (.cse2 (= v_main_~c~0_355 v_main_~c~0_354)) (.cse1 (= v_~last~0_122 v_main_~c~0_355))) (or (and .cse0 (or (not (< v_main_~c~0_355 200000)) .cse1) .cse2) (and .cse0 (= v_~last~0_122 v_~last~0_122) .cse2) (and (or (not (<= (+ v_main_~c~0_355 1) v_~last~0_122)) (not (<= (+ v_~last~0_122 1) v_main_~c~0_354))) (< v_main_~c~0_355 v_main_~c~0_354) (not .cse1) (< v_main_~c~0_354 200001)))) InVars {main_~c~0=v_main_~c~0_355, main_#t~post5=|v_main_#t~post5_195|, ~last~0=v_~last~0_122} OutVars{main_#t~post5=|v_main_#t~post5_193|, main_~c~0=v_main_~c~0_354, ~last~0=v_~last~0_122} AuxVars[] AssignedVars[main_#t~post5, main_~c~0] {12931#(and (= main_~a~0 0) (= main_~st~0 1) (= main_~b~0 0))} is VALID [2022-04-15 06:27:44,349 INFO L290 TraceCheckUtils]: 8: Hoare triple {12931#(and (= main_~a~0 0) (= main_~st~0 1) (= main_~b~0 0))} [129] L23-4_primed-->L23-3: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {12931#(and (= main_~a~0 0) (= main_~st~0 1) (= main_~b~0 0))} is VALID [2022-04-15 06:27:44,350 INFO L290 TraceCheckUtils]: 9: Hoare triple {12931#(and (= main_~a~0 0) (= main_~st~0 1) (= main_~b~0 0))} [130] L23-3-->L23-4_primed: Formula: (let ((.cse0 (= v_main_~st~0_155 v_main_~st~0_154)) (.cse1 (= |v_main_#t~post5_198| |v_main_#t~post5_194|)) (.cse2 (= v_main_~c~0_357 v_main_~c~0_356)) (.cse3 (< v_main_~c~0_357 200000)) (.cse4 (= v_~last~0_123 v_main_~c~0_357))) (or (and .cse0 .cse1 .cse2 (or (not .cse3) (not .cse4))) (and (= v_~last~0_123 v_~last~0_123) .cse0 .cse1 .cse2) (and (< v_main_~c~0_357 v_main_~c~0_356) .cse3 (= v_main_~st~0_154 0) .cse4 (<= v_main_~c~0_356 (+ v_~last~0_123 1))))) InVars {main_~c~0=v_main_~c~0_357, main_#t~post5=|v_main_#t~post5_198|, main_~st~0=v_main_~st~0_155, ~last~0=v_~last~0_123} OutVars{main_#t~post5=|v_main_#t~post5_194|, main_~c~0=v_main_~c~0_356, main_~st~0=v_main_~st~0_154, ~last~0=v_~last~0_123} AuxVars[] AssignedVars[main_#t~post5, main_~c~0, main_~st~0] {12932#(or (= main_~st~0 1) (and (= main_~a~0 0) (or (<= ~last~0 199999) (<= main_~c~0 200000)) (= main_~b~0 0)))} is VALID [2022-04-15 06:27:44,351 INFO L290 TraceCheckUtils]: 10: Hoare triple {12932#(or (= main_~st~0 1) (and (= main_~a~0 0) (or (<= ~last~0 199999) (<= main_~c~0 200000)) (= main_~b~0 0)))} [127] L23-4_primed-->L23-4: Formula: (not (< v_main_~c~0_8 200000)) InVars {main_~c~0=v_main_~c~0_8} OutVars{main_~c~0=v_main_~c~0_8} AuxVars[] AssignedVars[] {12933#(or (= main_~st~0 1) (and (= main_~a~0 0) (or (<= ~last~0 199999) (<= main_~c~0 200000)) (= main_~b~0 0) (< 199999 main_~c~0)))} is VALID [2022-04-15 06:27:44,352 INFO L290 TraceCheckUtils]: 11: Hoare triple {12933#(or (= main_~st~0 1) (and (= main_~a~0 0) (or (<= ~last~0 199999) (<= main_~c~0 200000)) (= main_~b~0 0) (< 199999 main_~c~0)))} assume 0 == ~st~0 && ~c~0 == 1 + ~last~0;~a~0 := 3 + ~a~0;~b~0 := 3 + ~b~0; {12934#(and (<= main_~b~0 main_~a~0) (< main_~a~0 (+ main_~b~0 1)) (< 199999 main_~c~0) (<= main_~c~0 200000))} is VALID [2022-04-15 06:27:44,352 INFO L290 TraceCheckUtils]: 12: Hoare triple {12934#(and (<= main_~b~0 main_~a~0) (< main_~a~0 (+ main_~b~0 1)) (< 199999 main_~c~0) (<= main_~c~0 200000))} assume !(~c~0 == ~last~0 && 0 == ~st~0); {12934#(and (<= main_~b~0 main_~a~0) (< main_~a~0 (+ main_~b~0 1)) (< 199999 main_~c~0) (<= main_~c~0 200000))} is VALID [2022-04-15 06:27:44,353 INFO L272 TraceCheckUtils]: 13: Hoare triple {12934#(and (<= main_~b~0 main_~a~0) (< main_~a~0 (+ main_~b~0 1)) (< 199999 main_~c~0) (<= main_~c~0 200000))} call __VERIFIER_assert((if ~a~0 == ~b~0 && 200000 == ~c~0 then 1 else 0)); {12935#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-15 06:27:44,353 INFO L290 TraceCheckUtils]: 14: Hoare triple {12935#(not (= |__VERIFIER_assert_#in~cond| 0))} ~cond := #in~cond; {12936#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-15 06:27:44,354 INFO L290 TraceCheckUtils]: 15: Hoare triple {12936#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {12926#false} is VALID [2022-04-15 06:27:44,354 INFO L290 TraceCheckUtils]: 16: Hoare triple {12926#false} assume !false; {12926#false} is VALID [2022-04-15 06:27:44,354 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-04-15 06:27:44,354 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 06:27:44,354 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [770242712] [2022-04-15 06:27:44,354 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [770242712] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 06:27:44,354 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [42070339] [2022-04-15 06:27:44,354 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 06:27:44,355 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 06:27:44,355 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 06:27:44,368 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-15 06:27:44,369 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2022-04-15 06:27:44,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:27:44,401 INFO L263 TraceCheckSpWp]: Trace formula consists of 85 conjuncts, 18 conjunts are in the unsatisfiable core [2022-04-15 06:27:44,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:27:44,410 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 06:27:44,742 INFO L272 TraceCheckUtils]: 0: Hoare triple {12925#true} call ULTIMATE.init(); {12925#true} is VALID [2022-04-15 06:27:44,743 INFO L290 TraceCheckUtils]: 1: Hoare triple {12925#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(11, 2);call #Ultimate.allocInit(12, 3);~last~0 := 0; {12925#true} is VALID [2022-04-15 06:27:44,743 INFO L290 TraceCheckUtils]: 2: Hoare triple {12925#true} assume true; {12925#true} is VALID [2022-04-15 06:27:44,743 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {12925#true} {12925#true} #66#return; {12925#true} is VALID [2022-04-15 06:27:44,743 INFO L272 TraceCheckUtils]: 4: Hoare triple {12925#true} call #t~ret6 := main(); {12925#true} is VALID [2022-04-15 06:27:44,743 INFO L290 TraceCheckUtils]: 5: Hoare triple {12925#true} assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~last~0 := #t~nondet4;havoc #t~nondet4;~a~0 := 0;~b~0 := 0;~c~0 := 0;~st~0 := 0; {12930#(and (= main_~a~0 0) (= main_~b~0 0))} is VALID [2022-04-15 06:27:44,744 INFO L290 TraceCheckUtils]: 6: Hoare triple {12930#(and (= main_~a~0 0) (= main_~b~0 0))} assume !false;~st~0 := 1;~c~0 := 0; {12931#(and (= main_~a~0 0) (= main_~st~0 1) (= main_~b~0 0))} is VALID [2022-04-15 06:27:44,744 INFO L290 TraceCheckUtils]: 7: Hoare triple {12931#(and (= main_~a~0 0) (= main_~st~0 1) (= main_~b~0 0))} [128] L23-3-->L23-4_primed: Formula: (let ((.cse0 (= |v_main_#t~post5_195| |v_main_#t~post5_193|)) (.cse2 (= v_main_~c~0_355 v_main_~c~0_354)) (.cse1 (= v_~last~0_122 v_main_~c~0_355))) (or (and .cse0 (or (not (< v_main_~c~0_355 200000)) .cse1) .cse2) (and .cse0 (= v_~last~0_122 v_~last~0_122) .cse2) (and (or (not (<= (+ v_main_~c~0_355 1) v_~last~0_122)) (not (<= (+ v_~last~0_122 1) v_main_~c~0_354))) (< v_main_~c~0_355 v_main_~c~0_354) (not .cse1) (< v_main_~c~0_354 200001)))) InVars {main_~c~0=v_main_~c~0_355, main_#t~post5=|v_main_#t~post5_195|, ~last~0=v_~last~0_122} OutVars{main_#t~post5=|v_main_#t~post5_193|, main_~c~0=v_main_~c~0_354, ~last~0=v_~last~0_122} AuxVars[] AssignedVars[main_#t~post5, main_~c~0] {12931#(and (= main_~a~0 0) (= main_~st~0 1) (= main_~b~0 0))} is VALID [2022-04-15 06:27:44,745 INFO L290 TraceCheckUtils]: 8: Hoare triple {12931#(and (= main_~a~0 0) (= main_~st~0 1) (= main_~b~0 0))} [129] L23-4_primed-->L23-3: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {12931#(and (= main_~a~0 0) (= main_~st~0 1) (= main_~b~0 0))} is VALID [2022-04-15 06:27:44,746 INFO L290 TraceCheckUtils]: 9: Hoare triple {12931#(and (= main_~a~0 0) (= main_~st~0 1) (= main_~b~0 0))} [130] L23-3-->L23-4_primed: Formula: (let ((.cse0 (= v_main_~st~0_155 v_main_~st~0_154)) (.cse1 (= |v_main_#t~post5_198| |v_main_#t~post5_194|)) (.cse2 (= v_main_~c~0_357 v_main_~c~0_356)) (.cse3 (< v_main_~c~0_357 200000)) (.cse4 (= v_~last~0_123 v_main_~c~0_357))) (or (and .cse0 .cse1 .cse2 (or (not .cse3) (not .cse4))) (and (= v_~last~0_123 v_~last~0_123) .cse0 .cse1 .cse2) (and (< v_main_~c~0_357 v_main_~c~0_356) .cse3 (= v_main_~st~0_154 0) .cse4 (<= v_main_~c~0_356 (+ v_~last~0_123 1))))) InVars {main_~c~0=v_main_~c~0_357, main_#t~post5=|v_main_#t~post5_198|, main_~st~0=v_main_~st~0_155, ~last~0=v_~last~0_123} OutVars{main_#t~post5=|v_main_#t~post5_194|, main_~c~0=v_main_~c~0_356, main_~st~0=v_main_~st~0_154, ~last~0=v_~last~0_123} AuxVars[] AssignedVars[main_#t~post5, main_~c~0, main_~st~0] {12968#(and (= main_~a~0 0) (= main_~b~0 0) (or (and (< ~last~0 200000) (< ~last~0 main_~c~0) (<= main_~c~0 (+ ~last~0 1)) (= main_~st~0 0)) (= main_~st~0 1)))} is VALID [2022-04-15 06:27:44,746 INFO L290 TraceCheckUtils]: 10: Hoare triple {12968#(and (= main_~a~0 0) (= main_~b~0 0) (or (and (< ~last~0 200000) (< ~last~0 main_~c~0) (<= main_~c~0 (+ ~last~0 1)) (= main_~st~0 0)) (= main_~st~0 1)))} [127] L23-4_primed-->L23-4: Formula: (not (< v_main_~c~0_8 200000)) InVars {main_~c~0=v_main_~c~0_8} OutVars{main_~c~0=v_main_~c~0_8} AuxVars[] AssignedVars[] {12972#(and (= main_~a~0 0) (or (= main_~st~0 1) (and (< ~last~0 200000) (<= main_~c~0 (+ ~last~0 1)) (= main_~st~0 0))) (= main_~b~0 0) (not (< main_~c~0 200000)))} is VALID [2022-04-15 06:27:44,747 INFO L290 TraceCheckUtils]: 11: Hoare triple {12972#(and (= main_~a~0 0) (or (= main_~st~0 1) (and (< ~last~0 200000) (<= main_~c~0 (+ ~last~0 1)) (= main_~st~0 0))) (= main_~b~0 0) (not (< main_~c~0 200000)))} assume 0 == ~st~0 && ~c~0 == 1 + ~last~0;~a~0 := 3 + ~a~0;~b~0 := 3 + ~b~0; {12976#(and (= main_~b~0 3) (<= 200000 main_~c~0) (< main_~c~0 200001) (= main_~a~0 3))} is VALID [2022-04-15 06:27:44,748 INFO L290 TraceCheckUtils]: 12: Hoare triple {12976#(and (= main_~b~0 3) (<= 200000 main_~c~0) (< main_~c~0 200001) (= main_~a~0 3))} assume !(~c~0 == ~last~0 && 0 == ~st~0); {12976#(and (= main_~b~0 3) (<= 200000 main_~c~0) (< main_~c~0 200001) (= main_~a~0 3))} is VALID [2022-04-15 06:27:44,748 INFO L272 TraceCheckUtils]: 13: Hoare triple {12976#(and (= main_~b~0 3) (<= 200000 main_~c~0) (< main_~c~0 200001) (= main_~a~0 3))} call __VERIFIER_assert((if ~a~0 == ~b~0 && 200000 == ~c~0 then 1 else 0)); {12983#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-15 06:27:44,749 INFO L290 TraceCheckUtils]: 14: Hoare triple {12983#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {12987#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-15 06:27:44,749 INFO L290 TraceCheckUtils]: 15: Hoare triple {12987#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {12926#false} is VALID [2022-04-15 06:27:44,749 INFO L290 TraceCheckUtils]: 16: Hoare triple {12926#false} assume !false; {12926#false} is VALID [2022-04-15 06:27:44,749 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-04-15 06:27:44,749 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 06:27:45,218 INFO L290 TraceCheckUtils]: 16: Hoare triple {12926#false} assume !false; {12926#false} is VALID [2022-04-15 06:27:45,218 INFO L290 TraceCheckUtils]: 15: Hoare triple {12987#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {12926#false} is VALID [2022-04-15 06:27:45,219 INFO L290 TraceCheckUtils]: 14: Hoare triple {12983#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {12987#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-15 06:27:45,219 INFO L272 TraceCheckUtils]: 13: Hoare triple {12934#(and (<= main_~b~0 main_~a~0) (< main_~a~0 (+ main_~b~0 1)) (< 199999 main_~c~0) (<= main_~c~0 200000))} call __VERIFIER_assert((if ~a~0 == ~b~0 && 200000 == ~c~0 then 1 else 0)); {12983#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-15 06:27:45,220 INFO L290 TraceCheckUtils]: 12: Hoare triple {12934#(and (<= main_~b~0 main_~a~0) (< main_~a~0 (+ main_~b~0 1)) (< 199999 main_~c~0) (<= main_~c~0 200000))} assume !(~c~0 == ~last~0 && 0 == ~st~0); {12934#(and (<= main_~b~0 main_~a~0) (< main_~a~0 (+ main_~b~0 1)) (< 199999 main_~c~0) (<= main_~c~0 200000))} is VALID [2022-04-15 06:27:45,221 INFO L290 TraceCheckUtils]: 11: Hoare triple {13009#(or (not (<= main_~c~0 (+ ~last~0 1))) (and (<= main_~b~0 main_~a~0) (< main_~a~0 (+ main_~b~0 1)) (< 199999 main_~c~0) (<= main_~c~0 200000)) (not (= main_~st~0 0)))} assume 0 == ~st~0 && ~c~0 == 1 + ~last~0;~a~0 := 3 + ~a~0;~b~0 := 3 + ~b~0; {12934#(and (<= main_~b~0 main_~a~0) (< main_~a~0 (+ main_~b~0 1)) (< 199999 main_~c~0) (<= main_~c~0 200000))} is VALID [2022-04-15 06:27:45,221 INFO L290 TraceCheckUtils]: 10: Hoare triple {13013#(or (not (<= main_~c~0 (+ ~last~0 1))) (and (<= main_~b~0 main_~a~0) (< main_~a~0 (+ main_~b~0 1)) (<= main_~c~0 200000)) (not (= main_~st~0 0)) (< main_~c~0 200000))} [127] L23-4_primed-->L23-4: Formula: (not (< v_main_~c~0_8 200000)) InVars {main_~c~0=v_main_~c~0_8} OutVars{main_~c~0=v_main_~c~0_8} AuxVars[] AssignedVars[] {13009#(or (not (<= main_~c~0 (+ ~last~0 1))) (and (<= main_~b~0 main_~a~0) (< main_~a~0 (+ main_~b~0 1)) (< 199999 main_~c~0) (<= main_~c~0 200000)) (not (= main_~st~0 0)))} is VALID [2022-04-15 06:27:45,222 INFO L290 TraceCheckUtils]: 9: Hoare triple {13017#(and (<= main_~b~0 main_~a~0) (< main_~a~0 (+ main_~b~0 1)) (not (= main_~st~0 0)))} [130] L23-3-->L23-4_primed: Formula: (let ((.cse0 (= v_main_~st~0_155 v_main_~st~0_154)) (.cse1 (= |v_main_#t~post5_198| |v_main_#t~post5_194|)) (.cse2 (= v_main_~c~0_357 v_main_~c~0_356)) (.cse3 (< v_main_~c~0_357 200000)) (.cse4 (= v_~last~0_123 v_main_~c~0_357))) (or (and .cse0 .cse1 .cse2 (or (not .cse3) (not .cse4))) (and (= v_~last~0_123 v_~last~0_123) .cse0 .cse1 .cse2) (and (< v_main_~c~0_357 v_main_~c~0_356) .cse3 (= v_main_~st~0_154 0) .cse4 (<= v_main_~c~0_356 (+ v_~last~0_123 1))))) InVars {main_~c~0=v_main_~c~0_357, main_#t~post5=|v_main_#t~post5_198|, main_~st~0=v_main_~st~0_155, ~last~0=v_~last~0_123} OutVars{main_#t~post5=|v_main_#t~post5_194|, main_~c~0=v_main_~c~0_356, main_~st~0=v_main_~st~0_154, ~last~0=v_~last~0_123} AuxVars[] AssignedVars[main_#t~post5, main_~c~0, main_~st~0] {13013#(or (not (<= main_~c~0 (+ ~last~0 1))) (and (<= main_~b~0 main_~a~0) (< main_~a~0 (+ main_~b~0 1)) (<= main_~c~0 200000)) (not (= main_~st~0 0)) (< main_~c~0 200000))} is VALID [2022-04-15 06:27:45,223 INFO L290 TraceCheckUtils]: 8: Hoare triple {13017#(and (<= main_~b~0 main_~a~0) (< main_~a~0 (+ main_~b~0 1)) (not (= main_~st~0 0)))} [129] L23-4_primed-->L23-3: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {13017#(and (<= main_~b~0 main_~a~0) (< main_~a~0 (+ main_~b~0 1)) (not (= main_~st~0 0)))} is VALID [2022-04-15 06:27:45,223 INFO L290 TraceCheckUtils]: 7: Hoare triple {13017#(and (<= main_~b~0 main_~a~0) (< main_~a~0 (+ main_~b~0 1)) (not (= main_~st~0 0)))} [128] L23-3-->L23-4_primed: Formula: (let ((.cse0 (= |v_main_#t~post5_195| |v_main_#t~post5_193|)) (.cse2 (= v_main_~c~0_355 v_main_~c~0_354)) (.cse1 (= v_~last~0_122 v_main_~c~0_355))) (or (and .cse0 (or (not (< v_main_~c~0_355 200000)) .cse1) .cse2) (and .cse0 (= v_~last~0_122 v_~last~0_122) .cse2) (and (or (not (<= (+ v_main_~c~0_355 1) v_~last~0_122)) (not (<= (+ v_~last~0_122 1) v_main_~c~0_354))) (< v_main_~c~0_355 v_main_~c~0_354) (not .cse1) (< v_main_~c~0_354 200001)))) InVars {main_~c~0=v_main_~c~0_355, main_#t~post5=|v_main_#t~post5_195|, ~last~0=v_~last~0_122} OutVars{main_#t~post5=|v_main_#t~post5_193|, main_~c~0=v_main_~c~0_354, ~last~0=v_~last~0_122} AuxVars[] AssignedVars[main_#t~post5, main_~c~0] {13017#(and (<= main_~b~0 main_~a~0) (< main_~a~0 (+ main_~b~0 1)) (not (= main_~st~0 0)))} is VALID [2022-04-15 06:27:45,224 INFO L290 TraceCheckUtils]: 6: Hoare triple {13027#(and (<= main_~b~0 main_~a~0) (< main_~a~0 (+ main_~b~0 1)))} assume !false;~st~0 := 1;~c~0 := 0; {13017#(and (<= main_~b~0 main_~a~0) (< main_~a~0 (+ main_~b~0 1)) (not (= main_~st~0 0)))} is VALID [2022-04-15 06:27:45,224 INFO L290 TraceCheckUtils]: 5: Hoare triple {12925#true} assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~last~0 := #t~nondet4;havoc #t~nondet4;~a~0 := 0;~b~0 := 0;~c~0 := 0;~st~0 := 0; {13027#(and (<= main_~b~0 main_~a~0) (< main_~a~0 (+ main_~b~0 1)))} is VALID [2022-04-15 06:27:45,224 INFO L272 TraceCheckUtils]: 4: Hoare triple {12925#true} call #t~ret6 := main(); {12925#true} is VALID [2022-04-15 06:27:45,224 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {12925#true} {12925#true} #66#return; {12925#true} is VALID [2022-04-15 06:27:45,224 INFO L290 TraceCheckUtils]: 2: Hoare triple {12925#true} assume true; {12925#true} is VALID [2022-04-15 06:27:45,225 INFO L290 TraceCheckUtils]: 1: Hoare triple {12925#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(11, 2);call #Ultimate.allocInit(12, 3);~last~0 := 0; {12925#true} is VALID [2022-04-15 06:27:45,225 INFO L272 TraceCheckUtils]: 0: Hoare triple {12925#true} call ULTIMATE.init(); {12925#true} is VALID [2022-04-15 06:27:45,225 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-04-15 06:27:45,225 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [42070339] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 06:27:45,225 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 06:27:45,225 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9, 9] total 19 [2022-04-15 06:27:46,194 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 06:27:46,194 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1867867149] [2022-04-15 06:27:46,195 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1867867149] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 06:27:46,195 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 06:27:46,195 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [34] imperfect sequences [] total 34 [2022-04-15 06:27:46,195 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1476773091] [2022-04-15 06:27:46,195 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 06:27:46,195 INFO L78 Accepts]: Start accepts. Automaton has has 34 states, 34 states have (on average 1.3529411764705883) internal successors, (46), 32 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-15 06:27:46,195 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 06:27:46,196 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 34 states, 34 states have (on average 1.3529411764705883) internal successors, (46), 32 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-15 06:27:46,236 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-15 06:27:46,237 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 34 states [2022-04-15 06:27:46,237 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 06:27:46,237 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2022-04-15 06:27:46,238 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=261, Invalid=1631, Unknown=0, NotChecked=0, Total=1892 [2022-04-15 06:27:46,238 INFO L87 Difference]: Start difference. First operand 122 states and 147 transitions. Second operand has 34 states, 34 states have (on average 1.3529411764705883) internal successors, (46), 32 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-15 06:27:49,562 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:27:49,563 INFO L93 Difference]: Finished difference Result 233 states and 281 transitions. [2022-04-15 06:27:49,563 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2022-04-15 06:27:49,563 INFO L78 Accepts]: Start accepts. Automaton has has 34 states, 34 states have (on average 1.3529411764705883) internal successors, (46), 32 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-15 06:27:49,563 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 06:27:49,563 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34 states, 34 states have (on average 1.3529411764705883) internal successors, (46), 32 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-15 06:27:49,564 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 131 transitions. [2022-04-15 06:27:49,564 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34 states, 34 states have (on average 1.3529411764705883) internal successors, (46), 32 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-15 06:27:49,565 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 131 transitions. [2022-04-15 06:27:49,565 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 47 states and 131 transitions. [2022-04-15 06:27:49,659 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 131 edges. 131 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 06:27:49,661 INFO L225 Difference]: With dead ends: 233 [2022-04-15 06:27:49,661 INFO L226 Difference]: Without dead ends: 189 [2022-04-15 06:27:49,662 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 97 GetRequests, 38 SyntacticMatches, 2 SemanticMatches, 57 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 982 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=398, Invalid=3024, Unknown=0, NotChecked=0, Total=3422 [2022-04-15 06:27:49,662 INFO L913 BasicCegarLoop]: 16 mSDtfsCounter, 72 mSDsluCounter, 95 mSDsCounter, 0 mSdLazyCounter, 1814 mSolverCounterSat, 62 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 74 SdHoareTripleChecker+Valid, 111 SdHoareTripleChecker+Invalid, 1876 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 62 IncrementalHoareTripleChecker+Valid, 1814 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2022-04-15 06:27:49,662 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [74 Valid, 111 Invalid, 1876 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [62 Valid, 1814 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2022-04-15 06:27:49,663 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 189 states. [2022-04-15 06:27:50,010 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 189 to 136. [2022-04-15 06:27:50,010 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 06:27:50,011 INFO L82 GeneralOperation]: Start isEquivalent. First operand 189 states. Second operand has 136 states, 128 states have (on average 1.21875) internal successors, (156), 129 states have internal predecessors, (156), 4 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-15 06:27:50,011 INFO L74 IsIncluded]: Start isIncluded. First operand 189 states. Second operand has 136 states, 128 states have (on average 1.21875) internal successors, (156), 129 states have internal predecessors, (156), 4 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-15 06:27:50,011 INFO L87 Difference]: Start difference. First operand 189 states. Second operand has 136 states, 128 states have (on average 1.21875) internal successors, (156), 129 states have internal predecessors, (156), 4 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-15 06:27:50,013 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:27:50,013 INFO L93 Difference]: Finished difference Result 189 states and 225 transitions. [2022-04-15 06:27:50,013 INFO L276 IsEmpty]: Start isEmpty. Operand 189 states and 225 transitions. [2022-04-15 06:27:50,013 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 06:27:50,014 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 06:27:50,014 INFO L74 IsIncluded]: Start isIncluded. First operand has 136 states, 128 states have (on average 1.21875) internal successors, (156), 129 states have internal predecessors, (156), 4 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) Second operand 189 states. [2022-04-15 06:27:50,014 INFO L87 Difference]: Start difference. First operand has 136 states, 128 states have (on average 1.21875) internal successors, (156), 129 states have internal predecessors, (156), 4 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) Second operand 189 states. [2022-04-15 06:27:50,016 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:27:50,016 INFO L93 Difference]: Finished difference Result 189 states and 225 transitions. [2022-04-15 06:27:50,016 INFO L276 IsEmpty]: Start isEmpty. Operand 189 states and 225 transitions. [2022-04-15 06:27:50,016 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 06:27:50,016 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 06:27:50,016 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 06:27:50,016 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 06:27:50,016 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 136 states, 128 states have (on average 1.21875) internal successors, (156), 129 states have internal predecessors, (156), 4 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-15 06:27:50,018 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 136 states to 136 states and 163 transitions. [2022-04-15 06:27:50,018 INFO L78 Accepts]: Start accepts. Automaton has 136 states and 163 transitions. Word has length 50 [2022-04-15 06:27:50,018 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 06:27:50,018 INFO L478 AbstractCegarLoop]: Abstraction has 136 states and 163 transitions. [2022-04-15 06:27:50,018 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 34 states, 34 states have (on average 1.3529411764705883) internal successors, (46), 32 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-15 06:27:50,018 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 136 states and 163 transitions. [2022-04-15 06:27:50,312 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 163 edges. 163 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 06:27:50,313 INFO L276 IsEmpty]: Start isEmpty. Operand 136 states and 163 transitions. [2022-04-15 06:27:50,313 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2022-04-15 06:27:50,313 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 06:27:50,313 INFO L499 BasicCegarLoop]: trace histogram [10, 10, 8, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 06:27:50,336 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Forceful destruction successful, exit code 0 [2022-04-15 06:27:50,514 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,16 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 06:27:50,514 INFO L403 AbstractCegarLoop]: === Iteration 21 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 06:27:50,514 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 06:27:50,514 INFO L85 PathProgramCache]: Analyzing trace with hash -1512846234, now seen corresponding path program 4 times [2022-04-15 06:27:50,514 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 06:27:50,514 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [688235050] [2022-04-15 06:27:50,636 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 4 AssignedVariables, 1 ReadonlyVariables, Eigenvalues: {0={1=3}, 1={1=1, 2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-15 06:27:50,637 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-15 06:27:50,637 INFO L85 PathProgramCache]: Analyzing trace with hash -1568558376, now seen corresponding path program 1 times [2022-04-15 06:27:50,637 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 06:27:50,637 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [912606048] [2022-04-15 06:27:50,637 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 06:27:50,637 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 06:27:50,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:27:50,696 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 06:27:50,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:27:50,699 INFO L290 TraceCheckUtils]: 0: Hoare triple {14230#(and (= ~last~0 |old(~last~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(11, 2);call #Ultimate.allocInit(12, 3);~last~0 := 0; {14219#true} is VALID [2022-04-15 06:27:50,700 INFO L290 TraceCheckUtils]: 1: Hoare triple {14219#true} assume true; {14219#true} is VALID [2022-04-15 06:27:50,700 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {14219#true} {14219#true} #66#return; {14219#true} is VALID [2022-04-15 06:27:50,700 INFO L272 TraceCheckUtils]: 0: Hoare triple {14219#true} call ULTIMATE.init(); {14230#(and (= ~last~0 |old(~last~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 06:27:50,700 INFO L290 TraceCheckUtils]: 1: Hoare triple {14230#(and (= ~last~0 |old(~last~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(11, 2);call #Ultimate.allocInit(12, 3);~last~0 := 0; {14219#true} is VALID [2022-04-15 06:27:50,700 INFO L290 TraceCheckUtils]: 2: Hoare triple {14219#true} assume true; {14219#true} is VALID [2022-04-15 06:27:50,700 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {14219#true} {14219#true} #66#return; {14219#true} is VALID [2022-04-15 06:27:50,700 INFO L272 TraceCheckUtils]: 4: Hoare triple {14219#true} call #t~ret6 := main(); {14219#true} is VALID [2022-04-15 06:27:50,700 INFO L290 TraceCheckUtils]: 5: Hoare triple {14219#true} assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~last~0 := #t~nondet4;havoc #t~nondet4;~a~0 := 0;~b~0 := 0;~c~0 := 0;~st~0 := 0; {14219#true} is VALID [2022-04-15 06:27:50,701 INFO L290 TraceCheckUtils]: 6: Hoare triple {14219#true} [132] L30-->L23-3_primed: Formula: (let ((.cse0 (= v_main_~st~0_166 v_main_~st~0_164)) (.cse1 (= v_main_~b~0_86 v_main_~b~0_85)) (.cse2 (= v_main_~a~0_89 v_main_~a~0_88)) (.cse3 (= |v_main_#t~post5_211| |v_main_#t~post5_206|))) (or (and .cse0 .cse1 .cse2 .cse3 (= v_main_~c~0_391 v_main_~c~0_385)) (and .cse0 (= v_main_~c~0_385 v_main_~c~0_391) .cse1 .cse2 .cse3))) InVars {main_~c~0=v_main_~c~0_391, main_#t~post5=|v_main_#t~post5_211|, main_~st~0=v_main_~st~0_166, main_~b~0=v_main_~b~0_86, main_~a~0=v_main_~a~0_89} OutVars{main_~c~0=v_main_~c~0_385, main_#t~post5=|v_main_#t~post5_206|, main_~st~0=v_main_~st~0_164, main_~b~0=v_main_~b~0_85, main_~a~0=v_main_~a~0_88} AuxVars[] AssignedVars[main_~c~0, main_#t~post5, main_~st~0, main_~b~0, main_~a~0] {14219#true} is VALID [2022-04-15 06:27:50,701 INFO L290 TraceCheckUtils]: 7: Hoare triple {14219#true} [131] L23-3_primed-->L23-3: Formula: (and (= v_main_~c~0_7 0) (= v_main_~st~0_6 1)) InVars {} OutVars{main_~c~0=v_main_~c~0_7, main_~st~0=v_main_~st~0_6} AuxVars[] AssignedVars[main_~c~0, main_~st~0] {14224#(= main_~c~0 0)} is VALID [2022-04-15 06:27:50,701 INFO L290 TraceCheckUtils]: 8: Hoare triple {14224#(= main_~c~0 0)} assume !!(~c~0 < 200000); {14224#(= main_~c~0 0)} is VALID [2022-04-15 06:27:50,701 INFO L290 TraceCheckUtils]: 9: Hoare triple {14224#(= main_~c~0 0)} assume ~c~0 == ~last~0;~st~0 := 0; {14224#(= main_~c~0 0)} is VALID [2022-04-15 06:27:50,702 INFO L290 TraceCheckUtils]: 10: Hoare triple {14224#(= main_~c~0 0)} #t~post5 := ~c~0;~c~0 := 1 + #t~post5;havoc #t~post5; {14225#(<= main_~c~0 1)} is VALID [2022-04-15 06:27:50,702 INFO L290 TraceCheckUtils]: 11: Hoare triple {14225#(<= main_~c~0 1)} assume !!(~c~0 < 200000); {14225#(<= main_~c~0 1)} is VALID [2022-04-15 06:27:50,702 INFO L290 TraceCheckUtils]: 12: Hoare triple {14225#(<= main_~c~0 1)} assume !(~c~0 == ~last~0); {14225#(<= main_~c~0 1)} is VALID [2022-04-15 06:27:50,703 INFO L290 TraceCheckUtils]: 13: Hoare triple {14225#(<= main_~c~0 1)} #t~post5 := ~c~0;~c~0 := 1 + #t~post5;havoc #t~post5; {14226#(<= main_~c~0 2)} is VALID [2022-04-15 06:27:50,703 INFO L290 TraceCheckUtils]: 14: Hoare triple {14226#(<= main_~c~0 2)} assume !!(~c~0 < 200000); {14226#(<= main_~c~0 2)} is VALID [2022-04-15 06:27:50,703 INFO L290 TraceCheckUtils]: 15: Hoare triple {14226#(<= main_~c~0 2)} assume !(~c~0 == ~last~0); {14226#(<= main_~c~0 2)} is VALID [2022-04-15 06:27:50,704 INFO L290 TraceCheckUtils]: 16: Hoare triple {14226#(<= main_~c~0 2)} #t~post5 := ~c~0;~c~0 := 1 + #t~post5;havoc #t~post5; {14227#(<= main_~c~0 3)} is VALID [2022-04-15 06:27:50,704 INFO L290 TraceCheckUtils]: 17: Hoare triple {14227#(<= main_~c~0 3)} assume !!(~c~0 < 200000); {14227#(<= main_~c~0 3)} is VALID [2022-04-15 06:27:50,704 INFO L290 TraceCheckUtils]: 18: Hoare triple {14227#(<= main_~c~0 3)} assume !(~c~0 == ~last~0); {14227#(<= main_~c~0 3)} is VALID [2022-04-15 06:27:50,705 INFO L290 TraceCheckUtils]: 19: Hoare triple {14227#(<= main_~c~0 3)} #t~post5 := ~c~0;~c~0 := 1 + #t~post5;havoc #t~post5; {14228#(<= main_~c~0 4)} is VALID [2022-04-15 06:27:50,705 INFO L290 TraceCheckUtils]: 20: Hoare triple {14228#(<= main_~c~0 4)} assume !!(~c~0 < 200000); {14228#(<= main_~c~0 4)} is VALID [2022-04-15 06:27:50,705 INFO L290 TraceCheckUtils]: 21: Hoare triple {14228#(<= main_~c~0 4)} assume !(~c~0 == ~last~0); {14228#(<= main_~c~0 4)} is VALID [2022-04-15 06:27:50,705 INFO L290 TraceCheckUtils]: 22: Hoare triple {14228#(<= main_~c~0 4)} #t~post5 := ~c~0;~c~0 := 1 + #t~post5;havoc #t~post5; {14229#(<= main_~c~0 5)} is VALID [2022-04-15 06:27:50,706 INFO L290 TraceCheckUtils]: 23: Hoare triple {14229#(<= main_~c~0 5)} assume !(~c~0 < 200000); {14220#false} is VALID [2022-04-15 06:27:50,706 INFO L290 TraceCheckUtils]: 24: Hoare triple {14220#false} assume 0 == ~st~0 && ~c~0 == 1 + ~last~0;~a~0 := 3 + ~a~0;~b~0 := 3 + ~b~0; {14220#false} is VALID [2022-04-15 06:27:50,706 INFO L290 TraceCheckUtils]: 25: Hoare triple {14220#false} assume !(~c~0 == ~last~0 && 0 == ~st~0); {14220#false} is VALID [2022-04-15 06:27:50,706 INFO L272 TraceCheckUtils]: 26: Hoare triple {14220#false} call __VERIFIER_assert((if ~a~0 == ~b~0 && 200000 == ~c~0 then 1 else 0)); {14220#false} is VALID [2022-04-15 06:27:50,706 INFO L290 TraceCheckUtils]: 27: Hoare triple {14220#false} ~cond := #in~cond; {14220#false} is VALID [2022-04-15 06:27:50,706 INFO L290 TraceCheckUtils]: 28: Hoare triple {14220#false} assume 0 == ~cond; {14220#false} is VALID [2022-04-15 06:27:50,706 INFO L290 TraceCheckUtils]: 29: Hoare triple {14220#false} assume !false; {14220#false} is VALID [2022-04-15 06:27:50,706 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 0 proven. 35 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 06:27:50,706 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 06:27:50,707 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [912606048] [2022-04-15 06:27:50,707 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [912606048] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 06:27:50,707 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1363526856] [2022-04-15 06:27:50,707 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 06:27:50,707 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 06:27:50,707 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 06:27:50,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-15 06:27:50,715 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Waiting until timeout for monitored process [2022-04-15 06:27:50,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:27:50,745 INFO L263 TraceCheckSpWp]: Trace formula consists of 106 conjuncts, 7 conjunts are in the unsatisfiable core [2022-04-15 06:27:50,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:27:50,752 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 06:27:50,875 INFO L272 TraceCheckUtils]: 0: Hoare triple {14219#true} call ULTIMATE.init(); {14219#true} is VALID [2022-04-15 06:27:50,875 INFO L290 TraceCheckUtils]: 1: Hoare triple {14219#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(11, 2);call #Ultimate.allocInit(12, 3);~last~0 := 0; {14219#true} is VALID [2022-04-15 06:27:50,875 INFO L290 TraceCheckUtils]: 2: Hoare triple {14219#true} assume true; {14219#true} is VALID [2022-04-15 06:27:50,875 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {14219#true} {14219#true} #66#return; {14219#true} is VALID [2022-04-15 06:27:50,875 INFO L272 TraceCheckUtils]: 4: Hoare triple {14219#true} call #t~ret6 := main(); {14219#true} is VALID [2022-04-15 06:27:50,875 INFO L290 TraceCheckUtils]: 5: Hoare triple {14219#true} assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~last~0 := #t~nondet4;havoc #t~nondet4;~a~0 := 0;~b~0 := 0;~c~0 := 0;~st~0 := 0; {14219#true} is VALID [2022-04-15 06:27:50,875 INFO L290 TraceCheckUtils]: 6: Hoare triple {14219#true} [132] L30-->L23-3_primed: Formula: (let ((.cse0 (= v_main_~st~0_166 v_main_~st~0_164)) (.cse1 (= v_main_~b~0_86 v_main_~b~0_85)) (.cse2 (= v_main_~a~0_89 v_main_~a~0_88)) (.cse3 (= |v_main_#t~post5_211| |v_main_#t~post5_206|))) (or (and .cse0 .cse1 .cse2 .cse3 (= v_main_~c~0_391 v_main_~c~0_385)) (and .cse0 (= v_main_~c~0_385 v_main_~c~0_391) .cse1 .cse2 .cse3))) InVars {main_~c~0=v_main_~c~0_391, main_#t~post5=|v_main_#t~post5_211|, main_~st~0=v_main_~st~0_166, main_~b~0=v_main_~b~0_86, main_~a~0=v_main_~a~0_89} OutVars{main_~c~0=v_main_~c~0_385, main_#t~post5=|v_main_#t~post5_206|, main_~st~0=v_main_~st~0_164, main_~b~0=v_main_~b~0_85, main_~a~0=v_main_~a~0_88} AuxVars[] AssignedVars[main_~c~0, main_#t~post5, main_~st~0, main_~b~0, main_~a~0] {14219#true} is VALID [2022-04-15 06:27:50,876 INFO L290 TraceCheckUtils]: 7: Hoare triple {14219#true} [131] L23-3_primed-->L23-3: Formula: (and (= v_main_~c~0_7 0) (= v_main_~st~0_6 1)) InVars {} OutVars{main_~c~0=v_main_~c~0_7, main_~st~0=v_main_~st~0_6} AuxVars[] AssignedVars[main_~c~0, main_~st~0] {14255#(<= main_~c~0 0)} is VALID [2022-04-15 06:27:50,876 INFO L290 TraceCheckUtils]: 8: Hoare triple {14255#(<= main_~c~0 0)} assume !!(~c~0 < 200000); {14255#(<= main_~c~0 0)} is VALID [2022-04-15 06:27:50,876 INFO L290 TraceCheckUtils]: 9: Hoare triple {14255#(<= main_~c~0 0)} assume ~c~0 == ~last~0;~st~0 := 0; {14255#(<= main_~c~0 0)} is VALID [2022-04-15 06:27:50,877 INFO L290 TraceCheckUtils]: 10: Hoare triple {14255#(<= main_~c~0 0)} #t~post5 := ~c~0;~c~0 := 1 + #t~post5;havoc #t~post5; {14225#(<= main_~c~0 1)} is VALID [2022-04-15 06:27:50,877 INFO L290 TraceCheckUtils]: 11: Hoare triple {14225#(<= main_~c~0 1)} assume !!(~c~0 < 200000); {14225#(<= main_~c~0 1)} is VALID [2022-04-15 06:27:50,877 INFO L290 TraceCheckUtils]: 12: Hoare triple {14225#(<= main_~c~0 1)} assume !(~c~0 == ~last~0); {14225#(<= main_~c~0 1)} is VALID [2022-04-15 06:27:50,878 INFO L290 TraceCheckUtils]: 13: Hoare triple {14225#(<= main_~c~0 1)} #t~post5 := ~c~0;~c~0 := 1 + #t~post5;havoc #t~post5; {14226#(<= main_~c~0 2)} is VALID [2022-04-15 06:27:50,878 INFO L290 TraceCheckUtils]: 14: Hoare triple {14226#(<= main_~c~0 2)} assume !!(~c~0 < 200000); {14226#(<= main_~c~0 2)} is VALID [2022-04-15 06:27:50,878 INFO L290 TraceCheckUtils]: 15: Hoare triple {14226#(<= main_~c~0 2)} assume !(~c~0 == ~last~0); {14226#(<= main_~c~0 2)} is VALID [2022-04-15 06:27:50,879 INFO L290 TraceCheckUtils]: 16: Hoare triple {14226#(<= main_~c~0 2)} #t~post5 := ~c~0;~c~0 := 1 + #t~post5;havoc #t~post5; {14227#(<= main_~c~0 3)} is VALID [2022-04-15 06:27:50,879 INFO L290 TraceCheckUtils]: 17: Hoare triple {14227#(<= main_~c~0 3)} assume !!(~c~0 < 200000); {14227#(<= main_~c~0 3)} is VALID [2022-04-15 06:27:50,879 INFO L290 TraceCheckUtils]: 18: Hoare triple {14227#(<= main_~c~0 3)} assume !(~c~0 == ~last~0); {14227#(<= main_~c~0 3)} is VALID [2022-04-15 06:27:50,880 INFO L290 TraceCheckUtils]: 19: Hoare triple {14227#(<= main_~c~0 3)} #t~post5 := ~c~0;~c~0 := 1 + #t~post5;havoc #t~post5; {14228#(<= main_~c~0 4)} is VALID [2022-04-15 06:27:50,880 INFO L290 TraceCheckUtils]: 20: Hoare triple {14228#(<= main_~c~0 4)} assume !!(~c~0 < 200000); {14228#(<= main_~c~0 4)} is VALID [2022-04-15 06:27:50,880 INFO L290 TraceCheckUtils]: 21: Hoare triple {14228#(<= main_~c~0 4)} assume !(~c~0 == ~last~0); {14228#(<= main_~c~0 4)} is VALID [2022-04-15 06:27:50,881 INFO L290 TraceCheckUtils]: 22: Hoare triple {14228#(<= main_~c~0 4)} #t~post5 := ~c~0;~c~0 := 1 + #t~post5;havoc #t~post5; {14229#(<= main_~c~0 5)} is VALID [2022-04-15 06:27:50,881 INFO L290 TraceCheckUtils]: 23: Hoare triple {14229#(<= main_~c~0 5)} assume !(~c~0 < 200000); {14220#false} is VALID [2022-04-15 06:27:50,881 INFO L290 TraceCheckUtils]: 24: Hoare triple {14220#false} assume 0 == ~st~0 && ~c~0 == 1 + ~last~0;~a~0 := 3 + ~a~0;~b~0 := 3 + ~b~0; {14220#false} is VALID [2022-04-15 06:27:50,881 INFO L290 TraceCheckUtils]: 25: Hoare triple {14220#false} assume !(~c~0 == ~last~0 && 0 == ~st~0); {14220#false} is VALID [2022-04-15 06:27:50,881 INFO L272 TraceCheckUtils]: 26: Hoare triple {14220#false} call __VERIFIER_assert((if ~a~0 == ~b~0 && 200000 == ~c~0 then 1 else 0)); {14220#false} is VALID [2022-04-15 06:27:50,881 INFO L290 TraceCheckUtils]: 27: Hoare triple {14220#false} ~cond := #in~cond; {14220#false} is VALID [2022-04-15 06:27:50,882 INFO L290 TraceCheckUtils]: 28: Hoare triple {14220#false} assume 0 == ~cond; {14220#false} is VALID [2022-04-15 06:27:50,882 INFO L290 TraceCheckUtils]: 29: Hoare triple {14220#false} assume !false; {14220#false} is VALID [2022-04-15 06:27:50,882 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 0 proven. 35 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 06:27:50,882 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 06:27:51,055 INFO L290 TraceCheckUtils]: 29: Hoare triple {14220#false} assume !false; {14220#false} is VALID [2022-04-15 06:27:51,055 INFO L290 TraceCheckUtils]: 28: Hoare triple {14220#false} assume 0 == ~cond; {14220#false} is VALID [2022-04-15 06:27:51,055 INFO L290 TraceCheckUtils]: 27: Hoare triple {14220#false} ~cond := #in~cond; {14220#false} is VALID [2022-04-15 06:27:51,055 INFO L272 TraceCheckUtils]: 26: Hoare triple {14220#false} call __VERIFIER_assert((if ~a~0 == ~b~0 && 200000 == ~c~0 then 1 else 0)); {14220#false} is VALID [2022-04-15 06:27:51,055 INFO L290 TraceCheckUtils]: 25: Hoare triple {14220#false} assume !(~c~0 == ~last~0 && 0 == ~st~0); {14220#false} is VALID [2022-04-15 06:27:51,055 INFO L290 TraceCheckUtils]: 24: Hoare triple {14220#false} assume 0 == ~st~0 && ~c~0 == 1 + ~last~0;~a~0 := 3 + ~a~0;~b~0 := 3 + ~b~0; {14220#false} is VALID [2022-04-15 06:27:51,055 INFO L290 TraceCheckUtils]: 23: Hoare triple {14340#(< main_~c~0 200000)} assume !(~c~0 < 200000); {14220#false} is VALID [2022-04-15 06:27:51,056 INFO L290 TraceCheckUtils]: 22: Hoare triple {14344#(< main_~c~0 199999)} #t~post5 := ~c~0;~c~0 := 1 + #t~post5;havoc #t~post5; {14340#(< main_~c~0 200000)} is VALID [2022-04-15 06:27:51,056 INFO L290 TraceCheckUtils]: 21: Hoare triple {14344#(< main_~c~0 199999)} assume !(~c~0 == ~last~0); {14344#(< main_~c~0 199999)} is VALID [2022-04-15 06:27:51,056 INFO L290 TraceCheckUtils]: 20: Hoare triple {14344#(< main_~c~0 199999)} assume !!(~c~0 < 200000); {14344#(< main_~c~0 199999)} is VALID [2022-04-15 06:27:51,057 INFO L290 TraceCheckUtils]: 19: Hoare triple {14354#(< main_~c~0 199998)} #t~post5 := ~c~0;~c~0 := 1 + #t~post5;havoc #t~post5; {14344#(< main_~c~0 199999)} is VALID [2022-04-15 06:27:51,057 INFO L290 TraceCheckUtils]: 18: Hoare triple {14354#(< main_~c~0 199998)} assume !(~c~0 == ~last~0); {14354#(< main_~c~0 199998)} is VALID [2022-04-15 06:27:51,057 INFO L290 TraceCheckUtils]: 17: Hoare triple {14354#(< main_~c~0 199998)} assume !!(~c~0 < 200000); {14354#(< main_~c~0 199998)} is VALID [2022-04-15 06:27:51,058 INFO L290 TraceCheckUtils]: 16: Hoare triple {14364#(< main_~c~0 199997)} #t~post5 := ~c~0;~c~0 := 1 + #t~post5;havoc #t~post5; {14354#(< main_~c~0 199998)} is VALID [2022-04-15 06:27:51,058 INFO L290 TraceCheckUtils]: 15: Hoare triple {14364#(< main_~c~0 199997)} assume !(~c~0 == ~last~0); {14364#(< main_~c~0 199997)} is VALID [2022-04-15 06:27:51,058 INFO L290 TraceCheckUtils]: 14: Hoare triple {14364#(< main_~c~0 199997)} assume !!(~c~0 < 200000); {14364#(< main_~c~0 199997)} is VALID [2022-04-15 06:27:51,059 INFO L290 TraceCheckUtils]: 13: Hoare triple {14374#(< main_~c~0 199996)} #t~post5 := ~c~0;~c~0 := 1 + #t~post5;havoc #t~post5; {14364#(< main_~c~0 199997)} is VALID [2022-04-15 06:27:51,059 INFO L290 TraceCheckUtils]: 12: Hoare triple {14374#(< main_~c~0 199996)} assume !(~c~0 == ~last~0); {14374#(< main_~c~0 199996)} is VALID [2022-04-15 06:27:51,059 INFO L290 TraceCheckUtils]: 11: Hoare triple {14374#(< main_~c~0 199996)} assume !!(~c~0 < 200000); {14374#(< main_~c~0 199996)} is VALID [2022-04-15 06:27:51,060 INFO L290 TraceCheckUtils]: 10: Hoare triple {14384#(< main_~c~0 199995)} #t~post5 := ~c~0;~c~0 := 1 + #t~post5;havoc #t~post5; {14374#(< main_~c~0 199996)} is VALID [2022-04-15 06:27:51,060 INFO L290 TraceCheckUtils]: 9: Hoare triple {14384#(< main_~c~0 199995)} assume ~c~0 == ~last~0;~st~0 := 0; {14384#(< main_~c~0 199995)} is VALID [2022-04-15 06:27:51,060 INFO L290 TraceCheckUtils]: 8: Hoare triple {14384#(< main_~c~0 199995)} assume !!(~c~0 < 200000); {14384#(< main_~c~0 199995)} is VALID [2022-04-15 06:27:51,060 INFO L290 TraceCheckUtils]: 7: Hoare triple {14219#true} [131] L23-3_primed-->L23-3: Formula: (and (= v_main_~c~0_7 0) (= v_main_~st~0_6 1)) InVars {} OutVars{main_~c~0=v_main_~c~0_7, main_~st~0=v_main_~st~0_6} AuxVars[] AssignedVars[main_~c~0, main_~st~0] {14384#(< main_~c~0 199995)} is VALID [2022-04-15 06:27:51,061 INFO L290 TraceCheckUtils]: 6: Hoare triple {14219#true} [132] L30-->L23-3_primed: Formula: (let ((.cse0 (= v_main_~st~0_166 v_main_~st~0_164)) (.cse1 (= v_main_~b~0_86 v_main_~b~0_85)) (.cse2 (= v_main_~a~0_89 v_main_~a~0_88)) (.cse3 (= |v_main_#t~post5_211| |v_main_#t~post5_206|))) (or (and .cse0 .cse1 .cse2 .cse3 (= v_main_~c~0_391 v_main_~c~0_385)) (and .cse0 (= v_main_~c~0_385 v_main_~c~0_391) .cse1 .cse2 .cse3))) InVars {main_~c~0=v_main_~c~0_391, main_#t~post5=|v_main_#t~post5_211|, main_~st~0=v_main_~st~0_166, main_~b~0=v_main_~b~0_86, main_~a~0=v_main_~a~0_89} OutVars{main_~c~0=v_main_~c~0_385, main_#t~post5=|v_main_#t~post5_206|, main_~st~0=v_main_~st~0_164, main_~b~0=v_main_~b~0_85, main_~a~0=v_main_~a~0_88} AuxVars[] AssignedVars[main_~c~0, main_#t~post5, main_~st~0, main_~b~0, main_~a~0] {14219#true} is VALID [2022-04-15 06:27:51,061 INFO L290 TraceCheckUtils]: 5: Hoare triple {14219#true} assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~last~0 := #t~nondet4;havoc #t~nondet4;~a~0 := 0;~b~0 := 0;~c~0 := 0;~st~0 := 0; {14219#true} is VALID [2022-04-15 06:27:51,061 INFO L272 TraceCheckUtils]: 4: Hoare triple {14219#true} call #t~ret6 := main(); {14219#true} is VALID [2022-04-15 06:27:51,061 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {14219#true} {14219#true} #66#return; {14219#true} is VALID [2022-04-15 06:27:51,061 INFO L290 TraceCheckUtils]: 2: Hoare triple {14219#true} assume true; {14219#true} is VALID [2022-04-15 06:27:51,061 INFO L290 TraceCheckUtils]: 1: Hoare triple {14219#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(11, 2);call #Ultimate.allocInit(12, 3);~last~0 := 0; {14219#true} is VALID [2022-04-15 06:27:51,061 INFO L272 TraceCheckUtils]: 0: Hoare triple {14219#true} call ULTIMATE.init(); {14219#true} is VALID [2022-04-15 06:27:51,061 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 0 proven. 35 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 06:27:51,061 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1363526856] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 06:27:51,061 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 06:27:51,061 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8, 8] total 16 [2022-04-15 06:27:51,155 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 06:27:51,155 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [688235050] [2022-04-15 06:27:51,155 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [688235050] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 06:27:51,155 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 06:27:51,155 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2022-04-15 06:27:51,155 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2052600824] [2022-04-15 06:27:51,155 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 06:27:51,156 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 2.8125) internal successors, (45), 15 states have internal predecessors, (45), 2 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 53 [2022-04-15 06:27:51,156 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 06:27:51,156 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 16 states, 16 states have (on average 2.8125) internal successors, (45), 15 states have internal predecessors, (45), 2 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-15 06:27:51,177 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-15 06:27:51,177 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2022-04-15 06:27:51,177 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 06:27:51,177 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-04-15 06:27:51,178 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=192, Invalid=314, Unknown=0, NotChecked=0, Total=506 [2022-04-15 06:27:51,178 INFO L87 Difference]: Start difference. First operand 136 states and 163 transitions. Second operand has 16 states, 16 states have (on average 2.8125) internal successors, (45), 15 states have internal predecessors, (45), 2 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-15 06:27:51,940 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:27:51,940 INFO L93 Difference]: Finished difference Result 244 states and 294 transitions. [2022-04-15 06:27:51,940 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-04-15 06:27:51,940 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 2.8125) internal successors, (45), 15 states have internal predecessors, (45), 2 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 53 [2022-04-15 06:27:51,940 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 06:27:51,940 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16 states, 16 states have (on average 2.8125) internal successors, (45), 15 states have internal predecessors, (45), 2 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-15 06:27:51,941 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 81 transitions. [2022-04-15 06:27:51,941 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16 states, 16 states have (on average 2.8125) internal successors, (45), 15 states have internal predecessors, (45), 2 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-15 06:27:51,942 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 81 transitions. [2022-04-15 06:27:51,942 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 16 states and 81 transitions. [2022-04-15 06:27:51,993 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 81 edges. 81 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 06:27:51,995 INFO L225 Difference]: With dead ends: 244 [2022-04-15 06:27:51,995 INFO L226 Difference]: Without dead ends: 192 [2022-04-15 06:27:51,998 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 101 GetRequests, 73 SyntacticMatches, 7 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 371 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=192, Invalid=314, Unknown=0, NotChecked=0, Total=506 [2022-04-15 06:27:51,998 INFO L913 BasicCegarLoop]: 18 mSDtfsCounter, 36 mSDsluCounter, 25 mSDsCounter, 0 mSdLazyCounter, 223 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 36 SdHoareTripleChecker+Valid, 43 SdHoareTripleChecker+Invalid, 233 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 223 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-15 06:27:51,998 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [36 Valid, 43 Invalid, 233 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 223 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-15 06:27:51,999 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 192 states. [2022-04-15 06:27:52,439 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 192 to 159. [2022-04-15 06:27:52,439 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 06:27:52,439 INFO L82 GeneralOperation]: Start isEquivalent. First operand 192 states. Second operand has 159 states, 151 states have (on average 1.1986754966887416) internal successors, (181), 152 states have internal predecessors, (181), 4 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-15 06:27:52,439 INFO L74 IsIncluded]: Start isIncluded. First operand 192 states. Second operand has 159 states, 151 states have (on average 1.1986754966887416) internal successors, (181), 152 states have internal predecessors, (181), 4 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-15 06:27:52,440 INFO L87 Difference]: Start difference. First operand 192 states. Second operand has 159 states, 151 states have (on average 1.1986754966887416) internal successors, (181), 152 states have internal predecessors, (181), 4 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-15 06:27:52,442 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:27:52,442 INFO L93 Difference]: Finished difference Result 192 states and 223 transitions. [2022-04-15 06:27:52,442 INFO L276 IsEmpty]: Start isEmpty. Operand 192 states and 223 transitions. [2022-04-15 06:27:52,442 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 06:27:52,442 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 06:27:52,443 INFO L74 IsIncluded]: Start isIncluded. First operand has 159 states, 151 states have (on average 1.1986754966887416) internal successors, (181), 152 states have internal predecessors, (181), 4 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) Second operand 192 states. [2022-04-15 06:27:52,443 INFO L87 Difference]: Start difference. First operand has 159 states, 151 states have (on average 1.1986754966887416) internal successors, (181), 152 states have internal predecessors, (181), 4 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) Second operand 192 states. [2022-04-15 06:27:52,444 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:27:52,444 INFO L93 Difference]: Finished difference Result 192 states and 223 transitions. [2022-04-15 06:27:52,444 INFO L276 IsEmpty]: Start isEmpty. Operand 192 states and 223 transitions. [2022-04-15 06:27:52,445 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 06:27:52,445 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 06:27:52,445 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 06:27:52,445 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 06:27:52,445 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 159 states, 151 states have (on average 1.1986754966887416) internal successors, (181), 152 states have internal predecessors, (181), 4 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-15 06:27:52,447 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 159 states to 159 states and 188 transitions. [2022-04-15 06:27:52,447 INFO L78 Accepts]: Start accepts. Automaton has 159 states and 188 transitions. Word has length 53 [2022-04-15 06:27:52,447 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 06:27:52,447 INFO L478 AbstractCegarLoop]: Abstraction has 159 states and 188 transitions. [2022-04-15 06:27:52,447 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 2.8125) internal successors, (45), 15 states have internal predecessors, (45), 2 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-15 06:27:52,447 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 159 states and 188 transitions. [2022-04-15 06:27:52,825 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 188 edges. 188 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 06:27:52,825 INFO L276 IsEmpty]: Start isEmpty. Operand 159 states and 188 transitions. [2022-04-15 06:27:52,825 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2022-04-15 06:27:52,825 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 06:27:52,825 INFO L499 BasicCegarLoop]: trace histogram [13, 13, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 06:27:52,842 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Ended with exit code 0 [2022-04-15 06:27:53,026 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20,17 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 06:27:53,026 INFO L403 AbstractCegarLoop]: === Iteration 22 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 06:27:53,026 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 06:27:53,026 INFO L85 PathProgramCache]: Analyzing trace with hash 2090772964, now seen corresponding path program 12 times [2022-04-15 06:27:53,026 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 06:27:53,026 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [773841627] [2022-04-15 06:27:53,233 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 1 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-15 06:27:53,397 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {0={1=1}, 1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-15 06:27:53,398 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-15 06:27:53,399 INFO L85 PathProgramCache]: Analyzing trace with hash -1845551928, now seen corresponding path program 1 times [2022-04-15 06:27:53,399 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 06:27:53,400 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [258923165] [2022-04-15 06:27:53,400 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 06:27:53,400 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 06:27:53,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:27:53,537 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 06:27:53,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:27:53,542 INFO L290 TraceCheckUtils]: 0: Hoare triple {15626#(and (= ~last~0 |old(~last~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(11, 2);call #Ultimate.allocInit(12, 3);~last~0 := 0; {15614#true} is VALID [2022-04-15 06:27:53,542 INFO L290 TraceCheckUtils]: 1: Hoare triple {15614#true} assume true; {15614#true} is VALID [2022-04-15 06:27:53,542 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {15614#true} {15614#true} #66#return; {15614#true} is VALID [2022-04-15 06:27:53,543 INFO L272 TraceCheckUtils]: 0: Hoare triple {15614#true} call ULTIMATE.init(); {15626#(and (= ~last~0 |old(~last~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 06:27:53,543 INFO L290 TraceCheckUtils]: 1: Hoare triple {15626#(and (= ~last~0 |old(~last~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(11, 2);call #Ultimate.allocInit(12, 3);~last~0 := 0; {15614#true} is VALID [2022-04-15 06:27:53,543 INFO L290 TraceCheckUtils]: 2: Hoare triple {15614#true} assume true; {15614#true} is VALID [2022-04-15 06:27:53,543 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {15614#true} {15614#true} #66#return; {15614#true} is VALID [2022-04-15 06:27:53,543 INFO L272 TraceCheckUtils]: 4: Hoare triple {15614#true} call #t~ret6 := main(); {15614#true} is VALID [2022-04-15 06:27:53,543 INFO L290 TraceCheckUtils]: 5: Hoare triple {15614#true} assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~last~0 := #t~nondet4;havoc #t~nondet4;~a~0 := 0;~b~0 := 0;~c~0 := 0;~st~0 := 0; {15619#(and (= main_~a~0 0) (= main_~b~0 0))} is VALID [2022-04-15 06:27:53,544 INFO L290 TraceCheckUtils]: 6: Hoare triple {15619#(and (= main_~a~0 0) (= main_~b~0 0))} assume !false;~st~0 := 1;~c~0 := 0; {15620#(and (= main_~a~0 0) (= main_~st~0 1) (= main_~b~0 0))} is VALID [2022-04-15 06:27:53,544 INFO L290 TraceCheckUtils]: 7: Hoare triple {15620#(and (= main_~a~0 0) (= main_~st~0 1) (= main_~b~0 0))} [134] L23-3-->L23-4_primed: Formula: (let ((.cse0 (= |v_main_#t~post5_222| |v_main_#t~post5_220|)) (.cse1 (= v_main_~c~0_412 v_main_~c~0_411)) (.cse2 (= v_~last~0_135 v_main_~c~0_412))) (or (and .cse0 (= v_~last~0_135 v_~last~0_135) .cse1) (and (not .cse2) (< v_main_~c~0_412 v_main_~c~0_411) (< v_main_~c~0_411 200001) (or (not (<= (+ v_~last~0_135 1) v_main_~c~0_411)) (not (<= (+ v_main_~c~0_412 1) v_~last~0_135)))) (and .cse0 .cse1 (or .cse2 (not (< v_main_~c~0_412 200000)))))) InVars {main_~c~0=v_main_~c~0_412, main_#t~post5=|v_main_#t~post5_222|, ~last~0=v_~last~0_135} OutVars{main_#t~post5=|v_main_#t~post5_220|, main_~c~0=v_main_~c~0_411, ~last~0=v_~last~0_135} AuxVars[] AssignedVars[main_#t~post5, main_~c~0] {15620#(and (= main_~a~0 0) (= main_~st~0 1) (= main_~b~0 0))} is VALID [2022-04-15 06:27:53,545 INFO L290 TraceCheckUtils]: 8: Hoare triple {15620#(and (= main_~a~0 0) (= main_~st~0 1) (= main_~b~0 0))} [135] L23-4_primed-->L23-3: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {15620#(and (= main_~a~0 0) (= main_~st~0 1) (= main_~b~0 0))} is VALID [2022-04-15 06:27:53,545 INFO L290 TraceCheckUtils]: 9: Hoare triple {15620#(and (= main_~a~0 0) (= main_~st~0 1) (= main_~b~0 0))} [136] L23-3-->L23-4_primed: Formula: (let ((.cse2 (< v_main_~c~0_414 200000)) (.cse1 (= v_~last~0_136 v_main_~c~0_414)) (.cse0 (= v_main_~c~0_414 v_main_~c~0_413)) (.cse3 (= |v_main_#t~post5_225| |v_main_#t~post5_221|)) (.cse4 (= v_main_~st~0_174 v_main_~st~0_173))) (or (and .cse0 (or (not .cse1) (not .cse2)) .cse3 .cse4) (and (< v_main_~c~0_413 (+ 2 v_main_~c~0_414)) (< v_main_~c~0_414 v_main_~c~0_413) .cse2 .cse1 (= v_main_~st~0_173 0)) (and .cse0 (= v_~last~0_136 v_~last~0_136) .cse3 .cse4))) InVars {main_~c~0=v_main_~c~0_414, main_#t~post5=|v_main_#t~post5_225|, main_~st~0=v_main_~st~0_174, ~last~0=v_~last~0_136} OutVars{main_#t~post5=|v_main_#t~post5_221|, main_~c~0=v_main_~c~0_413, main_~st~0=v_main_~st~0_173, ~last~0=v_~last~0_136} AuxVars[] AssignedVars[main_#t~post5, main_~c~0, main_~st~0] {15621#(or (= main_~st~0 1) (and (= main_~a~0 0) (or (<= ~last~0 199999) (<= main_~c~0 200000)) (= main_~b~0 0)))} is VALID [2022-04-15 06:27:53,546 INFO L290 TraceCheckUtils]: 10: Hoare triple {15621#(or (= main_~st~0 1) (and (= main_~a~0 0) (or (<= ~last~0 199999) (<= main_~c~0 200000)) (= main_~b~0 0)))} [133] L23-4_primed-->L23-4: Formula: (not (< v_main_~c~0_8 200000)) InVars {main_~c~0=v_main_~c~0_8} OutVars{main_~c~0=v_main_~c~0_8} AuxVars[] AssignedVars[] {15622#(or (= main_~st~0 1) (and (= main_~a~0 0) (or (<= ~last~0 199999) (<= main_~c~0 200000)) (= main_~b~0 0) (< 199999 main_~c~0)))} is VALID [2022-04-15 06:27:53,547 INFO L290 TraceCheckUtils]: 11: Hoare triple {15622#(or (= main_~st~0 1) (and (= main_~a~0 0) (or (<= ~last~0 199999) (<= main_~c~0 200000)) (= main_~b~0 0) (< 199999 main_~c~0)))} assume 0 == ~st~0 && ~c~0 == 1 + ~last~0;~a~0 := 3 + ~a~0;~b~0 := 3 + ~b~0; {15623#(and (<= main_~b~0 main_~a~0) (< main_~a~0 (+ main_~b~0 1)) (< 199999 main_~c~0) (<= main_~c~0 200000))} is VALID [2022-04-15 06:27:53,547 INFO L290 TraceCheckUtils]: 12: Hoare triple {15623#(and (<= main_~b~0 main_~a~0) (< main_~a~0 (+ main_~b~0 1)) (< 199999 main_~c~0) (<= main_~c~0 200000))} assume !(~c~0 == ~last~0 && 0 == ~st~0); {15623#(and (<= main_~b~0 main_~a~0) (< main_~a~0 (+ main_~b~0 1)) (< 199999 main_~c~0) (<= main_~c~0 200000))} is VALID [2022-04-15 06:27:53,548 INFO L272 TraceCheckUtils]: 13: Hoare triple {15623#(and (<= main_~b~0 main_~a~0) (< main_~a~0 (+ main_~b~0 1)) (< 199999 main_~c~0) (<= main_~c~0 200000))} call __VERIFIER_assert((if ~a~0 == ~b~0 && 200000 == ~c~0 then 1 else 0)); {15624#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-15 06:27:53,548 INFO L290 TraceCheckUtils]: 14: Hoare triple {15624#(not (= |__VERIFIER_assert_#in~cond| 0))} ~cond := #in~cond; {15625#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-15 06:27:53,548 INFO L290 TraceCheckUtils]: 15: Hoare triple {15625#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {15615#false} is VALID [2022-04-15 06:27:53,548 INFO L290 TraceCheckUtils]: 16: Hoare triple {15615#false} assume !false; {15615#false} is VALID [2022-04-15 06:27:53,549 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-04-15 06:27:53,549 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 06:27:53,549 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [258923165] [2022-04-15 06:27:53,549 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [258923165] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 06:27:53,549 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [19765226] [2022-04-15 06:27:53,549 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 06:27:53,549 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 06:27:53,549 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 06:27:53,550 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-15 06:27:53,595 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Waiting until timeout for monitored process [2022-04-15 06:27:53,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:27:53,628 INFO L263 TraceCheckSpWp]: Trace formula consists of 85 conjuncts, 18 conjunts are in the unsatisfiable core [2022-04-15 06:27:53,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:27:53,636 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 06:27:53,888 INFO L272 TraceCheckUtils]: 0: Hoare triple {15614#true} call ULTIMATE.init(); {15614#true} is VALID [2022-04-15 06:27:53,888 INFO L290 TraceCheckUtils]: 1: Hoare triple {15614#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(11, 2);call #Ultimate.allocInit(12, 3);~last~0 := 0; {15614#true} is VALID [2022-04-15 06:27:53,888 INFO L290 TraceCheckUtils]: 2: Hoare triple {15614#true} assume true; {15614#true} is VALID [2022-04-15 06:27:53,888 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {15614#true} {15614#true} #66#return; {15614#true} is VALID [2022-04-15 06:27:53,889 INFO L272 TraceCheckUtils]: 4: Hoare triple {15614#true} call #t~ret6 := main(); {15614#true} is VALID [2022-04-15 06:27:53,889 INFO L290 TraceCheckUtils]: 5: Hoare triple {15614#true} assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~last~0 := #t~nondet4;havoc #t~nondet4;~a~0 := 0;~b~0 := 0;~c~0 := 0;~st~0 := 0; {15619#(and (= main_~a~0 0) (= main_~b~0 0))} is VALID [2022-04-15 06:27:53,889 INFO L290 TraceCheckUtils]: 6: Hoare triple {15619#(and (= main_~a~0 0) (= main_~b~0 0))} assume !false;~st~0 := 1;~c~0 := 0; {15620#(and (= main_~a~0 0) (= main_~st~0 1) (= main_~b~0 0))} is VALID [2022-04-15 06:27:53,890 INFO L290 TraceCheckUtils]: 7: Hoare triple {15620#(and (= main_~a~0 0) (= main_~st~0 1) (= main_~b~0 0))} [134] L23-3-->L23-4_primed: Formula: (let ((.cse0 (= |v_main_#t~post5_222| |v_main_#t~post5_220|)) (.cse1 (= v_main_~c~0_412 v_main_~c~0_411)) (.cse2 (= v_~last~0_135 v_main_~c~0_412))) (or (and .cse0 (= v_~last~0_135 v_~last~0_135) .cse1) (and (not .cse2) (< v_main_~c~0_412 v_main_~c~0_411) (< v_main_~c~0_411 200001) (or (not (<= (+ v_~last~0_135 1) v_main_~c~0_411)) (not (<= (+ v_main_~c~0_412 1) v_~last~0_135)))) (and .cse0 .cse1 (or .cse2 (not (< v_main_~c~0_412 200000)))))) InVars {main_~c~0=v_main_~c~0_412, main_#t~post5=|v_main_#t~post5_222|, ~last~0=v_~last~0_135} OutVars{main_#t~post5=|v_main_#t~post5_220|, main_~c~0=v_main_~c~0_411, ~last~0=v_~last~0_135} AuxVars[] AssignedVars[main_#t~post5, main_~c~0] {15620#(and (= main_~a~0 0) (= main_~st~0 1) (= main_~b~0 0))} is VALID [2022-04-15 06:27:53,890 INFO L290 TraceCheckUtils]: 8: Hoare triple {15620#(and (= main_~a~0 0) (= main_~st~0 1) (= main_~b~0 0))} [135] L23-4_primed-->L23-3: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {15620#(and (= main_~a~0 0) (= main_~st~0 1) (= main_~b~0 0))} is VALID [2022-04-15 06:27:53,891 INFO L290 TraceCheckUtils]: 9: Hoare triple {15620#(and (= main_~a~0 0) (= main_~st~0 1) (= main_~b~0 0))} [136] L23-3-->L23-4_primed: Formula: (let ((.cse2 (< v_main_~c~0_414 200000)) (.cse1 (= v_~last~0_136 v_main_~c~0_414)) (.cse0 (= v_main_~c~0_414 v_main_~c~0_413)) (.cse3 (= |v_main_#t~post5_225| |v_main_#t~post5_221|)) (.cse4 (= v_main_~st~0_174 v_main_~st~0_173))) (or (and .cse0 (or (not .cse1) (not .cse2)) .cse3 .cse4) (and (< v_main_~c~0_413 (+ 2 v_main_~c~0_414)) (< v_main_~c~0_414 v_main_~c~0_413) .cse2 .cse1 (= v_main_~st~0_173 0)) (and .cse0 (= v_~last~0_136 v_~last~0_136) .cse3 .cse4))) InVars {main_~c~0=v_main_~c~0_414, main_#t~post5=|v_main_#t~post5_225|, main_~st~0=v_main_~st~0_174, ~last~0=v_~last~0_136} OutVars{main_#t~post5=|v_main_#t~post5_221|, main_~c~0=v_main_~c~0_413, main_~st~0=v_main_~st~0_173, ~last~0=v_~last~0_136} AuxVars[] AssignedVars[main_#t~post5, main_~c~0, main_~st~0] {15657#(and (= main_~a~0 0) (= main_~b~0 0) (or (= main_~st~0 1) (and (< ~last~0 200000) (< ~last~0 main_~c~0) (< main_~c~0 (+ ~last~0 2)) (= main_~st~0 0))))} is VALID [2022-04-15 06:27:53,892 INFO L290 TraceCheckUtils]: 10: Hoare triple {15657#(and (= main_~a~0 0) (= main_~b~0 0) (or (= main_~st~0 1) (and (< ~last~0 200000) (< ~last~0 main_~c~0) (< main_~c~0 (+ ~last~0 2)) (= main_~st~0 0))))} [133] L23-4_primed-->L23-4: Formula: (not (< v_main_~c~0_8 200000)) InVars {main_~c~0=v_main_~c~0_8} OutVars{main_~c~0=v_main_~c~0_8} AuxVars[] AssignedVars[] {15661#(and (= main_~a~0 0) (or (and (< ~last~0 200000) (< main_~c~0 (+ ~last~0 2)) (= main_~st~0 0)) (= main_~st~0 1)) (= main_~b~0 0) (not (< main_~c~0 200000)))} is VALID [2022-04-15 06:27:53,892 INFO L290 TraceCheckUtils]: 11: Hoare triple {15661#(and (= main_~a~0 0) (or (and (< ~last~0 200000) (< main_~c~0 (+ ~last~0 2)) (= main_~st~0 0)) (= main_~st~0 1)) (= main_~b~0 0) (not (< main_~c~0 200000)))} assume 0 == ~st~0 && ~c~0 == 1 + ~last~0;~a~0 := 3 + ~a~0;~b~0 := 3 + ~b~0; {15665#(and (= main_~b~0 3) (<= 200000 main_~c~0) (< main_~c~0 200001) (= main_~a~0 3))} is VALID [2022-04-15 06:27:53,892 INFO L290 TraceCheckUtils]: 12: Hoare triple {15665#(and (= main_~b~0 3) (<= 200000 main_~c~0) (< main_~c~0 200001) (= main_~a~0 3))} assume !(~c~0 == ~last~0 && 0 == ~st~0); {15665#(and (= main_~b~0 3) (<= 200000 main_~c~0) (< main_~c~0 200001) (= main_~a~0 3))} is VALID [2022-04-15 06:27:53,893 INFO L272 TraceCheckUtils]: 13: Hoare triple {15665#(and (= main_~b~0 3) (<= 200000 main_~c~0) (< main_~c~0 200001) (= main_~a~0 3))} call __VERIFIER_assert((if ~a~0 == ~b~0 && 200000 == ~c~0 then 1 else 0)); {15672#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-15 06:27:53,893 INFO L290 TraceCheckUtils]: 14: Hoare triple {15672#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {15676#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-15 06:27:53,894 INFO L290 TraceCheckUtils]: 15: Hoare triple {15676#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {15615#false} is VALID [2022-04-15 06:27:53,894 INFO L290 TraceCheckUtils]: 16: Hoare triple {15615#false} assume !false; {15615#false} is VALID [2022-04-15 06:27:53,894 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-04-15 06:27:53,894 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 06:27:54,313 INFO L290 TraceCheckUtils]: 16: Hoare triple {15615#false} assume !false; {15615#false} is VALID [2022-04-15 06:27:54,314 INFO L290 TraceCheckUtils]: 15: Hoare triple {15676#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {15615#false} is VALID [2022-04-15 06:27:54,314 INFO L290 TraceCheckUtils]: 14: Hoare triple {15672#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {15676#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-15 06:27:54,315 INFO L272 TraceCheckUtils]: 13: Hoare triple {15623#(and (<= main_~b~0 main_~a~0) (< main_~a~0 (+ main_~b~0 1)) (< 199999 main_~c~0) (<= main_~c~0 200000))} call __VERIFIER_assert((if ~a~0 == ~b~0 && 200000 == ~c~0 then 1 else 0)); {15672#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-15 06:27:54,316 INFO L290 TraceCheckUtils]: 12: Hoare triple {15623#(and (<= main_~b~0 main_~a~0) (< main_~a~0 (+ main_~b~0 1)) (< 199999 main_~c~0) (<= main_~c~0 200000))} assume !(~c~0 == ~last~0 && 0 == ~st~0); {15623#(and (<= main_~b~0 main_~a~0) (< main_~a~0 (+ main_~b~0 1)) (< 199999 main_~c~0) (<= main_~c~0 200000))} is VALID [2022-04-15 06:27:54,317 INFO L290 TraceCheckUtils]: 11: Hoare triple {15698#(or (not (<= main_~c~0 (+ ~last~0 1))) (and (<= main_~b~0 main_~a~0) (< main_~a~0 (+ main_~b~0 1)) (< 199999 main_~c~0) (<= main_~c~0 200000)) (not (= main_~st~0 0)))} assume 0 == ~st~0 && ~c~0 == 1 + ~last~0;~a~0 := 3 + ~a~0;~b~0 := 3 + ~b~0; {15623#(and (<= main_~b~0 main_~a~0) (< main_~a~0 (+ main_~b~0 1)) (< 199999 main_~c~0) (<= main_~c~0 200000))} is VALID [2022-04-15 06:27:54,317 INFO L290 TraceCheckUtils]: 10: Hoare triple {15702#(or (not (<= main_~c~0 (+ ~last~0 1))) (and (<= main_~b~0 main_~a~0) (< main_~a~0 (+ main_~b~0 1)) (<= main_~c~0 200000)) (not (= main_~st~0 0)) (< main_~c~0 200000))} [133] L23-4_primed-->L23-4: Formula: (not (< v_main_~c~0_8 200000)) InVars {main_~c~0=v_main_~c~0_8} OutVars{main_~c~0=v_main_~c~0_8} AuxVars[] AssignedVars[] {15698#(or (not (<= main_~c~0 (+ ~last~0 1))) (and (<= main_~b~0 main_~a~0) (< main_~a~0 (+ main_~b~0 1)) (< 199999 main_~c~0) (<= main_~c~0 200000)) (not (= main_~st~0 0)))} is VALID [2022-04-15 06:27:54,318 INFO L290 TraceCheckUtils]: 9: Hoare triple {15706#(and (<= main_~b~0 main_~a~0) (< main_~a~0 (+ main_~b~0 1)) (not (= main_~st~0 0)))} [136] L23-3-->L23-4_primed: Formula: (let ((.cse2 (< v_main_~c~0_414 200000)) (.cse1 (= v_~last~0_136 v_main_~c~0_414)) (.cse0 (= v_main_~c~0_414 v_main_~c~0_413)) (.cse3 (= |v_main_#t~post5_225| |v_main_#t~post5_221|)) (.cse4 (= v_main_~st~0_174 v_main_~st~0_173))) (or (and .cse0 (or (not .cse1) (not .cse2)) .cse3 .cse4) (and (< v_main_~c~0_413 (+ 2 v_main_~c~0_414)) (< v_main_~c~0_414 v_main_~c~0_413) .cse2 .cse1 (= v_main_~st~0_173 0)) (and .cse0 (= v_~last~0_136 v_~last~0_136) .cse3 .cse4))) InVars {main_~c~0=v_main_~c~0_414, main_#t~post5=|v_main_#t~post5_225|, main_~st~0=v_main_~st~0_174, ~last~0=v_~last~0_136} OutVars{main_#t~post5=|v_main_#t~post5_221|, main_~c~0=v_main_~c~0_413, main_~st~0=v_main_~st~0_173, ~last~0=v_~last~0_136} AuxVars[] AssignedVars[main_#t~post5, main_~c~0, main_~st~0] {15702#(or (not (<= main_~c~0 (+ ~last~0 1))) (and (<= main_~b~0 main_~a~0) (< main_~a~0 (+ main_~b~0 1)) (<= main_~c~0 200000)) (not (= main_~st~0 0)) (< main_~c~0 200000))} is VALID [2022-04-15 06:27:54,319 INFO L290 TraceCheckUtils]: 8: Hoare triple {15706#(and (<= main_~b~0 main_~a~0) (< main_~a~0 (+ main_~b~0 1)) (not (= main_~st~0 0)))} [135] L23-4_primed-->L23-3: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {15706#(and (<= main_~b~0 main_~a~0) (< main_~a~0 (+ main_~b~0 1)) (not (= main_~st~0 0)))} is VALID [2022-04-15 06:27:54,320 INFO L290 TraceCheckUtils]: 7: Hoare triple {15706#(and (<= main_~b~0 main_~a~0) (< main_~a~0 (+ main_~b~0 1)) (not (= main_~st~0 0)))} [134] L23-3-->L23-4_primed: Formula: (let ((.cse0 (= |v_main_#t~post5_222| |v_main_#t~post5_220|)) (.cse1 (= v_main_~c~0_412 v_main_~c~0_411)) (.cse2 (= v_~last~0_135 v_main_~c~0_412))) (or (and .cse0 (= v_~last~0_135 v_~last~0_135) .cse1) (and (not .cse2) (< v_main_~c~0_412 v_main_~c~0_411) (< v_main_~c~0_411 200001) (or (not (<= (+ v_~last~0_135 1) v_main_~c~0_411)) (not (<= (+ v_main_~c~0_412 1) v_~last~0_135)))) (and .cse0 .cse1 (or .cse2 (not (< v_main_~c~0_412 200000)))))) InVars {main_~c~0=v_main_~c~0_412, main_#t~post5=|v_main_#t~post5_222|, ~last~0=v_~last~0_135} OutVars{main_#t~post5=|v_main_#t~post5_220|, main_~c~0=v_main_~c~0_411, ~last~0=v_~last~0_135} AuxVars[] AssignedVars[main_#t~post5, main_~c~0] {15706#(and (<= main_~b~0 main_~a~0) (< main_~a~0 (+ main_~b~0 1)) (not (= main_~st~0 0)))} is VALID [2022-04-15 06:27:54,320 INFO L290 TraceCheckUtils]: 6: Hoare triple {15716#(and (<= main_~b~0 main_~a~0) (< main_~a~0 (+ main_~b~0 1)))} assume !false;~st~0 := 1;~c~0 := 0; {15706#(and (<= main_~b~0 main_~a~0) (< main_~a~0 (+ main_~b~0 1)) (not (= main_~st~0 0)))} is VALID [2022-04-15 06:27:54,321 INFO L290 TraceCheckUtils]: 5: Hoare triple {15614#true} assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~last~0 := #t~nondet4;havoc #t~nondet4;~a~0 := 0;~b~0 := 0;~c~0 := 0;~st~0 := 0; {15716#(and (<= main_~b~0 main_~a~0) (< main_~a~0 (+ main_~b~0 1)))} is VALID [2022-04-15 06:27:54,321 INFO L272 TraceCheckUtils]: 4: Hoare triple {15614#true} call #t~ret6 := main(); {15614#true} is VALID [2022-04-15 06:27:54,321 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {15614#true} {15614#true} #66#return; {15614#true} is VALID [2022-04-15 06:27:54,321 INFO L290 TraceCheckUtils]: 2: Hoare triple {15614#true} assume true; {15614#true} is VALID [2022-04-15 06:27:54,321 INFO L290 TraceCheckUtils]: 1: Hoare triple {15614#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(11, 2);call #Ultimate.allocInit(12, 3);~last~0 := 0; {15614#true} is VALID [2022-04-15 06:27:54,321 INFO L272 TraceCheckUtils]: 0: Hoare triple {15614#true} call ULTIMATE.init(); {15614#true} is VALID [2022-04-15 06:27:54,321 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-04-15 06:27:54,321 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [19765226] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 06:27:54,322 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 06:27:54,322 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9, 9] total 19 [2022-04-15 06:27:55,153 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 06:27:55,154 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [773841627] [2022-04-15 06:27:55,154 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [773841627] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 06:27:55,154 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 06:27:55,154 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [36] imperfect sequences [] total 36 [2022-04-15 06:27:55,154 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [931950683] [2022-04-15 06:27:55,154 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 06:27:55,156 INFO L78 Accepts]: Start accepts. Automaton has has 36 states, 36 states have (on average 1.3611111111111112) internal successors, (49), 34 states have internal predecessors, (49), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 53 [2022-04-15 06:27:55,156 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 06:27:55,156 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 36 states, 36 states have (on average 1.3611111111111112) internal successors, (49), 34 states have internal predecessors, (49), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:27:55,183 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 53 edges. 53 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 06:27:55,184 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 36 states [2022-04-15 06:27:55,184 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 06:27:55,184 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2022-04-15 06:27:55,185 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=276, Invalid=1794, Unknown=0, NotChecked=0, Total=2070 [2022-04-15 06:27:55,185 INFO L87 Difference]: Start difference. First operand 159 states and 188 transitions. Second operand has 36 states, 36 states have (on average 1.3611111111111112) internal successors, (49), 34 states have internal predecessors, (49), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:27:58,146 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:27:58,146 INFO L93 Difference]: Finished difference Result 244 states and 288 transitions. [2022-04-15 06:27:58,146 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 50 states. [2022-04-15 06:27:58,146 INFO L78 Accepts]: Start accepts. Automaton has has 36 states, 36 states have (on average 1.3611111111111112) internal successors, (49), 34 states have internal predecessors, (49), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 53 [2022-04-15 06:27:58,146 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 06:27:58,146 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 36 states, 36 states have (on average 1.3611111111111112) internal successors, (49), 34 states have internal predecessors, (49), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:27:58,147 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 135 transitions. [2022-04-15 06:27:58,148 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 36 states, 36 states have (on average 1.3611111111111112) internal successors, (49), 34 states have internal predecessors, (49), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:27:58,148 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 135 transitions. [2022-04-15 06:27:58,148 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 50 states and 135 transitions. [2022-04-15 06:27:58,212 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 135 edges. 135 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 06:27:58,214 INFO L225 Difference]: With dead ends: 244 [2022-04-15 06:27:58,214 INFO L226 Difference]: Without dead ends: 194 [2022-04-15 06:27:58,215 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 101 GetRequests, 39 SyntacticMatches, 2 SemanticMatches, 60 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1084 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=423, Invalid=3359, Unknown=0, NotChecked=0, Total=3782 [2022-04-15 06:27:58,215 INFO L913 BasicCegarLoop]: 16 mSDtfsCounter, 88 mSDsluCounter, 74 mSDsCounter, 0 mSdLazyCounter, 1801 mSolverCounterSat, 66 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 90 SdHoareTripleChecker+Valid, 90 SdHoareTripleChecker+Invalid, 1867 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 66 IncrementalHoareTripleChecker+Valid, 1801 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2022-04-15 06:27:58,215 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [90 Valid, 90 Invalid, 1867 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [66 Valid, 1801 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2022-04-15 06:27:58,216 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 194 states. [2022-04-15 06:27:58,509 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 194 to 162. [2022-04-15 06:27:58,509 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 06:27:58,509 INFO L82 GeneralOperation]: Start isEquivalent. First operand 194 states. Second operand has 162 states, 154 states have (on average 1.2012987012987013) internal successors, (185), 155 states have internal predecessors, (185), 4 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-15 06:27:58,509 INFO L74 IsIncluded]: Start isIncluded. First operand 194 states. Second operand has 162 states, 154 states have (on average 1.2012987012987013) internal successors, (185), 155 states have internal predecessors, (185), 4 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-15 06:27:58,510 INFO L87 Difference]: Start difference. First operand 194 states. Second operand has 162 states, 154 states have (on average 1.2012987012987013) internal successors, (185), 155 states have internal predecessors, (185), 4 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-15 06:27:58,511 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:27:58,512 INFO L93 Difference]: Finished difference Result 194 states and 226 transitions. [2022-04-15 06:27:58,512 INFO L276 IsEmpty]: Start isEmpty. Operand 194 states and 226 transitions. [2022-04-15 06:27:58,512 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 06:27:58,512 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 06:27:58,512 INFO L74 IsIncluded]: Start isIncluded. First operand has 162 states, 154 states have (on average 1.2012987012987013) internal successors, (185), 155 states have internal predecessors, (185), 4 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) Second operand 194 states. [2022-04-15 06:27:58,512 INFO L87 Difference]: Start difference. First operand has 162 states, 154 states have (on average 1.2012987012987013) internal successors, (185), 155 states have internal predecessors, (185), 4 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) Second operand 194 states. [2022-04-15 06:27:58,514 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:27:58,514 INFO L93 Difference]: Finished difference Result 194 states and 226 transitions. [2022-04-15 06:27:58,514 INFO L276 IsEmpty]: Start isEmpty. Operand 194 states and 226 transitions. [2022-04-15 06:27:58,514 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 06:27:58,514 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 06:27:58,514 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 06:27:58,514 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 06:27:58,515 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 162 states, 154 states have (on average 1.2012987012987013) internal successors, (185), 155 states have internal predecessors, (185), 4 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-15 06:27:58,516 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 162 states to 162 states and 192 transitions. [2022-04-15 06:27:58,518 INFO L78 Accepts]: Start accepts. Automaton has 162 states and 192 transitions. Word has length 53 [2022-04-15 06:27:58,518 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 06:27:58,518 INFO L478 AbstractCegarLoop]: Abstraction has 162 states and 192 transitions. [2022-04-15 06:27:58,518 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 36 states, 36 states have (on average 1.3611111111111112) internal successors, (49), 34 states have internal predecessors, (49), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:27:58,518 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 162 states and 192 transitions. [2022-04-15 06:27:58,832 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 192 edges. 192 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 06:27:58,832 INFO L276 IsEmpty]: Start isEmpty. Operand 162 states and 192 transitions. [2022-04-15 06:27:58,833 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2022-04-15 06:27:58,833 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 06:27:58,833 INFO L499 BasicCegarLoop]: trace histogram [14, 14, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 06:27:58,850 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Forceful destruction successful, exit code 0 [2022-04-15 06:27:59,033 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21,18 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 06:27:59,033 INFO L403 AbstractCegarLoop]: === Iteration 23 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 06:27:59,033 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 06:27:59,034 INFO L85 PathProgramCache]: Analyzing trace with hash 397140807, now seen corresponding path program 13 times [2022-04-15 06:27:59,034 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 06:27:59,034 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [465275928] [2022-04-15 06:28:01,515 WARN L970 rdanLoopAcceleration]: Unable to prove correctness of quantifier elimination. [2022-04-15 06:28:01,607 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 1 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-15 06:28:01,819 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {0={1=1}, 1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-15 06:28:01,819 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-15 06:28:01,822 INFO L85 PathProgramCache]: Analyzing trace with hash 659832264, now seen corresponding path program 1 times [2022-04-15 06:28:01,822 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 06:28:01,822 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [499711042] [2022-04-15 06:28:01,822 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 06:28:01,822 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 06:28:01,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:28:01,942 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 06:28:01,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:28:01,945 INFO L290 TraceCheckUtils]: 0: Hoare triple {17009#(and (= ~last~0 |old(~last~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(11, 2);call #Ultimate.allocInit(12, 3);~last~0 := 0; {16996#true} is VALID [2022-04-15 06:28:01,945 INFO L290 TraceCheckUtils]: 1: Hoare triple {16996#true} assume true; {16996#true} is VALID [2022-04-15 06:28:01,945 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {16996#true} {16996#true} #66#return; {16996#true} is VALID [2022-04-15 06:28:01,945 INFO L272 TraceCheckUtils]: 0: Hoare triple {16996#true} call ULTIMATE.init(); {17009#(and (= ~last~0 |old(~last~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 06:28:01,945 INFO L290 TraceCheckUtils]: 1: Hoare triple {17009#(and (= ~last~0 |old(~last~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(11, 2);call #Ultimate.allocInit(12, 3);~last~0 := 0; {16996#true} is VALID [2022-04-15 06:28:01,945 INFO L290 TraceCheckUtils]: 2: Hoare triple {16996#true} assume true; {16996#true} is VALID [2022-04-15 06:28:01,945 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {16996#true} {16996#true} #66#return; {16996#true} is VALID [2022-04-15 06:28:01,946 INFO L272 TraceCheckUtils]: 4: Hoare triple {16996#true} call #t~ret6 := main(); {16996#true} is VALID [2022-04-15 06:28:01,946 INFO L290 TraceCheckUtils]: 5: Hoare triple {16996#true} assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~last~0 := #t~nondet4;havoc #t~nondet4;~a~0 := 0;~b~0 := 0;~c~0 := 0;~st~0 := 0; {17001#(and (= main_~a~0 0) (= main_~b~0 0))} is VALID [2022-04-15 06:28:01,946 INFO L290 TraceCheckUtils]: 6: Hoare triple {17001#(and (= main_~a~0 0) (= main_~b~0 0))} assume !false;~st~0 := 1;~c~0 := 0; {17002#(and (= main_~a~0 0) (= main_~b~0 0) (= main_~c~0 0))} is VALID [2022-04-15 06:28:01,947 INFO L290 TraceCheckUtils]: 7: Hoare triple {17002#(and (= main_~a~0 0) (= main_~b~0 0) (= main_~c~0 0))} [138] L23-3-->L23-4_primed: Formula: (let ((.cse0 (= v_~last~0_143 v_main_~c~0_442)) (.cse1 (= |v_main_#t~post5_235| |v_main_#t~post5_233|)) (.cse2 (= v_main_~c~0_442 v_main_~c~0_441))) (or (and (< v_main_~c~0_442 v_main_~c~0_441) (or (not (<= (+ v_~last~0_143 1) v_main_~c~0_441)) (not (<= (+ v_main_~c~0_442 1) v_~last~0_143))) (not .cse0) (< v_main_~c~0_441 200001)) (and (or .cse0 (not (< v_main_~c~0_442 200000))) .cse1 .cse2) (and (= v_~last~0_143 v_~last~0_143) .cse1 .cse2))) InVars {main_~c~0=v_main_~c~0_442, main_#t~post5=|v_main_#t~post5_235|, ~last~0=v_~last~0_143} OutVars{main_#t~post5=|v_main_#t~post5_233|, main_~c~0=v_main_~c~0_441, ~last~0=v_~last~0_143} AuxVars[] AssignedVars[main_#t~post5, main_~c~0] {17003#(and (= main_~a~0 0) (= main_~b~0 0) (<= main_~c~0 200000))} is VALID [2022-04-15 06:28:01,947 INFO L290 TraceCheckUtils]: 8: Hoare triple {17003#(and (= main_~a~0 0) (= main_~b~0 0) (<= main_~c~0 200000))} [139] L23-4_primed-->L23-3: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {17003#(and (= main_~a~0 0) (= main_~b~0 0) (<= main_~c~0 200000))} is VALID [2022-04-15 06:28:01,948 INFO L290 TraceCheckUtils]: 9: Hoare triple {17003#(and (= main_~a~0 0) (= main_~b~0 0) (<= main_~c~0 200000))} [140] L23-3-->L23-4_primed: Formula: (let ((.cse0 (= |v_main_#t~post5_238| |v_main_#t~post5_234|)) (.cse1 (= v_main_~st~0_184 v_main_~st~0_183)) (.cse2 (= v_main_~c~0_444 v_main_~c~0_443)) (.cse4 (= v_~last~0_144 v_main_~c~0_444)) (.cse3 (< v_main_~c~0_444 200000))) (or (and .cse0 .cse1 (= v_~last~0_144 v_~last~0_144) .cse2) (and (< v_main_~c~0_444 v_main_~c~0_443) .cse3 .cse4 (<= v_main_~c~0_443 (+ v_~last~0_144 1)) (= v_main_~st~0_183 0)) (and .cse0 .cse1 .cse2 (or (not .cse4) (not .cse3))))) InVars {main_~c~0=v_main_~c~0_444, main_#t~post5=|v_main_#t~post5_238|, main_~st~0=v_main_~st~0_184, ~last~0=v_~last~0_144} OutVars{main_#t~post5=|v_main_#t~post5_234|, main_~c~0=v_main_~c~0_443, main_~st~0=v_main_~st~0_183, ~last~0=v_~last~0_144} AuxVars[] AssignedVars[main_#t~post5, main_~c~0, main_~st~0] {17004#(and (= main_~a~0 0) (or (<= ~last~0 199999) (<= main_~c~0 200000)) (= main_~b~0 0))} is VALID [2022-04-15 06:28:01,948 INFO L290 TraceCheckUtils]: 10: Hoare triple {17004#(and (= main_~a~0 0) (or (<= ~last~0 199999) (<= main_~c~0 200000)) (= main_~b~0 0))} [137] L23-4_primed-->L23-4: Formula: (not (< v_main_~c~0_8 200000)) InVars {main_~c~0=v_main_~c~0_8} OutVars{main_~c~0=v_main_~c~0_8} AuxVars[] AssignedVars[] {17005#(and (= main_~a~0 0) (= main_~b~0 0) (or (and (< 199999 main_~c~0) (<= main_~c~0 200000)) (and (<= ~last~0 199999) (< 199999 main_~c~0))))} is VALID [2022-04-15 06:28:01,949 INFO L290 TraceCheckUtils]: 11: Hoare triple {17005#(and (= main_~a~0 0) (= main_~b~0 0) (or (and (< 199999 main_~c~0) (<= main_~c~0 200000)) (and (<= ~last~0 199999) (< 199999 main_~c~0))))} assume 0 == ~st~0 && ~c~0 == 1 + ~last~0;~a~0 := 3 + ~a~0;~b~0 := 3 + ~b~0; {17006#(and (<= main_~b~0 main_~a~0) (< main_~a~0 (+ main_~b~0 1)) (< 199999 main_~c~0) (<= main_~c~0 200000))} is VALID [2022-04-15 06:28:01,949 INFO L290 TraceCheckUtils]: 12: Hoare triple {17006#(and (<= main_~b~0 main_~a~0) (< main_~a~0 (+ main_~b~0 1)) (< 199999 main_~c~0) (<= main_~c~0 200000))} assume !(~c~0 == ~last~0 && 0 == ~st~0); {17006#(and (<= main_~b~0 main_~a~0) (< main_~a~0 (+ main_~b~0 1)) (< 199999 main_~c~0) (<= main_~c~0 200000))} is VALID [2022-04-15 06:28:01,950 INFO L272 TraceCheckUtils]: 13: Hoare triple {17006#(and (<= main_~b~0 main_~a~0) (< main_~a~0 (+ main_~b~0 1)) (< 199999 main_~c~0) (<= main_~c~0 200000))} call __VERIFIER_assert((if ~a~0 == ~b~0 && 200000 == ~c~0 then 1 else 0)); {17007#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-15 06:28:01,950 INFO L290 TraceCheckUtils]: 14: Hoare triple {17007#(not (= |__VERIFIER_assert_#in~cond| 0))} ~cond := #in~cond; {17008#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-15 06:28:01,951 INFO L290 TraceCheckUtils]: 15: Hoare triple {17008#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {16997#false} is VALID [2022-04-15 06:28:01,951 INFO L290 TraceCheckUtils]: 16: Hoare triple {16997#false} assume !false; {16997#false} is VALID [2022-04-15 06:28:01,951 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 06:28:01,951 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 06:28:01,951 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [499711042] [2022-04-15 06:28:01,951 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [499711042] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 06:28:01,951 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1264309516] [2022-04-15 06:28:01,951 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 06:28:01,951 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 06:28:01,951 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 06:28:01,952 INFO L229 MonitoredProcess]: Starting monitored process 19 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-15 06:28:01,953 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Waiting until timeout for monitored process [2022-04-15 06:28:01,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:28:01,987 INFO L263 TraceCheckSpWp]: Trace formula consists of 85 conjuncts, 18 conjunts are in the unsatisfiable core [2022-04-15 06:28:01,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:28:01,993 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 06:28:02,279 INFO L272 TraceCheckUtils]: 0: Hoare triple {16996#true} call ULTIMATE.init(); {16996#true} is VALID [2022-04-15 06:28:02,279 INFO L290 TraceCheckUtils]: 1: Hoare triple {16996#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(11, 2);call #Ultimate.allocInit(12, 3);~last~0 := 0; {16996#true} is VALID [2022-04-15 06:28:02,279 INFO L290 TraceCheckUtils]: 2: Hoare triple {16996#true} assume true; {16996#true} is VALID [2022-04-15 06:28:02,279 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {16996#true} {16996#true} #66#return; {16996#true} is VALID [2022-04-15 06:28:02,279 INFO L272 TraceCheckUtils]: 4: Hoare triple {16996#true} call #t~ret6 := main(); {16996#true} is VALID [2022-04-15 06:28:02,279 INFO L290 TraceCheckUtils]: 5: Hoare triple {16996#true} assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~last~0 := #t~nondet4;havoc #t~nondet4;~a~0 := 0;~b~0 := 0;~c~0 := 0;~st~0 := 0; {17001#(and (= main_~a~0 0) (= main_~b~0 0))} is VALID [2022-04-15 06:28:02,280 INFO L290 TraceCheckUtils]: 6: Hoare triple {17001#(and (= main_~a~0 0) (= main_~b~0 0))} assume !false;~st~0 := 1;~c~0 := 0; {17031#(and (= main_~a~0 0) (= main_~st~0 1) (= main_~b~0 0))} is VALID [2022-04-15 06:28:02,280 INFO L290 TraceCheckUtils]: 7: Hoare triple {17031#(and (= main_~a~0 0) (= main_~st~0 1) (= main_~b~0 0))} [138] L23-3-->L23-4_primed: Formula: (let ((.cse0 (= v_~last~0_143 v_main_~c~0_442)) (.cse1 (= |v_main_#t~post5_235| |v_main_#t~post5_233|)) (.cse2 (= v_main_~c~0_442 v_main_~c~0_441))) (or (and (< v_main_~c~0_442 v_main_~c~0_441) (or (not (<= (+ v_~last~0_143 1) v_main_~c~0_441)) (not (<= (+ v_main_~c~0_442 1) v_~last~0_143))) (not .cse0) (< v_main_~c~0_441 200001)) (and (or .cse0 (not (< v_main_~c~0_442 200000))) .cse1 .cse2) (and (= v_~last~0_143 v_~last~0_143) .cse1 .cse2))) InVars {main_~c~0=v_main_~c~0_442, main_#t~post5=|v_main_#t~post5_235|, ~last~0=v_~last~0_143} OutVars{main_#t~post5=|v_main_#t~post5_233|, main_~c~0=v_main_~c~0_441, ~last~0=v_~last~0_143} AuxVars[] AssignedVars[main_#t~post5, main_~c~0] {17031#(and (= main_~a~0 0) (= main_~st~0 1) (= main_~b~0 0))} is VALID [2022-04-15 06:28:02,281 INFO L290 TraceCheckUtils]: 8: Hoare triple {17031#(and (= main_~a~0 0) (= main_~st~0 1) (= main_~b~0 0))} [139] L23-4_primed-->L23-3: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {17031#(and (= main_~a~0 0) (= main_~st~0 1) (= main_~b~0 0))} is VALID [2022-04-15 06:28:02,281 INFO L290 TraceCheckUtils]: 9: Hoare triple {17031#(and (= main_~a~0 0) (= main_~st~0 1) (= main_~b~0 0))} [140] L23-3-->L23-4_primed: Formula: (let ((.cse0 (= |v_main_#t~post5_238| |v_main_#t~post5_234|)) (.cse1 (= v_main_~st~0_184 v_main_~st~0_183)) (.cse2 (= v_main_~c~0_444 v_main_~c~0_443)) (.cse4 (= v_~last~0_144 v_main_~c~0_444)) (.cse3 (< v_main_~c~0_444 200000))) (or (and .cse0 .cse1 (= v_~last~0_144 v_~last~0_144) .cse2) (and (< v_main_~c~0_444 v_main_~c~0_443) .cse3 .cse4 (<= v_main_~c~0_443 (+ v_~last~0_144 1)) (= v_main_~st~0_183 0)) (and .cse0 .cse1 .cse2 (or (not .cse4) (not .cse3))))) InVars {main_~c~0=v_main_~c~0_444, main_#t~post5=|v_main_#t~post5_238|, main_~st~0=v_main_~st~0_184, ~last~0=v_~last~0_144} OutVars{main_#t~post5=|v_main_#t~post5_234|, main_~c~0=v_main_~c~0_443, main_~st~0=v_main_~st~0_183, ~last~0=v_~last~0_144} AuxVars[] AssignedVars[main_#t~post5, main_~c~0, main_~st~0] {17041#(and (= main_~a~0 0) (= main_~b~0 0) (or (and (< ~last~0 200000) (< ~last~0 main_~c~0) (<= main_~c~0 (+ ~last~0 1)) (= main_~st~0 0)) (= main_~st~0 1)))} is VALID [2022-04-15 06:28:02,282 INFO L290 TraceCheckUtils]: 10: Hoare triple {17041#(and (= main_~a~0 0) (= main_~b~0 0) (or (and (< ~last~0 200000) (< ~last~0 main_~c~0) (<= main_~c~0 (+ ~last~0 1)) (= main_~st~0 0)) (= main_~st~0 1)))} [137] L23-4_primed-->L23-4: Formula: (not (< v_main_~c~0_8 200000)) InVars {main_~c~0=v_main_~c~0_8} OutVars{main_~c~0=v_main_~c~0_8} AuxVars[] AssignedVars[] {17045#(and (= main_~a~0 0) (or (= main_~st~0 1) (and (< ~last~0 200000) (<= main_~c~0 (+ ~last~0 1)) (= main_~st~0 0))) (= main_~b~0 0) (not (< main_~c~0 200000)))} is VALID [2022-04-15 06:28:02,283 INFO L290 TraceCheckUtils]: 11: Hoare triple {17045#(and (= main_~a~0 0) (or (= main_~st~0 1) (and (< ~last~0 200000) (<= main_~c~0 (+ ~last~0 1)) (= main_~st~0 0))) (= main_~b~0 0) (not (< main_~c~0 200000)))} assume 0 == ~st~0 && ~c~0 == 1 + ~last~0;~a~0 := 3 + ~a~0;~b~0 := 3 + ~b~0; {17049#(and (= main_~b~0 3) (<= 200000 main_~c~0) (< main_~c~0 200001) (= main_~a~0 3))} is VALID [2022-04-15 06:28:02,283 INFO L290 TraceCheckUtils]: 12: Hoare triple {17049#(and (= main_~b~0 3) (<= 200000 main_~c~0) (< main_~c~0 200001) (= main_~a~0 3))} assume !(~c~0 == ~last~0 && 0 == ~st~0); {17049#(and (= main_~b~0 3) (<= 200000 main_~c~0) (< main_~c~0 200001) (= main_~a~0 3))} is VALID [2022-04-15 06:28:02,284 INFO L272 TraceCheckUtils]: 13: Hoare triple {17049#(and (= main_~b~0 3) (<= 200000 main_~c~0) (< main_~c~0 200001) (= main_~a~0 3))} call __VERIFIER_assert((if ~a~0 == ~b~0 && 200000 == ~c~0 then 1 else 0)); {17056#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-15 06:28:02,284 INFO L290 TraceCheckUtils]: 14: Hoare triple {17056#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {17060#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-15 06:28:02,284 INFO L290 TraceCheckUtils]: 15: Hoare triple {17060#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {16997#false} is VALID [2022-04-15 06:28:02,284 INFO L290 TraceCheckUtils]: 16: Hoare triple {16997#false} assume !false; {16997#false} is VALID [2022-04-15 06:28:02,284 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-04-15 06:28:02,284 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 06:28:02,661 INFO L290 TraceCheckUtils]: 16: Hoare triple {16997#false} assume !false; {16997#false} is VALID [2022-04-15 06:28:02,662 INFO L290 TraceCheckUtils]: 15: Hoare triple {17060#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {16997#false} is VALID [2022-04-15 06:28:02,662 INFO L290 TraceCheckUtils]: 14: Hoare triple {17056#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {17060#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-15 06:28:02,663 INFO L272 TraceCheckUtils]: 13: Hoare triple {17006#(and (<= main_~b~0 main_~a~0) (< main_~a~0 (+ main_~b~0 1)) (< 199999 main_~c~0) (<= main_~c~0 200000))} call __VERIFIER_assert((if ~a~0 == ~b~0 && 200000 == ~c~0 then 1 else 0)); {17056#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-15 06:28:02,663 INFO L290 TraceCheckUtils]: 12: Hoare triple {17006#(and (<= main_~b~0 main_~a~0) (< main_~a~0 (+ main_~b~0 1)) (< 199999 main_~c~0) (<= main_~c~0 200000))} assume !(~c~0 == ~last~0 && 0 == ~st~0); {17006#(and (<= main_~b~0 main_~a~0) (< main_~a~0 (+ main_~b~0 1)) (< 199999 main_~c~0) (<= main_~c~0 200000))} is VALID [2022-04-15 06:28:02,664 INFO L290 TraceCheckUtils]: 11: Hoare triple {17082#(or (not (<= main_~c~0 (+ ~last~0 1))) (and (<= main_~b~0 main_~a~0) (< main_~a~0 (+ main_~b~0 1)) (< 199999 main_~c~0) (<= main_~c~0 200000)) (not (= main_~st~0 0)))} assume 0 == ~st~0 && ~c~0 == 1 + ~last~0;~a~0 := 3 + ~a~0;~b~0 := 3 + ~b~0; {17006#(and (<= main_~b~0 main_~a~0) (< main_~a~0 (+ main_~b~0 1)) (< 199999 main_~c~0) (<= main_~c~0 200000))} is VALID [2022-04-15 06:28:02,665 INFO L290 TraceCheckUtils]: 10: Hoare triple {17086#(or (not (<= main_~c~0 (+ ~last~0 1))) (and (<= main_~b~0 main_~a~0) (< main_~a~0 (+ main_~b~0 1)) (<= main_~c~0 200000)) (not (= main_~st~0 0)) (< main_~c~0 200000))} [137] L23-4_primed-->L23-4: Formula: (not (< v_main_~c~0_8 200000)) InVars {main_~c~0=v_main_~c~0_8} OutVars{main_~c~0=v_main_~c~0_8} AuxVars[] AssignedVars[] {17082#(or (not (<= main_~c~0 (+ ~last~0 1))) (and (<= main_~b~0 main_~a~0) (< main_~a~0 (+ main_~b~0 1)) (< 199999 main_~c~0) (<= main_~c~0 200000)) (not (= main_~st~0 0)))} is VALID [2022-04-15 06:28:02,665 INFO L290 TraceCheckUtils]: 9: Hoare triple {17090#(and (<= main_~b~0 main_~a~0) (< main_~a~0 (+ main_~b~0 1)) (not (= main_~st~0 0)))} [140] L23-3-->L23-4_primed: Formula: (let ((.cse0 (= |v_main_#t~post5_238| |v_main_#t~post5_234|)) (.cse1 (= v_main_~st~0_184 v_main_~st~0_183)) (.cse2 (= v_main_~c~0_444 v_main_~c~0_443)) (.cse4 (= v_~last~0_144 v_main_~c~0_444)) (.cse3 (< v_main_~c~0_444 200000))) (or (and .cse0 .cse1 (= v_~last~0_144 v_~last~0_144) .cse2) (and (< v_main_~c~0_444 v_main_~c~0_443) .cse3 .cse4 (<= v_main_~c~0_443 (+ v_~last~0_144 1)) (= v_main_~st~0_183 0)) (and .cse0 .cse1 .cse2 (or (not .cse4) (not .cse3))))) InVars {main_~c~0=v_main_~c~0_444, main_#t~post5=|v_main_#t~post5_238|, main_~st~0=v_main_~st~0_184, ~last~0=v_~last~0_144} OutVars{main_#t~post5=|v_main_#t~post5_234|, main_~c~0=v_main_~c~0_443, main_~st~0=v_main_~st~0_183, ~last~0=v_~last~0_144} AuxVars[] AssignedVars[main_#t~post5, main_~c~0, main_~st~0] {17086#(or (not (<= main_~c~0 (+ ~last~0 1))) (and (<= main_~b~0 main_~a~0) (< main_~a~0 (+ main_~b~0 1)) (<= main_~c~0 200000)) (not (= main_~st~0 0)) (< main_~c~0 200000))} is VALID [2022-04-15 06:28:02,666 INFO L290 TraceCheckUtils]: 8: Hoare triple {17090#(and (<= main_~b~0 main_~a~0) (< main_~a~0 (+ main_~b~0 1)) (not (= main_~st~0 0)))} [139] L23-4_primed-->L23-3: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {17090#(and (<= main_~b~0 main_~a~0) (< main_~a~0 (+ main_~b~0 1)) (not (= main_~st~0 0)))} is VALID [2022-04-15 06:28:02,666 INFO L290 TraceCheckUtils]: 7: Hoare triple {17090#(and (<= main_~b~0 main_~a~0) (< main_~a~0 (+ main_~b~0 1)) (not (= main_~st~0 0)))} [138] L23-3-->L23-4_primed: Formula: (let ((.cse0 (= v_~last~0_143 v_main_~c~0_442)) (.cse1 (= |v_main_#t~post5_235| |v_main_#t~post5_233|)) (.cse2 (= v_main_~c~0_442 v_main_~c~0_441))) (or (and (< v_main_~c~0_442 v_main_~c~0_441) (or (not (<= (+ v_~last~0_143 1) v_main_~c~0_441)) (not (<= (+ v_main_~c~0_442 1) v_~last~0_143))) (not .cse0) (< v_main_~c~0_441 200001)) (and (or .cse0 (not (< v_main_~c~0_442 200000))) .cse1 .cse2) (and (= v_~last~0_143 v_~last~0_143) .cse1 .cse2))) InVars {main_~c~0=v_main_~c~0_442, main_#t~post5=|v_main_#t~post5_235|, ~last~0=v_~last~0_143} OutVars{main_#t~post5=|v_main_#t~post5_233|, main_~c~0=v_main_~c~0_441, ~last~0=v_~last~0_143} AuxVars[] AssignedVars[main_#t~post5, main_~c~0] {17090#(and (<= main_~b~0 main_~a~0) (< main_~a~0 (+ main_~b~0 1)) (not (= main_~st~0 0)))} is VALID [2022-04-15 06:28:02,667 INFO L290 TraceCheckUtils]: 6: Hoare triple {17100#(and (<= main_~b~0 main_~a~0) (< main_~a~0 (+ main_~b~0 1)))} assume !false;~st~0 := 1;~c~0 := 0; {17090#(and (<= main_~b~0 main_~a~0) (< main_~a~0 (+ main_~b~0 1)) (not (= main_~st~0 0)))} is VALID [2022-04-15 06:28:02,667 INFO L290 TraceCheckUtils]: 5: Hoare triple {16996#true} assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~last~0 := #t~nondet4;havoc #t~nondet4;~a~0 := 0;~b~0 := 0;~c~0 := 0;~st~0 := 0; {17100#(and (<= main_~b~0 main_~a~0) (< main_~a~0 (+ main_~b~0 1)))} is VALID [2022-04-15 06:28:02,667 INFO L272 TraceCheckUtils]: 4: Hoare triple {16996#true} call #t~ret6 := main(); {16996#true} is VALID [2022-04-15 06:28:02,667 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {16996#true} {16996#true} #66#return; {16996#true} is VALID [2022-04-15 06:28:02,667 INFO L290 TraceCheckUtils]: 2: Hoare triple {16996#true} assume true; {16996#true} is VALID [2022-04-15 06:28:02,667 INFO L290 TraceCheckUtils]: 1: Hoare triple {16996#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(11, 2);call #Ultimate.allocInit(12, 3);~last~0 := 0; {16996#true} is VALID [2022-04-15 06:28:02,667 INFO L272 TraceCheckUtils]: 0: Hoare triple {16996#true} call ULTIMATE.init(); {16996#true} is VALID [2022-04-15 06:28:02,667 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-04-15 06:28:02,668 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1264309516] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 06:28:02,668 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 06:28:02,668 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 9, 9] total 21 [2022-04-15 06:28:04,002 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 06:28:04,002 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [465275928] [2022-04-15 06:28:04,002 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [465275928] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 06:28:04,002 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 06:28:04,002 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [38] imperfect sequences [] total 38 [2022-04-15 06:28:04,002 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [484720534] [2022-04-15 06:28:04,002 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 06:28:04,003 INFO L78 Accepts]: Start accepts. Automaton has has 38 states, 38 states have (on average 1.368421052631579) internal successors, (52), 36 states have internal predecessors, (52), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 56 [2022-04-15 06:28:04,003 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 06:28:04,003 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 38 states, 38 states have (on average 1.368421052631579) internal successors, (52), 36 states have internal predecessors, (52), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:28:04,046 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 56 edges. 56 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 06:28:04,046 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 38 states [2022-04-15 06:28:04,046 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 06:28:04,046 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2022-04-15 06:28:04,047 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=339, Invalid=2211, Unknown=0, NotChecked=0, Total=2550 [2022-04-15 06:28:04,047 INFO L87 Difference]: Start difference. First operand 162 states and 192 transitions. Second operand has 38 states, 38 states have (on average 1.368421052631579) internal successors, (52), 36 states have internal predecessors, (52), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:28:07,838 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:28:07,838 INFO L93 Difference]: Finished difference Result 267 states and 320 transitions. [2022-04-15 06:28:07,838 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2022-04-15 06:28:07,838 INFO L78 Accepts]: Start accepts. Automaton has has 38 states, 38 states have (on average 1.368421052631579) internal successors, (52), 36 states have internal predecessors, (52), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 56 [2022-04-15 06:28:07,838 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 06:28:07,838 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 38 states, 38 states have (on average 1.368421052631579) internal successors, (52), 36 states have internal predecessors, (52), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:28:07,840 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 120 transitions. [2022-04-15 06:28:07,840 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 38 states, 38 states have (on average 1.368421052631579) internal successors, (52), 36 states have internal predecessors, (52), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:28:07,841 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 120 transitions. [2022-04-15 06:28:07,841 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 46 states and 120 transitions. [2022-04-15 06:28:07,906 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 120 edges. 120 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 06:28:07,909 INFO L225 Difference]: With dead ends: 267 [2022-04-15 06:28:07,909 INFO L226 Difference]: Without dead ends: 217 [2022-04-15 06:28:07,910 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 101 GetRequests, 38 SyntacticMatches, 2 SemanticMatches, 61 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1224 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=453, Invalid=3453, Unknown=0, NotChecked=0, Total=3906 [2022-04-15 06:28:07,911 INFO L913 BasicCegarLoop]: 13 mSDtfsCounter, 63 mSDsluCounter, 96 mSDsCounter, 0 mSdLazyCounter, 1902 mSolverCounterSat, 37 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 64 SdHoareTripleChecker+Valid, 109 SdHoareTripleChecker+Invalid, 1939 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 37 IncrementalHoareTripleChecker+Valid, 1902 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2022-04-15 06:28:07,911 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [64 Valid, 109 Invalid, 1939 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [37 Valid, 1902 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2022-04-15 06:28:07,911 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 217 states. [2022-04-15 06:28:08,223 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 217 to 151. [2022-04-15 06:28:08,224 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 06:28:08,224 INFO L82 GeneralOperation]: Start isEquivalent. First operand 217 states. Second operand has 151 states, 143 states have (on average 1.2167832167832169) internal successors, (174), 144 states have internal predecessors, (174), 4 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-15 06:28:08,224 INFO L74 IsIncluded]: Start isIncluded. First operand 217 states. Second operand has 151 states, 143 states have (on average 1.2167832167832169) internal successors, (174), 144 states have internal predecessors, (174), 4 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-15 06:28:08,224 INFO L87 Difference]: Start difference. First operand 217 states. Second operand has 151 states, 143 states have (on average 1.2167832167832169) internal successors, (174), 144 states have internal predecessors, (174), 4 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-15 06:28:08,226 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:28:08,226 INFO L93 Difference]: Finished difference Result 217 states and 258 transitions. [2022-04-15 06:28:08,226 INFO L276 IsEmpty]: Start isEmpty. Operand 217 states and 258 transitions. [2022-04-15 06:28:08,227 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 06:28:08,227 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 06:28:08,227 INFO L74 IsIncluded]: Start isIncluded. First operand has 151 states, 143 states have (on average 1.2167832167832169) internal successors, (174), 144 states have internal predecessors, (174), 4 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) Second operand 217 states. [2022-04-15 06:28:08,227 INFO L87 Difference]: Start difference. First operand has 151 states, 143 states have (on average 1.2167832167832169) internal successors, (174), 144 states have internal predecessors, (174), 4 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) Second operand 217 states. [2022-04-15 06:28:08,229 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:28:08,229 INFO L93 Difference]: Finished difference Result 217 states and 258 transitions. [2022-04-15 06:28:08,229 INFO L276 IsEmpty]: Start isEmpty. Operand 217 states and 258 transitions. [2022-04-15 06:28:08,230 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 06:28:08,230 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 06:28:08,230 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 06:28:08,230 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 06:28:08,230 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 151 states, 143 states have (on average 1.2167832167832169) internal successors, (174), 144 states have internal predecessors, (174), 4 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-15 06:28:08,231 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 151 states to 151 states and 181 transitions. [2022-04-15 06:28:08,231 INFO L78 Accepts]: Start accepts. Automaton has 151 states and 181 transitions. Word has length 56 [2022-04-15 06:28:08,232 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 06:28:08,232 INFO L478 AbstractCegarLoop]: Abstraction has 151 states and 181 transitions. [2022-04-15 06:28:08,232 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 38 states, 38 states have (on average 1.368421052631579) internal successors, (52), 36 states have internal predecessors, (52), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:28:08,232 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 151 states and 181 transitions. [2022-04-15 06:28:08,557 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-15 06:28:08,558 INFO L276 IsEmpty]: Start isEmpty. Operand 151 states and 181 transitions. [2022-04-15 06:28:08,558 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2022-04-15 06:28:08,558 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 06:28:08,558 INFO L499 BasicCegarLoop]: trace histogram [12, 12, 10, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 06:28:08,585 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Forceful destruction successful, exit code 0 [2022-04-15 06:28:08,775 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22,19 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 06:28:08,776 INFO L403 AbstractCegarLoop]: === Iteration 24 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 06:28:08,776 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 06:28:08,776 INFO L85 PathProgramCache]: Analyzing trace with hash -34619070, now seen corresponding path program 5 times [2022-04-15 06:28:08,776 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 06:28:08,776 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [811801650] [2022-04-15 06:28:08,844 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 4 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {-1={1=1}, 0={1=2}, 1={2=1}}, 0 SequentialAcceleration, 1 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-15 06:28:08,845 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-15 06:28:08,845 INFO L85 PathProgramCache]: Analyzing trace with hash 1453501587, now seen corresponding path program 1 times [2022-04-15 06:28:08,845 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 06:28:08,845 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [268947776] [2022-04-15 06:28:08,845 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 06:28:08,845 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 06:28:08,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:28:08,910 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 06:28:08,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:28:08,914 INFO L290 TraceCheckUtils]: 0: Hoare triple {18457#(and (= ~last~0 |old(~last~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(11, 2);call #Ultimate.allocInit(12, 3);~last~0 := 0; {18445#true} is VALID [2022-04-15 06:28:08,914 INFO L290 TraceCheckUtils]: 1: Hoare triple {18445#true} assume true; {18445#true} is VALID [2022-04-15 06:28:08,914 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {18445#true} {18445#true} #66#return; {18445#true} is VALID [2022-04-15 06:28:08,914 INFO L272 TraceCheckUtils]: 0: Hoare triple {18445#true} call ULTIMATE.init(); {18457#(and (= ~last~0 |old(~last~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 06:28:08,914 INFO L290 TraceCheckUtils]: 1: Hoare triple {18457#(and (= ~last~0 |old(~last~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(11, 2);call #Ultimate.allocInit(12, 3);~last~0 := 0; {18445#true} is VALID [2022-04-15 06:28:08,914 INFO L290 TraceCheckUtils]: 2: Hoare triple {18445#true} assume true; {18445#true} is VALID [2022-04-15 06:28:08,915 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {18445#true} {18445#true} #66#return; {18445#true} is VALID [2022-04-15 06:28:08,915 INFO L272 TraceCheckUtils]: 4: Hoare triple {18445#true} call #t~ret6 := main(); {18445#true} is VALID [2022-04-15 06:28:08,915 INFO L290 TraceCheckUtils]: 5: Hoare triple {18445#true} assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~last~0 := #t~nondet4;havoc #t~nondet4;~a~0 := 0;~b~0 := 0;~c~0 := 0;~st~0 := 0; {18445#true} is VALID [2022-04-15 06:28:08,915 INFO L290 TraceCheckUtils]: 6: Hoare triple {18445#true} [142] L30-->L23-3_primed: Formula: (and (= |v_main_#t~post5_252| |v_main_#t~post5_246|) (= v_main_~c~0_481 v_main_~c~0_474) (= v_main_~a~0_104 v_main_~a~0_103) (= v_main_~st~0_194 v_main_~st~0_192) (= v_main_~b~0_101 v_main_~b~0_100)) InVars {main_~c~0=v_main_~c~0_481, main_#t~post5=|v_main_#t~post5_252|, main_~st~0=v_main_~st~0_194, main_~b~0=v_main_~b~0_101, main_~a~0=v_main_~a~0_104} OutVars{main_~c~0=v_main_~c~0_474, main_#t~post5=|v_main_#t~post5_246|, main_~st~0=v_main_~st~0_192, main_~b~0=v_main_~b~0_100, main_~a~0=v_main_~a~0_103} AuxVars[] AssignedVars[main_~c~0, main_#t~post5, main_~st~0, main_~b~0, main_~a~0] {18445#true} is VALID [2022-04-15 06:28:08,915 INFO L290 TraceCheckUtils]: 7: Hoare triple {18445#true} [141] L23-3_primed-->L23-3: Formula: (and (= v_main_~c~0_7 0) (= v_main_~st~0_6 1)) InVars {} OutVars{main_~c~0=v_main_~c~0_7, main_~st~0=v_main_~st~0_6} AuxVars[] AssignedVars[main_~c~0, main_~st~0] {18450#(= main_~c~0 0)} is VALID [2022-04-15 06:28:08,915 INFO L290 TraceCheckUtils]: 8: Hoare triple {18450#(= main_~c~0 0)} assume !!(~c~0 < 200000); {18450#(= main_~c~0 0)} is VALID [2022-04-15 06:28:08,916 INFO L290 TraceCheckUtils]: 9: Hoare triple {18450#(= main_~c~0 0)} assume ~c~0 == ~last~0;~st~0 := 0; {18450#(= main_~c~0 0)} is VALID [2022-04-15 06:28:08,916 INFO L290 TraceCheckUtils]: 10: Hoare triple {18450#(= main_~c~0 0)} #t~post5 := ~c~0;~c~0 := 1 + #t~post5;havoc #t~post5; {18451#(<= main_~c~0 1)} is VALID [2022-04-15 06:28:08,916 INFO L290 TraceCheckUtils]: 11: Hoare triple {18451#(<= main_~c~0 1)} assume !!(~c~0 < 200000); {18451#(<= main_~c~0 1)} is VALID [2022-04-15 06:28:08,916 INFO L290 TraceCheckUtils]: 12: Hoare triple {18451#(<= main_~c~0 1)} assume !(~c~0 == ~last~0); {18451#(<= main_~c~0 1)} is VALID [2022-04-15 06:28:08,917 INFO L290 TraceCheckUtils]: 13: Hoare triple {18451#(<= main_~c~0 1)} #t~post5 := ~c~0;~c~0 := 1 + #t~post5;havoc #t~post5; {18452#(<= main_~c~0 2)} is VALID [2022-04-15 06:28:08,917 INFO L290 TraceCheckUtils]: 14: Hoare triple {18452#(<= main_~c~0 2)} assume !!(~c~0 < 200000); {18452#(<= main_~c~0 2)} is VALID [2022-04-15 06:28:08,917 INFO L290 TraceCheckUtils]: 15: Hoare triple {18452#(<= main_~c~0 2)} assume !(~c~0 == ~last~0); {18452#(<= main_~c~0 2)} is VALID [2022-04-15 06:28:08,918 INFO L290 TraceCheckUtils]: 16: Hoare triple {18452#(<= main_~c~0 2)} #t~post5 := ~c~0;~c~0 := 1 + #t~post5;havoc #t~post5; {18453#(<= main_~c~0 3)} is VALID [2022-04-15 06:28:08,918 INFO L290 TraceCheckUtils]: 17: Hoare triple {18453#(<= main_~c~0 3)} assume !!(~c~0 < 200000); {18453#(<= main_~c~0 3)} is VALID [2022-04-15 06:28:08,918 INFO L290 TraceCheckUtils]: 18: Hoare triple {18453#(<= main_~c~0 3)} assume !(~c~0 == ~last~0); {18453#(<= main_~c~0 3)} is VALID [2022-04-15 06:28:08,918 INFO L290 TraceCheckUtils]: 19: Hoare triple {18453#(<= main_~c~0 3)} #t~post5 := ~c~0;~c~0 := 1 + #t~post5;havoc #t~post5; {18454#(<= main_~c~0 4)} is VALID [2022-04-15 06:28:08,919 INFO L290 TraceCheckUtils]: 20: Hoare triple {18454#(<= main_~c~0 4)} assume !!(~c~0 < 200000); {18454#(<= main_~c~0 4)} is VALID [2022-04-15 06:28:08,919 INFO L290 TraceCheckUtils]: 21: Hoare triple {18454#(<= main_~c~0 4)} assume !(~c~0 == ~last~0); {18454#(<= main_~c~0 4)} is VALID [2022-04-15 06:28:08,919 INFO L290 TraceCheckUtils]: 22: Hoare triple {18454#(<= main_~c~0 4)} #t~post5 := ~c~0;~c~0 := 1 + #t~post5;havoc #t~post5; {18455#(<= main_~c~0 5)} is VALID [2022-04-15 06:28:08,920 INFO L290 TraceCheckUtils]: 23: Hoare triple {18455#(<= main_~c~0 5)} assume !!(~c~0 < 200000); {18455#(<= main_~c~0 5)} is VALID [2022-04-15 06:28:08,920 INFO L290 TraceCheckUtils]: 24: Hoare triple {18455#(<= main_~c~0 5)} assume !(~c~0 == ~last~0); {18455#(<= main_~c~0 5)} is VALID [2022-04-15 06:28:08,920 INFO L290 TraceCheckUtils]: 25: Hoare triple {18455#(<= main_~c~0 5)} #t~post5 := ~c~0;~c~0 := 1 + #t~post5;havoc #t~post5; {18456#(<= main_~c~0 6)} is VALID [2022-04-15 06:28:08,920 INFO L290 TraceCheckUtils]: 26: Hoare triple {18456#(<= main_~c~0 6)} assume !(~c~0 < 200000); {18446#false} is VALID [2022-04-15 06:28:08,920 INFO L290 TraceCheckUtils]: 27: Hoare triple {18446#false} assume 0 == ~st~0 && ~c~0 == 1 + ~last~0;~a~0 := 3 + ~a~0;~b~0 := 3 + ~b~0; {18446#false} is VALID [2022-04-15 06:28:08,921 INFO L290 TraceCheckUtils]: 28: Hoare triple {18446#false} assume !(~c~0 == ~last~0 && 0 == ~st~0); {18446#false} is VALID [2022-04-15 06:28:08,921 INFO L272 TraceCheckUtils]: 29: Hoare triple {18446#false} call __VERIFIER_assert((if ~a~0 == ~b~0 && 200000 == ~c~0 then 1 else 0)); {18446#false} is VALID [2022-04-15 06:28:08,921 INFO L290 TraceCheckUtils]: 30: Hoare triple {18446#false} ~cond := #in~cond; {18446#false} is VALID [2022-04-15 06:28:08,921 INFO L290 TraceCheckUtils]: 31: Hoare triple {18446#false} assume 0 == ~cond; {18446#false} is VALID [2022-04-15 06:28:08,921 INFO L290 TraceCheckUtils]: 32: Hoare triple {18446#false} assume !false; {18446#false} is VALID [2022-04-15 06:28:08,921 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 0 proven. 51 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 06:28:08,921 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 06:28:08,921 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [268947776] [2022-04-15 06:28:08,921 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [268947776] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 06:28:08,921 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1011439302] [2022-04-15 06:28:08,922 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 06:28:08,922 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 06:28:08,922 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 06:28:08,928 INFO L229 MonitoredProcess]: Starting monitored process 20 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-15 06:28:08,930 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Waiting until timeout for monitored process [2022-04-15 06:28:08,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:28:08,958 INFO L263 TraceCheckSpWp]: Trace formula consists of 119 conjuncts, 8 conjunts are in the unsatisfiable core [2022-04-15 06:28:08,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:28:08,972 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 06:28:09,078 INFO L272 TraceCheckUtils]: 0: Hoare triple {18445#true} call ULTIMATE.init(); {18445#true} is VALID [2022-04-15 06:28:09,078 INFO L290 TraceCheckUtils]: 1: Hoare triple {18445#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(11, 2);call #Ultimate.allocInit(12, 3);~last~0 := 0; {18445#true} is VALID [2022-04-15 06:28:09,078 INFO L290 TraceCheckUtils]: 2: Hoare triple {18445#true} assume true; {18445#true} is VALID [2022-04-15 06:28:09,078 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {18445#true} {18445#true} #66#return; {18445#true} is VALID [2022-04-15 06:28:09,078 INFO L272 TraceCheckUtils]: 4: Hoare triple {18445#true} call #t~ret6 := main(); {18445#true} is VALID [2022-04-15 06:28:09,078 INFO L290 TraceCheckUtils]: 5: Hoare triple {18445#true} assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~last~0 := #t~nondet4;havoc #t~nondet4;~a~0 := 0;~b~0 := 0;~c~0 := 0;~st~0 := 0; {18445#true} is VALID [2022-04-15 06:28:09,078 INFO L290 TraceCheckUtils]: 6: Hoare triple {18445#true} [142] L30-->L23-3_primed: Formula: (and (= |v_main_#t~post5_252| |v_main_#t~post5_246|) (= v_main_~c~0_481 v_main_~c~0_474) (= v_main_~a~0_104 v_main_~a~0_103) (= v_main_~st~0_194 v_main_~st~0_192) (= v_main_~b~0_101 v_main_~b~0_100)) InVars {main_~c~0=v_main_~c~0_481, main_#t~post5=|v_main_#t~post5_252|, main_~st~0=v_main_~st~0_194, main_~b~0=v_main_~b~0_101, main_~a~0=v_main_~a~0_104} OutVars{main_~c~0=v_main_~c~0_474, main_#t~post5=|v_main_#t~post5_246|, main_~st~0=v_main_~st~0_192, main_~b~0=v_main_~b~0_100, main_~a~0=v_main_~a~0_103} AuxVars[] AssignedVars[main_~c~0, main_#t~post5, main_~st~0, main_~b~0, main_~a~0] {18445#true} is VALID [2022-04-15 06:28:09,078 INFO L290 TraceCheckUtils]: 7: Hoare triple {18445#true} [141] L23-3_primed-->L23-3: Formula: (and (= v_main_~c~0_7 0) (= v_main_~st~0_6 1)) InVars {} OutVars{main_~c~0=v_main_~c~0_7, main_~st~0=v_main_~st~0_6} AuxVars[] AssignedVars[main_~c~0, main_~st~0] {18482#(<= main_~c~0 0)} is VALID [2022-04-15 06:28:09,079 INFO L290 TraceCheckUtils]: 8: Hoare triple {18482#(<= main_~c~0 0)} assume !!(~c~0 < 200000); {18482#(<= main_~c~0 0)} is VALID [2022-04-15 06:28:09,079 INFO L290 TraceCheckUtils]: 9: Hoare triple {18482#(<= main_~c~0 0)} assume ~c~0 == ~last~0;~st~0 := 0; {18482#(<= main_~c~0 0)} is VALID [2022-04-15 06:28:09,079 INFO L290 TraceCheckUtils]: 10: Hoare triple {18482#(<= main_~c~0 0)} #t~post5 := ~c~0;~c~0 := 1 + #t~post5;havoc #t~post5; {18451#(<= main_~c~0 1)} is VALID [2022-04-15 06:28:09,080 INFO L290 TraceCheckUtils]: 11: Hoare triple {18451#(<= main_~c~0 1)} assume !!(~c~0 < 200000); {18451#(<= main_~c~0 1)} is VALID [2022-04-15 06:28:09,080 INFO L290 TraceCheckUtils]: 12: Hoare triple {18451#(<= main_~c~0 1)} assume !(~c~0 == ~last~0); {18451#(<= main_~c~0 1)} is VALID [2022-04-15 06:28:09,080 INFO L290 TraceCheckUtils]: 13: Hoare triple {18451#(<= main_~c~0 1)} #t~post5 := ~c~0;~c~0 := 1 + #t~post5;havoc #t~post5; {18452#(<= main_~c~0 2)} is VALID [2022-04-15 06:28:09,081 INFO L290 TraceCheckUtils]: 14: Hoare triple {18452#(<= main_~c~0 2)} assume !!(~c~0 < 200000); {18452#(<= main_~c~0 2)} is VALID [2022-04-15 06:28:09,081 INFO L290 TraceCheckUtils]: 15: Hoare triple {18452#(<= main_~c~0 2)} assume !(~c~0 == ~last~0); {18452#(<= main_~c~0 2)} is VALID [2022-04-15 06:28:09,081 INFO L290 TraceCheckUtils]: 16: Hoare triple {18452#(<= main_~c~0 2)} #t~post5 := ~c~0;~c~0 := 1 + #t~post5;havoc #t~post5; {18453#(<= main_~c~0 3)} is VALID [2022-04-15 06:28:09,081 INFO L290 TraceCheckUtils]: 17: Hoare triple {18453#(<= main_~c~0 3)} assume !!(~c~0 < 200000); {18453#(<= main_~c~0 3)} is VALID [2022-04-15 06:28:09,082 INFO L290 TraceCheckUtils]: 18: Hoare triple {18453#(<= main_~c~0 3)} assume !(~c~0 == ~last~0); {18453#(<= main_~c~0 3)} is VALID [2022-04-15 06:28:09,082 INFO L290 TraceCheckUtils]: 19: Hoare triple {18453#(<= main_~c~0 3)} #t~post5 := ~c~0;~c~0 := 1 + #t~post5;havoc #t~post5; {18454#(<= main_~c~0 4)} is VALID [2022-04-15 06:28:09,082 INFO L290 TraceCheckUtils]: 20: Hoare triple {18454#(<= main_~c~0 4)} assume !!(~c~0 < 200000); {18454#(<= main_~c~0 4)} is VALID [2022-04-15 06:28:09,083 INFO L290 TraceCheckUtils]: 21: Hoare triple {18454#(<= main_~c~0 4)} assume !(~c~0 == ~last~0); {18454#(<= main_~c~0 4)} is VALID [2022-04-15 06:28:09,083 INFO L290 TraceCheckUtils]: 22: Hoare triple {18454#(<= main_~c~0 4)} #t~post5 := ~c~0;~c~0 := 1 + #t~post5;havoc #t~post5; {18455#(<= main_~c~0 5)} is VALID [2022-04-15 06:28:09,083 INFO L290 TraceCheckUtils]: 23: Hoare triple {18455#(<= main_~c~0 5)} assume !!(~c~0 < 200000); {18455#(<= main_~c~0 5)} is VALID [2022-04-15 06:28:09,084 INFO L290 TraceCheckUtils]: 24: Hoare triple {18455#(<= main_~c~0 5)} assume !(~c~0 == ~last~0); {18455#(<= main_~c~0 5)} is VALID [2022-04-15 06:28:09,084 INFO L290 TraceCheckUtils]: 25: Hoare triple {18455#(<= main_~c~0 5)} #t~post5 := ~c~0;~c~0 := 1 + #t~post5;havoc #t~post5; {18456#(<= main_~c~0 6)} is VALID [2022-04-15 06:28:09,084 INFO L290 TraceCheckUtils]: 26: Hoare triple {18456#(<= main_~c~0 6)} assume !(~c~0 < 200000); {18446#false} is VALID [2022-04-15 06:28:09,084 INFO L290 TraceCheckUtils]: 27: Hoare triple {18446#false} assume 0 == ~st~0 && ~c~0 == 1 + ~last~0;~a~0 := 3 + ~a~0;~b~0 := 3 + ~b~0; {18446#false} is VALID [2022-04-15 06:28:09,084 INFO L290 TraceCheckUtils]: 28: Hoare triple {18446#false} assume !(~c~0 == ~last~0 && 0 == ~st~0); {18446#false} is VALID [2022-04-15 06:28:09,084 INFO L272 TraceCheckUtils]: 29: Hoare triple {18446#false} call __VERIFIER_assert((if ~a~0 == ~b~0 && 200000 == ~c~0 then 1 else 0)); {18446#false} is VALID [2022-04-15 06:28:09,085 INFO L290 TraceCheckUtils]: 30: Hoare triple {18446#false} ~cond := #in~cond; {18446#false} is VALID [2022-04-15 06:28:09,085 INFO L290 TraceCheckUtils]: 31: Hoare triple {18446#false} assume 0 == ~cond; {18446#false} is VALID [2022-04-15 06:28:09,085 INFO L290 TraceCheckUtils]: 32: Hoare triple {18446#false} assume !false; {18446#false} is VALID [2022-04-15 06:28:09,085 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 0 proven. 51 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 06:28:09,085 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 06:28:09,271 INFO L290 TraceCheckUtils]: 32: Hoare triple {18446#false} assume !false; {18446#false} is VALID [2022-04-15 06:28:09,271 INFO L290 TraceCheckUtils]: 31: Hoare triple {18446#false} assume 0 == ~cond; {18446#false} is VALID [2022-04-15 06:28:09,271 INFO L290 TraceCheckUtils]: 30: Hoare triple {18446#false} ~cond := #in~cond; {18446#false} is VALID [2022-04-15 06:28:09,271 INFO L272 TraceCheckUtils]: 29: Hoare triple {18446#false} call __VERIFIER_assert((if ~a~0 == ~b~0 && 200000 == ~c~0 then 1 else 0)); {18446#false} is VALID [2022-04-15 06:28:09,271 INFO L290 TraceCheckUtils]: 28: Hoare triple {18446#false} assume !(~c~0 == ~last~0 && 0 == ~st~0); {18446#false} is VALID [2022-04-15 06:28:09,271 INFO L290 TraceCheckUtils]: 27: Hoare triple {18446#false} assume 0 == ~st~0 && ~c~0 == 1 + ~last~0;~a~0 := 3 + ~a~0;~b~0 := 3 + ~b~0; {18446#false} is VALID [2022-04-15 06:28:09,272 INFO L290 TraceCheckUtils]: 26: Hoare triple {18576#(< main_~c~0 200000)} assume !(~c~0 < 200000); {18446#false} is VALID [2022-04-15 06:28:09,272 INFO L290 TraceCheckUtils]: 25: Hoare triple {18580#(< main_~c~0 199999)} #t~post5 := ~c~0;~c~0 := 1 + #t~post5;havoc #t~post5; {18576#(< main_~c~0 200000)} is VALID [2022-04-15 06:28:09,272 INFO L290 TraceCheckUtils]: 24: Hoare triple {18580#(< main_~c~0 199999)} assume !(~c~0 == ~last~0); {18580#(< main_~c~0 199999)} is VALID [2022-04-15 06:28:09,273 INFO L290 TraceCheckUtils]: 23: Hoare triple {18580#(< main_~c~0 199999)} assume !!(~c~0 < 200000); {18580#(< main_~c~0 199999)} is VALID [2022-04-15 06:28:09,273 INFO L290 TraceCheckUtils]: 22: Hoare triple {18590#(< main_~c~0 199998)} #t~post5 := ~c~0;~c~0 := 1 + #t~post5;havoc #t~post5; {18580#(< main_~c~0 199999)} is VALID [2022-04-15 06:28:09,273 INFO L290 TraceCheckUtils]: 21: Hoare triple {18590#(< main_~c~0 199998)} assume !(~c~0 == ~last~0); {18590#(< main_~c~0 199998)} is VALID [2022-04-15 06:28:09,274 INFO L290 TraceCheckUtils]: 20: Hoare triple {18590#(< main_~c~0 199998)} assume !!(~c~0 < 200000); {18590#(< main_~c~0 199998)} is VALID [2022-04-15 06:28:09,274 INFO L290 TraceCheckUtils]: 19: Hoare triple {18600#(< main_~c~0 199997)} #t~post5 := ~c~0;~c~0 := 1 + #t~post5;havoc #t~post5; {18590#(< main_~c~0 199998)} is VALID [2022-04-15 06:28:09,274 INFO L290 TraceCheckUtils]: 18: Hoare triple {18600#(< main_~c~0 199997)} assume !(~c~0 == ~last~0); {18600#(< main_~c~0 199997)} is VALID [2022-04-15 06:28:09,275 INFO L290 TraceCheckUtils]: 17: Hoare triple {18600#(< main_~c~0 199997)} assume !!(~c~0 < 200000); {18600#(< main_~c~0 199997)} is VALID [2022-04-15 06:28:09,275 INFO L290 TraceCheckUtils]: 16: Hoare triple {18610#(< main_~c~0 199996)} #t~post5 := ~c~0;~c~0 := 1 + #t~post5;havoc #t~post5; {18600#(< main_~c~0 199997)} is VALID [2022-04-15 06:28:09,275 INFO L290 TraceCheckUtils]: 15: Hoare triple {18610#(< main_~c~0 199996)} assume !(~c~0 == ~last~0); {18610#(< main_~c~0 199996)} is VALID [2022-04-15 06:28:09,276 INFO L290 TraceCheckUtils]: 14: Hoare triple {18610#(< main_~c~0 199996)} assume !!(~c~0 < 200000); {18610#(< main_~c~0 199996)} is VALID [2022-04-15 06:28:09,276 INFO L290 TraceCheckUtils]: 13: Hoare triple {18620#(< main_~c~0 199995)} #t~post5 := ~c~0;~c~0 := 1 + #t~post5;havoc #t~post5; {18610#(< main_~c~0 199996)} is VALID [2022-04-15 06:28:09,276 INFO L290 TraceCheckUtils]: 12: Hoare triple {18620#(< main_~c~0 199995)} assume !(~c~0 == ~last~0); {18620#(< main_~c~0 199995)} is VALID [2022-04-15 06:28:09,277 INFO L290 TraceCheckUtils]: 11: Hoare triple {18620#(< main_~c~0 199995)} assume !!(~c~0 < 200000); {18620#(< main_~c~0 199995)} is VALID [2022-04-15 06:28:09,277 INFO L290 TraceCheckUtils]: 10: Hoare triple {18630#(< main_~c~0 199994)} #t~post5 := ~c~0;~c~0 := 1 + #t~post5;havoc #t~post5; {18620#(< main_~c~0 199995)} is VALID [2022-04-15 06:28:09,277 INFO L290 TraceCheckUtils]: 9: Hoare triple {18630#(< main_~c~0 199994)} assume ~c~0 == ~last~0;~st~0 := 0; {18630#(< main_~c~0 199994)} is VALID [2022-04-15 06:28:09,277 INFO L290 TraceCheckUtils]: 8: Hoare triple {18630#(< main_~c~0 199994)} assume !!(~c~0 < 200000); {18630#(< main_~c~0 199994)} is VALID [2022-04-15 06:28:09,278 INFO L290 TraceCheckUtils]: 7: Hoare triple {18445#true} [141] L23-3_primed-->L23-3: Formula: (and (= v_main_~c~0_7 0) (= v_main_~st~0_6 1)) InVars {} OutVars{main_~c~0=v_main_~c~0_7, main_~st~0=v_main_~st~0_6} AuxVars[] AssignedVars[main_~c~0, main_~st~0] {18630#(< main_~c~0 199994)} is VALID [2022-04-15 06:28:09,278 INFO L290 TraceCheckUtils]: 6: Hoare triple {18445#true} [142] L30-->L23-3_primed: Formula: (and (= |v_main_#t~post5_252| |v_main_#t~post5_246|) (= v_main_~c~0_481 v_main_~c~0_474) (= v_main_~a~0_104 v_main_~a~0_103) (= v_main_~st~0_194 v_main_~st~0_192) (= v_main_~b~0_101 v_main_~b~0_100)) InVars {main_~c~0=v_main_~c~0_481, main_#t~post5=|v_main_#t~post5_252|, main_~st~0=v_main_~st~0_194, main_~b~0=v_main_~b~0_101, main_~a~0=v_main_~a~0_104} OutVars{main_~c~0=v_main_~c~0_474, main_#t~post5=|v_main_#t~post5_246|, main_~st~0=v_main_~st~0_192, main_~b~0=v_main_~b~0_100, main_~a~0=v_main_~a~0_103} AuxVars[] AssignedVars[main_~c~0, main_#t~post5, main_~st~0, main_~b~0, main_~a~0] {18445#true} is VALID [2022-04-15 06:28:09,278 INFO L290 TraceCheckUtils]: 5: Hoare triple {18445#true} assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~last~0 := #t~nondet4;havoc #t~nondet4;~a~0 := 0;~b~0 := 0;~c~0 := 0;~st~0 := 0; {18445#true} is VALID [2022-04-15 06:28:09,278 INFO L272 TraceCheckUtils]: 4: Hoare triple {18445#true} call #t~ret6 := main(); {18445#true} is VALID [2022-04-15 06:28:09,278 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {18445#true} {18445#true} #66#return; {18445#true} is VALID [2022-04-15 06:28:09,278 INFO L290 TraceCheckUtils]: 2: Hoare triple {18445#true} assume true; {18445#true} is VALID [2022-04-15 06:28:09,278 INFO L290 TraceCheckUtils]: 1: Hoare triple {18445#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(11, 2);call #Ultimate.allocInit(12, 3);~last~0 := 0; {18445#true} is VALID [2022-04-15 06:28:09,278 INFO L272 TraceCheckUtils]: 0: Hoare triple {18445#true} call ULTIMATE.init(); {18445#true} is VALID [2022-04-15 06:28:09,278 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 0 proven. 51 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 06:28:09,279 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1011439302] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 06:28:09,279 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 06:28:09,279 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9, 9] total 18 [2022-04-15 06:28:09,425 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 06:28:09,426 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [811801650] [2022-04-15 06:28:09,426 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [811801650] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 06:28:09,426 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 06:28:09,426 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2022-04-15 06:28:09,426 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [642204585] [2022-04-15 06:28:09,426 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 06:28:09,427 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 2.8333333333333335) internal successors, (51), 17 states have internal predecessors, (51), 2 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 59 [2022-04-15 06:28:09,427 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 06:28:09,427 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 18 states, 18 states have (on average 2.8333333333333335) internal successors, (51), 17 states have internal predecessors, (51), 2 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-15 06:28:09,448 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 56 edges. 56 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 06:28:09,448 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2022-04-15 06:28:09,449 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 06:28:09,449 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2022-04-15 06:28:09,449 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=247, Invalid=403, Unknown=0, NotChecked=0, Total=650 [2022-04-15 06:28:09,449 INFO L87 Difference]: Start difference. First operand 151 states and 181 transitions. Second operand has 18 states, 18 states have (on average 2.8333333333333335) internal successors, (51), 17 states have internal predecessors, (51), 2 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-15 06:28:10,329 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:28:10,329 INFO L93 Difference]: Finished difference Result 284 states and 339 transitions. [2022-04-15 06:28:10,329 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2022-04-15 06:28:10,329 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 2.8333333333333335) internal successors, (51), 17 states have internal predecessors, (51), 2 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 59 [2022-04-15 06:28:10,329 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 06:28:10,329 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18 states, 18 states have (on average 2.8333333333333335) internal successors, (51), 17 states have internal predecessors, (51), 2 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-15 06:28:10,330 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 88 transitions. [2022-04-15 06:28:10,330 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18 states, 18 states have (on average 2.8333333333333335) internal successors, (51), 17 states have internal predecessors, (51), 2 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-15 06:28:10,331 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 88 transitions. [2022-04-15 06:28:10,331 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 18 states and 88 transitions. [2022-04-15 06:28:10,390 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 88 edges. 88 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 06:28:10,397 INFO L225 Difference]: With dead ends: 284 [2022-04-15 06:28:10,397 INFO L226 Difference]: Without dead ends: 226 [2022-04-15 06:28:10,398 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 111 GetRequests, 82 SyntacticMatches, 5 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 403 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=247, Invalid=403, Unknown=0, NotChecked=0, Total=650 [2022-04-15 06:28:10,402 INFO L913 BasicCegarLoop]: 18 mSDtfsCounter, 45 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 247 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 45 SdHoareTripleChecker+Valid, 35 SdHoareTripleChecker+Invalid, 254 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 247 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-15 06:28:10,403 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [45 Valid, 35 Invalid, 254 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 247 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-15 06:28:10,404 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 226 states. [2022-04-15 06:28:11,062 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 226 to 174. [2022-04-15 06:28:11,062 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 06:28:11,062 INFO L82 GeneralOperation]: Start isEquivalent. First operand 226 states. Second operand has 174 states, 166 states have (on average 1.1987951807228916) internal successors, (199), 167 states have internal predecessors, (199), 4 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-15 06:28:11,062 INFO L74 IsIncluded]: Start isIncluded. First operand 226 states. Second operand has 174 states, 166 states have (on average 1.1987951807228916) internal successors, (199), 167 states have internal predecessors, (199), 4 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-15 06:28:11,064 INFO L87 Difference]: Start difference. First operand 226 states. Second operand has 174 states, 166 states have (on average 1.1987951807228916) internal successors, (199), 167 states have internal predecessors, (199), 4 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-15 06:28:11,067 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:28:11,067 INFO L93 Difference]: Finished difference Result 226 states and 260 transitions. [2022-04-15 06:28:11,067 INFO L276 IsEmpty]: Start isEmpty. Operand 226 states and 260 transitions. [2022-04-15 06:28:11,067 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 06:28:11,067 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 06:28:11,083 INFO L74 IsIncluded]: Start isIncluded. First operand has 174 states, 166 states have (on average 1.1987951807228916) internal successors, (199), 167 states have internal predecessors, (199), 4 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) Second operand 226 states. [2022-04-15 06:28:11,084 INFO L87 Difference]: Start difference. First operand has 174 states, 166 states have (on average 1.1987951807228916) internal successors, (199), 167 states have internal predecessors, (199), 4 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) Second operand 226 states. [2022-04-15 06:28:11,086 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:28:11,086 INFO L93 Difference]: Finished difference Result 226 states and 260 transitions. [2022-04-15 06:28:11,086 INFO L276 IsEmpty]: Start isEmpty. Operand 226 states and 260 transitions. [2022-04-15 06:28:11,086 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 06:28:11,086 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 06:28:11,086 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 06:28:11,086 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 06:28:11,087 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 174 states, 166 states have (on average 1.1987951807228916) internal successors, (199), 167 states have internal predecessors, (199), 4 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-15 06:28:11,088 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 174 states to 174 states and 206 transitions. [2022-04-15 06:28:11,089 INFO L78 Accepts]: Start accepts. Automaton has 174 states and 206 transitions. Word has length 59 [2022-04-15 06:28:11,089 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 06:28:11,089 INFO L478 AbstractCegarLoop]: Abstraction has 174 states and 206 transitions. [2022-04-15 06:28:11,089 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 2.8333333333333335) internal successors, (51), 17 states have internal predecessors, (51), 2 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-15 06:28:11,089 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 174 states and 206 transitions. [2022-04-15 06:28:11,497 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-15 06:28:11,498 INFO L276 IsEmpty]: Start isEmpty. Operand 174 states and 206 transitions. [2022-04-15 06:28:11,498 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2022-04-15 06:28:11,498 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 06:28:11,498 INFO L499 BasicCegarLoop]: trace histogram [15, 15, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 06:28:11,516 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Forceful destruction successful, exit code 0 [2022-04-15 06:28:11,713 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23,20 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 06:28:11,714 INFO L403 AbstractCegarLoop]: === Iteration 25 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 06:28:11,714 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 06:28:11,714 INFO L85 PathProgramCache]: Analyzing trace with hash -1617622268, now seen corresponding path program 14 times [2022-04-15 06:28:11,714 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 06:28:11,714 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1493860369] [2022-04-15 06:28:14,213 WARN L970 rdanLoopAcceleration]: Unable to prove correctness of quantifier elimination. [2022-04-15 06:28:14,295 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 1 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-15 06:28:14,458 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {0={1=1}, 1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-15 06:28:14,459 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-15 06:28:14,461 INFO L85 PathProgramCache]: Analyzing trace with hash 122941256, now seen corresponding path program 1 times [2022-04-15 06:28:14,461 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 06:28:14,461 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [914862218] [2022-04-15 06:28:14,461 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 06:28:14,461 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 06:28:14,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:28:14,613 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 06:28:14,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:28:14,616 INFO L290 TraceCheckUtils]: 0: Hoare triple {20051#(and (= ~last~0 |old(~last~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(11, 2);call #Ultimate.allocInit(12, 3);~last~0 := 0; {20039#true} is VALID [2022-04-15 06:28:14,616 INFO L290 TraceCheckUtils]: 1: Hoare triple {20039#true} assume true; {20039#true} is VALID [2022-04-15 06:28:14,616 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {20039#true} {20039#true} #66#return; {20039#true} is VALID [2022-04-15 06:28:14,619 INFO L272 TraceCheckUtils]: 0: Hoare triple {20039#true} call ULTIMATE.init(); {20051#(and (= ~last~0 |old(~last~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 06:28:14,619 INFO L290 TraceCheckUtils]: 1: Hoare triple {20051#(and (= ~last~0 |old(~last~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(11, 2);call #Ultimate.allocInit(12, 3);~last~0 := 0; {20039#true} is VALID [2022-04-15 06:28:14,619 INFO L290 TraceCheckUtils]: 2: Hoare triple {20039#true} assume true; {20039#true} is VALID [2022-04-15 06:28:14,619 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {20039#true} {20039#true} #66#return; {20039#true} is VALID [2022-04-15 06:28:14,619 INFO L272 TraceCheckUtils]: 4: Hoare triple {20039#true} call #t~ret6 := main(); {20039#true} is VALID [2022-04-15 06:28:14,620 INFO L290 TraceCheckUtils]: 5: Hoare triple {20039#true} assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~last~0 := #t~nondet4;havoc #t~nondet4;~a~0 := 0;~b~0 := 0;~c~0 := 0;~st~0 := 0; {20044#(and (= main_~a~0 0) (= main_~b~0 0))} is VALID [2022-04-15 06:28:14,620 INFO L290 TraceCheckUtils]: 6: Hoare triple {20044#(and (= main_~a~0 0) (= main_~b~0 0))} assume !false;~st~0 := 1;~c~0 := 0; {20045#(and (= main_~a~0 0) (= main_~st~0 1) (= main_~b~0 0))} is VALID [2022-04-15 06:28:14,620 INFO L290 TraceCheckUtils]: 7: Hoare triple {20045#(and (= main_~a~0 0) (= main_~st~0 1) (= main_~b~0 0))} [144] L23-3-->L23-4_primed: Formula: (let ((.cse0 (= v_main_~c~0_503 v_main_~c~0_502)) (.cse2 (= v_~last~0_155 v_main_~c~0_503)) (.cse1 (= |v_main_#t~post5_262| |v_main_#t~post5_260|))) (or (and .cse0 (= v_~last~0_155 v_~last~0_155) .cse1) (and (or (not (<= (+ v_~last~0_155 1) v_main_~c~0_502)) (not (<= (+ v_main_~c~0_503 1) v_~last~0_155))) (not .cse2) (< v_main_~c~0_502 200001) (< v_main_~c~0_503 v_main_~c~0_502)) (and .cse0 (or (not (< v_main_~c~0_503 200000)) .cse2) .cse1))) InVars {main_~c~0=v_main_~c~0_503, main_#t~post5=|v_main_#t~post5_262|, ~last~0=v_~last~0_155} OutVars{main_#t~post5=|v_main_#t~post5_260|, main_~c~0=v_main_~c~0_502, ~last~0=v_~last~0_155} AuxVars[] AssignedVars[main_#t~post5, main_~c~0] {20045#(and (= main_~a~0 0) (= main_~st~0 1) (= main_~b~0 0))} is VALID [2022-04-15 06:28:14,621 INFO L290 TraceCheckUtils]: 8: Hoare triple {20045#(and (= main_~a~0 0) (= main_~st~0 1) (= main_~b~0 0))} [145] L23-4_primed-->L23-3: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {20045#(and (= main_~a~0 0) (= main_~st~0 1) (= main_~b~0 0))} is VALID [2022-04-15 06:28:14,621 INFO L290 TraceCheckUtils]: 9: Hoare triple {20045#(and (= main_~a~0 0) (= main_~st~0 1) (= main_~b~0 0))} [146] L23-3-->L23-4_primed: Formula: (let ((.cse0 (= |v_main_#t~post5_265| |v_main_#t~post5_261|)) (.cse1 (= v_main_~st~0_200 v_main_~st~0_199)) (.cse2 (= v_main_~c~0_505 v_main_~c~0_504)) (.cse3 (< v_main_~c~0_505 200000)) (.cse4 (= v_~last~0_156 v_main_~c~0_505))) (or (and .cse0 .cse1 .cse2 (or (not .cse3) (not .cse4))) (and (= v_~last~0_156 v_~last~0_156) .cse0 .cse1 .cse2) (and .cse3 (= v_main_~st~0_199 0) .cse4 (< v_main_~c~0_505 v_main_~c~0_504) (<= v_main_~c~0_504 (+ v_~last~0_156 1))))) InVars {main_~c~0=v_main_~c~0_505, main_#t~post5=|v_main_#t~post5_265|, main_~st~0=v_main_~st~0_200, ~last~0=v_~last~0_156} OutVars{main_#t~post5=|v_main_#t~post5_261|, main_~c~0=v_main_~c~0_504, main_~st~0=v_main_~st~0_199, ~last~0=v_~last~0_156} AuxVars[] AssignedVars[main_#t~post5, main_~c~0, main_~st~0] {20046#(or (= main_~st~0 1) (and (= main_~a~0 0) (or (<= ~last~0 199999) (<= main_~c~0 200000)) (= main_~b~0 0)))} is VALID [2022-04-15 06:28:14,622 INFO L290 TraceCheckUtils]: 10: Hoare triple {20046#(or (= main_~st~0 1) (and (= main_~a~0 0) (or (<= ~last~0 199999) (<= main_~c~0 200000)) (= main_~b~0 0)))} [143] L23-4_primed-->L23-4: Formula: (not (< v_main_~c~0_8 200000)) InVars {main_~c~0=v_main_~c~0_8} OutVars{main_~c~0=v_main_~c~0_8} AuxVars[] AssignedVars[] {20047#(or (= main_~st~0 1) (and (= main_~a~0 0) (or (<= ~last~0 199999) (<= main_~c~0 200000)) (= main_~b~0 0) (< 199999 main_~c~0)))} is VALID [2022-04-15 06:28:14,622 INFO L290 TraceCheckUtils]: 11: Hoare triple {20047#(or (= main_~st~0 1) (and (= main_~a~0 0) (or (<= ~last~0 199999) (<= main_~c~0 200000)) (= main_~b~0 0) (< 199999 main_~c~0)))} assume 0 == ~st~0 && ~c~0 == 1 + ~last~0;~a~0 := 3 + ~a~0;~b~0 := 3 + ~b~0; {20048#(and (<= main_~b~0 main_~a~0) (< main_~a~0 (+ main_~b~0 1)) (< 199999 main_~c~0) (<= main_~c~0 200000))} is VALID [2022-04-15 06:28:14,623 INFO L290 TraceCheckUtils]: 12: Hoare triple {20048#(and (<= main_~b~0 main_~a~0) (< main_~a~0 (+ main_~b~0 1)) (< 199999 main_~c~0) (<= main_~c~0 200000))} assume !(~c~0 == ~last~0 && 0 == ~st~0); {20048#(and (<= main_~b~0 main_~a~0) (< main_~a~0 (+ main_~b~0 1)) (< 199999 main_~c~0) (<= main_~c~0 200000))} is VALID [2022-04-15 06:28:14,623 INFO L272 TraceCheckUtils]: 13: Hoare triple {20048#(and (<= main_~b~0 main_~a~0) (< main_~a~0 (+ main_~b~0 1)) (< 199999 main_~c~0) (<= main_~c~0 200000))} call __VERIFIER_assert((if ~a~0 == ~b~0 && 200000 == ~c~0 then 1 else 0)); {20049#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-15 06:28:14,624 INFO L290 TraceCheckUtils]: 14: Hoare triple {20049#(not (= |__VERIFIER_assert_#in~cond| 0))} ~cond := #in~cond; {20050#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-15 06:28:14,624 INFO L290 TraceCheckUtils]: 15: Hoare triple {20050#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {20040#false} is VALID [2022-04-15 06:28:14,624 INFO L290 TraceCheckUtils]: 16: Hoare triple {20040#false} assume !false; {20040#false} is VALID [2022-04-15 06:28:14,624 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-04-15 06:28:14,624 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 06:28:14,624 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [914862218] [2022-04-15 06:28:14,624 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [914862218] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 06:28:14,624 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1028348254] [2022-04-15 06:28:14,624 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 06:28:14,624 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 06:28:14,625 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 06:28:14,625 INFO L229 MonitoredProcess]: Starting monitored process 21 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-15 06:28:14,655 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Waiting until timeout for monitored process [2022-04-15 06:28:14,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:28:14,689 INFO L263 TraceCheckSpWp]: Trace formula consists of 85 conjuncts, 18 conjunts are in the unsatisfiable core [2022-04-15 06:28:14,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:28:14,695 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 06:28:14,911 INFO L272 TraceCheckUtils]: 0: Hoare triple {20039#true} call ULTIMATE.init(); {20039#true} is VALID [2022-04-15 06:28:14,911 INFO L290 TraceCheckUtils]: 1: Hoare triple {20039#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(11, 2);call #Ultimate.allocInit(12, 3);~last~0 := 0; {20039#true} is VALID [2022-04-15 06:28:14,912 INFO L290 TraceCheckUtils]: 2: Hoare triple {20039#true} assume true; {20039#true} is VALID [2022-04-15 06:28:14,912 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {20039#true} {20039#true} #66#return; {20039#true} is VALID [2022-04-15 06:28:14,912 INFO L272 TraceCheckUtils]: 4: Hoare triple {20039#true} call #t~ret6 := main(); {20039#true} is VALID [2022-04-15 06:28:14,916 INFO L290 TraceCheckUtils]: 5: Hoare triple {20039#true} assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~last~0 := #t~nondet4;havoc #t~nondet4;~a~0 := 0;~b~0 := 0;~c~0 := 0;~st~0 := 0; {20044#(and (= main_~a~0 0) (= main_~b~0 0))} is VALID [2022-04-15 06:28:14,917 INFO L290 TraceCheckUtils]: 6: Hoare triple {20044#(and (= main_~a~0 0) (= main_~b~0 0))} assume !false;~st~0 := 1;~c~0 := 0; {20045#(and (= main_~a~0 0) (= main_~st~0 1) (= main_~b~0 0))} is VALID [2022-04-15 06:28:14,917 INFO L290 TraceCheckUtils]: 7: Hoare triple {20045#(and (= main_~a~0 0) (= main_~st~0 1) (= main_~b~0 0))} [144] L23-3-->L23-4_primed: Formula: (let ((.cse0 (= v_main_~c~0_503 v_main_~c~0_502)) (.cse2 (= v_~last~0_155 v_main_~c~0_503)) (.cse1 (= |v_main_#t~post5_262| |v_main_#t~post5_260|))) (or (and .cse0 (= v_~last~0_155 v_~last~0_155) .cse1) (and (or (not (<= (+ v_~last~0_155 1) v_main_~c~0_502)) (not (<= (+ v_main_~c~0_503 1) v_~last~0_155))) (not .cse2) (< v_main_~c~0_502 200001) (< v_main_~c~0_503 v_main_~c~0_502)) (and .cse0 (or (not (< v_main_~c~0_503 200000)) .cse2) .cse1))) InVars {main_~c~0=v_main_~c~0_503, main_#t~post5=|v_main_#t~post5_262|, ~last~0=v_~last~0_155} OutVars{main_#t~post5=|v_main_#t~post5_260|, main_~c~0=v_main_~c~0_502, ~last~0=v_~last~0_155} AuxVars[] AssignedVars[main_#t~post5, main_~c~0] {20045#(and (= main_~a~0 0) (= main_~st~0 1) (= main_~b~0 0))} is VALID [2022-04-15 06:28:14,918 INFO L290 TraceCheckUtils]: 8: Hoare triple {20045#(and (= main_~a~0 0) (= main_~st~0 1) (= main_~b~0 0))} [145] L23-4_primed-->L23-3: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {20045#(and (= main_~a~0 0) (= main_~st~0 1) (= main_~b~0 0))} is VALID [2022-04-15 06:28:14,918 INFO L290 TraceCheckUtils]: 9: Hoare triple {20045#(and (= main_~a~0 0) (= main_~st~0 1) (= main_~b~0 0))} [146] L23-3-->L23-4_primed: Formula: (let ((.cse0 (= |v_main_#t~post5_265| |v_main_#t~post5_261|)) (.cse1 (= v_main_~st~0_200 v_main_~st~0_199)) (.cse2 (= v_main_~c~0_505 v_main_~c~0_504)) (.cse3 (< v_main_~c~0_505 200000)) (.cse4 (= v_~last~0_156 v_main_~c~0_505))) (or (and .cse0 .cse1 .cse2 (or (not .cse3) (not .cse4))) (and (= v_~last~0_156 v_~last~0_156) .cse0 .cse1 .cse2) (and .cse3 (= v_main_~st~0_199 0) .cse4 (< v_main_~c~0_505 v_main_~c~0_504) (<= v_main_~c~0_504 (+ v_~last~0_156 1))))) InVars {main_~c~0=v_main_~c~0_505, main_#t~post5=|v_main_#t~post5_265|, main_~st~0=v_main_~st~0_200, ~last~0=v_~last~0_156} OutVars{main_#t~post5=|v_main_#t~post5_261|, main_~c~0=v_main_~c~0_504, main_~st~0=v_main_~st~0_199, ~last~0=v_~last~0_156} AuxVars[] AssignedVars[main_#t~post5, main_~c~0, main_~st~0] {20082#(and (= main_~a~0 0) (= main_~b~0 0) (or (and (< ~last~0 200000) (< ~last~0 main_~c~0) (<= main_~c~0 (+ ~last~0 1)) (= main_~st~0 0)) (= main_~st~0 1)))} is VALID [2022-04-15 06:28:14,919 INFO L290 TraceCheckUtils]: 10: Hoare triple {20082#(and (= main_~a~0 0) (= main_~b~0 0) (or (and (< ~last~0 200000) (< ~last~0 main_~c~0) (<= main_~c~0 (+ ~last~0 1)) (= main_~st~0 0)) (= main_~st~0 1)))} [143] L23-4_primed-->L23-4: Formula: (not (< v_main_~c~0_8 200000)) InVars {main_~c~0=v_main_~c~0_8} OutVars{main_~c~0=v_main_~c~0_8} AuxVars[] AssignedVars[] {20086#(and (= main_~a~0 0) (or (= main_~st~0 1) (and (< ~last~0 200000) (<= main_~c~0 (+ ~last~0 1)) (= main_~st~0 0))) (= main_~b~0 0) (not (< main_~c~0 200000)))} is VALID [2022-04-15 06:28:14,919 INFO L290 TraceCheckUtils]: 11: Hoare triple {20086#(and (= main_~a~0 0) (or (= main_~st~0 1) (and (< ~last~0 200000) (<= main_~c~0 (+ ~last~0 1)) (= main_~st~0 0))) (= main_~b~0 0) (not (< main_~c~0 200000)))} assume 0 == ~st~0 && ~c~0 == 1 + ~last~0;~a~0 := 3 + ~a~0;~b~0 := 3 + ~b~0; {20090#(and (= main_~b~0 3) (<= 200000 main_~c~0) (< main_~c~0 200001) (= main_~a~0 3))} is VALID [2022-04-15 06:28:14,920 INFO L290 TraceCheckUtils]: 12: Hoare triple {20090#(and (= main_~b~0 3) (<= 200000 main_~c~0) (< main_~c~0 200001) (= main_~a~0 3))} assume !(~c~0 == ~last~0 && 0 == ~st~0); {20090#(and (= main_~b~0 3) (<= 200000 main_~c~0) (< main_~c~0 200001) (= main_~a~0 3))} is VALID [2022-04-15 06:28:14,920 INFO L272 TraceCheckUtils]: 13: Hoare triple {20090#(and (= main_~b~0 3) (<= 200000 main_~c~0) (< main_~c~0 200001) (= main_~a~0 3))} call __VERIFIER_assert((if ~a~0 == ~b~0 && 200000 == ~c~0 then 1 else 0)); {20097#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-15 06:28:14,920 INFO L290 TraceCheckUtils]: 14: Hoare triple {20097#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {20101#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-15 06:28:14,921 INFO L290 TraceCheckUtils]: 15: Hoare triple {20101#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {20040#false} is VALID [2022-04-15 06:28:14,921 INFO L290 TraceCheckUtils]: 16: Hoare triple {20040#false} assume !false; {20040#false} is VALID [2022-04-15 06:28:14,921 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-04-15 06:28:14,921 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 06:28:15,339 INFO L290 TraceCheckUtils]: 16: Hoare triple {20040#false} assume !false; {20040#false} is VALID [2022-04-15 06:28:15,340 INFO L290 TraceCheckUtils]: 15: Hoare triple {20101#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {20040#false} is VALID [2022-04-15 06:28:15,340 INFO L290 TraceCheckUtils]: 14: Hoare triple {20097#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {20101#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-15 06:28:15,341 INFO L272 TraceCheckUtils]: 13: Hoare triple {20048#(and (<= main_~b~0 main_~a~0) (< main_~a~0 (+ main_~b~0 1)) (< 199999 main_~c~0) (<= main_~c~0 200000))} call __VERIFIER_assert((if ~a~0 == ~b~0 && 200000 == ~c~0 then 1 else 0)); {20097#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-15 06:28:15,341 INFO L290 TraceCheckUtils]: 12: Hoare triple {20048#(and (<= main_~b~0 main_~a~0) (< main_~a~0 (+ main_~b~0 1)) (< 199999 main_~c~0) (<= main_~c~0 200000))} assume !(~c~0 == ~last~0 && 0 == ~st~0); {20048#(and (<= main_~b~0 main_~a~0) (< main_~a~0 (+ main_~b~0 1)) (< 199999 main_~c~0) (<= main_~c~0 200000))} is VALID [2022-04-15 06:28:15,342 INFO L290 TraceCheckUtils]: 11: Hoare triple {20123#(or (not (<= main_~c~0 (+ ~last~0 1))) (and (<= main_~b~0 main_~a~0) (< main_~a~0 (+ main_~b~0 1)) (< 199999 main_~c~0) (<= main_~c~0 200000)) (not (= main_~st~0 0)))} assume 0 == ~st~0 && ~c~0 == 1 + ~last~0;~a~0 := 3 + ~a~0;~b~0 := 3 + ~b~0; {20048#(and (<= main_~b~0 main_~a~0) (< main_~a~0 (+ main_~b~0 1)) (< 199999 main_~c~0) (<= main_~c~0 200000))} is VALID [2022-04-15 06:28:15,343 INFO L290 TraceCheckUtils]: 10: Hoare triple {20127#(or (not (<= main_~c~0 (+ ~last~0 1))) (and (<= main_~b~0 main_~a~0) (< main_~a~0 (+ main_~b~0 1)) (<= main_~c~0 200000)) (not (= main_~st~0 0)) (< main_~c~0 200000))} [143] L23-4_primed-->L23-4: Formula: (not (< v_main_~c~0_8 200000)) InVars {main_~c~0=v_main_~c~0_8} OutVars{main_~c~0=v_main_~c~0_8} AuxVars[] AssignedVars[] {20123#(or (not (<= main_~c~0 (+ ~last~0 1))) (and (<= main_~b~0 main_~a~0) (< main_~a~0 (+ main_~b~0 1)) (< 199999 main_~c~0) (<= main_~c~0 200000)) (not (= main_~st~0 0)))} is VALID [2022-04-15 06:28:15,343 INFO L290 TraceCheckUtils]: 9: Hoare triple {20131#(and (<= main_~b~0 main_~a~0) (< main_~a~0 (+ main_~b~0 1)) (not (= main_~st~0 0)))} [146] L23-3-->L23-4_primed: Formula: (let ((.cse0 (= |v_main_#t~post5_265| |v_main_#t~post5_261|)) (.cse1 (= v_main_~st~0_200 v_main_~st~0_199)) (.cse2 (= v_main_~c~0_505 v_main_~c~0_504)) (.cse3 (< v_main_~c~0_505 200000)) (.cse4 (= v_~last~0_156 v_main_~c~0_505))) (or (and .cse0 .cse1 .cse2 (or (not .cse3) (not .cse4))) (and (= v_~last~0_156 v_~last~0_156) .cse0 .cse1 .cse2) (and .cse3 (= v_main_~st~0_199 0) .cse4 (< v_main_~c~0_505 v_main_~c~0_504) (<= v_main_~c~0_504 (+ v_~last~0_156 1))))) InVars {main_~c~0=v_main_~c~0_505, main_#t~post5=|v_main_#t~post5_265|, main_~st~0=v_main_~st~0_200, ~last~0=v_~last~0_156} OutVars{main_#t~post5=|v_main_#t~post5_261|, main_~c~0=v_main_~c~0_504, main_~st~0=v_main_~st~0_199, ~last~0=v_~last~0_156} AuxVars[] AssignedVars[main_#t~post5, main_~c~0, main_~st~0] {20127#(or (not (<= main_~c~0 (+ ~last~0 1))) (and (<= main_~b~0 main_~a~0) (< main_~a~0 (+ main_~b~0 1)) (<= main_~c~0 200000)) (not (= main_~st~0 0)) (< main_~c~0 200000))} is VALID [2022-04-15 06:28:15,344 INFO L290 TraceCheckUtils]: 8: Hoare triple {20131#(and (<= main_~b~0 main_~a~0) (< main_~a~0 (+ main_~b~0 1)) (not (= main_~st~0 0)))} [145] L23-4_primed-->L23-3: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {20131#(and (<= main_~b~0 main_~a~0) (< main_~a~0 (+ main_~b~0 1)) (not (= main_~st~0 0)))} is VALID [2022-04-15 06:28:15,344 INFO L290 TraceCheckUtils]: 7: Hoare triple {20131#(and (<= main_~b~0 main_~a~0) (< main_~a~0 (+ main_~b~0 1)) (not (= main_~st~0 0)))} [144] L23-3-->L23-4_primed: Formula: (let ((.cse0 (= v_main_~c~0_503 v_main_~c~0_502)) (.cse2 (= v_~last~0_155 v_main_~c~0_503)) (.cse1 (= |v_main_#t~post5_262| |v_main_#t~post5_260|))) (or (and .cse0 (= v_~last~0_155 v_~last~0_155) .cse1) (and (or (not (<= (+ v_~last~0_155 1) v_main_~c~0_502)) (not (<= (+ v_main_~c~0_503 1) v_~last~0_155))) (not .cse2) (< v_main_~c~0_502 200001) (< v_main_~c~0_503 v_main_~c~0_502)) (and .cse0 (or (not (< v_main_~c~0_503 200000)) .cse2) .cse1))) InVars {main_~c~0=v_main_~c~0_503, main_#t~post5=|v_main_#t~post5_262|, ~last~0=v_~last~0_155} OutVars{main_#t~post5=|v_main_#t~post5_260|, main_~c~0=v_main_~c~0_502, ~last~0=v_~last~0_155} AuxVars[] AssignedVars[main_#t~post5, main_~c~0] {20131#(and (<= main_~b~0 main_~a~0) (< main_~a~0 (+ main_~b~0 1)) (not (= main_~st~0 0)))} is VALID [2022-04-15 06:28:15,345 INFO L290 TraceCheckUtils]: 6: Hoare triple {20141#(and (<= main_~b~0 main_~a~0) (< main_~a~0 (+ main_~b~0 1)))} assume !false;~st~0 := 1;~c~0 := 0; {20131#(and (<= main_~b~0 main_~a~0) (< main_~a~0 (+ main_~b~0 1)) (not (= main_~st~0 0)))} is VALID [2022-04-15 06:28:15,345 INFO L290 TraceCheckUtils]: 5: Hoare triple {20039#true} assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~last~0 := #t~nondet4;havoc #t~nondet4;~a~0 := 0;~b~0 := 0;~c~0 := 0;~st~0 := 0; {20141#(and (<= main_~b~0 main_~a~0) (< main_~a~0 (+ main_~b~0 1)))} is VALID [2022-04-15 06:28:15,345 INFO L272 TraceCheckUtils]: 4: Hoare triple {20039#true} call #t~ret6 := main(); {20039#true} is VALID [2022-04-15 06:28:15,345 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {20039#true} {20039#true} #66#return; {20039#true} is VALID [2022-04-15 06:28:15,345 INFO L290 TraceCheckUtils]: 2: Hoare triple {20039#true} assume true; {20039#true} is VALID [2022-04-15 06:28:15,345 INFO L290 TraceCheckUtils]: 1: Hoare triple {20039#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(11, 2);call #Ultimate.allocInit(12, 3);~last~0 := 0; {20039#true} is VALID [2022-04-15 06:28:15,345 INFO L272 TraceCheckUtils]: 0: Hoare triple {20039#true} call ULTIMATE.init(); {20039#true} is VALID [2022-04-15 06:28:15,346 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-04-15 06:28:15,346 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1028348254] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 06:28:15,346 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 06:28:15,346 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9, 9] total 19 [2022-04-15 06:28:16,436 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 06:28:16,436 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1493860369] [2022-04-15 06:28:16,436 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1493860369] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 06:28:16,437 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 06:28:16,437 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [40] imperfect sequences [] total 40 [2022-04-15 06:28:16,437 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1783130499] [2022-04-15 06:28:16,437 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 06:28:16,437 INFO L78 Accepts]: Start accepts. Automaton has has 40 states, 40 states have (on average 1.375) internal successors, (55), 38 states have internal predecessors, (55), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 59 [2022-04-15 06:28:16,437 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 06:28:16,437 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 40 states, 40 states have (on average 1.375) internal successors, (55), 38 states have internal predecessors, (55), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:28:16,483 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 59 edges. 59 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 06:28:16,483 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 40 states [2022-04-15 06:28:16,483 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 06:28:16,483 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2022-04-15 06:28:16,484 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=306, Invalid=2144, Unknown=0, NotChecked=0, Total=2450 [2022-04-15 06:28:16,484 INFO L87 Difference]: Start difference. First operand 174 states and 206 transitions. Second operand has 40 states, 40 states have (on average 1.375) internal successors, (55), 38 states have internal predecessors, (55), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:28:20,384 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:28:20,384 INFO L93 Difference]: Finished difference Result 309 states and 367 transitions. [2022-04-15 06:28:20,384 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 56 states. [2022-04-15 06:28:20,384 INFO L78 Accepts]: Start accepts. Automaton has has 40 states, 40 states have (on average 1.375) internal successors, (55), 38 states have internal predecessors, (55), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 59 [2022-04-15 06:28:20,385 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 06:28:20,385 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 40 states, 40 states have (on average 1.375) internal successors, (55), 38 states have internal predecessors, (55), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:28:20,385 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 146 transitions. [2022-04-15 06:28:20,386 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 40 states, 40 states have (on average 1.375) internal successors, (55), 38 states have internal predecessors, (55), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:28:20,386 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 146 transitions. [2022-04-15 06:28:20,386 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 56 states and 146 transitions. [2022-04-15 06:28:20,455 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-15 06:28:20,458 INFO L225 Difference]: With dead ends: 309 [2022-04-15 06:28:20,458 INFO L226 Difference]: Without dead ends: 253 [2022-04-15 06:28:20,459 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 109 GetRequests, 41 SyntacticMatches, 2 SemanticMatches, 66 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1303 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=473, Invalid=4083, Unknown=0, NotChecked=0, Total=4556 [2022-04-15 06:28:20,460 INFO L913 BasicCegarLoop]: 16 mSDtfsCounter, 110 mSDsluCounter, 78 mSDsCounter, 0 mSdLazyCounter, 2433 mSolverCounterSat, 76 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 112 SdHoareTripleChecker+Valid, 94 SdHoareTripleChecker+Invalid, 2509 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 76 IncrementalHoareTripleChecker+Valid, 2433 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2022-04-15 06:28:20,460 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [112 Valid, 94 Invalid, 2509 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [76 Valid, 2433 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2022-04-15 06:28:20,460 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 253 states. [2022-04-15 06:28:21,138 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 253 to 194. [2022-04-15 06:28:21,138 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 06:28:21,139 INFO L82 GeneralOperation]: Start isEquivalent. First operand 253 states. Second operand has 194 states, 186 states have (on average 1.1881720430107527) internal successors, (221), 187 states have internal predecessors, (221), 4 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-15 06:28:21,139 INFO L74 IsIncluded]: Start isIncluded. First operand 253 states. Second operand has 194 states, 186 states have (on average 1.1881720430107527) internal successors, (221), 187 states have internal predecessors, (221), 4 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-15 06:28:21,139 INFO L87 Difference]: Start difference. First operand 253 states. Second operand has 194 states, 186 states have (on average 1.1881720430107527) internal successors, (221), 187 states have internal predecessors, (221), 4 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-15 06:28:21,142 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:28:21,142 INFO L93 Difference]: Finished difference Result 253 states and 297 transitions. [2022-04-15 06:28:21,142 INFO L276 IsEmpty]: Start isEmpty. Operand 253 states and 297 transitions. [2022-04-15 06:28:21,142 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 06:28:21,142 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 06:28:21,142 INFO L74 IsIncluded]: Start isIncluded. First operand has 194 states, 186 states have (on average 1.1881720430107527) internal successors, (221), 187 states have internal predecessors, (221), 4 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) Second operand 253 states. [2022-04-15 06:28:21,142 INFO L87 Difference]: Start difference. First operand has 194 states, 186 states have (on average 1.1881720430107527) internal successors, (221), 187 states have internal predecessors, (221), 4 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) Second operand 253 states. [2022-04-15 06:28:21,145 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:28:21,145 INFO L93 Difference]: Finished difference Result 253 states and 297 transitions. [2022-04-15 06:28:21,145 INFO L276 IsEmpty]: Start isEmpty. Operand 253 states and 297 transitions. [2022-04-15 06:28:21,145 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 06:28:21,145 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 06:28:21,145 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 06:28:21,145 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 06:28:21,146 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 194 states, 186 states have (on average 1.1881720430107527) internal successors, (221), 187 states have internal predecessors, (221), 4 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-15 06:28:21,148 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 194 states to 194 states and 228 transitions. [2022-04-15 06:28:21,148 INFO L78 Accepts]: Start accepts. Automaton has 194 states and 228 transitions. Word has length 59 [2022-04-15 06:28:21,148 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 06:28:21,148 INFO L478 AbstractCegarLoop]: Abstraction has 194 states and 228 transitions. [2022-04-15 06:28:21,148 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 40 states, 40 states have (on average 1.375) internal successors, (55), 38 states have internal predecessors, (55), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:28:21,148 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 194 states and 228 transitions. [2022-04-15 06:28:21,611 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 228 edges. 228 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 06:28:21,611 INFO L276 IsEmpty]: Start isEmpty. Operand 194 states and 228 transitions. [2022-04-15 06:28:21,612 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2022-04-15 06:28:21,612 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 06:28:21,612 INFO L499 BasicCegarLoop]: trace histogram [16, 16, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 06:28:21,638 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Forceful destruction successful, exit code 0 [2022-04-15 06:28:21,812 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 21 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable24 [2022-04-15 06:28:21,812 INFO L403 AbstractCegarLoop]: === Iteration 26 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 06:28:21,812 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 06:28:21,813 INFO L85 PathProgramCache]: Analyzing trace with hash -1256427993, now seen corresponding path program 15 times [2022-04-15 06:28:21,813 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 06:28:21,813 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [2001205752] [2022-04-15 06:28:24,612 WARN L970 rdanLoopAcceleration]: Unable to prove correctness of quantifier elimination. [2022-04-15 06:28:28,633 WARN L977 rdanLoopAcceleration]: Unable to prove correctness of quantifier elimination. [2022-04-15 06:28:28,745 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 1 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-15 06:28:28,956 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {0={1=1}, 1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-15 06:28:28,957 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-15 06:28:28,959 INFO L85 PathProgramCache]: Analyzing trace with hash -1666641848, now seen corresponding path program 1 times [2022-04-15 06:28:28,959 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 06:28:28,959 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1392580491] [2022-04-15 06:28:28,959 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 06:28:28,960 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 06:28:28,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:28:29,064 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 06:28:29,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:28:29,067 INFO L290 TraceCheckUtils]: 0: Hoare triple {21753#(and (= ~last~0 |old(~last~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(11, 2);call #Ultimate.allocInit(12, 3);~last~0 := 0; {21741#true} is VALID [2022-04-15 06:28:29,067 INFO L290 TraceCheckUtils]: 1: Hoare triple {21741#true} assume true; {21741#true} is VALID [2022-04-15 06:28:29,067 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {21741#true} {21741#true} #66#return; {21741#true} is VALID [2022-04-15 06:28:29,067 INFO L272 TraceCheckUtils]: 0: Hoare triple {21741#true} call ULTIMATE.init(); {21753#(and (= ~last~0 |old(~last~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 06:28:29,067 INFO L290 TraceCheckUtils]: 1: Hoare triple {21753#(and (= ~last~0 |old(~last~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(11, 2);call #Ultimate.allocInit(12, 3);~last~0 := 0; {21741#true} is VALID [2022-04-15 06:28:29,068 INFO L290 TraceCheckUtils]: 2: Hoare triple {21741#true} assume true; {21741#true} is VALID [2022-04-15 06:28:29,068 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {21741#true} {21741#true} #66#return; {21741#true} is VALID [2022-04-15 06:28:29,068 INFO L272 TraceCheckUtils]: 4: Hoare triple {21741#true} call #t~ret6 := main(); {21741#true} is VALID [2022-04-15 06:28:29,068 INFO L290 TraceCheckUtils]: 5: Hoare triple {21741#true} assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~last~0 := #t~nondet4;havoc #t~nondet4;~a~0 := 0;~b~0 := 0;~c~0 := 0;~st~0 := 0; {21746#(and (= main_~a~0 0) (= main_~b~0 0))} is VALID [2022-04-15 06:28:29,068 INFO L290 TraceCheckUtils]: 6: Hoare triple {21746#(and (= main_~a~0 0) (= main_~b~0 0))} assume !false;~st~0 := 1;~c~0 := 0; {21747#(and (= main_~a~0 0) (= main_~st~0 1) (= main_~b~0 0))} is VALID [2022-04-15 06:28:29,069 INFO L290 TraceCheckUtils]: 7: Hoare triple {21747#(and (= main_~a~0 0) (= main_~st~0 1) (= main_~b~0 0))} [148] L23-3-->L23-4_primed: Formula: (let ((.cse0 (= v_main_~c~0_535 v_main_~c~0_534)) (.cse1 (= |v_main_#t~post5_275| |v_main_#t~post5_273|)) (.cse2 (= v_~last~0_163 v_main_~c~0_535))) (or (and .cse0 .cse1 (= v_~last~0_163 v_~last~0_163)) (and .cse0 .cse1 (or (not (< v_main_~c~0_535 200000)) .cse2)) (and (or (not (<= (+ v_~last~0_163 1) v_main_~c~0_534)) (not (<= (+ v_main_~c~0_535 1) v_~last~0_163))) (< v_main_~c~0_534 200001) (< v_main_~c~0_535 v_main_~c~0_534) (not .cse2)))) InVars {main_~c~0=v_main_~c~0_535, main_#t~post5=|v_main_#t~post5_275|, ~last~0=v_~last~0_163} OutVars{main_#t~post5=|v_main_#t~post5_273|, main_~c~0=v_main_~c~0_534, ~last~0=v_~last~0_163} AuxVars[] AssignedVars[main_#t~post5, main_~c~0] {21747#(and (= main_~a~0 0) (= main_~st~0 1) (= main_~b~0 0))} is VALID [2022-04-15 06:28:29,069 INFO L290 TraceCheckUtils]: 8: Hoare triple {21747#(and (= main_~a~0 0) (= main_~st~0 1) (= main_~b~0 0))} [149] L23-4_primed-->L23-3: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {21747#(and (= main_~a~0 0) (= main_~st~0 1) (= main_~b~0 0))} is VALID [2022-04-15 06:28:29,070 INFO L290 TraceCheckUtils]: 9: Hoare triple {21747#(and (= main_~a~0 0) (= main_~st~0 1) (= main_~b~0 0))} [150] L23-3-->L23-4_primed: Formula: (let ((.cse0 (= |v_main_#t~post5_278| |v_main_#t~post5_274|)) (.cse1 (= v_main_~c~0_537 v_main_~c~0_536)) (.cse2 (= v_main_~st~0_210 v_main_~st~0_209)) (.cse3 (= v_~last~0_164 v_main_~c~0_537)) (.cse4 (< v_main_~c~0_537 200000))) (or (and .cse0 (= v_~last~0_164 v_~last~0_164) .cse1 .cse2) (and (< v_main_~c~0_537 v_main_~c~0_536) (= v_main_~st~0_209 0) (<= v_main_~c~0_536 (+ v_~last~0_164 1)) .cse3 .cse4) (and .cse0 .cse1 .cse2 (or (not .cse3) (not .cse4))))) InVars {main_~c~0=v_main_~c~0_537, main_#t~post5=|v_main_#t~post5_278|, main_~st~0=v_main_~st~0_210, ~last~0=v_~last~0_164} OutVars{main_#t~post5=|v_main_#t~post5_274|, main_~c~0=v_main_~c~0_536, main_~st~0=v_main_~st~0_209, ~last~0=v_~last~0_164} AuxVars[] AssignedVars[main_#t~post5, main_~c~0, main_~st~0] {21748#(or (= main_~st~0 1) (and (= main_~a~0 0) (or (<= ~last~0 199999) (<= main_~c~0 200000)) (= main_~b~0 0)))} is VALID [2022-04-15 06:28:29,070 INFO L290 TraceCheckUtils]: 10: Hoare triple {21748#(or (= main_~st~0 1) (and (= main_~a~0 0) (or (<= ~last~0 199999) (<= main_~c~0 200000)) (= main_~b~0 0)))} [147] L23-4_primed-->L23-4: Formula: (not (< v_main_~c~0_8 200000)) InVars {main_~c~0=v_main_~c~0_8} OutVars{main_~c~0=v_main_~c~0_8} AuxVars[] AssignedVars[] {21749#(or (= main_~st~0 1) (and (= main_~a~0 0) (or (<= ~last~0 199999) (<= main_~c~0 200000)) (= main_~b~0 0) (< 199999 main_~c~0)))} is VALID [2022-04-15 06:28:29,071 INFO L290 TraceCheckUtils]: 11: Hoare triple {21749#(or (= main_~st~0 1) (and (= main_~a~0 0) (or (<= ~last~0 199999) (<= main_~c~0 200000)) (= main_~b~0 0) (< 199999 main_~c~0)))} assume 0 == ~st~0 && ~c~0 == 1 + ~last~0;~a~0 := 3 + ~a~0;~b~0 := 3 + ~b~0; {21750#(and (<= main_~b~0 main_~a~0) (< main_~a~0 (+ main_~b~0 1)) (< 199999 main_~c~0) (<= main_~c~0 200000))} is VALID [2022-04-15 06:28:29,071 INFO L290 TraceCheckUtils]: 12: Hoare triple {21750#(and (<= main_~b~0 main_~a~0) (< main_~a~0 (+ main_~b~0 1)) (< 199999 main_~c~0) (<= main_~c~0 200000))} assume !(~c~0 == ~last~0 && 0 == ~st~0); {21750#(and (<= main_~b~0 main_~a~0) (< main_~a~0 (+ main_~b~0 1)) (< 199999 main_~c~0) (<= main_~c~0 200000))} is VALID [2022-04-15 06:28:29,072 INFO L272 TraceCheckUtils]: 13: Hoare triple {21750#(and (<= main_~b~0 main_~a~0) (< main_~a~0 (+ main_~b~0 1)) (< 199999 main_~c~0) (<= main_~c~0 200000))} call __VERIFIER_assert((if ~a~0 == ~b~0 && 200000 == ~c~0 then 1 else 0)); {21751#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-15 06:28:29,072 INFO L290 TraceCheckUtils]: 14: Hoare triple {21751#(not (= |__VERIFIER_assert_#in~cond| 0))} ~cond := #in~cond; {21752#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-15 06:28:29,073 INFO L290 TraceCheckUtils]: 15: Hoare triple {21752#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {21742#false} is VALID [2022-04-15 06:28:29,073 INFO L290 TraceCheckUtils]: 16: Hoare triple {21742#false} assume !false; {21742#false} is VALID [2022-04-15 06:28:29,073 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-04-15 06:28:29,073 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 06:28:29,073 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1392580491] [2022-04-15 06:28:29,073 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1392580491] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 06:28:29,073 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [837096466] [2022-04-15 06:28:29,073 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 06:28:29,073 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 06:28:29,073 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 06:28:29,074 INFO L229 MonitoredProcess]: Starting monitored process 22 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-15 06:28:29,075 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Waiting until timeout for monitored process [2022-04-15 06:28:29,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:28:29,106 INFO L263 TraceCheckSpWp]: Trace formula consists of 85 conjuncts, 18 conjunts are in the unsatisfiable core [2022-04-15 06:28:29,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:28:29,112 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 06:28:29,347 INFO L272 TraceCheckUtils]: 0: Hoare triple {21741#true} call ULTIMATE.init(); {21741#true} is VALID [2022-04-15 06:28:29,347 INFO L290 TraceCheckUtils]: 1: Hoare triple {21741#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(11, 2);call #Ultimate.allocInit(12, 3);~last~0 := 0; {21741#true} is VALID [2022-04-15 06:28:29,347 INFO L290 TraceCheckUtils]: 2: Hoare triple {21741#true} assume true; {21741#true} is VALID [2022-04-15 06:28:29,347 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {21741#true} {21741#true} #66#return; {21741#true} is VALID [2022-04-15 06:28:29,347 INFO L272 TraceCheckUtils]: 4: Hoare triple {21741#true} call #t~ret6 := main(); {21741#true} is VALID [2022-04-15 06:28:29,348 INFO L290 TraceCheckUtils]: 5: Hoare triple {21741#true} assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~last~0 := #t~nondet4;havoc #t~nondet4;~a~0 := 0;~b~0 := 0;~c~0 := 0;~st~0 := 0; {21746#(and (= main_~a~0 0) (= main_~b~0 0))} is VALID [2022-04-15 06:28:29,348 INFO L290 TraceCheckUtils]: 6: Hoare triple {21746#(and (= main_~a~0 0) (= main_~b~0 0))} assume !false;~st~0 := 1;~c~0 := 0; {21747#(and (= main_~a~0 0) (= main_~st~0 1) (= main_~b~0 0))} is VALID [2022-04-15 06:28:29,349 INFO L290 TraceCheckUtils]: 7: Hoare triple {21747#(and (= main_~a~0 0) (= main_~st~0 1) (= main_~b~0 0))} [148] L23-3-->L23-4_primed: Formula: (let ((.cse0 (= v_main_~c~0_535 v_main_~c~0_534)) (.cse1 (= |v_main_#t~post5_275| |v_main_#t~post5_273|)) (.cse2 (= v_~last~0_163 v_main_~c~0_535))) (or (and .cse0 .cse1 (= v_~last~0_163 v_~last~0_163)) (and .cse0 .cse1 (or (not (< v_main_~c~0_535 200000)) .cse2)) (and (or (not (<= (+ v_~last~0_163 1) v_main_~c~0_534)) (not (<= (+ v_main_~c~0_535 1) v_~last~0_163))) (< v_main_~c~0_534 200001) (< v_main_~c~0_535 v_main_~c~0_534) (not .cse2)))) InVars {main_~c~0=v_main_~c~0_535, main_#t~post5=|v_main_#t~post5_275|, ~last~0=v_~last~0_163} OutVars{main_#t~post5=|v_main_#t~post5_273|, main_~c~0=v_main_~c~0_534, ~last~0=v_~last~0_163} AuxVars[] AssignedVars[main_#t~post5, main_~c~0] {21747#(and (= main_~a~0 0) (= main_~st~0 1) (= main_~b~0 0))} is VALID [2022-04-15 06:28:29,349 INFO L290 TraceCheckUtils]: 8: Hoare triple {21747#(and (= main_~a~0 0) (= main_~st~0 1) (= main_~b~0 0))} [149] L23-4_primed-->L23-3: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {21747#(and (= main_~a~0 0) (= main_~st~0 1) (= main_~b~0 0))} is VALID [2022-04-15 06:28:29,350 INFO L290 TraceCheckUtils]: 9: Hoare triple {21747#(and (= main_~a~0 0) (= main_~st~0 1) (= main_~b~0 0))} [150] L23-3-->L23-4_primed: Formula: (let ((.cse0 (= |v_main_#t~post5_278| |v_main_#t~post5_274|)) (.cse1 (= v_main_~c~0_537 v_main_~c~0_536)) (.cse2 (= v_main_~st~0_210 v_main_~st~0_209)) (.cse3 (= v_~last~0_164 v_main_~c~0_537)) (.cse4 (< v_main_~c~0_537 200000))) (or (and .cse0 (= v_~last~0_164 v_~last~0_164) .cse1 .cse2) (and (< v_main_~c~0_537 v_main_~c~0_536) (= v_main_~st~0_209 0) (<= v_main_~c~0_536 (+ v_~last~0_164 1)) .cse3 .cse4) (and .cse0 .cse1 .cse2 (or (not .cse3) (not .cse4))))) InVars {main_~c~0=v_main_~c~0_537, main_#t~post5=|v_main_#t~post5_278|, main_~st~0=v_main_~st~0_210, ~last~0=v_~last~0_164} OutVars{main_#t~post5=|v_main_#t~post5_274|, main_~c~0=v_main_~c~0_536, main_~st~0=v_main_~st~0_209, ~last~0=v_~last~0_164} AuxVars[] AssignedVars[main_#t~post5, main_~c~0, main_~st~0] {21784#(and (= main_~a~0 0) (= main_~b~0 0) (or (and (< ~last~0 200000) (< ~last~0 main_~c~0) (<= main_~c~0 (+ ~last~0 1)) (= main_~st~0 0)) (= main_~st~0 1)))} is VALID [2022-04-15 06:28:29,350 INFO L290 TraceCheckUtils]: 10: Hoare triple {21784#(and (= main_~a~0 0) (= main_~b~0 0) (or (and (< ~last~0 200000) (< ~last~0 main_~c~0) (<= main_~c~0 (+ ~last~0 1)) (= main_~st~0 0)) (= main_~st~0 1)))} [147] L23-4_primed-->L23-4: Formula: (not (< v_main_~c~0_8 200000)) InVars {main_~c~0=v_main_~c~0_8} OutVars{main_~c~0=v_main_~c~0_8} AuxVars[] AssignedVars[] {21788#(and (= main_~a~0 0) (or (= main_~st~0 1) (and (< ~last~0 200000) (<= main_~c~0 (+ ~last~0 1)) (= main_~st~0 0))) (= main_~b~0 0) (not (< main_~c~0 200000)))} is VALID [2022-04-15 06:28:29,351 INFO L290 TraceCheckUtils]: 11: Hoare triple {21788#(and (= main_~a~0 0) (or (= main_~st~0 1) (and (< ~last~0 200000) (<= main_~c~0 (+ ~last~0 1)) (= main_~st~0 0))) (= main_~b~0 0) (not (< main_~c~0 200000)))} assume 0 == ~st~0 && ~c~0 == 1 + ~last~0;~a~0 := 3 + ~a~0;~b~0 := 3 + ~b~0; {21792#(and (= main_~b~0 3) (<= 200000 main_~c~0) (< main_~c~0 200001) (= main_~a~0 3))} is VALID [2022-04-15 06:28:29,351 INFO L290 TraceCheckUtils]: 12: Hoare triple {21792#(and (= main_~b~0 3) (<= 200000 main_~c~0) (< main_~c~0 200001) (= main_~a~0 3))} assume !(~c~0 == ~last~0 && 0 == ~st~0); {21792#(and (= main_~b~0 3) (<= 200000 main_~c~0) (< main_~c~0 200001) (= main_~a~0 3))} is VALID [2022-04-15 06:28:29,352 INFO L272 TraceCheckUtils]: 13: Hoare triple {21792#(and (= main_~b~0 3) (<= 200000 main_~c~0) (< main_~c~0 200001) (= main_~a~0 3))} call __VERIFIER_assert((if ~a~0 == ~b~0 && 200000 == ~c~0 then 1 else 0)); {21799#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-15 06:28:29,352 INFO L290 TraceCheckUtils]: 14: Hoare triple {21799#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {21803#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-15 06:28:29,352 INFO L290 TraceCheckUtils]: 15: Hoare triple {21803#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {21742#false} is VALID [2022-04-15 06:28:29,353 INFO L290 TraceCheckUtils]: 16: Hoare triple {21742#false} assume !false; {21742#false} is VALID [2022-04-15 06:28:29,353 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-04-15 06:28:29,353 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 06:28:29,733 INFO L290 TraceCheckUtils]: 16: Hoare triple {21742#false} assume !false; {21742#false} is VALID [2022-04-15 06:28:29,733 INFO L290 TraceCheckUtils]: 15: Hoare triple {21803#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {21742#false} is VALID [2022-04-15 06:28:29,733 INFO L290 TraceCheckUtils]: 14: Hoare triple {21799#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {21803#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-15 06:28:29,734 INFO L272 TraceCheckUtils]: 13: Hoare triple {21750#(and (<= main_~b~0 main_~a~0) (< main_~a~0 (+ main_~b~0 1)) (< 199999 main_~c~0) (<= main_~c~0 200000))} call __VERIFIER_assert((if ~a~0 == ~b~0 && 200000 == ~c~0 then 1 else 0)); {21799#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-15 06:28:29,734 INFO L290 TraceCheckUtils]: 12: Hoare triple {21750#(and (<= main_~b~0 main_~a~0) (< main_~a~0 (+ main_~b~0 1)) (< 199999 main_~c~0) (<= main_~c~0 200000))} assume !(~c~0 == ~last~0 && 0 == ~st~0); {21750#(and (<= main_~b~0 main_~a~0) (< main_~a~0 (+ main_~b~0 1)) (< 199999 main_~c~0) (<= main_~c~0 200000))} is VALID [2022-04-15 06:28:29,735 INFO L290 TraceCheckUtils]: 11: Hoare triple {21825#(or (not (<= main_~c~0 (+ ~last~0 1))) (and (<= main_~b~0 main_~a~0) (< main_~a~0 (+ main_~b~0 1)) (< 199999 main_~c~0) (<= main_~c~0 200000)) (not (= main_~st~0 0)))} assume 0 == ~st~0 && ~c~0 == 1 + ~last~0;~a~0 := 3 + ~a~0;~b~0 := 3 + ~b~0; {21750#(and (<= main_~b~0 main_~a~0) (< main_~a~0 (+ main_~b~0 1)) (< 199999 main_~c~0) (<= main_~c~0 200000))} is VALID [2022-04-15 06:28:29,736 INFO L290 TraceCheckUtils]: 10: Hoare triple {21829#(or (not (<= main_~c~0 (+ ~last~0 1))) (and (<= main_~b~0 main_~a~0) (< main_~a~0 (+ main_~b~0 1)) (<= main_~c~0 200000)) (not (= main_~st~0 0)) (< main_~c~0 200000))} [147] L23-4_primed-->L23-4: Formula: (not (< v_main_~c~0_8 200000)) InVars {main_~c~0=v_main_~c~0_8} OutVars{main_~c~0=v_main_~c~0_8} AuxVars[] AssignedVars[] {21825#(or (not (<= main_~c~0 (+ ~last~0 1))) (and (<= main_~b~0 main_~a~0) (< main_~a~0 (+ main_~b~0 1)) (< 199999 main_~c~0) (<= main_~c~0 200000)) (not (= main_~st~0 0)))} is VALID [2022-04-15 06:28:29,736 INFO L290 TraceCheckUtils]: 9: Hoare triple {21833#(and (<= main_~b~0 main_~a~0) (< main_~a~0 (+ main_~b~0 1)) (not (= main_~st~0 0)))} [150] L23-3-->L23-4_primed: Formula: (let ((.cse0 (= |v_main_#t~post5_278| |v_main_#t~post5_274|)) (.cse1 (= v_main_~c~0_537 v_main_~c~0_536)) (.cse2 (= v_main_~st~0_210 v_main_~st~0_209)) (.cse3 (= v_~last~0_164 v_main_~c~0_537)) (.cse4 (< v_main_~c~0_537 200000))) (or (and .cse0 (= v_~last~0_164 v_~last~0_164) .cse1 .cse2) (and (< v_main_~c~0_537 v_main_~c~0_536) (= v_main_~st~0_209 0) (<= v_main_~c~0_536 (+ v_~last~0_164 1)) .cse3 .cse4) (and .cse0 .cse1 .cse2 (or (not .cse3) (not .cse4))))) InVars {main_~c~0=v_main_~c~0_537, main_#t~post5=|v_main_#t~post5_278|, main_~st~0=v_main_~st~0_210, ~last~0=v_~last~0_164} OutVars{main_#t~post5=|v_main_#t~post5_274|, main_~c~0=v_main_~c~0_536, main_~st~0=v_main_~st~0_209, ~last~0=v_~last~0_164} AuxVars[] AssignedVars[main_#t~post5, main_~c~0, main_~st~0] {21829#(or (not (<= main_~c~0 (+ ~last~0 1))) (and (<= main_~b~0 main_~a~0) (< main_~a~0 (+ main_~b~0 1)) (<= main_~c~0 200000)) (not (= main_~st~0 0)) (< main_~c~0 200000))} is VALID [2022-04-15 06:28:29,737 INFO L290 TraceCheckUtils]: 8: Hoare triple {21833#(and (<= main_~b~0 main_~a~0) (< main_~a~0 (+ main_~b~0 1)) (not (= main_~st~0 0)))} [149] L23-4_primed-->L23-3: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {21833#(and (<= main_~b~0 main_~a~0) (< main_~a~0 (+ main_~b~0 1)) (not (= main_~st~0 0)))} is VALID [2022-04-15 06:28:29,737 INFO L290 TraceCheckUtils]: 7: Hoare triple {21833#(and (<= main_~b~0 main_~a~0) (< main_~a~0 (+ main_~b~0 1)) (not (= main_~st~0 0)))} [148] L23-3-->L23-4_primed: Formula: (let ((.cse0 (= v_main_~c~0_535 v_main_~c~0_534)) (.cse1 (= |v_main_#t~post5_275| |v_main_#t~post5_273|)) (.cse2 (= v_~last~0_163 v_main_~c~0_535))) (or (and .cse0 .cse1 (= v_~last~0_163 v_~last~0_163)) (and .cse0 .cse1 (or (not (< v_main_~c~0_535 200000)) .cse2)) (and (or (not (<= (+ v_~last~0_163 1) v_main_~c~0_534)) (not (<= (+ v_main_~c~0_535 1) v_~last~0_163))) (< v_main_~c~0_534 200001) (< v_main_~c~0_535 v_main_~c~0_534) (not .cse2)))) InVars {main_~c~0=v_main_~c~0_535, main_#t~post5=|v_main_#t~post5_275|, ~last~0=v_~last~0_163} OutVars{main_#t~post5=|v_main_#t~post5_273|, main_~c~0=v_main_~c~0_534, ~last~0=v_~last~0_163} AuxVars[] AssignedVars[main_#t~post5, main_~c~0] {21833#(and (<= main_~b~0 main_~a~0) (< main_~a~0 (+ main_~b~0 1)) (not (= main_~st~0 0)))} is VALID [2022-04-15 06:28:29,738 INFO L290 TraceCheckUtils]: 6: Hoare triple {21843#(and (<= main_~b~0 main_~a~0) (< main_~a~0 (+ main_~b~0 1)))} assume !false;~st~0 := 1;~c~0 := 0; {21833#(and (<= main_~b~0 main_~a~0) (< main_~a~0 (+ main_~b~0 1)) (not (= main_~st~0 0)))} is VALID [2022-04-15 06:28:29,738 INFO L290 TraceCheckUtils]: 5: Hoare triple {21741#true} assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~last~0 := #t~nondet4;havoc #t~nondet4;~a~0 := 0;~b~0 := 0;~c~0 := 0;~st~0 := 0; {21843#(and (<= main_~b~0 main_~a~0) (< main_~a~0 (+ main_~b~0 1)))} is VALID [2022-04-15 06:28:29,738 INFO L272 TraceCheckUtils]: 4: Hoare triple {21741#true} call #t~ret6 := main(); {21741#true} is VALID [2022-04-15 06:28:29,738 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {21741#true} {21741#true} #66#return; {21741#true} is VALID [2022-04-15 06:28:29,738 INFO L290 TraceCheckUtils]: 2: Hoare triple {21741#true} assume true; {21741#true} is VALID [2022-04-15 06:28:29,738 INFO L290 TraceCheckUtils]: 1: Hoare triple {21741#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(11, 2);call #Ultimate.allocInit(12, 3);~last~0 := 0; {21741#true} is VALID [2022-04-15 06:28:29,738 INFO L272 TraceCheckUtils]: 0: Hoare triple {21741#true} call ULTIMATE.init(); {21741#true} is VALID [2022-04-15 06:28:29,738 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-04-15 06:28:29,739 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [837096466] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 06:28:29,739 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 06:28:29,739 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9, 9] total 19 [2022-04-15 06:28:30,893 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 06:28:30,893 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [2001205752] [2022-04-15 06:28:30,893 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [2001205752] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 06:28:30,893 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 06:28:30,893 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [42] imperfect sequences [] total 42 [2022-04-15 06:28:30,894 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1803747514] [2022-04-15 06:28:30,894 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 06:28:30,894 INFO L78 Accepts]: Start accepts. Automaton has has 42 states, 42 states have (on average 1.380952380952381) internal successors, (58), 40 states have internal predecessors, (58), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 62 [2022-04-15 06:28:30,894 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 06:28:30,894 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 42 states, 42 states have (on average 1.380952380952381) internal successors, (58), 40 states have internal predecessors, (58), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:28:30,938 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 62 edges. 62 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 06:28:30,938 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 42 states [2022-04-15 06:28:30,938 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 06:28:30,938 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2022-04-15 06:28:30,939 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=321, Invalid=2331, Unknown=0, NotChecked=0, Total=2652 [2022-04-15 06:28:30,939 INFO L87 Difference]: Start difference. First operand 194 states and 228 transitions. Second operand has 42 states, 42 states have (on average 1.380952380952381) internal successors, (58), 40 states have internal predecessors, (58), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:28:34,559 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:28:34,559 INFO L93 Difference]: Finished difference Result 288 states and 338 transitions. [2022-04-15 06:28:34,559 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 59 states. [2022-04-15 06:28:34,559 INFO L78 Accepts]: Start accepts. Automaton has has 42 states, 42 states have (on average 1.380952380952381) internal successors, (58), 40 states have internal predecessors, (58), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 62 [2022-04-15 06:28:34,559 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 06:28:34,559 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 42 states, 42 states have (on average 1.380952380952381) internal successors, (58), 40 states have internal predecessors, (58), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:28:34,560 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 150 transitions. [2022-04-15 06:28:34,560 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 42 states, 42 states have (on average 1.380952380952381) internal successors, (58), 40 states have internal predecessors, (58), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:28:34,561 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 150 transitions. [2022-04-15 06:28:34,561 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 59 states and 150 transitions. [2022-04-15 06:28:34,640 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-15 06:28:34,644 INFO L225 Difference]: With dead ends: 288 [2022-04-15 06:28:34,644 INFO L226 Difference]: Without dead ends: 232 [2022-04-15 06:28:34,645 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 113 GetRequests, 42 SyntacticMatches, 2 SemanticMatches, 69 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1420 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=498, Invalid=4472, Unknown=0, NotChecked=0, Total=4970 [2022-04-15 06:28:34,645 INFO L913 BasicCegarLoop]: 16 mSDtfsCounter, 95 mSDsluCounter, 98 mSDsCounter, 0 mSdLazyCounter, 2619 mSolverCounterSat, 79 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 97 SdHoareTripleChecker+Valid, 114 SdHoareTripleChecker+Invalid, 2698 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 79 IncrementalHoareTripleChecker+Valid, 2619 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2022-04-15 06:28:34,647 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [97 Valid, 114 Invalid, 2698 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [79 Valid, 2619 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2022-04-15 06:28:34,647 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 232 states. [2022-04-15 06:28:35,129 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 232 to 197. [2022-04-15 06:28:35,129 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 06:28:35,130 INFO L82 GeneralOperation]: Start isEquivalent. First operand 232 states. Second operand has 197 states, 189 states have (on average 1.1904761904761905) internal successors, (225), 190 states have internal predecessors, (225), 4 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-15 06:28:35,130 INFO L74 IsIncluded]: Start isIncluded. First operand 232 states. Second operand has 197 states, 189 states have (on average 1.1904761904761905) internal successors, (225), 190 states have internal predecessors, (225), 4 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-15 06:28:35,130 INFO L87 Difference]: Start difference. First operand 232 states. Second operand has 197 states, 189 states have (on average 1.1904761904761905) internal successors, (225), 190 states have internal predecessors, (225), 4 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-15 06:28:35,132 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:28:35,133 INFO L93 Difference]: Finished difference Result 232 states and 269 transitions. [2022-04-15 06:28:35,133 INFO L276 IsEmpty]: Start isEmpty. Operand 232 states and 269 transitions. [2022-04-15 06:28:35,133 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 06:28:35,133 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 06:28:35,133 INFO L74 IsIncluded]: Start isIncluded. First operand has 197 states, 189 states have (on average 1.1904761904761905) internal successors, (225), 190 states have internal predecessors, (225), 4 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) Second operand 232 states. [2022-04-15 06:28:35,133 INFO L87 Difference]: Start difference. First operand has 197 states, 189 states have (on average 1.1904761904761905) internal successors, (225), 190 states have internal predecessors, (225), 4 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) Second operand 232 states. [2022-04-15 06:28:35,136 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:28:35,136 INFO L93 Difference]: Finished difference Result 232 states and 269 transitions. [2022-04-15 06:28:35,136 INFO L276 IsEmpty]: Start isEmpty. Operand 232 states and 269 transitions. [2022-04-15 06:28:35,136 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 06:28:35,136 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 06:28:35,136 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 06:28:35,136 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 06:28:35,137 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 197 states, 189 states have (on average 1.1904761904761905) internal successors, (225), 190 states have internal predecessors, (225), 4 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-15 06:28:35,139 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 197 states to 197 states and 232 transitions. [2022-04-15 06:28:35,139 INFO L78 Accepts]: Start accepts. Automaton has 197 states and 232 transitions. Word has length 62 [2022-04-15 06:28:35,139 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 06:28:35,139 INFO L478 AbstractCegarLoop]: Abstraction has 197 states and 232 transitions. [2022-04-15 06:28:35,139 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 42 states, 42 states have (on average 1.380952380952381) internal successors, (58), 40 states have internal predecessors, (58), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:28:35,139 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 197 states and 232 transitions. [2022-04-15 06:28:35,571 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 232 edges. 232 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 06:28:35,572 INFO L276 IsEmpty]: Start isEmpty. Operand 197 states and 232 transitions. [2022-04-15 06:28:35,572 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2022-04-15 06:28:35,572 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 06:28:35,572 INFO L499 BasicCegarLoop]: trace histogram [14, 14, 12, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 06:28:35,591 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Forceful destruction successful, exit code 0 [2022-04-15 06:28:35,786 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 22 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable25 [2022-04-15 06:28:35,786 INFO L403 AbstractCegarLoop]: === Iteration 27 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 06:28:35,786 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 06:28:35,786 INFO L85 PathProgramCache]: Analyzing trace with hash 696503590, now seen corresponding path program 6 times [2022-04-15 06:28:35,786 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 06:28:35,786 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1955244730] [2022-04-15 06:28:35,927 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 4 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {0={1=2}, 1={1=1, 2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-15 06:28:35,927 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-15 06:28:35,927 INFO L85 PathProgramCache]: Analyzing trace with hash 1950207864, now seen corresponding path program 1 times [2022-04-15 06:28:35,927 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 06:28:35,927 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1280687934] [2022-04-15 06:28:35,927 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 06:28:35,928 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 06:28:35,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:28:35,990 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 06:28:35,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:28:35,995 INFO L290 TraceCheckUtils]: 0: Hoare triple {23382#(and (= ~last~0 |old(~last~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(11, 2);call #Ultimate.allocInit(12, 3);~last~0 := 0; {23369#true} is VALID [2022-04-15 06:28:35,995 INFO L290 TraceCheckUtils]: 1: Hoare triple {23369#true} assume true; {23369#true} is VALID [2022-04-15 06:28:35,995 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {23369#true} {23369#true} #66#return; {23369#true} is VALID [2022-04-15 06:28:35,999 INFO L272 TraceCheckUtils]: 0: Hoare triple {23369#true} call ULTIMATE.init(); {23382#(and (= ~last~0 |old(~last~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 06:28:35,999 INFO L290 TraceCheckUtils]: 1: Hoare triple {23382#(and (= ~last~0 |old(~last~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(11, 2);call #Ultimate.allocInit(12, 3);~last~0 := 0; {23369#true} is VALID [2022-04-15 06:28:35,999 INFO L290 TraceCheckUtils]: 2: Hoare triple {23369#true} assume true; {23369#true} is VALID [2022-04-15 06:28:35,999 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {23369#true} {23369#true} #66#return; {23369#true} is VALID [2022-04-15 06:28:35,999 INFO L272 TraceCheckUtils]: 4: Hoare triple {23369#true} call #t~ret6 := main(); {23369#true} is VALID [2022-04-15 06:28:35,999 INFO L290 TraceCheckUtils]: 5: Hoare triple {23369#true} assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~last~0 := #t~nondet4;havoc #t~nondet4;~a~0 := 0;~b~0 := 0;~c~0 := 0;~st~0 := 0; {23369#true} is VALID [2022-04-15 06:28:35,999 INFO L290 TraceCheckUtils]: 6: Hoare triple {23369#true} [152] L30-->L23-3_primed: Formula: (let ((.cse0 (= |v_main_#t~post5_293| |v_main_#t~post5_286|)) (.cse1 (= v_main_~b~0_113 v_main_~b~0_112)) (.cse2 (= v_main_~a~0_116 v_main_~a~0_115))) (or (and .cse0 .cse1 (= v_main_~c~0_569 v_main_~c~0_577) (= v_main_~st~0_219 v_main_~st~0_221) .cse2) (and .cse0 (= v_main_~c~0_577 v_main_~c~0_569) .cse1 .cse2 (= v_main_~st~0_221 v_main_~st~0_219)))) InVars {main_~c~0=v_main_~c~0_577, main_#t~post5=|v_main_#t~post5_293|, main_~st~0=v_main_~st~0_221, main_~b~0=v_main_~b~0_113, main_~a~0=v_main_~a~0_116} OutVars{main_~c~0=v_main_~c~0_569, main_#t~post5=|v_main_#t~post5_286|, main_~st~0=v_main_~st~0_219, main_~b~0=v_main_~b~0_112, main_~a~0=v_main_~a~0_115} AuxVars[] AssignedVars[main_~c~0, main_#t~post5, main_~st~0, main_~b~0, main_~a~0] {23369#true} is VALID [2022-04-15 06:28:36,000 INFO L290 TraceCheckUtils]: 7: Hoare triple {23369#true} [151] L23-3_primed-->L23-3: Formula: (and (= v_main_~c~0_7 0) (= v_main_~st~0_6 1)) InVars {} OutVars{main_~c~0=v_main_~c~0_7, main_~st~0=v_main_~st~0_6} AuxVars[] AssignedVars[main_~c~0, main_~st~0] {23374#(= main_~c~0 0)} is VALID [2022-04-15 06:28:36,000 INFO L290 TraceCheckUtils]: 8: Hoare triple {23374#(= main_~c~0 0)} assume !!(~c~0 < 200000); {23374#(= main_~c~0 0)} is VALID [2022-04-15 06:28:36,000 INFO L290 TraceCheckUtils]: 9: Hoare triple {23374#(= main_~c~0 0)} assume ~c~0 == ~last~0;~st~0 := 0; {23374#(= main_~c~0 0)} is VALID [2022-04-15 06:28:36,000 INFO L290 TraceCheckUtils]: 10: Hoare triple {23374#(= main_~c~0 0)} #t~post5 := ~c~0;~c~0 := 1 + #t~post5;havoc #t~post5; {23375#(<= main_~c~0 1)} is VALID [2022-04-15 06:28:36,000 INFO L290 TraceCheckUtils]: 11: Hoare triple {23375#(<= main_~c~0 1)} assume !!(~c~0 < 200000); {23375#(<= main_~c~0 1)} is VALID [2022-04-15 06:28:36,001 INFO L290 TraceCheckUtils]: 12: Hoare triple {23375#(<= main_~c~0 1)} assume !(~c~0 == ~last~0); {23375#(<= main_~c~0 1)} is VALID [2022-04-15 06:28:36,001 INFO L290 TraceCheckUtils]: 13: Hoare triple {23375#(<= main_~c~0 1)} #t~post5 := ~c~0;~c~0 := 1 + #t~post5;havoc #t~post5; {23376#(<= main_~c~0 2)} is VALID [2022-04-15 06:28:36,001 INFO L290 TraceCheckUtils]: 14: Hoare triple {23376#(<= main_~c~0 2)} assume !!(~c~0 < 200000); {23376#(<= main_~c~0 2)} is VALID [2022-04-15 06:28:36,001 INFO L290 TraceCheckUtils]: 15: Hoare triple {23376#(<= main_~c~0 2)} assume !(~c~0 == ~last~0); {23376#(<= main_~c~0 2)} is VALID [2022-04-15 06:28:36,002 INFO L290 TraceCheckUtils]: 16: Hoare triple {23376#(<= main_~c~0 2)} #t~post5 := ~c~0;~c~0 := 1 + #t~post5;havoc #t~post5; {23377#(<= main_~c~0 3)} is VALID [2022-04-15 06:28:36,002 INFO L290 TraceCheckUtils]: 17: Hoare triple {23377#(<= main_~c~0 3)} assume !!(~c~0 < 200000); {23377#(<= main_~c~0 3)} is VALID [2022-04-15 06:28:36,002 INFO L290 TraceCheckUtils]: 18: Hoare triple {23377#(<= main_~c~0 3)} assume !(~c~0 == ~last~0); {23377#(<= main_~c~0 3)} is VALID [2022-04-15 06:28:36,002 INFO L290 TraceCheckUtils]: 19: Hoare triple {23377#(<= main_~c~0 3)} #t~post5 := ~c~0;~c~0 := 1 + #t~post5;havoc #t~post5; {23378#(<= main_~c~0 4)} is VALID [2022-04-15 06:28:36,003 INFO L290 TraceCheckUtils]: 20: Hoare triple {23378#(<= main_~c~0 4)} assume !!(~c~0 < 200000); {23378#(<= main_~c~0 4)} is VALID [2022-04-15 06:28:36,003 INFO L290 TraceCheckUtils]: 21: Hoare triple {23378#(<= main_~c~0 4)} assume !(~c~0 == ~last~0); {23378#(<= main_~c~0 4)} is VALID [2022-04-15 06:28:36,003 INFO L290 TraceCheckUtils]: 22: Hoare triple {23378#(<= main_~c~0 4)} #t~post5 := ~c~0;~c~0 := 1 + #t~post5;havoc #t~post5; {23379#(<= main_~c~0 5)} is VALID [2022-04-15 06:28:36,003 INFO L290 TraceCheckUtils]: 23: Hoare triple {23379#(<= main_~c~0 5)} assume !!(~c~0 < 200000); {23379#(<= main_~c~0 5)} is VALID [2022-04-15 06:28:36,004 INFO L290 TraceCheckUtils]: 24: Hoare triple {23379#(<= main_~c~0 5)} assume !(~c~0 == ~last~0); {23379#(<= main_~c~0 5)} is VALID [2022-04-15 06:28:36,004 INFO L290 TraceCheckUtils]: 25: Hoare triple {23379#(<= main_~c~0 5)} #t~post5 := ~c~0;~c~0 := 1 + #t~post5;havoc #t~post5; {23380#(<= main_~c~0 6)} is VALID [2022-04-15 06:28:36,004 INFO L290 TraceCheckUtils]: 26: Hoare triple {23380#(<= main_~c~0 6)} assume !!(~c~0 < 200000); {23380#(<= main_~c~0 6)} is VALID [2022-04-15 06:28:36,004 INFO L290 TraceCheckUtils]: 27: Hoare triple {23380#(<= main_~c~0 6)} assume !(~c~0 == ~last~0); {23380#(<= main_~c~0 6)} is VALID [2022-04-15 06:28:36,005 INFO L290 TraceCheckUtils]: 28: Hoare triple {23380#(<= main_~c~0 6)} #t~post5 := ~c~0;~c~0 := 1 + #t~post5;havoc #t~post5; {23381#(<= main_~c~0 7)} is VALID [2022-04-15 06:28:36,005 INFO L290 TraceCheckUtils]: 29: Hoare triple {23381#(<= main_~c~0 7)} assume !(~c~0 < 200000); {23370#false} is VALID [2022-04-15 06:28:36,005 INFO L290 TraceCheckUtils]: 30: Hoare triple {23370#false} assume 0 == ~st~0 && ~c~0 == 1 + ~last~0;~a~0 := 3 + ~a~0;~b~0 := 3 + ~b~0; {23370#false} is VALID [2022-04-15 06:28:36,005 INFO L290 TraceCheckUtils]: 31: Hoare triple {23370#false} assume !(~c~0 == ~last~0 && 0 == ~st~0); {23370#false} is VALID [2022-04-15 06:28:36,005 INFO L272 TraceCheckUtils]: 32: Hoare triple {23370#false} call __VERIFIER_assert((if ~a~0 == ~b~0 && 200000 == ~c~0 then 1 else 0)); {23370#false} is VALID [2022-04-15 06:28:36,005 INFO L290 TraceCheckUtils]: 33: Hoare triple {23370#false} ~cond := #in~cond; {23370#false} is VALID [2022-04-15 06:28:36,005 INFO L290 TraceCheckUtils]: 34: Hoare triple {23370#false} assume 0 == ~cond; {23370#false} is VALID [2022-04-15 06:28:36,005 INFO L290 TraceCheckUtils]: 35: Hoare triple {23370#false} assume !false; {23370#false} is VALID [2022-04-15 06:28:36,005 INFO L134 CoverageAnalysis]: Checked inductivity of 70 backedges. 0 proven. 70 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 06:28:36,005 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 06:28:36,005 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1280687934] [2022-04-15 06:28:36,006 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1280687934] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 06:28:36,006 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [410969925] [2022-04-15 06:28:36,006 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 06:28:36,006 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 06:28:36,006 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 06:28:36,007 INFO L229 MonitoredProcess]: Starting monitored process 23 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-15 06:28:36,008 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (23)] Waiting until timeout for monitored process [2022-04-15 06:28:36,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:28:36,037 INFO L263 TraceCheckSpWp]: Trace formula consists of 114 conjuncts, 9 conjunts are in the unsatisfiable core [2022-04-15 06:28:36,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:28:36,044 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 06:28:36,159 INFO L272 TraceCheckUtils]: 0: Hoare triple {23369#true} call ULTIMATE.init(); {23369#true} is VALID [2022-04-15 06:28:36,159 INFO L290 TraceCheckUtils]: 1: Hoare triple {23369#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(11, 2);call #Ultimate.allocInit(12, 3);~last~0 := 0; {23369#true} is VALID [2022-04-15 06:28:36,160 INFO L290 TraceCheckUtils]: 2: Hoare triple {23369#true} assume true; {23369#true} is VALID [2022-04-15 06:28:36,160 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {23369#true} {23369#true} #66#return; {23369#true} is VALID [2022-04-15 06:28:36,160 INFO L272 TraceCheckUtils]: 4: Hoare triple {23369#true} call #t~ret6 := main(); {23369#true} is VALID [2022-04-15 06:28:36,160 INFO L290 TraceCheckUtils]: 5: Hoare triple {23369#true} assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~last~0 := #t~nondet4;havoc #t~nondet4;~a~0 := 0;~b~0 := 0;~c~0 := 0;~st~0 := 0; {23369#true} is VALID [2022-04-15 06:28:36,160 INFO L290 TraceCheckUtils]: 6: Hoare triple {23369#true} [152] L30-->L23-3_primed: Formula: (let ((.cse0 (= |v_main_#t~post5_293| |v_main_#t~post5_286|)) (.cse1 (= v_main_~b~0_113 v_main_~b~0_112)) (.cse2 (= v_main_~a~0_116 v_main_~a~0_115))) (or (and .cse0 .cse1 (= v_main_~c~0_569 v_main_~c~0_577) (= v_main_~st~0_219 v_main_~st~0_221) .cse2) (and .cse0 (= v_main_~c~0_577 v_main_~c~0_569) .cse1 .cse2 (= v_main_~st~0_221 v_main_~st~0_219)))) InVars {main_~c~0=v_main_~c~0_577, main_#t~post5=|v_main_#t~post5_293|, main_~st~0=v_main_~st~0_221, main_~b~0=v_main_~b~0_113, main_~a~0=v_main_~a~0_116} OutVars{main_~c~0=v_main_~c~0_569, main_#t~post5=|v_main_#t~post5_286|, main_~st~0=v_main_~st~0_219, main_~b~0=v_main_~b~0_112, main_~a~0=v_main_~a~0_115} AuxVars[] AssignedVars[main_~c~0, main_#t~post5, main_~st~0, main_~b~0, main_~a~0] {23369#true} is VALID [2022-04-15 06:28:36,160 INFO L290 TraceCheckUtils]: 7: Hoare triple {23369#true} [151] L23-3_primed-->L23-3: Formula: (and (= v_main_~c~0_7 0) (= v_main_~st~0_6 1)) InVars {} OutVars{main_~c~0=v_main_~c~0_7, main_~st~0=v_main_~st~0_6} AuxVars[] AssignedVars[main_~c~0, main_~st~0] {23407#(<= main_~c~0 0)} is VALID [2022-04-15 06:28:36,160 INFO L290 TraceCheckUtils]: 8: Hoare triple {23407#(<= main_~c~0 0)} assume !!(~c~0 < 200000); {23407#(<= main_~c~0 0)} is VALID [2022-04-15 06:28:36,161 INFO L290 TraceCheckUtils]: 9: Hoare triple {23407#(<= main_~c~0 0)} assume ~c~0 == ~last~0;~st~0 := 0; {23407#(<= main_~c~0 0)} is VALID [2022-04-15 06:28:36,161 INFO L290 TraceCheckUtils]: 10: Hoare triple {23407#(<= main_~c~0 0)} #t~post5 := ~c~0;~c~0 := 1 + #t~post5;havoc #t~post5; {23375#(<= main_~c~0 1)} is VALID [2022-04-15 06:28:36,161 INFO L290 TraceCheckUtils]: 11: Hoare triple {23375#(<= main_~c~0 1)} assume !!(~c~0 < 200000); {23375#(<= main_~c~0 1)} is VALID [2022-04-15 06:28:36,161 INFO L290 TraceCheckUtils]: 12: Hoare triple {23375#(<= main_~c~0 1)} assume !(~c~0 == ~last~0); {23375#(<= main_~c~0 1)} is VALID [2022-04-15 06:28:36,162 INFO L290 TraceCheckUtils]: 13: Hoare triple {23375#(<= main_~c~0 1)} #t~post5 := ~c~0;~c~0 := 1 + #t~post5;havoc #t~post5; {23376#(<= main_~c~0 2)} is VALID [2022-04-15 06:28:36,162 INFO L290 TraceCheckUtils]: 14: Hoare triple {23376#(<= main_~c~0 2)} assume !!(~c~0 < 200000); {23376#(<= main_~c~0 2)} is VALID [2022-04-15 06:28:36,162 INFO L290 TraceCheckUtils]: 15: Hoare triple {23376#(<= main_~c~0 2)} assume !(~c~0 == ~last~0); {23376#(<= main_~c~0 2)} is VALID [2022-04-15 06:28:36,163 INFO L290 TraceCheckUtils]: 16: Hoare triple {23376#(<= main_~c~0 2)} #t~post5 := ~c~0;~c~0 := 1 + #t~post5;havoc #t~post5; {23377#(<= main_~c~0 3)} is VALID [2022-04-15 06:28:36,163 INFO L290 TraceCheckUtils]: 17: Hoare triple {23377#(<= main_~c~0 3)} assume !!(~c~0 < 200000); {23377#(<= main_~c~0 3)} is VALID [2022-04-15 06:28:36,163 INFO L290 TraceCheckUtils]: 18: Hoare triple {23377#(<= main_~c~0 3)} assume !(~c~0 == ~last~0); {23377#(<= main_~c~0 3)} is VALID [2022-04-15 06:28:36,163 INFO L290 TraceCheckUtils]: 19: Hoare triple {23377#(<= main_~c~0 3)} #t~post5 := ~c~0;~c~0 := 1 + #t~post5;havoc #t~post5; {23378#(<= main_~c~0 4)} is VALID [2022-04-15 06:28:36,164 INFO L290 TraceCheckUtils]: 20: Hoare triple {23378#(<= main_~c~0 4)} assume !!(~c~0 < 200000); {23378#(<= main_~c~0 4)} is VALID [2022-04-15 06:28:36,164 INFO L290 TraceCheckUtils]: 21: Hoare triple {23378#(<= main_~c~0 4)} assume !(~c~0 == ~last~0); {23378#(<= main_~c~0 4)} is VALID [2022-04-15 06:28:36,164 INFO L290 TraceCheckUtils]: 22: Hoare triple {23378#(<= main_~c~0 4)} #t~post5 := ~c~0;~c~0 := 1 + #t~post5;havoc #t~post5; {23379#(<= main_~c~0 5)} is VALID [2022-04-15 06:28:36,165 INFO L290 TraceCheckUtils]: 23: Hoare triple {23379#(<= main_~c~0 5)} assume !!(~c~0 < 200000); {23379#(<= main_~c~0 5)} is VALID [2022-04-15 06:28:36,165 INFO L290 TraceCheckUtils]: 24: Hoare triple {23379#(<= main_~c~0 5)} assume !(~c~0 == ~last~0); {23379#(<= main_~c~0 5)} is VALID [2022-04-15 06:28:36,165 INFO L290 TraceCheckUtils]: 25: Hoare triple {23379#(<= main_~c~0 5)} #t~post5 := ~c~0;~c~0 := 1 + #t~post5;havoc #t~post5; {23380#(<= main_~c~0 6)} is VALID [2022-04-15 06:28:36,165 INFO L290 TraceCheckUtils]: 26: Hoare triple {23380#(<= main_~c~0 6)} assume !!(~c~0 < 200000); {23380#(<= main_~c~0 6)} is VALID [2022-04-15 06:28:36,166 INFO L290 TraceCheckUtils]: 27: Hoare triple {23380#(<= main_~c~0 6)} assume !(~c~0 == ~last~0); {23380#(<= main_~c~0 6)} is VALID [2022-04-15 06:28:36,166 INFO L290 TraceCheckUtils]: 28: Hoare triple {23380#(<= main_~c~0 6)} #t~post5 := ~c~0;~c~0 := 1 + #t~post5;havoc #t~post5; {23381#(<= main_~c~0 7)} is VALID [2022-04-15 06:28:36,166 INFO L290 TraceCheckUtils]: 29: Hoare triple {23381#(<= main_~c~0 7)} assume !(~c~0 < 200000); {23370#false} is VALID [2022-04-15 06:28:36,166 INFO L290 TraceCheckUtils]: 30: Hoare triple {23370#false} assume 0 == ~st~0 && ~c~0 == 1 + ~last~0;~a~0 := 3 + ~a~0;~b~0 := 3 + ~b~0; {23370#false} is VALID [2022-04-15 06:28:36,166 INFO L290 TraceCheckUtils]: 31: Hoare triple {23370#false} assume !(~c~0 == ~last~0 && 0 == ~st~0); {23370#false} is VALID [2022-04-15 06:28:36,166 INFO L272 TraceCheckUtils]: 32: Hoare triple {23370#false} call __VERIFIER_assert((if ~a~0 == ~b~0 && 200000 == ~c~0 then 1 else 0)); {23370#false} is VALID [2022-04-15 06:28:36,167 INFO L290 TraceCheckUtils]: 33: Hoare triple {23370#false} ~cond := #in~cond; {23370#false} is VALID [2022-04-15 06:28:36,167 INFO L290 TraceCheckUtils]: 34: Hoare triple {23370#false} assume 0 == ~cond; {23370#false} is VALID [2022-04-15 06:28:36,167 INFO L290 TraceCheckUtils]: 35: Hoare triple {23370#false} assume !false; {23370#false} is VALID [2022-04-15 06:28:36,167 INFO L134 CoverageAnalysis]: Checked inductivity of 70 backedges. 0 proven. 70 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 06:28:36,167 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 06:28:36,419 INFO L290 TraceCheckUtils]: 35: Hoare triple {23370#false} assume !false; {23370#false} is VALID [2022-04-15 06:28:36,419 INFO L290 TraceCheckUtils]: 34: Hoare triple {23370#false} assume 0 == ~cond; {23370#false} is VALID [2022-04-15 06:28:36,419 INFO L290 TraceCheckUtils]: 33: Hoare triple {23370#false} ~cond := #in~cond; {23370#false} is VALID [2022-04-15 06:28:36,419 INFO L272 TraceCheckUtils]: 32: Hoare triple {23370#false} call __VERIFIER_assert((if ~a~0 == ~b~0 && 200000 == ~c~0 then 1 else 0)); {23370#false} is VALID [2022-04-15 06:28:36,419 INFO L290 TraceCheckUtils]: 31: Hoare triple {23370#false} assume !(~c~0 == ~last~0 && 0 == ~st~0); {23370#false} is VALID [2022-04-15 06:28:36,419 INFO L290 TraceCheckUtils]: 30: Hoare triple {23370#false} assume 0 == ~st~0 && ~c~0 == 1 + ~last~0;~a~0 := 3 + ~a~0;~b~0 := 3 + ~b~0; {23370#false} is VALID [2022-04-15 06:28:36,420 INFO L290 TraceCheckUtils]: 29: Hoare triple {23510#(< main_~c~0 200000)} assume !(~c~0 < 200000); {23370#false} is VALID [2022-04-15 06:28:36,420 INFO L290 TraceCheckUtils]: 28: Hoare triple {23514#(< main_~c~0 199999)} #t~post5 := ~c~0;~c~0 := 1 + #t~post5;havoc #t~post5; {23510#(< main_~c~0 200000)} is VALID [2022-04-15 06:28:36,420 INFO L290 TraceCheckUtils]: 27: Hoare triple {23514#(< main_~c~0 199999)} assume !(~c~0 == ~last~0); {23514#(< main_~c~0 199999)} is VALID [2022-04-15 06:28:36,421 INFO L290 TraceCheckUtils]: 26: Hoare triple {23514#(< main_~c~0 199999)} assume !!(~c~0 < 200000); {23514#(< main_~c~0 199999)} is VALID [2022-04-15 06:28:36,421 INFO L290 TraceCheckUtils]: 25: Hoare triple {23524#(< main_~c~0 199998)} #t~post5 := ~c~0;~c~0 := 1 + #t~post5;havoc #t~post5; {23514#(< main_~c~0 199999)} is VALID [2022-04-15 06:28:36,421 INFO L290 TraceCheckUtils]: 24: Hoare triple {23524#(< main_~c~0 199998)} assume !(~c~0 == ~last~0); {23524#(< main_~c~0 199998)} is VALID [2022-04-15 06:28:36,422 INFO L290 TraceCheckUtils]: 23: Hoare triple {23524#(< main_~c~0 199998)} assume !!(~c~0 < 200000); {23524#(< main_~c~0 199998)} is VALID [2022-04-15 06:28:36,422 INFO L290 TraceCheckUtils]: 22: Hoare triple {23534#(< main_~c~0 199997)} #t~post5 := ~c~0;~c~0 := 1 + #t~post5;havoc #t~post5; {23524#(< main_~c~0 199998)} is VALID [2022-04-15 06:28:36,423 INFO L290 TraceCheckUtils]: 21: Hoare triple {23534#(< main_~c~0 199997)} assume !(~c~0 == ~last~0); {23534#(< main_~c~0 199997)} is VALID [2022-04-15 06:28:36,423 INFO L290 TraceCheckUtils]: 20: Hoare triple {23534#(< main_~c~0 199997)} assume !!(~c~0 < 200000); {23534#(< main_~c~0 199997)} is VALID [2022-04-15 06:28:36,423 INFO L290 TraceCheckUtils]: 19: Hoare triple {23544#(< main_~c~0 199996)} #t~post5 := ~c~0;~c~0 := 1 + #t~post5;havoc #t~post5; {23534#(< main_~c~0 199997)} is VALID [2022-04-15 06:28:36,424 INFO L290 TraceCheckUtils]: 18: Hoare triple {23544#(< main_~c~0 199996)} assume !(~c~0 == ~last~0); {23544#(< main_~c~0 199996)} is VALID [2022-04-15 06:28:36,424 INFO L290 TraceCheckUtils]: 17: Hoare triple {23544#(< main_~c~0 199996)} assume !!(~c~0 < 200000); {23544#(< main_~c~0 199996)} is VALID [2022-04-15 06:28:36,424 INFO L290 TraceCheckUtils]: 16: Hoare triple {23554#(< main_~c~0 199995)} #t~post5 := ~c~0;~c~0 := 1 + #t~post5;havoc #t~post5; {23544#(< main_~c~0 199996)} is VALID [2022-04-15 06:28:36,425 INFO L290 TraceCheckUtils]: 15: Hoare triple {23554#(< main_~c~0 199995)} assume !(~c~0 == ~last~0); {23554#(< main_~c~0 199995)} is VALID [2022-04-15 06:28:36,425 INFO L290 TraceCheckUtils]: 14: Hoare triple {23554#(< main_~c~0 199995)} assume !!(~c~0 < 200000); {23554#(< main_~c~0 199995)} is VALID [2022-04-15 06:28:36,425 INFO L290 TraceCheckUtils]: 13: Hoare triple {23564#(< main_~c~0 199994)} #t~post5 := ~c~0;~c~0 := 1 + #t~post5;havoc #t~post5; {23554#(< main_~c~0 199995)} is VALID [2022-04-15 06:28:36,425 INFO L290 TraceCheckUtils]: 12: Hoare triple {23564#(< main_~c~0 199994)} assume !(~c~0 == ~last~0); {23564#(< main_~c~0 199994)} is VALID [2022-04-15 06:28:36,426 INFO L290 TraceCheckUtils]: 11: Hoare triple {23564#(< main_~c~0 199994)} assume !!(~c~0 < 200000); {23564#(< main_~c~0 199994)} is VALID [2022-04-15 06:28:36,426 INFO L290 TraceCheckUtils]: 10: Hoare triple {23574#(< main_~c~0 199993)} #t~post5 := ~c~0;~c~0 := 1 + #t~post5;havoc #t~post5; {23564#(< main_~c~0 199994)} is VALID [2022-04-15 06:28:36,429 INFO L290 TraceCheckUtils]: 9: Hoare triple {23574#(< main_~c~0 199993)} assume ~c~0 == ~last~0;~st~0 := 0; {23574#(< main_~c~0 199993)} is VALID [2022-04-15 06:28:36,429 INFO L290 TraceCheckUtils]: 8: Hoare triple {23574#(< main_~c~0 199993)} assume !!(~c~0 < 200000); {23574#(< main_~c~0 199993)} is VALID [2022-04-15 06:28:36,429 INFO L290 TraceCheckUtils]: 7: Hoare triple {23369#true} [151] L23-3_primed-->L23-3: Formula: (and (= v_main_~c~0_7 0) (= v_main_~st~0_6 1)) InVars {} OutVars{main_~c~0=v_main_~c~0_7, main_~st~0=v_main_~st~0_6} AuxVars[] AssignedVars[main_~c~0, main_~st~0] {23574#(< main_~c~0 199993)} is VALID [2022-04-15 06:28:36,429 INFO L290 TraceCheckUtils]: 6: Hoare triple {23369#true} [152] L30-->L23-3_primed: Formula: (let ((.cse0 (= |v_main_#t~post5_293| |v_main_#t~post5_286|)) (.cse1 (= v_main_~b~0_113 v_main_~b~0_112)) (.cse2 (= v_main_~a~0_116 v_main_~a~0_115))) (or (and .cse0 .cse1 (= v_main_~c~0_569 v_main_~c~0_577) (= v_main_~st~0_219 v_main_~st~0_221) .cse2) (and .cse0 (= v_main_~c~0_577 v_main_~c~0_569) .cse1 .cse2 (= v_main_~st~0_221 v_main_~st~0_219)))) InVars {main_~c~0=v_main_~c~0_577, main_#t~post5=|v_main_#t~post5_293|, main_~st~0=v_main_~st~0_221, main_~b~0=v_main_~b~0_113, main_~a~0=v_main_~a~0_116} OutVars{main_~c~0=v_main_~c~0_569, main_#t~post5=|v_main_#t~post5_286|, main_~st~0=v_main_~st~0_219, main_~b~0=v_main_~b~0_112, main_~a~0=v_main_~a~0_115} AuxVars[] AssignedVars[main_~c~0, main_#t~post5, main_~st~0, main_~b~0, main_~a~0] {23369#true} is VALID [2022-04-15 06:28:36,430 INFO L290 TraceCheckUtils]: 5: Hoare triple {23369#true} assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~last~0 := #t~nondet4;havoc #t~nondet4;~a~0 := 0;~b~0 := 0;~c~0 := 0;~st~0 := 0; {23369#true} is VALID [2022-04-15 06:28:36,430 INFO L272 TraceCheckUtils]: 4: Hoare triple {23369#true} call #t~ret6 := main(); {23369#true} is VALID [2022-04-15 06:28:36,430 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {23369#true} {23369#true} #66#return; {23369#true} is VALID [2022-04-15 06:28:36,430 INFO L290 TraceCheckUtils]: 2: Hoare triple {23369#true} assume true; {23369#true} is VALID [2022-04-15 06:28:36,430 INFO L290 TraceCheckUtils]: 1: Hoare triple {23369#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(11, 2);call #Ultimate.allocInit(12, 3);~last~0 := 0; {23369#true} is VALID [2022-04-15 06:28:36,430 INFO L272 TraceCheckUtils]: 0: Hoare triple {23369#true} call ULTIMATE.init(); {23369#true} is VALID [2022-04-15 06:28:36,430 INFO L134 CoverageAnalysis]: Checked inductivity of 70 backedges. 0 proven. 70 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 06:28:36,430 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [410969925] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 06:28:36,430 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 06:28:36,430 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10, 10] total 20 [2022-04-15 06:28:36,639 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 06:28:36,640 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1955244730] [2022-04-15 06:28:36,640 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1955244730] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 06:28:36,640 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 06:28:36,640 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [20] imperfect sequences [] total 20 [2022-04-15 06:28:36,640 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [133397065] [2022-04-15 06:28:36,640 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 06:28:36,640 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 20 states have (on average 2.85) internal successors, (57), 19 states have internal predecessors, (57), 2 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 65 [2022-04-15 06:28:36,640 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 06:28:36,640 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 20 states, 20 states have (on average 2.85) internal successors, (57), 19 states have internal predecessors, (57), 2 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-15 06:28:36,680 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 62 edges. 62 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 06:28:36,681 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2022-04-15 06:28:36,681 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 06:28:36,681 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2022-04-15 06:28:36,681 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=309, Invalid=503, Unknown=0, NotChecked=0, Total=812 [2022-04-15 06:28:36,682 INFO L87 Difference]: Start difference. First operand 197 states and 232 transitions. Second operand has 20 states, 20 states have (on average 2.85) internal successors, (57), 19 states have internal predecessors, (57), 2 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-15 06:28:38,010 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:28:38,010 INFO L93 Difference]: Finished difference Result 333 states and 395 transitions. [2022-04-15 06:28:38,011 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2022-04-15 06:28:38,011 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 20 states have (on average 2.85) internal successors, (57), 19 states have internal predecessors, (57), 2 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 65 [2022-04-15 06:28:38,011 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 06:28:38,011 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20 states, 20 states have (on average 2.85) internal successors, (57), 19 states have internal predecessors, (57), 2 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-15 06:28:38,012 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 95 transitions. [2022-04-15 06:28:38,012 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20 states, 20 states have (on average 2.85) internal successors, (57), 19 states have internal predecessors, (57), 2 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-15 06:28:38,013 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 95 transitions. [2022-04-15 06:28:38,013 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 20 states and 95 transitions. [2022-04-15 06:28:38,069 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 95 edges. 95 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 06:28:38,073 INFO L225 Difference]: With dead ends: 333 [2022-04-15 06:28:38,073 INFO L226 Difference]: Without dead ends: 269 [2022-04-15 06:28:38,073 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 121 GetRequests, 87 SyntacticMatches, 7 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 559 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=309, Invalid=503, Unknown=0, NotChecked=0, Total=812 [2022-04-15 06:28:38,074 INFO L913 BasicCegarLoop]: 18 mSDtfsCounter, 52 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 276 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 52 SdHoareTripleChecker+Valid, 30 SdHoareTripleChecker+Invalid, 287 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 276 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-04-15 06:28:38,075 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [52 Valid, 30 Invalid, 287 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 276 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-04-15 06:28:38,075 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 269 states. [2022-04-15 06:28:38,606 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 269 to 226. [2022-04-15 06:28:38,607 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 06:28:38,607 INFO L82 GeneralOperation]: Start isEquivalent. First operand 269 states. Second operand has 226 states, 218 states have (on average 1.1743119266055047) internal successors, (256), 219 states have internal predecessors, (256), 4 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-15 06:28:38,607 INFO L74 IsIncluded]: Start isIncluded. First operand 269 states. Second operand has 226 states, 218 states have (on average 1.1743119266055047) internal successors, (256), 219 states have internal predecessors, (256), 4 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-15 06:28:38,607 INFO L87 Difference]: Start difference. First operand 269 states. Second operand has 226 states, 218 states have (on average 1.1743119266055047) internal successors, (256), 219 states have internal predecessors, (256), 4 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-15 06:28:38,610 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:28:38,610 INFO L93 Difference]: Finished difference Result 269 states and 308 transitions. [2022-04-15 06:28:38,610 INFO L276 IsEmpty]: Start isEmpty. Operand 269 states and 308 transitions. [2022-04-15 06:28:38,611 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 06:28:38,611 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 06:28:38,611 INFO L74 IsIncluded]: Start isIncluded. First operand has 226 states, 218 states have (on average 1.1743119266055047) internal successors, (256), 219 states have internal predecessors, (256), 4 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) Second operand 269 states. [2022-04-15 06:28:38,611 INFO L87 Difference]: Start difference. First operand has 226 states, 218 states have (on average 1.1743119266055047) internal successors, (256), 219 states have internal predecessors, (256), 4 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) Second operand 269 states. [2022-04-15 06:28:38,614 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:28:38,614 INFO L93 Difference]: Finished difference Result 269 states and 308 transitions. [2022-04-15 06:28:38,614 INFO L276 IsEmpty]: Start isEmpty. Operand 269 states and 308 transitions. [2022-04-15 06:28:38,614 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 06:28:38,614 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 06:28:38,614 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 06:28:38,614 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 06:28:38,615 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 226 states, 218 states have (on average 1.1743119266055047) internal successors, (256), 219 states have internal predecessors, (256), 4 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-15 06:28:38,617 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 226 states to 226 states and 263 transitions. [2022-04-15 06:28:38,617 INFO L78 Accepts]: Start accepts. Automaton has 226 states and 263 transitions. Word has length 65 [2022-04-15 06:28:38,617 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 06:28:38,617 INFO L478 AbstractCegarLoop]: Abstraction has 226 states and 263 transitions. [2022-04-15 06:28:38,617 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 2.85) internal successors, (57), 19 states have internal predecessors, (57), 2 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-15 06:28:38,617 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 226 states and 263 transitions. [2022-04-15 06:28:39,108 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 263 edges. 263 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 06:28:39,108 INFO L276 IsEmpty]: Start isEmpty. Operand 226 states and 263 transitions. [2022-04-15 06:28:39,109 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2022-04-15 06:28:39,109 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 06:28:39,109 INFO L499 BasicCegarLoop]: trace histogram [17, 17, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 06:28:39,125 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (23)] Ended with exit code 0 [2022-04-15 06:28:39,321 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 23 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable26 [2022-04-15 06:28:39,321 INFO L403 AbstractCegarLoop]: === Iteration 28 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 06:28:39,321 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 06:28:39,321 INFO L85 PathProgramCache]: Analyzing trace with hash 189142052, now seen corresponding path program 16 times [2022-04-15 06:28:39,321 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 06:28:39,321 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1639293680] [2022-04-15 06:28:40,345 WARN L970 rdanLoopAcceleration]: Unable to prove correctness of quantifier elimination. [2022-04-15 06:28:40,442 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 1 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-15 06:28:40,582 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {0={1=1}, 1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-15 06:28:40,583 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-15 06:28:40,586 INFO L85 PathProgramCache]: Analyzing trace with hash 2091434440, now seen corresponding path program 1 times [2022-04-15 06:28:40,586 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 06:28:40,586 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1133627317] [2022-04-15 06:28:40,586 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 06:28:40,586 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 06:28:40,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:28:40,734 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 06:28:40,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:28:40,739 INFO L290 TraceCheckUtils]: 0: Hoare triple {25284#(and (= ~last~0 |old(~last~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(11, 2);call #Ultimate.allocInit(12, 3);~last~0 := 0; {25272#true} is VALID [2022-04-15 06:28:40,739 INFO L290 TraceCheckUtils]: 1: Hoare triple {25272#true} assume true; {25272#true} is VALID [2022-04-15 06:28:40,739 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {25272#true} {25272#true} #66#return; {25272#true} is VALID [2022-04-15 06:28:40,739 INFO L272 TraceCheckUtils]: 0: Hoare triple {25272#true} call ULTIMATE.init(); {25284#(and (= ~last~0 |old(~last~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 06:28:40,739 INFO L290 TraceCheckUtils]: 1: Hoare triple {25284#(and (= ~last~0 |old(~last~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(11, 2);call #Ultimate.allocInit(12, 3);~last~0 := 0; {25272#true} is VALID [2022-04-15 06:28:40,740 INFO L290 TraceCheckUtils]: 2: Hoare triple {25272#true} assume true; {25272#true} is VALID [2022-04-15 06:28:40,740 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {25272#true} {25272#true} #66#return; {25272#true} is VALID [2022-04-15 06:28:40,740 INFO L272 TraceCheckUtils]: 4: Hoare triple {25272#true} call #t~ret6 := main(); {25272#true} is VALID [2022-04-15 06:28:40,740 INFO L290 TraceCheckUtils]: 5: Hoare triple {25272#true} assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~last~0 := #t~nondet4;havoc #t~nondet4;~a~0 := 0;~b~0 := 0;~c~0 := 0;~st~0 := 0; {25277#(and (= main_~a~0 0) (= main_~b~0 0))} is VALID [2022-04-15 06:28:40,740 INFO L290 TraceCheckUtils]: 6: Hoare triple {25277#(and (= main_~a~0 0) (= main_~b~0 0))} assume !false;~st~0 := 1;~c~0 := 0; {25278#(and (= main_~a~0 0) (= main_~st~0 1) (= main_~b~0 0))} is VALID [2022-04-15 06:28:40,741 INFO L290 TraceCheckUtils]: 7: Hoare triple {25278#(and (= main_~a~0 0) (= main_~st~0 1) (= main_~b~0 0))} [154] L23-3-->L23-4_primed: Formula: (let ((.cse0 (= |v_main_#t~post5_306| |v_main_#t~post5_304|)) (.cse1 (= v_main_~c~0_604 v_main_~c~0_603)) (.cse2 (= v_~last~0_176 v_main_~c~0_604))) (or (and .cse0 .cse1 (= v_~last~0_176 v_~last~0_176)) (and (not .cse2) (< v_main_~c~0_603 200001) (< v_main_~c~0_604 v_main_~c~0_603) (or (not (<= (+ v_main_~c~0_604 1) v_~last~0_176)) (not (<= (+ v_~last~0_176 1) v_main_~c~0_603)))) (and .cse0 .cse1 (or (not (< v_main_~c~0_604 200000)) .cse2)))) InVars {main_~c~0=v_main_~c~0_604, main_#t~post5=|v_main_#t~post5_306|, ~last~0=v_~last~0_176} OutVars{main_#t~post5=|v_main_#t~post5_304|, main_~c~0=v_main_~c~0_603, ~last~0=v_~last~0_176} AuxVars[] AssignedVars[main_#t~post5, main_~c~0] {25278#(and (= main_~a~0 0) (= main_~st~0 1) (= main_~b~0 0))} is VALID [2022-04-15 06:28:40,747 INFO L290 TraceCheckUtils]: 8: Hoare triple {25278#(and (= main_~a~0 0) (= main_~st~0 1) (= main_~b~0 0))} [155] L23-4_primed-->L23-3: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {25278#(and (= main_~a~0 0) (= main_~st~0 1) (= main_~b~0 0))} is VALID [2022-04-15 06:28:40,748 INFO L290 TraceCheckUtils]: 9: Hoare triple {25278#(and (= main_~a~0 0) (= main_~st~0 1) (= main_~b~0 0))} [156] L23-3-->L23-4_primed: Formula: (let ((.cse0 (= v_main_~st~0_229 v_main_~st~0_228)) (.cse1 (= |v_main_#t~post5_309| |v_main_#t~post5_305|)) (.cse2 (= v_main_~c~0_606 v_main_~c~0_605)) (.cse4 (= v_~last~0_177 v_main_~c~0_606)) (.cse3 (< v_main_~c~0_606 200000))) (or (and .cse0 .cse1 .cse2 (or (not .cse3) (not .cse4))) (and .cse0 .cse1 .cse2 (= v_~last~0_177 v_~last~0_177)) (and (<= v_main_~c~0_605 (+ v_~last~0_177 1)) .cse4 .cse3 (= v_main_~st~0_228 0) (< v_main_~c~0_606 v_main_~c~0_605)))) InVars {main_~c~0=v_main_~c~0_606, main_#t~post5=|v_main_#t~post5_309|, main_~st~0=v_main_~st~0_229, ~last~0=v_~last~0_177} OutVars{main_#t~post5=|v_main_#t~post5_305|, main_~c~0=v_main_~c~0_605, main_~st~0=v_main_~st~0_228, ~last~0=v_~last~0_177} AuxVars[] AssignedVars[main_#t~post5, main_~c~0, main_~st~0] {25279#(or (= main_~st~0 1) (and (= main_~a~0 0) (or (<= ~last~0 199999) (<= main_~c~0 200000)) (= main_~b~0 0)))} is VALID [2022-04-15 06:28:40,748 INFO L290 TraceCheckUtils]: 10: Hoare triple {25279#(or (= main_~st~0 1) (and (= main_~a~0 0) (or (<= ~last~0 199999) (<= main_~c~0 200000)) (= main_~b~0 0)))} [153] L23-4_primed-->L23-4: Formula: (not (< v_main_~c~0_8 200000)) InVars {main_~c~0=v_main_~c~0_8} OutVars{main_~c~0=v_main_~c~0_8} AuxVars[] AssignedVars[] {25280#(or (= main_~st~0 1) (and (= main_~a~0 0) (or (<= ~last~0 199999) (<= main_~c~0 200000)) (= main_~b~0 0) (< 199999 main_~c~0)))} is VALID [2022-04-15 06:28:40,749 INFO L290 TraceCheckUtils]: 11: Hoare triple {25280#(or (= main_~st~0 1) (and (= main_~a~0 0) (or (<= ~last~0 199999) (<= main_~c~0 200000)) (= main_~b~0 0) (< 199999 main_~c~0)))} assume 0 == ~st~0 && ~c~0 == 1 + ~last~0;~a~0 := 3 + ~a~0;~b~0 := 3 + ~b~0; {25281#(and (<= main_~b~0 main_~a~0) (< main_~a~0 (+ main_~b~0 1)) (< 199999 main_~c~0) (<= main_~c~0 200000))} is VALID [2022-04-15 06:28:40,750 INFO L290 TraceCheckUtils]: 12: Hoare triple {25281#(and (<= main_~b~0 main_~a~0) (< main_~a~0 (+ main_~b~0 1)) (< 199999 main_~c~0) (<= main_~c~0 200000))} assume !(~c~0 == ~last~0 && 0 == ~st~0); {25281#(and (<= main_~b~0 main_~a~0) (< main_~a~0 (+ main_~b~0 1)) (< 199999 main_~c~0) (<= main_~c~0 200000))} is VALID [2022-04-15 06:28:40,750 INFO L272 TraceCheckUtils]: 13: Hoare triple {25281#(and (<= main_~b~0 main_~a~0) (< main_~a~0 (+ main_~b~0 1)) (< 199999 main_~c~0) (<= main_~c~0 200000))} call __VERIFIER_assert((if ~a~0 == ~b~0 && 200000 == ~c~0 then 1 else 0)); {25282#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-15 06:28:40,751 INFO L290 TraceCheckUtils]: 14: Hoare triple {25282#(not (= |__VERIFIER_assert_#in~cond| 0))} ~cond := #in~cond; {25283#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-15 06:28:40,751 INFO L290 TraceCheckUtils]: 15: Hoare triple {25283#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {25273#false} is VALID [2022-04-15 06:28:40,751 INFO L290 TraceCheckUtils]: 16: Hoare triple {25273#false} assume !false; {25273#false} is VALID [2022-04-15 06:28:40,751 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-04-15 06:28:40,751 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 06:28:40,751 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1133627317] [2022-04-15 06:28:40,751 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1133627317] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 06:28:40,751 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1176361203] [2022-04-15 06:28:40,751 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 06:28:40,751 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 06:28:40,752 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 06:28:40,752 INFO L229 MonitoredProcess]: Starting monitored process 24 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-15 06:28:40,763 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (24)] Waiting until timeout for monitored process [2022-04-15 06:28:40,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:28:40,798 INFO L263 TraceCheckSpWp]: Trace formula consists of 85 conjuncts, 18 conjunts are in the unsatisfiable core [2022-04-15 06:28:40,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:28:40,803 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 06:28:41,050 INFO L272 TraceCheckUtils]: 0: Hoare triple {25272#true} call ULTIMATE.init(); {25272#true} is VALID [2022-04-15 06:28:41,051 INFO L290 TraceCheckUtils]: 1: Hoare triple {25272#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(11, 2);call #Ultimate.allocInit(12, 3);~last~0 := 0; {25272#true} is VALID [2022-04-15 06:28:41,051 INFO L290 TraceCheckUtils]: 2: Hoare triple {25272#true} assume true; {25272#true} is VALID [2022-04-15 06:28:41,051 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {25272#true} {25272#true} #66#return; {25272#true} is VALID [2022-04-15 06:28:41,051 INFO L272 TraceCheckUtils]: 4: Hoare triple {25272#true} call #t~ret6 := main(); {25272#true} is VALID [2022-04-15 06:28:41,051 INFO L290 TraceCheckUtils]: 5: Hoare triple {25272#true} assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~last~0 := #t~nondet4;havoc #t~nondet4;~a~0 := 0;~b~0 := 0;~c~0 := 0;~st~0 := 0; {25277#(and (= main_~a~0 0) (= main_~b~0 0))} is VALID [2022-04-15 06:28:41,052 INFO L290 TraceCheckUtils]: 6: Hoare triple {25277#(and (= main_~a~0 0) (= main_~b~0 0))} assume !false;~st~0 := 1;~c~0 := 0; {25278#(and (= main_~a~0 0) (= main_~st~0 1) (= main_~b~0 0))} is VALID [2022-04-15 06:28:41,052 INFO L290 TraceCheckUtils]: 7: Hoare triple {25278#(and (= main_~a~0 0) (= main_~st~0 1) (= main_~b~0 0))} [154] L23-3-->L23-4_primed: Formula: (let ((.cse0 (= |v_main_#t~post5_306| |v_main_#t~post5_304|)) (.cse1 (= v_main_~c~0_604 v_main_~c~0_603)) (.cse2 (= v_~last~0_176 v_main_~c~0_604))) (or (and .cse0 .cse1 (= v_~last~0_176 v_~last~0_176)) (and (not .cse2) (< v_main_~c~0_603 200001) (< v_main_~c~0_604 v_main_~c~0_603) (or (not (<= (+ v_main_~c~0_604 1) v_~last~0_176)) (not (<= (+ v_~last~0_176 1) v_main_~c~0_603)))) (and .cse0 .cse1 (or (not (< v_main_~c~0_604 200000)) .cse2)))) InVars {main_~c~0=v_main_~c~0_604, main_#t~post5=|v_main_#t~post5_306|, ~last~0=v_~last~0_176} OutVars{main_#t~post5=|v_main_#t~post5_304|, main_~c~0=v_main_~c~0_603, ~last~0=v_~last~0_176} AuxVars[] AssignedVars[main_#t~post5, main_~c~0] {25278#(and (= main_~a~0 0) (= main_~st~0 1) (= main_~b~0 0))} is VALID [2022-04-15 06:28:41,052 INFO L290 TraceCheckUtils]: 8: Hoare triple {25278#(and (= main_~a~0 0) (= main_~st~0 1) (= main_~b~0 0))} [155] L23-4_primed-->L23-3: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {25278#(and (= main_~a~0 0) (= main_~st~0 1) (= main_~b~0 0))} is VALID [2022-04-15 06:28:41,053 INFO L290 TraceCheckUtils]: 9: Hoare triple {25278#(and (= main_~a~0 0) (= main_~st~0 1) (= main_~b~0 0))} [156] L23-3-->L23-4_primed: Formula: (let ((.cse0 (= v_main_~st~0_229 v_main_~st~0_228)) (.cse1 (= |v_main_#t~post5_309| |v_main_#t~post5_305|)) (.cse2 (= v_main_~c~0_606 v_main_~c~0_605)) (.cse4 (= v_~last~0_177 v_main_~c~0_606)) (.cse3 (< v_main_~c~0_606 200000))) (or (and .cse0 .cse1 .cse2 (or (not .cse3) (not .cse4))) (and .cse0 .cse1 .cse2 (= v_~last~0_177 v_~last~0_177)) (and (<= v_main_~c~0_605 (+ v_~last~0_177 1)) .cse4 .cse3 (= v_main_~st~0_228 0) (< v_main_~c~0_606 v_main_~c~0_605)))) InVars {main_~c~0=v_main_~c~0_606, main_#t~post5=|v_main_#t~post5_309|, main_~st~0=v_main_~st~0_229, ~last~0=v_~last~0_177} OutVars{main_#t~post5=|v_main_#t~post5_305|, main_~c~0=v_main_~c~0_605, main_~st~0=v_main_~st~0_228, ~last~0=v_~last~0_177} AuxVars[] AssignedVars[main_#t~post5, main_~c~0, main_~st~0] {25315#(and (= main_~a~0 0) (= main_~b~0 0) (or (and (< ~last~0 200000) (< ~last~0 main_~c~0) (<= main_~c~0 (+ ~last~0 1)) (= main_~st~0 0)) (= main_~st~0 1)))} is VALID [2022-04-15 06:28:41,054 INFO L290 TraceCheckUtils]: 10: Hoare triple {25315#(and (= main_~a~0 0) (= main_~b~0 0) (or (and (< ~last~0 200000) (< ~last~0 main_~c~0) (<= main_~c~0 (+ ~last~0 1)) (= main_~st~0 0)) (= main_~st~0 1)))} [153] L23-4_primed-->L23-4: Formula: (not (< v_main_~c~0_8 200000)) InVars {main_~c~0=v_main_~c~0_8} OutVars{main_~c~0=v_main_~c~0_8} AuxVars[] AssignedVars[] {25319#(and (= main_~a~0 0) (or (= main_~st~0 1) (and (< ~last~0 200000) (<= main_~c~0 (+ ~last~0 1)) (= main_~st~0 0))) (= main_~b~0 0) (not (< main_~c~0 200000)))} is VALID [2022-04-15 06:28:41,054 INFO L290 TraceCheckUtils]: 11: Hoare triple {25319#(and (= main_~a~0 0) (or (= main_~st~0 1) (and (< ~last~0 200000) (<= main_~c~0 (+ ~last~0 1)) (= main_~st~0 0))) (= main_~b~0 0) (not (< main_~c~0 200000)))} assume 0 == ~st~0 && ~c~0 == 1 + ~last~0;~a~0 := 3 + ~a~0;~b~0 := 3 + ~b~0; {25323#(and (= main_~b~0 3) (<= 200000 main_~c~0) (< main_~c~0 200001) (= main_~a~0 3))} is VALID [2022-04-15 06:28:41,055 INFO L290 TraceCheckUtils]: 12: Hoare triple {25323#(and (= main_~b~0 3) (<= 200000 main_~c~0) (< main_~c~0 200001) (= main_~a~0 3))} assume !(~c~0 == ~last~0 && 0 == ~st~0); {25323#(and (= main_~b~0 3) (<= 200000 main_~c~0) (< main_~c~0 200001) (= main_~a~0 3))} is VALID [2022-04-15 06:28:41,055 INFO L272 TraceCheckUtils]: 13: Hoare triple {25323#(and (= main_~b~0 3) (<= 200000 main_~c~0) (< main_~c~0 200001) (= main_~a~0 3))} call __VERIFIER_assert((if ~a~0 == ~b~0 && 200000 == ~c~0 then 1 else 0)); {25330#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-15 06:28:41,056 INFO L290 TraceCheckUtils]: 14: Hoare triple {25330#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {25334#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-15 06:28:41,056 INFO L290 TraceCheckUtils]: 15: Hoare triple {25334#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {25273#false} is VALID [2022-04-15 06:28:41,056 INFO L290 TraceCheckUtils]: 16: Hoare triple {25273#false} assume !false; {25273#false} is VALID [2022-04-15 06:28:41,056 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-04-15 06:28:41,056 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 06:28:41,430 INFO L290 TraceCheckUtils]: 16: Hoare triple {25273#false} assume !false; {25273#false} is VALID [2022-04-15 06:28:41,430 INFO L290 TraceCheckUtils]: 15: Hoare triple {25334#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {25273#false} is VALID [2022-04-15 06:28:41,430 INFO L290 TraceCheckUtils]: 14: Hoare triple {25330#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {25334#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-15 06:28:41,431 INFO L272 TraceCheckUtils]: 13: Hoare triple {25281#(and (<= main_~b~0 main_~a~0) (< main_~a~0 (+ main_~b~0 1)) (< 199999 main_~c~0) (<= main_~c~0 200000))} call __VERIFIER_assert((if ~a~0 == ~b~0 && 200000 == ~c~0 then 1 else 0)); {25330#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-15 06:28:41,431 INFO L290 TraceCheckUtils]: 12: Hoare triple {25281#(and (<= main_~b~0 main_~a~0) (< main_~a~0 (+ main_~b~0 1)) (< 199999 main_~c~0) (<= main_~c~0 200000))} assume !(~c~0 == ~last~0 && 0 == ~st~0); {25281#(and (<= main_~b~0 main_~a~0) (< main_~a~0 (+ main_~b~0 1)) (< 199999 main_~c~0) (<= main_~c~0 200000))} is VALID [2022-04-15 06:28:41,432 INFO L290 TraceCheckUtils]: 11: Hoare triple {25356#(or (not (<= main_~c~0 (+ ~last~0 1))) (and (<= main_~b~0 main_~a~0) (< main_~a~0 (+ main_~b~0 1)) (< 199999 main_~c~0) (<= main_~c~0 200000)) (not (= main_~st~0 0)))} assume 0 == ~st~0 && ~c~0 == 1 + ~last~0;~a~0 := 3 + ~a~0;~b~0 := 3 + ~b~0; {25281#(and (<= main_~b~0 main_~a~0) (< main_~a~0 (+ main_~b~0 1)) (< 199999 main_~c~0) (<= main_~c~0 200000))} is VALID [2022-04-15 06:28:41,433 INFO L290 TraceCheckUtils]: 10: Hoare triple {25360#(or (not (<= main_~c~0 (+ ~last~0 1))) (and (<= main_~b~0 main_~a~0) (< main_~a~0 (+ main_~b~0 1)) (<= main_~c~0 200000)) (not (= main_~st~0 0)) (< main_~c~0 200000))} [153] L23-4_primed-->L23-4: Formula: (not (< v_main_~c~0_8 200000)) InVars {main_~c~0=v_main_~c~0_8} OutVars{main_~c~0=v_main_~c~0_8} AuxVars[] AssignedVars[] {25356#(or (not (<= main_~c~0 (+ ~last~0 1))) (and (<= main_~b~0 main_~a~0) (< main_~a~0 (+ main_~b~0 1)) (< 199999 main_~c~0) (<= main_~c~0 200000)) (not (= main_~st~0 0)))} is VALID [2022-04-15 06:28:41,433 INFO L290 TraceCheckUtils]: 9: Hoare triple {25364#(and (<= main_~b~0 main_~a~0) (< main_~a~0 (+ main_~b~0 1)) (not (= main_~st~0 0)))} [156] L23-3-->L23-4_primed: Formula: (let ((.cse0 (= v_main_~st~0_229 v_main_~st~0_228)) (.cse1 (= |v_main_#t~post5_309| |v_main_#t~post5_305|)) (.cse2 (= v_main_~c~0_606 v_main_~c~0_605)) (.cse4 (= v_~last~0_177 v_main_~c~0_606)) (.cse3 (< v_main_~c~0_606 200000))) (or (and .cse0 .cse1 .cse2 (or (not .cse3) (not .cse4))) (and .cse0 .cse1 .cse2 (= v_~last~0_177 v_~last~0_177)) (and (<= v_main_~c~0_605 (+ v_~last~0_177 1)) .cse4 .cse3 (= v_main_~st~0_228 0) (< v_main_~c~0_606 v_main_~c~0_605)))) InVars {main_~c~0=v_main_~c~0_606, main_#t~post5=|v_main_#t~post5_309|, main_~st~0=v_main_~st~0_229, ~last~0=v_~last~0_177} OutVars{main_#t~post5=|v_main_#t~post5_305|, main_~c~0=v_main_~c~0_605, main_~st~0=v_main_~st~0_228, ~last~0=v_~last~0_177} AuxVars[] AssignedVars[main_#t~post5, main_~c~0, main_~st~0] {25360#(or (not (<= main_~c~0 (+ ~last~0 1))) (and (<= main_~b~0 main_~a~0) (< main_~a~0 (+ main_~b~0 1)) (<= main_~c~0 200000)) (not (= main_~st~0 0)) (< main_~c~0 200000))} is VALID [2022-04-15 06:28:41,434 INFO L290 TraceCheckUtils]: 8: Hoare triple {25364#(and (<= main_~b~0 main_~a~0) (< main_~a~0 (+ main_~b~0 1)) (not (= main_~st~0 0)))} [155] L23-4_primed-->L23-3: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {25364#(and (<= main_~b~0 main_~a~0) (< main_~a~0 (+ main_~b~0 1)) (not (= main_~st~0 0)))} is VALID [2022-04-15 06:28:41,434 INFO L290 TraceCheckUtils]: 7: Hoare triple {25364#(and (<= main_~b~0 main_~a~0) (< main_~a~0 (+ main_~b~0 1)) (not (= main_~st~0 0)))} [154] L23-3-->L23-4_primed: Formula: (let ((.cse0 (= |v_main_#t~post5_306| |v_main_#t~post5_304|)) (.cse1 (= v_main_~c~0_604 v_main_~c~0_603)) (.cse2 (= v_~last~0_176 v_main_~c~0_604))) (or (and .cse0 .cse1 (= v_~last~0_176 v_~last~0_176)) (and (not .cse2) (< v_main_~c~0_603 200001) (< v_main_~c~0_604 v_main_~c~0_603) (or (not (<= (+ v_main_~c~0_604 1) v_~last~0_176)) (not (<= (+ v_~last~0_176 1) v_main_~c~0_603)))) (and .cse0 .cse1 (or (not (< v_main_~c~0_604 200000)) .cse2)))) InVars {main_~c~0=v_main_~c~0_604, main_#t~post5=|v_main_#t~post5_306|, ~last~0=v_~last~0_176} OutVars{main_#t~post5=|v_main_#t~post5_304|, main_~c~0=v_main_~c~0_603, ~last~0=v_~last~0_176} AuxVars[] AssignedVars[main_#t~post5, main_~c~0] {25364#(and (<= main_~b~0 main_~a~0) (< main_~a~0 (+ main_~b~0 1)) (not (= main_~st~0 0)))} is VALID [2022-04-15 06:28:41,435 INFO L290 TraceCheckUtils]: 6: Hoare triple {25374#(and (<= main_~b~0 main_~a~0) (< main_~a~0 (+ main_~b~0 1)))} assume !false;~st~0 := 1;~c~0 := 0; {25364#(and (<= main_~b~0 main_~a~0) (< main_~a~0 (+ main_~b~0 1)) (not (= main_~st~0 0)))} is VALID [2022-04-15 06:28:41,435 INFO L290 TraceCheckUtils]: 5: Hoare triple {25272#true} assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~last~0 := #t~nondet4;havoc #t~nondet4;~a~0 := 0;~b~0 := 0;~c~0 := 0;~st~0 := 0; {25374#(and (<= main_~b~0 main_~a~0) (< main_~a~0 (+ main_~b~0 1)))} is VALID [2022-04-15 06:28:41,435 INFO L272 TraceCheckUtils]: 4: Hoare triple {25272#true} call #t~ret6 := main(); {25272#true} is VALID [2022-04-15 06:28:41,435 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {25272#true} {25272#true} #66#return; {25272#true} is VALID [2022-04-15 06:28:41,435 INFO L290 TraceCheckUtils]: 2: Hoare triple {25272#true} assume true; {25272#true} is VALID [2022-04-15 06:28:41,435 INFO L290 TraceCheckUtils]: 1: Hoare triple {25272#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(11, 2);call #Ultimate.allocInit(12, 3);~last~0 := 0; {25272#true} is VALID [2022-04-15 06:28:41,435 INFO L272 TraceCheckUtils]: 0: Hoare triple {25272#true} call ULTIMATE.init(); {25272#true} is VALID [2022-04-15 06:28:41,435 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-04-15 06:28:41,436 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1176361203] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 06:28:41,436 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 06:28:41,436 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9, 9] total 19 [2022-04-15 06:28:42,707 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 06:28:42,707 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1639293680] [2022-04-15 06:28:42,708 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1639293680] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 06:28:42,708 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 06:28:42,708 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [44] imperfect sequences [] total 44 [2022-04-15 06:28:42,708 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [376804494] [2022-04-15 06:28:42,708 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 06:28:42,708 INFO L78 Accepts]: Start accepts. Automaton has has 44 states, 44 states have (on average 1.3863636363636365) internal successors, (61), 42 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-15 06:28:42,708 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 06:28:42,708 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 44 states, 44 states have (on average 1.3863636363636365) internal successors, (61), 42 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-15 06:28:42,756 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 65 edges. 65 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 06:28:42,756 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 44 states [2022-04-15 06:28:42,756 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 06:28:42,757 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2022-04-15 06:28:42,757 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=336, Invalid=2526, Unknown=0, NotChecked=0, Total=2862 [2022-04-15 06:28:42,757 INFO L87 Difference]: Start difference. First operand 226 states and 263 transitions. Second operand has 44 states, 44 states have (on average 1.3863636363636365) internal successors, (61), 42 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-15 06:28:47,430 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:28:47,430 INFO L93 Difference]: Finished difference Result 327 states and 381 transitions. [2022-04-15 06:28:47,430 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 62 states. [2022-04-15 06:28:47,430 INFO L78 Accepts]: Start accepts. Automaton has has 44 states, 44 states have (on average 1.3863636363636365) internal successors, (61), 42 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-15 06:28:47,430 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 06:28:47,430 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 44 states, 44 states have (on average 1.3863636363636365) internal successors, (61), 42 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-15 06:28:47,431 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 155 transitions. [2022-04-15 06:28:47,431 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 44 states, 44 states have (on average 1.3863636363636365) internal successors, (61), 42 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-15 06:28:47,433 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 155 transitions. [2022-04-15 06:28:47,433 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 62 states and 155 transitions. [2022-04-15 06:28:47,510 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 155 edges. 155 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 06:28:47,514 INFO L225 Difference]: With dead ends: 327 [2022-04-15 06:28:47,514 INFO L226 Difference]: Without dead ends: 265 [2022-04-15 06:28:47,514 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 117 GetRequests, 43 SyntacticMatches, 2 SemanticMatches, 72 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1542 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=523, Invalid=4879, Unknown=0, NotChecked=0, Total=5402 [2022-04-15 06:28:47,515 INFO L913 BasicCegarLoop]: 16 mSDtfsCounter, 100 mSDsluCounter, 115 mSDsCounter, 0 mSdLazyCounter, 3149 mSolverCounterSat, 82 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 102 SdHoareTripleChecker+Valid, 131 SdHoareTripleChecker+Invalid, 3231 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 82 IncrementalHoareTripleChecker+Valid, 3149 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2022-04-15 06:28:47,515 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [102 Valid, 131 Invalid, 3231 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [82 Valid, 3149 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2022-04-15 06:28:47,515 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 265 states. [2022-04-15 06:28:48,204 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 265 to 229. [2022-04-15 06:28:48,204 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 06:28:48,204 INFO L82 GeneralOperation]: Start isEquivalent. First operand 265 states. Second operand has 229 states, 221 states have (on average 1.1764705882352942) internal successors, (260), 222 states have internal predecessors, (260), 4 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-15 06:28:48,204 INFO L74 IsIncluded]: Start isIncluded. First operand 265 states. Second operand has 229 states, 221 states have (on average 1.1764705882352942) internal successors, (260), 222 states have internal predecessors, (260), 4 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-15 06:28:48,205 INFO L87 Difference]: Start difference. First operand 265 states. Second operand has 229 states, 221 states have (on average 1.1764705882352942) internal successors, (260), 222 states have internal predecessors, (260), 4 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-15 06:28:48,207 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:28:48,207 INFO L93 Difference]: Finished difference Result 265 states and 305 transitions. [2022-04-15 06:28:48,207 INFO L276 IsEmpty]: Start isEmpty. Operand 265 states and 305 transitions. [2022-04-15 06:28:48,208 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 06:28:48,208 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 06:28:48,208 INFO L74 IsIncluded]: Start isIncluded. First operand has 229 states, 221 states have (on average 1.1764705882352942) internal successors, (260), 222 states have internal predecessors, (260), 4 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) Second operand 265 states. [2022-04-15 06:28:48,208 INFO L87 Difference]: Start difference. First operand has 229 states, 221 states have (on average 1.1764705882352942) internal successors, (260), 222 states have internal predecessors, (260), 4 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) Second operand 265 states. [2022-04-15 06:28:48,211 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:28:48,211 INFO L93 Difference]: Finished difference Result 265 states and 305 transitions. [2022-04-15 06:28:48,211 INFO L276 IsEmpty]: Start isEmpty. Operand 265 states and 305 transitions. [2022-04-15 06:28:48,211 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 06:28:48,211 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 06:28:48,211 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 06:28:48,211 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 06:28:48,211 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 229 states, 221 states have (on average 1.1764705882352942) internal successors, (260), 222 states have internal predecessors, (260), 4 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-15 06:28:48,214 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 229 states to 229 states and 267 transitions. [2022-04-15 06:28:48,214 INFO L78 Accepts]: Start accepts. Automaton has 229 states and 267 transitions. Word has length 65 [2022-04-15 06:28:48,214 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 06:28:48,214 INFO L478 AbstractCegarLoop]: Abstraction has 229 states and 267 transitions. [2022-04-15 06:28:48,214 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 44 states, 44 states have (on average 1.3863636363636365) internal successors, (61), 42 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-15 06:28:48,214 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 229 states and 267 transitions. [2022-04-15 06:28:48,762 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 267 edges. 267 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 06:28:48,762 INFO L276 IsEmpty]: Start isEmpty. Operand 229 states and 267 transitions. [2022-04-15 06:28:48,762 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2022-04-15 06:28:48,762 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 06:28:48,763 INFO L499 BasicCegarLoop]: trace histogram [18, 18, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 06:28:48,783 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (24)] Forceful destruction successful, exit code 0 [2022-04-15 06:28:48,963 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27,24 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 06:28:48,963 INFO L403 AbstractCegarLoop]: === Iteration 29 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 06:28:48,963 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 06:28:48,964 INFO L85 PathProgramCache]: Analyzing trace with hash -470724345, now seen corresponding path program 17 times [2022-04-15 06:28:48,964 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 06:28:48,964 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [440248322] [2022-04-15 06:28:49,197 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 1 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-15 06:28:49,417 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {0={1=1}, 1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-15 06:28:49,418 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-15 06:28:49,420 INFO L85 PathProgramCache]: Analyzing trace with hash 301851336, now seen corresponding path program 1 times [2022-04-15 06:28:49,420 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 06:28:49,421 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [431985263] [2022-04-15 06:28:49,421 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 06:28:49,421 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 06:28:49,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:28:49,594 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 06:28:49,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:28:49,612 INFO L290 TraceCheckUtils]: 0: Hoare triple {27125#(and (= ~last~0 |old(~last~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(11, 2);call #Ultimate.allocInit(12, 3);~last~0 := 0; {27112#true} is VALID [2022-04-15 06:28:49,612 INFO L290 TraceCheckUtils]: 1: Hoare triple {27112#true} assume true; {27112#true} is VALID [2022-04-15 06:28:49,612 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {27112#true} {27112#true} #66#return; {27112#true} is VALID [2022-04-15 06:28:49,613 INFO L272 TraceCheckUtils]: 0: Hoare triple {27112#true} call ULTIMATE.init(); {27125#(and (= ~last~0 |old(~last~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 06:28:49,613 INFO L290 TraceCheckUtils]: 1: Hoare triple {27125#(and (= ~last~0 |old(~last~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(11, 2);call #Ultimate.allocInit(12, 3);~last~0 := 0; {27112#true} is VALID [2022-04-15 06:28:49,613 INFO L290 TraceCheckUtils]: 2: Hoare triple {27112#true} assume true; {27112#true} is VALID [2022-04-15 06:28:49,613 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {27112#true} {27112#true} #66#return; {27112#true} is VALID [2022-04-15 06:28:49,613 INFO L272 TraceCheckUtils]: 4: Hoare triple {27112#true} call #t~ret6 := main(); {27112#true} is VALID [2022-04-15 06:28:49,613 INFO L290 TraceCheckUtils]: 5: Hoare triple {27112#true} assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~last~0 := #t~nondet4;havoc #t~nondet4;~a~0 := 0;~b~0 := 0;~c~0 := 0;~st~0 := 0; {27117#(and (= main_~a~0 0) (= main_~b~0 0))} is VALID [2022-04-15 06:28:49,614 INFO L290 TraceCheckUtils]: 6: Hoare triple {27117#(and (= main_~a~0 0) (= main_~b~0 0))} assume !false;~st~0 := 1;~c~0 := 0; {27118#(and (= main_~a~0 0) (= main_~b~0 0) (= main_~c~0 0))} is VALID [2022-04-15 06:28:49,615 INFO L290 TraceCheckUtils]: 7: Hoare triple {27118#(and (= main_~a~0 0) (= main_~b~0 0) (= main_~c~0 0))} [158] L23-3-->L23-4_primed: Formula: (let ((.cse0 (= v_~last~0_184 v_main_~c~0_638))) (or (and (= v_~last~0_184 v_~last~0_184) (= |v_main_#t~post5_319| |v_main_#t~post5_317|) (= v_main_~c~0_638 v_main_~c~0_637)) (and (not .cse0) (or (not (<= (+ v_~last~0_184 1) v_main_~c~0_637)) (not (<= (+ v_main_~c~0_638 1) v_~last~0_184))) (< v_main_~c~0_637 200001) (< v_main_~c~0_638 v_main_~c~0_637)) (and (= v_main_~c~0_637 v_main_~c~0_638) (= |v_main_#t~post5_317| |v_main_#t~post5_319|) (or (not (< v_main_~c~0_638 200000)) .cse0)))) InVars {main_~c~0=v_main_~c~0_638, main_#t~post5=|v_main_#t~post5_319|, ~last~0=v_~last~0_184} OutVars{main_#t~post5=|v_main_#t~post5_317|, main_~c~0=v_main_~c~0_637, ~last~0=v_~last~0_184} AuxVars[] AssignedVars[main_#t~post5, main_~c~0] {27119#(and (= main_~a~0 0) (= main_~b~0 0) (or (<= ~last~0 0) (<= main_~c~0 200000)))} is VALID [2022-04-15 06:28:49,615 INFO L290 TraceCheckUtils]: 8: Hoare triple {27119#(and (= main_~a~0 0) (= main_~b~0 0) (or (<= ~last~0 0) (<= main_~c~0 200000)))} [159] L23-4_primed-->L23-3: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {27119#(and (= main_~a~0 0) (= main_~b~0 0) (or (<= ~last~0 0) (<= main_~c~0 200000)))} is VALID [2022-04-15 06:28:49,616 INFO L290 TraceCheckUtils]: 9: Hoare triple {27119#(and (= main_~a~0 0) (= main_~b~0 0) (or (<= ~last~0 0) (<= main_~c~0 200000)))} [160] L23-3-->L23-4_primed: Formula: (let ((.cse2 (= v_main_~st~0_239 v_main_~st~0_238)) (.cse0 (< v_main_~c~0_640 200000)) (.cse1 (= v_~last~0_185 v_main_~c~0_640)) (.cse3 (= v_main_~c~0_640 v_main_~c~0_639))) (or (and .cse0 .cse1 (< v_main_~c~0_640 v_main_~c~0_639) (= v_main_~st~0_238 0) (<= v_main_~c~0_639 (+ v_~last~0_185 1))) (and .cse2 (= v_~last~0_185 v_~last~0_185) (= |v_main_#t~post5_322| |v_main_#t~post5_318|) .cse3) (and .cse2 (or (not .cse0) (not .cse1)) .cse3 (= |v_main_#t~post5_318| |v_main_#t~post5_322|)))) InVars {main_~c~0=v_main_~c~0_640, main_#t~post5=|v_main_#t~post5_322|, main_~st~0=v_main_~st~0_239, ~last~0=v_~last~0_185} OutVars{main_#t~post5=|v_main_#t~post5_318|, main_~c~0=v_main_~c~0_639, main_~st~0=v_main_~st~0_238, ~last~0=v_~last~0_185} AuxVars[] AssignedVars[main_#t~post5, main_~c~0, main_~st~0] {27120#(and (= main_~a~0 0) (or (<= ~last~0 199999) (<= main_~c~0 200000)) (= main_~b~0 0))} is VALID [2022-04-15 06:28:49,616 INFO L290 TraceCheckUtils]: 10: Hoare triple {27120#(and (= main_~a~0 0) (or (<= ~last~0 199999) (<= main_~c~0 200000)) (= main_~b~0 0))} [157] L23-4_primed-->L23-4: Formula: (not (< v_main_~c~0_8 200000)) InVars {main_~c~0=v_main_~c~0_8} OutVars{main_~c~0=v_main_~c~0_8} AuxVars[] AssignedVars[] {27121#(and (= main_~a~0 0) (= main_~b~0 0) (or (<= (+ ~last~0 200000) main_~c~0) (and (< 199999 main_~c~0) (<= main_~c~0 200000)) (and (<= ~last~0 199999) (< 199999 main_~c~0))))} is VALID [2022-04-15 06:28:49,617 INFO L290 TraceCheckUtils]: 11: Hoare triple {27121#(and (= main_~a~0 0) (= main_~b~0 0) (or (<= (+ ~last~0 200000) main_~c~0) (and (< 199999 main_~c~0) (<= main_~c~0 200000)) (and (<= ~last~0 199999) (< 199999 main_~c~0))))} assume 0 == ~st~0 && ~c~0 == 1 + ~last~0;~a~0 := 3 + ~a~0;~b~0 := 3 + ~b~0; {27122#(and (<= main_~b~0 main_~a~0) (< main_~a~0 (+ main_~b~0 1)) (< 199999 main_~c~0) (<= main_~c~0 200000))} is VALID [2022-04-15 06:28:49,617 INFO L290 TraceCheckUtils]: 12: Hoare triple {27122#(and (<= main_~b~0 main_~a~0) (< main_~a~0 (+ main_~b~0 1)) (< 199999 main_~c~0) (<= main_~c~0 200000))} assume !(~c~0 == ~last~0 && 0 == ~st~0); {27122#(and (<= main_~b~0 main_~a~0) (< main_~a~0 (+ main_~b~0 1)) (< 199999 main_~c~0) (<= main_~c~0 200000))} is VALID [2022-04-15 06:28:49,631 INFO L272 TraceCheckUtils]: 13: Hoare triple {27122#(and (<= main_~b~0 main_~a~0) (< main_~a~0 (+ main_~b~0 1)) (< 199999 main_~c~0) (<= main_~c~0 200000))} call __VERIFIER_assert((if ~a~0 == ~b~0 && 200000 == ~c~0 then 1 else 0)); {27123#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-15 06:28:49,632 INFO L290 TraceCheckUtils]: 14: Hoare triple {27123#(not (= |__VERIFIER_assert_#in~cond| 0))} ~cond := #in~cond; {27124#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-15 06:28:49,632 INFO L290 TraceCheckUtils]: 15: Hoare triple {27124#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {27113#false} is VALID [2022-04-15 06:28:49,632 INFO L290 TraceCheckUtils]: 16: Hoare triple {27113#false} assume !false; {27113#false} is VALID [2022-04-15 06:28:49,632 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 06:28:49,632 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 06:28:49,633 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [431985263] [2022-04-15 06:28:49,633 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [431985263] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 06:28:49,633 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [717065577] [2022-04-15 06:28:49,633 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 06:28:49,633 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 06:28:49,633 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 06:28:49,634 INFO L229 MonitoredProcess]: Starting monitored process 25 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-15 06:28:49,663 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (25)] Waiting until timeout for monitored process [2022-04-15 06:28:49,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:28:49,665 INFO L263 TraceCheckSpWp]: Trace formula consists of 85 conjuncts, 18 conjunts are in the unsatisfiable core [2022-04-15 06:28:49,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:28:49,671 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 06:28:49,952 INFO L272 TraceCheckUtils]: 0: Hoare triple {27112#true} call ULTIMATE.init(); {27112#true} is VALID [2022-04-15 06:28:49,953 INFO L290 TraceCheckUtils]: 1: Hoare triple {27112#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(11, 2);call #Ultimate.allocInit(12, 3);~last~0 := 0; {27112#true} is VALID [2022-04-15 06:28:49,953 INFO L290 TraceCheckUtils]: 2: Hoare triple {27112#true} assume true; {27112#true} is VALID [2022-04-15 06:28:49,953 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {27112#true} {27112#true} #66#return; {27112#true} is VALID [2022-04-15 06:28:49,953 INFO L272 TraceCheckUtils]: 4: Hoare triple {27112#true} call #t~ret6 := main(); {27112#true} is VALID [2022-04-15 06:28:49,953 INFO L290 TraceCheckUtils]: 5: Hoare triple {27112#true} assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~last~0 := #t~nondet4;havoc #t~nondet4;~a~0 := 0;~b~0 := 0;~c~0 := 0;~st~0 := 0; {27117#(and (= main_~a~0 0) (= main_~b~0 0))} is VALID [2022-04-15 06:28:49,953 INFO L290 TraceCheckUtils]: 6: Hoare triple {27117#(and (= main_~a~0 0) (= main_~b~0 0))} assume !false;~st~0 := 1;~c~0 := 0; {27147#(and (= main_~a~0 0) (= main_~st~0 1) (= main_~b~0 0))} is VALID [2022-04-15 06:28:49,954 INFO L290 TraceCheckUtils]: 7: Hoare triple {27147#(and (= main_~a~0 0) (= main_~st~0 1) (= main_~b~0 0))} [158] L23-3-->L23-4_primed: Formula: (let ((.cse0 (= v_~last~0_184 v_main_~c~0_638))) (or (and (= v_~last~0_184 v_~last~0_184) (= |v_main_#t~post5_319| |v_main_#t~post5_317|) (= v_main_~c~0_638 v_main_~c~0_637)) (and (not .cse0) (or (not (<= (+ v_~last~0_184 1) v_main_~c~0_637)) (not (<= (+ v_main_~c~0_638 1) v_~last~0_184))) (< v_main_~c~0_637 200001) (< v_main_~c~0_638 v_main_~c~0_637)) (and (= v_main_~c~0_637 v_main_~c~0_638) (= |v_main_#t~post5_317| |v_main_#t~post5_319|) (or (not (< v_main_~c~0_638 200000)) .cse0)))) InVars {main_~c~0=v_main_~c~0_638, main_#t~post5=|v_main_#t~post5_319|, ~last~0=v_~last~0_184} OutVars{main_#t~post5=|v_main_#t~post5_317|, main_~c~0=v_main_~c~0_637, ~last~0=v_~last~0_184} AuxVars[] AssignedVars[main_#t~post5, main_~c~0] {27147#(and (= main_~a~0 0) (= main_~st~0 1) (= main_~b~0 0))} is VALID [2022-04-15 06:28:49,954 INFO L290 TraceCheckUtils]: 8: Hoare triple {27147#(and (= main_~a~0 0) (= main_~st~0 1) (= main_~b~0 0))} [159] L23-4_primed-->L23-3: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {27147#(and (= main_~a~0 0) (= main_~st~0 1) (= main_~b~0 0))} is VALID [2022-04-15 06:28:49,955 INFO L290 TraceCheckUtils]: 9: Hoare triple {27147#(and (= main_~a~0 0) (= main_~st~0 1) (= main_~b~0 0))} [160] L23-3-->L23-4_primed: Formula: (let ((.cse2 (= v_main_~st~0_239 v_main_~st~0_238)) (.cse0 (< v_main_~c~0_640 200000)) (.cse1 (= v_~last~0_185 v_main_~c~0_640)) (.cse3 (= v_main_~c~0_640 v_main_~c~0_639))) (or (and .cse0 .cse1 (< v_main_~c~0_640 v_main_~c~0_639) (= v_main_~st~0_238 0) (<= v_main_~c~0_639 (+ v_~last~0_185 1))) (and .cse2 (= v_~last~0_185 v_~last~0_185) (= |v_main_#t~post5_322| |v_main_#t~post5_318|) .cse3) (and .cse2 (or (not .cse0) (not .cse1)) .cse3 (= |v_main_#t~post5_318| |v_main_#t~post5_322|)))) InVars {main_~c~0=v_main_~c~0_640, main_#t~post5=|v_main_#t~post5_322|, main_~st~0=v_main_~st~0_239, ~last~0=v_~last~0_185} OutVars{main_#t~post5=|v_main_#t~post5_318|, main_~c~0=v_main_~c~0_639, main_~st~0=v_main_~st~0_238, ~last~0=v_~last~0_185} AuxVars[] AssignedVars[main_#t~post5, main_~c~0, main_~st~0] {27157#(and (= main_~a~0 0) (= main_~b~0 0) (or (and (< ~last~0 200000) (< ~last~0 main_~c~0) (<= main_~c~0 (+ ~last~0 1)) (= main_~st~0 0)) (= main_~st~0 1)))} is VALID [2022-04-15 06:28:49,956 INFO L290 TraceCheckUtils]: 10: Hoare triple {27157#(and (= main_~a~0 0) (= main_~b~0 0) (or (and (< ~last~0 200000) (< ~last~0 main_~c~0) (<= main_~c~0 (+ ~last~0 1)) (= main_~st~0 0)) (= main_~st~0 1)))} [157] L23-4_primed-->L23-4: Formula: (not (< v_main_~c~0_8 200000)) InVars {main_~c~0=v_main_~c~0_8} OutVars{main_~c~0=v_main_~c~0_8} AuxVars[] AssignedVars[] {27161#(and (= main_~a~0 0) (or (= main_~st~0 1) (and (< ~last~0 200000) (<= main_~c~0 (+ ~last~0 1)) (= main_~st~0 0))) (= main_~b~0 0) (not (< main_~c~0 200000)))} is VALID [2022-04-15 06:28:49,957 INFO L290 TraceCheckUtils]: 11: Hoare triple {27161#(and (= main_~a~0 0) (or (= main_~st~0 1) (and (< ~last~0 200000) (<= main_~c~0 (+ ~last~0 1)) (= main_~st~0 0))) (= main_~b~0 0) (not (< main_~c~0 200000)))} assume 0 == ~st~0 && ~c~0 == 1 + ~last~0;~a~0 := 3 + ~a~0;~b~0 := 3 + ~b~0; {27165#(and (= main_~b~0 3) (<= 200000 main_~c~0) (< main_~c~0 200001) (= main_~a~0 3))} is VALID [2022-04-15 06:28:49,957 INFO L290 TraceCheckUtils]: 12: Hoare triple {27165#(and (= main_~b~0 3) (<= 200000 main_~c~0) (< main_~c~0 200001) (= main_~a~0 3))} assume !(~c~0 == ~last~0 && 0 == ~st~0); {27165#(and (= main_~b~0 3) (<= 200000 main_~c~0) (< main_~c~0 200001) (= main_~a~0 3))} is VALID [2022-04-15 06:28:49,958 INFO L272 TraceCheckUtils]: 13: Hoare triple {27165#(and (= main_~b~0 3) (<= 200000 main_~c~0) (< main_~c~0 200001) (= main_~a~0 3))} call __VERIFIER_assert((if ~a~0 == ~b~0 && 200000 == ~c~0 then 1 else 0)); {27172#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-15 06:28:49,958 INFO L290 TraceCheckUtils]: 14: Hoare triple {27172#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {27176#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-15 06:28:49,958 INFO L290 TraceCheckUtils]: 15: Hoare triple {27176#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {27113#false} is VALID [2022-04-15 06:28:49,958 INFO L290 TraceCheckUtils]: 16: Hoare triple {27113#false} assume !false; {27113#false} is VALID [2022-04-15 06:28:49,959 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-04-15 06:28:49,959 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 06:28:50,356 INFO L290 TraceCheckUtils]: 16: Hoare triple {27113#false} assume !false; {27113#false} is VALID [2022-04-15 06:28:50,357 INFO L290 TraceCheckUtils]: 15: Hoare triple {27176#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {27113#false} is VALID [2022-04-15 06:28:50,357 INFO L290 TraceCheckUtils]: 14: Hoare triple {27172#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {27176#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-15 06:28:50,358 INFO L272 TraceCheckUtils]: 13: Hoare triple {27122#(and (<= main_~b~0 main_~a~0) (< main_~a~0 (+ main_~b~0 1)) (< 199999 main_~c~0) (<= main_~c~0 200000))} call __VERIFIER_assert((if ~a~0 == ~b~0 && 200000 == ~c~0 then 1 else 0)); {27172#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-15 06:28:50,358 INFO L290 TraceCheckUtils]: 12: Hoare triple {27122#(and (<= main_~b~0 main_~a~0) (< main_~a~0 (+ main_~b~0 1)) (< 199999 main_~c~0) (<= main_~c~0 200000))} assume !(~c~0 == ~last~0 && 0 == ~st~0); {27122#(and (<= main_~b~0 main_~a~0) (< main_~a~0 (+ main_~b~0 1)) (< 199999 main_~c~0) (<= main_~c~0 200000))} is VALID [2022-04-15 06:28:50,359 INFO L290 TraceCheckUtils]: 11: Hoare triple {27198#(or (not (<= main_~c~0 (+ ~last~0 1))) (and (<= main_~b~0 main_~a~0) (< main_~a~0 (+ main_~b~0 1)) (< 199999 main_~c~0) (<= main_~c~0 200000)) (not (= main_~st~0 0)))} assume 0 == ~st~0 && ~c~0 == 1 + ~last~0;~a~0 := 3 + ~a~0;~b~0 := 3 + ~b~0; {27122#(and (<= main_~b~0 main_~a~0) (< main_~a~0 (+ main_~b~0 1)) (< 199999 main_~c~0) (<= main_~c~0 200000))} is VALID [2022-04-15 06:28:50,360 INFO L290 TraceCheckUtils]: 10: Hoare triple {27202#(or (not (<= main_~c~0 (+ ~last~0 1))) (and (<= main_~b~0 main_~a~0) (< main_~a~0 (+ main_~b~0 1)) (<= main_~c~0 200000)) (not (= main_~st~0 0)) (< main_~c~0 200000))} [157] L23-4_primed-->L23-4: Formula: (not (< v_main_~c~0_8 200000)) InVars {main_~c~0=v_main_~c~0_8} OutVars{main_~c~0=v_main_~c~0_8} AuxVars[] AssignedVars[] {27198#(or (not (<= main_~c~0 (+ ~last~0 1))) (and (<= main_~b~0 main_~a~0) (< main_~a~0 (+ main_~b~0 1)) (< 199999 main_~c~0) (<= main_~c~0 200000)) (not (= main_~st~0 0)))} is VALID [2022-04-15 06:28:50,360 INFO L290 TraceCheckUtils]: 9: Hoare triple {27206#(and (<= main_~b~0 main_~a~0) (< main_~a~0 (+ main_~b~0 1)) (not (= main_~st~0 0)))} [160] L23-3-->L23-4_primed: Formula: (let ((.cse2 (= v_main_~st~0_239 v_main_~st~0_238)) (.cse0 (< v_main_~c~0_640 200000)) (.cse1 (= v_~last~0_185 v_main_~c~0_640)) (.cse3 (= v_main_~c~0_640 v_main_~c~0_639))) (or (and .cse0 .cse1 (< v_main_~c~0_640 v_main_~c~0_639) (= v_main_~st~0_238 0) (<= v_main_~c~0_639 (+ v_~last~0_185 1))) (and .cse2 (= v_~last~0_185 v_~last~0_185) (= |v_main_#t~post5_322| |v_main_#t~post5_318|) .cse3) (and .cse2 (or (not .cse0) (not .cse1)) .cse3 (= |v_main_#t~post5_318| |v_main_#t~post5_322|)))) InVars {main_~c~0=v_main_~c~0_640, main_#t~post5=|v_main_#t~post5_322|, main_~st~0=v_main_~st~0_239, ~last~0=v_~last~0_185} OutVars{main_#t~post5=|v_main_#t~post5_318|, main_~c~0=v_main_~c~0_639, main_~st~0=v_main_~st~0_238, ~last~0=v_~last~0_185} AuxVars[] AssignedVars[main_#t~post5, main_~c~0, main_~st~0] {27202#(or (not (<= main_~c~0 (+ ~last~0 1))) (and (<= main_~b~0 main_~a~0) (< main_~a~0 (+ main_~b~0 1)) (<= main_~c~0 200000)) (not (= main_~st~0 0)) (< main_~c~0 200000))} is VALID [2022-04-15 06:28:50,362 INFO L290 TraceCheckUtils]: 8: Hoare triple {27206#(and (<= main_~b~0 main_~a~0) (< main_~a~0 (+ main_~b~0 1)) (not (= main_~st~0 0)))} [159] L23-4_primed-->L23-3: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {27206#(and (<= main_~b~0 main_~a~0) (< main_~a~0 (+ main_~b~0 1)) (not (= main_~st~0 0)))} is VALID [2022-04-15 06:28:50,362 INFO L290 TraceCheckUtils]: 7: Hoare triple {27206#(and (<= main_~b~0 main_~a~0) (< main_~a~0 (+ main_~b~0 1)) (not (= main_~st~0 0)))} [158] L23-3-->L23-4_primed: Formula: (let ((.cse0 (= v_~last~0_184 v_main_~c~0_638))) (or (and (= v_~last~0_184 v_~last~0_184) (= |v_main_#t~post5_319| |v_main_#t~post5_317|) (= v_main_~c~0_638 v_main_~c~0_637)) (and (not .cse0) (or (not (<= (+ v_~last~0_184 1) v_main_~c~0_637)) (not (<= (+ v_main_~c~0_638 1) v_~last~0_184))) (< v_main_~c~0_637 200001) (< v_main_~c~0_638 v_main_~c~0_637)) (and (= v_main_~c~0_637 v_main_~c~0_638) (= |v_main_#t~post5_317| |v_main_#t~post5_319|) (or (not (< v_main_~c~0_638 200000)) .cse0)))) InVars {main_~c~0=v_main_~c~0_638, main_#t~post5=|v_main_#t~post5_319|, ~last~0=v_~last~0_184} OutVars{main_#t~post5=|v_main_#t~post5_317|, main_~c~0=v_main_~c~0_637, ~last~0=v_~last~0_184} AuxVars[] AssignedVars[main_#t~post5, main_~c~0] {27206#(and (<= main_~b~0 main_~a~0) (< main_~a~0 (+ main_~b~0 1)) (not (= main_~st~0 0)))} is VALID [2022-04-15 06:28:50,363 INFO L290 TraceCheckUtils]: 6: Hoare triple {27216#(and (<= main_~b~0 main_~a~0) (< main_~a~0 (+ main_~b~0 1)))} assume !false;~st~0 := 1;~c~0 := 0; {27206#(and (<= main_~b~0 main_~a~0) (< main_~a~0 (+ main_~b~0 1)) (not (= main_~st~0 0)))} is VALID [2022-04-15 06:28:50,363 INFO L290 TraceCheckUtils]: 5: Hoare triple {27112#true} assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~last~0 := #t~nondet4;havoc #t~nondet4;~a~0 := 0;~b~0 := 0;~c~0 := 0;~st~0 := 0; {27216#(and (<= main_~b~0 main_~a~0) (< main_~a~0 (+ main_~b~0 1)))} is VALID [2022-04-15 06:28:50,363 INFO L272 TraceCheckUtils]: 4: Hoare triple {27112#true} call #t~ret6 := main(); {27112#true} is VALID [2022-04-15 06:28:50,363 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {27112#true} {27112#true} #66#return; {27112#true} is VALID [2022-04-15 06:28:50,363 INFO L290 TraceCheckUtils]: 2: Hoare triple {27112#true} assume true; {27112#true} is VALID [2022-04-15 06:28:50,363 INFO L290 TraceCheckUtils]: 1: Hoare triple {27112#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(11, 2);call #Ultimate.allocInit(12, 3);~last~0 := 0; {27112#true} is VALID [2022-04-15 06:28:50,364 INFO L272 TraceCheckUtils]: 0: Hoare triple {27112#true} call ULTIMATE.init(); {27112#true} is VALID [2022-04-15 06:28:50,364 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-04-15 06:28:50,364 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [717065577] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 06:28:50,364 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 06:28:50,364 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 9, 9] total 21 [2022-04-15 06:28:51,770 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 06:28:51,770 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [440248322] [2022-04-15 06:28:51,770 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [440248322] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 06:28:51,770 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 06:28:51,770 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [46] imperfect sequences [] total 46 [2022-04-15 06:28:51,770 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [654424539] [2022-04-15 06:28:51,770 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 06:28:51,771 INFO L78 Accepts]: Start accepts. Automaton has has 46 states, 46 states have (on average 1.391304347826087) internal successors, (64), 44 states have internal predecessors, (64), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 68 [2022-04-15 06:28:51,771 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 06:28:51,771 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 46 states, 46 states have (on average 1.391304347826087) internal successors, (64), 44 states have internal predecessors, (64), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:28:51,807 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 68 edges. 68 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 06:28:51,807 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 46 states [2022-04-15 06:28:51,807 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 06:28:51,809 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2022-04-15 06:28:51,809 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=406, Invalid=3016, Unknown=0, NotChecked=0, Total=3422 [2022-04-15 06:28:51,809 INFO L87 Difference]: Start difference. First operand 229 states and 267 transitions. Second operand has 46 states, 46 states have (on average 1.391304347826087) internal successors, (64), 44 states have internal predecessors, (64), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:28:57,525 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:28:57,526 INFO L93 Difference]: Finished difference Result 354 states and 419 transitions. [2022-04-15 06:28:57,526 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 56 states. [2022-04-15 06:28:57,526 INFO L78 Accepts]: Start accepts. Automaton has has 46 states, 46 states have (on average 1.391304347826087) internal successors, (64), 44 states have internal predecessors, (64), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 68 [2022-04-15 06:28:57,526 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 06:28:57,526 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 46 states, 46 states have (on average 1.391304347826087) internal successors, (64), 44 states have internal predecessors, (64), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:28:57,527 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 136 transitions. [2022-04-15 06:28:57,527 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 46 states, 46 states have (on average 1.391304347826087) internal successors, (64), 44 states have internal predecessors, (64), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:28:57,528 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 136 transitions. [2022-04-15 06:28:57,528 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 56 states and 136 transitions. [2022-04-15 06:28:57,596 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 136 edges. 136 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 06:28:57,600 INFO L225 Difference]: With dead ends: 354 [2022-04-15 06:28:57,600 INFO L226 Difference]: Without dead ends: 292 [2022-04-15 06:28:57,601 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 115 GetRequests, 42 SyntacticMatches, 2 SemanticMatches, 71 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1621 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=542, Invalid=4714, Unknown=0, NotChecked=0, Total=5256 [2022-04-15 06:28:57,603 INFO L913 BasicCegarLoop]: 13 mSDtfsCounter, 71 mSDsluCounter, 140 mSDsCounter, 0 mSdLazyCounter, 2911 mSolverCounterSat, 43 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 72 SdHoareTripleChecker+Valid, 153 SdHoareTripleChecker+Invalid, 2954 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 43 IncrementalHoareTripleChecker+Valid, 2911 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.1s IncrementalHoareTripleChecker+Time [2022-04-15 06:28:57,603 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [72 Valid, 153 Invalid, 2954 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [43 Valid, 2911 Invalid, 0 Unknown, 0 Unchecked, 2.1s Time] [2022-04-15 06:28:57,604 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 292 states. [2022-04-15 06:28:58,439 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 292 to 212. [2022-04-15 06:28:58,439 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 06:28:58,440 INFO L82 GeneralOperation]: Start isEquivalent. First operand 292 states. Second operand has 212 states, 204 states have (on average 1.1911764705882353) internal successors, (243), 205 states have internal predecessors, (243), 4 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-15 06:28:58,440 INFO L74 IsIncluded]: Start isIncluded. First operand 292 states. Second operand has 212 states, 204 states have (on average 1.1911764705882353) internal successors, (243), 205 states have internal predecessors, (243), 4 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-15 06:28:58,440 INFO L87 Difference]: Start difference. First operand 292 states. Second operand has 212 states, 204 states have (on average 1.1911764705882353) internal successors, (243), 205 states have internal predecessors, (243), 4 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-15 06:28:58,443 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:28:58,443 INFO L93 Difference]: Finished difference Result 292 states and 343 transitions. [2022-04-15 06:28:58,443 INFO L276 IsEmpty]: Start isEmpty. Operand 292 states and 343 transitions. [2022-04-15 06:28:58,444 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 06:28:58,444 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 06:28:58,444 INFO L74 IsIncluded]: Start isIncluded. First operand has 212 states, 204 states have (on average 1.1911764705882353) internal successors, (243), 205 states have internal predecessors, (243), 4 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) Second operand 292 states. [2022-04-15 06:28:58,444 INFO L87 Difference]: Start difference. First operand has 212 states, 204 states have (on average 1.1911764705882353) internal successors, (243), 205 states have internal predecessors, (243), 4 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) Second operand 292 states. [2022-04-15 06:28:58,447 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:28:58,447 INFO L93 Difference]: Finished difference Result 292 states and 343 transitions. [2022-04-15 06:28:58,448 INFO L276 IsEmpty]: Start isEmpty. Operand 292 states and 343 transitions. [2022-04-15 06:28:58,448 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 06:28:58,448 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 06:28:58,448 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 06:28:58,448 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 06:28:58,448 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 212 states, 204 states have (on average 1.1911764705882353) internal successors, (243), 205 states have internal predecessors, (243), 4 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-15 06:28:58,451 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 212 states to 212 states and 250 transitions. [2022-04-15 06:28:58,451 INFO L78 Accepts]: Start accepts. Automaton has 212 states and 250 transitions. Word has length 68 [2022-04-15 06:28:58,451 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 06:28:58,451 INFO L478 AbstractCegarLoop]: Abstraction has 212 states and 250 transitions. [2022-04-15 06:28:58,451 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 46 states, 46 states have (on average 1.391304347826087) internal successors, (64), 44 states have internal predecessors, (64), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:28:58,451 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 212 states and 250 transitions. [2022-04-15 06:28:59,003 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 250 edges. 250 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 06:28:59,003 INFO L276 IsEmpty]: Start isEmpty. Operand 212 states and 250 transitions. [2022-04-15 06:28:59,004 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2022-04-15 06:28:59,004 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 06:28:59,004 INFO L499 BasicCegarLoop]: trace histogram [16, 16, 14, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 06:28:59,021 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (25)] Forceful destruction successful, exit code 0 [2022-04-15 06:28:59,219 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 25 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable28 [2022-04-15 06:28:59,219 INFO L403 AbstractCegarLoop]: === Iteration 30 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 06:28:59,220 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 06:28:59,220 INFO L85 PathProgramCache]: Analyzing trace with hash 332420354, now seen corresponding path program 7 times [2022-04-15 06:28:59,220 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 06:28:59,220 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [140918262] [2022-04-15 06:28:59,345 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 4 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {0={1=2}, 1={1=1, 2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-15 06:28:59,346 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-15 06:28:59,346 INFO L85 PathProgramCache]: Analyzing trace with hash 1427225587, now seen corresponding path program 1 times [2022-04-15 06:28:59,346 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 06:28:59,346 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2142877614] [2022-04-15 06:28:59,346 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 06:28:59,346 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 06:28:59,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:28:59,471 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 06:28:59,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:28:59,474 INFO L290 TraceCheckUtils]: 0: Hoare triple {29033#(and (= ~last~0 |old(~last~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(11, 2);call #Ultimate.allocInit(12, 3);~last~0 := 0; {29019#true} is VALID [2022-04-15 06:28:59,474 INFO L290 TraceCheckUtils]: 1: Hoare triple {29019#true} assume true; {29019#true} is VALID [2022-04-15 06:28:59,474 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {29019#true} {29019#true} #66#return; {29019#true} is VALID [2022-04-15 06:28:59,475 INFO L272 TraceCheckUtils]: 0: Hoare triple {29019#true} call ULTIMATE.init(); {29033#(and (= ~last~0 |old(~last~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 06:28:59,475 INFO L290 TraceCheckUtils]: 1: Hoare triple {29033#(and (= ~last~0 |old(~last~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(11, 2);call #Ultimate.allocInit(12, 3);~last~0 := 0; {29019#true} is VALID [2022-04-15 06:28:59,475 INFO L290 TraceCheckUtils]: 2: Hoare triple {29019#true} assume true; {29019#true} is VALID [2022-04-15 06:28:59,475 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {29019#true} {29019#true} #66#return; {29019#true} is VALID [2022-04-15 06:28:59,475 INFO L272 TraceCheckUtils]: 4: Hoare triple {29019#true} call #t~ret6 := main(); {29019#true} is VALID [2022-04-15 06:28:59,475 INFO L290 TraceCheckUtils]: 5: Hoare triple {29019#true} assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~last~0 := #t~nondet4;havoc #t~nondet4;~a~0 := 0;~b~0 := 0;~c~0 := 0;~st~0 := 0; {29019#true} is VALID [2022-04-15 06:28:59,475 INFO L290 TraceCheckUtils]: 6: Hoare triple {29019#true} [162] L30-->L23-3_primed: Formula: (and (= v_main_~a~0_131 v_main_~a~0_130) (= v_main_~b~0_128 v_main_~b~0_127) (= |v_main_#t~post5_338| |v_main_#t~post5_330|) (= v_main_~st~0_249 v_main_~st~0_247) (= v_main_~c~0_683 v_main_~c~0_674)) InVars {main_~c~0=v_main_~c~0_683, main_#t~post5=|v_main_#t~post5_338|, main_~st~0=v_main_~st~0_249, main_~b~0=v_main_~b~0_128, main_~a~0=v_main_~a~0_131} OutVars{main_~c~0=v_main_~c~0_674, main_#t~post5=|v_main_#t~post5_330|, main_~st~0=v_main_~st~0_247, main_~b~0=v_main_~b~0_127, main_~a~0=v_main_~a~0_130} AuxVars[] AssignedVars[main_~c~0, main_#t~post5, main_~st~0, main_~b~0, main_~a~0] {29019#true} is VALID [2022-04-15 06:28:59,475 INFO L290 TraceCheckUtils]: 7: Hoare triple {29019#true} [161] L23-3_primed-->L23-3: Formula: (and (= v_main_~c~0_7 0) (= v_main_~st~0_6 1)) InVars {} OutVars{main_~c~0=v_main_~c~0_7, main_~st~0=v_main_~st~0_6} AuxVars[] AssignedVars[main_~c~0, main_~st~0] {29024#(= main_~c~0 0)} is VALID [2022-04-15 06:28:59,476 INFO L290 TraceCheckUtils]: 8: Hoare triple {29024#(= main_~c~0 0)} assume !!(~c~0 < 200000); {29024#(= main_~c~0 0)} is VALID [2022-04-15 06:28:59,476 INFO L290 TraceCheckUtils]: 9: Hoare triple {29024#(= main_~c~0 0)} assume ~c~0 == ~last~0;~st~0 := 0; {29024#(= main_~c~0 0)} is VALID [2022-04-15 06:28:59,476 INFO L290 TraceCheckUtils]: 10: Hoare triple {29024#(= main_~c~0 0)} #t~post5 := ~c~0;~c~0 := 1 + #t~post5;havoc #t~post5; {29025#(<= main_~c~0 1)} is VALID [2022-04-15 06:28:59,477 INFO L290 TraceCheckUtils]: 11: Hoare triple {29025#(<= main_~c~0 1)} assume !!(~c~0 < 200000); {29025#(<= main_~c~0 1)} is VALID [2022-04-15 06:28:59,477 INFO L290 TraceCheckUtils]: 12: Hoare triple {29025#(<= main_~c~0 1)} assume !(~c~0 == ~last~0); {29025#(<= main_~c~0 1)} is VALID [2022-04-15 06:28:59,477 INFO L290 TraceCheckUtils]: 13: Hoare triple {29025#(<= main_~c~0 1)} #t~post5 := ~c~0;~c~0 := 1 + #t~post5;havoc #t~post5; {29026#(<= main_~c~0 2)} is VALID [2022-04-15 06:28:59,478 INFO L290 TraceCheckUtils]: 14: Hoare triple {29026#(<= main_~c~0 2)} assume !!(~c~0 < 200000); {29026#(<= main_~c~0 2)} is VALID [2022-04-15 06:28:59,478 INFO L290 TraceCheckUtils]: 15: Hoare triple {29026#(<= main_~c~0 2)} assume !(~c~0 == ~last~0); {29026#(<= main_~c~0 2)} is VALID [2022-04-15 06:28:59,478 INFO L290 TraceCheckUtils]: 16: Hoare triple {29026#(<= main_~c~0 2)} #t~post5 := ~c~0;~c~0 := 1 + #t~post5;havoc #t~post5; {29027#(<= main_~c~0 3)} is VALID [2022-04-15 06:28:59,479 INFO L290 TraceCheckUtils]: 17: Hoare triple {29027#(<= main_~c~0 3)} assume !!(~c~0 < 200000); {29027#(<= main_~c~0 3)} is VALID [2022-04-15 06:28:59,479 INFO L290 TraceCheckUtils]: 18: Hoare triple {29027#(<= main_~c~0 3)} assume !(~c~0 == ~last~0); {29027#(<= main_~c~0 3)} is VALID [2022-04-15 06:28:59,479 INFO L290 TraceCheckUtils]: 19: Hoare triple {29027#(<= main_~c~0 3)} #t~post5 := ~c~0;~c~0 := 1 + #t~post5;havoc #t~post5; {29028#(<= main_~c~0 4)} is VALID [2022-04-15 06:28:59,480 INFO L290 TraceCheckUtils]: 20: Hoare triple {29028#(<= main_~c~0 4)} assume !!(~c~0 < 200000); {29028#(<= main_~c~0 4)} is VALID [2022-04-15 06:28:59,480 INFO L290 TraceCheckUtils]: 21: Hoare triple {29028#(<= main_~c~0 4)} assume !(~c~0 == ~last~0); {29028#(<= main_~c~0 4)} is VALID [2022-04-15 06:28:59,481 INFO L290 TraceCheckUtils]: 22: Hoare triple {29028#(<= main_~c~0 4)} #t~post5 := ~c~0;~c~0 := 1 + #t~post5;havoc #t~post5; {29029#(<= main_~c~0 5)} is VALID [2022-04-15 06:28:59,481 INFO L290 TraceCheckUtils]: 23: Hoare triple {29029#(<= main_~c~0 5)} assume !!(~c~0 < 200000); {29029#(<= main_~c~0 5)} is VALID [2022-04-15 06:28:59,481 INFO L290 TraceCheckUtils]: 24: Hoare triple {29029#(<= main_~c~0 5)} assume !(~c~0 == ~last~0); {29029#(<= main_~c~0 5)} is VALID [2022-04-15 06:28:59,482 INFO L290 TraceCheckUtils]: 25: Hoare triple {29029#(<= main_~c~0 5)} #t~post5 := ~c~0;~c~0 := 1 + #t~post5;havoc #t~post5; {29030#(<= main_~c~0 6)} is VALID [2022-04-15 06:28:59,482 INFO L290 TraceCheckUtils]: 26: Hoare triple {29030#(<= main_~c~0 6)} assume !!(~c~0 < 200000); {29030#(<= main_~c~0 6)} is VALID [2022-04-15 06:28:59,482 INFO L290 TraceCheckUtils]: 27: Hoare triple {29030#(<= main_~c~0 6)} assume !(~c~0 == ~last~0); {29030#(<= main_~c~0 6)} is VALID [2022-04-15 06:28:59,483 INFO L290 TraceCheckUtils]: 28: Hoare triple {29030#(<= main_~c~0 6)} #t~post5 := ~c~0;~c~0 := 1 + #t~post5;havoc #t~post5; {29031#(<= main_~c~0 7)} is VALID [2022-04-15 06:28:59,483 INFO L290 TraceCheckUtils]: 29: Hoare triple {29031#(<= main_~c~0 7)} assume !!(~c~0 < 200000); {29031#(<= main_~c~0 7)} is VALID [2022-04-15 06:28:59,483 INFO L290 TraceCheckUtils]: 30: Hoare triple {29031#(<= main_~c~0 7)} assume !(~c~0 == ~last~0); {29031#(<= main_~c~0 7)} is VALID [2022-04-15 06:28:59,484 INFO L290 TraceCheckUtils]: 31: Hoare triple {29031#(<= main_~c~0 7)} #t~post5 := ~c~0;~c~0 := 1 + #t~post5;havoc #t~post5; {29032#(<= main_~c~0 8)} is VALID [2022-04-15 06:28:59,484 INFO L290 TraceCheckUtils]: 32: Hoare triple {29032#(<= main_~c~0 8)} assume !(~c~0 < 200000); {29020#false} is VALID [2022-04-15 06:28:59,484 INFO L290 TraceCheckUtils]: 33: Hoare triple {29020#false} assume 0 == ~st~0 && ~c~0 == 1 + ~last~0;~a~0 := 3 + ~a~0;~b~0 := 3 + ~b~0; {29020#false} is VALID [2022-04-15 06:28:59,484 INFO L290 TraceCheckUtils]: 34: Hoare triple {29020#false} assume !(~c~0 == ~last~0 && 0 == ~st~0); {29020#false} is VALID [2022-04-15 06:28:59,484 INFO L272 TraceCheckUtils]: 35: Hoare triple {29020#false} call __VERIFIER_assert((if ~a~0 == ~b~0 && 200000 == ~c~0 then 1 else 0)); {29020#false} is VALID [2022-04-15 06:28:59,484 INFO L290 TraceCheckUtils]: 36: Hoare triple {29020#false} ~cond := #in~cond; {29020#false} is VALID [2022-04-15 06:28:59,484 INFO L290 TraceCheckUtils]: 37: Hoare triple {29020#false} assume 0 == ~cond; {29020#false} is VALID [2022-04-15 06:28:59,484 INFO L290 TraceCheckUtils]: 38: Hoare triple {29020#false} assume !false; {29020#false} is VALID [2022-04-15 06:28:59,485 INFO L134 CoverageAnalysis]: Checked inductivity of 92 backedges. 0 proven. 92 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 06:28:59,485 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 06:28:59,485 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2142877614] [2022-04-15 06:28:59,485 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2142877614] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 06:28:59,485 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1770028266] [2022-04-15 06:28:59,485 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 06:28:59,485 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 06:28:59,485 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 06:28:59,492 INFO L229 MonitoredProcess]: Starting monitored process 26 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-15 06:28:59,493 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (26)] Waiting until timeout for monitored process [2022-04-15 06:28:59,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:28:59,523 INFO L263 TraceCheckSpWp]: Trace formula consists of 127 conjuncts, 10 conjunts are in the unsatisfiable core [2022-04-15 06:28:59,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:28:59,532 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 06:28:59,703 INFO L272 TraceCheckUtils]: 0: Hoare triple {29019#true} call ULTIMATE.init(); {29019#true} is VALID [2022-04-15 06:28:59,704 INFO L290 TraceCheckUtils]: 1: Hoare triple {29019#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(11, 2);call #Ultimate.allocInit(12, 3);~last~0 := 0; {29019#true} is VALID [2022-04-15 06:28:59,704 INFO L290 TraceCheckUtils]: 2: Hoare triple {29019#true} assume true; {29019#true} is VALID [2022-04-15 06:28:59,704 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {29019#true} {29019#true} #66#return; {29019#true} is VALID [2022-04-15 06:28:59,704 INFO L272 TraceCheckUtils]: 4: Hoare triple {29019#true} call #t~ret6 := main(); {29019#true} is VALID [2022-04-15 06:28:59,704 INFO L290 TraceCheckUtils]: 5: Hoare triple {29019#true} assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~last~0 := #t~nondet4;havoc #t~nondet4;~a~0 := 0;~b~0 := 0;~c~0 := 0;~st~0 := 0; {29019#true} is VALID [2022-04-15 06:28:59,704 INFO L290 TraceCheckUtils]: 6: Hoare triple {29019#true} [162] L30-->L23-3_primed: Formula: (and (= v_main_~a~0_131 v_main_~a~0_130) (= v_main_~b~0_128 v_main_~b~0_127) (= |v_main_#t~post5_338| |v_main_#t~post5_330|) (= v_main_~st~0_249 v_main_~st~0_247) (= v_main_~c~0_683 v_main_~c~0_674)) InVars {main_~c~0=v_main_~c~0_683, main_#t~post5=|v_main_#t~post5_338|, main_~st~0=v_main_~st~0_249, main_~b~0=v_main_~b~0_128, main_~a~0=v_main_~a~0_131} OutVars{main_~c~0=v_main_~c~0_674, main_#t~post5=|v_main_#t~post5_330|, main_~st~0=v_main_~st~0_247, main_~b~0=v_main_~b~0_127, main_~a~0=v_main_~a~0_130} AuxVars[] AssignedVars[main_~c~0, main_#t~post5, main_~st~0, main_~b~0, main_~a~0] {29019#true} is VALID [2022-04-15 06:28:59,704 INFO L290 TraceCheckUtils]: 7: Hoare triple {29019#true} [161] L23-3_primed-->L23-3: Formula: (and (= v_main_~c~0_7 0) (= v_main_~st~0_6 1)) InVars {} OutVars{main_~c~0=v_main_~c~0_7, main_~st~0=v_main_~st~0_6} AuxVars[] AssignedVars[main_~c~0, main_~st~0] {29058#(<= main_~c~0 0)} is VALID [2022-04-15 06:28:59,705 INFO L290 TraceCheckUtils]: 8: Hoare triple {29058#(<= main_~c~0 0)} assume !!(~c~0 < 200000); {29058#(<= main_~c~0 0)} is VALID [2022-04-15 06:28:59,705 INFO L290 TraceCheckUtils]: 9: Hoare triple {29058#(<= main_~c~0 0)} assume ~c~0 == ~last~0;~st~0 := 0; {29058#(<= main_~c~0 0)} is VALID [2022-04-15 06:28:59,705 INFO L290 TraceCheckUtils]: 10: Hoare triple {29058#(<= main_~c~0 0)} #t~post5 := ~c~0;~c~0 := 1 + #t~post5;havoc #t~post5; {29025#(<= main_~c~0 1)} is VALID [2022-04-15 06:28:59,706 INFO L290 TraceCheckUtils]: 11: Hoare triple {29025#(<= main_~c~0 1)} assume !!(~c~0 < 200000); {29025#(<= main_~c~0 1)} is VALID [2022-04-15 06:28:59,706 INFO L290 TraceCheckUtils]: 12: Hoare triple {29025#(<= main_~c~0 1)} assume !(~c~0 == ~last~0); {29025#(<= main_~c~0 1)} is VALID [2022-04-15 06:28:59,706 INFO L290 TraceCheckUtils]: 13: Hoare triple {29025#(<= main_~c~0 1)} #t~post5 := ~c~0;~c~0 := 1 + #t~post5;havoc #t~post5; {29026#(<= main_~c~0 2)} is VALID [2022-04-15 06:28:59,707 INFO L290 TraceCheckUtils]: 14: Hoare triple {29026#(<= main_~c~0 2)} assume !!(~c~0 < 200000); {29026#(<= main_~c~0 2)} is VALID [2022-04-15 06:28:59,707 INFO L290 TraceCheckUtils]: 15: Hoare triple {29026#(<= main_~c~0 2)} assume !(~c~0 == ~last~0); {29026#(<= main_~c~0 2)} is VALID [2022-04-15 06:28:59,707 INFO L290 TraceCheckUtils]: 16: Hoare triple {29026#(<= main_~c~0 2)} #t~post5 := ~c~0;~c~0 := 1 + #t~post5;havoc #t~post5; {29027#(<= main_~c~0 3)} is VALID [2022-04-15 06:28:59,707 INFO L290 TraceCheckUtils]: 17: Hoare triple {29027#(<= main_~c~0 3)} assume !!(~c~0 < 200000); {29027#(<= main_~c~0 3)} is VALID [2022-04-15 06:28:59,708 INFO L290 TraceCheckUtils]: 18: Hoare triple {29027#(<= main_~c~0 3)} assume !(~c~0 == ~last~0); {29027#(<= main_~c~0 3)} is VALID [2022-04-15 06:28:59,708 INFO L290 TraceCheckUtils]: 19: Hoare triple {29027#(<= main_~c~0 3)} #t~post5 := ~c~0;~c~0 := 1 + #t~post5;havoc #t~post5; {29028#(<= main_~c~0 4)} is VALID [2022-04-15 06:28:59,708 INFO L290 TraceCheckUtils]: 20: Hoare triple {29028#(<= main_~c~0 4)} assume !!(~c~0 < 200000); {29028#(<= main_~c~0 4)} is VALID [2022-04-15 06:28:59,709 INFO L290 TraceCheckUtils]: 21: Hoare triple {29028#(<= main_~c~0 4)} assume !(~c~0 == ~last~0); {29028#(<= main_~c~0 4)} is VALID [2022-04-15 06:28:59,709 INFO L290 TraceCheckUtils]: 22: Hoare triple {29028#(<= main_~c~0 4)} #t~post5 := ~c~0;~c~0 := 1 + #t~post5;havoc #t~post5; {29029#(<= main_~c~0 5)} is VALID [2022-04-15 06:28:59,709 INFO L290 TraceCheckUtils]: 23: Hoare triple {29029#(<= main_~c~0 5)} assume !!(~c~0 < 200000); {29029#(<= main_~c~0 5)} is VALID [2022-04-15 06:28:59,710 INFO L290 TraceCheckUtils]: 24: Hoare triple {29029#(<= main_~c~0 5)} assume !(~c~0 == ~last~0); {29029#(<= main_~c~0 5)} is VALID [2022-04-15 06:28:59,710 INFO L290 TraceCheckUtils]: 25: Hoare triple {29029#(<= main_~c~0 5)} #t~post5 := ~c~0;~c~0 := 1 + #t~post5;havoc #t~post5; {29030#(<= main_~c~0 6)} is VALID [2022-04-15 06:28:59,710 INFO L290 TraceCheckUtils]: 26: Hoare triple {29030#(<= main_~c~0 6)} assume !!(~c~0 < 200000); {29030#(<= main_~c~0 6)} is VALID [2022-04-15 06:28:59,711 INFO L290 TraceCheckUtils]: 27: Hoare triple {29030#(<= main_~c~0 6)} assume !(~c~0 == ~last~0); {29030#(<= main_~c~0 6)} is VALID [2022-04-15 06:28:59,711 INFO L290 TraceCheckUtils]: 28: Hoare triple {29030#(<= main_~c~0 6)} #t~post5 := ~c~0;~c~0 := 1 + #t~post5;havoc #t~post5; {29031#(<= main_~c~0 7)} is VALID [2022-04-15 06:28:59,711 INFO L290 TraceCheckUtils]: 29: Hoare triple {29031#(<= main_~c~0 7)} assume !!(~c~0 < 200000); {29031#(<= main_~c~0 7)} is VALID [2022-04-15 06:28:59,712 INFO L290 TraceCheckUtils]: 30: Hoare triple {29031#(<= main_~c~0 7)} assume !(~c~0 == ~last~0); {29031#(<= main_~c~0 7)} is VALID [2022-04-15 06:28:59,712 INFO L290 TraceCheckUtils]: 31: Hoare triple {29031#(<= main_~c~0 7)} #t~post5 := ~c~0;~c~0 := 1 + #t~post5;havoc #t~post5; {29032#(<= main_~c~0 8)} is VALID [2022-04-15 06:28:59,712 INFO L290 TraceCheckUtils]: 32: Hoare triple {29032#(<= main_~c~0 8)} assume !(~c~0 < 200000); {29020#false} is VALID [2022-04-15 06:28:59,712 INFO L290 TraceCheckUtils]: 33: Hoare triple {29020#false} assume 0 == ~st~0 && ~c~0 == 1 + ~last~0;~a~0 := 3 + ~a~0;~b~0 := 3 + ~b~0; {29020#false} is VALID [2022-04-15 06:28:59,712 INFO L290 TraceCheckUtils]: 34: Hoare triple {29020#false} assume !(~c~0 == ~last~0 && 0 == ~st~0); {29020#false} is VALID [2022-04-15 06:28:59,712 INFO L272 TraceCheckUtils]: 35: Hoare triple {29020#false} call __VERIFIER_assert((if ~a~0 == ~b~0 && 200000 == ~c~0 then 1 else 0)); {29020#false} is VALID [2022-04-15 06:28:59,713 INFO L290 TraceCheckUtils]: 36: Hoare triple {29020#false} ~cond := #in~cond; {29020#false} is VALID [2022-04-15 06:28:59,713 INFO L290 TraceCheckUtils]: 37: Hoare triple {29020#false} assume 0 == ~cond; {29020#false} is VALID [2022-04-15 06:28:59,713 INFO L290 TraceCheckUtils]: 38: Hoare triple {29020#false} assume !false; {29020#false} is VALID [2022-04-15 06:28:59,713 INFO L134 CoverageAnalysis]: Checked inductivity of 92 backedges. 0 proven. 92 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 06:28:59,713 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 06:28:59,971 INFO L290 TraceCheckUtils]: 38: Hoare triple {29020#false} assume !false; {29020#false} is VALID [2022-04-15 06:28:59,971 INFO L290 TraceCheckUtils]: 37: Hoare triple {29020#false} assume 0 == ~cond; {29020#false} is VALID [2022-04-15 06:28:59,971 INFO L290 TraceCheckUtils]: 36: Hoare triple {29020#false} ~cond := #in~cond; {29020#false} is VALID [2022-04-15 06:28:59,971 INFO L272 TraceCheckUtils]: 35: Hoare triple {29020#false} call __VERIFIER_assert((if ~a~0 == ~b~0 && 200000 == ~c~0 then 1 else 0)); {29020#false} is VALID [2022-04-15 06:28:59,972 INFO L290 TraceCheckUtils]: 34: Hoare triple {29020#false} assume !(~c~0 == ~last~0 && 0 == ~st~0); {29020#false} is VALID [2022-04-15 06:28:59,972 INFO L290 TraceCheckUtils]: 33: Hoare triple {29020#false} assume 0 == ~st~0 && ~c~0 == 1 + ~last~0;~a~0 := 3 + ~a~0;~b~0 := 3 + ~b~0; {29020#false} is VALID [2022-04-15 06:28:59,972 INFO L290 TraceCheckUtils]: 32: Hoare triple {29170#(< main_~c~0 200000)} assume !(~c~0 < 200000); {29020#false} is VALID [2022-04-15 06:28:59,972 INFO L290 TraceCheckUtils]: 31: Hoare triple {29174#(< main_~c~0 199999)} #t~post5 := ~c~0;~c~0 := 1 + #t~post5;havoc #t~post5; {29170#(< main_~c~0 200000)} is VALID [2022-04-15 06:28:59,973 INFO L290 TraceCheckUtils]: 30: Hoare triple {29174#(< main_~c~0 199999)} assume !(~c~0 == ~last~0); {29174#(< main_~c~0 199999)} is VALID [2022-04-15 06:28:59,973 INFO L290 TraceCheckUtils]: 29: Hoare triple {29174#(< main_~c~0 199999)} assume !!(~c~0 < 200000); {29174#(< main_~c~0 199999)} is VALID [2022-04-15 06:28:59,973 INFO L290 TraceCheckUtils]: 28: Hoare triple {29184#(< main_~c~0 199998)} #t~post5 := ~c~0;~c~0 := 1 + #t~post5;havoc #t~post5; {29174#(< main_~c~0 199999)} is VALID [2022-04-15 06:28:59,973 INFO L290 TraceCheckUtils]: 27: Hoare triple {29184#(< main_~c~0 199998)} assume !(~c~0 == ~last~0); {29184#(< main_~c~0 199998)} is VALID [2022-04-15 06:28:59,974 INFO L290 TraceCheckUtils]: 26: Hoare triple {29184#(< main_~c~0 199998)} assume !!(~c~0 < 200000); {29184#(< main_~c~0 199998)} is VALID [2022-04-15 06:28:59,974 INFO L290 TraceCheckUtils]: 25: Hoare triple {29194#(< main_~c~0 199997)} #t~post5 := ~c~0;~c~0 := 1 + #t~post5;havoc #t~post5; {29184#(< main_~c~0 199998)} is VALID [2022-04-15 06:28:59,974 INFO L290 TraceCheckUtils]: 24: Hoare triple {29194#(< main_~c~0 199997)} assume !(~c~0 == ~last~0); {29194#(< main_~c~0 199997)} is VALID [2022-04-15 06:28:59,975 INFO L290 TraceCheckUtils]: 23: Hoare triple {29194#(< main_~c~0 199997)} assume !!(~c~0 < 200000); {29194#(< main_~c~0 199997)} is VALID [2022-04-15 06:28:59,975 INFO L290 TraceCheckUtils]: 22: Hoare triple {29204#(< main_~c~0 199996)} #t~post5 := ~c~0;~c~0 := 1 + #t~post5;havoc #t~post5; {29194#(< main_~c~0 199997)} is VALID [2022-04-15 06:28:59,975 INFO L290 TraceCheckUtils]: 21: Hoare triple {29204#(< main_~c~0 199996)} assume !(~c~0 == ~last~0); {29204#(< main_~c~0 199996)} is VALID [2022-04-15 06:28:59,976 INFO L290 TraceCheckUtils]: 20: Hoare triple {29204#(< main_~c~0 199996)} assume !!(~c~0 < 200000); {29204#(< main_~c~0 199996)} is VALID [2022-04-15 06:28:59,976 INFO L290 TraceCheckUtils]: 19: Hoare triple {29214#(< main_~c~0 199995)} #t~post5 := ~c~0;~c~0 := 1 + #t~post5;havoc #t~post5; {29204#(< main_~c~0 199996)} is VALID [2022-04-15 06:28:59,976 INFO L290 TraceCheckUtils]: 18: Hoare triple {29214#(< main_~c~0 199995)} assume !(~c~0 == ~last~0); {29214#(< main_~c~0 199995)} is VALID [2022-04-15 06:28:59,976 INFO L290 TraceCheckUtils]: 17: Hoare triple {29214#(< main_~c~0 199995)} assume !!(~c~0 < 200000); {29214#(< main_~c~0 199995)} is VALID [2022-04-15 06:28:59,977 INFO L290 TraceCheckUtils]: 16: Hoare triple {29224#(< main_~c~0 199994)} #t~post5 := ~c~0;~c~0 := 1 + #t~post5;havoc #t~post5; {29214#(< main_~c~0 199995)} is VALID [2022-04-15 06:28:59,977 INFO L290 TraceCheckUtils]: 15: Hoare triple {29224#(< main_~c~0 199994)} assume !(~c~0 == ~last~0); {29224#(< main_~c~0 199994)} is VALID [2022-04-15 06:28:59,977 INFO L290 TraceCheckUtils]: 14: Hoare triple {29224#(< main_~c~0 199994)} assume !!(~c~0 < 200000); {29224#(< main_~c~0 199994)} is VALID [2022-04-15 06:28:59,978 INFO L290 TraceCheckUtils]: 13: Hoare triple {29234#(< main_~c~0 199993)} #t~post5 := ~c~0;~c~0 := 1 + #t~post5;havoc #t~post5; {29224#(< main_~c~0 199994)} is VALID [2022-04-15 06:28:59,978 INFO L290 TraceCheckUtils]: 12: Hoare triple {29234#(< main_~c~0 199993)} assume !(~c~0 == ~last~0); {29234#(< main_~c~0 199993)} is VALID [2022-04-15 06:28:59,978 INFO L290 TraceCheckUtils]: 11: Hoare triple {29234#(< main_~c~0 199993)} assume !!(~c~0 < 200000); {29234#(< main_~c~0 199993)} is VALID [2022-04-15 06:28:59,979 INFO L290 TraceCheckUtils]: 10: Hoare triple {29244#(< main_~c~0 199992)} #t~post5 := ~c~0;~c~0 := 1 + #t~post5;havoc #t~post5; {29234#(< main_~c~0 199993)} is VALID [2022-04-15 06:28:59,979 INFO L290 TraceCheckUtils]: 9: Hoare triple {29244#(< main_~c~0 199992)} assume ~c~0 == ~last~0;~st~0 := 0; {29244#(< main_~c~0 199992)} is VALID [2022-04-15 06:28:59,979 INFO L290 TraceCheckUtils]: 8: Hoare triple {29244#(< main_~c~0 199992)} assume !!(~c~0 < 200000); {29244#(< main_~c~0 199992)} is VALID [2022-04-15 06:28:59,980 INFO L290 TraceCheckUtils]: 7: Hoare triple {29019#true} [161] L23-3_primed-->L23-3: Formula: (and (= v_main_~c~0_7 0) (= v_main_~st~0_6 1)) InVars {} OutVars{main_~c~0=v_main_~c~0_7, main_~st~0=v_main_~st~0_6} AuxVars[] AssignedVars[main_~c~0, main_~st~0] {29244#(< main_~c~0 199992)} is VALID [2022-04-15 06:28:59,980 INFO L290 TraceCheckUtils]: 6: Hoare triple {29019#true} [162] L30-->L23-3_primed: Formula: (and (= v_main_~a~0_131 v_main_~a~0_130) (= v_main_~b~0_128 v_main_~b~0_127) (= |v_main_#t~post5_338| |v_main_#t~post5_330|) (= v_main_~st~0_249 v_main_~st~0_247) (= v_main_~c~0_683 v_main_~c~0_674)) InVars {main_~c~0=v_main_~c~0_683, main_#t~post5=|v_main_#t~post5_338|, main_~st~0=v_main_~st~0_249, main_~b~0=v_main_~b~0_128, main_~a~0=v_main_~a~0_131} OutVars{main_~c~0=v_main_~c~0_674, main_#t~post5=|v_main_#t~post5_330|, main_~st~0=v_main_~st~0_247, main_~b~0=v_main_~b~0_127, main_~a~0=v_main_~a~0_130} AuxVars[] AssignedVars[main_~c~0, main_#t~post5, main_~st~0, main_~b~0, main_~a~0] {29019#true} is VALID [2022-04-15 06:28:59,980 INFO L290 TraceCheckUtils]: 5: Hoare triple {29019#true} assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~last~0 := #t~nondet4;havoc #t~nondet4;~a~0 := 0;~b~0 := 0;~c~0 := 0;~st~0 := 0; {29019#true} is VALID [2022-04-15 06:28:59,980 INFO L272 TraceCheckUtils]: 4: Hoare triple {29019#true} call #t~ret6 := main(); {29019#true} is VALID [2022-04-15 06:28:59,980 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {29019#true} {29019#true} #66#return; {29019#true} is VALID [2022-04-15 06:28:59,980 INFO L290 TraceCheckUtils]: 2: Hoare triple {29019#true} assume true; {29019#true} is VALID [2022-04-15 06:28:59,980 INFO L290 TraceCheckUtils]: 1: Hoare triple {29019#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(11, 2);call #Ultimate.allocInit(12, 3);~last~0 := 0; {29019#true} is VALID [2022-04-15 06:28:59,980 INFO L272 TraceCheckUtils]: 0: Hoare triple {29019#true} call ULTIMATE.init(); {29019#true} is VALID [2022-04-15 06:28:59,980 INFO L134 CoverageAnalysis]: Checked inductivity of 92 backedges. 0 proven. 92 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 06:28:59,980 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1770028266] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 06:28:59,980 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 06:28:59,980 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 11, 11] total 22 [2022-04-15 06:29:00,216 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 06:29:00,216 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [140918262] [2022-04-15 06:29:00,216 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [140918262] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 06:29:00,216 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 06:29:00,216 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [22] imperfect sequences [] total 22 [2022-04-15 06:29:00,216 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2050666581] [2022-04-15 06:29:00,217 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 06:29:00,217 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 22 states have (on average 2.8636363636363638) internal successors, (63), 21 states have internal predecessors, (63), 2 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 71 [2022-04-15 06:29:00,217 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 06:29:00,217 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 22 states, 22 states have (on average 2.8636363636363638) internal successors, (63), 21 states have internal predecessors, (63), 2 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-15 06:29:00,260 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 68 edges. 68 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 06:29:00,260 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2022-04-15 06:29:00,260 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 06:29:00,260 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2022-04-15 06:29:00,261 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=378, Invalid=614, Unknown=0, NotChecked=0, Total=992 [2022-04-15 06:29:00,261 INFO L87 Difference]: Start difference. First operand 212 states and 250 transitions. Second operand has 22 states, 22 states have (on average 2.8636363636363638) internal successors, (63), 21 states have internal predecessors, (63), 2 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-15 06:29:01,728 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:29:01,729 INFO L93 Difference]: Finished difference Result 379 states and 446 transitions. [2022-04-15 06:29:01,729 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2022-04-15 06:29:01,729 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 22 states have (on average 2.8636363636363638) internal successors, (63), 21 states have internal predecessors, (63), 2 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 71 [2022-04-15 06:29:01,729 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 06:29:01,729 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22 states, 22 states have (on average 2.8636363636363638) internal successors, (63), 21 states have internal predecessors, (63), 2 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-15 06:29:01,730 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 102 transitions. [2022-04-15 06:29:01,730 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22 states, 22 states have (on average 2.8636363636363638) internal successors, (63), 21 states have internal predecessors, (63), 2 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-15 06:29:01,730 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 102 transitions. [2022-04-15 06:29:01,730 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 22 states and 102 transitions. [2022-04-15 06:29:01,796 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-15 06:29:01,799 INFO L225 Difference]: With dead ends: 379 [2022-04-15 06:29:01,799 INFO L226 Difference]: Without dead ends: 309 [2022-04-15 06:29:01,800 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 131 GetRequests, 89 SyntacticMatches, 12 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 813 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=378, Invalid=614, Unknown=0, NotChecked=0, Total=992 [2022-04-15 06:29:01,800 INFO L913 BasicCegarLoop]: 18 mSDtfsCounter, 63 mSDsluCounter, 11 mSDsCounter, 0 mSdLazyCounter, 367 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 63 SdHoareTripleChecker+Valid, 29 SdHoareTripleChecker+Invalid, 385 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 367 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-04-15 06:29:01,800 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [63 Valid, 29 Invalid, 385 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 367 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-04-15 06:29:01,801 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 309 states. [2022-04-15 06:29:02,814 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 309 to 241. [2022-04-15 06:29:02,814 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 06:29:02,815 INFO L82 GeneralOperation]: Start isEquivalent. First operand 309 states. Second operand has 241 states, 233 states have (on average 1.1759656652360515) internal successors, (274), 234 states have internal predecessors, (274), 4 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-15 06:29:02,815 INFO L74 IsIncluded]: Start isIncluded. First operand 309 states. Second operand has 241 states, 233 states have (on average 1.1759656652360515) internal successors, (274), 234 states have internal predecessors, (274), 4 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-15 06:29:02,815 INFO L87 Difference]: Start difference. First operand 309 states. Second operand has 241 states, 233 states have (on average 1.1759656652360515) internal successors, (274), 234 states have internal predecessors, (274), 4 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-15 06:29:02,818 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:29:02,818 INFO L93 Difference]: Finished difference Result 309 states and 351 transitions. [2022-04-15 06:29:02,819 INFO L276 IsEmpty]: Start isEmpty. Operand 309 states and 351 transitions. [2022-04-15 06:29:02,819 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 06:29:02,819 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 06:29:02,819 INFO L74 IsIncluded]: Start isIncluded. First operand has 241 states, 233 states have (on average 1.1759656652360515) internal successors, (274), 234 states have internal predecessors, (274), 4 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) Second operand 309 states. [2022-04-15 06:29:02,819 INFO L87 Difference]: Start difference. First operand has 241 states, 233 states have (on average 1.1759656652360515) internal successors, (274), 234 states have internal predecessors, (274), 4 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) Second operand 309 states. [2022-04-15 06:29:02,822 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:29:02,822 INFO L93 Difference]: Finished difference Result 309 states and 351 transitions. [2022-04-15 06:29:02,822 INFO L276 IsEmpty]: Start isEmpty. Operand 309 states and 351 transitions. [2022-04-15 06:29:02,823 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 06:29:02,823 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 06:29:02,823 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 06:29:02,823 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 06:29:02,823 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 241 states, 233 states have (on average 1.1759656652360515) internal successors, (274), 234 states have internal predecessors, (274), 4 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-15 06:29:02,826 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 241 states to 241 states and 281 transitions. [2022-04-15 06:29:02,826 INFO L78 Accepts]: Start accepts. Automaton has 241 states and 281 transitions. Word has length 71 [2022-04-15 06:29:02,826 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 06:29:02,826 INFO L478 AbstractCegarLoop]: Abstraction has 241 states and 281 transitions. [2022-04-15 06:29:02,826 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 22 states have (on average 2.8636363636363638) internal successors, (63), 21 states have internal predecessors, (63), 2 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-15 06:29:02,826 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 241 states and 281 transitions. [2022-04-15 06:29:03,501 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 281 edges. 281 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 06:29:03,501 INFO L276 IsEmpty]: Start isEmpty. Operand 241 states and 281 transitions. [2022-04-15 06:29:03,502 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2022-04-15 06:29:03,502 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 06:29:03,502 INFO L499 BasicCegarLoop]: trace histogram [19, 19, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 06:29:03,526 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (26)] Ended with exit code 0 [2022-04-15 06:29:03,702 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29,26 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 06:29:03,703 INFO L403 AbstractCegarLoop]: === Iteration 31 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 06:29:03,703 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 06:29:03,703 INFO L85 PathProgramCache]: Analyzing trace with hash -485243580, now seen corresponding path program 18 times [2022-04-15 06:29:03,703 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 06:29:03,703 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1945651486] [2022-04-15 06:29:04,680 WARN L970 rdanLoopAcceleration]: Unable to prove correctness of quantifier elimination. [2022-04-15 06:29:08,697 WARN L977 rdanLoopAcceleration]: Unable to prove correctness of quantifier elimination. [2022-04-15 06:29:08,785 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 1 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-15 06:29:08,982 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {0={1=1}, 1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-15 06:29:08,983 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-15 06:29:08,985 INFO L85 PathProgramCache]: Analyzing trace with hash -235039672, now seen corresponding path program 1 times [2022-04-15 06:29:08,985 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 06:29:08,985 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1877105541] [2022-04-15 06:29:08,985 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 06:29:08,985 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 06:29:08,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:29:09,080 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 06:29:09,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:29:09,083 INFO L290 TraceCheckUtils]: 0: Hoare triple {31157#(and (= ~last~0 |old(~last~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(11, 2);call #Ultimate.allocInit(12, 3);~last~0 := 0; {31145#true} is VALID [2022-04-15 06:29:09,083 INFO L290 TraceCheckUtils]: 1: Hoare triple {31145#true} assume true; {31145#true} is VALID [2022-04-15 06:29:09,083 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {31145#true} {31145#true} #66#return; {31145#true} is VALID [2022-04-15 06:29:09,083 INFO L272 TraceCheckUtils]: 0: Hoare triple {31145#true} call ULTIMATE.init(); {31157#(and (= ~last~0 |old(~last~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 06:29:09,084 INFO L290 TraceCheckUtils]: 1: Hoare triple {31157#(and (= ~last~0 |old(~last~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(11, 2);call #Ultimate.allocInit(12, 3);~last~0 := 0; {31145#true} is VALID [2022-04-15 06:29:09,084 INFO L290 TraceCheckUtils]: 2: Hoare triple {31145#true} assume true; {31145#true} is VALID [2022-04-15 06:29:09,084 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {31145#true} {31145#true} #66#return; {31145#true} is VALID [2022-04-15 06:29:09,084 INFO L272 TraceCheckUtils]: 4: Hoare triple {31145#true} call #t~ret6 := main(); {31145#true} is VALID [2022-04-15 06:29:09,084 INFO L290 TraceCheckUtils]: 5: Hoare triple {31145#true} assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~last~0 := #t~nondet4;havoc #t~nondet4;~a~0 := 0;~b~0 := 0;~c~0 := 0;~st~0 := 0; {31150#(and (= main_~a~0 0) (= main_~b~0 0))} is VALID [2022-04-15 06:29:09,084 INFO L290 TraceCheckUtils]: 6: Hoare triple {31150#(and (= main_~a~0 0) (= main_~b~0 0))} assume !false;~st~0 := 1;~c~0 := 0; {31151#(and (= main_~a~0 0) (= main_~st~0 1) (= main_~b~0 0))} is VALID [2022-04-15 06:29:09,085 INFO L290 TraceCheckUtils]: 7: Hoare triple {31151#(and (= main_~a~0 0) (= main_~st~0 1) (= main_~b~0 0))} [164] L23-3-->L23-4_primed: Formula: (let ((.cse0 (= v_~last~0_197 v_main_~c~0_713)) (.cse1 (= v_main_~c~0_713 v_main_~c~0_712)) (.cse2 (= |v_main_#t~post5_352| |v_main_#t~post5_350|))) (or (and (or .cse0 (not (< v_main_~c~0_713 200000))) .cse1 .cse2) (and (or (not (<= (+ v_~last~0_197 1) v_main_~c~0_712)) (not (<= (+ v_main_~c~0_713 1) v_~last~0_197))) (not .cse0) (< v_main_~c~0_712 200001) (< v_main_~c~0_713 v_main_~c~0_712)) (and (= v_~last~0_197 v_~last~0_197) .cse1 .cse2))) InVars {main_~c~0=v_main_~c~0_713, main_#t~post5=|v_main_#t~post5_352|, ~last~0=v_~last~0_197} OutVars{main_#t~post5=|v_main_#t~post5_350|, main_~c~0=v_main_~c~0_712, ~last~0=v_~last~0_197} AuxVars[] AssignedVars[main_#t~post5, main_~c~0] {31151#(and (= main_~a~0 0) (= main_~st~0 1) (= main_~b~0 0))} is VALID [2022-04-15 06:29:09,085 INFO L290 TraceCheckUtils]: 8: Hoare triple {31151#(and (= main_~a~0 0) (= main_~st~0 1) (= main_~b~0 0))} [165] L23-4_primed-->L23-3: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {31151#(and (= main_~a~0 0) (= main_~st~0 1) (= main_~b~0 0))} is VALID [2022-04-15 06:29:09,086 INFO L290 TraceCheckUtils]: 9: Hoare triple {31151#(and (= main_~a~0 0) (= main_~st~0 1) (= main_~b~0 0))} [166] L23-3-->L23-4_primed: Formula: (let ((.cse0 (= v_~last~0_198 v_main_~c~0_715)) (.cse1 (< v_main_~c~0_715 200000)) (.cse2 (= |v_main_#t~post5_355| |v_main_#t~post5_351|)) (.cse3 (= v_main_~st~0_257 v_main_~st~0_256))) (or (and (< v_main_~c~0_715 v_main_~c~0_714) .cse0 (= v_main_~st~0_256 0) .cse1 (< v_main_~c~0_714 (+ 2 v_main_~c~0_715))) (and .cse2 .cse3 (or (not .cse0) (not .cse1)) (= v_main_~c~0_714 v_main_~c~0_715)) (and .cse2 .cse3 (= v_~last~0_198 v_~last~0_198) (= v_main_~c~0_715 v_main_~c~0_714)))) InVars {main_~c~0=v_main_~c~0_715, main_#t~post5=|v_main_#t~post5_355|, main_~st~0=v_main_~st~0_257, ~last~0=v_~last~0_198} OutVars{main_#t~post5=|v_main_#t~post5_351|, main_~c~0=v_main_~c~0_714, main_~st~0=v_main_~st~0_256, ~last~0=v_~last~0_198} AuxVars[] AssignedVars[main_#t~post5, main_~c~0, main_~st~0] {31152#(or (and (= main_~a~0 0) (= main_~b~0 0) (<= main_~c~0 200000)) (= main_~st~0 1))} is VALID [2022-04-15 06:29:09,086 INFO L290 TraceCheckUtils]: 10: Hoare triple {31152#(or (and (= main_~a~0 0) (= main_~b~0 0) (<= main_~c~0 200000)) (= main_~st~0 1))} [163] L23-4_primed-->L23-4: Formula: (not (< v_main_~c~0_8 200000)) InVars {main_~c~0=v_main_~c~0_8} OutVars{main_~c~0=v_main_~c~0_8} AuxVars[] AssignedVars[] {31153#(or (and (= main_~a~0 0) (= main_~b~0 0) (< 199999 main_~c~0) (<= main_~c~0 200000)) (= main_~st~0 1))} is VALID [2022-04-15 06:29:09,087 INFO L290 TraceCheckUtils]: 11: Hoare triple {31153#(or (and (= main_~a~0 0) (= main_~b~0 0) (< 199999 main_~c~0) (<= main_~c~0 200000)) (= main_~st~0 1))} assume 0 == ~st~0 && ~c~0 == 1 + ~last~0;~a~0 := 3 + ~a~0;~b~0 := 3 + ~b~0; {31154#(and (<= main_~b~0 main_~a~0) (< main_~a~0 (+ main_~b~0 1)) (< 199999 main_~c~0) (<= main_~c~0 200000))} is VALID [2022-04-15 06:29:09,087 INFO L290 TraceCheckUtils]: 12: Hoare triple {31154#(and (<= main_~b~0 main_~a~0) (< main_~a~0 (+ main_~b~0 1)) (< 199999 main_~c~0) (<= main_~c~0 200000))} assume !(~c~0 == ~last~0 && 0 == ~st~0); {31154#(and (<= main_~b~0 main_~a~0) (< main_~a~0 (+ main_~b~0 1)) (< 199999 main_~c~0) (<= main_~c~0 200000))} is VALID [2022-04-15 06:29:09,088 INFO L272 TraceCheckUtils]: 13: Hoare triple {31154#(and (<= main_~b~0 main_~a~0) (< main_~a~0 (+ main_~b~0 1)) (< 199999 main_~c~0) (<= main_~c~0 200000))} call __VERIFIER_assert((if ~a~0 == ~b~0 && 200000 == ~c~0 then 1 else 0)); {31155#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-15 06:29:09,088 INFO L290 TraceCheckUtils]: 14: Hoare triple {31155#(not (= |__VERIFIER_assert_#in~cond| 0))} ~cond := #in~cond; {31156#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-15 06:29:09,089 INFO L290 TraceCheckUtils]: 15: Hoare triple {31156#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {31146#false} is VALID [2022-04-15 06:29:09,089 INFO L290 TraceCheckUtils]: 16: Hoare triple {31146#false} assume !false; {31146#false} is VALID [2022-04-15 06:29:09,089 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-04-15 06:29:09,089 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 06:29:09,089 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1877105541] [2022-04-15 06:29:09,089 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1877105541] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 06:29:09,089 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2027394127] [2022-04-15 06:29:09,089 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 06:29:09,089 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 06:29:09,089 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 06:29:09,090 INFO L229 MonitoredProcess]: Starting monitored process 27 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-15 06:29:09,091 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (27)] Waiting until timeout for monitored process [2022-04-15 06:29:09,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:29:09,118 INFO L263 TraceCheckSpWp]: Trace formula consists of 85 conjuncts, 18 conjunts are in the unsatisfiable core [2022-04-15 06:29:09,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:29:09,124 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 06:29:09,398 INFO L272 TraceCheckUtils]: 0: Hoare triple {31145#true} call ULTIMATE.init(); {31145#true} is VALID [2022-04-15 06:29:09,398 INFO L290 TraceCheckUtils]: 1: Hoare triple {31145#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(11, 2);call #Ultimate.allocInit(12, 3);~last~0 := 0; {31145#true} is VALID [2022-04-15 06:29:09,398 INFO L290 TraceCheckUtils]: 2: Hoare triple {31145#true} assume true; {31145#true} is VALID [2022-04-15 06:29:09,398 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {31145#true} {31145#true} #66#return; {31145#true} is VALID [2022-04-15 06:29:09,398 INFO L272 TraceCheckUtils]: 4: Hoare triple {31145#true} call #t~ret6 := main(); {31145#true} is VALID [2022-04-15 06:29:09,399 INFO L290 TraceCheckUtils]: 5: Hoare triple {31145#true} assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~last~0 := #t~nondet4;havoc #t~nondet4;~a~0 := 0;~b~0 := 0;~c~0 := 0;~st~0 := 0; {31150#(and (= main_~a~0 0) (= main_~b~0 0))} is VALID [2022-04-15 06:29:09,399 INFO L290 TraceCheckUtils]: 6: Hoare triple {31150#(and (= main_~a~0 0) (= main_~b~0 0))} assume !false;~st~0 := 1;~c~0 := 0; {31151#(and (= main_~a~0 0) (= main_~st~0 1) (= main_~b~0 0))} is VALID [2022-04-15 06:29:09,400 INFO L290 TraceCheckUtils]: 7: Hoare triple {31151#(and (= main_~a~0 0) (= main_~st~0 1) (= main_~b~0 0))} [164] L23-3-->L23-4_primed: Formula: (let ((.cse0 (= v_~last~0_197 v_main_~c~0_713)) (.cse1 (= v_main_~c~0_713 v_main_~c~0_712)) (.cse2 (= |v_main_#t~post5_352| |v_main_#t~post5_350|))) (or (and (or .cse0 (not (< v_main_~c~0_713 200000))) .cse1 .cse2) (and (or (not (<= (+ v_~last~0_197 1) v_main_~c~0_712)) (not (<= (+ v_main_~c~0_713 1) v_~last~0_197))) (not .cse0) (< v_main_~c~0_712 200001) (< v_main_~c~0_713 v_main_~c~0_712)) (and (= v_~last~0_197 v_~last~0_197) .cse1 .cse2))) InVars {main_~c~0=v_main_~c~0_713, main_#t~post5=|v_main_#t~post5_352|, ~last~0=v_~last~0_197} OutVars{main_#t~post5=|v_main_#t~post5_350|, main_~c~0=v_main_~c~0_712, ~last~0=v_~last~0_197} AuxVars[] AssignedVars[main_#t~post5, main_~c~0] {31151#(and (= main_~a~0 0) (= main_~st~0 1) (= main_~b~0 0))} is VALID [2022-04-15 06:29:09,400 INFO L290 TraceCheckUtils]: 8: Hoare triple {31151#(and (= main_~a~0 0) (= main_~st~0 1) (= main_~b~0 0))} [165] L23-4_primed-->L23-3: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {31151#(and (= main_~a~0 0) (= main_~st~0 1) (= main_~b~0 0))} is VALID [2022-04-15 06:29:09,401 INFO L290 TraceCheckUtils]: 9: Hoare triple {31151#(and (= main_~a~0 0) (= main_~st~0 1) (= main_~b~0 0))} [166] L23-3-->L23-4_primed: Formula: (let ((.cse0 (= v_~last~0_198 v_main_~c~0_715)) (.cse1 (< v_main_~c~0_715 200000)) (.cse2 (= |v_main_#t~post5_355| |v_main_#t~post5_351|)) (.cse3 (= v_main_~st~0_257 v_main_~st~0_256))) (or (and (< v_main_~c~0_715 v_main_~c~0_714) .cse0 (= v_main_~st~0_256 0) .cse1 (< v_main_~c~0_714 (+ 2 v_main_~c~0_715))) (and .cse2 .cse3 (or (not .cse0) (not .cse1)) (= v_main_~c~0_714 v_main_~c~0_715)) (and .cse2 .cse3 (= v_~last~0_198 v_~last~0_198) (= v_main_~c~0_715 v_main_~c~0_714)))) InVars {main_~c~0=v_main_~c~0_715, main_#t~post5=|v_main_#t~post5_355|, main_~st~0=v_main_~st~0_257, ~last~0=v_~last~0_198} OutVars{main_#t~post5=|v_main_#t~post5_351|, main_~c~0=v_main_~c~0_714, main_~st~0=v_main_~st~0_256, ~last~0=v_~last~0_198} AuxVars[] AssignedVars[main_#t~post5, main_~c~0, main_~st~0] {31188#(and (= main_~a~0 0) (= main_~b~0 0) (or (= main_~st~0 1) (and (< ~last~0 200000) (< ~last~0 main_~c~0) (< main_~c~0 (+ ~last~0 2)) (= main_~st~0 0))))} is VALID [2022-04-15 06:29:09,401 INFO L290 TraceCheckUtils]: 10: Hoare triple {31188#(and (= main_~a~0 0) (= main_~b~0 0) (or (= main_~st~0 1) (and (< ~last~0 200000) (< ~last~0 main_~c~0) (< main_~c~0 (+ ~last~0 2)) (= main_~st~0 0))))} [163] L23-4_primed-->L23-4: Formula: (not (< v_main_~c~0_8 200000)) InVars {main_~c~0=v_main_~c~0_8} OutVars{main_~c~0=v_main_~c~0_8} AuxVars[] AssignedVars[] {31192#(and (= main_~a~0 0) (or (and (< ~last~0 200000) (< main_~c~0 (+ ~last~0 2)) (= main_~st~0 0)) (= main_~st~0 1)) (= main_~b~0 0) (not (< main_~c~0 200000)))} is VALID [2022-04-15 06:29:09,402 INFO L290 TraceCheckUtils]: 11: Hoare triple {31192#(and (= main_~a~0 0) (or (and (< ~last~0 200000) (< main_~c~0 (+ ~last~0 2)) (= main_~st~0 0)) (= main_~st~0 1)) (= main_~b~0 0) (not (< main_~c~0 200000)))} assume 0 == ~st~0 && ~c~0 == 1 + ~last~0;~a~0 := 3 + ~a~0;~b~0 := 3 + ~b~0; {31196#(and (= main_~b~0 3) (<= 200000 main_~c~0) (< main_~c~0 200001) (= main_~a~0 3))} is VALID [2022-04-15 06:29:09,402 INFO L290 TraceCheckUtils]: 12: Hoare triple {31196#(and (= main_~b~0 3) (<= 200000 main_~c~0) (< main_~c~0 200001) (= main_~a~0 3))} assume !(~c~0 == ~last~0 && 0 == ~st~0); {31196#(and (= main_~b~0 3) (<= 200000 main_~c~0) (< main_~c~0 200001) (= main_~a~0 3))} is VALID [2022-04-15 06:29:09,403 INFO L272 TraceCheckUtils]: 13: Hoare triple {31196#(and (= main_~b~0 3) (<= 200000 main_~c~0) (< main_~c~0 200001) (= main_~a~0 3))} call __VERIFIER_assert((if ~a~0 == ~b~0 && 200000 == ~c~0 then 1 else 0)); {31203#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-15 06:29:09,403 INFO L290 TraceCheckUtils]: 14: Hoare triple {31203#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {31207#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-15 06:29:09,404 INFO L290 TraceCheckUtils]: 15: Hoare triple {31207#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {31146#false} is VALID [2022-04-15 06:29:09,404 INFO L290 TraceCheckUtils]: 16: Hoare triple {31146#false} assume !false; {31146#false} is VALID [2022-04-15 06:29:09,404 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-04-15 06:29:09,404 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 06:29:09,811 INFO L290 TraceCheckUtils]: 16: Hoare triple {31146#false} assume !false; {31146#false} is VALID [2022-04-15 06:29:09,812 INFO L290 TraceCheckUtils]: 15: Hoare triple {31207#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {31146#false} is VALID [2022-04-15 06:29:09,812 INFO L290 TraceCheckUtils]: 14: Hoare triple {31203#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {31207#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-15 06:29:09,813 INFO L272 TraceCheckUtils]: 13: Hoare triple {31154#(and (<= main_~b~0 main_~a~0) (< main_~a~0 (+ main_~b~0 1)) (< 199999 main_~c~0) (<= main_~c~0 200000))} call __VERIFIER_assert((if ~a~0 == ~b~0 && 200000 == ~c~0 then 1 else 0)); {31203#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-15 06:29:09,813 INFO L290 TraceCheckUtils]: 12: Hoare triple {31154#(and (<= main_~b~0 main_~a~0) (< main_~a~0 (+ main_~b~0 1)) (< 199999 main_~c~0) (<= main_~c~0 200000))} assume !(~c~0 == ~last~0 && 0 == ~st~0); {31154#(and (<= main_~b~0 main_~a~0) (< main_~a~0 (+ main_~b~0 1)) (< 199999 main_~c~0) (<= main_~c~0 200000))} is VALID [2022-04-15 06:29:09,814 INFO L290 TraceCheckUtils]: 11: Hoare triple {31229#(or (not (<= main_~c~0 (+ ~last~0 1))) (and (<= main_~b~0 main_~a~0) (< main_~a~0 (+ main_~b~0 1)) (< 199999 main_~c~0) (<= main_~c~0 200000)) (not (= main_~st~0 0)))} assume 0 == ~st~0 && ~c~0 == 1 + ~last~0;~a~0 := 3 + ~a~0;~b~0 := 3 + ~b~0; {31154#(and (<= main_~b~0 main_~a~0) (< main_~a~0 (+ main_~b~0 1)) (< 199999 main_~c~0) (<= main_~c~0 200000))} is VALID [2022-04-15 06:29:09,815 INFO L290 TraceCheckUtils]: 10: Hoare triple {31233#(or (not (<= main_~c~0 (+ ~last~0 1))) (and (<= main_~b~0 main_~a~0) (< main_~a~0 (+ main_~b~0 1)) (<= main_~c~0 200000)) (not (= main_~st~0 0)) (< main_~c~0 200000))} [163] L23-4_primed-->L23-4: Formula: (not (< v_main_~c~0_8 200000)) InVars {main_~c~0=v_main_~c~0_8} OutVars{main_~c~0=v_main_~c~0_8} AuxVars[] AssignedVars[] {31229#(or (not (<= main_~c~0 (+ ~last~0 1))) (and (<= main_~b~0 main_~a~0) (< main_~a~0 (+ main_~b~0 1)) (< 199999 main_~c~0) (<= main_~c~0 200000)) (not (= main_~st~0 0)))} is VALID [2022-04-15 06:29:09,815 INFO L290 TraceCheckUtils]: 9: Hoare triple {31237#(and (<= main_~b~0 main_~a~0) (< main_~a~0 (+ main_~b~0 1)) (not (= main_~st~0 0)))} [166] L23-3-->L23-4_primed: Formula: (let ((.cse0 (= v_~last~0_198 v_main_~c~0_715)) (.cse1 (< v_main_~c~0_715 200000)) (.cse2 (= |v_main_#t~post5_355| |v_main_#t~post5_351|)) (.cse3 (= v_main_~st~0_257 v_main_~st~0_256))) (or (and (< v_main_~c~0_715 v_main_~c~0_714) .cse0 (= v_main_~st~0_256 0) .cse1 (< v_main_~c~0_714 (+ 2 v_main_~c~0_715))) (and .cse2 .cse3 (or (not .cse0) (not .cse1)) (= v_main_~c~0_714 v_main_~c~0_715)) (and .cse2 .cse3 (= v_~last~0_198 v_~last~0_198) (= v_main_~c~0_715 v_main_~c~0_714)))) InVars {main_~c~0=v_main_~c~0_715, main_#t~post5=|v_main_#t~post5_355|, main_~st~0=v_main_~st~0_257, ~last~0=v_~last~0_198} OutVars{main_#t~post5=|v_main_#t~post5_351|, main_~c~0=v_main_~c~0_714, main_~st~0=v_main_~st~0_256, ~last~0=v_~last~0_198} AuxVars[] AssignedVars[main_#t~post5, main_~c~0, main_~st~0] {31233#(or (not (<= main_~c~0 (+ ~last~0 1))) (and (<= main_~b~0 main_~a~0) (< main_~a~0 (+ main_~b~0 1)) (<= main_~c~0 200000)) (not (= main_~st~0 0)) (< main_~c~0 200000))} is VALID [2022-04-15 06:29:09,816 INFO L290 TraceCheckUtils]: 8: Hoare triple {31237#(and (<= main_~b~0 main_~a~0) (< main_~a~0 (+ main_~b~0 1)) (not (= main_~st~0 0)))} [165] L23-4_primed-->L23-3: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {31237#(and (<= main_~b~0 main_~a~0) (< main_~a~0 (+ main_~b~0 1)) (not (= main_~st~0 0)))} is VALID [2022-04-15 06:29:09,816 INFO L290 TraceCheckUtils]: 7: Hoare triple {31237#(and (<= main_~b~0 main_~a~0) (< main_~a~0 (+ main_~b~0 1)) (not (= main_~st~0 0)))} [164] L23-3-->L23-4_primed: Formula: (let ((.cse0 (= v_~last~0_197 v_main_~c~0_713)) (.cse1 (= v_main_~c~0_713 v_main_~c~0_712)) (.cse2 (= |v_main_#t~post5_352| |v_main_#t~post5_350|))) (or (and (or .cse0 (not (< v_main_~c~0_713 200000))) .cse1 .cse2) (and (or (not (<= (+ v_~last~0_197 1) v_main_~c~0_712)) (not (<= (+ v_main_~c~0_713 1) v_~last~0_197))) (not .cse0) (< v_main_~c~0_712 200001) (< v_main_~c~0_713 v_main_~c~0_712)) (and (= v_~last~0_197 v_~last~0_197) .cse1 .cse2))) InVars {main_~c~0=v_main_~c~0_713, main_#t~post5=|v_main_#t~post5_352|, ~last~0=v_~last~0_197} OutVars{main_#t~post5=|v_main_#t~post5_350|, main_~c~0=v_main_~c~0_712, ~last~0=v_~last~0_197} AuxVars[] AssignedVars[main_#t~post5, main_~c~0] {31237#(and (<= main_~b~0 main_~a~0) (< main_~a~0 (+ main_~b~0 1)) (not (= main_~st~0 0)))} is VALID [2022-04-15 06:29:09,817 INFO L290 TraceCheckUtils]: 6: Hoare triple {31247#(and (<= main_~b~0 main_~a~0) (< main_~a~0 (+ main_~b~0 1)))} assume !false;~st~0 := 1;~c~0 := 0; {31237#(and (<= main_~b~0 main_~a~0) (< main_~a~0 (+ main_~b~0 1)) (not (= main_~st~0 0)))} is VALID [2022-04-15 06:29:09,817 INFO L290 TraceCheckUtils]: 5: Hoare triple {31145#true} assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~last~0 := #t~nondet4;havoc #t~nondet4;~a~0 := 0;~b~0 := 0;~c~0 := 0;~st~0 := 0; {31247#(and (<= main_~b~0 main_~a~0) (< main_~a~0 (+ main_~b~0 1)))} is VALID [2022-04-15 06:29:09,817 INFO L272 TraceCheckUtils]: 4: Hoare triple {31145#true} call #t~ret6 := main(); {31145#true} is VALID [2022-04-15 06:29:09,817 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {31145#true} {31145#true} #66#return; {31145#true} is VALID [2022-04-15 06:29:09,817 INFO L290 TraceCheckUtils]: 2: Hoare triple {31145#true} assume true; {31145#true} is VALID [2022-04-15 06:29:09,817 INFO L290 TraceCheckUtils]: 1: Hoare triple {31145#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(11, 2);call #Ultimate.allocInit(12, 3);~last~0 := 0; {31145#true} is VALID [2022-04-15 06:29:09,817 INFO L272 TraceCheckUtils]: 0: Hoare triple {31145#true} call ULTIMATE.init(); {31145#true} is VALID [2022-04-15 06:29:09,817 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-04-15 06:29:09,817 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2027394127] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 06:29:09,818 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 06:29:09,818 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9, 9] total 19 [2022-04-15 06:29:10,910 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 06:29:10,910 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1945651486] [2022-04-15 06:29:10,910 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1945651486] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 06:29:10,910 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 06:29:10,910 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [48] imperfect sequences [] total 48 [2022-04-15 06:29:10,911 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [109356365] [2022-04-15 06:29:10,911 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 06:29:10,911 INFO L78 Accepts]: Start accepts. Automaton has has 48 states, 48 states have (on average 1.3958333333333333) internal successors, (67), 46 states have internal predecessors, (67), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 71 [2022-04-15 06:29:10,911 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 06:29:10,911 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 48 states, 48 states have (on average 1.3958333333333333) internal successors, (67), 46 states have internal predecessors, (67), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:29:10,945 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 71 edges. 71 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 06:29:10,945 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 48 states [2022-04-15 06:29:10,945 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 06:29:10,945 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2022-04-15 06:29:10,945 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=366, Invalid=2940, Unknown=0, NotChecked=0, Total=3306 [2022-04-15 06:29:10,946 INFO L87 Difference]: Start difference. First operand 241 states and 281 transitions. Second operand has 48 states, 48 states have (on average 1.3958333333333333) internal successors, (67), 46 states have internal predecessors, (67), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:29:16,319 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:29:16,319 INFO L93 Difference]: Finished difference Result 404 states and 474 transitions. [2022-04-15 06:29:16,319 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 68 states. [2022-04-15 06:29:16,320 INFO L78 Accepts]: Start accepts. Automaton has has 48 states, 48 states have (on average 1.3958333333333333) internal successors, (67), 46 states have internal predecessors, (67), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 71 [2022-04-15 06:29:16,320 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 06:29:16,320 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 48 states, 48 states have (on average 1.3958333333333333) internal successors, (67), 46 states have internal predecessors, (67), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:29:16,321 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 166 transitions. [2022-04-15 06:29:16,321 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 48 states, 48 states have (on average 1.3958333333333333) internal successors, (67), 46 states have internal predecessors, (67), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:29:16,322 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 166 transitions. [2022-04-15 06:29:16,322 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 68 states and 166 transitions. [2022-04-15 06:29:16,403 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 166 edges. 166 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 06:29:16,413 INFO L225 Difference]: With dead ends: 404 [2022-04-15 06:29:16,414 INFO L226 Difference]: Without dead ends: 336 [2022-04-15 06:29:16,414 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 125 GetRequests, 45 SyntacticMatches, 2 SemanticMatches, 78 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1801 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=573, Invalid=5747, Unknown=0, NotChecked=0, Total=6320 [2022-04-15 06:29:16,415 INFO L913 BasicCegarLoop]: 17 mSDtfsCounter, 106 mSDsluCounter, 123 mSDsCounter, 0 mSdLazyCounter, 3692 mSolverCounterSat, 91 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 108 SdHoareTripleChecker+Valid, 140 SdHoareTripleChecker+Invalid, 3783 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 91 IncrementalHoareTripleChecker+Valid, 3692 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.0s IncrementalHoareTripleChecker+Time [2022-04-15 06:29:16,415 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [108 Valid, 140 Invalid, 3783 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [91 Valid, 3692 Invalid, 0 Unknown, 0 Unchecked, 2.0s Time] [2022-04-15 06:29:16,415 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 336 states. [2022-04-15 06:29:17,063 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 336 to 267. [2022-04-15 06:29:17,063 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 06:29:17,063 INFO L82 GeneralOperation]: Start isEquivalent. First operand 336 states. Second operand has 267 states, 259 states have (on average 1.166023166023166) internal successors, (302), 260 states have internal predecessors, (302), 4 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-15 06:29:17,063 INFO L74 IsIncluded]: Start isIncluded. First operand 336 states. Second operand has 267 states, 259 states have (on average 1.166023166023166) internal successors, (302), 260 states have internal predecessors, (302), 4 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-15 06:29:17,064 INFO L87 Difference]: Start difference. First operand 336 states. Second operand has 267 states, 259 states have (on average 1.166023166023166) internal successors, (302), 260 states have internal predecessors, (302), 4 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-15 06:29:17,067 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:29:17,067 INFO L93 Difference]: Finished difference Result 336 states and 390 transitions. [2022-04-15 06:29:17,067 INFO L276 IsEmpty]: Start isEmpty. Operand 336 states and 390 transitions. [2022-04-15 06:29:17,068 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 06:29:17,068 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 06:29:17,068 INFO L74 IsIncluded]: Start isIncluded. First operand has 267 states, 259 states have (on average 1.166023166023166) internal successors, (302), 260 states have internal predecessors, (302), 4 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) Second operand 336 states. [2022-04-15 06:29:17,068 INFO L87 Difference]: Start difference. First operand has 267 states, 259 states have (on average 1.166023166023166) internal successors, (302), 260 states have internal predecessors, (302), 4 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) Second operand 336 states. [2022-04-15 06:29:17,072 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:29:17,072 INFO L93 Difference]: Finished difference Result 336 states and 390 transitions. [2022-04-15 06:29:17,072 INFO L276 IsEmpty]: Start isEmpty. Operand 336 states and 390 transitions. [2022-04-15 06:29:17,073 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 06:29:17,073 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 06:29:17,073 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 06:29:17,073 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 06:29:17,073 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 267 states, 259 states have (on average 1.166023166023166) internal successors, (302), 260 states have internal predecessors, (302), 4 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-15 06:29:17,098 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 267 states to 267 states and 309 transitions. [2022-04-15 06:29:17,098 INFO L78 Accepts]: Start accepts. Automaton has 267 states and 309 transitions. Word has length 71 [2022-04-15 06:29:17,098 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 06:29:17,098 INFO L478 AbstractCegarLoop]: Abstraction has 267 states and 309 transitions. [2022-04-15 06:29:17,098 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 48 states, 48 states have (on average 1.3958333333333333) internal successors, (67), 46 states have internal predecessors, (67), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:29:17,098 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 267 states and 309 transitions. [2022-04-15 06:29:17,752 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 309 edges. 309 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 06:29:17,752 INFO L276 IsEmpty]: Start isEmpty. Operand 267 states and 309 transitions. [2022-04-15 06:29:17,752 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2022-04-15 06:29:17,752 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 06:29:17,752 INFO L499 BasicCegarLoop]: trace histogram [20, 20, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 06:29:17,769 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-15 06:29:17,959 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 27 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable30 [2022-04-15 06:29:17,959 INFO L403 AbstractCegarLoop]: === Iteration 32 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 06:29:17,960 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 06:29:17,960 INFO L85 PathProgramCache]: Analyzing trace with hash 763923431, now seen corresponding path program 19 times [2022-04-15 06:29:17,960 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 06:29:17,960 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1918132849] [2022-04-15 06:29:20,470 WARN L970 rdanLoopAcceleration]: Unable to prove correctness of quantifier elimination. [2022-04-15 06:29:23,073 WARN L977 rdanLoopAcceleration]: Unable to prove correctness of quantifier elimination. [2022-04-15 06:29:23,180 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 1 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-15 06:29:23,371 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {0={1=1}, 1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-15 06:29:23,372 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-15 06:29:23,375 INFO L85 PathProgramCache]: Analyzing trace with hash -2024622776, now seen corresponding path program 1 times [2022-04-15 06:29:23,375 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 06:29:23,376 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [362487000] [2022-04-15 06:29:23,376 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 06:29:23,376 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 06:29:23,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:29:23,528 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 06:29:23,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:29:23,532 INFO L290 TraceCheckUtils]: 0: Hoare triple {33377#(and (= ~last~0 |old(~last~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(11, 2);call #Ultimate.allocInit(12, 3);~last~0 := 0; {33365#true} is VALID [2022-04-15 06:29:23,532 INFO L290 TraceCheckUtils]: 1: Hoare triple {33365#true} assume true; {33365#true} is VALID [2022-04-15 06:29:23,532 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {33365#true} {33365#true} #66#return; {33365#true} is VALID [2022-04-15 06:29:23,532 INFO L272 TraceCheckUtils]: 0: Hoare triple {33365#true} call ULTIMATE.init(); {33377#(and (= ~last~0 |old(~last~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 06:29:23,532 INFO L290 TraceCheckUtils]: 1: Hoare triple {33377#(and (= ~last~0 |old(~last~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(11, 2);call #Ultimate.allocInit(12, 3);~last~0 := 0; {33365#true} is VALID [2022-04-15 06:29:23,533 INFO L290 TraceCheckUtils]: 2: Hoare triple {33365#true} assume true; {33365#true} is VALID [2022-04-15 06:29:23,533 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {33365#true} {33365#true} #66#return; {33365#true} is VALID [2022-04-15 06:29:23,533 INFO L272 TraceCheckUtils]: 4: Hoare triple {33365#true} call #t~ret6 := main(); {33365#true} is VALID [2022-04-15 06:29:23,533 INFO L290 TraceCheckUtils]: 5: Hoare triple {33365#true} assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~last~0 := #t~nondet4;havoc #t~nondet4;~a~0 := 0;~b~0 := 0;~c~0 := 0;~st~0 := 0; {33370#(and (= main_~a~0 0) (= main_~b~0 0))} is VALID [2022-04-15 06:29:23,533 INFO L290 TraceCheckUtils]: 6: Hoare triple {33370#(and (= main_~a~0 0) (= main_~b~0 0))} assume !false;~st~0 := 1;~c~0 := 0; {33371#(and (= main_~a~0 0) (= main_~st~0 1) (= main_~b~0 0))} is VALID [2022-04-15 06:29:23,534 INFO L290 TraceCheckUtils]: 7: Hoare triple {33371#(and (= main_~a~0 0) (= main_~st~0 1) (= main_~b~0 0))} [168] L23-3-->L23-4_primed: Formula: (let ((.cse1 (= v_main_~c~0_749 v_main_~c~0_748)) (.cse2 (= |v_main_#t~post5_365| |v_main_#t~post5_363|)) (.cse0 (= v_~last~0_205 v_main_~c~0_749))) (or (and (or .cse0 (not (< v_main_~c~0_749 200000))) .cse1 .cse2) (and (= v_~last~0_205 v_~last~0_205) .cse1 .cse2) (and (or (not (<= (+ v_main_~c~0_749 1) v_~last~0_205)) (not (<= (+ v_~last~0_205 1) v_main_~c~0_748))) (not .cse0) (< v_main_~c~0_749 v_main_~c~0_748) (< v_main_~c~0_748 200001)))) InVars {main_~c~0=v_main_~c~0_749, main_#t~post5=|v_main_#t~post5_365|, ~last~0=v_~last~0_205} OutVars{main_#t~post5=|v_main_#t~post5_363|, main_~c~0=v_main_~c~0_748, ~last~0=v_~last~0_205} AuxVars[] AssignedVars[main_#t~post5, main_~c~0] {33371#(and (= main_~a~0 0) (= main_~st~0 1) (= main_~b~0 0))} is VALID [2022-04-15 06:29:23,534 INFO L290 TraceCheckUtils]: 8: Hoare triple {33371#(and (= main_~a~0 0) (= main_~st~0 1) (= main_~b~0 0))} [169] L23-4_primed-->L23-3: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {33371#(and (= main_~a~0 0) (= main_~st~0 1) (= main_~b~0 0))} is VALID [2022-04-15 06:29:23,535 INFO L290 TraceCheckUtils]: 9: Hoare triple {33371#(and (= main_~a~0 0) (= main_~st~0 1) (= main_~b~0 0))} [170] L23-3-->L23-4_primed: Formula: (let ((.cse2 (= |v_main_#t~post5_368| |v_main_#t~post5_364|)) (.cse3 (= v_main_~c~0_751 v_main_~c~0_750)) (.cse0 (< v_main_~c~0_751 200000)) (.cse1 (= v_~last~0_206 v_main_~c~0_751)) (.cse4 (= v_main_~st~0_267 v_main_~st~0_266))) (or (and (< v_main_~c~0_751 v_main_~c~0_750) (<= v_main_~c~0_750 (+ v_~last~0_206 1)) .cse0 .cse1 (= v_main_~st~0_266 0)) (and .cse2 .cse3 .cse4 (= v_~last~0_206 v_~last~0_206)) (and .cse2 .cse3 (or (not .cse0) (not .cse1)) .cse4))) InVars {main_~c~0=v_main_~c~0_751, main_#t~post5=|v_main_#t~post5_368|, main_~st~0=v_main_~st~0_267, ~last~0=v_~last~0_206} OutVars{main_#t~post5=|v_main_#t~post5_364|, main_~c~0=v_main_~c~0_750, main_~st~0=v_main_~st~0_266, ~last~0=v_~last~0_206} AuxVars[] AssignedVars[main_#t~post5, main_~c~0, main_~st~0] {33372#(or (= main_~st~0 1) (and (= main_~a~0 0) (or (<= ~last~0 199999) (<= main_~c~0 200000)) (= main_~b~0 0)))} is VALID [2022-04-15 06:29:23,536 INFO L290 TraceCheckUtils]: 10: Hoare triple {33372#(or (= main_~st~0 1) (and (= main_~a~0 0) (or (<= ~last~0 199999) (<= main_~c~0 200000)) (= main_~b~0 0)))} [167] L23-4_primed-->L23-4: Formula: (not (< v_main_~c~0_8 200000)) InVars {main_~c~0=v_main_~c~0_8} OutVars{main_~c~0=v_main_~c~0_8} AuxVars[] AssignedVars[] {33373#(or (= main_~st~0 1) (and (= main_~a~0 0) (or (<= ~last~0 199999) (<= main_~c~0 200000)) (= main_~b~0 0) (< 199999 main_~c~0)))} is VALID [2022-04-15 06:29:23,536 INFO L290 TraceCheckUtils]: 11: Hoare triple {33373#(or (= main_~st~0 1) (and (= main_~a~0 0) (or (<= ~last~0 199999) (<= main_~c~0 200000)) (= main_~b~0 0) (< 199999 main_~c~0)))} assume 0 == ~st~0 && ~c~0 == 1 + ~last~0;~a~0 := 3 + ~a~0;~b~0 := 3 + ~b~0; {33374#(and (<= main_~b~0 main_~a~0) (< main_~a~0 (+ main_~b~0 1)) (< 199999 main_~c~0) (<= main_~c~0 200000))} is VALID [2022-04-15 06:29:23,537 INFO L290 TraceCheckUtils]: 12: Hoare triple {33374#(and (<= main_~b~0 main_~a~0) (< main_~a~0 (+ main_~b~0 1)) (< 199999 main_~c~0) (<= main_~c~0 200000))} assume !(~c~0 == ~last~0 && 0 == ~st~0); {33374#(and (<= main_~b~0 main_~a~0) (< main_~a~0 (+ main_~b~0 1)) (< 199999 main_~c~0) (<= main_~c~0 200000))} is VALID [2022-04-15 06:29:23,538 INFO L272 TraceCheckUtils]: 13: Hoare triple {33374#(and (<= main_~b~0 main_~a~0) (< main_~a~0 (+ main_~b~0 1)) (< 199999 main_~c~0) (<= main_~c~0 200000))} call __VERIFIER_assert((if ~a~0 == ~b~0 && 200000 == ~c~0 then 1 else 0)); {33375#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-15 06:29:23,538 INFO L290 TraceCheckUtils]: 14: Hoare triple {33375#(not (= |__VERIFIER_assert_#in~cond| 0))} ~cond := #in~cond; {33376#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-15 06:29:23,538 INFO L290 TraceCheckUtils]: 15: Hoare triple {33376#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {33366#false} is VALID [2022-04-15 06:29:23,539 INFO L290 TraceCheckUtils]: 16: Hoare triple {33366#false} assume !false; {33366#false} is VALID [2022-04-15 06:29:23,539 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-04-15 06:29:23,539 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 06:29:23,539 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [362487000] [2022-04-15 06:29:23,539 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [362487000] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 06:29:23,539 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1073731253] [2022-04-15 06:29:23,539 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 06:29:23,539 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 06:29:23,540 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 06:29:23,552 INFO L229 MonitoredProcess]: Starting monitored process 28 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-15 06:29:23,557 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (28)] Waiting until timeout for monitored process [2022-04-15 06:29:23,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:29:23,580 INFO L263 TraceCheckSpWp]: Trace formula consists of 85 conjuncts, 18 conjunts are in the unsatisfiable core [2022-04-15 06:29:23,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:29:23,588 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 06:29:23,911 INFO L272 TraceCheckUtils]: 0: Hoare triple {33365#true} call ULTIMATE.init(); {33365#true} is VALID [2022-04-15 06:29:23,911 INFO L290 TraceCheckUtils]: 1: Hoare triple {33365#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(11, 2);call #Ultimate.allocInit(12, 3);~last~0 := 0; {33365#true} is VALID [2022-04-15 06:29:23,911 INFO L290 TraceCheckUtils]: 2: Hoare triple {33365#true} assume true; {33365#true} is VALID [2022-04-15 06:29:23,911 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {33365#true} {33365#true} #66#return; {33365#true} is VALID [2022-04-15 06:29:23,911 INFO L272 TraceCheckUtils]: 4: Hoare triple {33365#true} call #t~ret6 := main(); {33365#true} is VALID [2022-04-15 06:29:23,912 INFO L290 TraceCheckUtils]: 5: Hoare triple {33365#true} assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~last~0 := #t~nondet4;havoc #t~nondet4;~a~0 := 0;~b~0 := 0;~c~0 := 0;~st~0 := 0; {33370#(and (= main_~a~0 0) (= main_~b~0 0))} is VALID [2022-04-15 06:29:23,912 INFO L290 TraceCheckUtils]: 6: Hoare triple {33370#(and (= main_~a~0 0) (= main_~b~0 0))} assume !false;~st~0 := 1;~c~0 := 0; {33371#(and (= main_~a~0 0) (= main_~st~0 1) (= main_~b~0 0))} is VALID [2022-04-15 06:29:23,913 INFO L290 TraceCheckUtils]: 7: Hoare triple {33371#(and (= main_~a~0 0) (= main_~st~0 1) (= main_~b~0 0))} [168] L23-3-->L23-4_primed: Formula: (let ((.cse1 (= v_main_~c~0_749 v_main_~c~0_748)) (.cse2 (= |v_main_#t~post5_365| |v_main_#t~post5_363|)) (.cse0 (= v_~last~0_205 v_main_~c~0_749))) (or (and (or .cse0 (not (< v_main_~c~0_749 200000))) .cse1 .cse2) (and (= v_~last~0_205 v_~last~0_205) .cse1 .cse2) (and (or (not (<= (+ v_main_~c~0_749 1) v_~last~0_205)) (not (<= (+ v_~last~0_205 1) v_main_~c~0_748))) (not .cse0) (< v_main_~c~0_749 v_main_~c~0_748) (< v_main_~c~0_748 200001)))) InVars {main_~c~0=v_main_~c~0_749, main_#t~post5=|v_main_#t~post5_365|, ~last~0=v_~last~0_205} OutVars{main_#t~post5=|v_main_#t~post5_363|, main_~c~0=v_main_~c~0_748, ~last~0=v_~last~0_205} AuxVars[] AssignedVars[main_#t~post5, main_~c~0] {33371#(and (= main_~a~0 0) (= main_~st~0 1) (= main_~b~0 0))} is VALID [2022-04-15 06:29:23,913 INFO L290 TraceCheckUtils]: 8: Hoare triple {33371#(and (= main_~a~0 0) (= main_~st~0 1) (= main_~b~0 0))} [169] L23-4_primed-->L23-3: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {33371#(and (= main_~a~0 0) (= main_~st~0 1) (= main_~b~0 0))} is VALID [2022-04-15 06:29:23,914 INFO L290 TraceCheckUtils]: 9: Hoare triple {33371#(and (= main_~a~0 0) (= main_~st~0 1) (= main_~b~0 0))} [170] L23-3-->L23-4_primed: Formula: (let ((.cse2 (= |v_main_#t~post5_368| |v_main_#t~post5_364|)) (.cse3 (= v_main_~c~0_751 v_main_~c~0_750)) (.cse0 (< v_main_~c~0_751 200000)) (.cse1 (= v_~last~0_206 v_main_~c~0_751)) (.cse4 (= v_main_~st~0_267 v_main_~st~0_266))) (or (and (< v_main_~c~0_751 v_main_~c~0_750) (<= v_main_~c~0_750 (+ v_~last~0_206 1)) .cse0 .cse1 (= v_main_~st~0_266 0)) (and .cse2 .cse3 .cse4 (= v_~last~0_206 v_~last~0_206)) (and .cse2 .cse3 (or (not .cse0) (not .cse1)) .cse4))) InVars {main_~c~0=v_main_~c~0_751, main_#t~post5=|v_main_#t~post5_368|, main_~st~0=v_main_~st~0_267, ~last~0=v_~last~0_206} OutVars{main_#t~post5=|v_main_#t~post5_364|, main_~c~0=v_main_~c~0_750, main_~st~0=v_main_~st~0_266, ~last~0=v_~last~0_206} AuxVars[] AssignedVars[main_#t~post5, main_~c~0, main_~st~0] {33408#(and (= main_~a~0 0) (= main_~b~0 0) (or (and (< ~last~0 200000) (< ~last~0 main_~c~0) (<= main_~c~0 (+ ~last~0 1)) (= main_~st~0 0)) (= main_~st~0 1)))} is VALID [2022-04-15 06:29:23,915 INFO L290 TraceCheckUtils]: 10: Hoare triple {33408#(and (= main_~a~0 0) (= main_~b~0 0) (or (and (< ~last~0 200000) (< ~last~0 main_~c~0) (<= main_~c~0 (+ ~last~0 1)) (= main_~st~0 0)) (= main_~st~0 1)))} [167] L23-4_primed-->L23-4: Formula: (not (< v_main_~c~0_8 200000)) InVars {main_~c~0=v_main_~c~0_8} OutVars{main_~c~0=v_main_~c~0_8} AuxVars[] AssignedVars[] {33412#(and (= main_~a~0 0) (or (= main_~st~0 1) (and (< ~last~0 200000) (<= main_~c~0 (+ ~last~0 1)) (= main_~st~0 0))) (= main_~b~0 0) (not (< main_~c~0 200000)))} is VALID [2022-04-15 06:29:23,916 INFO L290 TraceCheckUtils]: 11: Hoare triple {33412#(and (= main_~a~0 0) (or (= main_~st~0 1) (and (< ~last~0 200000) (<= main_~c~0 (+ ~last~0 1)) (= main_~st~0 0))) (= main_~b~0 0) (not (< main_~c~0 200000)))} assume 0 == ~st~0 && ~c~0 == 1 + ~last~0;~a~0 := 3 + ~a~0;~b~0 := 3 + ~b~0; {33416#(and (= main_~b~0 3) (<= 200000 main_~c~0) (< main_~c~0 200001) (= main_~a~0 3))} is VALID [2022-04-15 06:29:23,916 INFO L290 TraceCheckUtils]: 12: Hoare triple {33416#(and (= main_~b~0 3) (<= 200000 main_~c~0) (< main_~c~0 200001) (= main_~a~0 3))} assume !(~c~0 == ~last~0 && 0 == ~st~0); {33416#(and (= main_~b~0 3) (<= 200000 main_~c~0) (< main_~c~0 200001) (= main_~a~0 3))} is VALID [2022-04-15 06:29:23,917 INFO L272 TraceCheckUtils]: 13: Hoare triple {33416#(and (= main_~b~0 3) (<= 200000 main_~c~0) (< main_~c~0 200001) (= main_~a~0 3))} call __VERIFIER_assert((if ~a~0 == ~b~0 && 200000 == ~c~0 then 1 else 0)); {33423#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-15 06:29:23,917 INFO L290 TraceCheckUtils]: 14: Hoare triple {33423#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {33427#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-15 06:29:23,918 INFO L290 TraceCheckUtils]: 15: Hoare triple {33427#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {33366#false} is VALID [2022-04-15 06:29:23,918 INFO L290 TraceCheckUtils]: 16: Hoare triple {33366#false} assume !false; {33366#false} is VALID [2022-04-15 06:29:23,918 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-04-15 06:29:23,918 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 06:29:24,343 INFO L290 TraceCheckUtils]: 16: Hoare triple {33366#false} assume !false; {33366#false} is VALID [2022-04-15 06:29:24,343 INFO L290 TraceCheckUtils]: 15: Hoare triple {33427#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {33366#false} is VALID [2022-04-15 06:29:24,344 INFO L290 TraceCheckUtils]: 14: Hoare triple {33423#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {33427#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-15 06:29:24,345 INFO L272 TraceCheckUtils]: 13: Hoare triple {33374#(and (<= main_~b~0 main_~a~0) (< main_~a~0 (+ main_~b~0 1)) (< 199999 main_~c~0) (<= main_~c~0 200000))} call __VERIFIER_assert((if ~a~0 == ~b~0 && 200000 == ~c~0 then 1 else 0)); {33423#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-15 06:29:24,345 INFO L290 TraceCheckUtils]: 12: Hoare triple {33374#(and (<= main_~b~0 main_~a~0) (< main_~a~0 (+ main_~b~0 1)) (< 199999 main_~c~0) (<= main_~c~0 200000))} assume !(~c~0 == ~last~0 && 0 == ~st~0); {33374#(and (<= main_~b~0 main_~a~0) (< main_~a~0 (+ main_~b~0 1)) (< 199999 main_~c~0) (<= main_~c~0 200000))} is VALID [2022-04-15 06:29:24,346 INFO L290 TraceCheckUtils]: 11: Hoare triple {33449#(or (not (<= main_~c~0 (+ ~last~0 1))) (and (<= main_~b~0 main_~a~0) (< main_~a~0 (+ main_~b~0 1)) (< 199999 main_~c~0) (<= main_~c~0 200000)) (not (= main_~st~0 0)))} assume 0 == ~st~0 && ~c~0 == 1 + ~last~0;~a~0 := 3 + ~a~0;~b~0 := 3 + ~b~0; {33374#(and (<= main_~b~0 main_~a~0) (< main_~a~0 (+ main_~b~0 1)) (< 199999 main_~c~0) (<= main_~c~0 200000))} is VALID [2022-04-15 06:29:24,346 INFO L290 TraceCheckUtils]: 10: Hoare triple {33453#(or (not (<= main_~c~0 (+ ~last~0 1))) (and (<= main_~b~0 main_~a~0) (< main_~a~0 (+ main_~b~0 1)) (<= main_~c~0 200000)) (not (= main_~st~0 0)) (< main_~c~0 200000))} [167] L23-4_primed-->L23-4: Formula: (not (< v_main_~c~0_8 200000)) InVars {main_~c~0=v_main_~c~0_8} OutVars{main_~c~0=v_main_~c~0_8} AuxVars[] AssignedVars[] {33449#(or (not (<= main_~c~0 (+ ~last~0 1))) (and (<= main_~b~0 main_~a~0) (< main_~a~0 (+ main_~b~0 1)) (< 199999 main_~c~0) (<= main_~c~0 200000)) (not (= main_~st~0 0)))} is VALID [2022-04-15 06:29:24,347 INFO L290 TraceCheckUtils]: 9: Hoare triple {33457#(and (<= main_~b~0 main_~a~0) (< main_~a~0 (+ main_~b~0 1)) (not (= main_~st~0 0)))} [170] L23-3-->L23-4_primed: Formula: (let ((.cse2 (= |v_main_#t~post5_368| |v_main_#t~post5_364|)) (.cse3 (= v_main_~c~0_751 v_main_~c~0_750)) (.cse0 (< v_main_~c~0_751 200000)) (.cse1 (= v_~last~0_206 v_main_~c~0_751)) (.cse4 (= v_main_~st~0_267 v_main_~st~0_266))) (or (and (< v_main_~c~0_751 v_main_~c~0_750) (<= v_main_~c~0_750 (+ v_~last~0_206 1)) .cse0 .cse1 (= v_main_~st~0_266 0)) (and .cse2 .cse3 .cse4 (= v_~last~0_206 v_~last~0_206)) (and .cse2 .cse3 (or (not .cse0) (not .cse1)) .cse4))) InVars {main_~c~0=v_main_~c~0_751, main_#t~post5=|v_main_#t~post5_368|, main_~st~0=v_main_~st~0_267, ~last~0=v_~last~0_206} OutVars{main_#t~post5=|v_main_#t~post5_364|, main_~c~0=v_main_~c~0_750, main_~st~0=v_main_~st~0_266, ~last~0=v_~last~0_206} AuxVars[] AssignedVars[main_#t~post5, main_~c~0, main_~st~0] {33453#(or (not (<= main_~c~0 (+ ~last~0 1))) (and (<= main_~b~0 main_~a~0) (< main_~a~0 (+ main_~b~0 1)) (<= main_~c~0 200000)) (not (= main_~st~0 0)) (< main_~c~0 200000))} is VALID [2022-04-15 06:29:24,347 INFO L290 TraceCheckUtils]: 8: Hoare triple {33457#(and (<= main_~b~0 main_~a~0) (< main_~a~0 (+ main_~b~0 1)) (not (= main_~st~0 0)))} [169] L23-4_primed-->L23-3: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {33457#(and (<= main_~b~0 main_~a~0) (< main_~a~0 (+ main_~b~0 1)) (not (= main_~st~0 0)))} is VALID [2022-04-15 06:29:24,348 INFO L290 TraceCheckUtils]: 7: Hoare triple {33457#(and (<= main_~b~0 main_~a~0) (< main_~a~0 (+ main_~b~0 1)) (not (= main_~st~0 0)))} [168] L23-3-->L23-4_primed: Formula: (let ((.cse1 (= v_main_~c~0_749 v_main_~c~0_748)) (.cse2 (= |v_main_#t~post5_365| |v_main_#t~post5_363|)) (.cse0 (= v_~last~0_205 v_main_~c~0_749))) (or (and (or .cse0 (not (< v_main_~c~0_749 200000))) .cse1 .cse2) (and (= v_~last~0_205 v_~last~0_205) .cse1 .cse2) (and (or (not (<= (+ v_main_~c~0_749 1) v_~last~0_205)) (not (<= (+ v_~last~0_205 1) v_main_~c~0_748))) (not .cse0) (< v_main_~c~0_749 v_main_~c~0_748) (< v_main_~c~0_748 200001)))) InVars {main_~c~0=v_main_~c~0_749, main_#t~post5=|v_main_#t~post5_365|, ~last~0=v_~last~0_205} OutVars{main_#t~post5=|v_main_#t~post5_363|, main_~c~0=v_main_~c~0_748, ~last~0=v_~last~0_205} AuxVars[] AssignedVars[main_#t~post5, main_~c~0] {33457#(and (<= main_~b~0 main_~a~0) (< main_~a~0 (+ main_~b~0 1)) (not (= main_~st~0 0)))} is VALID [2022-04-15 06:29:24,348 INFO L290 TraceCheckUtils]: 6: Hoare triple {33467#(and (<= main_~b~0 main_~a~0) (< main_~a~0 (+ main_~b~0 1)))} assume !false;~st~0 := 1;~c~0 := 0; {33457#(and (<= main_~b~0 main_~a~0) (< main_~a~0 (+ main_~b~0 1)) (not (= main_~st~0 0)))} is VALID [2022-04-15 06:29:24,349 INFO L290 TraceCheckUtils]: 5: Hoare triple {33365#true} assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~last~0 := #t~nondet4;havoc #t~nondet4;~a~0 := 0;~b~0 := 0;~c~0 := 0;~st~0 := 0; {33467#(and (<= main_~b~0 main_~a~0) (< main_~a~0 (+ main_~b~0 1)))} is VALID [2022-04-15 06:29:24,349 INFO L272 TraceCheckUtils]: 4: Hoare triple {33365#true} call #t~ret6 := main(); {33365#true} is VALID [2022-04-15 06:29:24,349 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {33365#true} {33365#true} #66#return; {33365#true} is VALID [2022-04-15 06:29:24,349 INFO L290 TraceCheckUtils]: 2: Hoare triple {33365#true} assume true; {33365#true} is VALID [2022-04-15 06:29:24,349 INFO L290 TraceCheckUtils]: 1: Hoare triple {33365#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(11, 2);call #Ultimate.allocInit(12, 3);~last~0 := 0; {33365#true} is VALID [2022-04-15 06:29:24,349 INFO L272 TraceCheckUtils]: 0: Hoare triple {33365#true} call ULTIMATE.init(); {33365#true} is VALID [2022-04-15 06:29:24,349 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-04-15 06:29:24,349 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1073731253] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 06:29:24,349 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 06:29:24,349 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9, 9] total 19 [2022-04-15 06:29:25,526 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 06:29:25,527 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1918132849] [2022-04-15 06:29:25,527 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1918132849] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 06:29:25,527 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 06:29:25,527 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [50] imperfect sequences [] total 50 [2022-04-15 06:29:25,527 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [706178834] [2022-04-15 06:29:25,527 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 06:29:25,527 INFO L78 Accepts]: Start accepts. Automaton has has 50 states, 50 states have (on average 1.4) internal successors, (70), 48 states have internal predecessors, (70), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 74 [2022-04-15 06:29:25,528 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 06:29:25,528 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 50 states, 50 states have (on average 1.4) internal successors, (70), 48 states have internal predecessors, (70), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:29:25,562 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 74 edges. 74 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 06:29:25,562 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 50 states [2022-04-15 06:29:25,562 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 06:29:25,563 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2022-04-15 06:29:25,563 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=381, Invalid=3159, Unknown=0, NotChecked=0, Total=3540 [2022-04-15 06:29:25,563 INFO L87 Difference]: Start difference. First operand 267 states and 309 transitions. Second operand has 50 states, 50 states have (on average 1.4) internal successors, (70), 48 states have internal predecessors, (70), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:29:31,907 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:29:31,907 INFO L93 Difference]: Finished difference Result 377 states and 437 transitions. [2022-04-15 06:29:31,907 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 71 states. [2022-04-15 06:29:31,907 INFO L78 Accepts]: Start accepts. Automaton has has 50 states, 50 states have (on average 1.4) internal successors, (70), 48 states have internal predecessors, (70), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 74 [2022-04-15 06:29:31,907 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 06:29:31,908 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 50 states, 50 states have (on average 1.4) internal successors, (70), 48 states have internal predecessors, (70), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:29:31,909 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 170 transitions. [2022-04-15 06:29:31,909 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 50 states, 50 states have (on average 1.4) internal successors, (70), 48 states have internal predecessors, (70), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:29:31,910 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 170 transitions. [2022-04-15 06:29:31,910 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 71 states and 170 transitions. [2022-04-15 06:29:32,036 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 170 edges. 170 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 06:29:32,040 INFO L225 Difference]: With dead ends: 377 [2022-04-15 06:29:32,040 INFO L226 Difference]: Without dead ends: 309 [2022-04-15 06:29:32,041 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 129 GetRequests, 46 SyntacticMatches, 2 SemanticMatches, 81 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1938 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=598, Invalid=6208, Unknown=0, NotChecked=0, Total=6806 [2022-04-15 06:29:32,041 INFO L913 BasicCegarLoop]: 16 mSDtfsCounter, 94 mSDsluCounter, 159 mSDsCounter, 0 mSdLazyCounter, 4429 mSolverCounterSat, 94 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 96 SdHoareTripleChecker+Valid, 175 SdHoareTripleChecker+Invalid, 4523 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 94 IncrementalHoareTripleChecker+Valid, 4429 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.4s IncrementalHoareTripleChecker+Time [2022-04-15 06:29:32,042 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [96 Valid, 175 Invalid, 4523 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [94 Valid, 4429 Invalid, 0 Unknown, 0 Unchecked, 2.4s Time] [2022-04-15 06:29:32,042 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 309 states. [2022-04-15 06:29:33,055 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 309 to 270. [2022-04-15 06:29:33,055 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 06:29:33,069 INFO L82 GeneralOperation]: Start isEquivalent. First operand 309 states. Second operand has 270 states, 262 states have (on average 1.16793893129771) internal successors, (306), 263 states have internal predecessors, (306), 4 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-15 06:29:33,069 INFO L74 IsIncluded]: Start isIncluded. First operand 309 states. Second operand has 270 states, 262 states have (on average 1.16793893129771) internal successors, (306), 263 states have internal predecessors, (306), 4 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-15 06:29:33,070 INFO L87 Difference]: Start difference. First operand 309 states. Second operand has 270 states, 262 states have (on average 1.16793893129771) internal successors, (306), 263 states have internal predecessors, (306), 4 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-15 06:29:33,073 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:29:33,073 INFO L93 Difference]: Finished difference Result 309 states and 354 transitions. [2022-04-15 06:29:33,073 INFO L276 IsEmpty]: Start isEmpty. Operand 309 states and 354 transitions. [2022-04-15 06:29:33,073 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 06:29:33,073 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 06:29:33,074 INFO L74 IsIncluded]: Start isIncluded. First operand has 270 states, 262 states have (on average 1.16793893129771) internal successors, (306), 263 states have internal predecessors, (306), 4 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) Second operand 309 states. [2022-04-15 06:29:33,074 INFO L87 Difference]: Start difference. First operand has 270 states, 262 states have (on average 1.16793893129771) internal successors, (306), 263 states have internal predecessors, (306), 4 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) Second operand 309 states. [2022-04-15 06:29:33,077 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:29:33,077 INFO L93 Difference]: Finished difference Result 309 states and 354 transitions. [2022-04-15 06:29:33,077 INFO L276 IsEmpty]: Start isEmpty. Operand 309 states and 354 transitions. [2022-04-15 06:29:33,077 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 06:29:33,078 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 06:29:33,078 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 06:29:33,078 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 06:29:33,078 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 270 states, 262 states have (on average 1.16793893129771) internal successors, (306), 263 states have internal predecessors, (306), 4 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-15 06:29:33,081 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 270 states to 270 states and 313 transitions. [2022-04-15 06:29:33,082 INFO L78 Accepts]: Start accepts. Automaton has 270 states and 313 transitions. Word has length 74 [2022-04-15 06:29:33,082 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 06:29:33,082 INFO L478 AbstractCegarLoop]: Abstraction has 270 states and 313 transitions. [2022-04-15 06:29:33,082 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 50 states, 50 states have (on average 1.4) internal successors, (70), 48 states have internal predecessors, (70), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:29:33,082 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 270 states and 313 transitions. [2022-04-15 06:29:33,797 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 313 edges. 313 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 06:29:33,798 INFO L276 IsEmpty]: Start isEmpty. Operand 270 states and 313 transitions. [2022-04-15 06:29:33,798 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2022-04-15 06:29:33,798 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 06:29:33,798 INFO L499 BasicCegarLoop]: trace histogram [18, 18, 16, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 06:29:33,837 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (28)] Forceful destruction successful, exit code 0 [2022-04-15 06:29:34,014 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31,28 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 06:29:34,014 INFO L403 AbstractCegarLoop]: === Iteration 33 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 06:29:34,015 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 06:29:34,015 INFO L85 PathProgramCache]: Analyzing trace with hash 1073450470, now seen corresponding path program 8 times [2022-04-15 06:29:34,015 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 06:29:34,015 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [2089143254] [2022-04-15 06:29:34,143 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 4 AssignedVariables, 1 ReadonlyVariables, Eigenvalues: {0={1=3}, 1={1=1, 2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-15 06:29:34,143 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-15 06:29:34,143 INFO L85 PathProgramCache]: Analyzing trace with hash 494801944, now seen corresponding path program 1 times [2022-04-15 06:29:34,144 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 06:29:34,144 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1348015238] [2022-04-15 06:29:34,144 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 06:29:34,144 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 06:29:34,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:29:34,237 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 06:29:34,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:29:34,252 INFO L290 TraceCheckUtils]: 0: Hoare triple {35502#(and (= ~last~0 |old(~last~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(11, 2);call #Ultimate.allocInit(12, 3);~last~0 := 0; {35487#true} is VALID [2022-04-15 06:29:34,252 INFO L290 TraceCheckUtils]: 1: Hoare triple {35487#true} assume true; {35487#true} is VALID [2022-04-15 06:29:34,252 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {35487#true} {35487#true} #66#return; {35487#true} is VALID [2022-04-15 06:29:34,253 INFO L272 TraceCheckUtils]: 0: Hoare triple {35487#true} call ULTIMATE.init(); {35502#(and (= ~last~0 |old(~last~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 06:29:34,253 INFO L290 TraceCheckUtils]: 1: Hoare triple {35502#(and (= ~last~0 |old(~last~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(11, 2);call #Ultimate.allocInit(12, 3);~last~0 := 0; {35487#true} is VALID [2022-04-15 06:29:34,253 INFO L290 TraceCheckUtils]: 2: Hoare triple {35487#true} assume true; {35487#true} is VALID [2022-04-15 06:29:34,253 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {35487#true} {35487#true} #66#return; {35487#true} is VALID [2022-04-15 06:29:34,253 INFO L272 TraceCheckUtils]: 4: Hoare triple {35487#true} call #t~ret6 := main(); {35487#true} is VALID [2022-04-15 06:29:34,253 INFO L290 TraceCheckUtils]: 5: Hoare triple {35487#true} assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~last~0 := #t~nondet4;havoc #t~nondet4;~a~0 := 0;~b~0 := 0;~c~0 := 0;~st~0 := 0; {35487#true} is VALID [2022-04-15 06:29:34,253 INFO L290 TraceCheckUtils]: 6: Hoare triple {35487#true} [172] L30-->L23-3_primed: Formula: (let ((.cse0 (= v_main_~st~0_278 v_main_~st~0_276)) (.cse1 (= v_main_~b~0_143 v_main_~b~0_142)) (.cse2 (= v_main_~a~0_146 v_main_~a~0_145))) (or (and .cse0 .cse1 (= v_main_~c~0_787 v_main_~c~0_797) (= |v_main_#t~post5_376| |v_main_#t~post5_385|) .cse2) (and .cse0 .cse1 (= |v_main_#t~post5_385| |v_main_#t~post5_376|) (= v_main_~c~0_797 v_main_~c~0_787) .cse2))) InVars {main_~c~0=v_main_~c~0_797, main_#t~post5=|v_main_#t~post5_385|, main_~st~0=v_main_~st~0_278, main_~b~0=v_main_~b~0_143, main_~a~0=v_main_~a~0_146} OutVars{main_~c~0=v_main_~c~0_787, main_#t~post5=|v_main_#t~post5_376|, main_~st~0=v_main_~st~0_276, main_~b~0=v_main_~b~0_142, main_~a~0=v_main_~a~0_145} AuxVars[] AssignedVars[main_~c~0, main_#t~post5, main_~st~0, main_~b~0, main_~a~0] {35487#true} is VALID [2022-04-15 06:29:34,253 INFO L290 TraceCheckUtils]: 7: Hoare triple {35487#true} [171] L23-3_primed-->L23-3: Formula: (and (= v_main_~c~0_7 0) (= v_main_~st~0_6 1)) InVars {} OutVars{main_~c~0=v_main_~c~0_7, main_~st~0=v_main_~st~0_6} AuxVars[] AssignedVars[main_~c~0, main_~st~0] {35492#(= main_~c~0 0)} is VALID [2022-04-15 06:29:34,254 INFO L290 TraceCheckUtils]: 8: Hoare triple {35492#(= main_~c~0 0)} assume !!(~c~0 < 200000); {35492#(= main_~c~0 0)} is VALID [2022-04-15 06:29:34,254 INFO L290 TraceCheckUtils]: 9: Hoare triple {35492#(= main_~c~0 0)} assume ~c~0 == ~last~0;~st~0 := 0; {35492#(= main_~c~0 0)} is VALID [2022-04-15 06:29:34,254 INFO L290 TraceCheckUtils]: 10: Hoare triple {35492#(= main_~c~0 0)} #t~post5 := ~c~0;~c~0 := 1 + #t~post5;havoc #t~post5; {35493#(<= main_~c~0 1)} is VALID [2022-04-15 06:29:34,254 INFO L290 TraceCheckUtils]: 11: Hoare triple {35493#(<= main_~c~0 1)} assume !!(~c~0 < 200000); {35493#(<= main_~c~0 1)} is VALID [2022-04-15 06:29:34,255 INFO L290 TraceCheckUtils]: 12: Hoare triple {35493#(<= main_~c~0 1)} assume !(~c~0 == ~last~0); {35493#(<= main_~c~0 1)} is VALID [2022-04-15 06:29:34,255 INFO L290 TraceCheckUtils]: 13: Hoare triple {35493#(<= main_~c~0 1)} #t~post5 := ~c~0;~c~0 := 1 + #t~post5;havoc #t~post5; {35494#(<= main_~c~0 2)} is VALID [2022-04-15 06:29:34,255 INFO L290 TraceCheckUtils]: 14: Hoare triple {35494#(<= main_~c~0 2)} assume !!(~c~0 < 200000); {35494#(<= main_~c~0 2)} is VALID [2022-04-15 06:29:34,255 INFO L290 TraceCheckUtils]: 15: Hoare triple {35494#(<= main_~c~0 2)} assume !(~c~0 == ~last~0); {35494#(<= main_~c~0 2)} is VALID [2022-04-15 06:29:34,256 INFO L290 TraceCheckUtils]: 16: Hoare triple {35494#(<= main_~c~0 2)} #t~post5 := ~c~0;~c~0 := 1 + #t~post5;havoc #t~post5; {35495#(<= main_~c~0 3)} is VALID [2022-04-15 06:29:34,256 INFO L290 TraceCheckUtils]: 17: Hoare triple {35495#(<= main_~c~0 3)} assume !!(~c~0 < 200000); {35495#(<= main_~c~0 3)} is VALID [2022-04-15 06:29:34,256 INFO L290 TraceCheckUtils]: 18: Hoare triple {35495#(<= main_~c~0 3)} assume !(~c~0 == ~last~0); {35495#(<= main_~c~0 3)} is VALID [2022-04-15 06:29:34,257 INFO L290 TraceCheckUtils]: 19: Hoare triple {35495#(<= main_~c~0 3)} #t~post5 := ~c~0;~c~0 := 1 + #t~post5;havoc #t~post5; {35496#(<= main_~c~0 4)} is VALID [2022-04-15 06:29:34,257 INFO L290 TraceCheckUtils]: 20: Hoare triple {35496#(<= main_~c~0 4)} assume !!(~c~0 < 200000); {35496#(<= main_~c~0 4)} is VALID [2022-04-15 06:29:34,257 INFO L290 TraceCheckUtils]: 21: Hoare triple {35496#(<= main_~c~0 4)} assume !(~c~0 == ~last~0); {35496#(<= main_~c~0 4)} is VALID [2022-04-15 06:29:34,257 INFO L290 TraceCheckUtils]: 22: Hoare triple {35496#(<= main_~c~0 4)} #t~post5 := ~c~0;~c~0 := 1 + #t~post5;havoc #t~post5; {35497#(<= main_~c~0 5)} is VALID [2022-04-15 06:29:34,258 INFO L290 TraceCheckUtils]: 23: Hoare triple {35497#(<= main_~c~0 5)} assume !!(~c~0 < 200000); {35497#(<= main_~c~0 5)} is VALID [2022-04-15 06:29:34,258 INFO L290 TraceCheckUtils]: 24: Hoare triple {35497#(<= main_~c~0 5)} assume !(~c~0 == ~last~0); {35497#(<= main_~c~0 5)} is VALID [2022-04-15 06:29:34,258 INFO L290 TraceCheckUtils]: 25: Hoare triple {35497#(<= main_~c~0 5)} #t~post5 := ~c~0;~c~0 := 1 + #t~post5;havoc #t~post5; {35498#(<= main_~c~0 6)} is VALID [2022-04-15 06:29:34,258 INFO L290 TraceCheckUtils]: 26: Hoare triple {35498#(<= main_~c~0 6)} assume !!(~c~0 < 200000); {35498#(<= main_~c~0 6)} is VALID [2022-04-15 06:29:34,259 INFO L290 TraceCheckUtils]: 27: Hoare triple {35498#(<= main_~c~0 6)} assume !(~c~0 == ~last~0); {35498#(<= main_~c~0 6)} is VALID [2022-04-15 06:29:34,259 INFO L290 TraceCheckUtils]: 28: Hoare triple {35498#(<= main_~c~0 6)} #t~post5 := ~c~0;~c~0 := 1 + #t~post5;havoc #t~post5; {35499#(<= main_~c~0 7)} is VALID [2022-04-15 06:29:34,259 INFO L290 TraceCheckUtils]: 29: Hoare triple {35499#(<= main_~c~0 7)} assume !!(~c~0 < 200000); {35499#(<= main_~c~0 7)} is VALID [2022-04-15 06:29:34,260 INFO L290 TraceCheckUtils]: 30: Hoare triple {35499#(<= main_~c~0 7)} assume !(~c~0 == ~last~0); {35499#(<= main_~c~0 7)} is VALID [2022-04-15 06:29:34,260 INFO L290 TraceCheckUtils]: 31: Hoare triple {35499#(<= main_~c~0 7)} #t~post5 := ~c~0;~c~0 := 1 + #t~post5;havoc #t~post5; {35500#(<= main_~c~0 8)} is VALID [2022-04-15 06:29:34,260 INFO L290 TraceCheckUtils]: 32: Hoare triple {35500#(<= main_~c~0 8)} assume !!(~c~0 < 200000); {35500#(<= main_~c~0 8)} is VALID [2022-04-15 06:29:34,260 INFO L290 TraceCheckUtils]: 33: Hoare triple {35500#(<= main_~c~0 8)} assume !(~c~0 == ~last~0); {35500#(<= main_~c~0 8)} is VALID [2022-04-15 06:29:34,261 INFO L290 TraceCheckUtils]: 34: Hoare triple {35500#(<= main_~c~0 8)} #t~post5 := ~c~0;~c~0 := 1 + #t~post5;havoc #t~post5; {35501#(<= main_~c~0 9)} is VALID [2022-04-15 06:29:34,261 INFO L290 TraceCheckUtils]: 35: Hoare triple {35501#(<= main_~c~0 9)} assume !(~c~0 < 200000); {35488#false} is VALID [2022-04-15 06:29:34,261 INFO L290 TraceCheckUtils]: 36: Hoare triple {35488#false} assume 0 == ~st~0 && ~c~0 == 1 + ~last~0;~a~0 := 3 + ~a~0;~b~0 := 3 + ~b~0; {35488#false} is VALID [2022-04-15 06:29:34,261 INFO L290 TraceCheckUtils]: 37: Hoare triple {35488#false} assume !(~c~0 == ~last~0 && 0 == ~st~0); {35488#false} is VALID [2022-04-15 06:29:34,261 INFO L272 TraceCheckUtils]: 38: Hoare triple {35488#false} call __VERIFIER_assert((if ~a~0 == ~b~0 && 200000 == ~c~0 then 1 else 0)); {35488#false} is VALID [2022-04-15 06:29:34,261 INFO L290 TraceCheckUtils]: 39: Hoare triple {35488#false} ~cond := #in~cond; {35488#false} is VALID [2022-04-15 06:29:34,261 INFO L290 TraceCheckUtils]: 40: Hoare triple {35488#false} assume 0 == ~cond; {35488#false} is VALID [2022-04-15 06:29:34,261 INFO L290 TraceCheckUtils]: 41: Hoare triple {35488#false} assume !false; {35488#false} is VALID [2022-04-15 06:29:34,262 INFO L134 CoverageAnalysis]: Checked inductivity of 117 backedges. 0 proven. 117 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 06:29:34,262 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 06:29:34,262 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1348015238] [2022-04-15 06:29:34,262 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1348015238] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 06:29:34,262 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [44132526] [2022-04-15 06:29:34,262 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 06:29:34,262 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 06:29:34,262 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 06:29:34,263 INFO L229 MonitoredProcess]: Starting monitored process 29 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-15 06:29:34,264 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (29)] Waiting until timeout for monitored process [2022-04-15 06:29:34,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:29:34,308 INFO L263 TraceCheckSpWp]: Trace formula consists of 122 conjuncts, 11 conjunts are in the unsatisfiable core [2022-04-15 06:29:34,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:29:34,315 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 06:29:34,429 INFO L272 TraceCheckUtils]: 0: Hoare triple {35487#true} call ULTIMATE.init(); {35487#true} is VALID [2022-04-15 06:29:34,429 INFO L290 TraceCheckUtils]: 1: Hoare triple {35487#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(11, 2);call #Ultimate.allocInit(12, 3);~last~0 := 0; {35487#true} is VALID [2022-04-15 06:29:34,429 INFO L290 TraceCheckUtils]: 2: Hoare triple {35487#true} assume true; {35487#true} is VALID [2022-04-15 06:29:34,429 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {35487#true} {35487#true} #66#return; {35487#true} is VALID [2022-04-15 06:29:34,429 INFO L272 TraceCheckUtils]: 4: Hoare triple {35487#true} call #t~ret6 := main(); {35487#true} is VALID [2022-04-15 06:29:34,429 INFO L290 TraceCheckUtils]: 5: Hoare triple {35487#true} assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~last~0 := #t~nondet4;havoc #t~nondet4;~a~0 := 0;~b~0 := 0;~c~0 := 0;~st~0 := 0; {35487#true} is VALID [2022-04-15 06:29:34,429 INFO L290 TraceCheckUtils]: 6: Hoare triple {35487#true} [172] L30-->L23-3_primed: Formula: (let ((.cse0 (= v_main_~st~0_278 v_main_~st~0_276)) (.cse1 (= v_main_~b~0_143 v_main_~b~0_142)) (.cse2 (= v_main_~a~0_146 v_main_~a~0_145))) (or (and .cse0 .cse1 (= v_main_~c~0_787 v_main_~c~0_797) (= |v_main_#t~post5_376| |v_main_#t~post5_385|) .cse2) (and .cse0 .cse1 (= |v_main_#t~post5_385| |v_main_#t~post5_376|) (= v_main_~c~0_797 v_main_~c~0_787) .cse2))) InVars {main_~c~0=v_main_~c~0_797, main_#t~post5=|v_main_#t~post5_385|, main_~st~0=v_main_~st~0_278, main_~b~0=v_main_~b~0_143, main_~a~0=v_main_~a~0_146} OutVars{main_~c~0=v_main_~c~0_787, main_#t~post5=|v_main_#t~post5_376|, main_~st~0=v_main_~st~0_276, main_~b~0=v_main_~b~0_142, main_~a~0=v_main_~a~0_145} AuxVars[] AssignedVars[main_~c~0, main_#t~post5, main_~st~0, main_~b~0, main_~a~0] {35487#true} is VALID [2022-04-15 06:29:34,430 INFO L290 TraceCheckUtils]: 7: Hoare triple {35487#true} [171] L23-3_primed-->L23-3: Formula: (and (= v_main_~c~0_7 0) (= v_main_~st~0_6 1)) InVars {} OutVars{main_~c~0=v_main_~c~0_7, main_~st~0=v_main_~st~0_6} AuxVars[] AssignedVars[main_~c~0, main_~st~0] {35527#(<= main_~c~0 0)} is VALID [2022-04-15 06:29:34,430 INFO L290 TraceCheckUtils]: 8: Hoare triple {35527#(<= main_~c~0 0)} assume !!(~c~0 < 200000); {35527#(<= main_~c~0 0)} is VALID [2022-04-15 06:29:34,430 INFO L290 TraceCheckUtils]: 9: Hoare triple {35527#(<= main_~c~0 0)} assume ~c~0 == ~last~0;~st~0 := 0; {35527#(<= main_~c~0 0)} is VALID [2022-04-15 06:29:34,430 INFO L290 TraceCheckUtils]: 10: Hoare triple {35527#(<= main_~c~0 0)} #t~post5 := ~c~0;~c~0 := 1 + #t~post5;havoc #t~post5; {35493#(<= main_~c~0 1)} is VALID [2022-04-15 06:29:34,430 INFO L290 TraceCheckUtils]: 11: Hoare triple {35493#(<= main_~c~0 1)} assume !!(~c~0 < 200000); {35493#(<= main_~c~0 1)} is VALID [2022-04-15 06:29:34,431 INFO L290 TraceCheckUtils]: 12: Hoare triple {35493#(<= main_~c~0 1)} assume !(~c~0 == ~last~0); {35493#(<= main_~c~0 1)} is VALID [2022-04-15 06:29:34,431 INFO L290 TraceCheckUtils]: 13: Hoare triple {35493#(<= main_~c~0 1)} #t~post5 := ~c~0;~c~0 := 1 + #t~post5;havoc #t~post5; {35494#(<= main_~c~0 2)} is VALID [2022-04-15 06:29:34,431 INFO L290 TraceCheckUtils]: 14: Hoare triple {35494#(<= main_~c~0 2)} assume !!(~c~0 < 200000); {35494#(<= main_~c~0 2)} is VALID [2022-04-15 06:29:34,431 INFO L290 TraceCheckUtils]: 15: Hoare triple {35494#(<= main_~c~0 2)} assume !(~c~0 == ~last~0); {35494#(<= main_~c~0 2)} is VALID [2022-04-15 06:29:34,432 INFO L290 TraceCheckUtils]: 16: Hoare triple {35494#(<= main_~c~0 2)} #t~post5 := ~c~0;~c~0 := 1 + #t~post5;havoc #t~post5; {35495#(<= main_~c~0 3)} is VALID [2022-04-15 06:29:34,432 INFO L290 TraceCheckUtils]: 17: Hoare triple {35495#(<= main_~c~0 3)} assume !!(~c~0 < 200000); {35495#(<= main_~c~0 3)} is VALID [2022-04-15 06:29:34,432 INFO L290 TraceCheckUtils]: 18: Hoare triple {35495#(<= main_~c~0 3)} assume !(~c~0 == ~last~0); {35495#(<= main_~c~0 3)} is VALID [2022-04-15 06:29:34,432 INFO L290 TraceCheckUtils]: 19: Hoare triple {35495#(<= main_~c~0 3)} #t~post5 := ~c~0;~c~0 := 1 + #t~post5;havoc #t~post5; {35496#(<= main_~c~0 4)} is VALID [2022-04-15 06:29:34,432 INFO L290 TraceCheckUtils]: 20: Hoare triple {35496#(<= main_~c~0 4)} assume !!(~c~0 < 200000); {35496#(<= main_~c~0 4)} is VALID [2022-04-15 06:29:34,432 INFO L290 TraceCheckUtils]: 21: Hoare triple {35496#(<= main_~c~0 4)} assume !(~c~0 == ~last~0); {35496#(<= main_~c~0 4)} is VALID [2022-04-15 06:29:34,433 INFO L290 TraceCheckUtils]: 22: Hoare triple {35496#(<= main_~c~0 4)} #t~post5 := ~c~0;~c~0 := 1 + #t~post5;havoc #t~post5; {35497#(<= main_~c~0 5)} is VALID [2022-04-15 06:29:34,433 INFO L290 TraceCheckUtils]: 23: Hoare triple {35497#(<= main_~c~0 5)} assume !!(~c~0 < 200000); {35497#(<= main_~c~0 5)} is VALID [2022-04-15 06:29:34,433 INFO L290 TraceCheckUtils]: 24: Hoare triple {35497#(<= main_~c~0 5)} assume !(~c~0 == ~last~0); {35497#(<= main_~c~0 5)} is VALID [2022-04-15 06:29:34,433 INFO L290 TraceCheckUtils]: 25: Hoare triple {35497#(<= main_~c~0 5)} #t~post5 := ~c~0;~c~0 := 1 + #t~post5;havoc #t~post5; {35498#(<= main_~c~0 6)} is VALID [2022-04-15 06:29:34,434 INFO L290 TraceCheckUtils]: 26: Hoare triple {35498#(<= main_~c~0 6)} assume !!(~c~0 < 200000); {35498#(<= main_~c~0 6)} is VALID [2022-04-15 06:29:34,434 INFO L290 TraceCheckUtils]: 27: Hoare triple {35498#(<= main_~c~0 6)} assume !(~c~0 == ~last~0); {35498#(<= main_~c~0 6)} is VALID [2022-04-15 06:29:34,434 INFO L290 TraceCheckUtils]: 28: Hoare triple {35498#(<= main_~c~0 6)} #t~post5 := ~c~0;~c~0 := 1 + #t~post5;havoc #t~post5; {35499#(<= main_~c~0 7)} is VALID [2022-04-15 06:29:34,434 INFO L290 TraceCheckUtils]: 29: Hoare triple {35499#(<= main_~c~0 7)} assume !!(~c~0 < 200000); {35499#(<= main_~c~0 7)} is VALID [2022-04-15 06:29:34,434 INFO L290 TraceCheckUtils]: 30: Hoare triple {35499#(<= main_~c~0 7)} assume !(~c~0 == ~last~0); {35499#(<= main_~c~0 7)} is VALID [2022-04-15 06:29:34,435 INFO L290 TraceCheckUtils]: 31: Hoare triple {35499#(<= main_~c~0 7)} #t~post5 := ~c~0;~c~0 := 1 + #t~post5;havoc #t~post5; {35500#(<= main_~c~0 8)} is VALID [2022-04-15 06:29:34,435 INFO L290 TraceCheckUtils]: 32: Hoare triple {35500#(<= main_~c~0 8)} assume !!(~c~0 < 200000); {35500#(<= main_~c~0 8)} is VALID [2022-04-15 06:29:34,435 INFO L290 TraceCheckUtils]: 33: Hoare triple {35500#(<= main_~c~0 8)} assume !(~c~0 == ~last~0); {35500#(<= main_~c~0 8)} is VALID [2022-04-15 06:29:34,435 INFO L290 TraceCheckUtils]: 34: Hoare triple {35500#(<= main_~c~0 8)} #t~post5 := ~c~0;~c~0 := 1 + #t~post5;havoc #t~post5; {35501#(<= main_~c~0 9)} is VALID [2022-04-15 06:29:34,435 INFO L290 TraceCheckUtils]: 35: Hoare triple {35501#(<= main_~c~0 9)} assume !(~c~0 < 200000); {35488#false} is VALID [2022-04-15 06:29:34,436 INFO L290 TraceCheckUtils]: 36: Hoare triple {35488#false} assume 0 == ~st~0 && ~c~0 == 1 + ~last~0;~a~0 := 3 + ~a~0;~b~0 := 3 + ~b~0; {35488#false} is VALID [2022-04-15 06:29:34,436 INFO L290 TraceCheckUtils]: 37: Hoare triple {35488#false} assume !(~c~0 == ~last~0 && 0 == ~st~0); {35488#false} is VALID [2022-04-15 06:29:34,436 INFO L272 TraceCheckUtils]: 38: Hoare triple {35488#false} call __VERIFIER_assert((if ~a~0 == ~b~0 && 200000 == ~c~0 then 1 else 0)); {35488#false} is VALID [2022-04-15 06:29:34,436 INFO L290 TraceCheckUtils]: 39: Hoare triple {35488#false} ~cond := #in~cond; {35488#false} is VALID [2022-04-15 06:29:34,436 INFO L290 TraceCheckUtils]: 40: Hoare triple {35488#false} assume 0 == ~cond; {35488#false} is VALID [2022-04-15 06:29:34,436 INFO L290 TraceCheckUtils]: 41: Hoare triple {35488#false} assume !false; {35488#false} is VALID [2022-04-15 06:29:34,436 INFO L134 CoverageAnalysis]: Checked inductivity of 117 backedges. 0 proven. 117 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 06:29:34,436 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 06:29:34,617 INFO L290 TraceCheckUtils]: 41: Hoare triple {35488#false} assume !false; {35488#false} is VALID [2022-04-15 06:29:34,618 INFO L290 TraceCheckUtils]: 40: Hoare triple {35488#false} assume 0 == ~cond; {35488#false} is VALID [2022-04-15 06:29:34,618 INFO L290 TraceCheckUtils]: 39: Hoare triple {35488#false} ~cond := #in~cond; {35488#false} is VALID [2022-04-15 06:29:34,618 INFO L272 TraceCheckUtils]: 38: Hoare triple {35488#false} call __VERIFIER_assert((if ~a~0 == ~b~0 && 200000 == ~c~0 then 1 else 0)); {35488#false} is VALID [2022-04-15 06:29:34,618 INFO L290 TraceCheckUtils]: 37: Hoare triple {35488#false} assume !(~c~0 == ~last~0 && 0 == ~st~0); {35488#false} is VALID [2022-04-15 06:29:34,618 INFO L290 TraceCheckUtils]: 36: Hoare triple {35488#false} assume 0 == ~st~0 && ~c~0 == 1 + ~last~0;~a~0 := 3 + ~a~0;~b~0 := 3 + ~b~0; {35488#false} is VALID [2022-04-15 06:29:34,618 INFO L290 TraceCheckUtils]: 35: Hoare triple {35648#(< main_~c~0 200000)} assume !(~c~0 < 200000); {35488#false} is VALID [2022-04-15 06:29:34,618 INFO L290 TraceCheckUtils]: 34: Hoare triple {35652#(< main_~c~0 199999)} #t~post5 := ~c~0;~c~0 := 1 + #t~post5;havoc #t~post5; {35648#(< main_~c~0 200000)} is VALID [2022-04-15 06:29:34,619 INFO L290 TraceCheckUtils]: 33: Hoare triple {35652#(< main_~c~0 199999)} assume !(~c~0 == ~last~0); {35652#(< main_~c~0 199999)} is VALID [2022-04-15 06:29:34,623 INFO L290 TraceCheckUtils]: 32: Hoare triple {35652#(< main_~c~0 199999)} assume !!(~c~0 < 200000); {35652#(< main_~c~0 199999)} is VALID [2022-04-15 06:29:34,623 INFO L290 TraceCheckUtils]: 31: Hoare triple {35662#(< main_~c~0 199998)} #t~post5 := ~c~0;~c~0 := 1 + #t~post5;havoc #t~post5; {35652#(< main_~c~0 199999)} is VALID [2022-04-15 06:29:34,623 INFO L290 TraceCheckUtils]: 30: Hoare triple {35662#(< main_~c~0 199998)} assume !(~c~0 == ~last~0); {35662#(< main_~c~0 199998)} is VALID [2022-04-15 06:29:34,623 INFO L290 TraceCheckUtils]: 29: Hoare triple {35662#(< main_~c~0 199998)} assume !!(~c~0 < 200000); {35662#(< main_~c~0 199998)} is VALID [2022-04-15 06:29:34,639 INFO L290 TraceCheckUtils]: 28: Hoare triple {35672#(< main_~c~0 199997)} #t~post5 := ~c~0;~c~0 := 1 + #t~post5;havoc #t~post5; {35662#(< main_~c~0 199998)} is VALID [2022-04-15 06:29:34,640 INFO L290 TraceCheckUtils]: 27: Hoare triple {35672#(< main_~c~0 199997)} assume !(~c~0 == ~last~0); {35672#(< main_~c~0 199997)} is VALID [2022-04-15 06:29:34,640 INFO L290 TraceCheckUtils]: 26: Hoare triple {35672#(< main_~c~0 199997)} assume !!(~c~0 < 200000); {35672#(< main_~c~0 199997)} is VALID [2022-04-15 06:29:34,641 INFO L290 TraceCheckUtils]: 25: Hoare triple {35682#(< main_~c~0 199996)} #t~post5 := ~c~0;~c~0 := 1 + #t~post5;havoc #t~post5; {35672#(< main_~c~0 199997)} is VALID [2022-04-15 06:29:34,641 INFO L290 TraceCheckUtils]: 24: Hoare triple {35682#(< main_~c~0 199996)} assume !(~c~0 == ~last~0); {35682#(< main_~c~0 199996)} is VALID [2022-04-15 06:29:34,641 INFO L290 TraceCheckUtils]: 23: Hoare triple {35682#(< main_~c~0 199996)} assume !!(~c~0 < 200000); {35682#(< main_~c~0 199996)} is VALID [2022-04-15 06:29:34,642 INFO L290 TraceCheckUtils]: 22: Hoare triple {35692#(< main_~c~0 199995)} #t~post5 := ~c~0;~c~0 := 1 + #t~post5;havoc #t~post5; {35682#(< main_~c~0 199996)} is VALID [2022-04-15 06:29:34,642 INFO L290 TraceCheckUtils]: 21: Hoare triple {35692#(< main_~c~0 199995)} assume !(~c~0 == ~last~0); {35692#(< main_~c~0 199995)} is VALID [2022-04-15 06:29:34,642 INFO L290 TraceCheckUtils]: 20: Hoare triple {35692#(< main_~c~0 199995)} assume !!(~c~0 < 200000); {35692#(< main_~c~0 199995)} is VALID [2022-04-15 06:29:34,643 INFO L290 TraceCheckUtils]: 19: Hoare triple {35702#(< main_~c~0 199994)} #t~post5 := ~c~0;~c~0 := 1 + #t~post5;havoc #t~post5; {35692#(< main_~c~0 199995)} is VALID [2022-04-15 06:29:34,643 INFO L290 TraceCheckUtils]: 18: Hoare triple {35702#(< main_~c~0 199994)} assume !(~c~0 == ~last~0); {35702#(< main_~c~0 199994)} is VALID [2022-04-15 06:29:34,644 INFO L290 TraceCheckUtils]: 17: Hoare triple {35702#(< main_~c~0 199994)} assume !!(~c~0 < 200000); {35702#(< main_~c~0 199994)} is VALID [2022-04-15 06:29:34,644 INFO L290 TraceCheckUtils]: 16: Hoare triple {35712#(< main_~c~0 199993)} #t~post5 := ~c~0;~c~0 := 1 + #t~post5;havoc #t~post5; {35702#(< main_~c~0 199994)} is VALID [2022-04-15 06:29:34,644 INFO L290 TraceCheckUtils]: 15: Hoare triple {35712#(< main_~c~0 199993)} assume !(~c~0 == ~last~0); {35712#(< main_~c~0 199993)} is VALID [2022-04-15 06:29:34,645 INFO L290 TraceCheckUtils]: 14: Hoare triple {35712#(< main_~c~0 199993)} assume !!(~c~0 < 200000); {35712#(< main_~c~0 199993)} is VALID [2022-04-15 06:29:34,645 INFO L290 TraceCheckUtils]: 13: Hoare triple {35722#(< main_~c~0 199992)} #t~post5 := ~c~0;~c~0 := 1 + #t~post5;havoc #t~post5; {35712#(< main_~c~0 199993)} is VALID [2022-04-15 06:29:34,645 INFO L290 TraceCheckUtils]: 12: Hoare triple {35722#(< main_~c~0 199992)} assume !(~c~0 == ~last~0); {35722#(< main_~c~0 199992)} is VALID [2022-04-15 06:29:34,646 INFO L290 TraceCheckUtils]: 11: Hoare triple {35722#(< main_~c~0 199992)} assume !!(~c~0 < 200000); {35722#(< main_~c~0 199992)} is VALID [2022-04-15 06:29:34,646 INFO L290 TraceCheckUtils]: 10: Hoare triple {35732#(< main_~c~0 199991)} #t~post5 := ~c~0;~c~0 := 1 + #t~post5;havoc #t~post5; {35722#(< main_~c~0 199992)} is VALID [2022-04-15 06:29:34,646 INFO L290 TraceCheckUtils]: 9: Hoare triple {35732#(< main_~c~0 199991)} assume ~c~0 == ~last~0;~st~0 := 0; {35732#(< main_~c~0 199991)} is VALID [2022-04-15 06:29:34,647 INFO L290 TraceCheckUtils]: 8: Hoare triple {35732#(< main_~c~0 199991)} assume !!(~c~0 < 200000); {35732#(< main_~c~0 199991)} is VALID [2022-04-15 06:29:34,647 INFO L290 TraceCheckUtils]: 7: Hoare triple {35487#true} [171] L23-3_primed-->L23-3: Formula: (and (= v_main_~c~0_7 0) (= v_main_~st~0_6 1)) InVars {} OutVars{main_~c~0=v_main_~c~0_7, main_~st~0=v_main_~st~0_6} AuxVars[] AssignedVars[main_~c~0, main_~st~0] {35732#(< main_~c~0 199991)} is VALID [2022-04-15 06:29:34,647 INFO L290 TraceCheckUtils]: 6: Hoare triple {35487#true} [172] L30-->L23-3_primed: Formula: (let ((.cse0 (= v_main_~st~0_278 v_main_~st~0_276)) (.cse1 (= v_main_~b~0_143 v_main_~b~0_142)) (.cse2 (= v_main_~a~0_146 v_main_~a~0_145))) (or (and .cse0 .cse1 (= v_main_~c~0_787 v_main_~c~0_797) (= |v_main_#t~post5_376| |v_main_#t~post5_385|) .cse2) (and .cse0 .cse1 (= |v_main_#t~post5_385| |v_main_#t~post5_376|) (= v_main_~c~0_797 v_main_~c~0_787) .cse2))) InVars {main_~c~0=v_main_~c~0_797, main_#t~post5=|v_main_#t~post5_385|, main_~st~0=v_main_~st~0_278, main_~b~0=v_main_~b~0_143, main_~a~0=v_main_~a~0_146} OutVars{main_~c~0=v_main_~c~0_787, main_#t~post5=|v_main_#t~post5_376|, main_~st~0=v_main_~st~0_276, main_~b~0=v_main_~b~0_142, main_~a~0=v_main_~a~0_145} AuxVars[] AssignedVars[main_~c~0, main_#t~post5, main_~st~0, main_~b~0, main_~a~0] {35487#true} is VALID [2022-04-15 06:29:34,647 INFO L290 TraceCheckUtils]: 5: Hoare triple {35487#true} assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~last~0 := #t~nondet4;havoc #t~nondet4;~a~0 := 0;~b~0 := 0;~c~0 := 0;~st~0 := 0; {35487#true} is VALID [2022-04-15 06:29:34,647 INFO L272 TraceCheckUtils]: 4: Hoare triple {35487#true} call #t~ret6 := main(); {35487#true} is VALID [2022-04-15 06:29:34,647 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {35487#true} {35487#true} #66#return; {35487#true} is VALID [2022-04-15 06:29:34,647 INFO L290 TraceCheckUtils]: 2: Hoare triple {35487#true} assume true; {35487#true} is VALID [2022-04-15 06:29:34,648 INFO L290 TraceCheckUtils]: 1: Hoare triple {35487#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(11, 2);call #Ultimate.allocInit(12, 3);~last~0 := 0; {35487#true} is VALID [2022-04-15 06:29:34,648 INFO L272 TraceCheckUtils]: 0: Hoare triple {35487#true} call ULTIMATE.init(); {35487#true} is VALID [2022-04-15 06:29:34,648 INFO L134 CoverageAnalysis]: Checked inductivity of 117 backedges. 0 proven. 117 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 06:29:34,648 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [44132526] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 06:29:34,648 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 06:29:34,648 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 12, 12] total 24 [2022-04-15 06:29:34,900 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 06:29:34,900 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [2089143254] [2022-04-15 06:29:34,900 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [2089143254] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 06:29:34,900 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 06:29:34,900 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [24] imperfect sequences [] total 24 [2022-04-15 06:29:34,900 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1031694414] [2022-04-15 06:29:34,900 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 06:29:34,901 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 24 states have (on average 2.875) internal successors, (69), 23 states have internal predecessors, (69), 2 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 77 [2022-04-15 06:29:34,901 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 06:29:34,901 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 24 states, 24 states have (on average 2.875) internal successors, (69), 23 states have internal predecessors, (69), 2 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-15 06:29:34,946 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 74 edges. 74 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 06:29:34,946 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2022-04-15 06:29:34,946 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 06:29:34,946 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2022-04-15 06:29:34,947 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=454, Invalid=736, Unknown=0, NotChecked=0, Total=1190 [2022-04-15 06:29:34,947 INFO L87 Difference]: Start difference. First operand 270 states and 313 transitions. Second operand has 24 states, 24 states have (on average 2.875) internal successors, (69), 23 states have internal predecessors, (69), 2 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-15 06:29:36,667 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:29:36,667 INFO L93 Difference]: Finished difference Result 434 states and 508 transitions. [2022-04-15 06:29:36,668 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2022-04-15 06:29:36,668 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 24 states have (on average 2.875) internal successors, (69), 23 states have internal predecessors, (69), 2 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 77 [2022-04-15 06:29:36,668 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 06:29:36,668 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24 states, 24 states have (on average 2.875) internal successors, (69), 23 states have internal predecessors, (69), 2 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-15 06:29:36,681 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 109 transitions. [2022-04-15 06:29:36,681 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24 states, 24 states have (on average 2.875) internal successors, (69), 23 states have internal predecessors, (69), 2 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-15 06:29:36,682 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 109 transitions. [2022-04-15 06:29:36,682 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 24 states and 109 transitions. [2022-04-15 06:29:36,765 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-15 06:29:36,770 INFO L225 Difference]: With dead ends: 434 [2022-04-15 06:29:36,770 INFO L226 Difference]: Without dead ends: 358 [2022-04-15 06:29:36,770 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 141 GetRequests, 97 SyntacticMatches, 11 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 943 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=454, Invalid=736, Unknown=0, NotChecked=0, Total=1190 [2022-04-15 06:29:36,771 INFO L913 BasicCegarLoop]: 18 mSDtfsCounter, 62 mSDsluCounter, 30 mSDsCounter, 0 mSdLazyCounter, 486 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 62 SdHoareTripleChecker+Valid, 48 SdHoareTripleChecker+Invalid, 499 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 486 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-04-15 06:29:36,771 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [62 Valid, 48 Invalid, 499 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 486 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-04-15 06:29:36,772 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 358 states. [2022-04-15 06:29:38,167 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 358 to 305. [2022-04-15 06:29:38,167 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 06:29:38,168 INFO L82 GeneralOperation]: Start isEquivalent. First operand 358 states. Second operand has 305 states, 297 states have (on average 1.1548821548821548) internal successors, (343), 298 states have internal predecessors, (343), 4 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-15 06:29:38,168 INFO L74 IsIncluded]: Start isIncluded. First operand 358 states. Second operand has 305 states, 297 states have (on average 1.1548821548821548) internal successors, (343), 298 states have internal predecessors, (343), 4 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-15 06:29:38,168 INFO L87 Difference]: Start difference. First operand 358 states. Second operand has 305 states, 297 states have (on average 1.1548821548821548) internal successors, (343), 298 states have internal predecessors, (343), 4 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-15 06:29:38,172 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:29:38,172 INFO L93 Difference]: Finished difference Result 358 states and 405 transitions. [2022-04-15 06:29:38,172 INFO L276 IsEmpty]: Start isEmpty. Operand 358 states and 405 transitions. [2022-04-15 06:29:38,172 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 06:29:38,172 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 06:29:38,173 INFO L74 IsIncluded]: Start isIncluded. First operand has 305 states, 297 states have (on average 1.1548821548821548) internal successors, (343), 298 states have internal predecessors, (343), 4 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) Second operand 358 states. [2022-04-15 06:29:38,173 INFO L87 Difference]: Start difference. First operand has 305 states, 297 states have (on average 1.1548821548821548) internal successors, (343), 298 states have internal predecessors, (343), 4 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) Second operand 358 states. [2022-04-15 06:29:38,177 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:29:38,177 INFO L93 Difference]: Finished difference Result 358 states and 405 transitions. [2022-04-15 06:29:38,177 INFO L276 IsEmpty]: Start isEmpty. Operand 358 states and 405 transitions. [2022-04-15 06:29:38,177 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 06:29:38,177 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 06:29:38,177 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 06:29:38,177 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 06:29:38,177 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 305 states, 297 states have (on average 1.1548821548821548) internal successors, (343), 298 states have internal predecessors, (343), 4 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-15 06:29:38,181 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 305 states to 305 states and 350 transitions. [2022-04-15 06:29:38,181 INFO L78 Accepts]: Start accepts. Automaton has 305 states and 350 transitions. Word has length 77 [2022-04-15 06:29:38,181 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 06:29:38,182 INFO L478 AbstractCegarLoop]: Abstraction has 305 states and 350 transitions. [2022-04-15 06:29:38,182 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 24 states have (on average 2.875) internal successors, (69), 23 states have internal predecessors, (69), 2 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-15 06:29:38,182 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 305 states and 350 transitions. [2022-04-15 06:29:39,002 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 350 edges. 350 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 06:29:39,003 INFO L276 IsEmpty]: Start isEmpty. Operand 305 states and 350 transitions. [2022-04-15 06:29:39,003 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2022-04-15 06:29:39,003 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 06:29:39,004 INFO L499 BasicCegarLoop]: trace histogram [21, 21, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 06:29:39,021 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (29)] Forceful destruction successful, exit code 0 [2022-04-15 06:29:39,212 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32,29 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 06:29:39,212 INFO L403 AbstractCegarLoop]: === Iteration 34 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 06:29:39,213 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 06:29:39,213 INFO L85 PathProgramCache]: Analyzing trace with hash -1193271708, now seen corresponding path program 20 times [2022-04-15 06:29:39,213 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 06:29:39,213 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [727134037] [2022-04-15 06:29:40,330 WARN L970 rdanLoopAcceleration]: Unable to prove correctness of quantifier elimination. [2022-04-15 06:29:40,424 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 1 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-15 06:29:40,643 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {0={1=1}, 1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-15 06:29:40,644 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-15 06:29:40,647 INFO L85 PathProgramCache]: Analyzing trace with hash 1733453512, now seen corresponding path program 1 times [2022-04-15 06:29:40,647 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 06:29:40,647 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2100726009] [2022-04-15 06:29:40,647 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 06:29:40,647 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 06:29:40,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:29:40,756 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 06:29:40,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:29:40,759 INFO L290 TraceCheckUtils]: 0: Hoare triple {37982#(and (= ~last~0 |old(~last~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(11, 2);call #Ultimate.allocInit(12, 3);~last~0 := 0; {37970#true} is VALID [2022-04-15 06:29:40,759 INFO L290 TraceCheckUtils]: 1: Hoare triple {37970#true} assume true; {37970#true} is VALID [2022-04-15 06:29:40,759 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {37970#true} {37970#true} #66#return; {37970#true} is VALID [2022-04-15 06:29:40,760 INFO L272 TraceCheckUtils]: 0: Hoare triple {37970#true} call ULTIMATE.init(); {37982#(and (= ~last~0 |old(~last~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 06:29:40,760 INFO L290 TraceCheckUtils]: 1: Hoare triple {37982#(and (= ~last~0 |old(~last~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(11, 2);call #Ultimate.allocInit(12, 3);~last~0 := 0; {37970#true} is VALID [2022-04-15 06:29:40,760 INFO L290 TraceCheckUtils]: 2: Hoare triple {37970#true} assume true; {37970#true} is VALID [2022-04-15 06:29:40,760 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {37970#true} {37970#true} #66#return; {37970#true} is VALID [2022-04-15 06:29:40,760 INFO L272 TraceCheckUtils]: 4: Hoare triple {37970#true} call #t~ret6 := main(); {37970#true} is VALID [2022-04-15 06:29:40,760 INFO L290 TraceCheckUtils]: 5: Hoare triple {37970#true} assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~last~0 := #t~nondet4;havoc #t~nondet4;~a~0 := 0;~b~0 := 0;~c~0 := 0;~st~0 := 0; {37975#(and (= main_~a~0 0) (= main_~b~0 0))} is VALID [2022-04-15 06:29:40,761 INFO L290 TraceCheckUtils]: 6: Hoare triple {37975#(and (= main_~a~0 0) (= main_~b~0 0))} assume !false;~st~0 := 1;~c~0 := 0; {37976#(and (= main_~a~0 0) (= main_~st~0 1) (= main_~b~0 0))} is VALID [2022-04-15 06:29:40,761 INFO L290 TraceCheckUtils]: 7: Hoare triple {37976#(and (= main_~a~0 0) (= main_~st~0 1) (= main_~b~0 0))} [174] L23-3-->L23-4_primed: Formula: (let ((.cse0 (= v_~last~0_218 v_main_~c~0_830)) (.cse1 (= |v_main_#t~post5_400| |v_main_#t~post5_398|))) (or (and (= v_main_~c~0_829 v_main_~c~0_830) (or (not (< v_main_~c~0_830 200000)) .cse0) .cse1) (and (< v_main_~c~0_830 v_main_~c~0_829) (< v_main_~c~0_829 200001) (or (not (<= (+ v_main_~c~0_830 1) v_~last~0_218)) (not (<= (+ v_~last~0_218 1) v_main_~c~0_829))) (not .cse0)) (and (= v_~last~0_218 v_~last~0_218) (= v_main_~c~0_830 v_main_~c~0_829) .cse1))) InVars {main_~c~0=v_main_~c~0_830, main_#t~post5=|v_main_#t~post5_400|, ~last~0=v_~last~0_218} OutVars{main_#t~post5=|v_main_#t~post5_398|, main_~c~0=v_main_~c~0_829, ~last~0=v_~last~0_218} AuxVars[] AssignedVars[main_#t~post5, main_~c~0] {37976#(and (= main_~a~0 0) (= main_~st~0 1) (= main_~b~0 0))} is VALID [2022-04-15 06:29:40,762 INFO L290 TraceCheckUtils]: 8: Hoare triple {37976#(and (= main_~a~0 0) (= main_~st~0 1) (= main_~b~0 0))} [175] L23-4_primed-->L23-3: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {37976#(and (= main_~a~0 0) (= main_~st~0 1) (= main_~b~0 0))} is VALID [2022-04-15 06:29:40,762 INFO L290 TraceCheckUtils]: 9: Hoare triple {37976#(and (= main_~a~0 0) (= main_~st~0 1) (= main_~b~0 0))} [176] L23-3-->L23-4_primed: Formula: (let ((.cse0 (< v_main_~c~0_832 200000)) (.cse1 (= v_~last~0_219 v_main_~c~0_832)) (.cse2 (= v_main_~st~0_286 v_main_~st~0_285)) (.cse3 (= v_main_~c~0_832 v_main_~c~0_831)) (.cse4 (= |v_main_#t~post5_403| |v_main_#t~post5_399|))) (or (and .cse0 (= v_main_~st~0_285 0) (< v_main_~c~0_832 v_main_~c~0_831) .cse1 (<= v_main_~c~0_831 (+ v_~last~0_219 1))) (and .cse2 .cse3 .cse4 (= v_~last~0_219 v_~last~0_219)) (and (or (not .cse0) (not .cse1)) .cse2 .cse3 .cse4))) InVars {main_~c~0=v_main_~c~0_832, main_#t~post5=|v_main_#t~post5_403|, main_~st~0=v_main_~st~0_286, ~last~0=v_~last~0_219} OutVars{main_#t~post5=|v_main_#t~post5_399|, main_~c~0=v_main_~c~0_831, main_~st~0=v_main_~st~0_285, ~last~0=v_~last~0_219} AuxVars[] AssignedVars[main_#t~post5, main_~c~0, main_~st~0] {37977#(or (= main_~st~0 1) (and (= main_~a~0 0) (or (<= ~last~0 199999) (<= main_~c~0 200000)) (= main_~b~0 0)))} is VALID [2022-04-15 06:29:40,763 INFO L290 TraceCheckUtils]: 10: Hoare triple {37977#(or (= main_~st~0 1) (and (= main_~a~0 0) (or (<= ~last~0 199999) (<= main_~c~0 200000)) (= main_~b~0 0)))} [173] L23-4_primed-->L23-4: Formula: (not (< v_main_~c~0_8 200000)) InVars {main_~c~0=v_main_~c~0_8} OutVars{main_~c~0=v_main_~c~0_8} AuxVars[] AssignedVars[] {37978#(or (= main_~st~0 1) (and (= main_~a~0 0) (or (<= ~last~0 199999) (<= main_~c~0 200000)) (= main_~b~0 0) (< 199999 main_~c~0)))} is VALID [2022-04-15 06:29:40,764 INFO L290 TraceCheckUtils]: 11: Hoare triple {37978#(or (= main_~st~0 1) (and (= main_~a~0 0) (or (<= ~last~0 199999) (<= main_~c~0 200000)) (= main_~b~0 0) (< 199999 main_~c~0)))} assume 0 == ~st~0 && ~c~0 == 1 + ~last~0;~a~0 := 3 + ~a~0;~b~0 := 3 + ~b~0; {37979#(and (<= main_~b~0 main_~a~0) (< main_~a~0 (+ main_~b~0 1)) (< 199999 main_~c~0) (<= main_~c~0 200000))} is VALID [2022-04-15 06:29:40,764 INFO L290 TraceCheckUtils]: 12: Hoare triple {37979#(and (<= main_~b~0 main_~a~0) (< main_~a~0 (+ main_~b~0 1)) (< 199999 main_~c~0) (<= main_~c~0 200000))} assume !(~c~0 == ~last~0 && 0 == ~st~0); {37979#(and (<= main_~b~0 main_~a~0) (< main_~a~0 (+ main_~b~0 1)) (< 199999 main_~c~0) (<= main_~c~0 200000))} is VALID [2022-04-15 06:29:40,765 INFO L272 TraceCheckUtils]: 13: Hoare triple {37979#(and (<= main_~b~0 main_~a~0) (< main_~a~0 (+ main_~b~0 1)) (< 199999 main_~c~0) (<= main_~c~0 200000))} call __VERIFIER_assert((if ~a~0 == ~b~0 && 200000 == ~c~0 then 1 else 0)); {37980#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-15 06:29:40,765 INFO L290 TraceCheckUtils]: 14: Hoare triple {37980#(not (= |__VERIFIER_assert_#in~cond| 0))} ~cond := #in~cond; {37981#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-15 06:29:40,765 INFO L290 TraceCheckUtils]: 15: Hoare triple {37981#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {37971#false} is VALID [2022-04-15 06:29:40,765 INFO L290 TraceCheckUtils]: 16: Hoare triple {37971#false} assume !false; {37971#false} is VALID [2022-04-15 06:29:40,765 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-04-15 06:29:40,766 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 06:29:40,766 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2100726009] [2022-04-15 06:29:40,766 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2100726009] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 06:29:40,766 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1153646904] [2022-04-15 06:29:40,766 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 06:29:40,766 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 06:29:40,766 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 06:29:40,767 INFO L229 MonitoredProcess]: Starting monitored process 30 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-15 06:29:40,768 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (30)] Waiting until timeout for monitored process [2022-04-15 06:29:40,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:29:40,795 INFO L263 TraceCheckSpWp]: Trace formula consists of 85 conjuncts, 18 conjunts are in the unsatisfiable core [2022-04-15 06:29:40,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:29:40,802 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 06:29:41,083 INFO L272 TraceCheckUtils]: 0: Hoare triple {37970#true} call ULTIMATE.init(); {37970#true} is VALID [2022-04-15 06:29:41,083 INFO L290 TraceCheckUtils]: 1: Hoare triple {37970#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(11, 2);call #Ultimate.allocInit(12, 3);~last~0 := 0; {37970#true} is VALID [2022-04-15 06:29:41,083 INFO L290 TraceCheckUtils]: 2: Hoare triple {37970#true} assume true; {37970#true} is VALID [2022-04-15 06:29:41,083 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {37970#true} {37970#true} #66#return; {37970#true} is VALID [2022-04-15 06:29:41,083 INFO L272 TraceCheckUtils]: 4: Hoare triple {37970#true} call #t~ret6 := main(); {37970#true} is VALID [2022-04-15 06:29:41,083 INFO L290 TraceCheckUtils]: 5: Hoare triple {37970#true} assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~last~0 := #t~nondet4;havoc #t~nondet4;~a~0 := 0;~b~0 := 0;~c~0 := 0;~st~0 := 0; {37975#(and (= main_~a~0 0) (= main_~b~0 0))} is VALID [2022-04-15 06:29:41,084 INFO L290 TraceCheckUtils]: 6: Hoare triple {37975#(and (= main_~a~0 0) (= main_~b~0 0))} assume !false;~st~0 := 1;~c~0 := 0; {37976#(and (= main_~a~0 0) (= main_~st~0 1) (= main_~b~0 0))} is VALID [2022-04-15 06:29:41,084 INFO L290 TraceCheckUtils]: 7: Hoare triple {37976#(and (= main_~a~0 0) (= main_~st~0 1) (= main_~b~0 0))} [174] L23-3-->L23-4_primed: Formula: (let ((.cse0 (= v_~last~0_218 v_main_~c~0_830)) (.cse1 (= |v_main_#t~post5_400| |v_main_#t~post5_398|))) (or (and (= v_main_~c~0_829 v_main_~c~0_830) (or (not (< v_main_~c~0_830 200000)) .cse0) .cse1) (and (< v_main_~c~0_830 v_main_~c~0_829) (< v_main_~c~0_829 200001) (or (not (<= (+ v_main_~c~0_830 1) v_~last~0_218)) (not (<= (+ v_~last~0_218 1) v_main_~c~0_829))) (not .cse0)) (and (= v_~last~0_218 v_~last~0_218) (= v_main_~c~0_830 v_main_~c~0_829) .cse1))) InVars {main_~c~0=v_main_~c~0_830, main_#t~post5=|v_main_#t~post5_400|, ~last~0=v_~last~0_218} OutVars{main_#t~post5=|v_main_#t~post5_398|, main_~c~0=v_main_~c~0_829, ~last~0=v_~last~0_218} AuxVars[] AssignedVars[main_#t~post5, main_~c~0] {37976#(and (= main_~a~0 0) (= main_~st~0 1) (= main_~b~0 0))} is VALID [2022-04-15 06:29:41,085 INFO L290 TraceCheckUtils]: 8: Hoare triple {37976#(and (= main_~a~0 0) (= main_~st~0 1) (= main_~b~0 0))} [175] L23-4_primed-->L23-3: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {37976#(and (= main_~a~0 0) (= main_~st~0 1) (= main_~b~0 0))} is VALID [2022-04-15 06:29:41,085 INFO L290 TraceCheckUtils]: 9: Hoare triple {37976#(and (= main_~a~0 0) (= main_~st~0 1) (= main_~b~0 0))} [176] L23-3-->L23-4_primed: Formula: (let ((.cse0 (< v_main_~c~0_832 200000)) (.cse1 (= v_~last~0_219 v_main_~c~0_832)) (.cse2 (= v_main_~st~0_286 v_main_~st~0_285)) (.cse3 (= v_main_~c~0_832 v_main_~c~0_831)) (.cse4 (= |v_main_#t~post5_403| |v_main_#t~post5_399|))) (or (and .cse0 (= v_main_~st~0_285 0) (< v_main_~c~0_832 v_main_~c~0_831) .cse1 (<= v_main_~c~0_831 (+ v_~last~0_219 1))) (and .cse2 .cse3 .cse4 (= v_~last~0_219 v_~last~0_219)) (and (or (not .cse0) (not .cse1)) .cse2 .cse3 .cse4))) InVars {main_~c~0=v_main_~c~0_832, main_#t~post5=|v_main_#t~post5_403|, main_~st~0=v_main_~st~0_286, ~last~0=v_~last~0_219} OutVars{main_#t~post5=|v_main_#t~post5_399|, main_~c~0=v_main_~c~0_831, main_~st~0=v_main_~st~0_285, ~last~0=v_~last~0_219} AuxVars[] AssignedVars[main_#t~post5, main_~c~0, main_~st~0] {38013#(and (= main_~a~0 0) (= main_~b~0 0) (or (and (< ~last~0 200000) (< ~last~0 main_~c~0) (<= main_~c~0 (+ ~last~0 1)) (= main_~st~0 0)) (= main_~st~0 1)))} is VALID [2022-04-15 06:29:41,086 INFO L290 TraceCheckUtils]: 10: Hoare triple {38013#(and (= main_~a~0 0) (= main_~b~0 0) (or (and (< ~last~0 200000) (< ~last~0 main_~c~0) (<= main_~c~0 (+ ~last~0 1)) (= main_~st~0 0)) (= main_~st~0 1)))} [173] L23-4_primed-->L23-4: Formula: (not (< v_main_~c~0_8 200000)) InVars {main_~c~0=v_main_~c~0_8} OutVars{main_~c~0=v_main_~c~0_8} AuxVars[] AssignedVars[] {38017#(and (= main_~a~0 0) (or (= main_~st~0 1) (and (< ~last~0 200000) (<= main_~c~0 (+ ~last~0 1)) (= main_~st~0 0))) (= main_~b~0 0) (not (< main_~c~0 200000)))} is VALID [2022-04-15 06:29:41,087 INFO L290 TraceCheckUtils]: 11: Hoare triple {38017#(and (= main_~a~0 0) (or (= main_~st~0 1) (and (< ~last~0 200000) (<= main_~c~0 (+ ~last~0 1)) (= main_~st~0 0))) (= main_~b~0 0) (not (< main_~c~0 200000)))} assume 0 == ~st~0 && ~c~0 == 1 + ~last~0;~a~0 := 3 + ~a~0;~b~0 := 3 + ~b~0; {38021#(and (= main_~b~0 3) (<= 200000 main_~c~0) (< main_~c~0 200001) (= main_~a~0 3))} is VALID [2022-04-15 06:29:41,087 INFO L290 TraceCheckUtils]: 12: Hoare triple {38021#(and (= main_~b~0 3) (<= 200000 main_~c~0) (< main_~c~0 200001) (= main_~a~0 3))} assume !(~c~0 == ~last~0 && 0 == ~st~0); {38021#(and (= main_~b~0 3) (<= 200000 main_~c~0) (< main_~c~0 200001) (= main_~a~0 3))} is VALID [2022-04-15 06:29:41,088 INFO L272 TraceCheckUtils]: 13: Hoare triple {38021#(and (= main_~b~0 3) (<= 200000 main_~c~0) (< main_~c~0 200001) (= main_~a~0 3))} call __VERIFIER_assert((if ~a~0 == ~b~0 && 200000 == ~c~0 then 1 else 0)); {38028#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-15 06:29:41,088 INFO L290 TraceCheckUtils]: 14: Hoare triple {38028#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {38032#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-15 06:29:41,088 INFO L290 TraceCheckUtils]: 15: Hoare triple {38032#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {37971#false} is VALID [2022-04-15 06:29:41,088 INFO L290 TraceCheckUtils]: 16: Hoare triple {37971#false} assume !false; {37971#false} is VALID [2022-04-15 06:29:41,088 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-04-15 06:29:41,088 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 06:29:41,487 INFO L290 TraceCheckUtils]: 16: Hoare triple {37971#false} assume !false; {37971#false} is VALID [2022-04-15 06:29:41,488 INFO L290 TraceCheckUtils]: 15: Hoare triple {38032#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {37971#false} is VALID [2022-04-15 06:29:41,488 INFO L290 TraceCheckUtils]: 14: Hoare triple {38028#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {38032#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-15 06:29:41,489 INFO L272 TraceCheckUtils]: 13: Hoare triple {37979#(and (<= main_~b~0 main_~a~0) (< main_~a~0 (+ main_~b~0 1)) (< 199999 main_~c~0) (<= main_~c~0 200000))} call __VERIFIER_assert((if ~a~0 == ~b~0 && 200000 == ~c~0 then 1 else 0)); {38028#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-15 06:29:41,489 INFO L290 TraceCheckUtils]: 12: Hoare triple {37979#(and (<= main_~b~0 main_~a~0) (< main_~a~0 (+ main_~b~0 1)) (< 199999 main_~c~0) (<= main_~c~0 200000))} assume !(~c~0 == ~last~0 && 0 == ~st~0); {37979#(and (<= main_~b~0 main_~a~0) (< main_~a~0 (+ main_~b~0 1)) (< 199999 main_~c~0) (<= main_~c~0 200000))} is VALID [2022-04-15 06:29:41,490 INFO L290 TraceCheckUtils]: 11: Hoare triple {38054#(or (not (<= main_~c~0 (+ ~last~0 1))) (and (<= main_~b~0 main_~a~0) (< main_~a~0 (+ main_~b~0 1)) (< 199999 main_~c~0) (<= main_~c~0 200000)) (not (= main_~st~0 0)))} assume 0 == ~st~0 && ~c~0 == 1 + ~last~0;~a~0 := 3 + ~a~0;~b~0 := 3 + ~b~0; {37979#(and (<= main_~b~0 main_~a~0) (< main_~a~0 (+ main_~b~0 1)) (< 199999 main_~c~0) (<= main_~c~0 200000))} is VALID [2022-04-15 06:29:41,491 INFO L290 TraceCheckUtils]: 10: Hoare triple {38058#(or (not (<= main_~c~0 (+ ~last~0 1))) (and (<= main_~b~0 main_~a~0) (< main_~a~0 (+ main_~b~0 1)) (<= main_~c~0 200000)) (not (= main_~st~0 0)) (< main_~c~0 200000))} [173] L23-4_primed-->L23-4: Formula: (not (< v_main_~c~0_8 200000)) InVars {main_~c~0=v_main_~c~0_8} OutVars{main_~c~0=v_main_~c~0_8} AuxVars[] AssignedVars[] {38054#(or (not (<= main_~c~0 (+ ~last~0 1))) (and (<= main_~b~0 main_~a~0) (< main_~a~0 (+ main_~b~0 1)) (< 199999 main_~c~0) (<= main_~c~0 200000)) (not (= main_~st~0 0)))} is VALID [2022-04-15 06:29:41,491 INFO L290 TraceCheckUtils]: 9: Hoare triple {38062#(and (<= main_~b~0 main_~a~0) (< main_~a~0 (+ main_~b~0 1)) (not (= main_~st~0 0)))} [176] L23-3-->L23-4_primed: Formula: (let ((.cse0 (< v_main_~c~0_832 200000)) (.cse1 (= v_~last~0_219 v_main_~c~0_832)) (.cse2 (= v_main_~st~0_286 v_main_~st~0_285)) (.cse3 (= v_main_~c~0_832 v_main_~c~0_831)) (.cse4 (= |v_main_#t~post5_403| |v_main_#t~post5_399|))) (or (and .cse0 (= v_main_~st~0_285 0) (< v_main_~c~0_832 v_main_~c~0_831) .cse1 (<= v_main_~c~0_831 (+ v_~last~0_219 1))) (and .cse2 .cse3 .cse4 (= v_~last~0_219 v_~last~0_219)) (and (or (not .cse0) (not .cse1)) .cse2 .cse3 .cse4))) InVars {main_~c~0=v_main_~c~0_832, main_#t~post5=|v_main_#t~post5_403|, main_~st~0=v_main_~st~0_286, ~last~0=v_~last~0_219} OutVars{main_#t~post5=|v_main_#t~post5_399|, main_~c~0=v_main_~c~0_831, main_~st~0=v_main_~st~0_285, ~last~0=v_~last~0_219} AuxVars[] AssignedVars[main_#t~post5, main_~c~0, main_~st~0] {38058#(or (not (<= main_~c~0 (+ ~last~0 1))) (and (<= main_~b~0 main_~a~0) (< main_~a~0 (+ main_~b~0 1)) (<= main_~c~0 200000)) (not (= main_~st~0 0)) (< main_~c~0 200000))} is VALID [2022-04-15 06:29:41,492 INFO L290 TraceCheckUtils]: 8: Hoare triple {38062#(and (<= main_~b~0 main_~a~0) (< main_~a~0 (+ main_~b~0 1)) (not (= main_~st~0 0)))} [175] L23-4_primed-->L23-3: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {38062#(and (<= main_~b~0 main_~a~0) (< main_~a~0 (+ main_~b~0 1)) (not (= main_~st~0 0)))} is VALID [2022-04-15 06:29:41,492 INFO L290 TraceCheckUtils]: 7: Hoare triple {38062#(and (<= main_~b~0 main_~a~0) (< main_~a~0 (+ main_~b~0 1)) (not (= main_~st~0 0)))} [174] L23-3-->L23-4_primed: Formula: (let ((.cse0 (= v_~last~0_218 v_main_~c~0_830)) (.cse1 (= |v_main_#t~post5_400| |v_main_#t~post5_398|))) (or (and (= v_main_~c~0_829 v_main_~c~0_830) (or (not (< v_main_~c~0_830 200000)) .cse0) .cse1) (and (< v_main_~c~0_830 v_main_~c~0_829) (< v_main_~c~0_829 200001) (or (not (<= (+ v_main_~c~0_830 1) v_~last~0_218)) (not (<= (+ v_~last~0_218 1) v_main_~c~0_829))) (not .cse0)) (and (= v_~last~0_218 v_~last~0_218) (= v_main_~c~0_830 v_main_~c~0_829) .cse1))) InVars {main_~c~0=v_main_~c~0_830, main_#t~post5=|v_main_#t~post5_400|, ~last~0=v_~last~0_218} OutVars{main_#t~post5=|v_main_#t~post5_398|, main_~c~0=v_main_~c~0_829, ~last~0=v_~last~0_218} AuxVars[] AssignedVars[main_#t~post5, main_~c~0] {38062#(and (<= main_~b~0 main_~a~0) (< main_~a~0 (+ main_~b~0 1)) (not (= main_~st~0 0)))} is VALID [2022-04-15 06:29:41,493 INFO L290 TraceCheckUtils]: 6: Hoare triple {38072#(and (<= main_~b~0 main_~a~0) (< main_~a~0 (+ main_~b~0 1)))} assume !false;~st~0 := 1;~c~0 := 0; {38062#(and (<= main_~b~0 main_~a~0) (< main_~a~0 (+ main_~b~0 1)) (not (= main_~st~0 0)))} is VALID [2022-04-15 06:29:41,493 INFO L290 TraceCheckUtils]: 5: Hoare triple {37970#true} assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~last~0 := #t~nondet4;havoc #t~nondet4;~a~0 := 0;~b~0 := 0;~c~0 := 0;~st~0 := 0; {38072#(and (<= main_~b~0 main_~a~0) (< main_~a~0 (+ main_~b~0 1)))} is VALID [2022-04-15 06:29:41,493 INFO L272 TraceCheckUtils]: 4: Hoare triple {37970#true} call #t~ret6 := main(); {37970#true} is VALID [2022-04-15 06:29:41,493 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {37970#true} {37970#true} #66#return; {37970#true} is VALID [2022-04-15 06:29:41,493 INFO L290 TraceCheckUtils]: 2: Hoare triple {37970#true} assume true; {37970#true} is VALID [2022-04-15 06:29:41,493 INFO L290 TraceCheckUtils]: 1: Hoare triple {37970#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(11, 2);call #Ultimate.allocInit(12, 3);~last~0 := 0; {37970#true} is VALID [2022-04-15 06:29:41,493 INFO L272 TraceCheckUtils]: 0: Hoare triple {37970#true} call ULTIMATE.init(); {37970#true} is VALID [2022-04-15 06:29:41,494 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-04-15 06:29:41,494 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1153646904] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 06:29:41,494 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 06:29:41,494 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9, 9] total 19 [2022-04-15 06:29:43,210 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 06:29:43,210 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [727134037] [2022-04-15 06:29:43,210 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [727134037] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 06:29:43,210 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 06:29:43,210 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [52] imperfect sequences [] total 52 [2022-04-15 06:29:43,210 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1108775606] [2022-04-15 06:29:43,210 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 06:29:43,211 INFO L78 Accepts]: Start accepts. Automaton has has 52 states, 52 states have (on average 1.4038461538461537) internal successors, (73), 50 states have internal predecessors, (73), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 77 [2022-04-15 06:29:43,211 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 06:29:43,211 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 52 states, 52 states have (on average 1.4038461538461537) internal successors, (73), 50 states have internal predecessors, (73), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:29:43,267 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 77 edges. 77 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 06:29:43,268 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 52 states [2022-04-15 06:29:43,268 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 06:29:43,268 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 52 interpolants. [2022-04-15 06:29:43,268 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=396, Invalid=3386, Unknown=0, NotChecked=0, Total=3782 [2022-04-15 06:29:43,269 INFO L87 Difference]: Start difference. First operand 305 states and 350 transitions. Second operand has 52 states, 52 states have (on average 1.4038461538461537) internal successors, (73), 50 states have internal predecessors, (73), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:29:50,890 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:29:50,890 INFO L93 Difference]: Finished difference Result 422 states and 486 transitions. [2022-04-15 06:29:50,890 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 74 states. [2022-04-15 06:29:50,890 INFO L78 Accepts]: Start accepts. Automaton has has 52 states, 52 states have (on average 1.4038461538461537) internal successors, (73), 50 states have internal predecessors, (73), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 77 [2022-04-15 06:29:50,891 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 06:29:50,891 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 52 states, 52 states have (on average 1.4038461538461537) internal successors, (73), 50 states have internal predecessors, (73), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:29:50,892 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 175 transitions. [2022-04-15 06:29:50,893 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 52 states, 52 states have (on average 1.4038461538461537) internal successors, (73), 50 states have internal predecessors, (73), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:29:50,894 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 175 transitions. [2022-04-15 06:29:50,894 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 74 states and 175 transitions. [2022-04-15 06:29:50,998 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 175 edges. 175 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 06:29:51,003 INFO L225 Difference]: With dead ends: 422 [2022-04-15 06:29:51,003 INFO L226 Difference]: Without dead ends: 348 [2022-04-15 06:29:51,004 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 133 GetRequests, 47 SyntacticMatches, 2 SemanticMatches, 84 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2080 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=623, Invalid=6687, Unknown=0, NotChecked=0, Total=7310 [2022-04-15 06:29:51,004 INFO L913 BasicCegarLoop]: 16 mSDtfsCounter, 118 mSDsluCounter, 132 mSDsCounter, 0 mSdLazyCounter, 4597 mSolverCounterSat, 96 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 120 SdHoareTripleChecker+Valid, 148 SdHoareTripleChecker+Invalid, 4693 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 96 IncrementalHoareTripleChecker+Valid, 4597 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.9s IncrementalHoareTripleChecker+Time [2022-04-15 06:29:51,007 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [120 Valid, 148 Invalid, 4693 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [96 Valid, 4597 Invalid, 0 Unknown, 0 Unchecked, 2.9s Time] [2022-04-15 06:29:51,010 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 348 states. [2022-04-15 06:29:51,909 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 348 to 308. [2022-04-15 06:29:51,910 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 06:29:51,910 INFO L82 GeneralOperation]: Start isEquivalent. First operand 348 states. Second operand has 308 states, 300 states have (on average 1.1566666666666667) internal successors, (347), 301 states have internal predecessors, (347), 4 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-15 06:29:51,910 INFO L74 IsIncluded]: Start isIncluded. First operand 348 states. Second operand has 308 states, 300 states have (on average 1.1566666666666667) internal successors, (347), 301 states have internal predecessors, (347), 4 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-15 06:29:51,910 INFO L87 Difference]: Start difference. First operand 348 states. Second operand has 308 states, 300 states have (on average 1.1566666666666667) internal successors, (347), 301 states have internal predecessors, (347), 4 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-15 06:29:51,921 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:29:51,921 INFO L93 Difference]: Finished difference Result 348 states and 396 transitions. [2022-04-15 06:29:51,921 INFO L276 IsEmpty]: Start isEmpty. Operand 348 states and 396 transitions. [2022-04-15 06:29:51,921 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 06:29:51,921 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 06:29:51,922 INFO L74 IsIncluded]: Start isIncluded. First operand has 308 states, 300 states have (on average 1.1566666666666667) internal successors, (347), 301 states have internal predecessors, (347), 4 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) Second operand 348 states. [2022-04-15 06:29:51,922 INFO L87 Difference]: Start difference. First operand has 308 states, 300 states have (on average 1.1566666666666667) internal successors, (347), 301 states have internal predecessors, (347), 4 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) Second operand 348 states. [2022-04-15 06:29:51,927 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:29:51,928 INFO L93 Difference]: Finished difference Result 348 states and 396 transitions. [2022-04-15 06:29:51,928 INFO L276 IsEmpty]: Start isEmpty. Operand 348 states and 396 transitions. [2022-04-15 06:29:51,928 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 06:29:51,928 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 06:29:51,928 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 06:29:51,928 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 06:29:51,929 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 308 states, 300 states have (on average 1.1566666666666667) internal successors, (347), 301 states have internal predecessors, (347), 4 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-15 06:29:51,934 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 308 states to 308 states and 354 transitions. [2022-04-15 06:29:51,935 INFO L78 Accepts]: Start accepts. Automaton has 308 states and 354 transitions. Word has length 77 [2022-04-15 06:29:51,935 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 06:29:51,935 INFO L478 AbstractCegarLoop]: Abstraction has 308 states and 354 transitions. [2022-04-15 06:29:51,935 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 52 states, 52 states have (on average 1.4038461538461537) internal successors, (73), 50 states have internal predecessors, (73), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:29:51,935 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 308 states and 354 transitions. [2022-04-15 06:29:52,800 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 354 edges. 354 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 06:29:52,800 INFO L276 IsEmpty]: Start isEmpty. Operand 308 states and 354 transitions. [2022-04-15 06:29:52,801 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2022-04-15 06:29:52,801 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 06:29:52,801 INFO L499 BasicCegarLoop]: trace histogram [22, 22, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 06:29:52,817 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (30)] Ended with exit code 0 [2022-04-15 06:29:53,017 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33,30 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 06:29:53,017 INFO L403 AbstractCegarLoop]: === Iteration 35 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 06:29:53,017 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 06:29:53,017 INFO L85 PathProgramCache]: Analyzing trace with hash 482352839, now seen corresponding path program 21 times [2022-04-15 06:29:53,017 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 06:29:53,018 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1823909116] [2022-04-15 06:29:55,554 WARN L970 rdanLoopAcceleration]: Unable to prove correctness of quantifier elimination. [2022-04-15 06:29:59,575 WARN L977 rdanLoopAcceleration]: Unable to prove correctness of quantifier elimination. [2022-04-15 06:29:59,679 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 1 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-15 06:29:59,868 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {0={1=1}, 1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-15 06:29:59,869 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-15 06:29:59,872 INFO L85 PathProgramCache]: Analyzing trace with hash -56129592, now seen corresponding path program 1 times [2022-04-15 06:29:59,872 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 06:29:59,872 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2052384946] [2022-04-15 06:29:59,872 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 06:29:59,872 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 06:29:59,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:30:00,005 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 06:30:00,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:30:00,033 INFO L290 TraceCheckUtils]: 0: Hoare triple {40352#(and (= ~last~0 |old(~last~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(11, 2);call #Ultimate.allocInit(12, 3);~last~0 := 0; {40340#true} is VALID [2022-04-15 06:30:00,033 INFO L290 TraceCheckUtils]: 1: Hoare triple {40340#true} assume true; {40340#true} is VALID [2022-04-15 06:30:00,033 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {40340#true} {40340#true} #66#return; {40340#true} is VALID [2022-04-15 06:30:00,034 INFO L272 TraceCheckUtils]: 0: Hoare triple {40340#true} call ULTIMATE.init(); {40352#(and (= ~last~0 |old(~last~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 06:30:00,034 INFO L290 TraceCheckUtils]: 1: Hoare triple {40352#(and (= ~last~0 |old(~last~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(11, 2);call #Ultimate.allocInit(12, 3);~last~0 := 0; {40340#true} is VALID [2022-04-15 06:30:00,034 INFO L290 TraceCheckUtils]: 2: Hoare triple {40340#true} assume true; {40340#true} is VALID [2022-04-15 06:30:00,034 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {40340#true} {40340#true} #66#return; {40340#true} is VALID [2022-04-15 06:30:00,034 INFO L272 TraceCheckUtils]: 4: Hoare triple {40340#true} call #t~ret6 := main(); {40340#true} is VALID [2022-04-15 06:30:00,034 INFO L290 TraceCheckUtils]: 5: Hoare triple {40340#true} assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~last~0 := #t~nondet4;havoc #t~nondet4;~a~0 := 0;~b~0 := 0;~c~0 := 0;~st~0 := 0; {40345#(and (= main_~a~0 0) (= main_~b~0 0))} is VALID [2022-04-15 06:30:00,035 INFO L290 TraceCheckUtils]: 6: Hoare triple {40345#(and (= main_~a~0 0) (= main_~b~0 0))} assume !false;~st~0 := 1;~c~0 := 0; {40346#(and (= main_~a~0 0) (= main_~st~0 1) (= main_~b~0 0))} is VALID [2022-04-15 06:30:00,035 INFO L290 TraceCheckUtils]: 7: Hoare triple {40346#(and (= main_~a~0 0) (= main_~st~0 1) (= main_~b~0 0))} [178] L23-3-->L23-4_primed: Formula: (let ((.cse0 (= v_main_~c~0_868 v_main_~c~0_867)) (.cse1 (= |v_main_#t~post5_413| |v_main_#t~post5_411|)) (.cse2 (= v_~last~0_226 v_main_~c~0_868))) (or (and .cse0 .cse1 (or (not (< v_main_~c~0_868 200000)) .cse2)) (and .cse0 (= v_~last~0_226 v_~last~0_226) .cse1) (and (or (not (<= (+ v_~last~0_226 1) v_main_~c~0_867)) (not (<= (+ v_main_~c~0_868 1) v_~last~0_226))) (< v_main_~c~0_867 200001) (not .cse2) (< v_main_~c~0_868 v_main_~c~0_867)))) InVars {main_~c~0=v_main_~c~0_868, main_#t~post5=|v_main_#t~post5_413|, ~last~0=v_~last~0_226} OutVars{main_#t~post5=|v_main_#t~post5_411|, main_~c~0=v_main_~c~0_867, ~last~0=v_~last~0_226} AuxVars[] AssignedVars[main_#t~post5, main_~c~0] {40346#(and (= main_~a~0 0) (= main_~st~0 1) (= main_~b~0 0))} is VALID [2022-04-15 06:30:00,036 INFO L290 TraceCheckUtils]: 8: Hoare triple {40346#(and (= main_~a~0 0) (= main_~st~0 1) (= main_~b~0 0))} [179] L23-4_primed-->L23-3: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {40346#(and (= main_~a~0 0) (= main_~st~0 1) (= main_~b~0 0))} is VALID [2022-04-15 06:30:00,036 INFO L290 TraceCheckUtils]: 9: Hoare triple {40346#(and (= main_~a~0 0) (= main_~st~0 1) (= main_~b~0 0))} [180] L23-3-->L23-4_primed: Formula: (let ((.cse0 (< v_main_~c~0_870 200000)) (.cse1 (= v_~last~0_227 v_main_~c~0_870)) (.cse2 (= |v_main_#t~post5_416| |v_main_#t~post5_412|)) (.cse3 (= v_main_~st~0_296 v_main_~st~0_295))) (or (and .cse0 (< v_main_~c~0_870 v_main_~c~0_869) (= v_main_~st~0_295 0) .cse1 (<= v_main_~c~0_869 (+ v_~last~0_227 1))) (and (= v_~last~0_227 v_~last~0_227) .cse2 (= v_main_~c~0_870 v_main_~c~0_869) .cse3) (and (= v_main_~c~0_869 v_main_~c~0_870) (or (not .cse0) (not .cse1)) .cse2 .cse3))) InVars {main_~c~0=v_main_~c~0_870, main_#t~post5=|v_main_#t~post5_416|, main_~st~0=v_main_~st~0_296, ~last~0=v_~last~0_227} OutVars{main_#t~post5=|v_main_#t~post5_412|, main_~c~0=v_main_~c~0_869, main_~st~0=v_main_~st~0_295, ~last~0=v_~last~0_227} AuxVars[] AssignedVars[main_#t~post5, main_~c~0, main_~st~0] {40347#(or (= main_~st~0 1) (and (= main_~a~0 0) (or (<= ~last~0 199999) (<= main_~c~0 200000)) (= main_~b~0 0)))} is VALID [2022-04-15 06:30:00,037 INFO L290 TraceCheckUtils]: 10: Hoare triple {40347#(or (= main_~st~0 1) (and (= main_~a~0 0) (or (<= ~last~0 199999) (<= main_~c~0 200000)) (= main_~b~0 0)))} [177] L23-4_primed-->L23-4: Formula: (not (< v_main_~c~0_8 200000)) InVars {main_~c~0=v_main_~c~0_8} OutVars{main_~c~0=v_main_~c~0_8} AuxVars[] AssignedVars[] {40348#(or (= main_~st~0 1) (and (= main_~a~0 0) (or (<= ~last~0 199999) (<= main_~c~0 200000)) (= main_~b~0 0) (< 199999 main_~c~0)))} is VALID [2022-04-15 06:30:00,037 INFO L290 TraceCheckUtils]: 11: Hoare triple {40348#(or (= main_~st~0 1) (and (= main_~a~0 0) (or (<= ~last~0 199999) (<= main_~c~0 200000)) (= main_~b~0 0) (< 199999 main_~c~0)))} assume 0 == ~st~0 && ~c~0 == 1 + ~last~0;~a~0 := 3 + ~a~0;~b~0 := 3 + ~b~0; {40349#(and (<= main_~b~0 main_~a~0) (< main_~a~0 (+ main_~b~0 1)) (< 199999 main_~c~0) (<= main_~c~0 200000))} is VALID [2022-04-15 06:30:00,038 INFO L290 TraceCheckUtils]: 12: Hoare triple {40349#(and (<= main_~b~0 main_~a~0) (< main_~a~0 (+ main_~b~0 1)) (< 199999 main_~c~0) (<= main_~c~0 200000))} assume !(~c~0 == ~last~0 && 0 == ~st~0); {40349#(and (<= main_~b~0 main_~a~0) (< main_~a~0 (+ main_~b~0 1)) (< 199999 main_~c~0) (<= main_~c~0 200000))} is VALID [2022-04-15 06:30:00,038 INFO L272 TraceCheckUtils]: 13: Hoare triple {40349#(and (<= main_~b~0 main_~a~0) (< main_~a~0 (+ main_~b~0 1)) (< 199999 main_~c~0) (<= main_~c~0 200000))} call __VERIFIER_assert((if ~a~0 == ~b~0 && 200000 == ~c~0 then 1 else 0)); {40350#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-15 06:30:00,039 INFO L290 TraceCheckUtils]: 14: Hoare triple {40350#(not (= |__VERIFIER_assert_#in~cond| 0))} ~cond := #in~cond; {40351#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-15 06:30:00,039 INFO L290 TraceCheckUtils]: 15: Hoare triple {40351#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {40341#false} is VALID [2022-04-15 06:30:00,039 INFO L290 TraceCheckUtils]: 16: Hoare triple {40341#false} assume !false; {40341#false} is VALID [2022-04-15 06:30:00,040 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-04-15 06:30:00,040 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 06:30:00,040 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2052384946] [2022-04-15 06:30:00,040 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2052384946] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 06:30:00,040 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [331167376] [2022-04-15 06:30:00,040 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 06:30:00,040 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 06:30:00,040 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 06:30:00,041 INFO L229 MonitoredProcess]: Starting monitored process 31 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-15 06:30:00,042 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (31)] Waiting until timeout for monitored process [2022-04-15 06:30:00,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:30:00,080 INFO L263 TraceCheckSpWp]: Trace formula consists of 85 conjuncts, 18 conjunts are in the unsatisfiable core [2022-04-15 06:30:00,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:30:00,118 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 06:30:00,338 INFO L272 TraceCheckUtils]: 0: Hoare triple {40340#true} call ULTIMATE.init(); {40340#true} is VALID [2022-04-15 06:30:00,338 INFO L290 TraceCheckUtils]: 1: Hoare triple {40340#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(11, 2);call #Ultimate.allocInit(12, 3);~last~0 := 0; {40340#true} is VALID [2022-04-15 06:30:00,338 INFO L290 TraceCheckUtils]: 2: Hoare triple {40340#true} assume true; {40340#true} is VALID [2022-04-15 06:30:00,339 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {40340#true} {40340#true} #66#return; {40340#true} is VALID [2022-04-15 06:30:00,339 INFO L272 TraceCheckUtils]: 4: Hoare triple {40340#true} call #t~ret6 := main(); {40340#true} is VALID [2022-04-15 06:30:00,339 INFO L290 TraceCheckUtils]: 5: Hoare triple {40340#true} assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~last~0 := #t~nondet4;havoc #t~nondet4;~a~0 := 0;~b~0 := 0;~c~0 := 0;~st~0 := 0; {40345#(and (= main_~a~0 0) (= main_~b~0 0))} is VALID [2022-04-15 06:30:00,339 INFO L290 TraceCheckUtils]: 6: Hoare triple {40345#(and (= main_~a~0 0) (= main_~b~0 0))} assume !false;~st~0 := 1;~c~0 := 0; {40346#(and (= main_~a~0 0) (= main_~st~0 1) (= main_~b~0 0))} is VALID [2022-04-15 06:30:00,340 INFO L290 TraceCheckUtils]: 7: Hoare triple {40346#(and (= main_~a~0 0) (= main_~st~0 1) (= main_~b~0 0))} [178] L23-3-->L23-4_primed: Formula: (let ((.cse0 (= v_main_~c~0_868 v_main_~c~0_867)) (.cse1 (= |v_main_#t~post5_413| |v_main_#t~post5_411|)) (.cse2 (= v_~last~0_226 v_main_~c~0_868))) (or (and .cse0 .cse1 (or (not (< v_main_~c~0_868 200000)) .cse2)) (and .cse0 (= v_~last~0_226 v_~last~0_226) .cse1) (and (or (not (<= (+ v_~last~0_226 1) v_main_~c~0_867)) (not (<= (+ v_main_~c~0_868 1) v_~last~0_226))) (< v_main_~c~0_867 200001) (not .cse2) (< v_main_~c~0_868 v_main_~c~0_867)))) InVars {main_~c~0=v_main_~c~0_868, main_#t~post5=|v_main_#t~post5_413|, ~last~0=v_~last~0_226} OutVars{main_#t~post5=|v_main_#t~post5_411|, main_~c~0=v_main_~c~0_867, ~last~0=v_~last~0_226} AuxVars[] AssignedVars[main_#t~post5, main_~c~0] {40346#(and (= main_~a~0 0) (= main_~st~0 1) (= main_~b~0 0))} is VALID [2022-04-15 06:30:00,340 INFO L290 TraceCheckUtils]: 8: Hoare triple {40346#(and (= main_~a~0 0) (= main_~st~0 1) (= main_~b~0 0))} [179] L23-4_primed-->L23-3: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {40346#(and (= main_~a~0 0) (= main_~st~0 1) (= main_~b~0 0))} is VALID [2022-04-15 06:30:00,341 INFO L290 TraceCheckUtils]: 9: Hoare triple {40346#(and (= main_~a~0 0) (= main_~st~0 1) (= main_~b~0 0))} [180] L23-3-->L23-4_primed: Formula: (let ((.cse0 (< v_main_~c~0_870 200000)) (.cse1 (= v_~last~0_227 v_main_~c~0_870)) (.cse2 (= |v_main_#t~post5_416| |v_main_#t~post5_412|)) (.cse3 (= v_main_~st~0_296 v_main_~st~0_295))) (or (and .cse0 (< v_main_~c~0_870 v_main_~c~0_869) (= v_main_~st~0_295 0) .cse1 (<= v_main_~c~0_869 (+ v_~last~0_227 1))) (and (= v_~last~0_227 v_~last~0_227) .cse2 (= v_main_~c~0_870 v_main_~c~0_869) .cse3) (and (= v_main_~c~0_869 v_main_~c~0_870) (or (not .cse0) (not .cse1)) .cse2 .cse3))) InVars {main_~c~0=v_main_~c~0_870, main_#t~post5=|v_main_#t~post5_416|, main_~st~0=v_main_~st~0_296, ~last~0=v_~last~0_227} OutVars{main_#t~post5=|v_main_#t~post5_412|, main_~c~0=v_main_~c~0_869, main_~st~0=v_main_~st~0_295, ~last~0=v_~last~0_227} AuxVars[] AssignedVars[main_#t~post5, main_~c~0, main_~st~0] {40383#(and (= main_~a~0 0) (= main_~b~0 0) (or (and (< ~last~0 200000) (< ~last~0 main_~c~0) (<= main_~c~0 (+ ~last~0 1)) (= main_~st~0 0)) (= main_~st~0 1)))} is VALID [2022-04-15 06:30:00,356 INFO L290 TraceCheckUtils]: 10: Hoare triple {40383#(and (= main_~a~0 0) (= main_~b~0 0) (or (and (< ~last~0 200000) (< ~last~0 main_~c~0) (<= main_~c~0 (+ ~last~0 1)) (= main_~st~0 0)) (= main_~st~0 1)))} [177] L23-4_primed-->L23-4: Formula: (not (< v_main_~c~0_8 200000)) InVars {main_~c~0=v_main_~c~0_8} OutVars{main_~c~0=v_main_~c~0_8} AuxVars[] AssignedVars[] {40387#(and (= main_~a~0 0) (or (= main_~st~0 1) (and (< ~last~0 200000) (<= main_~c~0 (+ ~last~0 1)) (= main_~st~0 0))) (= main_~b~0 0) (not (< main_~c~0 200000)))} is VALID [2022-04-15 06:30:00,361 INFO L290 TraceCheckUtils]: 11: Hoare triple {40387#(and (= main_~a~0 0) (or (= main_~st~0 1) (and (< ~last~0 200000) (<= main_~c~0 (+ ~last~0 1)) (= main_~st~0 0))) (= main_~b~0 0) (not (< main_~c~0 200000)))} assume 0 == ~st~0 && ~c~0 == 1 + ~last~0;~a~0 := 3 + ~a~0;~b~0 := 3 + ~b~0; {40391#(and (= main_~b~0 3) (<= 200000 main_~c~0) (< main_~c~0 200001) (= main_~a~0 3))} is VALID [2022-04-15 06:30:00,361 INFO L290 TraceCheckUtils]: 12: Hoare triple {40391#(and (= main_~b~0 3) (<= 200000 main_~c~0) (< main_~c~0 200001) (= main_~a~0 3))} assume !(~c~0 == ~last~0 && 0 == ~st~0); {40391#(and (= main_~b~0 3) (<= 200000 main_~c~0) (< main_~c~0 200001) (= main_~a~0 3))} is VALID [2022-04-15 06:30:00,362 INFO L272 TraceCheckUtils]: 13: Hoare triple {40391#(and (= main_~b~0 3) (<= 200000 main_~c~0) (< main_~c~0 200001) (= main_~a~0 3))} call __VERIFIER_assert((if ~a~0 == ~b~0 && 200000 == ~c~0 then 1 else 0)); {40398#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-15 06:30:00,362 INFO L290 TraceCheckUtils]: 14: Hoare triple {40398#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {40402#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-15 06:30:00,363 INFO L290 TraceCheckUtils]: 15: Hoare triple {40402#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {40341#false} is VALID [2022-04-15 06:30:00,363 INFO L290 TraceCheckUtils]: 16: Hoare triple {40341#false} assume !false; {40341#false} is VALID [2022-04-15 06:30:00,363 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-04-15 06:30:00,363 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 06:30:00,728 INFO L290 TraceCheckUtils]: 16: Hoare triple {40341#false} assume !false; {40341#false} is VALID [2022-04-15 06:30:00,729 INFO L290 TraceCheckUtils]: 15: Hoare triple {40402#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {40341#false} is VALID [2022-04-15 06:30:00,729 INFO L290 TraceCheckUtils]: 14: Hoare triple {40398#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {40402#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-15 06:30:00,730 INFO L272 TraceCheckUtils]: 13: Hoare triple {40349#(and (<= main_~b~0 main_~a~0) (< main_~a~0 (+ main_~b~0 1)) (< 199999 main_~c~0) (<= main_~c~0 200000))} call __VERIFIER_assert((if ~a~0 == ~b~0 && 200000 == ~c~0 then 1 else 0)); {40398#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-15 06:30:00,730 INFO L290 TraceCheckUtils]: 12: Hoare triple {40349#(and (<= main_~b~0 main_~a~0) (< main_~a~0 (+ main_~b~0 1)) (< 199999 main_~c~0) (<= main_~c~0 200000))} assume !(~c~0 == ~last~0 && 0 == ~st~0); {40349#(and (<= main_~b~0 main_~a~0) (< main_~a~0 (+ main_~b~0 1)) (< 199999 main_~c~0) (<= main_~c~0 200000))} is VALID [2022-04-15 06:30:00,731 INFO L290 TraceCheckUtils]: 11: Hoare triple {40424#(or (not (<= main_~c~0 (+ ~last~0 1))) (and (<= main_~b~0 main_~a~0) (< main_~a~0 (+ main_~b~0 1)) (< 199999 main_~c~0) (<= main_~c~0 200000)) (not (= main_~st~0 0)))} assume 0 == ~st~0 && ~c~0 == 1 + ~last~0;~a~0 := 3 + ~a~0;~b~0 := 3 + ~b~0; {40349#(and (<= main_~b~0 main_~a~0) (< main_~a~0 (+ main_~b~0 1)) (< 199999 main_~c~0) (<= main_~c~0 200000))} is VALID [2022-04-15 06:30:00,731 INFO L290 TraceCheckUtils]: 10: Hoare triple {40428#(or (not (<= main_~c~0 (+ ~last~0 1))) (and (<= main_~b~0 main_~a~0) (< main_~a~0 (+ main_~b~0 1)) (<= main_~c~0 200000)) (not (= main_~st~0 0)) (< main_~c~0 200000))} [177] L23-4_primed-->L23-4: Formula: (not (< v_main_~c~0_8 200000)) InVars {main_~c~0=v_main_~c~0_8} OutVars{main_~c~0=v_main_~c~0_8} AuxVars[] AssignedVars[] {40424#(or (not (<= main_~c~0 (+ ~last~0 1))) (and (<= main_~b~0 main_~a~0) (< main_~a~0 (+ main_~b~0 1)) (< 199999 main_~c~0) (<= main_~c~0 200000)) (not (= main_~st~0 0)))} is VALID [2022-04-15 06:30:00,732 INFO L290 TraceCheckUtils]: 9: Hoare triple {40432#(and (<= main_~b~0 main_~a~0) (< main_~a~0 (+ main_~b~0 1)) (not (= main_~st~0 0)))} [180] L23-3-->L23-4_primed: Formula: (let ((.cse0 (< v_main_~c~0_870 200000)) (.cse1 (= v_~last~0_227 v_main_~c~0_870)) (.cse2 (= |v_main_#t~post5_416| |v_main_#t~post5_412|)) (.cse3 (= v_main_~st~0_296 v_main_~st~0_295))) (or (and .cse0 (< v_main_~c~0_870 v_main_~c~0_869) (= v_main_~st~0_295 0) .cse1 (<= v_main_~c~0_869 (+ v_~last~0_227 1))) (and (= v_~last~0_227 v_~last~0_227) .cse2 (= v_main_~c~0_870 v_main_~c~0_869) .cse3) (and (= v_main_~c~0_869 v_main_~c~0_870) (or (not .cse0) (not .cse1)) .cse2 .cse3))) InVars {main_~c~0=v_main_~c~0_870, main_#t~post5=|v_main_#t~post5_416|, main_~st~0=v_main_~st~0_296, ~last~0=v_~last~0_227} OutVars{main_#t~post5=|v_main_#t~post5_412|, main_~c~0=v_main_~c~0_869, main_~st~0=v_main_~st~0_295, ~last~0=v_~last~0_227} AuxVars[] AssignedVars[main_#t~post5, main_~c~0, main_~st~0] {40428#(or (not (<= main_~c~0 (+ ~last~0 1))) (and (<= main_~b~0 main_~a~0) (< main_~a~0 (+ main_~b~0 1)) (<= main_~c~0 200000)) (not (= main_~st~0 0)) (< main_~c~0 200000))} is VALID [2022-04-15 06:30:00,735 INFO L290 TraceCheckUtils]: 8: Hoare triple {40432#(and (<= main_~b~0 main_~a~0) (< main_~a~0 (+ main_~b~0 1)) (not (= main_~st~0 0)))} [179] L23-4_primed-->L23-3: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {40432#(and (<= main_~b~0 main_~a~0) (< main_~a~0 (+ main_~b~0 1)) (not (= main_~st~0 0)))} is VALID [2022-04-15 06:30:00,735 INFO L290 TraceCheckUtils]: 7: Hoare triple {40432#(and (<= main_~b~0 main_~a~0) (< main_~a~0 (+ main_~b~0 1)) (not (= main_~st~0 0)))} [178] L23-3-->L23-4_primed: Formula: (let ((.cse0 (= v_main_~c~0_868 v_main_~c~0_867)) (.cse1 (= |v_main_#t~post5_413| |v_main_#t~post5_411|)) (.cse2 (= v_~last~0_226 v_main_~c~0_868))) (or (and .cse0 .cse1 (or (not (< v_main_~c~0_868 200000)) .cse2)) (and .cse0 (= v_~last~0_226 v_~last~0_226) .cse1) (and (or (not (<= (+ v_~last~0_226 1) v_main_~c~0_867)) (not (<= (+ v_main_~c~0_868 1) v_~last~0_226))) (< v_main_~c~0_867 200001) (not .cse2) (< v_main_~c~0_868 v_main_~c~0_867)))) InVars {main_~c~0=v_main_~c~0_868, main_#t~post5=|v_main_#t~post5_413|, ~last~0=v_~last~0_226} OutVars{main_#t~post5=|v_main_#t~post5_411|, main_~c~0=v_main_~c~0_867, ~last~0=v_~last~0_226} AuxVars[] AssignedVars[main_#t~post5, main_~c~0] {40432#(and (<= main_~b~0 main_~a~0) (< main_~a~0 (+ main_~b~0 1)) (not (= main_~st~0 0)))} is VALID [2022-04-15 06:30:00,736 INFO L290 TraceCheckUtils]: 6: Hoare triple {40442#(and (<= main_~b~0 main_~a~0) (< main_~a~0 (+ main_~b~0 1)))} assume !false;~st~0 := 1;~c~0 := 0; {40432#(and (<= main_~b~0 main_~a~0) (< main_~a~0 (+ main_~b~0 1)) (not (= main_~st~0 0)))} is VALID [2022-04-15 06:30:00,736 INFO L290 TraceCheckUtils]: 5: Hoare triple {40340#true} assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~last~0 := #t~nondet4;havoc #t~nondet4;~a~0 := 0;~b~0 := 0;~c~0 := 0;~st~0 := 0; {40442#(and (<= main_~b~0 main_~a~0) (< main_~a~0 (+ main_~b~0 1)))} is VALID [2022-04-15 06:30:00,736 INFO L272 TraceCheckUtils]: 4: Hoare triple {40340#true} call #t~ret6 := main(); {40340#true} is VALID [2022-04-15 06:30:00,736 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {40340#true} {40340#true} #66#return; {40340#true} is VALID [2022-04-15 06:30:00,736 INFO L290 TraceCheckUtils]: 2: Hoare triple {40340#true} assume true; {40340#true} is VALID [2022-04-15 06:30:00,736 INFO L290 TraceCheckUtils]: 1: Hoare triple {40340#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(11, 2);call #Ultimate.allocInit(12, 3);~last~0 := 0; {40340#true} is VALID [2022-04-15 06:30:00,736 INFO L272 TraceCheckUtils]: 0: Hoare triple {40340#true} call ULTIMATE.init(); {40340#true} is VALID [2022-04-15 06:30:00,736 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-04-15 06:30:00,737 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [331167376] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 06:30:00,737 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 06:30:00,737 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9, 9] total 19 [2022-04-15 06:30:02,470 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 06:30:02,470 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1823909116] [2022-04-15 06:30:02,470 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1823909116] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 06:30:02,471 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 06:30:02,471 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [54] imperfect sequences [] total 54 [2022-04-15 06:30:02,471 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1846604650] [2022-04-15 06:30:02,471 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 06:30:02,471 INFO L78 Accepts]: Start accepts. Automaton has has 54 states, 54 states have (on average 1.4074074074074074) internal successors, (76), 52 states have internal predecessors, (76), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 80 [2022-04-15 06:30:02,471 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 06:30:02,471 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 54 states, 54 states have (on average 1.4074074074074074) internal successors, (76), 52 states have internal predecessors, (76), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:30:02,530 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 80 edges. 80 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 06:30:02,530 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 54 states [2022-04-15 06:30:02,531 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 06:30:02,531 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 54 interpolants. [2022-04-15 06:30:02,531 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=411, Invalid=3621, Unknown=0, NotChecked=0, Total=4032 [2022-04-15 06:30:02,531 INFO L87 Difference]: Start difference. First operand 308 states and 354 transitions. Second operand has 54 states, 54 states have (on average 1.4074074074074074) internal successors, (76), 52 states have internal predecessors, (76), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:30:10,849 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:30:10,849 INFO L93 Difference]: Finished difference Result 426 states and 491 transitions. [2022-04-15 06:30:10,849 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 77 states. [2022-04-15 06:30:10,850 INFO L78 Accepts]: Start accepts. Automaton has has 54 states, 54 states have (on average 1.4074074074074074) internal successors, (76), 52 states have internal predecessors, (76), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 80 [2022-04-15 06:30:10,850 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 06:30:10,850 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 54 states, 54 states have (on average 1.4074074074074074) internal successors, (76), 52 states have internal predecessors, (76), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:30:10,851 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 180 transitions. [2022-04-15 06:30:10,851 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 54 states, 54 states have (on average 1.4074074074074074) internal successors, (76), 52 states have internal predecessors, (76), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:30:10,852 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 180 transitions. [2022-04-15 06:30:10,852 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 77 states and 180 transitions. [2022-04-15 06:30:10,951 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 180 edges. 180 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 06:30:10,956 INFO L225 Difference]: With dead ends: 426 [2022-04-15 06:30:10,956 INFO L226 Difference]: Without dead ends: 352 [2022-04-15 06:30:10,957 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 137 GetRequests, 48 SyntacticMatches, 2 SemanticMatches, 87 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2227 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=648, Invalid=7184, Unknown=0, NotChecked=0, Total=7832 [2022-04-15 06:30:10,957 INFO L913 BasicCegarLoop]: 16 mSDtfsCounter, 125 mSDsluCounter, 146 mSDsCounter, 0 mSdLazyCounter, 5053 mSolverCounterSat, 103 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 127 SdHoareTripleChecker+Valid, 162 SdHoareTripleChecker+Invalid, 5156 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 103 IncrementalHoareTripleChecker+Valid, 5053 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.2s IncrementalHoareTripleChecker+Time [2022-04-15 06:30:10,957 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [127 Valid, 162 Invalid, 5156 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [103 Valid, 5053 Invalid, 0 Unknown, 0 Unchecked, 3.2s Time] [2022-04-15 06:30:10,958 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 352 states. [2022-04-15 06:30:11,817 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 352 to 311. [2022-04-15 06:30:11,818 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 06:30:11,818 INFO L82 GeneralOperation]: Start isEquivalent. First operand 352 states. Second operand has 311 states, 303 states have (on average 1.1584158415841583) internal successors, (351), 304 states have internal predecessors, (351), 4 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-15 06:30:11,818 INFO L74 IsIncluded]: Start isIncluded. First operand 352 states. Second operand has 311 states, 303 states have (on average 1.1584158415841583) internal successors, (351), 304 states have internal predecessors, (351), 4 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-15 06:30:11,819 INFO L87 Difference]: Start difference. First operand 352 states. Second operand has 311 states, 303 states have (on average 1.1584158415841583) internal successors, (351), 304 states have internal predecessors, (351), 4 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-15 06:30:11,823 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:30:11,823 INFO L93 Difference]: Finished difference Result 352 states and 401 transitions. [2022-04-15 06:30:11,823 INFO L276 IsEmpty]: Start isEmpty. Operand 352 states and 401 transitions. [2022-04-15 06:30:11,823 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 06:30:11,823 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 06:30:11,823 INFO L74 IsIncluded]: Start isIncluded. First operand has 311 states, 303 states have (on average 1.1584158415841583) internal successors, (351), 304 states have internal predecessors, (351), 4 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) Second operand 352 states. [2022-04-15 06:30:11,823 INFO L87 Difference]: Start difference. First operand has 311 states, 303 states have (on average 1.1584158415841583) internal successors, (351), 304 states have internal predecessors, (351), 4 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) Second operand 352 states. [2022-04-15 06:30:11,828 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:30:11,828 INFO L93 Difference]: Finished difference Result 352 states and 401 transitions. [2022-04-15 06:30:11,828 INFO L276 IsEmpty]: Start isEmpty. Operand 352 states and 401 transitions. [2022-04-15 06:30:11,828 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 06:30:11,828 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 06:30:11,828 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 06:30:11,828 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 06:30:11,828 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 311 states, 303 states have (on average 1.1584158415841583) internal successors, (351), 304 states have internal predecessors, (351), 4 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-15 06:30:11,833 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 311 states to 311 states and 358 transitions. [2022-04-15 06:30:11,833 INFO L78 Accepts]: Start accepts. Automaton has 311 states and 358 transitions. Word has length 80 [2022-04-15 06:30:11,833 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 06:30:11,833 INFO L478 AbstractCegarLoop]: Abstraction has 311 states and 358 transitions. [2022-04-15 06:30:11,833 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 54 states, 54 states have (on average 1.4074074074074074) internal successors, (76), 52 states have internal predecessors, (76), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:30:11,833 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 311 states and 358 transitions. [2022-04-15 06:30:12,674 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 358 edges. 358 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 06:30:12,674 INFO L276 IsEmpty]: Start isEmpty. Operand 311 states and 358 transitions. [2022-04-15 06:30:12,674 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2022-04-15 06:30:12,674 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 06:30:12,674 INFO L499 BasicCegarLoop]: trace histogram [20, 20, 18, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 06:30:12,690 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (31)] Forceful destruction successful, exit code 0 [2022-04-15 06:30:12,887 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 31 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable34 [2022-04-15 06:30:12,887 INFO L403 AbstractCegarLoop]: === Iteration 36 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 06:30:12,888 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 06:30:12,888 INFO L85 PathProgramCache]: Analyzing trace with hash 1052928194, now seen corresponding path program 9 times [2022-04-15 06:30:12,888 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 06:30:12,888 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1040245440] [2022-04-15 06:30:12,977 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 4 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {0={1=3}, 1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-15 06:30:12,977 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-15 06:30:12,978 INFO L85 PathProgramCache]: Analyzing trace with hash -1376279725, now seen corresponding path program 1 times [2022-04-15 06:30:12,978 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 06:30:12,978 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1503483051] [2022-04-15 06:30:12,978 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 06:30:12,978 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 06:30:12,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:30:13,110 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 06:30:13,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:30:13,113 INFO L290 TraceCheckUtils]: 0: Hoare triple {42752#(and (= ~last~0 |old(~last~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(11, 2);call #Ultimate.allocInit(12, 3);~last~0 := 0; {42736#true} is VALID [2022-04-15 06:30:13,113 INFO L290 TraceCheckUtils]: 1: Hoare triple {42736#true} assume true; {42736#true} is VALID [2022-04-15 06:30:13,113 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {42736#true} {42736#true} #66#return; {42736#true} is VALID [2022-04-15 06:30:13,113 INFO L272 TraceCheckUtils]: 0: Hoare triple {42736#true} call ULTIMATE.init(); {42752#(and (= ~last~0 |old(~last~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 06:30:13,113 INFO L290 TraceCheckUtils]: 1: Hoare triple {42752#(and (= ~last~0 |old(~last~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(11, 2);call #Ultimate.allocInit(12, 3);~last~0 := 0; {42736#true} is VALID [2022-04-15 06:30:13,114 INFO L290 TraceCheckUtils]: 2: Hoare triple {42736#true} assume true; {42736#true} is VALID [2022-04-15 06:30:13,114 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {42736#true} {42736#true} #66#return; {42736#true} is VALID [2022-04-15 06:30:13,114 INFO L272 TraceCheckUtils]: 4: Hoare triple {42736#true} call #t~ret6 := main(); {42736#true} is VALID [2022-04-15 06:30:13,114 INFO L290 TraceCheckUtils]: 5: Hoare triple {42736#true} assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~last~0 := #t~nondet4;havoc #t~nondet4;~a~0 := 0;~b~0 := 0;~c~0 := 0;~st~0 := 0; {42736#true} is VALID [2022-04-15 06:30:13,114 INFO L290 TraceCheckUtils]: 6: Hoare triple {42736#true} [182] L30-->L23-3_primed: Formula: (let ((.cse0 (= v_main_~b~0_158 v_main_~b~0_157)) (.cse1 (= v_main_~a~0_161 v_main_~a~0_160)) (.cse2 (= |v_main_#t~post5_434| |v_main_#t~post5_424|)) (.cse3 (= v_main_~st~0_307 v_main_~st~0_305))) (or (and .cse0 (= v_main_~c~0_919 v_main_~c~0_908) .cse1 .cse2 .cse3) (and .cse0 .cse1 (= v_main_~c~0_908 v_main_~c~0_919) .cse2 .cse3))) InVars {main_~c~0=v_main_~c~0_919, main_#t~post5=|v_main_#t~post5_434|, main_~st~0=v_main_~st~0_307, main_~b~0=v_main_~b~0_158, main_~a~0=v_main_~a~0_161} OutVars{main_~c~0=v_main_~c~0_908, main_#t~post5=|v_main_#t~post5_424|, main_~st~0=v_main_~st~0_305, main_~b~0=v_main_~b~0_157, main_~a~0=v_main_~a~0_160} AuxVars[] AssignedVars[main_~c~0, main_#t~post5, main_~st~0, main_~b~0, main_~a~0] {42736#true} is VALID [2022-04-15 06:30:13,114 INFO L290 TraceCheckUtils]: 7: Hoare triple {42736#true} [181] L23-3_primed-->L23-3: Formula: (and (= v_main_~c~0_7 0) (= v_main_~st~0_6 1)) InVars {} OutVars{main_~c~0=v_main_~c~0_7, main_~st~0=v_main_~st~0_6} AuxVars[] AssignedVars[main_~c~0, main_~st~0] {42741#(= main_~c~0 0)} is VALID [2022-04-15 06:30:13,114 INFO L290 TraceCheckUtils]: 8: Hoare triple {42741#(= main_~c~0 0)} assume !!(~c~0 < 200000); {42741#(= main_~c~0 0)} is VALID [2022-04-15 06:30:13,114 INFO L290 TraceCheckUtils]: 9: Hoare triple {42741#(= main_~c~0 0)} assume ~c~0 == ~last~0;~st~0 := 0; {42741#(= main_~c~0 0)} is VALID [2022-04-15 06:30:13,115 INFO L290 TraceCheckUtils]: 10: Hoare triple {42741#(= main_~c~0 0)} #t~post5 := ~c~0;~c~0 := 1 + #t~post5;havoc #t~post5; {42742#(<= main_~c~0 1)} is VALID [2022-04-15 06:30:13,115 INFO L290 TraceCheckUtils]: 11: Hoare triple {42742#(<= main_~c~0 1)} assume !!(~c~0 < 200000); {42742#(<= main_~c~0 1)} is VALID [2022-04-15 06:30:13,115 INFO L290 TraceCheckUtils]: 12: Hoare triple {42742#(<= main_~c~0 1)} assume !(~c~0 == ~last~0); {42742#(<= main_~c~0 1)} is VALID [2022-04-15 06:30:13,115 INFO L290 TraceCheckUtils]: 13: Hoare triple {42742#(<= main_~c~0 1)} #t~post5 := ~c~0;~c~0 := 1 + #t~post5;havoc #t~post5; {42743#(<= main_~c~0 2)} is VALID [2022-04-15 06:30:13,116 INFO L290 TraceCheckUtils]: 14: Hoare triple {42743#(<= main_~c~0 2)} assume !!(~c~0 < 200000); {42743#(<= main_~c~0 2)} is VALID [2022-04-15 06:30:13,116 INFO L290 TraceCheckUtils]: 15: Hoare triple {42743#(<= main_~c~0 2)} assume !(~c~0 == ~last~0); {42743#(<= main_~c~0 2)} is VALID [2022-04-15 06:30:13,116 INFO L290 TraceCheckUtils]: 16: Hoare triple {42743#(<= main_~c~0 2)} #t~post5 := ~c~0;~c~0 := 1 + #t~post5;havoc #t~post5; {42744#(<= main_~c~0 3)} is VALID [2022-04-15 06:30:13,116 INFO L290 TraceCheckUtils]: 17: Hoare triple {42744#(<= main_~c~0 3)} assume !!(~c~0 < 200000); {42744#(<= main_~c~0 3)} is VALID [2022-04-15 06:30:13,117 INFO L290 TraceCheckUtils]: 18: Hoare triple {42744#(<= main_~c~0 3)} assume !(~c~0 == ~last~0); {42744#(<= main_~c~0 3)} is VALID [2022-04-15 06:30:13,117 INFO L290 TraceCheckUtils]: 19: Hoare triple {42744#(<= main_~c~0 3)} #t~post5 := ~c~0;~c~0 := 1 + #t~post5;havoc #t~post5; {42745#(<= main_~c~0 4)} is VALID [2022-04-15 06:30:13,117 INFO L290 TraceCheckUtils]: 20: Hoare triple {42745#(<= main_~c~0 4)} assume !!(~c~0 < 200000); {42745#(<= main_~c~0 4)} is VALID [2022-04-15 06:30:13,117 INFO L290 TraceCheckUtils]: 21: Hoare triple {42745#(<= main_~c~0 4)} assume !(~c~0 == ~last~0); {42745#(<= main_~c~0 4)} is VALID [2022-04-15 06:30:13,118 INFO L290 TraceCheckUtils]: 22: Hoare triple {42745#(<= main_~c~0 4)} #t~post5 := ~c~0;~c~0 := 1 + #t~post5;havoc #t~post5; {42746#(<= main_~c~0 5)} is VALID [2022-04-15 06:30:13,118 INFO L290 TraceCheckUtils]: 23: Hoare triple {42746#(<= main_~c~0 5)} assume !!(~c~0 < 200000); {42746#(<= main_~c~0 5)} is VALID [2022-04-15 06:30:13,118 INFO L290 TraceCheckUtils]: 24: Hoare triple {42746#(<= main_~c~0 5)} assume !(~c~0 == ~last~0); {42746#(<= main_~c~0 5)} is VALID [2022-04-15 06:30:13,119 INFO L290 TraceCheckUtils]: 25: Hoare triple {42746#(<= main_~c~0 5)} #t~post5 := ~c~0;~c~0 := 1 + #t~post5;havoc #t~post5; {42747#(<= main_~c~0 6)} is VALID [2022-04-15 06:30:13,119 INFO L290 TraceCheckUtils]: 26: Hoare triple {42747#(<= main_~c~0 6)} assume !!(~c~0 < 200000); {42747#(<= main_~c~0 6)} is VALID [2022-04-15 06:30:13,119 INFO L290 TraceCheckUtils]: 27: Hoare triple {42747#(<= main_~c~0 6)} assume !(~c~0 == ~last~0); {42747#(<= main_~c~0 6)} is VALID [2022-04-15 06:30:13,119 INFO L290 TraceCheckUtils]: 28: Hoare triple {42747#(<= main_~c~0 6)} #t~post5 := ~c~0;~c~0 := 1 + #t~post5;havoc #t~post5; {42748#(<= main_~c~0 7)} is VALID [2022-04-15 06:30:13,120 INFO L290 TraceCheckUtils]: 29: Hoare triple {42748#(<= main_~c~0 7)} assume !!(~c~0 < 200000); {42748#(<= main_~c~0 7)} is VALID [2022-04-15 06:30:13,120 INFO L290 TraceCheckUtils]: 30: Hoare triple {42748#(<= main_~c~0 7)} assume !(~c~0 == ~last~0); {42748#(<= main_~c~0 7)} is VALID [2022-04-15 06:30:13,120 INFO L290 TraceCheckUtils]: 31: Hoare triple {42748#(<= main_~c~0 7)} #t~post5 := ~c~0;~c~0 := 1 + #t~post5;havoc #t~post5; {42749#(<= main_~c~0 8)} is VALID [2022-04-15 06:30:13,120 INFO L290 TraceCheckUtils]: 32: Hoare triple {42749#(<= main_~c~0 8)} assume !!(~c~0 < 200000); {42749#(<= main_~c~0 8)} is VALID [2022-04-15 06:30:13,121 INFO L290 TraceCheckUtils]: 33: Hoare triple {42749#(<= main_~c~0 8)} assume !(~c~0 == ~last~0); {42749#(<= main_~c~0 8)} is VALID [2022-04-15 06:30:13,121 INFO L290 TraceCheckUtils]: 34: Hoare triple {42749#(<= main_~c~0 8)} #t~post5 := ~c~0;~c~0 := 1 + #t~post5;havoc #t~post5; {42750#(<= main_~c~0 9)} is VALID [2022-04-15 06:30:13,121 INFO L290 TraceCheckUtils]: 35: Hoare triple {42750#(<= main_~c~0 9)} assume !!(~c~0 < 200000); {42750#(<= main_~c~0 9)} is VALID [2022-04-15 06:30:13,121 INFO L290 TraceCheckUtils]: 36: Hoare triple {42750#(<= main_~c~0 9)} assume !(~c~0 == ~last~0); {42750#(<= main_~c~0 9)} is VALID [2022-04-15 06:30:13,122 INFO L290 TraceCheckUtils]: 37: Hoare triple {42750#(<= main_~c~0 9)} #t~post5 := ~c~0;~c~0 := 1 + #t~post5;havoc #t~post5; {42751#(<= main_~c~0 10)} is VALID [2022-04-15 06:30:13,122 INFO L290 TraceCheckUtils]: 38: Hoare triple {42751#(<= main_~c~0 10)} assume !(~c~0 < 200000); {42737#false} is VALID [2022-04-15 06:30:13,122 INFO L290 TraceCheckUtils]: 39: Hoare triple {42737#false} assume 0 == ~st~0 && ~c~0 == 1 + ~last~0;~a~0 := 3 + ~a~0;~b~0 := 3 + ~b~0; {42737#false} is VALID [2022-04-15 06:30:13,122 INFO L290 TraceCheckUtils]: 40: Hoare triple {42737#false} assume !(~c~0 == ~last~0 && 0 == ~st~0); {42737#false} is VALID [2022-04-15 06:30:13,122 INFO L272 TraceCheckUtils]: 41: Hoare triple {42737#false} call __VERIFIER_assert((if ~a~0 == ~b~0 && 200000 == ~c~0 then 1 else 0)); {42737#false} is VALID [2022-04-15 06:30:13,122 INFO L290 TraceCheckUtils]: 42: Hoare triple {42737#false} ~cond := #in~cond; {42737#false} is VALID [2022-04-15 06:30:13,122 INFO L290 TraceCheckUtils]: 43: Hoare triple {42737#false} assume 0 == ~cond; {42737#false} is VALID [2022-04-15 06:30:13,122 INFO L290 TraceCheckUtils]: 44: Hoare triple {42737#false} assume !false; {42737#false} is VALID [2022-04-15 06:30:13,122 INFO L134 CoverageAnalysis]: Checked inductivity of 145 backedges. 0 proven. 145 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 06:30:13,123 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 06:30:13,123 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1503483051] [2022-04-15 06:30:13,123 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1503483051] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 06:30:13,123 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1651982207] [2022-04-15 06:30:13,123 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 06:30:13,123 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 06:30:13,123 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 06:30:13,124 INFO L229 MonitoredProcess]: Starting monitored process 32 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-15 06:30:13,125 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (32)] Waiting until timeout for monitored process [2022-04-15 06:30:13,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:30:13,158 INFO L263 TraceCheckSpWp]: Trace formula consists of 126 conjuncts, 12 conjunts are in the unsatisfiable core [2022-04-15 06:30:13,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:30:13,166 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 06:30:13,295 INFO L272 TraceCheckUtils]: 0: Hoare triple {42736#true} call ULTIMATE.init(); {42736#true} is VALID [2022-04-15 06:30:13,295 INFO L290 TraceCheckUtils]: 1: Hoare triple {42736#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(11, 2);call #Ultimate.allocInit(12, 3);~last~0 := 0; {42736#true} is VALID [2022-04-15 06:30:13,295 INFO L290 TraceCheckUtils]: 2: Hoare triple {42736#true} assume true; {42736#true} is VALID [2022-04-15 06:30:13,295 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {42736#true} {42736#true} #66#return; {42736#true} is VALID [2022-04-15 06:30:13,295 INFO L272 TraceCheckUtils]: 4: Hoare triple {42736#true} call #t~ret6 := main(); {42736#true} is VALID [2022-04-15 06:30:13,295 INFO L290 TraceCheckUtils]: 5: Hoare triple {42736#true} assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~last~0 := #t~nondet4;havoc #t~nondet4;~a~0 := 0;~b~0 := 0;~c~0 := 0;~st~0 := 0; {42736#true} is VALID [2022-04-15 06:30:13,295 INFO L290 TraceCheckUtils]: 6: Hoare triple {42736#true} [182] L30-->L23-3_primed: Formula: (let ((.cse0 (= v_main_~b~0_158 v_main_~b~0_157)) (.cse1 (= v_main_~a~0_161 v_main_~a~0_160)) (.cse2 (= |v_main_#t~post5_434| |v_main_#t~post5_424|)) (.cse3 (= v_main_~st~0_307 v_main_~st~0_305))) (or (and .cse0 (= v_main_~c~0_919 v_main_~c~0_908) .cse1 .cse2 .cse3) (and .cse0 .cse1 (= v_main_~c~0_908 v_main_~c~0_919) .cse2 .cse3))) InVars {main_~c~0=v_main_~c~0_919, main_#t~post5=|v_main_#t~post5_434|, main_~st~0=v_main_~st~0_307, main_~b~0=v_main_~b~0_158, main_~a~0=v_main_~a~0_161} OutVars{main_~c~0=v_main_~c~0_908, main_#t~post5=|v_main_#t~post5_424|, main_~st~0=v_main_~st~0_305, main_~b~0=v_main_~b~0_157, main_~a~0=v_main_~a~0_160} AuxVars[] AssignedVars[main_~c~0, main_#t~post5, main_~st~0, main_~b~0, main_~a~0] {42736#true} is VALID [2022-04-15 06:30:13,296 INFO L290 TraceCheckUtils]: 7: Hoare triple {42736#true} [181] L23-3_primed-->L23-3: Formula: (and (= v_main_~c~0_7 0) (= v_main_~st~0_6 1)) InVars {} OutVars{main_~c~0=v_main_~c~0_7, main_~st~0=v_main_~st~0_6} AuxVars[] AssignedVars[main_~c~0, main_~st~0] {42777#(<= main_~c~0 0)} is VALID [2022-04-15 06:30:13,296 INFO L290 TraceCheckUtils]: 8: Hoare triple {42777#(<= main_~c~0 0)} assume !!(~c~0 < 200000); {42777#(<= main_~c~0 0)} is VALID [2022-04-15 06:30:13,296 INFO L290 TraceCheckUtils]: 9: Hoare triple {42777#(<= main_~c~0 0)} assume ~c~0 == ~last~0;~st~0 := 0; {42777#(<= main_~c~0 0)} is VALID [2022-04-15 06:30:13,296 INFO L290 TraceCheckUtils]: 10: Hoare triple {42777#(<= main_~c~0 0)} #t~post5 := ~c~0;~c~0 := 1 + #t~post5;havoc #t~post5; {42742#(<= main_~c~0 1)} is VALID [2022-04-15 06:30:13,297 INFO L290 TraceCheckUtils]: 11: Hoare triple {42742#(<= main_~c~0 1)} assume !!(~c~0 < 200000); {42742#(<= main_~c~0 1)} is VALID [2022-04-15 06:30:13,297 INFO L290 TraceCheckUtils]: 12: Hoare triple {42742#(<= main_~c~0 1)} assume !(~c~0 == ~last~0); {42742#(<= main_~c~0 1)} is VALID [2022-04-15 06:30:13,297 INFO L290 TraceCheckUtils]: 13: Hoare triple {42742#(<= main_~c~0 1)} #t~post5 := ~c~0;~c~0 := 1 + #t~post5;havoc #t~post5; {42743#(<= main_~c~0 2)} is VALID [2022-04-15 06:30:13,297 INFO L290 TraceCheckUtils]: 14: Hoare triple {42743#(<= main_~c~0 2)} assume !!(~c~0 < 200000); {42743#(<= main_~c~0 2)} is VALID [2022-04-15 06:30:13,297 INFO L290 TraceCheckUtils]: 15: Hoare triple {42743#(<= main_~c~0 2)} assume !(~c~0 == ~last~0); {42743#(<= main_~c~0 2)} is VALID [2022-04-15 06:30:13,298 INFO L290 TraceCheckUtils]: 16: Hoare triple {42743#(<= main_~c~0 2)} #t~post5 := ~c~0;~c~0 := 1 + #t~post5;havoc #t~post5; {42744#(<= main_~c~0 3)} is VALID [2022-04-15 06:30:13,298 INFO L290 TraceCheckUtils]: 17: Hoare triple {42744#(<= main_~c~0 3)} assume !!(~c~0 < 200000); {42744#(<= main_~c~0 3)} is VALID [2022-04-15 06:30:13,298 INFO L290 TraceCheckUtils]: 18: Hoare triple {42744#(<= main_~c~0 3)} assume !(~c~0 == ~last~0); {42744#(<= main_~c~0 3)} is VALID [2022-04-15 06:30:13,298 INFO L290 TraceCheckUtils]: 19: Hoare triple {42744#(<= main_~c~0 3)} #t~post5 := ~c~0;~c~0 := 1 + #t~post5;havoc #t~post5; {42745#(<= main_~c~0 4)} is VALID [2022-04-15 06:30:13,299 INFO L290 TraceCheckUtils]: 20: Hoare triple {42745#(<= main_~c~0 4)} assume !!(~c~0 < 200000); {42745#(<= main_~c~0 4)} is VALID [2022-04-15 06:30:13,299 INFO L290 TraceCheckUtils]: 21: Hoare triple {42745#(<= main_~c~0 4)} assume !(~c~0 == ~last~0); {42745#(<= main_~c~0 4)} is VALID [2022-04-15 06:30:13,299 INFO L290 TraceCheckUtils]: 22: Hoare triple {42745#(<= main_~c~0 4)} #t~post5 := ~c~0;~c~0 := 1 + #t~post5;havoc #t~post5; {42746#(<= main_~c~0 5)} is VALID [2022-04-15 06:30:13,299 INFO L290 TraceCheckUtils]: 23: Hoare triple {42746#(<= main_~c~0 5)} assume !!(~c~0 < 200000); {42746#(<= main_~c~0 5)} is VALID [2022-04-15 06:30:13,299 INFO L290 TraceCheckUtils]: 24: Hoare triple {42746#(<= main_~c~0 5)} assume !(~c~0 == ~last~0); {42746#(<= main_~c~0 5)} is VALID [2022-04-15 06:30:13,300 INFO L290 TraceCheckUtils]: 25: Hoare triple {42746#(<= main_~c~0 5)} #t~post5 := ~c~0;~c~0 := 1 + #t~post5;havoc #t~post5; {42747#(<= main_~c~0 6)} is VALID [2022-04-15 06:30:13,300 INFO L290 TraceCheckUtils]: 26: Hoare triple {42747#(<= main_~c~0 6)} assume !!(~c~0 < 200000); {42747#(<= main_~c~0 6)} is VALID [2022-04-15 06:30:13,300 INFO L290 TraceCheckUtils]: 27: Hoare triple {42747#(<= main_~c~0 6)} assume !(~c~0 == ~last~0); {42747#(<= main_~c~0 6)} is VALID [2022-04-15 06:30:13,300 INFO L290 TraceCheckUtils]: 28: Hoare triple {42747#(<= main_~c~0 6)} #t~post5 := ~c~0;~c~0 := 1 + #t~post5;havoc #t~post5; {42748#(<= main_~c~0 7)} is VALID [2022-04-15 06:30:13,301 INFO L290 TraceCheckUtils]: 29: Hoare triple {42748#(<= main_~c~0 7)} assume !!(~c~0 < 200000); {42748#(<= main_~c~0 7)} is VALID [2022-04-15 06:30:13,301 INFO L290 TraceCheckUtils]: 30: Hoare triple {42748#(<= main_~c~0 7)} assume !(~c~0 == ~last~0); {42748#(<= main_~c~0 7)} is VALID [2022-04-15 06:30:13,301 INFO L290 TraceCheckUtils]: 31: Hoare triple {42748#(<= main_~c~0 7)} #t~post5 := ~c~0;~c~0 := 1 + #t~post5;havoc #t~post5; {42749#(<= main_~c~0 8)} is VALID [2022-04-15 06:30:13,301 INFO L290 TraceCheckUtils]: 32: Hoare triple {42749#(<= main_~c~0 8)} assume !!(~c~0 < 200000); {42749#(<= main_~c~0 8)} is VALID [2022-04-15 06:30:13,301 INFO L290 TraceCheckUtils]: 33: Hoare triple {42749#(<= main_~c~0 8)} assume !(~c~0 == ~last~0); {42749#(<= main_~c~0 8)} is VALID [2022-04-15 06:30:13,302 INFO L290 TraceCheckUtils]: 34: Hoare triple {42749#(<= main_~c~0 8)} #t~post5 := ~c~0;~c~0 := 1 + #t~post5;havoc #t~post5; {42750#(<= main_~c~0 9)} is VALID [2022-04-15 06:30:13,302 INFO L290 TraceCheckUtils]: 35: Hoare triple {42750#(<= main_~c~0 9)} assume !!(~c~0 < 200000); {42750#(<= main_~c~0 9)} is VALID [2022-04-15 06:30:13,302 INFO L290 TraceCheckUtils]: 36: Hoare triple {42750#(<= main_~c~0 9)} assume !(~c~0 == ~last~0); {42750#(<= main_~c~0 9)} is VALID [2022-04-15 06:30:13,302 INFO L290 TraceCheckUtils]: 37: Hoare triple {42750#(<= main_~c~0 9)} #t~post5 := ~c~0;~c~0 := 1 + #t~post5;havoc #t~post5; {42751#(<= main_~c~0 10)} is VALID [2022-04-15 06:30:13,303 INFO L290 TraceCheckUtils]: 38: Hoare triple {42751#(<= main_~c~0 10)} assume !(~c~0 < 200000); {42737#false} is VALID [2022-04-15 06:30:13,303 INFO L290 TraceCheckUtils]: 39: Hoare triple {42737#false} assume 0 == ~st~0 && ~c~0 == 1 + ~last~0;~a~0 := 3 + ~a~0;~b~0 := 3 + ~b~0; {42737#false} is VALID [2022-04-15 06:30:13,303 INFO L290 TraceCheckUtils]: 40: Hoare triple {42737#false} assume !(~c~0 == ~last~0 && 0 == ~st~0); {42737#false} is VALID [2022-04-15 06:30:13,303 INFO L272 TraceCheckUtils]: 41: Hoare triple {42737#false} call __VERIFIER_assert((if ~a~0 == ~b~0 && 200000 == ~c~0 then 1 else 0)); {42737#false} is VALID [2022-04-15 06:30:13,303 INFO L290 TraceCheckUtils]: 42: Hoare triple {42737#false} ~cond := #in~cond; {42737#false} is VALID [2022-04-15 06:30:13,303 INFO L290 TraceCheckUtils]: 43: Hoare triple {42737#false} assume 0 == ~cond; {42737#false} is VALID [2022-04-15 06:30:13,303 INFO L290 TraceCheckUtils]: 44: Hoare triple {42737#false} assume !false; {42737#false} is VALID [2022-04-15 06:30:13,303 INFO L134 CoverageAnalysis]: Checked inductivity of 145 backedges. 0 proven. 145 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 06:30:13,303 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 06:30:13,526 INFO L290 TraceCheckUtils]: 44: Hoare triple {42737#false} assume !false; {42737#false} is VALID [2022-04-15 06:30:13,527 INFO L290 TraceCheckUtils]: 43: Hoare triple {42737#false} assume 0 == ~cond; {42737#false} is VALID [2022-04-15 06:30:13,527 INFO L290 TraceCheckUtils]: 42: Hoare triple {42737#false} ~cond := #in~cond; {42737#false} is VALID [2022-04-15 06:30:13,527 INFO L272 TraceCheckUtils]: 41: Hoare triple {42737#false} call __VERIFIER_assert((if ~a~0 == ~b~0 && 200000 == ~c~0 then 1 else 0)); {42737#false} is VALID [2022-04-15 06:30:13,527 INFO L290 TraceCheckUtils]: 40: Hoare triple {42737#false} assume !(~c~0 == ~last~0 && 0 == ~st~0); {42737#false} is VALID [2022-04-15 06:30:13,527 INFO L290 TraceCheckUtils]: 39: Hoare triple {42737#false} assume 0 == ~st~0 && ~c~0 == 1 + ~last~0;~a~0 := 3 + ~a~0;~b~0 := 3 + ~b~0; {42737#false} is VALID [2022-04-15 06:30:13,527 INFO L290 TraceCheckUtils]: 38: Hoare triple {42907#(< main_~c~0 200000)} assume !(~c~0 < 200000); {42737#false} is VALID [2022-04-15 06:30:13,527 INFO L290 TraceCheckUtils]: 37: Hoare triple {42911#(< main_~c~0 199999)} #t~post5 := ~c~0;~c~0 := 1 + #t~post5;havoc #t~post5; {42907#(< main_~c~0 200000)} is VALID [2022-04-15 06:30:13,528 INFO L290 TraceCheckUtils]: 36: Hoare triple {42911#(< main_~c~0 199999)} assume !(~c~0 == ~last~0); {42911#(< main_~c~0 199999)} is VALID [2022-04-15 06:30:13,528 INFO L290 TraceCheckUtils]: 35: Hoare triple {42911#(< main_~c~0 199999)} assume !!(~c~0 < 200000); {42911#(< main_~c~0 199999)} is VALID [2022-04-15 06:30:13,528 INFO L290 TraceCheckUtils]: 34: Hoare triple {42921#(< main_~c~0 199998)} #t~post5 := ~c~0;~c~0 := 1 + #t~post5;havoc #t~post5; {42911#(< main_~c~0 199999)} is VALID [2022-04-15 06:30:13,528 INFO L290 TraceCheckUtils]: 33: Hoare triple {42921#(< main_~c~0 199998)} assume !(~c~0 == ~last~0); {42921#(< main_~c~0 199998)} is VALID [2022-04-15 06:30:13,528 INFO L290 TraceCheckUtils]: 32: Hoare triple {42921#(< main_~c~0 199998)} assume !!(~c~0 < 200000); {42921#(< main_~c~0 199998)} is VALID [2022-04-15 06:30:13,529 INFO L290 TraceCheckUtils]: 31: Hoare triple {42931#(< main_~c~0 199997)} #t~post5 := ~c~0;~c~0 := 1 + #t~post5;havoc #t~post5; {42921#(< main_~c~0 199998)} is VALID [2022-04-15 06:30:13,529 INFO L290 TraceCheckUtils]: 30: Hoare triple {42931#(< main_~c~0 199997)} assume !(~c~0 == ~last~0); {42931#(< main_~c~0 199997)} is VALID [2022-04-15 06:30:13,529 INFO L290 TraceCheckUtils]: 29: Hoare triple {42931#(< main_~c~0 199997)} assume !!(~c~0 < 200000); {42931#(< main_~c~0 199997)} is VALID [2022-04-15 06:30:13,529 INFO L290 TraceCheckUtils]: 28: Hoare triple {42941#(< main_~c~0 199996)} #t~post5 := ~c~0;~c~0 := 1 + #t~post5;havoc #t~post5; {42931#(< main_~c~0 199997)} is VALID [2022-04-15 06:30:13,530 INFO L290 TraceCheckUtils]: 27: Hoare triple {42941#(< main_~c~0 199996)} assume !(~c~0 == ~last~0); {42941#(< main_~c~0 199996)} is VALID [2022-04-15 06:30:13,530 INFO L290 TraceCheckUtils]: 26: Hoare triple {42941#(< main_~c~0 199996)} assume !!(~c~0 < 200000); {42941#(< main_~c~0 199996)} is VALID [2022-04-15 06:30:13,530 INFO L290 TraceCheckUtils]: 25: Hoare triple {42951#(< main_~c~0 199995)} #t~post5 := ~c~0;~c~0 := 1 + #t~post5;havoc #t~post5; {42941#(< main_~c~0 199996)} is VALID [2022-04-15 06:30:13,530 INFO L290 TraceCheckUtils]: 24: Hoare triple {42951#(< main_~c~0 199995)} assume !(~c~0 == ~last~0); {42951#(< main_~c~0 199995)} is VALID [2022-04-15 06:30:13,530 INFO L290 TraceCheckUtils]: 23: Hoare triple {42951#(< main_~c~0 199995)} assume !!(~c~0 < 200000); {42951#(< main_~c~0 199995)} is VALID [2022-04-15 06:30:13,531 INFO L290 TraceCheckUtils]: 22: Hoare triple {42961#(< main_~c~0 199994)} #t~post5 := ~c~0;~c~0 := 1 + #t~post5;havoc #t~post5; {42951#(< main_~c~0 199995)} is VALID [2022-04-15 06:30:13,531 INFO L290 TraceCheckUtils]: 21: Hoare triple {42961#(< main_~c~0 199994)} assume !(~c~0 == ~last~0); {42961#(< main_~c~0 199994)} is VALID [2022-04-15 06:30:13,531 INFO L290 TraceCheckUtils]: 20: Hoare triple {42961#(< main_~c~0 199994)} assume !!(~c~0 < 200000); {42961#(< main_~c~0 199994)} is VALID [2022-04-15 06:30:13,531 INFO L290 TraceCheckUtils]: 19: Hoare triple {42971#(< main_~c~0 199993)} #t~post5 := ~c~0;~c~0 := 1 + #t~post5;havoc #t~post5; {42961#(< main_~c~0 199994)} is VALID [2022-04-15 06:30:13,531 INFO L290 TraceCheckUtils]: 18: Hoare triple {42971#(< main_~c~0 199993)} assume !(~c~0 == ~last~0); {42971#(< main_~c~0 199993)} is VALID [2022-04-15 06:30:13,532 INFO L290 TraceCheckUtils]: 17: Hoare triple {42971#(< main_~c~0 199993)} assume !!(~c~0 < 200000); {42971#(< main_~c~0 199993)} is VALID [2022-04-15 06:30:13,532 INFO L290 TraceCheckUtils]: 16: Hoare triple {42981#(< main_~c~0 199992)} #t~post5 := ~c~0;~c~0 := 1 + #t~post5;havoc #t~post5; {42971#(< main_~c~0 199993)} is VALID [2022-04-15 06:30:13,532 INFO L290 TraceCheckUtils]: 15: Hoare triple {42981#(< main_~c~0 199992)} assume !(~c~0 == ~last~0); {42981#(< main_~c~0 199992)} is VALID [2022-04-15 06:30:13,532 INFO L290 TraceCheckUtils]: 14: Hoare triple {42981#(< main_~c~0 199992)} assume !!(~c~0 < 200000); {42981#(< main_~c~0 199992)} is VALID [2022-04-15 06:30:13,533 INFO L290 TraceCheckUtils]: 13: Hoare triple {42991#(< main_~c~0 199991)} #t~post5 := ~c~0;~c~0 := 1 + #t~post5;havoc #t~post5; {42981#(< main_~c~0 199992)} is VALID [2022-04-15 06:30:13,533 INFO L290 TraceCheckUtils]: 12: Hoare triple {42991#(< main_~c~0 199991)} assume !(~c~0 == ~last~0); {42991#(< main_~c~0 199991)} is VALID [2022-04-15 06:30:13,533 INFO L290 TraceCheckUtils]: 11: Hoare triple {42991#(< main_~c~0 199991)} assume !!(~c~0 < 200000); {42991#(< main_~c~0 199991)} is VALID [2022-04-15 06:30:13,533 INFO L290 TraceCheckUtils]: 10: Hoare triple {43001#(< main_~c~0 199990)} #t~post5 := ~c~0;~c~0 := 1 + #t~post5;havoc #t~post5; {42991#(< main_~c~0 199991)} is VALID [2022-04-15 06:30:13,533 INFO L290 TraceCheckUtils]: 9: Hoare triple {43001#(< main_~c~0 199990)} assume ~c~0 == ~last~0;~st~0 := 0; {43001#(< main_~c~0 199990)} is VALID [2022-04-15 06:30:13,534 INFO L290 TraceCheckUtils]: 8: Hoare triple {43001#(< main_~c~0 199990)} assume !!(~c~0 < 200000); {43001#(< main_~c~0 199990)} is VALID [2022-04-15 06:30:13,534 INFO L290 TraceCheckUtils]: 7: Hoare triple {42736#true} [181] L23-3_primed-->L23-3: Formula: (and (= v_main_~c~0_7 0) (= v_main_~st~0_6 1)) InVars {} OutVars{main_~c~0=v_main_~c~0_7, main_~st~0=v_main_~st~0_6} AuxVars[] AssignedVars[main_~c~0, main_~st~0] {43001#(< main_~c~0 199990)} is VALID [2022-04-15 06:30:13,534 INFO L290 TraceCheckUtils]: 6: Hoare triple {42736#true} [182] L30-->L23-3_primed: Formula: (let ((.cse0 (= v_main_~b~0_158 v_main_~b~0_157)) (.cse1 (= v_main_~a~0_161 v_main_~a~0_160)) (.cse2 (= |v_main_#t~post5_434| |v_main_#t~post5_424|)) (.cse3 (= v_main_~st~0_307 v_main_~st~0_305))) (or (and .cse0 (= v_main_~c~0_919 v_main_~c~0_908) .cse1 .cse2 .cse3) (and .cse0 .cse1 (= v_main_~c~0_908 v_main_~c~0_919) .cse2 .cse3))) InVars {main_~c~0=v_main_~c~0_919, main_#t~post5=|v_main_#t~post5_434|, main_~st~0=v_main_~st~0_307, main_~b~0=v_main_~b~0_158, main_~a~0=v_main_~a~0_161} OutVars{main_~c~0=v_main_~c~0_908, main_#t~post5=|v_main_#t~post5_424|, main_~st~0=v_main_~st~0_305, main_~b~0=v_main_~b~0_157, main_~a~0=v_main_~a~0_160} AuxVars[] AssignedVars[main_~c~0, main_#t~post5, main_~st~0, main_~b~0, main_~a~0] {42736#true} is VALID [2022-04-15 06:30:13,534 INFO L290 TraceCheckUtils]: 5: Hoare triple {42736#true} assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~last~0 := #t~nondet4;havoc #t~nondet4;~a~0 := 0;~b~0 := 0;~c~0 := 0;~st~0 := 0; {42736#true} is VALID [2022-04-15 06:30:13,534 INFO L272 TraceCheckUtils]: 4: Hoare triple {42736#true} call #t~ret6 := main(); {42736#true} is VALID [2022-04-15 06:30:13,534 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {42736#true} {42736#true} #66#return; {42736#true} is VALID [2022-04-15 06:30:13,534 INFO L290 TraceCheckUtils]: 2: Hoare triple {42736#true} assume true; {42736#true} is VALID [2022-04-15 06:30:13,534 INFO L290 TraceCheckUtils]: 1: Hoare triple {42736#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(11, 2);call #Ultimate.allocInit(12, 3);~last~0 := 0; {42736#true} is VALID [2022-04-15 06:30:13,534 INFO L272 TraceCheckUtils]: 0: Hoare triple {42736#true} call ULTIMATE.init(); {42736#true} is VALID [2022-04-15 06:30:13,536 INFO L134 CoverageAnalysis]: Checked inductivity of 145 backedges. 0 proven. 145 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 06:30:13,536 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1651982207] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 06:30:13,536 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 06:30:13,536 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 13, 13] total 26 [2022-04-15 06:30:13,741 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 06:30:13,741 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1040245440] [2022-04-15 06:30:13,741 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1040245440] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 06:30:13,741 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 06:30:13,741 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [26] imperfect sequences [] total 26 [2022-04-15 06:30:13,741 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [51041603] [2022-04-15 06:30:13,741 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 06:30:13,742 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 26 states have (on average 2.8846153846153846) internal successors, (75), 25 states have internal predecessors, (75), 2 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 83 [2022-04-15 06:30:13,742 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 06:30:13,742 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 26 states, 26 states have (on average 2.8846153846153846) internal successors, (75), 25 states have internal predecessors, (75), 2 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-15 06:30:13,775 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 80 edges. 80 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 06:30:13,775 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2022-04-15 06:30:13,775 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 06:30:13,776 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2022-04-15 06:30:13,776 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=537, Invalid=869, Unknown=0, NotChecked=0, Total=1406 [2022-04-15 06:30:13,776 INFO L87 Difference]: Start difference. First operand 311 states and 358 transitions. Second operand has 26 states, 26 states have (on average 2.8846153846153846) internal successors, (75), 25 states have internal predecessors, (75), 2 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-15 06:30:15,405 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:30:15,405 INFO L93 Difference]: Finished difference Result 489 states and 569 transitions. [2022-04-15 06:30:15,405 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2022-04-15 06:30:15,405 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 26 states have (on average 2.8846153846153846) internal successors, (75), 25 states have internal predecessors, (75), 2 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 83 [2022-04-15 06:30:15,405 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 06:30:15,405 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26 states, 26 states have (on average 2.8846153846153846) internal successors, (75), 25 states have internal predecessors, (75), 2 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-15 06:30:15,406 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 116 transitions. [2022-04-15 06:30:15,406 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26 states, 26 states have (on average 2.8846153846153846) internal successors, (75), 25 states have internal predecessors, (75), 2 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-15 06:30:15,407 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 116 transitions. [2022-04-15 06:30:15,407 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 26 states and 116 transitions. [2022-04-15 06:30:15,451 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 116 edges. 116 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 06:30:15,458 INFO L225 Difference]: With dead ends: 489 [2022-04-15 06:30:15,458 INFO L226 Difference]: Without dead ends: 407 [2022-04-15 06:30:15,459 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 151 GetRequests, 100 SyntacticMatches, 15 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1215 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=537, Invalid=869, Unknown=0, NotChecked=0, Total=1406 [2022-04-15 06:30:15,459 INFO L913 BasicCegarLoop]: 18 mSDtfsCounter, 74 mSDsluCounter, 30 mSDsCounter, 0 mSdLazyCounter, 479 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 74 SdHoareTripleChecker+Valid, 48 SdHoareTripleChecker+Invalid, 500 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 479 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-04-15 06:30:15,459 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [74 Valid, 48 Invalid, 500 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 479 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-04-15 06:30:15,459 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 407 states. [2022-04-15 06:30:16,472 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 407 to 349. [2022-04-15 06:30:16,472 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 06:30:16,473 INFO L82 GeneralOperation]: Start isEquivalent. First operand 407 states. Second operand has 349 states, 341 states have (on average 1.1466275659824048) internal successors, (391), 342 states have internal predecessors, (391), 4 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-15 06:30:16,473 INFO L74 IsIncluded]: Start isIncluded. First operand 407 states. Second operand has 349 states, 341 states have (on average 1.1466275659824048) internal successors, (391), 342 states have internal predecessors, (391), 4 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-15 06:30:16,473 INFO L87 Difference]: Start difference. First operand 407 states. Second operand has 349 states, 341 states have (on average 1.1466275659824048) internal successors, (391), 342 states have internal predecessors, (391), 4 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-15 06:30:16,482 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:30:16,482 INFO L93 Difference]: Finished difference Result 407 states and 458 transitions. [2022-04-15 06:30:16,482 INFO L276 IsEmpty]: Start isEmpty. Operand 407 states and 458 transitions. [2022-04-15 06:30:16,482 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 06:30:16,482 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 06:30:16,483 INFO L74 IsIncluded]: Start isIncluded. First operand has 349 states, 341 states have (on average 1.1466275659824048) internal successors, (391), 342 states have internal predecessors, (391), 4 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) Second operand 407 states. [2022-04-15 06:30:16,483 INFO L87 Difference]: Start difference. First operand has 349 states, 341 states have (on average 1.1466275659824048) internal successors, (391), 342 states have internal predecessors, (391), 4 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) Second operand 407 states. [2022-04-15 06:30:16,489 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:30:16,489 INFO L93 Difference]: Finished difference Result 407 states and 458 transitions. [2022-04-15 06:30:16,489 INFO L276 IsEmpty]: Start isEmpty. Operand 407 states and 458 transitions. [2022-04-15 06:30:16,489 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 06:30:16,489 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 06:30:16,489 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 06:30:16,489 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 06:30:16,489 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 349 states, 341 states have (on average 1.1466275659824048) internal successors, (391), 342 states have internal predecessors, (391), 4 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-15 06:30:16,495 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 349 states to 349 states and 398 transitions. [2022-04-15 06:30:16,495 INFO L78 Accepts]: Start accepts. Automaton has 349 states and 398 transitions. Word has length 83 [2022-04-15 06:30:16,495 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 06:30:16,496 INFO L478 AbstractCegarLoop]: Abstraction has 349 states and 398 transitions. [2022-04-15 06:30:16,496 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 26 states have (on average 2.8846153846153846) internal successors, (75), 25 states have internal predecessors, (75), 2 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-15 06:30:16,496 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 349 states and 398 transitions. [2022-04-15 06:30:17,390 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 398 edges. 398 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 06:30:17,390 INFO L276 IsEmpty]: Start isEmpty. Operand 349 states and 398 transitions. [2022-04-15 06:30:17,390 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2022-04-15 06:30:17,390 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 06:30:17,390 INFO L499 BasicCegarLoop]: trace histogram [23, 23, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 06:30:17,408 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (32)] Forceful destruction successful, exit code 0 [2022-04-15 06:30:17,606 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 32 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable35 [2022-04-15 06:30:17,606 INFO L403 AbstractCegarLoop]: === Iteration 37 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 06:30:17,606 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 06:30:17,606 INFO L85 PathProgramCache]: Analyzing trace with hash -1391648892, now seen corresponding path program 22 times [2022-04-15 06:30:17,606 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 06:30:17,607 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1664437374] [2022-04-15 06:30:17,754 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 1 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-15 06:30:17,903 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {0={1=1}, 1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-15 06:30:17,903 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-15 06:30:17,905 INFO L85 PathProgramCache]: Analyzing trace with hash -593020600, now seen corresponding path program 1 times [2022-04-15 06:30:17,905 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 06:30:17,905 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [486165906] [2022-04-15 06:30:17,905 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 06:30:17,905 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 06:30:17,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:30:18,008 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 06:30:18,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:30:18,014 INFO L290 TraceCheckUtils]: 0: Hoare triple {45548#(and (= ~last~0 |old(~last~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(11, 2);call #Ultimate.allocInit(12, 3);~last~0 := 0; {45536#true} is VALID [2022-04-15 06:30:18,014 INFO L290 TraceCheckUtils]: 1: Hoare triple {45536#true} assume true; {45536#true} is VALID [2022-04-15 06:30:18,014 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {45536#true} {45536#true} #66#return; {45536#true} is VALID [2022-04-15 06:30:18,014 INFO L272 TraceCheckUtils]: 0: Hoare triple {45536#true} call ULTIMATE.init(); {45548#(and (= ~last~0 |old(~last~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 06:30:18,014 INFO L290 TraceCheckUtils]: 1: Hoare triple {45548#(and (= ~last~0 |old(~last~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(11, 2);call #Ultimate.allocInit(12, 3);~last~0 := 0; {45536#true} is VALID [2022-04-15 06:30:18,014 INFO L290 TraceCheckUtils]: 2: Hoare triple {45536#true} assume true; {45536#true} is VALID [2022-04-15 06:30:18,014 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {45536#true} {45536#true} #66#return; {45536#true} is VALID [2022-04-15 06:30:18,014 INFO L272 TraceCheckUtils]: 4: Hoare triple {45536#true} call #t~ret6 := main(); {45536#true} is VALID [2022-04-15 06:30:18,015 INFO L290 TraceCheckUtils]: 5: Hoare triple {45536#true} assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~last~0 := #t~nondet4;havoc #t~nondet4;~a~0 := 0;~b~0 := 0;~c~0 := 0;~st~0 := 0; {45541#(and (= main_~a~0 0) (= main_~b~0 0))} is VALID [2022-04-15 06:30:18,015 INFO L290 TraceCheckUtils]: 6: Hoare triple {45541#(and (= main_~a~0 0) (= main_~b~0 0))} assume !false;~st~0 := 1;~c~0 := 0; {45542#(and (= main_~a~0 0) (= main_~st~0 1) (= main_~b~0 0))} is VALID [2022-04-15 06:30:18,015 INFO L290 TraceCheckUtils]: 7: Hoare triple {45542#(and (= main_~a~0 0) (= main_~st~0 1) (= main_~b~0 0))} [184] L23-3-->L23-4_primed: Formula: (let ((.cse0 (= v_main_~c~0_955 v_main_~c~0_954)) (.cse2 (= v_~last~0_239 v_main_~c~0_955)) (.cse1 (= |v_main_#t~post5_450| |v_main_#t~post5_448|))) (or (and .cse0 .cse1 (= v_~last~0_239 v_~last~0_239)) (and (< v_main_~c~0_954 200001) (or (not (<= (+ v_main_~c~0_955 1) v_~last~0_239)) (not (<= (+ v_~last~0_239 1) v_main_~c~0_954))) (not .cse2) (< v_main_~c~0_955 v_main_~c~0_954)) (and .cse0 (or (not (< v_main_~c~0_955 200000)) .cse2) .cse1))) InVars {main_~c~0=v_main_~c~0_955, main_#t~post5=|v_main_#t~post5_450|, ~last~0=v_~last~0_239} OutVars{main_#t~post5=|v_main_#t~post5_448|, main_~c~0=v_main_~c~0_954, ~last~0=v_~last~0_239} AuxVars[] AssignedVars[main_#t~post5, main_~c~0] {45542#(and (= main_~a~0 0) (= main_~st~0 1) (= main_~b~0 0))} is VALID [2022-04-15 06:30:18,015 INFO L290 TraceCheckUtils]: 8: Hoare triple {45542#(and (= main_~a~0 0) (= main_~st~0 1) (= main_~b~0 0))} [185] L23-4_primed-->L23-3: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {45542#(and (= main_~a~0 0) (= main_~st~0 1) (= main_~b~0 0))} is VALID [2022-04-15 06:30:18,016 INFO L290 TraceCheckUtils]: 9: Hoare triple {45542#(and (= main_~a~0 0) (= main_~st~0 1) (= main_~b~0 0))} [186] L23-3-->L23-4_primed: Formula: (let ((.cse0 (= v_~last~0_240 v_main_~c~0_957)) (.cse1 (< v_main_~c~0_957 200000)) (.cse2 (= v_main_~st~0_315 v_main_~st~0_314)) (.cse3 (= |v_main_#t~post5_453| |v_main_#t~post5_449|))) (or (and (= v_main_~st~0_314 0) .cse0 (< v_main_~c~0_957 v_main_~c~0_956) .cse1 (<= v_main_~c~0_956 (+ v_~last~0_240 1))) (and (= v_main_~c~0_956 v_main_~c~0_957) .cse2 (or (not .cse0) (not .cse1)) .cse3) (and .cse2 .cse3 (= v_main_~c~0_957 v_main_~c~0_956) (= v_~last~0_240 v_~last~0_240)))) InVars {main_~c~0=v_main_~c~0_957, main_#t~post5=|v_main_#t~post5_453|, main_~st~0=v_main_~st~0_315, ~last~0=v_~last~0_240} OutVars{main_#t~post5=|v_main_#t~post5_449|, main_~c~0=v_main_~c~0_956, main_~st~0=v_main_~st~0_314, ~last~0=v_~last~0_240} AuxVars[] AssignedVars[main_#t~post5, main_~c~0, main_~st~0] {45543#(or (= main_~st~0 1) (and (= main_~a~0 0) (or (<= ~last~0 199999) (<= main_~c~0 200000)) (= main_~b~0 0)))} is VALID [2022-04-15 06:30:18,016 INFO L290 TraceCheckUtils]: 10: Hoare triple {45543#(or (= main_~st~0 1) (and (= main_~a~0 0) (or (<= ~last~0 199999) (<= main_~c~0 200000)) (= main_~b~0 0)))} [183] L23-4_primed-->L23-4: Formula: (not (< v_main_~c~0_8 200000)) InVars {main_~c~0=v_main_~c~0_8} OutVars{main_~c~0=v_main_~c~0_8} AuxVars[] AssignedVars[] {45544#(or (= main_~st~0 1) (and (= main_~a~0 0) (or (<= ~last~0 199999) (<= main_~c~0 200000)) (= main_~b~0 0) (< 199999 main_~c~0)))} is VALID [2022-04-15 06:30:18,017 INFO L290 TraceCheckUtils]: 11: Hoare triple {45544#(or (= main_~st~0 1) (and (= main_~a~0 0) (or (<= ~last~0 199999) (<= main_~c~0 200000)) (= main_~b~0 0) (< 199999 main_~c~0)))} assume 0 == ~st~0 && ~c~0 == 1 + ~last~0;~a~0 := 3 + ~a~0;~b~0 := 3 + ~b~0; {45545#(and (<= main_~b~0 main_~a~0) (< main_~a~0 (+ main_~b~0 1)) (< 199999 main_~c~0) (<= main_~c~0 200000))} is VALID [2022-04-15 06:30:18,017 INFO L290 TraceCheckUtils]: 12: Hoare triple {45545#(and (<= main_~b~0 main_~a~0) (< main_~a~0 (+ main_~b~0 1)) (< 199999 main_~c~0) (<= main_~c~0 200000))} assume !(~c~0 == ~last~0 && 0 == ~st~0); {45545#(and (<= main_~b~0 main_~a~0) (< main_~a~0 (+ main_~b~0 1)) (< 199999 main_~c~0) (<= main_~c~0 200000))} is VALID [2022-04-15 06:30:18,018 INFO L272 TraceCheckUtils]: 13: Hoare triple {45545#(and (<= main_~b~0 main_~a~0) (< main_~a~0 (+ main_~b~0 1)) (< 199999 main_~c~0) (<= main_~c~0 200000))} call __VERIFIER_assert((if ~a~0 == ~b~0 && 200000 == ~c~0 then 1 else 0)); {45546#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-15 06:30:18,018 INFO L290 TraceCheckUtils]: 14: Hoare triple {45546#(not (= |__VERIFIER_assert_#in~cond| 0))} ~cond := #in~cond; {45547#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-15 06:30:18,018 INFO L290 TraceCheckUtils]: 15: Hoare triple {45547#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {45537#false} is VALID [2022-04-15 06:30:18,018 INFO L290 TraceCheckUtils]: 16: Hoare triple {45537#false} assume !false; {45537#false} is VALID [2022-04-15 06:30:18,018 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-04-15 06:30:18,018 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 06:30:18,019 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [486165906] [2022-04-15 06:30:18,019 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [486165906] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 06:30:18,019 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2059703633] [2022-04-15 06:30:18,019 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 06:30:18,019 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 06:30:18,019 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 06:30:18,020 INFO L229 MonitoredProcess]: Starting monitored process 33 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-15 06:30:18,021 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (33)] Waiting until timeout for monitored process [2022-04-15 06:30:18,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:30:18,050 INFO L263 TraceCheckSpWp]: Trace formula consists of 85 conjuncts, 18 conjunts are in the unsatisfiable core [2022-04-15 06:30:18,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:30:18,054 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 06:30:18,222 INFO L272 TraceCheckUtils]: 0: Hoare triple {45536#true} call ULTIMATE.init(); {45536#true} is VALID [2022-04-15 06:30:18,222 INFO L290 TraceCheckUtils]: 1: Hoare triple {45536#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(11, 2);call #Ultimate.allocInit(12, 3);~last~0 := 0; {45536#true} is VALID [2022-04-15 06:30:18,222 INFO L290 TraceCheckUtils]: 2: Hoare triple {45536#true} assume true; {45536#true} is VALID [2022-04-15 06:30:18,222 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {45536#true} {45536#true} #66#return; {45536#true} is VALID [2022-04-15 06:30:18,222 INFO L272 TraceCheckUtils]: 4: Hoare triple {45536#true} call #t~ret6 := main(); {45536#true} is VALID [2022-04-15 06:30:18,223 INFO L290 TraceCheckUtils]: 5: Hoare triple {45536#true} assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~last~0 := #t~nondet4;havoc #t~nondet4;~a~0 := 0;~b~0 := 0;~c~0 := 0;~st~0 := 0; {45541#(and (= main_~a~0 0) (= main_~b~0 0))} is VALID [2022-04-15 06:30:18,223 INFO L290 TraceCheckUtils]: 6: Hoare triple {45541#(and (= main_~a~0 0) (= main_~b~0 0))} assume !false;~st~0 := 1;~c~0 := 0; {45542#(and (= main_~a~0 0) (= main_~st~0 1) (= main_~b~0 0))} is VALID [2022-04-15 06:30:18,223 INFO L290 TraceCheckUtils]: 7: Hoare triple {45542#(and (= main_~a~0 0) (= main_~st~0 1) (= main_~b~0 0))} [184] L23-3-->L23-4_primed: Formula: (let ((.cse0 (= v_main_~c~0_955 v_main_~c~0_954)) (.cse2 (= v_~last~0_239 v_main_~c~0_955)) (.cse1 (= |v_main_#t~post5_450| |v_main_#t~post5_448|))) (or (and .cse0 .cse1 (= v_~last~0_239 v_~last~0_239)) (and (< v_main_~c~0_954 200001) (or (not (<= (+ v_main_~c~0_955 1) v_~last~0_239)) (not (<= (+ v_~last~0_239 1) v_main_~c~0_954))) (not .cse2) (< v_main_~c~0_955 v_main_~c~0_954)) (and .cse0 (or (not (< v_main_~c~0_955 200000)) .cse2) .cse1))) InVars {main_~c~0=v_main_~c~0_955, main_#t~post5=|v_main_#t~post5_450|, ~last~0=v_~last~0_239} OutVars{main_#t~post5=|v_main_#t~post5_448|, main_~c~0=v_main_~c~0_954, ~last~0=v_~last~0_239} AuxVars[] AssignedVars[main_#t~post5, main_~c~0] {45542#(and (= main_~a~0 0) (= main_~st~0 1) (= main_~b~0 0))} is VALID [2022-04-15 06:30:18,224 INFO L290 TraceCheckUtils]: 8: Hoare triple {45542#(and (= main_~a~0 0) (= main_~st~0 1) (= main_~b~0 0))} [185] L23-4_primed-->L23-3: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {45542#(and (= main_~a~0 0) (= main_~st~0 1) (= main_~b~0 0))} is VALID [2022-04-15 06:30:18,224 INFO L290 TraceCheckUtils]: 9: Hoare triple {45542#(and (= main_~a~0 0) (= main_~st~0 1) (= main_~b~0 0))} [186] L23-3-->L23-4_primed: Formula: (let ((.cse0 (= v_~last~0_240 v_main_~c~0_957)) (.cse1 (< v_main_~c~0_957 200000)) (.cse2 (= v_main_~st~0_315 v_main_~st~0_314)) (.cse3 (= |v_main_#t~post5_453| |v_main_#t~post5_449|))) (or (and (= v_main_~st~0_314 0) .cse0 (< v_main_~c~0_957 v_main_~c~0_956) .cse1 (<= v_main_~c~0_956 (+ v_~last~0_240 1))) (and (= v_main_~c~0_956 v_main_~c~0_957) .cse2 (or (not .cse0) (not .cse1)) .cse3) (and .cse2 .cse3 (= v_main_~c~0_957 v_main_~c~0_956) (= v_~last~0_240 v_~last~0_240)))) InVars {main_~c~0=v_main_~c~0_957, main_#t~post5=|v_main_#t~post5_453|, main_~st~0=v_main_~st~0_315, ~last~0=v_~last~0_240} OutVars{main_#t~post5=|v_main_#t~post5_449|, main_~c~0=v_main_~c~0_956, main_~st~0=v_main_~st~0_314, ~last~0=v_~last~0_240} AuxVars[] AssignedVars[main_#t~post5, main_~c~0, main_~st~0] {45579#(and (= main_~a~0 0) (= main_~b~0 0) (or (and (< ~last~0 200000) (< ~last~0 main_~c~0) (<= main_~c~0 (+ ~last~0 1)) (= main_~st~0 0)) (= main_~st~0 1)))} is VALID [2022-04-15 06:30:18,225 INFO L290 TraceCheckUtils]: 10: Hoare triple {45579#(and (= main_~a~0 0) (= main_~b~0 0) (or (and (< ~last~0 200000) (< ~last~0 main_~c~0) (<= main_~c~0 (+ ~last~0 1)) (= main_~st~0 0)) (= main_~st~0 1)))} [183] L23-4_primed-->L23-4: Formula: (not (< v_main_~c~0_8 200000)) InVars {main_~c~0=v_main_~c~0_8} OutVars{main_~c~0=v_main_~c~0_8} AuxVars[] AssignedVars[] {45583#(and (= main_~a~0 0) (or (= main_~st~0 1) (and (< ~last~0 200000) (<= main_~c~0 (+ ~last~0 1)) (= main_~st~0 0))) (= main_~b~0 0) (not (< main_~c~0 200000)))} is VALID [2022-04-15 06:30:18,225 INFO L290 TraceCheckUtils]: 11: Hoare triple {45583#(and (= main_~a~0 0) (or (= main_~st~0 1) (and (< ~last~0 200000) (<= main_~c~0 (+ ~last~0 1)) (= main_~st~0 0))) (= main_~b~0 0) (not (< main_~c~0 200000)))} assume 0 == ~st~0 && ~c~0 == 1 + ~last~0;~a~0 := 3 + ~a~0;~b~0 := 3 + ~b~0; {45587#(and (= main_~b~0 3) (<= 200000 main_~c~0) (< main_~c~0 200001) (= main_~a~0 3))} is VALID [2022-04-15 06:30:18,225 INFO L290 TraceCheckUtils]: 12: Hoare triple {45587#(and (= main_~b~0 3) (<= 200000 main_~c~0) (< main_~c~0 200001) (= main_~a~0 3))} assume !(~c~0 == ~last~0 && 0 == ~st~0); {45587#(and (= main_~b~0 3) (<= 200000 main_~c~0) (< main_~c~0 200001) (= main_~a~0 3))} is VALID [2022-04-15 06:30:18,226 INFO L272 TraceCheckUtils]: 13: Hoare triple {45587#(and (= main_~b~0 3) (<= 200000 main_~c~0) (< main_~c~0 200001) (= main_~a~0 3))} call __VERIFIER_assert((if ~a~0 == ~b~0 && 200000 == ~c~0 then 1 else 0)); {45594#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-15 06:30:18,226 INFO L290 TraceCheckUtils]: 14: Hoare triple {45594#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {45598#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-15 06:30:18,226 INFO L290 TraceCheckUtils]: 15: Hoare triple {45598#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {45537#false} is VALID [2022-04-15 06:30:18,226 INFO L290 TraceCheckUtils]: 16: Hoare triple {45537#false} assume !false; {45537#false} is VALID [2022-04-15 06:30:18,226 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-04-15 06:30:18,227 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 06:30:18,476 INFO L290 TraceCheckUtils]: 16: Hoare triple {45537#false} assume !false; {45537#false} is VALID [2022-04-15 06:30:18,476 INFO L290 TraceCheckUtils]: 15: Hoare triple {45598#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {45537#false} is VALID [2022-04-15 06:30:18,476 INFO L290 TraceCheckUtils]: 14: Hoare triple {45594#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {45598#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-15 06:30:18,477 INFO L272 TraceCheckUtils]: 13: Hoare triple {45545#(and (<= main_~b~0 main_~a~0) (< main_~a~0 (+ main_~b~0 1)) (< 199999 main_~c~0) (<= main_~c~0 200000))} call __VERIFIER_assert((if ~a~0 == ~b~0 && 200000 == ~c~0 then 1 else 0)); {45594#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-15 06:30:18,477 INFO L290 TraceCheckUtils]: 12: Hoare triple {45545#(and (<= main_~b~0 main_~a~0) (< main_~a~0 (+ main_~b~0 1)) (< 199999 main_~c~0) (<= main_~c~0 200000))} assume !(~c~0 == ~last~0 && 0 == ~st~0); {45545#(and (<= main_~b~0 main_~a~0) (< main_~a~0 (+ main_~b~0 1)) (< 199999 main_~c~0) (<= main_~c~0 200000))} is VALID [2022-04-15 06:30:18,478 INFO L290 TraceCheckUtils]: 11: Hoare triple {45620#(or (not (<= main_~c~0 (+ ~last~0 1))) (and (<= main_~b~0 main_~a~0) (< main_~a~0 (+ main_~b~0 1)) (< 199999 main_~c~0) (<= main_~c~0 200000)) (not (= main_~st~0 0)))} assume 0 == ~st~0 && ~c~0 == 1 + ~last~0;~a~0 := 3 + ~a~0;~b~0 := 3 + ~b~0; {45545#(and (<= main_~b~0 main_~a~0) (< main_~a~0 (+ main_~b~0 1)) (< 199999 main_~c~0) (<= main_~c~0 200000))} is VALID [2022-04-15 06:30:18,478 INFO L290 TraceCheckUtils]: 10: Hoare triple {45624#(or (not (<= main_~c~0 (+ ~last~0 1))) (and (<= main_~b~0 main_~a~0) (< main_~a~0 (+ main_~b~0 1)) (<= main_~c~0 200000)) (not (= main_~st~0 0)) (< main_~c~0 200000))} [183] L23-4_primed-->L23-4: Formula: (not (< v_main_~c~0_8 200000)) InVars {main_~c~0=v_main_~c~0_8} OutVars{main_~c~0=v_main_~c~0_8} AuxVars[] AssignedVars[] {45620#(or (not (<= main_~c~0 (+ ~last~0 1))) (and (<= main_~b~0 main_~a~0) (< main_~a~0 (+ main_~b~0 1)) (< 199999 main_~c~0) (<= main_~c~0 200000)) (not (= main_~st~0 0)))} is VALID [2022-04-15 06:30:18,479 INFO L290 TraceCheckUtils]: 9: Hoare triple {45628#(and (<= main_~b~0 main_~a~0) (< main_~a~0 (+ main_~b~0 1)) (not (= main_~st~0 0)))} [186] L23-3-->L23-4_primed: Formula: (let ((.cse0 (= v_~last~0_240 v_main_~c~0_957)) (.cse1 (< v_main_~c~0_957 200000)) (.cse2 (= v_main_~st~0_315 v_main_~st~0_314)) (.cse3 (= |v_main_#t~post5_453| |v_main_#t~post5_449|))) (or (and (= v_main_~st~0_314 0) .cse0 (< v_main_~c~0_957 v_main_~c~0_956) .cse1 (<= v_main_~c~0_956 (+ v_~last~0_240 1))) (and (= v_main_~c~0_956 v_main_~c~0_957) .cse2 (or (not .cse0) (not .cse1)) .cse3) (and .cse2 .cse3 (= v_main_~c~0_957 v_main_~c~0_956) (= v_~last~0_240 v_~last~0_240)))) InVars {main_~c~0=v_main_~c~0_957, main_#t~post5=|v_main_#t~post5_453|, main_~st~0=v_main_~st~0_315, ~last~0=v_~last~0_240} OutVars{main_#t~post5=|v_main_#t~post5_449|, main_~c~0=v_main_~c~0_956, main_~st~0=v_main_~st~0_314, ~last~0=v_~last~0_240} AuxVars[] AssignedVars[main_#t~post5, main_~c~0, main_~st~0] {45624#(or (not (<= main_~c~0 (+ ~last~0 1))) (and (<= main_~b~0 main_~a~0) (< main_~a~0 (+ main_~b~0 1)) (<= main_~c~0 200000)) (not (= main_~st~0 0)) (< main_~c~0 200000))} is VALID [2022-04-15 06:30:18,479 INFO L290 TraceCheckUtils]: 8: Hoare triple {45628#(and (<= main_~b~0 main_~a~0) (< main_~a~0 (+ main_~b~0 1)) (not (= main_~st~0 0)))} [185] L23-4_primed-->L23-3: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {45628#(and (<= main_~b~0 main_~a~0) (< main_~a~0 (+ main_~b~0 1)) (not (= main_~st~0 0)))} is VALID [2022-04-15 06:30:18,479 INFO L290 TraceCheckUtils]: 7: Hoare triple {45628#(and (<= main_~b~0 main_~a~0) (< main_~a~0 (+ main_~b~0 1)) (not (= main_~st~0 0)))} [184] L23-3-->L23-4_primed: Formula: (let ((.cse0 (= v_main_~c~0_955 v_main_~c~0_954)) (.cse2 (= v_~last~0_239 v_main_~c~0_955)) (.cse1 (= |v_main_#t~post5_450| |v_main_#t~post5_448|))) (or (and .cse0 .cse1 (= v_~last~0_239 v_~last~0_239)) (and (< v_main_~c~0_954 200001) (or (not (<= (+ v_main_~c~0_955 1) v_~last~0_239)) (not (<= (+ v_~last~0_239 1) v_main_~c~0_954))) (not .cse2) (< v_main_~c~0_955 v_main_~c~0_954)) (and .cse0 (or (not (< v_main_~c~0_955 200000)) .cse2) .cse1))) InVars {main_~c~0=v_main_~c~0_955, main_#t~post5=|v_main_#t~post5_450|, ~last~0=v_~last~0_239} OutVars{main_#t~post5=|v_main_#t~post5_448|, main_~c~0=v_main_~c~0_954, ~last~0=v_~last~0_239} AuxVars[] AssignedVars[main_#t~post5, main_~c~0] {45628#(and (<= main_~b~0 main_~a~0) (< main_~a~0 (+ main_~b~0 1)) (not (= main_~st~0 0)))} is VALID [2022-04-15 06:30:18,480 INFO L290 TraceCheckUtils]: 6: Hoare triple {45638#(and (<= main_~b~0 main_~a~0) (< main_~a~0 (+ main_~b~0 1)))} assume !false;~st~0 := 1;~c~0 := 0; {45628#(and (<= main_~b~0 main_~a~0) (< main_~a~0 (+ main_~b~0 1)) (not (= main_~st~0 0)))} is VALID [2022-04-15 06:30:18,480 INFO L290 TraceCheckUtils]: 5: Hoare triple {45536#true} assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~last~0 := #t~nondet4;havoc #t~nondet4;~a~0 := 0;~b~0 := 0;~c~0 := 0;~st~0 := 0; {45638#(and (<= main_~b~0 main_~a~0) (< main_~a~0 (+ main_~b~0 1)))} is VALID [2022-04-15 06:30:18,480 INFO L272 TraceCheckUtils]: 4: Hoare triple {45536#true} call #t~ret6 := main(); {45536#true} is VALID [2022-04-15 06:30:18,480 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {45536#true} {45536#true} #66#return; {45536#true} is VALID [2022-04-15 06:30:18,480 INFO L290 TraceCheckUtils]: 2: Hoare triple {45536#true} assume true; {45536#true} is VALID [2022-04-15 06:30:18,480 INFO L290 TraceCheckUtils]: 1: Hoare triple {45536#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(11, 2);call #Ultimate.allocInit(12, 3);~last~0 := 0; {45536#true} is VALID [2022-04-15 06:30:18,480 INFO L272 TraceCheckUtils]: 0: Hoare triple {45536#true} call ULTIMATE.init(); {45536#true} is VALID [2022-04-15 06:30:18,480 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-04-15 06:30:18,481 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2059703633] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 06:30:18,481 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 06:30:18,481 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9, 9] total 19 [2022-04-15 06:30:19,820 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 06:30:19,821 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1664437374] [2022-04-15 06:30:19,821 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1664437374] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 06:30:19,821 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 06:30:19,821 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [56] imperfect sequences [] total 56 [2022-04-15 06:30:19,821 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [796201167] [2022-04-15 06:30:19,821 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 06:30:19,821 INFO L78 Accepts]: Start accepts. Automaton has has 56 states, 56 states have (on average 1.4107142857142858) internal successors, (79), 54 states have internal predecessors, (79), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 83 [2022-04-15 06:30:19,821 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 06:30:19,821 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 56 states, 56 states have (on average 1.4107142857142858) internal successors, (79), 54 states have internal predecessors, (79), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:30:19,861 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 83 edges. 83 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 06:30:19,861 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 56 states [2022-04-15 06:30:19,861 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 06:30:19,861 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 56 interpolants. [2022-04-15 06:30:19,861 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=426, Invalid=3864, Unknown=0, NotChecked=0, Total=4290 [2022-04-15 06:30:19,862 INFO L87 Difference]: Start difference. First operand 349 states and 398 transitions. Second operand has 56 states, 56 states have (on average 1.4107142857142858) internal successors, (79), 54 states have internal predecessors, (79), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:30:28,304 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:30:28,304 INFO L93 Difference]: Finished difference Result 474 states and 543 transitions. [2022-04-15 06:30:28,304 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 80 states. [2022-04-15 06:30:28,304 INFO L78 Accepts]: Start accepts. Automaton has has 56 states, 56 states have (on average 1.4107142857142858) internal successors, (79), 54 states have internal predecessors, (79), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 83 [2022-04-15 06:30:28,304 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 06:30:28,304 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 56 states, 56 states have (on average 1.4107142857142858) internal successors, (79), 54 states have internal predecessors, (79), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:30:28,305 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 185 transitions. [2022-04-15 06:30:28,306 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 56 states, 56 states have (on average 1.4107142857142858) internal successors, (79), 54 states have internal predecessors, (79), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:30:28,306 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 185 transitions. [2022-04-15 06:30:28,307 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 80 states and 185 transitions. [2022-04-15 06:30:28,404 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 185 edges. 185 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 06:30:28,411 INFO L225 Difference]: With dead ends: 474 [2022-04-15 06:30:28,411 INFO L226 Difference]: Without dead ends: 394 [2022-04-15 06:30:28,412 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 141 GetRequests, 49 SyntacticMatches, 2 SemanticMatches, 90 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2379 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=673, Invalid=7699, Unknown=0, NotChecked=0, Total=8372 [2022-04-15 06:30:28,412 INFO L913 BasicCegarLoop]: 16 mSDtfsCounter, 111 mSDsluCounter, 167 mSDsCounter, 0 mSdLazyCounter, 5614 mSolverCounterSat, 105 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 113 SdHoareTripleChecker+Valid, 183 SdHoareTripleChecker+Invalid, 5719 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 105 IncrementalHoareTripleChecker+Valid, 5614 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.3s IncrementalHoareTripleChecker+Time [2022-04-15 06:30:28,412 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [113 Valid, 183 Invalid, 5719 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [105 Valid, 5614 Invalid, 0 Unknown, 0 Unchecked, 3.3s Time] [2022-04-15 06:30:28,413 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 394 states. [2022-04-15 06:30:29,557 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 394 to 352. [2022-04-15 06:30:29,557 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 06:30:29,557 INFO L82 GeneralOperation]: Start isEquivalent. First operand 394 states. Second operand has 352 states, 344 states have (on average 1.1482558139534884) internal successors, (395), 345 states have internal predecessors, (395), 4 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-15 06:30:29,558 INFO L74 IsIncluded]: Start isIncluded. First operand 394 states. Second operand has 352 states, 344 states have (on average 1.1482558139534884) internal successors, (395), 345 states have internal predecessors, (395), 4 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-15 06:30:29,558 INFO L87 Difference]: Start difference. First operand 394 states. Second operand has 352 states, 344 states have (on average 1.1482558139534884) internal successors, (395), 345 states have internal predecessors, (395), 4 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-15 06:30:29,563 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:30:29,563 INFO L93 Difference]: Finished difference Result 394 states and 446 transitions. [2022-04-15 06:30:29,563 INFO L276 IsEmpty]: Start isEmpty. Operand 394 states and 446 transitions. [2022-04-15 06:30:29,563 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 06:30:29,563 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 06:30:29,563 INFO L74 IsIncluded]: Start isIncluded. First operand has 352 states, 344 states have (on average 1.1482558139534884) internal successors, (395), 345 states have internal predecessors, (395), 4 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) Second operand 394 states. [2022-04-15 06:30:29,564 INFO L87 Difference]: Start difference. First operand has 352 states, 344 states have (on average 1.1482558139534884) internal successors, (395), 345 states have internal predecessors, (395), 4 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) Second operand 394 states. [2022-04-15 06:30:29,569 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:30:29,569 INFO L93 Difference]: Finished difference Result 394 states and 446 transitions. [2022-04-15 06:30:29,569 INFO L276 IsEmpty]: Start isEmpty. Operand 394 states and 446 transitions. [2022-04-15 06:30:29,569 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 06:30:29,569 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 06:30:29,569 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 06:30:29,569 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 06:30:29,569 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 352 states, 344 states have (on average 1.1482558139534884) internal successors, (395), 345 states have internal predecessors, (395), 4 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-15 06:30:29,599 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 352 states to 352 states and 402 transitions. [2022-04-15 06:30:29,600 INFO L78 Accepts]: Start accepts. Automaton has 352 states and 402 transitions. Word has length 83 [2022-04-15 06:30:29,600 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 06:30:29,600 INFO L478 AbstractCegarLoop]: Abstraction has 352 states and 402 transitions. [2022-04-15 06:30:29,600 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 56 states, 56 states have (on average 1.4107142857142858) internal successors, (79), 54 states have internal predecessors, (79), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:30:29,600 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 352 states and 402 transitions. [2022-04-15 06:30:30,511 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 402 edges. 402 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 06:30:30,511 INFO L276 IsEmpty]: Start isEmpty. Operand 352 states and 402 transitions. [2022-04-15 06:30:30,511 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2022-04-15 06:30:30,511 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 06:30:30,511 INFO L499 BasicCegarLoop]: trace histogram [24, 24, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 06:30:30,528 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (33)] Ended with exit code 0 [2022-04-15 06:30:30,727 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable36,33 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 06:30:30,727 INFO L403 AbstractCegarLoop]: === Iteration 38 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 06:30:30,727 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 06:30:30,728 INFO L85 PathProgramCache]: Analyzing trace with hash 502663591, now seen corresponding path program 23 times [2022-04-15 06:30:30,728 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 06:30:30,728 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1505374339] [2022-04-15 06:30:30,863 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 1 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-15 06:30:31,018 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {0={1=1}, 1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-15 06:30:31,019 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-15 06:30:31,020 INFO L85 PathProgramCache]: Analyzing trace with hash 1912363592, now seen corresponding path program 1 times [2022-04-15 06:30:31,020 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 06:30:31,020 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [731336197] [2022-04-15 06:30:31,020 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 06:30:31,020 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 06:30:31,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:30:31,106 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 06:30:31,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:30:31,124 INFO L290 TraceCheckUtils]: 0: Hoare triple {48210#(and (= ~last~0 |old(~last~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(11, 2);call #Ultimate.allocInit(12, 3);~last~0 := 0; {48198#true} is VALID [2022-04-15 06:30:31,124 INFO L290 TraceCheckUtils]: 1: Hoare triple {48198#true} assume true; {48198#true} is VALID [2022-04-15 06:30:31,125 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {48198#true} {48198#true} #66#return; {48198#true} is VALID [2022-04-15 06:30:31,125 INFO L272 TraceCheckUtils]: 0: Hoare triple {48198#true} call ULTIMATE.init(); {48210#(and (= ~last~0 |old(~last~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 06:30:31,125 INFO L290 TraceCheckUtils]: 1: Hoare triple {48210#(and (= ~last~0 |old(~last~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(11, 2);call #Ultimate.allocInit(12, 3);~last~0 := 0; {48198#true} is VALID [2022-04-15 06:30:31,125 INFO L290 TraceCheckUtils]: 2: Hoare triple {48198#true} assume true; {48198#true} is VALID [2022-04-15 06:30:31,125 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {48198#true} {48198#true} #66#return; {48198#true} is VALID [2022-04-15 06:30:31,125 INFO L272 TraceCheckUtils]: 4: Hoare triple {48198#true} call #t~ret6 := main(); {48198#true} is VALID [2022-04-15 06:30:31,125 INFO L290 TraceCheckUtils]: 5: Hoare triple {48198#true} assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~last~0 := #t~nondet4;havoc #t~nondet4;~a~0 := 0;~b~0 := 0;~c~0 := 0;~st~0 := 0; {48203#(and (= main_~a~0 0) (= main_~b~0 0))} is VALID [2022-04-15 06:30:31,126 INFO L290 TraceCheckUtils]: 6: Hoare triple {48203#(and (= main_~a~0 0) (= main_~b~0 0))} assume !false;~st~0 := 1;~c~0 := 0; {48204#(and (= main_~a~0 0) (= main_~st~0 1) (= main_~b~0 0))} is VALID [2022-04-15 06:30:31,126 INFO L290 TraceCheckUtils]: 7: Hoare triple {48204#(and (= main_~a~0 0) (= main_~st~0 1) (= main_~b~0 0))} [188] L23-3-->L23-4_primed: Formula: (let ((.cse0 (= v_main_~c~0_995 v_main_~c~0_994)) (.cse2 (= v_~last~0_247 v_main_~c~0_995)) (.cse1 (= |v_main_#t~post5_463| |v_main_#t~post5_461|))) (or (and .cse0 (= v_~last~0_247 v_~last~0_247) .cse1) (and (< v_main_~c~0_995 v_main_~c~0_994) (not .cse2) (or (not (<= (+ v_main_~c~0_995 1) v_~last~0_247)) (not (<= (+ v_~last~0_247 1) v_main_~c~0_994))) (< v_main_~c~0_994 200001)) (and .cse0 (or .cse2 (not (< v_main_~c~0_995 200000))) .cse1))) InVars {main_~c~0=v_main_~c~0_995, main_#t~post5=|v_main_#t~post5_463|, ~last~0=v_~last~0_247} OutVars{main_#t~post5=|v_main_#t~post5_461|, main_~c~0=v_main_~c~0_994, ~last~0=v_~last~0_247} AuxVars[] AssignedVars[main_#t~post5, main_~c~0] {48204#(and (= main_~a~0 0) (= main_~st~0 1) (= main_~b~0 0))} is VALID [2022-04-15 06:30:31,126 INFO L290 TraceCheckUtils]: 8: Hoare triple {48204#(and (= main_~a~0 0) (= main_~st~0 1) (= main_~b~0 0))} [189] L23-4_primed-->L23-3: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {48204#(and (= main_~a~0 0) (= main_~st~0 1) (= main_~b~0 0))} is VALID [2022-04-15 06:30:31,127 INFO L290 TraceCheckUtils]: 9: Hoare triple {48204#(and (= main_~a~0 0) (= main_~st~0 1) (= main_~b~0 0))} [190] L23-3-->L23-4_primed: Formula: (let ((.cse0 (= |v_main_#t~post5_466| |v_main_#t~post5_462|)) (.cse1 (= v_main_~c~0_997 v_main_~c~0_996)) (.cse2 (= v_main_~st~0_325 v_main_~st~0_324)) (.cse4 (< v_main_~c~0_997 200000)) (.cse3 (= v_~last~0_248 v_main_~c~0_997))) (or (and .cse0 .cse1 .cse2 (= v_~last~0_248 v_~last~0_248)) (and .cse0 .cse1 .cse2 (or (not .cse3) (not .cse4))) (and .cse4 (< v_main_~c~0_997 v_main_~c~0_996) (= v_main_~st~0_324 0) (< v_main_~c~0_996 (+ 2 v_main_~c~0_997)) .cse3))) InVars {main_~c~0=v_main_~c~0_997, main_#t~post5=|v_main_#t~post5_466|, main_~st~0=v_main_~st~0_325, ~last~0=v_~last~0_248} OutVars{main_#t~post5=|v_main_#t~post5_462|, main_~c~0=v_main_~c~0_996, main_~st~0=v_main_~st~0_324, ~last~0=v_~last~0_248} AuxVars[] AssignedVars[main_#t~post5, main_~c~0, main_~st~0] {48205#(or (and (= main_~a~0 0) (= main_~b~0 0) (<= main_~c~0 200000)) (= main_~st~0 1))} is VALID [2022-04-15 06:30:31,127 INFO L290 TraceCheckUtils]: 10: Hoare triple {48205#(or (and (= main_~a~0 0) (= main_~b~0 0) (<= main_~c~0 200000)) (= main_~st~0 1))} [187] L23-4_primed-->L23-4: Formula: (not (< v_main_~c~0_8 200000)) InVars {main_~c~0=v_main_~c~0_8} OutVars{main_~c~0=v_main_~c~0_8} AuxVars[] AssignedVars[] {48206#(or (and (= main_~a~0 0) (= main_~b~0 0) (< 199999 main_~c~0) (<= main_~c~0 200000)) (= main_~st~0 1))} is VALID [2022-04-15 06:30:31,128 INFO L290 TraceCheckUtils]: 11: Hoare triple {48206#(or (and (= main_~a~0 0) (= main_~b~0 0) (< 199999 main_~c~0) (<= main_~c~0 200000)) (= main_~st~0 1))} assume 0 == ~st~0 && ~c~0 == 1 + ~last~0;~a~0 := 3 + ~a~0;~b~0 := 3 + ~b~0; {48207#(and (<= main_~b~0 main_~a~0) (< main_~a~0 (+ main_~b~0 1)) (< 199999 main_~c~0) (<= main_~c~0 200000))} is VALID [2022-04-15 06:30:31,128 INFO L290 TraceCheckUtils]: 12: Hoare triple {48207#(and (<= main_~b~0 main_~a~0) (< main_~a~0 (+ main_~b~0 1)) (< 199999 main_~c~0) (<= main_~c~0 200000))} assume !(~c~0 == ~last~0 && 0 == ~st~0); {48207#(and (<= main_~b~0 main_~a~0) (< main_~a~0 (+ main_~b~0 1)) (< 199999 main_~c~0) (<= main_~c~0 200000))} is VALID [2022-04-15 06:30:31,129 INFO L272 TraceCheckUtils]: 13: Hoare triple {48207#(and (<= main_~b~0 main_~a~0) (< main_~a~0 (+ main_~b~0 1)) (< 199999 main_~c~0) (<= main_~c~0 200000))} call __VERIFIER_assert((if ~a~0 == ~b~0 && 200000 == ~c~0 then 1 else 0)); {48208#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-15 06:30:31,129 INFO L290 TraceCheckUtils]: 14: Hoare triple {48208#(not (= |__VERIFIER_assert_#in~cond| 0))} ~cond := #in~cond; {48209#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-15 06:30:31,129 INFO L290 TraceCheckUtils]: 15: Hoare triple {48209#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {48199#false} is VALID [2022-04-15 06:30:31,129 INFO L290 TraceCheckUtils]: 16: Hoare triple {48199#false} assume !false; {48199#false} is VALID [2022-04-15 06:30:31,129 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-04-15 06:30:31,129 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 06:30:31,130 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [731336197] [2022-04-15 06:30:31,130 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [731336197] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 06:30:31,130 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1225317731] [2022-04-15 06:30:31,130 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 06:30:31,130 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 06:30:31,130 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 06:30:31,143 INFO L229 MonitoredProcess]: Starting monitored process 34 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-15 06:30:31,143 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (34)] Waiting until timeout for monitored process [2022-04-15 06:30:31,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:30:31,173 INFO L263 TraceCheckSpWp]: Trace formula consists of 85 conjuncts, 18 conjunts are in the unsatisfiable core [2022-04-15 06:30:31,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:30:31,177 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 06:30:31,346 INFO L272 TraceCheckUtils]: 0: Hoare triple {48198#true} call ULTIMATE.init(); {48198#true} is VALID [2022-04-15 06:30:31,346 INFO L290 TraceCheckUtils]: 1: Hoare triple {48198#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(11, 2);call #Ultimate.allocInit(12, 3);~last~0 := 0; {48198#true} is VALID [2022-04-15 06:30:31,346 INFO L290 TraceCheckUtils]: 2: Hoare triple {48198#true} assume true; {48198#true} is VALID [2022-04-15 06:30:31,346 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {48198#true} {48198#true} #66#return; {48198#true} is VALID [2022-04-15 06:30:31,347 INFO L272 TraceCheckUtils]: 4: Hoare triple {48198#true} call #t~ret6 := main(); {48198#true} is VALID [2022-04-15 06:30:31,347 INFO L290 TraceCheckUtils]: 5: Hoare triple {48198#true} assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~last~0 := #t~nondet4;havoc #t~nondet4;~a~0 := 0;~b~0 := 0;~c~0 := 0;~st~0 := 0; {48203#(and (= main_~a~0 0) (= main_~b~0 0))} is VALID [2022-04-15 06:30:31,347 INFO L290 TraceCheckUtils]: 6: Hoare triple {48203#(and (= main_~a~0 0) (= main_~b~0 0))} assume !false;~st~0 := 1;~c~0 := 0; {48204#(and (= main_~a~0 0) (= main_~st~0 1) (= main_~b~0 0))} is VALID [2022-04-15 06:30:31,348 INFO L290 TraceCheckUtils]: 7: Hoare triple {48204#(and (= main_~a~0 0) (= main_~st~0 1) (= main_~b~0 0))} [188] L23-3-->L23-4_primed: Formula: (let ((.cse0 (= v_main_~c~0_995 v_main_~c~0_994)) (.cse2 (= v_~last~0_247 v_main_~c~0_995)) (.cse1 (= |v_main_#t~post5_463| |v_main_#t~post5_461|))) (or (and .cse0 (= v_~last~0_247 v_~last~0_247) .cse1) (and (< v_main_~c~0_995 v_main_~c~0_994) (not .cse2) (or (not (<= (+ v_main_~c~0_995 1) v_~last~0_247)) (not (<= (+ v_~last~0_247 1) v_main_~c~0_994))) (< v_main_~c~0_994 200001)) (and .cse0 (or .cse2 (not (< v_main_~c~0_995 200000))) .cse1))) InVars {main_~c~0=v_main_~c~0_995, main_#t~post5=|v_main_#t~post5_463|, ~last~0=v_~last~0_247} OutVars{main_#t~post5=|v_main_#t~post5_461|, main_~c~0=v_main_~c~0_994, ~last~0=v_~last~0_247} AuxVars[] AssignedVars[main_#t~post5, main_~c~0] {48204#(and (= main_~a~0 0) (= main_~st~0 1) (= main_~b~0 0))} is VALID [2022-04-15 06:30:31,348 INFO L290 TraceCheckUtils]: 8: Hoare triple {48204#(and (= main_~a~0 0) (= main_~st~0 1) (= main_~b~0 0))} [189] L23-4_primed-->L23-3: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {48204#(and (= main_~a~0 0) (= main_~st~0 1) (= main_~b~0 0))} is VALID [2022-04-15 06:30:31,348 INFO L290 TraceCheckUtils]: 9: Hoare triple {48204#(and (= main_~a~0 0) (= main_~st~0 1) (= main_~b~0 0))} [190] L23-3-->L23-4_primed: Formula: (let ((.cse0 (= |v_main_#t~post5_466| |v_main_#t~post5_462|)) (.cse1 (= v_main_~c~0_997 v_main_~c~0_996)) (.cse2 (= v_main_~st~0_325 v_main_~st~0_324)) (.cse4 (< v_main_~c~0_997 200000)) (.cse3 (= v_~last~0_248 v_main_~c~0_997))) (or (and .cse0 .cse1 .cse2 (= v_~last~0_248 v_~last~0_248)) (and .cse0 .cse1 .cse2 (or (not .cse3) (not .cse4))) (and .cse4 (< v_main_~c~0_997 v_main_~c~0_996) (= v_main_~st~0_324 0) (< v_main_~c~0_996 (+ 2 v_main_~c~0_997)) .cse3))) InVars {main_~c~0=v_main_~c~0_997, main_#t~post5=|v_main_#t~post5_466|, main_~st~0=v_main_~st~0_325, ~last~0=v_~last~0_248} OutVars{main_#t~post5=|v_main_#t~post5_462|, main_~c~0=v_main_~c~0_996, main_~st~0=v_main_~st~0_324, ~last~0=v_~last~0_248} AuxVars[] AssignedVars[main_#t~post5, main_~c~0, main_~st~0] {48241#(and (= main_~a~0 0) (= main_~b~0 0) (or (= main_~st~0 1) (and (< ~last~0 200000) (< ~last~0 main_~c~0) (< main_~c~0 (+ ~last~0 2)) (= main_~st~0 0))))} is VALID [2022-04-15 06:30:31,349 INFO L290 TraceCheckUtils]: 10: Hoare triple {48241#(and (= main_~a~0 0) (= main_~b~0 0) (or (= main_~st~0 1) (and (< ~last~0 200000) (< ~last~0 main_~c~0) (< main_~c~0 (+ ~last~0 2)) (= main_~st~0 0))))} [187] L23-4_primed-->L23-4: Formula: (not (< v_main_~c~0_8 200000)) InVars {main_~c~0=v_main_~c~0_8} OutVars{main_~c~0=v_main_~c~0_8} AuxVars[] AssignedVars[] {48245#(and (= main_~a~0 0) (or (and (< ~last~0 200000) (< main_~c~0 (+ ~last~0 2)) (= main_~st~0 0)) (= main_~st~0 1)) (= main_~b~0 0) (not (< main_~c~0 200000)))} is VALID [2022-04-15 06:30:31,349 INFO L290 TraceCheckUtils]: 11: Hoare triple {48245#(and (= main_~a~0 0) (or (and (< ~last~0 200000) (< main_~c~0 (+ ~last~0 2)) (= main_~st~0 0)) (= main_~st~0 1)) (= main_~b~0 0) (not (< main_~c~0 200000)))} assume 0 == ~st~0 && ~c~0 == 1 + ~last~0;~a~0 := 3 + ~a~0;~b~0 := 3 + ~b~0; {48249#(and (= main_~b~0 3) (<= 200000 main_~c~0) (< main_~c~0 200001) (= main_~a~0 3))} is VALID [2022-04-15 06:30:31,350 INFO L290 TraceCheckUtils]: 12: Hoare triple {48249#(and (= main_~b~0 3) (<= 200000 main_~c~0) (< main_~c~0 200001) (= main_~a~0 3))} assume !(~c~0 == ~last~0 && 0 == ~st~0); {48249#(and (= main_~b~0 3) (<= 200000 main_~c~0) (< main_~c~0 200001) (= main_~a~0 3))} is VALID [2022-04-15 06:30:31,350 INFO L272 TraceCheckUtils]: 13: Hoare triple {48249#(and (= main_~b~0 3) (<= 200000 main_~c~0) (< main_~c~0 200001) (= main_~a~0 3))} call __VERIFIER_assert((if ~a~0 == ~b~0 && 200000 == ~c~0 then 1 else 0)); {48256#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-15 06:30:31,350 INFO L290 TraceCheckUtils]: 14: Hoare triple {48256#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {48260#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-15 06:30:31,350 INFO L290 TraceCheckUtils]: 15: Hoare triple {48260#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {48199#false} is VALID [2022-04-15 06:30:31,351 INFO L290 TraceCheckUtils]: 16: Hoare triple {48199#false} assume !false; {48199#false} is VALID [2022-04-15 06:30:31,354 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-04-15 06:30:31,354 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 06:30:31,617 INFO L290 TraceCheckUtils]: 16: Hoare triple {48199#false} assume !false; {48199#false} is VALID [2022-04-15 06:30:31,617 INFO L290 TraceCheckUtils]: 15: Hoare triple {48260#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {48199#false} is VALID [2022-04-15 06:30:31,618 INFO L290 TraceCheckUtils]: 14: Hoare triple {48256#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {48260#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-15 06:30:31,619 INFO L272 TraceCheckUtils]: 13: Hoare triple {48207#(and (<= main_~b~0 main_~a~0) (< main_~a~0 (+ main_~b~0 1)) (< 199999 main_~c~0) (<= main_~c~0 200000))} call __VERIFIER_assert((if ~a~0 == ~b~0 && 200000 == ~c~0 then 1 else 0)); {48256#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-15 06:30:31,619 INFO L290 TraceCheckUtils]: 12: Hoare triple {48207#(and (<= main_~b~0 main_~a~0) (< main_~a~0 (+ main_~b~0 1)) (< 199999 main_~c~0) (<= main_~c~0 200000))} assume !(~c~0 == ~last~0 && 0 == ~st~0); {48207#(and (<= main_~b~0 main_~a~0) (< main_~a~0 (+ main_~b~0 1)) (< 199999 main_~c~0) (<= main_~c~0 200000))} is VALID [2022-04-15 06:30:31,620 INFO L290 TraceCheckUtils]: 11: Hoare triple {48282#(or (not (<= main_~c~0 (+ ~last~0 1))) (and (<= main_~b~0 main_~a~0) (< main_~a~0 (+ main_~b~0 1)) (< 199999 main_~c~0) (<= main_~c~0 200000)) (not (= main_~st~0 0)))} assume 0 == ~st~0 && ~c~0 == 1 + ~last~0;~a~0 := 3 + ~a~0;~b~0 := 3 + ~b~0; {48207#(and (<= main_~b~0 main_~a~0) (< main_~a~0 (+ main_~b~0 1)) (< 199999 main_~c~0) (<= main_~c~0 200000))} is VALID [2022-04-15 06:30:31,620 INFO L290 TraceCheckUtils]: 10: Hoare triple {48286#(or (not (<= main_~c~0 (+ ~last~0 1))) (and (<= main_~b~0 main_~a~0) (< main_~a~0 (+ main_~b~0 1)) (<= main_~c~0 200000)) (not (= main_~st~0 0)) (< main_~c~0 200000))} [187] L23-4_primed-->L23-4: Formula: (not (< v_main_~c~0_8 200000)) InVars {main_~c~0=v_main_~c~0_8} OutVars{main_~c~0=v_main_~c~0_8} AuxVars[] AssignedVars[] {48282#(or (not (<= main_~c~0 (+ ~last~0 1))) (and (<= main_~b~0 main_~a~0) (< main_~a~0 (+ main_~b~0 1)) (< 199999 main_~c~0) (<= main_~c~0 200000)) (not (= main_~st~0 0)))} is VALID [2022-04-15 06:30:31,621 INFO L290 TraceCheckUtils]: 9: Hoare triple {48290#(and (<= main_~b~0 main_~a~0) (< main_~a~0 (+ main_~b~0 1)) (not (= main_~st~0 0)))} [190] L23-3-->L23-4_primed: Formula: (let ((.cse0 (= |v_main_#t~post5_466| |v_main_#t~post5_462|)) (.cse1 (= v_main_~c~0_997 v_main_~c~0_996)) (.cse2 (= v_main_~st~0_325 v_main_~st~0_324)) (.cse4 (< v_main_~c~0_997 200000)) (.cse3 (= v_~last~0_248 v_main_~c~0_997))) (or (and .cse0 .cse1 .cse2 (= v_~last~0_248 v_~last~0_248)) (and .cse0 .cse1 .cse2 (or (not .cse3) (not .cse4))) (and .cse4 (< v_main_~c~0_997 v_main_~c~0_996) (= v_main_~st~0_324 0) (< v_main_~c~0_996 (+ 2 v_main_~c~0_997)) .cse3))) InVars {main_~c~0=v_main_~c~0_997, main_#t~post5=|v_main_#t~post5_466|, main_~st~0=v_main_~st~0_325, ~last~0=v_~last~0_248} OutVars{main_#t~post5=|v_main_#t~post5_462|, main_~c~0=v_main_~c~0_996, main_~st~0=v_main_~st~0_324, ~last~0=v_~last~0_248} AuxVars[] AssignedVars[main_#t~post5, main_~c~0, main_~st~0] {48286#(or (not (<= main_~c~0 (+ ~last~0 1))) (and (<= main_~b~0 main_~a~0) (< main_~a~0 (+ main_~b~0 1)) (<= main_~c~0 200000)) (not (= main_~st~0 0)) (< main_~c~0 200000))} is VALID [2022-04-15 06:30:31,621 INFO L290 TraceCheckUtils]: 8: Hoare triple {48290#(and (<= main_~b~0 main_~a~0) (< main_~a~0 (+ main_~b~0 1)) (not (= main_~st~0 0)))} [189] L23-4_primed-->L23-3: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {48290#(and (<= main_~b~0 main_~a~0) (< main_~a~0 (+ main_~b~0 1)) (not (= main_~st~0 0)))} is VALID [2022-04-15 06:30:31,622 INFO L290 TraceCheckUtils]: 7: Hoare triple {48290#(and (<= main_~b~0 main_~a~0) (< main_~a~0 (+ main_~b~0 1)) (not (= main_~st~0 0)))} [188] L23-3-->L23-4_primed: Formula: (let ((.cse0 (= v_main_~c~0_995 v_main_~c~0_994)) (.cse2 (= v_~last~0_247 v_main_~c~0_995)) (.cse1 (= |v_main_#t~post5_463| |v_main_#t~post5_461|))) (or (and .cse0 (= v_~last~0_247 v_~last~0_247) .cse1) (and (< v_main_~c~0_995 v_main_~c~0_994) (not .cse2) (or (not (<= (+ v_main_~c~0_995 1) v_~last~0_247)) (not (<= (+ v_~last~0_247 1) v_main_~c~0_994))) (< v_main_~c~0_994 200001)) (and .cse0 (or .cse2 (not (< v_main_~c~0_995 200000))) .cse1))) InVars {main_~c~0=v_main_~c~0_995, main_#t~post5=|v_main_#t~post5_463|, ~last~0=v_~last~0_247} OutVars{main_#t~post5=|v_main_#t~post5_461|, main_~c~0=v_main_~c~0_994, ~last~0=v_~last~0_247} AuxVars[] AssignedVars[main_#t~post5, main_~c~0] {48290#(and (<= main_~b~0 main_~a~0) (< main_~a~0 (+ main_~b~0 1)) (not (= main_~st~0 0)))} is VALID [2022-04-15 06:30:31,622 INFO L290 TraceCheckUtils]: 6: Hoare triple {48300#(and (<= main_~b~0 main_~a~0) (< main_~a~0 (+ main_~b~0 1)))} assume !false;~st~0 := 1;~c~0 := 0; {48290#(and (<= main_~b~0 main_~a~0) (< main_~a~0 (+ main_~b~0 1)) (not (= main_~st~0 0)))} is VALID [2022-04-15 06:30:31,623 INFO L290 TraceCheckUtils]: 5: Hoare triple {48198#true} assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~last~0 := #t~nondet4;havoc #t~nondet4;~a~0 := 0;~b~0 := 0;~c~0 := 0;~st~0 := 0; {48300#(and (<= main_~b~0 main_~a~0) (< main_~a~0 (+ main_~b~0 1)))} is VALID [2022-04-15 06:30:31,623 INFO L272 TraceCheckUtils]: 4: Hoare triple {48198#true} call #t~ret6 := main(); {48198#true} is VALID [2022-04-15 06:30:31,623 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {48198#true} {48198#true} #66#return; {48198#true} is VALID [2022-04-15 06:30:31,623 INFO L290 TraceCheckUtils]: 2: Hoare triple {48198#true} assume true; {48198#true} is VALID [2022-04-15 06:30:31,623 INFO L290 TraceCheckUtils]: 1: Hoare triple {48198#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(11, 2);call #Ultimate.allocInit(12, 3);~last~0 := 0; {48198#true} is VALID [2022-04-15 06:30:31,623 INFO L272 TraceCheckUtils]: 0: Hoare triple {48198#true} call ULTIMATE.init(); {48198#true} is VALID [2022-04-15 06:30:31,623 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-04-15 06:30:31,623 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1225317731] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 06:30:31,623 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 06:30:31,623 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9, 9] total 19 [2022-04-15 06:30:33,064 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 06:30:33,064 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1505374339] [2022-04-15 06:30:33,064 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1505374339] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 06:30:33,065 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 06:30:33,065 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [58] imperfect sequences [] total 58 [2022-04-15 06:30:33,065 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [161190435] [2022-04-15 06:30:33,065 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 06:30:33,066 INFO L78 Accepts]: Start accepts. Automaton has has 58 states, 58 states have (on average 1.4137931034482758) internal successors, (82), 56 states have internal predecessors, (82), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 86 [2022-04-15 06:30:33,066 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 06:30:33,066 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 58 states, 58 states have (on average 1.4137931034482758) internal successors, (82), 56 states have internal predecessors, (82), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:30:33,107 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 86 edges. 86 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 06:30:33,107 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 58 states [2022-04-15 06:30:33,107 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 06:30:33,123 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 58 interpolants. [2022-04-15 06:30:33,124 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=441, Invalid=4115, Unknown=0, NotChecked=0, Total=4556 [2022-04-15 06:30:33,124 INFO L87 Difference]: Start difference. First operand 352 states and 402 transitions. Second operand has 58 states, 58 states have (on average 1.4137931034482758) internal successors, (82), 56 states have internal predecessors, (82), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:30:40,120 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:30:40,120 INFO L93 Difference]: Finished difference Result 478 states and 548 transitions. [2022-04-15 06:30:40,120 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 83 states. [2022-04-15 06:30:40,120 INFO L78 Accepts]: Start accepts. Automaton has has 58 states, 58 states have (on average 1.4137931034482758) internal successors, (82), 56 states have internal predecessors, (82), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 86 [2022-04-15 06:30:40,121 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 06:30:40,121 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 58 states, 58 states have (on average 1.4137931034482758) internal successors, (82), 56 states have internal predecessors, (82), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:30:40,122 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 190 transitions. [2022-04-15 06:30:40,123 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 58 states, 58 states have (on average 1.4137931034482758) internal successors, (82), 56 states have internal predecessors, (82), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:30:40,124 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 190 transitions. [2022-04-15 06:30:40,124 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 83 states and 190 transitions. [2022-04-15 06:30:40,218 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-15 06:30:40,225 INFO L225 Difference]: With dead ends: 478 [2022-04-15 06:30:40,225 INFO L226 Difference]: Without dead ends: 398 [2022-04-15 06:30:40,226 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 145 GetRequests, 50 SyntacticMatches, 2 SemanticMatches, 93 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2536 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=698, Invalid=8232, Unknown=0, NotChecked=0, Total=8930 [2022-04-15 06:30:40,226 INFO L913 BasicCegarLoop]: 17 mSDtfsCounter, 163 mSDsluCounter, 72 mSDsCounter, 0 mSdLazyCounter, 4886 mSolverCounterSat, 110 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 165 SdHoareTripleChecker+Valid, 89 SdHoareTripleChecker+Invalid, 4996 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 110 IncrementalHoareTripleChecker+Valid, 4886 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.6s IncrementalHoareTripleChecker+Time [2022-04-15 06:30:40,226 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [165 Valid, 89 Invalid, 4996 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [110 Valid, 4886 Invalid, 0 Unknown, 0 Unchecked, 2.6s Time] [2022-04-15 06:30:40,227 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 398 states. [2022-04-15 06:30:41,240 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 398 to 355. [2022-04-15 06:30:41,240 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 06:30:41,241 INFO L82 GeneralOperation]: Start isEquivalent. First operand 398 states. Second operand has 355 states, 347 states have (on average 1.1498559077809798) internal successors, (399), 348 states have internal predecessors, (399), 4 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-15 06:30:41,241 INFO L74 IsIncluded]: Start isIncluded. First operand 398 states. Second operand has 355 states, 347 states have (on average 1.1498559077809798) internal successors, (399), 348 states have internal predecessors, (399), 4 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-15 06:30:41,241 INFO L87 Difference]: Start difference. First operand 398 states. Second operand has 355 states, 347 states have (on average 1.1498559077809798) internal successors, (399), 348 states have internal predecessors, (399), 4 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-15 06:30:41,246 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:30:41,247 INFO L93 Difference]: Finished difference Result 398 states and 451 transitions. [2022-04-15 06:30:41,247 INFO L276 IsEmpty]: Start isEmpty. Operand 398 states and 451 transitions. [2022-04-15 06:30:41,247 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 06:30:41,247 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 06:30:41,247 INFO L74 IsIncluded]: Start isIncluded. First operand has 355 states, 347 states have (on average 1.1498559077809798) internal successors, (399), 348 states have internal predecessors, (399), 4 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) Second operand 398 states. [2022-04-15 06:30:41,247 INFO L87 Difference]: Start difference. First operand has 355 states, 347 states have (on average 1.1498559077809798) internal successors, (399), 348 states have internal predecessors, (399), 4 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) Second operand 398 states. [2022-04-15 06:30:41,252 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:30:41,252 INFO L93 Difference]: Finished difference Result 398 states and 451 transitions. [2022-04-15 06:30:41,252 INFO L276 IsEmpty]: Start isEmpty. Operand 398 states and 451 transitions. [2022-04-15 06:30:41,253 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 06:30:41,253 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 06:30:41,253 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 06:30:41,253 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 06:30:41,253 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 355 states, 347 states have (on average 1.1498559077809798) internal successors, (399), 348 states have internal predecessors, (399), 4 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-15 06:30:41,258 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 355 states to 355 states and 406 transitions. [2022-04-15 06:30:41,258 INFO L78 Accepts]: Start accepts. Automaton has 355 states and 406 transitions. Word has length 86 [2022-04-15 06:30:41,258 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 06:30:41,258 INFO L478 AbstractCegarLoop]: Abstraction has 355 states and 406 transitions. [2022-04-15 06:30:41,259 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 58 states, 58 states have (on average 1.4137931034482758) internal successors, (82), 56 states have internal predecessors, (82), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:30:41,259 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 355 states and 406 transitions. [2022-04-15 06:30:42,209 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 406 edges. 406 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 06:30:42,210 INFO L276 IsEmpty]: Start isEmpty. Operand 355 states and 406 transitions. [2022-04-15 06:30:42,210 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2022-04-15 06:30:42,210 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 06:30:42,210 INFO L499 BasicCegarLoop]: trace histogram [22, 22, 20, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 06:30:42,226 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (34)] Forceful destruction successful, exit code 0 [2022-04-15 06:30:42,424 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 34 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable37 [2022-04-15 06:30:42,424 INFO L403 AbstractCegarLoop]: === Iteration 39 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 06:30:42,424 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 06:30:42,425 INFO L85 PathProgramCache]: Analyzing trace with hash -973926746, now seen corresponding path program 10 times [2022-04-15 06:30:42,425 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 06:30:42,425 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [349580926] [2022-04-15 06:30:42,568 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 4 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {0={1=2}, 1={1=1, 2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-15 06:30:42,568 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-15 06:30:42,569 INFO L85 PathProgramCache]: Analyzing trace with hash -2131984200, now seen corresponding path program 1 times [2022-04-15 06:30:42,569 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 06:30:42,569 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [144863413] [2022-04-15 06:30:42,569 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 06:30:42,569 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 06:30:42,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:30:42,672 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 06:30:42,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:30:42,674 INFO L290 TraceCheckUtils]: 0: Hoare triple {50903#(and (= ~last~0 |old(~last~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(11, 2);call #Ultimate.allocInit(12, 3);~last~0 := 0; {50886#true} is VALID [2022-04-15 06:30:42,674 INFO L290 TraceCheckUtils]: 1: Hoare triple {50886#true} assume true; {50886#true} is VALID [2022-04-15 06:30:42,674 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {50886#true} {50886#true} #66#return; {50886#true} is VALID [2022-04-15 06:30:42,675 INFO L272 TraceCheckUtils]: 0: Hoare triple {50886#true} call ULTIMATE.init(); {50903#(and (= ~last~0 |old(~last~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 06:30:42,675 INFO L290 TraceCheckUtils]: 1: Hoare triple {50903#(and (= ~last~0 |old(~last~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(11, 2);call #Ultimate.allocInit(12, 3);~last~0 := 0; {50886#true} is VALID [2022-04-15 06:30:42,675 INFO L290 TraceCheckUtils]: 2: Hoare triple {50886#true} assume true; {50886#true} is VALID [2022-04-15 06:30:42,675 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {50886#true} {50886#true} #66#return; {50886#true} is VALID [2022-04-15 06:30:42,675 INFO L272 TraceCheckUtils]: 4: Hoare triple {50886#true} call #t~ret6 := main(); {50886#true} is VALID [2022-04-15 06:30:42,675 INFO L290 TraceCheckUtils]: 5: Hoare triple {50886#true} assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~last~0 := #t~nondet4;havoc #t~nondet4;~a~0 := 0;~b~0 := 0;~c~0 := 0;~st~0 := 0; {50886#true} is VALID [2022-04-15 06:30:42,675 INFO L290 TraceCheckUtils]: 6: Hoare triple {50886#true} [192] L30-->L23-3_primed: Formula: (let ((.cse0 (= v_main_~a~0_176 v_main_~a~0_175)) (.cse1 (= v_main_~b~0_173 v_main_~b~0_172)) (.cse2 (= v_main_~st~0_336 v_main_~st~0_334))) (or (and .cse0 .cse1 (= v_main_~c~0_1037 v_main_~c~0_1049) (= |v_main_#t~post5_474| |v_main_#t~post5_485|) .cse2) (and .cse0 (= |v_main_#t~post5_485| |v_main_#t~post5_474|) .cse1 (= v_main_~c~0_1049 v_main_~c~0_1037) .cse2))) InVars {main_~c~0=v_main_~c~0_1049, main_#t~post5=|v_main_#t~post5_485|, main_~st~0=v_main_~st~0_336, main_~b~0=v_main_~b~0_173, main_~a~0=v_main_~a~0_176} OutVars{main_~c~0=v_main_~c~0_1037, main_#t~post5=|v_main_#t~post5_474|, main_~st~0=v_main_~st~0_334, main_~b~0=v_main_~b~0_172, main_~a~0=v_main_~a~0_175} AuxVars[] AssignedVars[main_~c~0, main_#t~post5, main_~st~0, main_~b~0, main_~a~0] {50886#true} is VALID [2022-04-15 06:30:42,675 INFO L290 TraceCheckUtils]: 7: Hoare triple {50886#true} [191] L23-3_primed-->L23-3: Formula: (and (= v_main_~c~0_7 0) (= v_main_~st~0_6 1)) InVars {} OutVars{main_~c~0=v_main_~c~0_7, main_~st~0=v_main_~st~0_6} AuxVars[] AssignedVars[main_~c~0, main_~st~0] {50891#(= main_~c~0 0)} is VALID [2022-04-15 06:30:42,675 INFO L290 TraceCheckUtils]: 8: Hoare triple {50891#(= main_~c~0 0)} assume !!(~c~0 < 200000); {50891#(= main_~c~0 0)} is VALID [2022-04-15 06:30:42,676 INFO L290 TraceCheckUtils]: 9: Hoare triple {50891#(= main_~c~0 0)} assume ~c~0 == ~last~0;~st~0 := 0; {50891#(= main_~c~0 0)} is VALID [2022-04-15 06:30:42,676 INFO L290 TraceCheckUtils]: 10: Hoare triple {50891#(= main_~c~0 0)} #t~post5 := ~c~0;~c~0 := 1 + #t~post5;havoc #t~post5; {50892#(<= main_~c~0 1)} is VALID [2022-04-15 06:30:42,676 INFO L290 TraceCheckUtils]: 11: Hoare triple {50892#(<= main_~c~0 1)} assume !!(~c~0 < 200000); {50892#(<= main_~c~0 1)} is VALID [2022-04-15 06:30:42,676 INFO L290 TraceCheckUtils]: 12: Hoare triple {50892#(<= main_~c~0 1)} assume !(~c~0 == ~last~0); {50892#(<= main_~c~0 1)} is VALID [2022-04-15 06:30:42,677 INFO L290 TraceCheckUtils]: 13: Hoare triple {50892#(<= main_~c~0 1)} #t~post5 := ~c~0;~c~0 := 1 + #t~post5;havoc #t~post5; {50893#(<= main_~c~0 2)} is VALID [2022-04-15 06:30:42,677 INFO L290 TraceCheckUtils]: 14: Hoare triple {50893#(<= main_~c~0 2)} assume !!(~c~0 < 200000); {50893#(<= main_~c~0 2)} is VALID [2022-04-15 06:30:42,677 INFO L290 TraceCheckUtils]: 15: Hoare triple {50893#(<= main_~c~0 2)} assume !(~c~0 == ~last~0); {50893#(<= main_~c~0 2)} is VALID [2022-04-15 06:30:42,677 INFO L290 TraceCheckUtils]: 16: Hoare triple {50893#(<= main_~c~0 2)} #t~post5 := ~c~0;~c~0 := 1 + #t~post5;havoc #t~post5; {50894#(<= main_~c~0 3)} is VALID [2022-04-15 06:30:42,677 INFO L290 TraceCheckUtils]: 17: Hoare triple {50894#(<= main_~c~0 3)} assume !!(~c~0 < 200000); {50894#(<= main_~c~0 3)} is VALID [2022-04-15 06:30:42,678 INFO L290 TraceCheckUtils]: 18: Hoare triple {50894#(<= main_~c~0 3)} assume !(~c~0 == ~last~0); {50894#(<= main_~c~0 3)} is VALID [2022-04-15 06:30:42,678 INFO L290 TraceCheckUtils]: 19: Hoare triple {50894#(<= main_~c~0 3)} #t~post5 := ~c~0;~c~0 := 1 + #t~post5;havoc #t~post5; {50895#(<= main_~c~0 4)} is VALID [2022-04-15 06:30:42,678 INFO L290 TraceCheckUtils]: 20: Hoare triple {50895#(<= main_~c~0 4)} assume !!(~c~0 < 200000); {50895#(<= main_~c~0 4)} is VALID [2022-04-15 06:30:42,678 INFO L290 TraceCheckUtils]: 21: Hoare triple {50895#(<= main_~c~0 4)} assume !(~c~0 == ~last~0); {50895#(<= main_~c~0 4)} is VALID [2022-04-15 06:30:42,678 INFO L290 TraceCheckUtils]: 22: Hoare triple {50895#(<= main_~c~0 4)} #t~post5 := ~c~0;~c~0 := 1 + #t~post5;havoc #t~post5; {50896#(<= main_~c~0 5)} is VALID [2022-04-15 06:30:42,679 INFO L290 TraceCheckUtils]: 23: Hoare triple {50896#(<= main_~c~0 5)} assume !!(~c~0 < 200000); {50896#(<= main_~c~0 5)} is VALID [2022-04-15 06:30:42,679 INFO L290 TraceCheckUtils]: 24: Hoare triple {50896#(<= main_~c~0 5)} assume !(~c~0 == ~last~0); {50896#(<= main_~c~0 5)} is VALID [2022-04-15 06:30:42,679 INFO L290 TraceCheckUtils]: 25: Hoare triple {50896#(<= main_~c~0 5)} #t~post5 := ~c~0;~c~0 := 1 + #t~post5;havoc #t~post5; {50897#(<= main_~c~0 6)} is VALID [2022-04-15 06:30:42,679 INFO L290 TraceCheckUtils]: 26: Hoare triple {50897#(<= main_~c~0 6)} assume !!(~c~0 < 200000); {50897#(<= main_~c~0 6)} is VALID [2022-04-15 06:30:42,679 INFO L290 TraceCheckUtils]: 27: Hoare triple {50897#(<= main_~c~0 6)} assume !(~c~0 == ~last~0); {50897#(<= main_~c~0 6)} is VALID [2022-04-15 06:30:42,680 INFO L290 TraceCheckUtils]: 28: Hoare triple {50897#(<= main_~c~0 6)} #t~post5 := ~c~0;~c~0 := 1 + #t~post5;havoc #t~post5; {50898#(<= main_~c~0 7)} is VALID [2022-04-15 06:30:42,680 INFO L290 TraceCheckUtils]: 29: Hoare triple {50898#(<= main_~c~0 7)} assume !!(~c~0 < 200000); {50898#(<= main_~c~0 7)} is VALID [2022-04-15 06:30:42,680 INFO L290 TraceCheckUtils]: 30: Hoare triple {50898#(<= main_~c~0 7)} assume !(~c~0 == ~last~0); {50898#(<= main_~c~0 7)} is VALID [2022-04-15 06:30:42,680 INFO L290 TraceCheckUtils]: 31: Hoare triple {50898#(<= main_~c~0 7)} #t~post5 := ~c~0;~c~0 := 1 + #t~post5;havoc #t~post5; {50899#(<= main_~c~0 8)} is VALID [2022-04-15 06:30:42,681 INFO L290 TraceCheckUtils]: 32: Hoare triple {50899#(<= main_~c~0 8)} assume !!(~c~0 < 200000); {50899#(<= main_~c~0 8)} is VALID [2022-04-15 06:30:42,681 INFO L290 TraceCheckUtils]: 33: Hoare triple {50899#(<= main_~c~0 8)} assume !(~c~0 == ~last~0); {50899#(<= main_~c~0 8)} is VALID [2022-04-15 06:30:42,681 INFO L290 TraceCheckUtils]: 34: Hoare triple {50899#(<= main_~c~0 8)} #t~post5 := ~c~0;~c~0 := 1 + #t~post5;havoc #t~post5; {50900#(<= main_~c~0 9)} is VALID [2022-04-15 06:30:42,681 INFO L290 TraceCheckUtils]: 35: Hoare triple {50900#(<= main_~c~0 9)} assume !!(~c~0 < 200000); {50900#(<= main_~c~0 9)} is VALID [2022-04-15 06:30:42,681 INFO L290 TraceCheckUtils]: 36: Hoare triple {50900#(<= main_~c~0 9)} assume !(~c~0 == ~last~0); {50900#(<= main_~c~0 9)} is VALID [2022-04-15 06:30:42,682 INFO L290 TraceCheckUtils]: 37: Hoare triple {50900#(<= main_~c~0 9)} #t~post5 := ~c~0;~c~0 := 1 + #t~post5;havoc #t~post5; {50901#(<= main_~c~0 10)} is VALID [2022-04-15 06:30:42,682 INFO L290 TraceCheckUtils]: 38: Hoare triple {50901#(<= main_~c~0 10)} assume !!(~c~0 < 200000); {50901#(<= main_~c~0 10)} is VALID [2022-04-15 06:30:42,682 INFO L290 TraceCheckUtils]: 39: Hoare triple {50901#(<= main_~c~0 10)} assume !(~c~0 == ~last~0); {50901#(<= main_~c~0 10)} is VALID [2022-04-15 06:30:42,682 INFO L290 TraceCheckUtils]: 40: Hoare triple {50901#(<= main_~c~0 10)} #t~post5 := ~c~0;~c~0 := 1 + #t~post5;havoc #t~post5; {50902#(<= main_~c~0 11)} is VALID [2022-04-15 06:30:42,683 INFO L290 TraceCheckUtils]: 41: Hoare triple {50902#(<= main_~c~0 11)} assume !(~c~0 < 200000); {50887#false} is VALID [2022-04-15 06:30:42,683 INFO L290 TraceCheckUtils]: 42: Hoare triple {50887#false} assume 0 == ~st~0 && ~c~0 == 1 + ~last~0;~a~0 := 3 + ~a~0;~b~0 := 3 + ~b~0; {50887#false} is VALID [2022-04-15 06:30:42,683 INFO L290 TraceCheckUtils]: 43: Hoare triple {50887#false} assume !(~c~0 == ~last~0 && 0 == ~st~0); {50887#false} is VALID [2022-04-15 06:30:42,683 INFO L272 TraceCheckUtils]: 44: Hoare triple {50887#false} call __VERIFIER_assert((if ~a~0 == ~b~0 && 200000 == ~c~0 then 1 else 0)); {50887#false} is VALID [2022-04-15 06:30:42,683 INFO L290 TraceCheckUtils]: 45: Hoare triple {50887#false} ~cond := #in~cond; {50887#false} is VALID [2022-04-15 06:30:42,683 INFO L290 TraceCheckUtils]: 46: Hoare triple {50887#false} assume 0 == ~cond; {50887#false} is VALID [2022-04-15 06:30:42,683 INFO L290 TraceCheckUtils]: 47: Hoare triple {50887#false} assume !false; {50887#false} is VALID [2022-04-15 06:30:42,683 INFO L134 CoverageAnalysis]: Checked inductivity of 176 backedges. 0 proven. 176 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 06:30:42,683 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 06:30:42,683 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [144863413] [2022-04-15 06:30:42,683 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [144863413] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 06:30:42,683 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1716853688] [2022-04-15 06:30:42,684 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 06:30:42,684 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 06:30:42,684 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 06:30:42,686 INFO L229 MonitoredProcess]: Starting monitored process 35 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-15 06:30:42,714 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (35)] Waiting until timeout for monitored process [2022-04-15 06:30:42,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:30:42,747 INFO L263 TraceCheckSpWp]: Trace formula consists of 130 conjuncts, 13 conjunts are in the unsatisfiable core [2022-04-15 06:30:42,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:30:42,756 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 06:30:42,963 INFO L272 TraceCheckUtils]: 0: Hoare triple {50886#true} call ULTIMATE.init(); {50886#true} is VALID [2022-04-15 06:30:42,963 INFO L290 TraceCheckUtils]: 1: Hoare triple {50886#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(11, 2);call #Ultimate.allocInit(12, 3);~last~0 := 0; {50886#true} is VALID [2022-04-15 06:30:42,963 INFO L290 TraceCheckUtils]: 2: Hoare triple {50886#true} assume true; {50886#true} is VALID [2022-04-15 06:30:42,963 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {50886#true} {50886#true} #66#return; {50886#true} is VALID [2022-04-15 06:30:42,963 INFO L272 TraceCheckUtils]: 4: Hoare triple {50886#true} call #t~ret6 := main(); {50886#true} is VALID [2022-04-15 06:30:42,963 INFO L290 TraceCheckUtils]: 5: Hoare triple {50886#true} assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~last~0 := #t~nondet4;havoc #t~nondet4;~a~0 := 0;~b~0 := 0;~c~0 := 0;~st~0 := 0; {50886#true} is VALID [2022-04-15 06:30:42,963 INFO L290 TraceCheckUtils]: 6: Hoare triple {50886#true} [192] L30-->L23-3_primed: Formula: (let ((.cse0 (= v_main_~a~0_176 v_main_~a~0_175)) (.cse1 (= v_main_~b~0_173 v_main_~b~0_172)) (.cse2 (= v_main_~st~0_336 v_main_~st~0_334))) (or (and .cse0 .cse1 (= v_main_~c~0_1037 v_main_~c~0_1049) (= |v_main_#t~post5_474| |v_main_#t~post5_485|) .cse2) (and .cse0 (= |v_main_#t~post5_485| |v_main_#t~post5_474|) .cse1 (= v_main_~c~0_1049 v_main_~c~0_1037) .cse2))) InVars {main_~c~0=v_main_~c~0_1049, main_#t~post5=|v_main_#t~post5_485|, main_~st~0=v_main_~st~0_336, main_~b~0=v_main_~b~0_173, main_~a~0=v_main_~a~0_176} OutVars{main_~c~0=v_main_~c~0_1037, main_#t~post5=|v_main_#t~post5_474|, main_~st~0=v_main_~st~0_334, main_~b~0=v_main_~b~0_172, main_~a~0=v_main_~a~0_175} AuxVars[] AssignedVars[main_~c~0, main_#t~post5, main_~st~0, main_~b~0, main_~a~0] {50886#true} is VALID [2022-04-15 06:30:42,963 INFO L290 TraceCheckUtils]: 7: Hoare triple {50886#true} [191] L23-3_primed-->L23-3: Formula: (and (= v_main_~c~0_7 0) (= v_main_~st~0_6 1)) InVars {} OutVars{main_~c~0=v_main_~c~0_7, main_~st~0=v_main_~st~0_6} AuxVars[] AssignedVars[main_~c~0, main_~st~0] {50928#(<= main_~c~0 0)} is VALID [2022-04-15 06:30:42,964 INFO L290 TraceCheckUtils]: 8: Hoare triple {50928#(<= main_~c~0 0)} assume !!(~c~0 < 200000); {50928#(<= main_~c~0 0)} is VALID [2022-04-15 06:30:42,964 INFO L290 TraceCheckUtils]: 9: Hoare triple {50928#(<= main_~c~0 0)} assume ~c~0 == ~last~0;~st~0 := 0; {50928#(<= main_~c~0 0)} is VALID [2022-04-15 06:30:42,964 INFO L290 TraceCheckUtils]: 10: Hoare triple {50928#(<= main_~c~0 0)} #t~post5 := ~c~0;~c~0 := 1 + #t~post5;havoc #t~post5; {50892#(<= main_~c~0 1)} is VALID [2022-04-15 06:30:42,965 INFO L290 TraceCheckUtils]: 11: Hoare triple {50892#(<= main_~c~0 1)} assume !!(~c~0 < 200000); {50892#(<= main_~c~0 1)} is VALID [2022-04-15 06:30:42,965 INFO L290 TraceCheckUtils]: 12: Hoare triple {50892#(<= main_~c~0 1)} assume !(~c~0 == ~last~0); {50892#(<= main_~c~0 1)} is VALID [2022-04-15 06:30:42,965 INFO L290 TraceCheckUtils]: 13: Hoare triple {50892#(<= main_~c~0 1)} #t~post5 := ~c~0;~c~0 := 1 + #t~post5;havoc #t~post5; {50893#(<= main_~c~0 2)} is VALID [2022-04-15 06:30:42,966 INFO L290 TraceCheckUtils]: 14: Hoare triple {50893#(<= main_~c~0 2)} assume !!(~c~0 < 200000); {50893#(<= main_~c~0 2)} is VALID [2022-04-15 06:30:42,966 INFO L290 TraceCheckUtils]: 15: Hoare triple {50893#(<= main_~c~0 2)} assume !(~c~0 == ~last~0); {50893#(<= main_~c~0 2)} is VALID [2022-04-15 06:30:42,966 INFO L290 TraceCheckUtils]: 16: Hoare triple {50893#(<= main_~c~0 2)} #t~post5 := ~c~0;~c~0 := 1 + #t~post5;havoc #t~post5; {50894#(<= main_~c~0 3)} is VALID [2022-04-15 06:30:42,967 INFO L290 TraceCheckUtils]: 17: Hoare triple {50894#(<= main_~c~0 3)} assume !!(~c~0 < 200000); {50894#(<= main_~c~0 3)} is VALID [2022-04-15 06:30:42,967 INFO L290 TraceCheckUtils]: 18: Hoare triple {50894#(<= main_~c~0 3)} assume !(~c~0 == ~last~0); {50894#(<= main_~c~0 3)} is VALID [2022-04-15 06:30:42,967 INFO L290 TraceCheckUtils]: 19: Hoare triple {50894#(<= main_~c~0 3)} #t~post5 := ~c~0;~c~0 := 1 + #t~post5;havoc #t~post5; {50895#(<= main_~c~0 4)} is VALID [2022-04-15 06:30:42,968 INFO L290 TraceCheckUtils]: 20: Hoare triple {50895#(<= main_~c~0 4)} assume !!(~c~0 < 200000); {50895#(<= main_~c~0 4)} is VALID [2022-04-15 06:30:42,968 INFO L290 TraceCheckUtils]: 21: Hoare triple {50895#(<= main_~c~0 4)} assume !(~c~0 == ~last~0); {50895#(<= main_~c~0 4)} is VALID [2022-04-15 06:30:42,968 INFO L290 TraceCheckUtils]: 22: Hoare triple {50895#(<= main_~c~0 4)} #t~post5 := ~c~0;~c~0 := 1 + #t~post5;havoc #t~post5; {50896#(<= main_~c~0 5)} is VALID [2022-04-15 06:30:42,969 INFO L290 TraceCheckUtils]: 23: Hoare triple {50896#(<= main_~c~0 5)} assume !!(~c~0 < 200000); {50896#(<= main_~c~0 5)} is VALID [2022-04-15 06:30:42,969 INFO L290 TraceCheckUtils]: 24: Hoare triple {50896#(<= main_~c~0 5)} assume !(~c~0 == ~last~0); {50896#(<= main_~c~0 5)} is VALID [2022-04-15 06:30:42,969 INFO L290 TraceCheckUtils]: 25: Hoare triple {50896#(<= main_~c~0 5)} #t~post5 := ~c~0;~c~0 := 1 + #t~post5;havoc #t~post5; {50897#(<= main_~c~0 6)} is VALID [2022-04-15 06:30:42,969 INFO L290 TraceCheckUtils]: 26: Hoare triple {50897#(<= main_~c~0 6)} assume !!(~c~0 < 200000); {50897#(<= main_~c~0 6)} is VALID [2022-04-15 06:30:42,970 INFO L290 TraceCheckUtils]: 27: Hoare triple {50897#(<= main_~c~0 6)} assume !(~c~0 == ~last~0); {50897#(<= main_~c~0 6)} is VALID [2022-04-15 06:30:42,970 INFO L290 TraceCheckUtils]: 28: Hoare triple {50897#(<= main_~c~0 6)} #t~post5 := ~c~0;~c~0 := 1 + #t~post5;havoc #t~post5; {50898#(<= main_~c~0 7)} is VALID [2022-04-15 06:30:42,970 INFO L290 TraceCheckUtils]: 29: Hoare triple {50898#(<= main_~c~0 7)} assume !!(~c~0 < 200000); {50898#(<= main_~c~0 7)} is VALID [2022-04-15 06:30:42,971 INFO L290 TraceCheckUtils]: 30: Hoare triple {50898#(<= main_~c~0 7)} assume !(~c~0 == ~last~0); {50898#(<= main_~c~0 7)} is VALID [2022-04-15 06:30:42,971 INFO L290 TraceCheckUtils]: 31: Hoare triple {50898#(<= main_~c~0 7)} #t~post5 := ~c~0;~c~0 := 1 + #t~post5;havoc #t~post5; {50899#(<= main_~c~0 8)} is VALID [2022-04-15 06:30:42,971 INFO L290 TraceCheckUtils]: 32: Hoare triple {50899#(<= main_~c~0 8)} assume !!(~c~0 < 200000); {50899#(<= main_~c~0 8)} is VALID [2022-04-15 06:30:42,972 INFO L290 TraceCheckUtils]: 33: Hoare triple {50899#(<= main_~c~0 8)} assume !(~c~0 == ~last~0); {50899#(<= main_~c~0 8)} is VALID [2022-04-15 06:30:42,972 INFO L290 TraceCheckUtils]: 34: Hoare triple {50899#(<= main_~c~0 8)} #t~post5 := ~c~0;~c~0 := 1 + #t~post5;havoc #t~post5; {50900#(<= main_~c~0 9)} is VALID [2022-04-15 06:30:42,972 INFO L290 TraceCheckUtils]: 35: Hoare triple {50900#(<= main_~c~0 9)} assume !!(~c~0 < 200000); {50900#(<= main_~c~0 9)} is VALID [2022-04-15 06:30:42,973 INFO L290 TraceCheckUtils]: 36: Hoare triple {50900#(<= main_~c~0 9)} assume !(~c~0 == ~last~0); {50900#(<= main_~c~0 9)} is VALID [2022-04-15 06:30:42,973 INFO L290 TraceCheckUtils]: 37: Hoare triple {50900#(<= main_~c~0 9)} #t~post5 := ~c~0;~c~0 := 1 + #t~post5;havoc #t~post5; {50901#(<= main_~c~0 10)} is VALID [2022-04-15 06:30:42,973 INFO L290 TraceCheckUtils]: 38: Hoare triple {50901#(<= main_~c~0 10)} assume !!(~c~0 < 200000); {50901#(<= main_~c~0 10)} is VALID [2022-04-15 06:30:42,974 INFO L290 TraceCheckUtils]: 39: Hoare triple {50901#(<= main_~c~0 10)} assume !(~c~0 == ~last~0); {50901#(<= main_~c~0 10)} is VALID [2022-04-15 06:30:42,974 INFO L290 TraceCheckUtils]: 40: Hoare triple {50901#(<= main_~c~0 10)} #t~post5 := ~c~0;~c~0 := 1 + #t~post5;havoc #t~post5; {50902#(<= main_~c~0 11)} is VALID [2022-04-15 06:30:42,974 INFO L290 TraceCheckUtils]: 41: Hoare triple {50902#(<= main_~c~0 11)} assume !(~c~0 < 200000); {50887#false} is VALID [2022-04-15 06:30:42,974 INFO L290 TraceCheckUtils]: 42: Hoare triple {50887#false} assume 0 == ~st~0 && ~c~0 == 1 + ~last~0;~a~0 := 3 + ~a~0;~b~0 := 3 + ~b~0; {50887#false} is VALID [2022-04-15 06:30:42,974 INFO L290 TraceCheckUtils]: 43: Hoare triple {50887#false} assume !(~c~0 == ~last~0 && 0 == ~st~0); {50887#false} is VALID [2022-04-15 06:30:42,974 INFO L272 TraceCheckUtils]: 44: Hoare triple {50887#false} call __VERIFIER_assert((if ~a~0 == ~b~0 && 200000 == ~c~0 then 1 else 0)); {50887#false} is VALID [2022-04-15 06:30:42,975 INFO L290 TraceCheckUtils]: 45: Hoare triple {50887#false} ~cond := #in~cond; {50887#false} is VALID [2022-04-15 06:30:42,975 INFO L290 TraceCheckUtils]: 46: Hoare triple {50887#false} assume 0 == ~cond; {50887#false} is VALID [2022-04-15 06:30:42,975 INFO L290 TraceCheckUtils]: 47: Hoare triple {50887#false} assume !false; {50887#false} is VALID [2022-04-15 06:30:42,975 INFO L134 CoverageAnalysis]: Checked inductivity of 176 backedges. 0 proven. 176 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 06:30:42,975 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 06:30:43,368 INFO L290 TraceCheckUtils]: 47: Hoare triple {50887#false} assume !false; {50887#false} is VALID [2022-04-15 06:30:43,369 INFO L290 TraceCheckUtils]: 46: Hoare triple {50887#false} assume 0 == ~cond; {50887#false} is VALID [2022-04-15 06:30:43,369 INFO L290 TraceCheckUtils]: 45: Hoare triple {50887#false} ~cond := #in~cond; {50887#false} is VALID [2022-04-15 06:30:43,369 INFO L272 TraceCheckUtils]: 44: Hoare triple {50887#false} call __VERIFIER_assert((if ~a~0 == ~b~0 && 200000 == ~c~0 then 1 else 0)); {50887#false} is VALID [2022-04-15 06:30:43,369 INFO L290 TraceCheckUtils]: 43: Hoare triple {50887#false} assume !(~c~0 == ~last~0 && 0 == ~st~0); {50887#false} is VALID [2022-04-15 06:30:43,369 INFO L290 TraceCheckUtils]: 42: Hoare triple {50887#false} assume 0 == ~st~0 && ~c~0 == 1 + ~last~0;~a~0 := 3 + ~a~0;~b~0 := 3 + ~b~0; {50887#false} is VALID [2022-04-15 06:30:43,369 INFO L290 TraceCheckUtils]: 41: Hoare triple {51067#(< main_~c~0 200000)} assume !(~c~0 < 200000); {50887#false} is VALID [2022-04-15 06:30:43,370 INFO L290 TraceCheckUtils]: 40: Hoare triple {51071#(< main_~c~0 199999)} #t~post5 := ~c~0;~c~0 := 1 + #t~post5;havoc #t~post5; {51067#(< main_~c~0 200000)} is VALID [2022-04-15 06:30:43,370 INFO L290 TraceCheckUtils]: 39: Hoare triple {51071#(< main_~c~0 199999)} assume !(~c~0 == ~last~0); {51071#(< main_~c~0 199999)} is VALID [2022-04-15 06:30:43,370 INFO L290 TraceCheckUtils]: 38: Hoare triple {51071#(< main_~c~0 199999)} assume !!(~c~0 < 200000); {51071#(< main_~c~0 199999)} is VALID [2022-04-15 06:30:43,370 INFO L290 TraceCheckUtils]: 37: Hoare triple {51081#(< main_~c~0 199998)} #t~post5 := ~c~0;~c~0 := 1 + #t~post5;havoc #t~post5; {51071#(< main_~c~0 199999)} is VALID [2022-04-15 06:30:43,371 INFO L290 TraceCheckUtils]: 36: Hoare triple {51081#(< main_~c~0 199998)} assume !(~c~0 == ~last~0); {51081#(< main_~c~0 199998)} is VALID [2022-04-15 06:30:43,371 INFO L290 TraceCheckUtils]: 35: Hoare triple {51081#(< main_~c~0 199998)} assume !!(~c~0 < 200000); {51081#(< main_~c~0 199998)} is VALID [2022-04-15 06:30:43,371 INFO L290 TraceCheckUtils]: 34: Hoare triple {51091#(< main_~c~0 199997)} #t~post5 := ~c~0;~c~0 := 1 + #t~post5;havoc #t~post5; {51081#(< main_~c~0 199998)} is VALID [2022-04-15 06:30:43,372 INFO L290 TraceCheckUtils]: 33: Hoare triple {51091#(< main_~c~0 199997)} assume !(~c~0 == ~last~0); {51091#(< main_~c~0 199997)} is VALID [2022-04-15 06:30:43,372 INFO L290 TraceCheckUtils]: 32: Hoare triple {51091#(< main_~c~0 199997)} assume !!(~c~0 < 200000); {51091#(< main_~c~0 199997)} is VALID [2022-04-15 06:30:43,372 INFO L290 TraceCheckUtils]: 31: Hoare triple {51101#(< main_~c~0 199996)} #t~post5 := ~c~0;~c~0 := 1 + #t~post5;havoc #t~post5; {51091#(< main_~c~0 199997)} is VALID [2022-04-15 06:30:43,373 INFO L290 TraceCheckUtils]: 30: Hoare triple {51101#(< main_~c~0 199996)} assume !(~c~0 == ~last~0); {51101#(< main_~c~0 199996)} is VALID [2022-04-15 06:30:43,373 INFO L290 TraceCheckUtils]: 29: Hoare triple {51101#(< main_~c~0 199996)} assume !!(~c~0 < 200000); {51101#(< main_~c~0 199996)} is VALID [2022-04-15 06:30:43,373 INFO L290 TraceCheckUtils]: 28: Hoare triple {51111#(< main_~c~0 199995)} #t~post5 := ~c~0;~c~0 := 1 + #t~post5;havoc #t~post5; {51101#(< main_~c~0 199996)} is VALID [2022-04-15 06:30:43,374 INFO L290 TraceCheckUtils]: 27: Hoare triple {51111#(< main_~c~0 199995)} assume !(~c~0 == ~last~0); {51111#(< main_~c~0 199995)} is VALID [2022-04-15 06:30:43,374 INFO L290 TraceCheckUtils]: 26: Hoare triple {51111#(< main_~c~0 199995)} assume !!(~c~0 < 200000); {51111#(< main_~c~0 199995)} is VALID [2022-04-15 06:30:43,374 INFO L290 TraceCheckUtils]: 25: Hoare triple {51121#(< main_~c~0 199994)} #t~post5 := ~c~0;~c~0 := 1 + #t~post5;havoc #t~post5; {51111#(< main_~c~0 199995)} is VALID [2022-04-15 06:30:43,375 INFO L290 TraceCheckUtils]: 24: Hoare triple {51121#(< main_~c~0 199994)} assume !(~c~0 == ~last~0); {51121#(< main_~c~0 199994)} is VALID [2022-04-15 06:30:43,375 INFO L290 TraceCheckUtils]: 23: Hoare triple {51121#(< main_~c~0 199994)} assume !!(~c~0 < 200000); {51121#(< main_~c~0 199994)} is VALID [2022-04-15 06:30:43,375 INFO L290 TraceCheckUtils]: 22: Hoare triple {51131#(< main_~c~0 199993)} #t~post5 := ~c~0;~c~0 := 1 + #t~post5;havoc #t~post5; {51121#(< main_~c~0 199994)} is VALID [2022-04-15 06:30:43,375 INFO L290 TraceCheckUtils]: 21: Hoare triple {51131#(< main_~c~0 199993)} assume !(~c~0 == ~last~0); {51131#(< main_~c~0 199993)} is VALID [2022-04-15 06:30:43,376 INFO L290 TraceCheckUtils]: 20: Hoare triple {51131#(< main_~c~0 199993)} assume !!(~c~0 < 200000); {51131#(< main_~c~0 199993)} is VALID [2022-04-15 06:30:43,376 INFO L290 TraceCheckUtils]: 19: Hoare triple {51141#(< main_~c~0 199992)} #t~post5 := ~c~0;~c~0 := 1 + #t~post5;havoc #t~post5; {51131#(< main_~c~0 199993)} is VALID [2022-04-15 06:30:43,376 INFO L290 TraceCheckUtils]: 18: Hoare triple {51141#(< main_~c~0 199992)} assume !(~c~0 == ~last~0); {51141#(< main_~c~0 199992)} is VALID [2022-04-15 06:30:43,377 INFO L290 TraceCheckUtils]: 17: Hoare triple {51141#(< main_~c~0 199992)} assume !!(~c~0 < 200000); {51141#(< main_~c~0 199992)} is VALID [2022-04-15 06:30:43,377 INFO L290 TraceCheckUtils]: 16: Hoare triple {51151#(< main_~c~0 199991)} #t~post5 := ~c~0;~c~0 := 1 + #t~post5;havoc #t~post5; {51141#(< main_~c~0 199992)} is VALID [2022-04-15 06:30:43,377 INFO L290 TraceCheckUtils]: 15: Hoare triple {51151#(< main_~c~0 199991)} assume !(~c~0 == ~last~0); {51151#(< main_~c~0 199991)} is VALID [2022-04-15 06:30:43,378 INFO L290 TraceCheckUtils]: 14: Hoare triple {51151#(< main_~c~0 199991)} assume !!(~c~0 < 200000); {51151#(< main_~c~0 199991)} is VALID [2022-04-15 06:30:43,378 INFO L290 TraceCheckUtils]: 13: Hoare triple {51161#(< main_~c~0 199990)} #t~post5 := ~c~0;~c~0 := 1 + #t~post5;havoc #t~post5; {51151#(< main_~c~0 199991)} is VALID [2022-04-15 06:30:43,378 INFO L290 TraceCheckUtils]: 12: Hoare triple {51161#(< main_~c~0 199990)} assume !(~c~0 == ~last~0); {51161#(< main_~c~0 199990)} is VALID [2022-04-15 06:30:43,379 INFO L290 TraceCheckUtils]: 11: Hoare triple {51161#(< main_~c~0 199990)} assume !!(~c~0 < 200000); {51161#(< main_~c~0 199990)} is VALID [2022-04-15 06:30:43,379 INFO L290 TraceCheckUtils]: 10: Hoare triple {51171#(< main_~c~0 199989)} #t~post5 := ~c~0;~c~0 := 1 + #t~post5;havoc #t~post5; {51161#(< main_~c~0 199990)} is VALID [2022-04-15 06:30:43,379 INFO L290 TraceCheckUtils]: 9: Hoare triple {51171#(< main_~c~0 199989)} assume ~c~0 == ~last~0;~st~0 := 0; {51171#(< main_~c~0 199989)} is VALID [2022-04-15 06:30:43,380 INFO L290 TraceCheckUtils]: 8: Hoare triple {51171#(< main_~c~0 199989)} assume !!(~c~0 < 200000); {51171#(< main_~c~0 199989)} is VALID [2022-04-15 06:30:43,380 INFO L290 TraceCheckUtils]: 7: Hoare triple {50886#true} [191] L23-3_primed-->L23-3: Formula: (and (= v_main_~c~0_7 0) (= v_main_~st~0_6 1)) InVars {} OutVars{main_~c~0=v_main_~c~0_7, main_~st~0=v_main_~st~0_6} AuxVars[] AssignedVars[main_~c~0, main_~st~0] {51171#(< main_~c~0 199989)} is VALID [2022-04-15 06:30:43,380 INFO L290 TraceCheckUtils]: 6: Hoare triple {50886#true} [192] L30-->L23-3_primed: Formula: (let ((.cse0 (= v_main_~a~0_176 v_main_~a~0_175)) (.cse1 (= v_main_~b~0_173 v_main_~b~0_172)) (.cse2 (= v_main_~st~0_336 v_main_~st~0_334))) (or (and .cse0 .cse1 (= v_main_~c~0_1037 v_main_~c~0_1049) (= |v_main_#t~post5_474| |v_main_#t~post5_485|) .cse2) (and .cse0 (= |v_main_#t~post5_485| |v_main_#t~post5_474|) .cse1 (= v_main_~c~0_1049 v_main_~c~0_1037) .cse2))) InVars {main_~c~0=v_main_~c~0_1049, main_#t~post5=|v_main_#t~post5_485|, main_~st~0=v_main_~st~0_336, main_~b~0=v_main_~b~0_173, main_~a~0=v_main_~a~0_176} OutVars{main_~c~0=v_main_~c~0_1037, main_#t~post5=|v_main_#t~post5_474|, main_~st~0=v_main_~st~0_334, main_~b~0=v_main_~b~0_172, main_~a~0=v_main_~a~0_175} AuxVars[] AssignedVars[main_~c~0, main_#t~post5, main_~st~0, main_~b~0, main_~a~0] {50886#true} is VALID [2022-04-15 06:30:43,380 INFO L290 TraceCheckUtils]: 5: Hoare triple {50886#true} assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~last~0 := #t~nondet4;havoc #t~nondet4;~a~0 := 0;~b~0 := 0;~c~0 := 0;~st~0 := 0; {50886#true} is VALID [2022-04-15 06:30:43,380 INFO L272 TraceCheckUtils]: 4: Hoare triple {50886#true} call #t~ret6 := main(); {50886#true} is VALID [2022-04-15 06:30:43,380 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {50886#true} {50886#true} #66#return; {50886#true} is VALID [2022-04-15 06:30:43,380 INFO L290 TraceCheckUtils]: 2: Hoare triple {50886#true} assume true; {50886#true} is VALID [2022-04-15 06:30:43,380 INFO L290 TraceCheckUtils]: 1: Hoare triple {50886#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(11, 2);call #Ultimate.allocInit(12, 3);~last~0 := 0; {50886#true} is VALID [2022-04-15 06:30:43,380 INFO L272 TraceCheckUtils]: 0: Hoare triple {50886#true} call ULTIMATE.init(); {50886#true} is VALID [2022-04-15 06:30:43,381 INFO L134 CoverageAnalysis]: Checked inductivity of 176 backedges. 0 proven. 176 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 06:30:43,381 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1716853688] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 06:30:43,381 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 06:30:43,381 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 14, 14] total 28 [2022-04-15 06:30:43,777 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 06:30:43,777 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [349580926] [2022-04-15 06:30:43,777 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [349580926] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 06:30:43,777 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 06:30:43,777 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [28] imperfect sequences [] total 28 [2022-04-15 06:30:43,778 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [743213762] [2022-04-15 06:30:43,778 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 06:30:43,778 INFO L78 Accepts]: Start accepts. Automaton has has 28 states, 28 states have (on average 2.892857142857143) internal successors, (81), 27 states have internal predecessors, (81), 2 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 89 [2022-04-15 06:30:43,778 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 06:30:43,778 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 28 states, 28 states have (on average 2.892857142857143) internal successors, (81), 27 states have internal predecessors, (81), 2 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-15 06:30:43,852 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 86 edges. 86 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 06:30:43,852 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2022-04-15 06:30:43,852 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 06:30:43,852 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2022-04-15 06:30:43,852 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=627, Invalid=1013, Unknown=0, NotChecked=0, Total=1640 [2022-04-15 06:30:43,852 INFO L87 Difference]: Start difference. First operand 355 states and 406 transitions. Second operand has 28 states, 28 states have (on average 2.892857142857143) internal successors, (81), 27 states have internal predecessors, (81), 2 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-15 06:30:46,995 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:30:46,996 INFO L93 Difference]: Finished difference Result 547 states and 633 transitions. [2022-04-15 06:30:46,996 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2022-04-15 06:30:46,996 INFO L78 Accepts]: Start accepts. Automaton has has 28 states, 28 states have (on average 2.892857142857143) internal successors, (81), 27 states have internal predecessors, (81), 2 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 89 [2022-04-15 06:30:46,996 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 06:30:46,996 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28 states, 28 states have (on average 2.892857142857143) internal successors, (81), 27 states have internal predecessors, (81), 2 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-15 06:30:46,997 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 123 transitions. [2022-04-15 06:30:46,997 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28 states, 28 states have (on average 2.892857142857143) internal successors, (81), 27 states have internal predecessors, (81), 2 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-15 06:30:46,997 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 123 transitions. [2022-04-15 06:30:46,998 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 28 states and 123 transitions. [2022-04-15 06:30:47,077 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 123 edges. 123 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 06:30:47,086 INFO L225 Difference]: With dead ends: 547 [2022-04-15 06:30:47,086 INFO L226 Difference]: Without dead ends: 459 [2022-04-15 06:30:47,087 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 161 GetRequests, 106 SyntacticMatches, 16 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1422 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=627, Invalid=1013, Unknown=0, NotChecked=0, Total=1640 [2022-04-15 06:30:47,087 INFO L913 BasicCegarLoop]: 18 mSDtfsCounter, 76 mSDsluCounter, 24 mSDsCounter, 0 mSdLazyCounter, 576 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 76 SdHoareTripleChecker+Valid, 42 SdHoareTripleChecker+Invalid, 589 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 576 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-04-15 06:30:47,087 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [76 Valid, 42 Invalid, 589 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 576 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-04-15 06:30:47,088 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 459 states. [2022-04-15 06:30:49,137 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 459 to 396. [2022-04-15 06:30:49,137 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 06:30:49,138 INFO L82 GeneralOperation]: Start isEquivalent. First operand 459 states. Second operand has 396 states, 388 states have (on average 1.1391752577319587) internal successors, (442), 389 states have internal predecessors, (442), 4 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-15 06:30:49,138 INFO L74 IsIncluded]: Start isIncluded. First operand 459 states. Second operand has 396 states, 388 states have (on average 1.1391752577319587) internal successors, (442), 389 states have internal predecessors, (442), 4 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-15 06:30:49,138 INFO L87 Difference]: Start difference. First operand 459 states. Second operand has 396 states, 388 states have (on average 1.1391752577319587) internal successors, (442), 389 states have internal predecessors, (442), 4 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-15 06:30:49,145 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:30:49,145 INFO L93 Difference]: Finished difference Result 459 states and 514 transitions. [2022-04-15 06:30:49,145 INFO L276 IsEmpty]: Start isEmpty. Operand 459 states and 514 transitions. [2022-04-15 06:30:49,145 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 06:30:49,145 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 06:30:49,146 INFO L74 IsIncluded]: Start isIncluded. First operand has 396 states, 388 states have (on average 1.1391752577319587) internal successors, (442), 389 states have internal predecessors, (442), 4 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) Second operand 459 states. [2022-04-15 06:30:49,146 INFO L87 Difference]: Start difference. First operand has 396 states, 388 states have (on average 1.1391752577319587) internal successors, (442), 389 states have internal predecessors, (442), 4 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) Second operand 459 states. [2022-04-15 06:30:49,152 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:30:49,152 INFO L93 Difference]: Finished difference Result 459 states and 514 transitions. [2022-04-15 06:30:49,153 INFO L276 IsEmpty]: Start isEmpty. Operand 459 states and 514 transitions. [2022-04-15 06:30:49,153 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 06:30:49,153 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 06:30:49,153 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 06:30:49,153 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 06:30:49,153 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 396 states, 388 states have (on average 1.1391752577319587) internal successors, (442), 389 states have internal predecessors, (442), 4 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-15 06:30:49,160 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 396 states to 396 states and 449 transitions. [2022-04-15 06:30:49,160 INFO L78 Accepts]: Start accepts. Automaton has 396 states and 449 transitions. Word has length 89 [2022-04-15 06:30:49,160 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 06:30:49,160 INFO L478 AbstractCegarLoop]: Abstraction has 396 states and 449 transitions. [2022-04-15 06:30:49,161 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 28 states have (on average 2.892857142857143) internal successors, (81), 27 states have internal predecessors, (81), 2 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-15 06:30:49,161 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 396 states and 449 transitions. [2022-04-15 06:30:50,330 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 449 edges. 449 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 06:30:50,330 INFO L276 IsEmpty]: Start isEmpty. Operand 396 states and 449 transitions. [2022-04-15 06:30:50,330 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2022-04-15 06:30:50,331 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 06:30:50,331 INFO L499 BasicCegarLoop]: trace histogram [25, 25, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 06:30:50,346 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (35)] Forceful destruction successful, exit code 0 [2022-04-15 06:30:50,535 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 35 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable38 [2022-04-15 06:30:50,536 INFO L403 AbstractCegarLoop]: === Iteration 40 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 06:30:50,536 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 06:30:50,536 INFO L85 PathProgramCache]: Analyzing trace with hash -1904424796, now seen corresponding path program 24 times [2022-04-15 06:30:50,536 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 06:30:50,536 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1938125198] [2022-04-15 06:30:50,719 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 1 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-15 06:30:50,932 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {0={1=1}, 1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-15 06:30:50,933 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-15 06:30:50,937 INFO L85 PathProgramCache]: Analyzing trace with hash 1375472584, now seen corresponding path program 1 times [2022-04-15 06:30:50,937 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 06:30:50,937 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1061999536] [2022-04-15 06:30:50,937 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 06:30:50,937 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 06:30:50,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:30:51,064 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 06:30:51,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:30:51,067 INFO L290 TraceCheckUtils]: 0: Hoare triple {54033#(and (= ~last~0 |old(~last~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(11, 2);call #Ultimate.allocInit(12, 3);~last~0 := 0; {54021#true} is VALID [2022-04-15 06:30:51,067 INFO L290 TraceCheckUtils]: 1: Hoare triple {54021#true} assume true; {54021#true} is VALID [2022-04-15 06:30:51,067 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {54021#true} {54021#true} #66#return; {54021#true} is VALID [2022-04-15 06:30:51,068 INFO L272 TraceCheckUtils]: 0: Hoare triple {54021#true} call ULTIMATE.init(); {54033#(and (= ~last~0 |old(~last~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 06:30:51,068 INFO L290 TraceCheckUtils]: 1: Hoare triple {54033#(and (= ~last~0 |old(~last~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(11, 2);call #Ultimate.allocInit(12, 3);~last~0 := 0; {54021#true} is VALID [2022-04-15 06:30:51,068 INFO L290 TraceCheckUtils]: 2: Hoare triple {54021#true} assume true; {54021#true} is VALID [2022-04-15 06:30:51,068 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {54021#true} {54021#true} #66#return; {54021#true} is VALID [2022-04-15 06:30:51,068 INFO L272 TraceCheckUtils]: 4: Hoare triple {54021#true} call #t~ret6 := main(); {54021#true} is VALID [2022-04-15 06:30:51,068 INFO L290 TraceCheckUtils]: 5: Hoare triple {54021#true} assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~last~0 := #t~nondet4;havoc #t~nondet4;~a~0 := 0;~b~0 := 0;~c~0 := 0;~st~0 := 0; {54026#(and (= main_~a~0 0) (= main_~b~0 0))} is VALID [2022-04-15 06:30:51,069 INFO L290 TraceCheckUtils]: 6: Hoare triple {54026#(and (= main_~a~0 0) (= main_~b~0 0))} assume !false;~st~0 := 1;~c~0 := 0; {54027#(and (= main_~a~0 0) (= main_~st~0 1) (= main_~b~0 0))} is VALID [2022-04-15 06:30:51,069 INFO L290 TraceCheckUtils]: 7: Hoare triple {54027#(and (= main_~a~0 0) (= main_~st~0 1) (= main_~b~0 0))} [194] L23-3-->L23-4_primed: Formula: (let ((.cse1 (= v_main_~c~0_1088 v_main_~c~0_1087)) (.cse2 (= |v_main_#t~post5_502| |v_main_#t~post5_500|)) (.cse0 (= v_~last~0_260 v_main_~c~0_1088))) (or (and (or (not (<= (+ v_main_~c~0_1088 1) v_~last~0_260)) (not (<= (+ v_~last~0_260 1) v_main_~c~0_1087))) (not .cse0) (< v_main_~c~0_1087 200001) (< v_main_~c~0_1088 v_main_~c~0_1087)) (and .cse1 .cse2 (= v_~last~0_260 v_~last~0_260)) (and .cse1 .cse2 (or (not (< v_main_~c~0_1088 200000)) .cse0)))) InVars {main_~c~0=v_main_~c~0_1088, main_#t~post5=|v_main_#t~post5_502|, ~last~0=v_~last~0_260} OutVars{main_#t~post5=|v_main_#t~post5_500|, main_~c~0=v_main_~c~0_1087, ~last~0=v_~last~0_260} AuxVars[] AssignedVars[main_#t~post5, main_~c~0] {54027#(and (= main_~a~0 0) (= main_~st~0 1) (= main_~b~0 0))} is VALID [2022-04-15 06:30:51,069 INFO L290 TraceCheckUtils]: 8: Hoare triple {54027#(and (= main_~a~0 0) (= main_~st~0 1) (= main_~b~0 0))} [195] L23-4_primed-->L23-3: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {54027#(and (= main_~a~0 0) (= main_~st~0 1) (= main_~b~0 0))} is VALID [2022-04-15 06:30:51,070 INFO L290 TraceCheckUtils]: 9: Hoare triple {54027#(and (= main_~a~0 0) (= main_~st~0 1) (= main_~b~0 0))} [196] L23-3-->L23-4_primed: Formula: (let ((.cse0 (= v_main_~c~0_1090 v_main_~c~0_1089)) (.cse1 (= v_main_~st~0_344 v_main_~st~0_343)) (.cse4 (= |v_main_#t~post5_505| |v_main_#t~post5_501|)) (.cse3 (= v_~last~0_261 v_main_~c~0_1090)) (.cse2 (< v_main_~c~0_1090 200000))) (or (and .cse0 .cse1 (or (not .cse2) (not .cse3)) .cse4) (and .cse0 .cse1 (= v_~last~0_261 v_~last~0_261) .cse4) (and (= v_main_~st~0_343 0) (< v_main_~c~0_1090 v_main_~c~0_1089) (<= v_main_~c~0_1089 (+ v_~last~0_261 1)) .cse3 .cse2))) InVars {main_~c~0=v_main_~c~0_1090, main_#t~post5=|v_main_#t~post5_505|, main_~st~0=v_main_~st~0_344, ~last~0=v_~last~0_261} OutVars{main_#t~post5=|v_main_#t~post5_501|, main_~c~0=v_main_~c~0_1089, main_~st~0=v_main_~st~0_343, ~last~0=v_~last~0_261} AuxVars[] AssignedVars[main_#t~post5, main_~c~0, main_~st~0] {54028#(or (= main_~st~0 1) (and (= main_~a~0 0) (or (<= ~last~0 199999) (<= main_~c~0 200000)) (= main_~b~0 0)))} is VALID [2022-04-15 06:30:51,071 INFO L290 TraceCheckUtils]: 10: Hoare triple {54028#(or (= main_~st~0 1) (and (= main_~a~0 0) (or (<= ~last~0 199999) (<= main_~c~0 200000)) (= main_~b~0 0)))} [193] L23-4_primed-->L23-4: Formula: (not (< v_main_~c~0_8 200000)) InVars {main_~c~0=v_main_~c~0_8} OutVars{main_~c~0=v_main_~c~0_8} AuxVars[] AssignedVars[] {54029#(or (= main_~st~0 1) (and (= main_~a~0 0) (or (<= ~last~0 199999) (<= main_~c~0 200000)) (= main_~b~0 0) (< 199999 main_~c~0)))} is VALID [2022-04-15 06:30:51,071 INFO L290 TraceCheckUtils]: 11: Hoare triple {54029#(or (= main_~st~0 1) (and (= main_~a~0 0) (or (<= ~last~0 199999) (<= main_~c~0 200000)) (= main_~b~0 0) (< 199999 main_~c~0)))} assume 0 == ~st~0 && ~c~0 == 1 + ~last~0;~a~0 := 3 + ~a~0;~b~0 := 3 + ~b~0; {54030#(and (<= main_~b~0 main_~a~0) (< main_~a~0 (+ main_~b~0 1)) (< 199999 main_~c~0) (<= main_~c~0 200000))} is VALID [2022-04-15 06:30:51,072 INFO L290 TraceCheckUtils]: 12: Hoare triple {54030#(and (<= main_~b~0 main_~a~0) (< main_~a~0 (+ main_~b~0 1)) (< 199999 main_~c~0) (<= main_~c~0 200000))} assume !(~c~0 == ~last~0 && 0 == ~st~0); {54030#(and (<= main_~b~0 main_~a~0) (< main_~a~0 (+ main_~b~0 1)) (< 199999 main_~c~0) (<= main_~c~0 200000))} is VALID [2022-04-15 06:30:51,072 INFO L272 TraceCheckUtils]: 13: Hoare triple {54030#(and (<= main_~b~0 main_~a~0) (< main_~a~0 (+ main_~b~0 1)) (< 199999 main_~c~0) (<= main_~c~0 200000))} call __VERIFIER_assert((if ~a~0 == ~b~0 && 200000 == ~c~0 then 1 else 0)); {54031#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-15 06:30:51,073 INFO L290 TraceCheckUtils]: 14: Hoare triple {54031#(not (= |__VERIFIER_assert_#in~cond| 0))} ~cond := #in~cond; {54032#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-15 06:30:51,073 INFO L290 TraceCheckUtils]: 15: Hoare triple {54032#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {54022#false} is VALID [2022-04-15 06:30:51,073 INFO L290 TraceCheckUtils]: 16: Hoare triple {54022#false} assume !false; {54022#false} is VALID [2022-04-15 06:30:51,073 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-04-15 06:30:51,073 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 06:30:51,073 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1061999536] [2022-04-15 06:30:51,073 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1061999536] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 06:30:51,074 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1600503655] [2022-04-15 06:30:51,074 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 06:30:51,074 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 06:30:51,074 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 06:30:51,075 INFO L229 MonitoredProcess]: Starting monitored process 36 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-15 06:30:51,076 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (36)] Waiting until timeout for monitored process [2022-04-15 06:30:51,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:30:51,112 INFO L263 TraceCheckSpWp]: Trace formula consists of 85 conjuncts, 18 conjunts are in the unsatisfiable core [2022-04-15 06:30:51,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:30:51,127 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 06:30:51,406 INFO L272 TraceCheckUtils]: 0: Hoare triple {54021#true} call ULTIMATE.init(); {54021#true} is VALID [2022-04-15 06:30:51,406 INFO L290 TraceCheckUtils]: 1: Hoare triple {54021#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(11, 2);call #Ultimate.allocInit(12, 3);~last~0 := 0; {54021#true} is VALID [2022-04-15 06:30:51,406 INFO L290 TraceCheckUtils]: 2: Hoare triple {54021#true} assume true; {54021#true} is VALID [2022-04-15 06:30:51,406 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {54021#true} {54021#true} #66#return; {54021#true} is VALID [2022-04-15 06:30:51,406 INFO L272 TraceCheckUtils]: 4: Hoare triple {54021#true} call #t~ret6 := main(); {54021#true} is VALID [2022-04-15 06:30:51,406 INFO L290 TraceCheckUtils]: 5: Hoare triple {54021#true} assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~last~0 := #t~nondet4;havoc #t~nondet4;~a~0 := 0;~b~0 := 0;~c~0 := 0;~st~0 := 0; {54026#(and (= main_~a~0 0) (= main_~b~0 0))} is VALID [2022-04-15 06:30:51,407 INFO L290 TraceCheckUtils]: 6: Hoare triple {54026#(and (= main_~a~0 0) (= main_~b~0 0))} assume !false;~st~0 := 1;~c~0 := 0; {54027#(and (= main_~a~0 0) (= main_~st~0 1) (= main_~b~0 0))} is VALID [2022-04-15 06:30:51,407 INFO L290 TraceCheckUtils]: 7: Hoare triple {54027#(and (= main_~a~0 0) (= main_~st~0 1) (= main_~b~0 0))} [194] L23-3-->L23-4_primed: Formula: (let ((.cse1 (= v_main_~c~0_1088 v_main_~c~0_1087)) (.cse2 (= |v_main_#t~post5_502| |v_main_#t~post5_500|)) (.cse0 (= v_~last~0_260 v_main_~c~0_1088))) (or (and (or (not (<= (+ v_main_~c~0_1088 1) v_~last~0_260)) (not (<= (+ v_~last~0_260 1) v_main_~c~0_1087))) (not .cse0) (< v_main_~c~0_1087 200001) (< v_main_~c~0_1088 v_main_~c~0_1087)) (and .cse1 .cse2 (= v_~last~0_260 v_~last~0_260)) (and .cse1 .cse2 (or (not (< v_main_~c~0_1088 200000)) .cse0)))) InVars {main_~c~0=v_main_~c~0_1088, main_#t~post5=|v_main_#t~post5_502|, ~last~0=v_~last~0_260} OutVars{main_#t~post5=|v_main_#t~post5_500|, main_~c~0=v_main_~c~0_1087, ~last~0=v_~last~0_260} AuxVars[] AssignedVars[main_#t~post5, main_~c~0] {54027#(and (= main_~a~0 0) (= main_~st~0 1) (= main_~b~0 0))} is VALID [2022-04-15 06:30:51,408 INFO L290 TraceCheckUtils]: 8: Hoare triple {54027#(and (= main_~a~0 0) (= main_~st~0 1) (= main_~b~0 0))} [195] L23-4_primed-->L23-3: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {54027#(and (= main_~a~0 0) (= main_~st~0 1) (= main_~b~0 0))} is VALID [2022-04-15 06:30:51,408 INFO L290 TraceCheckUtils]: 9: Hoare triple {54027#(and (= main_~a~0 0) (= main_~st~0 1) (= main_~b~0 0))} [196] L23-3-->L23-4_primed: Formula: (let ((.cse0 (= v_main_~c~0_1090 v_main_~c~0_1089)) (.cse1 (= v_main_~st~0_344 v_main_~st~0_343)) (.cse4 (= |v_main_#t~post5_505| |v_main_#t~post5_501|)) (.cse3 (= v_~last~0_261 v_main_~c~0_1090)) (.cse2 (< v_main_~c~0_1090 200000))) (or (and .cse0 .cse1 (or (not .cse2) (not .cse3)) .cse4) (and .cse0 .cse1 (= v_~last~0_261 v_~last~0_261) .cse4) (and (= v_main_~st~0_343 0) (< v_main_~c~0_1090 v_main_~c~0_1089) (<= v_main_~c~0_1089 (+ v_~last~0_261 1)) .cse3 .cse2))) InVars {main_~c~0=v_main_~c~0_1090, main_#t~post5=|v_main_#t~post5_505|, main_~st~0=v_main_~st~0_344, ~last~0=v_~last~0_261} OutVars{main_#t~post5=|v_main_#t~post5_501|, main_~c~0=v_main_~c~0_1089, main_~st~0=v_main_~st~0_343, ~last~0=v_~last~0_261} AuxVars[] AssignedVars[main_#t~post5, main_~c~0, main_~st~0] {54064#(and (= main_~a~0 0) (= main_~b~0 0) (or (and (< ~last~0 200000) (< ~last~0 main_~c~0) (<= main_~c~0 (+ ~last~0 1)) (= main_~st~0 0)) (= main_~st~0 1)))} is VALID [2022-04-15 06:30:51,409 INFO L290 TraceCheckUtils]: 10: Hoare triple {54064#(and (= main_~a~0 0) (= main_~b~0 0) (or (and (< ~last~0 200000) (< ~last~0 main_~c~0) (<= main_~c~0 (+ ~last~0 1)) (= main_~st~0 0)) (= main_~st~0 1)))} [193] L23-4_primed-->L23-4: Formula: (not (< v_main_~c~0_8 200000)) InVars {main_~c~0=v_main_~c~0_8} OutVars{main_~c~0=v_main_~c~0_8} AuxVars[] AssignedVars[] {54068#(and (= main_~a~0 0) (or (= main_~st~0 1) (and (< ~last~0 200000) (<= main_~c~0 (+ ~last~0 1)) (= main_~st~0 0))) (= main_~b~0 0) (not (< main_~c~0 200000)))} is VALID [2022-04-15 06:30:51,410 INFO L290 TraceCheckUtils]: 11: Hoare triple {54068#(and (= main_~a~0 0) (or (= main_~st~0 1) (and (< ~last~0 200000) (<= main_~c~0 (+ ~last~0 1)) (= main_~st~0 0))) (= main_~b~0 0) (not (< main_~c~0 200000)))} assume 0 == ~st~0 && ~c~0 == 1 + ~last~0;~a~0 := 3 + ~a~0;~b~0 := 3 + ~b~0; {54072#(and (= main_~b~0 3) (<= 200000 main_~c~0) (< main_~c~0 200001) (= main_~a~0 3))} is VALID [2022-04-15 06:30:51,410 INFO L290 TraceCheckUtils]: 12: Hoare triple {54072#(and (= main_~b~0 3) (<= 200000 main_~c~0) (< main_~c~0 200001) (= main_~a~0 3))} assume !(~c~0 == ~last~0 && 0 == ~st~0); {54072#(and (= main_~b~0 3) (<= 200000 main_~c~0) (< main_~c~0 200001) (= main_~a~0 3))} is VALID [2022-04-15 06:30:51,411 INFO L272 TraceCheckUtils]: 13: Hoare triple {54072#(and (= main_~b~0 3) (<= 200000 main_~c~0) (< main_~c~0 200001) (= main_~a~0 3))} call __VERIFIER_assert((if ~a~0 == ~b~0 && 200000 == ~c~0 then 1 else 0)); {54079#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-15 06:30:51,411 INFO L290 TraceCheckUtils]: 14: Hoare triple {54079#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {54083#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-15 06:30:51,411 INFO L290 TraceCheckUtils]: 15: Hoare triple {54083#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {54022#false} is VALID [2022-04-15 06:30:51,411 INFO L290 TraceCheckUtils]: 16: Hoare triple {54022#false} assume !false; {54022#false} is VALID [2022-04-15 06:30:51,411 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-04-15 06:30:51,412 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 06:30:51,832 INFO L290 TraceCheckUtils]: 16: Hoare triple {54022#false} assume !false; {54022#false} is VALID [2022-04-15 06:30:51,832 INFO L290 TraceCheckUtils]: 15: Hoare triple {54083#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {54022#false} is VALID [2022-04-15 06:30:51,833 INFO L290 TraceCheckUtils]: 14: Hoare triple {54079#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {54083#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-15 06:30:51,833 INFO L272 TraceCheckUtils]: 13: Hoare triple {54030#(and (<= main_~b~0 main_~a~0) (< main_~a~0 (+ main_~b~0 1)) (< 199999 main_~c~0) (<= main_~c~0 200000))} call __VERIFIER_assert((if ~a~0 == ~b~0 && 200000 == ~c~0 then 1 else 0)); {54079#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-15 06:30:51,834 INFO L290 TraceCheckUtils]: 12: Hoare triple {54030#(and (<= main_~b~0 main_~a~0) (< main_~a~0 (+ main_~b~0 1)) (< 199999 main_~c~0) (<= main_~c~0 200000))} assume !(~c~0 == ~last~0 && 0 == ~st~0); {54030#(and (<= main_~b~0 main_~a~0) (< main_~a~0 (+ main_~b~0 1)) (< 199999 main_~c~0) (<= main_~c~0 200000))} is VALID [2022-04-15 06:30:51,835 INFO L290 TraceCheckUtils]: 11: Hoare triple {54105#(or (not (<= main_~c~0 (+ ~last~0 1))) (and (<= main_~b~0 main_~a~0) (< main_~a~0 (+ main_~b~0 1)) (< 199999 main_~c~0) (<= main_~c~0 200000)) (not (= main_~st~0 0)))} assume 0 == ~st~0 && ~c~0 == 1 + ~last~0;~a~0 := 3 + ~a~0;~b~0 := 3 + ~b~0; {54030#(and (<= main_~b~0 main_~a~0) (< main_~a~0 (+ main_~b~0 1)) (< 199999 main_~c~0) (<= main_~c~0 200000))} is VALID [2022-04-15 06:30:51,835 INFO L290 TraceCheckUtils]: 10: Hoare triple {54109#(or (not (<= main_~c~0 (+ ~last~0 1))) (and (<= main_~b~0 main_~a~0) (< main_~a~0 (+ main_~b~0 1)) (<= main_~c~0 200000)) (not (= main_~st~0 0)) (< main_~c~0 200000))} [193] L23-4_primed-->L23-4: Formula: (not (< v_main_~c~0_8 200000)) InVars {main_~c~0=v_main_~c~0_8} OutVars{main_~c~0=v_main_~c~0_8} AuxVars[] AssignedVars[] {54105#(or (not (<= main_~c~0 (+ ~last~0 1))) (and (<= main_~b~0 main_~a~0) (< main_~a~0 (+ main_~b~0 1)) (< 199999 main_~c~0) (<= main_~c~0 200000)) (not (= main_~st~0 0)))} is VALID [2022-04-15 06:30:51,836 INFO L290 TraceCheckUtils]: 9: Hoare triple {54113#(and (<= main_~b~0 main_~a~0) (< main_~a~0 (+ main_~b~0 1)) (not (= main_~st~0 0)))} [196] L23-3-->L23-4_primed: Formula: (let ((.cse0 (= v_main_~c~0_1090 v_main_~c~0_1089)) (.cse1 (= v_main_~st~0_344 v_main_~st~0_343)) (.cse4 (= |v_main_#t~post5_505| |v_main_#t~post5_501|)) (.cse3 (= v_~last~0_261 v_main_~c~0_1090)) (.cse2 (< v_main_~c~0_1090 200000))) (or (and .cse0 .cse1 (or (not .cse2) (not .cse3)) .cse4) (and .cse0 .cse1 (= v_~last~0_261 v_~last~0_261) .cse4) (and (= v_main_~st~0_343 0) (< v_main_~c~0_1090 v_main_~c~0_1089) (<= v_main_~c~0_1089 (+ v_~last~0_261 1)) .cse3 .cse2))) InVars {main_~c~0=v_main_~c~0_1090, main_#t~post5=|v_main_#t~post5_505|, main_~st~0=v_main_~st~0_344, ~last~0=v_~last~0_261} OutVars{main_#t~post5=|v_main_#t~post5_501|, main_~c~0=v_main_~c~0_1089, main_~st~0=v_main_~st~0_343, ~last~0=v_~last~0_261} AuxVars[] AssignedVars[main_#t~post5, main_~c~0, main_~st~0] {54109#(or (not (<= main_~c~0 (+ ~last~0 1))) (and (<= main_~b~0 main_~a~0) (< main_~a~0 (+ main_~b~0 1)) (<= main_~c~0 200000)) (not (= main_~st~0 0)) (< main_~c~0 200000))} is VALID [2022-04-15 06:30:51,836 INFO L290 TraceCheckUtils]: 8: Hoare triple {54113#(and (<= main_~b~0 main_~a~0) (< main_~a~0 (+ main_~b~0 1)) (not (= main_~st~0 0)))} [195] L23-4_primed-->L23-3: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {54113#(and (<= main_~b~0 main_~a~0) (< main_~a~0 (+ main_~b~0 1)) (not (= main_~st~0 0)))} is VALID [2022-04-15 06:30:51,837 INFO L290 TraceCheckUtils]: 7: Hoare triple {54113#(and (<= main_~b~0 main_~a~0) (< main_~a~0 (+ main_~b~0 1)) (not (= main_~st~0 0)))} [194] L23-3-->L23-4_primed: Formula: (let ((.cse1 (= v_main_~c~0_1088 v_main_~c~0_1087)) (.cse2 (= |v_main_#t~post5_502| |v_main_#t~post5_500|)) (.cse0 (= v_~last~0_260 v_main_~c~0_1088))) (or (and (or (not (<= (+ v_main_~c~0_1088 1) v_~last~0_260)) (not (<= (+ v_~last~0_260 1) v_main_~c~0_1087))) (not .cse0) (< v_main_~c~0_1087 200001) (< v_main_~c~0_1088 v_main_~c~0_1087)) (and .cse1 .cse2 (= v_~last~0_260 v_~last~0_260)) (and .cse1 .cse2 (or (not (< v_main_~c~0_1088 200000)) .cse0)))) InVars {main_~c~0=v_main_~c~0_1088, main_#t~post5=|v_main_#t~post5_502|, ~last~0=v_~last~0_260} OutVars{main_#t~post5=|v_main_#t~post5_500|, main_~c~0=v_main_~c~0_1087, ~last~0=v_~last~0_260} AuxVars[] AssignedVars[main_#t~post5, main_~c~0] {54113#(and (<= main_~b~0 main_~a~0) (< main_~a~0 (+ main_~b~0 1)) (not (= main_~st~0 0)))} is VALID [2022-04-15 06:30:51,837 INFO L290 TraceCheckUtils]: 6: Hoare triple {54123#(and (<= main_~b~0 main_~a~0) (< main_~a~0 (+ main_~b~0 1)))} assume !false;~st~0 := 1;~c~0 := 0; {54113#(and (<= main_~b~0 main_~a~0) (< main_~a~0 (+ main_~b~0 1)) (not (= main_~st~0 0)))} is VALID [2022-04-15 06:30:51,837 INFO L290 TraceCheckUtils]: 5: Hoare triple {54021#true} assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~last~0 := #t~nondet4;havoc #t~nondet4;~a~0 := 0;~b~0 := 0;~c~0 := 0;~st~0 := 0; {54123#(and (<= main_~b~0 main_~a~0) (< main_~a~0 (+ main_~b~0 1)))} is VALID [2022-04-15 06:30:51,838 INFO L272 TraceCheckUtils]: 4: Hoare triple {54021#true} call #t~ret6 := main(); {54021#true} is VALID [2022-04-15 06:30:51,838 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {54021#true} {54021#true} #66#return; {54021#true} is VALID [2022-04-15 06:30:51,838 INFO L290 TraceCheckUtils]: 2: Hoare triple {54021#true} assume true; {54021#true} is VALID [2022-04-15 06:30:51,838 INFO L290 TraceCheckUtils]: 1: Hoare triple {54021#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(11, 2);call #Ultimate.allocInit(12, 3);~last~0 := 0; {54021#true} is VALID [2022-04-15 06:30:51,838 INFO L272 TraceCheckUtils]: 0: Hoare triple {54021#true} call ULTIMATE.init(); {54021#true} is VALID [2022-04-15 06:30:51,838 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-04-15 06:30:51,838 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1600503655] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 06:30:51,838 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 06:30:51,838 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9, 9] total 19 [2022-04-15 06:30:53,478 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 06:30:53,478 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1938125198] [2022-04-15 06:30:53,478 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1938125198] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 06:30:53,478 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 06:30:53,478 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [60] imperfect sequences [] total 60 [2022-04-15 06:30:53,479 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [327236248] [2022-04-15 06:30:53,479 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 06:30:53,479 INFO L78 Accepts]: Start accepts. Automaton has has 60 states, 60 states have (on average 1.4166666666666667) internal successors, (85), 58 states have internal predecessors, (85), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 89 [2022-04-15 06:30:53,479 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 06:30:53,479 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 60 states, 60 states have (on average 1.4166666666666667) internal successors, (85), 58 states have internal predecessors, (85), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:30:53,526 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 89 edges. 89 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 06:30:53,526 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 60 states [2022-04-15 06:30:53,526 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 06:30:53,527 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 60 interpolants. [2022-04-15 06:30:53,527 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=456, Invalid=4374, Unknown=0, NotChecked=0, Total=4830 [2022-04-15 06:30:53,528 INFO L87 Difference]: Start difference. First operand 396 states and 449 transitions. Second operand has 60 states, 60 states have (on average 1.4166666666666667) internal successors, (85), 58 states have internal predecessors, (85), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:31:00,646 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:31:00,647 INFO L93 Difference]: Finished difference Result 529 states and 603 transitions. [2022-04-15 06:31:00,647 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 86 states. [2022-04-15 06:31:00,647 INFO L78 Accepts]: Start accepts. Automaton has has 60 states, 60 states have (on average 1.4166666666666667) internal successors, (85), 58 states have internal predecessors, (85), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 89 [2022-04-15 06:31:00,665 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 06:31:00,665 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 60 states, 60 states have (on average 1.4166666666666667) internal successors, (85), 58 states have internal predecessors, (85), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:31:00,667 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 195 transitions. [2022-04-15 06:31:00,667 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 60 states, 60 states have (on average 1.4166666666666667) internal successors, (85), 58 states have internal predecessors, (85), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:31:00,668 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 195 transitions. [2022-04-15 06:31:00,668 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 86 states and 195 transitions. [2022-04-15 06:31:00,768 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 195 edges. 195 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 06:31:00,776 INFO L225 Difference]: With dead ends: 529 [2022-04-15 06:31:00,776 INFO L226 Difference]: Without dead ends: 443 [2022-04-15 06:31:00,777 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 149 GetRequests, 51 SyntacticMatches, 2 SemanticMatches, 96 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2698 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=723, Invalid=8783, Unknown=0, NotChecked=0, Total=9506 [2022-04-15 06:31:00,778 INFO L913 BasicCegarLoop]: 16 mSDtfsCounter, 180 mSDsluCounter, 38 mSDsCounter, 0 mSdLazyCounter, 5030 mSolverCounterSat, 113 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 182 SdHoareTripleChecker+Valid, 54 SdHoareTripleChecker+Invalid, 5143 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 113 IncrementalHoareTripleChecker+Valid, 5030 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.5s IncrementalHoareTripleChecker+Time [2022-04-15 06:31:00,778 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [182 Valid, 54 Invalid, 5143 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [113 Valid, 5030 Invalid, 0 Unknown, 0 Unchecked, 2.5s Time] [2022-04-15 06:31:00,778 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 443 states. [2022-04-15 06:31:02,765 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 443 to 399. [2022-04-15 06:31:02,765 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 06:31:02,766 INFO L82 GeneralOperation]: Start isEquivalent. First operand 443 states. Second operand has 399 states, 391 states have (on average 1.1406649616368287) internal successors, (446), 392 states have internal predecessors, (446), 4 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-15 06:31:02,766 INFO L74 IsIncluded]: Start isIncluded. First operand 443 states. Second operand has 399 states, 391 states have (on average 1.1406649616368287) internal successors, (446), 392 states have internal predecessors, (446), 4 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-15 06:31:02,766 INFO L87 Difference]: Start difference. First operand 443 states. Second operand has 399 states, 391 states have (on average 1.1406649616368287) internal successors, (446), 392 states have internal predecessors, (446), 4 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-15 06:31:02,772 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:31:02,773 INFO L93 Difference]: Finished difference Result 443 states and 499 transitions. [2022-04-15 06:31:02,773 INFO L276 IsEmpty]: Start isEmpty. Operand 443 states and 499 transitions. [2022-04-15 06:31:02,773 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 06:31:02,773 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 06:31:02,773 INFO L74 IsIncluded]: Start isIncluded. First operand has 399 states, 391 states have (on average 1.1406649616368287) internal successors, (446), 392 states have internal predecessors, (446), 4 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) Second operand 443 states. [2022-04-15 06:31:02,774 INFO L87 Difference]: Start difference. First operand has 399 states, 391 states have (on average 1.1406649616368287) internal successors, (446), 392 states have internal predecessors, (446), 4 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) Second operand 443 states. [2022-04-15 06:31:02,780 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:31:02,780 INFO L93 Difference]: Finished difference Result 443 states and 499 transitions. [2022-04-15 06:31:02,780 INFO L276 IsEmpty]: Start isEmpty. Operand 443 states and 499 transitions. [2022-04-15 06:31:02,780 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 06:31:02,780 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 06:31:02,780 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 06:31:02,780 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 06:31:02,781 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 399 states, 391 states have (on average 1.1406649616368287) internal successors, (446), 392 states have internal predecessors, (446), 4 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-15 06:31:02,788 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 399 states to 399 states and 453 transitions. [2022-04-15 06:31:02,789 INFO L78 Accepts]: Start accepts. Automaton has 399 states and 453 transitions. Word has length 89 [2022-04-15 06:31:02,789 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 06:31:02,789 INFO L478 AbstractCegarLoop]: Abstraction has 399 states and 453 transitions. [2022-04-15 06:31:02,789 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 60 states, 60 states have (on average 1.4166666666666667) internal successors, (85), 58 states have internal predecessors, (85), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:31:02,789 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 399 states and 453 transitions. [2022-04-15 06:31:04,183 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 453 edges. 453 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 06:31:04,184 INFO L276 IsEmpty]: Start isEmpty. Operand 399 states and 453 transitions. [2022-04-15 06:31:04,184 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2022-04-15 06:31:04,184 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 06:31:04,185 INFO L499 BasicCegarLoop]: trace histogram [26, 26, 25, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 06:31:04,206 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (36)] Forceful destruction successful, exit code 0 [2022-04-15 06:31:04,406 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 36 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable39 [2022-04-15 06:31:04,406 INFO L403 AbstractCegarLoop]: === Iteration 41 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 06:31:04,406 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 06:31:04,406 INFO L85 PathProgramCache]: Analyzing trace with hash 1594379399, now seen corresponding path program 25 times [2022-04-15 06:31:04,406 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 06:31:04,407 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1821436814] [2022-04-15 06:31:07,086 WARN L970 rdanLoopAcceleration]: Unable to prove correctness of quantifier elimination. [2022-04-15 06:31:11,105 WARN L977 rdanLoopAcceleration]: Unable to prove correctness of quantifier elimination. [2022-04-15 06:31:11,239 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 1 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-15 06:31:11,493 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {0={1=1}, 1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-15 06:31:11,494 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-15 06:31:11,496 INFO L85 PathProgramCache]: Analyzing trace with hash -414110520, now seen corresponding path program 1 times [2022-04-15 06:31:11,496 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 06:31:11,497 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2105782767] [2022-04-15 06:31:11,497 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 06:31:11,497 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 06:31:11,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:31:11,611 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 06:31:11,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:31:11,614 INFO L290 TraceCheckUtils]: 0: Hoare triple {57005#(and (= ~last~0 |old(~last~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(11, 2);call #Ultimate.allocInit(12, 3);~last~0 := 0; {56993#true} is VALID [2022-04-15 06:31:11,614 INFO L290 TraceCheckUtils]: 1: Hoare triple {56993#true} assume true; {56993#true} is VALID [2022-04-15 06:31:11,615 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {56993#true} {56993#true} #66#return; {56993#true} is VALID [2022-04-15 06:31:11,615 INFO L272 TraceCheckUtils]: 0: Hoare triple {56993#true} call ULTIMATE.init(); {57005#(and (= ~last~0 |old(~last~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 06:31:11,615 INFO L290 TraceCheckUtils]: 1: Hoare triple {57005#(and (= ~last~0 |old(~last~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(11, 2);call #Ultimate.allocInit(12, 3);~last~0 := 0; {56993#true} is VALID [2022-04-15 06:31:11,615 INFO L290 TraceCheckUtils]: 2: Hoare triple {56993#true} assume true; {56993#true} is VALID [2022-04-15 06:31:11,615 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {56993#true} {56993#true} #66#return; {56993#true} is VALID [2022-04-15 06:31:11,615 INFO L272 TraceCheckUtils]: 4: Hoare triple {56993#true} call #t~ret6 := main(); {56993#true} is VALID [2022-04-15 06:31:11,616 INFO L290 TraceCheckUtils]: 5: Hoare triple {56993#true} assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~last~0 := #t~nondet4;havoc #t~nondet4;~a~0 := 0;~b~0 := 0;~c~0 := 0;~st~0 := 0; {56998#(and (= main_~a~0 0) (= main_~b~0 0))} is VALID [2022-04-15 06:31:11,616 INFO L290 TraceCheckUtils]: 6: Hoare triple {56998#(and (= main_~a~0 0) (= main_~b~0 0))} assume !false;~st~0 := 1;~c~0 := 0; {56999#(and (= main_~a~0 0) (= main_~st~0 1) (= main_~b~0 0))} is VALID [2022-04-15 06:31:11,617 INFO L290 TraceCheckUtils]: 7: Hoare triple {56999#(and (= main_~a~0 0) (= main_~st~0 1) (= main_~b~0 0))} [198] L23-3-->L23-4_primed: Formula: (let ((.cse0 (= v_~last~0_268 v_main_~c~0_1130)) (.cse1 (= |v_main_#t~post5_515| |v_main_#t~post5_513|)) (.cse2 (= v_main_~c~0_1130 v_main_~c~0_1129))) (or (and (or (not (< v_main_~c~0_1130 200000)) .cse0) .cse1 .cse2) (and (< v_main_~c~0_1129 200001) (< v_main_~c~0_1130 v_main_~c~0_1129) (or (not (<= (+ v_main_~c~0_1130 1) v_~last~0_268)) (not (<= (+ v_~last~0_268 1) v_main_~c~0_1129))) (not .cse0)) (and .cse1 .cse2 (= v_~last~0_268 v_~last~0_268)))) InVars {main_~c~0=v_main_~c~0_1130, main_#t~post5=|v_main_#t~post5_515|, ~last~0=v_~last~0_268} OutVars{main_#t~post5=|v_main_#t~post5_513|, main_~c~0=v_main_~c~0_1129, ~last~0=v_~last~0_268} AuxVars[] AssignedVars[main_#t~post5, main_~c~0] {56999#(and (= main_~a~0 0) (= main_~st~0 1) (= main_~b~0 0))} is VALID [2022-04-15 06:31:11,617 INFO L290 TraceCheckUtils]: 8: Hoare triple {56999#(and (= main_~a~0 0) (= main_~st~0 1) (= main_~b~0 0))} [199] L23-4_primed-->L23-3: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {56999#(and (= main_~a~0 0) (= main_~st~0 1) (= main_~b~0 0))} is VALID [2022-04-15 06:31:11,618 INFO L290 TraceCheckUtils]: 9: Hoare triple {56999#(and (= main_~a~0 0) (= main_~st~0 1) (= main_~b~0 0))} [200] L23-3-->L23-4_primed: Formula: (let ((.cse0 (= v_main_~c~0_1132 v_main_~c~0_1131)) (.cse1 (= v_main_~st~0_354 v_main_~st~0_353)) (.cse3 (< v_main_~c~0_1132 200000)) (.cse2 (= v_~last~0_269 v_main_~c~0_1132))) (or (and .cse0 .cse1 (= |v_main_#t~post5_514| |v_main_#t~post5_518|) (or (not .cse2) (not .cse3))) (and (= v_~last~0_269 v_~last~0_269) .cse0 .cse1 (= |v_main_#t~post5_518| |v_main_#t~post5_514|)) (and .cse3 (= v_main_~st~0_353 0) (<= v_main_~c~0_1131 (+ v_~last~0_269 1)) (< v_main_~c~0_1132 v_main_~c~0_1131) .cse2))) InVars {main_~c~0=v_main_~c~0_1132, main_#t~post5=|v_main_#t~post5_518|, main_~st~0=v_main_~st~0_354, ~last~0=v_~last~0_269} OutVars{main_#t~post5=|v_main_#t~post5_514|, main_~c~0=v_main_~c~0_1131, main_~st~0=v_main_~st~0_353, ~last~0=v_~last~0_269} AuxVars[] AssignedVars[main_#t~post5, main_~c~0, main_~st~0] {57000#(or (= main_~st~0 1) (and (= main_~a~0 0) (or (<= ~last~0 199999) (<= main_~c~0 200000)) (= main_~b~0 0)))} is VALID [2022-04-15 06:31:11,618 INFO L290 TraceCheckUtils]: 10: Hoare triple {57000#(or (= main_~st~0 1) (and (= main_~a~0 0) (or (<= ~last~0 199999) (<= main_~c~0 200000)) (= main_~b~0 0)))} [197] L23-4_primed-->L23-4: Formula: (not (< v_main_~c~0_8 200000)) InVars {main_~c~0=v_main_~c~0_8} OutVars{main_~c~0=v_main_~c~0_8} AuxVars[] AssignedVars[] {57001#(or (= main_~st~0 1) (and (= main_~a~0 0) (or (<= ~last~0 199999) (<= main_~c~0 200000)) (= main_~b~0 0) (< 199999 main_~c~0)))} is VALID [2022-04-15 06:31:11,619 INFO L290 TraceCheckUtils]: 11: Hoare triple {57001#(or (= main_~st~0 1) (and (= main_~a~0 0) (or (<= ~last~0 199999) (<= main_~c~0 200000)) (= main_~b~0 0) (< 199999 main_~c~0)))} assume 0 == ~st~0 && ~c~0 == 1 + ~last~0;~a~0 := 3 + ~a~0;~b~0 := 3 + ~b~0; {57002#(and (<= main_~b~0 main_~a~0) (< main_~a~0 (+ main_~b~0 1)) (< 199999 main_~c~0) (<= main_~c~0 200000))} is VALID [2022-04-15 06:31:11,619 INFO L290 TraceCheckUtils]: 12: Hoare triple {57002#(and (<= main_~b~0 main_~a~0) (< main_~a~0 (+ main_~b~0 1)) (< 199999 main_~c~0) (<= main_~c~0 200000))} assume !(~c~0 == ~last~0 && 0 == ~st~0); {57002#(and (<= main_~b~0 main_~a~0) (< main_~a~0 (+ main_~b~0 1)) (< 199999 main_~c~0) (<= main_~c~0 200000))} is VALID [2022-04-15 06:31:11,620 INFO L272 TraceCheckUtils]: 13: Hoare triple {57002#(and (<= main_~b~0 main_~a~0) (< main_~a~0 (+ main_~b~0 1)) (< 199999 main_~c~0) (<= main_~c~0 200000))} call __VERIFIER_assert((if ~a~0 == ~b~0 && 200000 == ~c~0 then 1 else 0)); {57003#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-15 06:31:11,620 INFO L290 TraceCheckUtils]: 14: Hoare triple {57003#(not (= |__VERIFIER_assert_#in~cond| 0))} ~cond := #in~cond; {57004#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-15 06:31:11,621 INFO L290 TraceCheckUtils]: 15: Hoare triple {57004#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {56994#false} is VALID [2022-04-15 06:31:11,621 INFO L290 TraceCheckUtils]: 16: Hoare triple {56994#false} assume !false; {56994#false} is VALID [2022-04-15 06:31:11,621 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-04-15 06:31:11,621 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 06:31:11,621 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2105782767] [2022-04-15 06:31:11,621 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2105782767] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 06:31:11,621 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [607187887] [2022-04-15 06:31:11,621 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 06:31:11,621 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 06:31:11,621 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 06:31:11,622 INFO L229 MonitoredProcess]: Starting monitored process 37 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-15 06:31:11,638 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (37)] Waiting until timeout for monitored process [2022-04-15 06:31:11,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:31:11,679 INFO L263 TraceCheckSpWp]: Trace formula consists of 85 conjuncts, 18 conjunts are in the unsatisfiable core [2022-04-15 06:31:11,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:31:11,685 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 06:31:11,971 INFO L272 TraceCheckUtils]: 0: Hoare triple {56993#true} call ULTIMATE.init(); {56993#true} is VALID [2022-04-15 06:31:11,971 INFO L290 TraceCheckUtils]: 1: Hoare triple {56993#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(11, 2);call #Ultimate.allocInit(12, 3);~last~0 := 0; {56993#true} is VALID [2022-04-15 06:31:11,971 INFO L290 TraceCheckUtils]: 2: Hoare triple {56993#true} assume true; {56993#true} is VALID [2022-04-15 06:31:11,971 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {56993#true} {56993#true} #66#return; {56993#true} is VALID [2022-04-15 06:31:11,971 INFO L272 TraceCheckUtils]: 4: Hoare triple {56993#true} call #t~ret6 := main(); {56993#true} is VALID [2022-04-15 06:31:11,971 INFO L290 TraceCheckUtils]: 5: Hoare triple {56993#true} assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~last~0 := #t~nondet4;havoc #t~nondet4;~a~0 := 0;~b~0 := 0;~c~0 := 0;~st~0 := 0; {56998#(and (= main_~a~0 0) (= main_~b~0 0))} is VALID [2022-04-15 06:31:11,972 INFO L290 TraceCheckUtils]: 6: Hoare triple {56998#(and (= main_~a~0 0) (= main_~b~0 0))} assume !false;~st~0 := 1;~c~0 := 0; {56999#(and (= main_~a~0 0) (= main_~st~0 1) (= main_~b~0 0))} is VALID [2022-04-15 06:31:11,972 INFO L290 TraceCheckUtils]: 7: Hoare triple {56999#(and (= main_~a~0 0) (= main_~st~0 1) (= main_~b~0 0))} [198] L23-3-->L23-4_primed: Formula: (let ((.cse0 (= v_~last~0_268 v_main_~c~0_1130)) (.cse1 (= |v_main_#t~post5_515| |v_main_#t~post5_513|)) (.cse2 (= v_main_~c~0_1130 v_main_~c~0_1129))) (or (and (or (not (< v_main_~c~0_1130 200000)) .cse0) .cse1 .cse2) (and (< v_main_~c~0_1129 200001) (< v_main_~c~0_1130 v_main_~c~0_1129) (or (not (<= (+ v_main_~c~0_1130 1) v_~last~0_268)) (not (<= (+ v_~last~0_268 1) v_main_~c~0_1129))) (not .cse0)) (and .cse1 .cse2 (= v_~last~0_268 v_~last~0_268)))) InVars {main_~c~0=v_main_~c~0_1130, main_#t~post5=|v_main_#t~post5_515|, ~last~0=v_~last~0_268} OutVars{main_#t~post5=|v_main_#t~post5_513|, main_~c~0=v_main_~c~0_1129, ~last~0=v_~last~0_268} AuxVars[] AssignedVars[main_#t~post5, main_~c~0] {56999#(and (= main_~a~0 0) (= main_~st~0 1) (= main_~b~0 0))} is VALID [2022-04-15 06:31:11,973 INFO L290 TraceCheckUtils]: 8: Hoare triple {56999#(and (= main_~a~0 0) (= main_~st~0 1) (= main_~b~0 0))} [199] L23-4_primed-->L23-3: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {56999#(and (= main_~a~0 0) (= main_~st~0 1) (= main_~b~0 0))} is VALID [2022-04-15 06:31:11,974 INFO L290 TraceCheckUtils]: 9: Hoare triple {56999#(and (= main_~a~0 0) (= main_~st~0 1) (= main_~b~0 0))} [200] L23-3-->L23-4_primed: Formula: (let ((.cse0 (= v_main_~c~0_1132 v_main_~c~0_1131)) (.cse1 (= v_main_~st~0_354 v_main_~st~0_353)) (.cse3 (< v_main_~c~0_1132 200000)) (.cse2 (= v_~last~0_269 v_main_~c~0_1132))) (or (and .cse0 .cse1 (= |v_main_#t~post5_514| |v_main_#t~post5_518|) (or (not .cse2) (not .cse3))) (and (= v_~last~0_269 v_~last~0_269) .cse0 .cse1 (= |v_main_#t~post5_518| |v_main_#t~post5_514|)) (and .cse3 (= v_main_~st~0_353 0) (<= v_main_~c~0_1131 (+ v_~last~0_269 1)) (< v_main_~c~0_1132 v_main_~c~0_1131) .cse2))) InVars {main_~c~0=v_main_~c~0_1132, main_#t~post5=|v_main_#t~post5_518|, main_~st~0=v_main_~st~0_354, ~last~0=v_~last~0_269} OutVars{main_#t~post5=|v_main_#t~post5_514|, main_~c~0=v_main_~c~0_1131, main_~st~0=v_main_~st~0_353, ~last~0=v_~last~0_269} AuxVars[] AssignedVars[main_#t~post5, main_~c~0, main_~st~0] {57036#(and (= main_~a~0 0) (= main_~b~0 0) (or (and (< ~last~0 200000) (< ~last~0 main_~c~0) (<= main_~c~0 (+ ~last~0 1)) (= main_~st~0 0)) (= main_~st~0 1)))} is VALID [2022-04-15 06:31:11,974 INFO L290 TraceCheckUtils]: 10: Hoare triple {57036#(and (= main_~a~0 0) (= main_~b~0 0) (or (and (< ~last~0 200000) (< ~last~0 main_~c~0) (<= main_~c~0 (+ ~last~0 1)) (= main_~st~0 0)) (= main_~st~0 1)))} [197] L23-4_primed-->L23-4: Formula: (not (< v_main_~c~0_8 200000)) InVars {main_~c~0=v_main_~c~0_8} OutVars{main_~c~0=v_main_~c~0_8} AuxVars[] AssignedVars[] {57040#(and (= main_~a~0 0) (or (= main_~st~0 1) (and (< ~last~0 200000) (<= main_~c~0 (+ ~last~0 1)) (= main_~st~0 0))) (= main_~b~0 0) (not (< main_~c~0 200000)))} is VALID [2022-04-15 06:31:11,975 INFO L290 TraceCheckUtils]: 11: Hoare triple {57040#(and (= main_~a~0 0) (or (= main_~st~0 1) (and (< ~last~0 200000) (<= main_~c~0 (+ ~last~0 1)) (= main_~st~0 0))) (= main_~b~0 0) (not (< main_~c~0 200000)))} assume 0 == ~st~0 && ~c~0 == 1 + ~last~0;~a~0 := 3 + ~a~0;~b~0 := 3 + ~b~0; {57044#(and (= main_~b~0 3) (<= 200000 main_~c~0) (< main_~c~0 200001) (= main_~a~0 3))} is VALID [2022-04-15 06:31:11,975 INFO L290 TraceCheckUtils]: 12: Hoare triple {57044#(and (= main_~b~0 3) (<= 200000 main_~c~0) (< main_~c~0 200001) (= main_~a~0 3))} assume !(~c~0 == ~last~0 && 0 == ~st~0); {57044#(and (= main_~b~0 3) (<= 200000 main_~c~0) (< main_~c~0 200001) (= main_~a~0 3))} is VALID [2022-04-15 06:31:11,976 INFO L272 TraceCheckUtils]: 13: Hoare triple {57044#(and (= main_~b~0 3) (<= 200000 main_~c~0) (< main_~c~0 200001) (= main_~a~0 3))} call __VERIFIER_assert((if ~a~0 == ~b~0 && 200000 == ~c~0 then 1 else 0)); {57051#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-15 06:31:11,976 INFO L290 TraceCheckUtils]: 14: Hoare triple {57051#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {57055#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-15 06:31:11,976 INFO L290 TraceCheckUtils]: 15: Hoare triple {57055#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {56994#false} is VALID [2022-04-15 06:31:11,976 INFO L290 TraceCheckUtils]: 16: Hoare triple {56994#false} assume !false; {56994#false} is VALID [2022-04-15 06:31:11,977 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-04-15 06:31:11,977 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 06:31:12,386 INFO L290 TraceCheckUtils]: 16: Hoare triple {56994#false} assume !false; {56994#false} is VALID [2022-04-15 06:31:12,386 INFO L290 TraceCheckUtils]: 15: Hoare triple {57055#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {56994#false} is VALID [2022-04-15 06:31:12,386 INFO L290 TraceCheckUtils]: 14: Hoare triple {57051#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {57055#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-15 06:31:12,387 INFO L272 TraceCheckUtils]: 13: Hoare triple {57002#(and (<= main_~b~0 main_~a~0) (< main_~a~0 (+ main_~b~0 1)) (< 199999 main_~c~0) (<= main_~c~0 200000))} call __VERIFIER_assert((if ~a~0 == ~b~0 && 200000 == ~c~0 then 1 else 0)); {57051#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-15 06:31:12,388 INFO L290 TraceCheckUtils]: 12: Hoare triple {57002#(and (<= main_~b~0 main_~a~0) (< main_~a~0 (+ main_~b~0 1)) (< 199999 main_~c~0) (<= main_~c~0 200000))} assume !(~c~0 == ~last~0 && 0 == ~st~0); {57002#(and (<= main_~b~0 main_~a~0) (< main_~a~0 (+ main_~b~0 1)) (< 199999 main_~c~0) (<= main_~c~0 200000))} is VALID [2022-04-15 06:31:12,388 INFO L290 TraceCheckUtils]: 11: Hoare triple {57077#(or (not (<= main_~c~0 (+ ~last~0 1))) (and (<= main_~b~0 main_~a~0) (< main_~a~0 (+ main_~b~0 1)) (< 199999 main_~c~0) (<= main_~c~0 200000)) (not (= main_~st~0 0)))} assume 0 == ~st~0 && ~c~0 == 1 + ~last~0;~a~0 := 3 + ~a~0;~b~0 := 3 + ~b~0; {57002#(and (<= main_~b~0 main_~a~0) (< main_~a~0 (+ main_~b~0 1)) (< 199999 main_~c~0) (<= main_~c~0 200000))} is VALID [2022-04-15 06:31:12,389 INFO L290 TraceCheckUtils]: 10: Hoare triple {57081#(or (not (<= main_~c~0 (+ ~last~0 1))) (and (<= main_~b~0 main_~a~0) (< main_~a~0 (+ main_~b~0 1)) (<= main_~c~0 200000)) (not (= main_~st~0 0)) (< main_~c~0 200000))} [197] L23-4_primed-->L23-4: Formula: (not (< v_main_~c~0_8 200000)) InVars {main_~c~0=v_main_~c~0_8} OutVars{main_~c~0=v_main_~c~0_8} AuxVars[] AssignedVars[] {57077#(or (not (<= main_~c~0 (+ ~last~0 1))) (and (<= main_~b~0 main_~a~0) (< main_~a~0 (+ main_~b~0 1)) (< 199999 main_~c~0) (<= main_~c~0 200000)) (not (= main_~st~0 0)))} is VALID [2022-04-15 06:31:12,390 INFO L290 TraceCheckUtils]: 9: Hoare triple {57085#(and (<= main_~b~0 main_~a~0) (< main_~a~0 (+ main_~b~0 1)) (not (= main_~st~0 0)))} [200] L23-3-->L23-4_primed: Formula: (let ((.cse0 (= v_main_~c~0_1132 v_main_~c~0_1131)) (.cse1 (= v_main_~st~0_354 v_main_~st~0_353)) (.cse3 (< v_main_~c~0_1132 200000)) (.cse2 (= v_~last~0_269 v_main_~c~0_1132))) (or (and .cse0 .cse1 (= |v_main_#t~post5_514| |v_main_#t~post5_518|) (or (not .cse2) (not .cse3))) (and (= v_~last~0_269 v_~last~0_269) .cse0 .cse1 (= |v_main_#t~post5_518| |v_main_#t~post5_514|)) (and .cse3 (= v_main_~st~0_353 0) (<= v_main_~c~0_1131 (+ v_~last~0_269 1)) (< v_main_~c~0_1132 v_main_~c~0_1131) .cse2))) InVars {main_~c~0=v_main_~c~0_1132, main_#t~post5=|v_main_#t~post5_518|, main_~st~0=v_main_~st~0_354, ~last~0=v_~last~0_269} OutVars{main_#t~post5=|v_main_#t~post5_514|, main_~c~0=v_main_~c~0_1131, main_~st~0=v_main_~st~0_353, ~last~0=v_~last~0_269} AuxVars[] AssignedVars[main_#t~post5, main_~c~0, main_~st~0] {57081#(or (not (<= main_~c~0 (+ ~last~0 1))) (and (<= main_~b~0 main_~a~0) (< main_~a~0 (+ main_~b~0 1)) (<= main_~c~0 200000)) (not (= main_~st~0 0)) (< main_~c~0 200000))} is VALID [2022-04-15 06:31:12,390 INFO L290 TraceCheckUtils]: 8: Hoare triple {57085#(and (<= main_~b~0 main_~a~0) (< main_~a~0 (+ main_~b~0 1)) (not (= main_~st~0 0)))} [199] L23-4_primed-->L23-3: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {57085#(and (<= main_~b~0 main_~a~0) (< main_~a~0 (+ main_~b~0 1)) (not (= main_~st~0 0)))} is VALID [2022-04-15 06:31:12,390 INFO L290 TraceCheckUtils]: 7: Hoare triple {57085#(and (<= main_~b~0 main_~a~0) (< main_~a~0 (+ main_~b~0 1)) (not (= main_~st~0 0)))} [198] L23-3-->L23-4_primed: Formula: (let ((.cse0 (= v_~last~0_268 v_main_~c~0_1130)) (.cse1 (= |v_main_#t~post5_515| |v_main_#t~post5_513|)) (.cse2 (= v_main_~c~0_1130 v_main_~c~0_1129))) (or (and (or (not (< v_main_~c~0_1130 200000)) .cse0) .cse1 .cse2) (and (< v_main_~c~0_1129 200001) (< v_main_~c~0_1130 v_main_~c~0_1129) (or (not (<= (+ v_main_~c~0_1130 1) v_~last~0_268)) (not (<= (+ v_~last~0_268 1) v_main_~c~0_1129))) (not .cse0)) (and .cse1 .cse2 (= v_~last~0_268 v_~last~0_268)))) InVars {main_~c~0=v_main_~c~0_1130, main_#t~post5=|v_main_#t~post5_515|, ~last~0=v_~last~0_268} OutVars{main_#t~post5=|v_main_#t~post5_513|, main_~c~0=v_main_~c~0_1129, ~last~0=v_~last~0_268} AuxVars[] AssignedVars[main_#t~post5, main_~c~0] {57085#(and (<= main_~b~0 main_~a~0) (< main_~a~0 (+ main_~b~0 1)) (not (= main_~st~0 0)))} is VALID [2022-04-15 06:31:12,391 INFO L290 TraceCheckUtils]: 6: Hoare triple {57095#(and (<= main_~b~0 main_~a~0) (< main_~a~0 (+ main_~b~0 1)))} assume !false;~st~0 := 1;~c~0 := 0; {57085#(and (<= main_~b~0 main_~a~0) (< main_~a~0 (+ main_~b~0 1)) (not (= main_~st~0 0)))} is VALID [2022-04-15 06:31:12,391 INFO L290 TraceCheckUtils]: 5: Hoare triple {56993#true} assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~last~0 := #t~nondet4;havoc #t~nondet4;~a~0 := 0;~b~0 := 0;~c~0 := 0;~st~0 := 0; {57095#(and (<= main_~b~0 main_~a~0) (< main_~a~0 (+ main_~b~0 1)))} is VALID [2022-04-15 06:31:12,391 INFO L272 TraceCheckUtils]: 4: Hoare triple {56993#true} call #t~ret6 := main(); {56993#true} is VALID [2022-04-15 06:31:12,391 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {56993#true} {56993#true} #66#return; {56993#true} is VALID [2022-04-15 06:31:12,391 INFO L290 TraceCheckUtils]: 2: Hoare triple {56993#true} assume true; {56993#true} is VALID [2022-04-15 06:31:12,391 INFO L290 TraceCheckUtils]: 1: Hoare triple {56993#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(11, 2);call #Ultimate.allocInit(12, 3);~last~0 := 0; {56993#true} is VALID [2022-04-15 06:31:12,392 INFO L272 TraceCheckUtils]: 0: Hoare triple {56993#true} call ULTIMATE.init(); {56993#true} is VALID [2022-04-15 06:31:12,392 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-04-15 06:31:12,392 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [607187887] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 06:31:12,392 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 06:31:12,392 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9, 9] total 19 [2022-04-15 06:31:14,738 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 06:31:14,738 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1821436814] [2022-04-15 06:31:14,738 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1821436814] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 06:31:14,738 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 06:31:14,738 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [62] imperfect sequences [] total 62 [2022-04-15 06:31:14,739 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1279253142] [2022-04-15 06:31:14,739 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 06:31:14,739 INFO L78 Accepts]: Start accepts. Automaton has has 62 states, 62 states have (on average 1.4193548387096775) internal successors, (88), 60 states have internal predecessors, (88), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 92 [2022-04-15 06:31:14,739 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 06:31:14,739 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 62 states, 62 states have (on average 1.4193548387096775) internal successors, (88), 60 states have internal predecessors, (88), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:31:14,791 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-15 06:31:14,791 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 62 states [2022-04-15 06:31:14,792 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 06:31:14,792 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 62 interpolants. [2022-04-15 06:31:14,793 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=471, Invalid=4641, Unknown=0, NotChecked=0, Total=5112 [2022-04-15 06:31:14,793 INFO L87 Difference]: Start difference. First operand 399 states and 453 transitions. Second operand has 62 states, 62 states have (on average 1.4193548387096775) internal successors, (88), 60 states have internal predecessors, (88), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:31:24,242 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:31:24,242 INFO L93 Difference]: Finished difference Result 533 states and 608 transitions. [2022-04-15 06:31:24,242 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 89 states. [2022-04-15 06:31:24,243 INFO L78 Accepts]: Start accepts. Automaton has has 62 states, 62 states have (on average 1.4193548387096775) internal successors, (88), 60 states have internal predecessors, (88), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 92 [2022-04-15 06:31:24,243 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 06:31:24,243 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 62 states, 62 states have (on average 1.4193548387096775) internal successors, (88), 60 states have internal predecessors, (88), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:31:24,244 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 200 transitions. [2022-04-15 06:31:24,244 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 62 states, 62 states have (on average 1.4193548387096775) internal successors, (88), 60 states have internal predecessors, (88), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:31:24,251 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 200 transitions. [2022-04-15 06:31:24,251 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 89 states and 200 transitions. [2022-04-15 06:31:24,376 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 200 edges. 200 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 06:31:24,384 INFO L225 Difference]: With dead ends: 533 [2022-04-15 06:31:24,384 INFO L226 Difference]: Without dead ends: 447 [2022-04-15 06:31:24,385 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 153 GetRequests, 52 SyntacticMatches, 2 SemanticMatches, 99 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2865 ImplicationChecksByTransitivity, 3.2s TimeCoverageRelationStatistics Valid=748, Invalid=9352, Unknown=0, NotChecked=0, Total=10100 [2022-04-15 06:31:24,387 INFO L913 BasicCegarLoop]: 16 mSDtfsCounter, 178 mSDsluCounter, 58 mSDsCounter, 0 mSdLazyCounter, 5486 mSolverCounterSat, 119 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 180 SdHoareTripleChecker+Valid, 74 SdHoareTripleChecker+Invalid, 5605 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 119 IncrementalHoareTripleChecker+Valid, 5486 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.3s IncrementalHoareTripleChecker+Time [2022-04-15 06:31:24,387 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [180 Valid, 74 Invalid, 5605 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [119 Valid, 5486 Invalid, 0 Unknown, 0 Unchecked, 3.3s Time] [2022-04-15 06:31:24,387 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 447 states. [2022-04-15 06:31:26,393 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 447 to 402. [2022-04-15 06:31:26,393 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 06:31:26,394 INFO L82 GeneralOperation]: Start isEquivalent. First operand 447 states. Second operand has 402 states, 394 states have (on average 1.1421319796954315) internal successors, (450), 395 states have internal predecessors, (450), 4 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-15 06:31:26,394 INFO L74 IsIncluded]: Start isIncluded. First operand 447 states. Second operand has 402 states, 394 states have (on average 1.1421319796954315) internal successors, (450), 395 states have internal predecessors, (450), 4 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-15 06:31:26,394 INFO L87 Difference]: Start difference. First operand 447 states. Second operand has 402 states, 394 states have (on average 1.1421319796954315) internal successors, (450), 395 states have internal predecessors, (450), 4 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-15 06:31:26,401 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:31:26,401 INFO L93 Difference]: Finished difference Result 447 states and 504 transitions. [2022-04-15 06:31:26,401 INFO L276 IsEmpty]: Start isEmpty. Operand 447 states and 504 transitions. [2022-04-15 06:31:26,401 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 06:31:26,401 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 06:31:26,402 INFO L74 IsIncluded]: Start isIncluded. First operand has 402 states, 394 states have (on average 1.1421319796954315) internal successors, (450), 395 states have internal predecessors, (450), 4 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) Second operand 447 states. [2022-04-15 06:31:26,402 INFO L87 Difference]: Start difference. First operand has 402 states, 394 states have (on average 1.1421319796954315) internal successors, (450), 395 states have internal predecessors, (450), 4 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) Second operand 447 states. [2022-04-15 06:31:26,409 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:31:26,409 INFO L93 Difference]: Finished difference Result 447 states and 504 transitions. [2022-04-15 06:31:26,409 INFO L276 IsEmpty]: Start isEmpty. Operand 447 states and 504 transitions. [2022-04-15 06:31:26,409 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 06:31:26,409 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 06:31:26,409 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 06:31:26,409 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 06:31:26,409 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 402 states, 394 states have (on average 1.1421319796954315) internal successors, (450), 395 states have internal predecessors, (450), 4 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-15 06:31:26,416 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 402 states to 402 states and 457 transitions. [2022-04-15 06:31:26,416 INFO L78 Accepts]: Start accepts. Automaton has 402 states and 457 transitions. Word has length 92 [2022-04-15 06:31:26,416 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 06:31:26,417 INFO L478 AbstractCegarLoop]: Abstraction has 402 states and 457 transitions. [2022-04-15 06:31:26,417 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 62 states, 62 states have (on average 1.4193548387096775) internal successors, (88), 60 states have internal predecessors, (88), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:31:26,417 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 402 states and 457 transitions. [2022-04-15 06:31:27,684 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 457 edges. 457 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 06:31:27,684 INFO L276 IsEmpty]: Start isEmpty. Operand 402 states and 457 transitions. [2022-04-15 06:31:27,685 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2022-04-15 06:31:27,685 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 06:31:27,685 INFO L499 BasicCegarLoop]: trace histogram [24, 24, 22, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 06:31:27,702 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (37)] Forceful destruction successful, exit code 0 [2022-04-15 06:31:27,885 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable40,37 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 06:31:27,885 INFO L403 AbstractCegarLoop]: === Iteration 42 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 06:31:27,886 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 06:31:27,886 INFO L85 PathProgramCache]: Analyzing trace with hash 657325186, now seen corresponding path program 11 times [2022-04-15 06:31:27,886 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 06:31:27,886 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [579026489] [2022-04-15 06:31:28,035 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 4 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {-1={1=1}, 0={1=2}, 1={2=1}}, 0 SequentialAcceleration, 1 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-15 06:31:28,036 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-15 06:31:28,036 INFO L85 PathProgramCache]: Analyzing trace with hash -1653972301, now seen corresponding path program 1 times [2022-04-15 06:31:28,036 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 06:31:28,036 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [159774152] [2022-04-15 06:31:28,036 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 06:31:28,036 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 06:31:28,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:31:28,165 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 06:31:28,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:31:28,168 INFO L290 TraceCheckUtils]: 0: Hoare triple {60009#(and (= ~last~0 |old(~last~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(11, 2);call #Ultimate.allocInit(12, 3);~last~0 := 0; {59991#true} is VALID [2022-04-15 06:31:28,168 INFO L290 TraceCheckUtils]: 1: Hoare triple {59991#true} assume true; {59991#true} is VALID [2022-04-15 06:31:28,168 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {59991#true} {59991#true} #66#return; {59991#true} is VALID [2022-04-15 06:31:28,169 INFO L272 TraceCheckUtils]: 0: Hoare triple {59991#true} call ULTIMATE.init(); {60009#(and (= ~last~0 |old(~last~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 06:31:28,169 INFO L290 TraceCheckUtils]: 1: Hoare triple {60009#(and (= ~last~0 |old(~last~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(11, 2);call #Ultimate.allocInit(12, 3);~last~0 := 0; {59991#true} is VALID [2022-04-15 06:31:28,169 INFO L290 TraceCheckUtils]: 2: Hoare triple {59991#true} assume true; {59991#true} is VALID [2022-04-15 06:31:28,169 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {59991#true} {59991#true} #66#return; {59991#true} is VALID [2022-04-15 06:31:28,169 INFO L272 TraceCheckUtils]: 4: Hoare triple {59991#true} call #t~ret6 := main(); {59991#true} is VALID [2022-04-15 06:31:28,169 INFO L290 TraceCheckUtils]: 5: Hoare triple {59991#true} assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~last~0 := #t~nondet4;havoc #t~nondet4;~a~0 := 0;~b~0 := 0;~c~0 := 0;~st~0 := 0; {59991#true} is VALID [2022-04-15 06:31:28,169 INFO L290 TraceCheckUtils]: 6: Hoare triple {59991#true} [202] L30-->L23-3_primed: Formula: (let ((.cse0 (= v_main_~st~0_365 v_main_~st~0_363)) (.cse1 (= v_main_~b~0_188 v_main_~b~0_187)) (.cse2 (= v_main_~a~0_191 v_main_~a~0_190)) (.cse3 (= |v_main_#t~post5_538| |v_main_#t~post5_526|))) (or (and .cse0 (= v_main_~c~0_1174 v_main_~c~0_1187) .cse1 .cse2 .cse3) (and .cse0 .cse1 (= v_main_~c~0_1187 v_main_~c~0_1174) .cse2 .cse3))) InVars {main_~c~0=v_main_~c~0_1187, main_#t~post5=|v_main_#t~post5_538|, main_~st~0=v_main_~st~0_365, main_~b~0=v_main_~b~0_188, main_~a~0=v_main_~a~0_191} OutVars{main_~c~0=v_main_~c~0_1174, main_#t~post5=|v_main_#t~post5_526|, main_~st~0=v_main_~st~0_363, main_~b~0=v_main_~b~0_187, main_~a~0=v_main_~a~0_190} AuxVars[] AssignedVars[main_~c~0, main_#t~post5, main_~st~0, main_~b~0, main_~a~0] {59991#true} is VALID [2022-04-15 06:31:28,170 INFO L290 TraceCheckUtils]: 7: Hoare triple {59991#true} [201] L23-3_primed-->L23-3: Formula: (and (= v_main_~c~0_7 0) (= v_main_~st~0_6 1)) InVars {} OutVars{main_~c~0=v_main_~c~0_7, main_~st~0=v_main_~st~0_6} AuxVars[] AssignedVars[main_~c~0, main_~st~0] {59996#(= main_~c~0 0)} is VALID [2022-04-15 06:31:28,170 INFO L290 TraceCheckUtils]: 8: Hoare triple {59996#(= main_~c~0 0)} assume !!(~c~0 < 200000); {59996#(= main_~c~0 0)} is VALID [2022-04-15 06:31:28,170 INFO L290 TraceCheckUtils]: 9: Hoare triple {59996#(= main_~c~0 0)} assume ~c~0 == ~last~0;~st~0 := 0; {59996#(= main_~c~0 0)} is VALID [2022-04-15 06:31:28,170 INFO L290 TraceCheckUtils]: 10: Hoare triple {59996#(= main_~c~0 0)} #t~post5 := ~c~0;~c~0 := 1 + #t~post5;havoc #t~post5; {59997#(<= main_~c~0 1)} is VALID [2022-04-15 06:31:28,171 INFO L290 TraceCheckUtils]: 11: Hoare triple {59997#(<= main_~c~0 1)} assume !!(~c~0 < 200000); {59997#(<= main_~c~0 1)} is VALID [2022-04-15 06:31:28,171 INFO L290 TraceCheckUtils]: 12: Hoare triple {59997#(<= main_~c~0 1)} assume !(~c~0 == ~last~0); {59997#(<= main_~c~0 1)} is VALID [2022-04-15 06:31:28,171 INFO L290 TraceCheckUtils]: 13: Hoare triple {59997#(<= main_~c~0 1)} #t~post5 := ~c~0;~c~0 := 1 + #t~post5;havoc #t~post5; {59998#(<= main_~c~0 2)} is VALID [2022-04-15 06:31:28,172 INFO L290 TraceCheckUtils]: 14: Hoare triple {59998#(<= main_~c~0 2)} assume !!(~c~0 < 200000); {59998#(<= main_~c~0 2)} is VALID [2022-04-15 06:31:28,172 INFO L290 TraceCheckUtils]: 15: Hoare triple {59998#(<= main_~c~0 2)} assume !(~c~0 == ~last~0); {59998#(<= main_~c~0 2)} is VALID [2022-04-15 06:31:28,172 INFO L290 TraceCheckUtils]: 16: Hoare triple {59998#(<= main_~c~0 2)} #t~post5 := ~c~0;~c~0 := 1 + #t~post5;havoc #t~post5; {59999#(<= main_~c~0 3)} is VALID [2022-04-15 06:31:28,173 INFO L290 TraceCheckUtils]: 17: Hoare triple {59999#(<= main_~c~0 3)} assume !!(~c~0 < 200000); {59999#(<= main_~c~0 3)} is VALID [2022-04-15 06:31:28,173 INFO L290 TraceCheckUtils]: 18: Hoare triple {59999#(<= main_~c~0 3)} assume !(~c~0 == ~last~0); {59999#(<= main_~c~0 3)} is VALID [2022-04-15 06:31:28,173 INFO L290 TraceCheckUtils]: 19: Hoare triple {59999#(<= main_~c~0 3)} #t~post5 := ~c~0;~c~0 := 1 + #t~post5;havoc #t~post5; {60000#(<= main_~c~0 4)} is VALID [2022-04-15 06:31:28,174 INFO L290 TraceCheckUtils]: 20: Hoare triple {60000#(<= main_~c~0 4)} assume !!(~c~0 < 200000); {60000#(<= main_~c~0 4)} is VALID [2022-04-15 06:31:28,174 INFO L290 TraceCheckUtils]: 21: Hoare triple {60000#(<= main_~c~0 4)} assume !(~c~0 == ~last~0); {60000#(<= main_~c~0 4)} is VALID [2022-04-15 06:31:28,174 INFO L290 TraceCheckUtils]: 22: Hoare triple {60000#(<= main_~c~0 4)} #t~post5 := ~c~0;~c~0 := 1 + #t~post5;havoc #t~post5; {60001#(<= main_~c~0 5)} is VALID [2022-04-15 06:31:28,175 INFO L290 TraceCheckUtils]: 23: Hoare triple {60001#(<= main_~c~0 5)} assume !!(~c~0 < 200000); {60001#(<= main_~c~0 5)} is VALID [2022-04-15 06:31:28,175 INFO L290 TraceCheckUtils]: 24: Hoare triple {60001#(<= main_~c~0 5)} assume !(~c~0 == ~last~0); {60001#(<= main_~c~0 5)} is VALID [2022-04-15 06:31:28,175 INFO L290 TraceCheckUtils]: 25: Hoare triple {60001#(<= main_~c~0 5)} #t~post5 := ~c~0;~c~0 := 1 + #t~post5;havoc #t~post5; {60002#(<= main_~c~0 6)} is VALID [2022-04-15 06:31:28,175 INFO L290 TraceCheckUtils]: 26: Hoare triple {60002#(<= main_~c~0 6)} assume !!(~c~0 < 200000); {60002#(<= main_~c~0 6)} is VALID [2022-04-15 06:31:28,176 INFO L290 TraceCheckUtils]: 27: Hoare triple {60002#(<= main_~c~0 6)} assume !(~c~0 == ~last~0); {60002#(<= main_~c~0 6)} is VALID [2022-04-15 06:31:28,176 INFO L290 TraceCheckUtils]: 28: Hoare triple {60002#(<= main_~c~0 6)} #t~post5 := ~c~0;~c~0 := 1 + #t~post5;havoc #t~post5; {60003#(<= main_~c~0 7)} is VALID [2022-04-15 06:31:28,176 INFO L290 TraceCheckUtils]: 29: Hoare triple {60003#(<= main_~c~0 7)} assume !!(~c~0 < 200000); {60003#(<= main_~c~0 7)} is VALID [2022-04-15 06:31:28,177 INFO L290 TraceCheckUtils]: 30: Hoare triple {60003#(<= main_~c~0 7)} assume !(~c~0 == ~last~0); {60003#(<= main_~c~0 7)} is VALID [2022-04-15 06:31:28,177 INFO L290 TraceCheckUtils]: 31: Hoare triple {60003#(<= main_~c~0 7)} #t~post5 := ~c~0;~c~0 := 1 + #t~post5;havoc #t~post5; {60004#(<= main_~c~0 8)} is VALID [2022-04-15 06:31:28,177 INFO L290 TraceCheckUtils]: 32: Hoare triple {60004#(<= main_~c~0 8)} assume !!(~c~0 < 200000); {60004#(<= main_~c~0 8)} is VALID [2022-04-15 06:31:28,178 INFO L290 TraceCheckUtils]: 33: Hoare triple {60004#(<= main_~c~0 8)} assume !(~c~0 == ~last~0); {60004#(<= main_~c~0 8)} is VALID [2022-04-15 06:31:28,178 INFO L290 TraceCheckUtils]: 34: Hoare triple {60004#(<= main_~c~0 8)} #t~post5 := ~c~0;~c~0 := 1 + #t~post5;havoc #t~post5; {60005#(<= main_~c~0 9)} is VALID [2022-04-15 06:31:28,178 INFO L290 TraceCheckUtils]: 35: Hoare triple {60005#(<= main_~c~0 9)} assume !!(~c~0 < 200000); {60005#(<= main_~c~0 9)} is VALID [2022-04-15 06:31:28,179 INFO L290 TraceCheckUtils]: 36: Hoare triple {60005#(<= main_~c~0 9)} assume !(~c~0 == ~last~0); {60005#(<= main_~c~0 9)} is VALID [2022-04-15 06:31:28,179 INFO L290 TraceCheckUtils]: 37: Hoare triple {60005#(<= main_~c~0 9)} #t~post5 := ~c~0;~c~0 := 1 + #t~post5;havoc #t~post5; {60006#(<= main_~c~0 10)} is VALID [2022-04-15 06:31:28,179 INFO L290 TraceCheckUtils]: 38: Hoare triple {60006#(<= main_~c~0 10)} assume !!(~c~0 < 200000); {60006#(<= main_~c~0 10)} is VALID [2022-04-15 06:31:28,180 INFO L290 TraceCheckUtils]: 39: Hoare triple {60006#(<= main_~c~0 10)} assume !(~c~0 == ~last~0); {60006#(<= main_~c~0 10)} is VALID [2022-04-15 06:31:28,180 INFO L290 TraceCheckUtils]: 40: Hoare triple {60006#(<= main_~c~0 10)} #t~post5 := ~c~0;~c~0 := 1 + #t~post5;havoc #t~post5; {60007#(<= main_~c~0 11)} is VALID [2022-04-15 06:31:28,180 INFO L290 TraceCheckUtils]: 41: Hoare triple {60007#(<= main_~c~0 11)} assume !!(~c~0 < 200000); {60007#(<= main_~c~0 11)} is VALID [2022-04-15 06:31:28,180 INFO L290 TraceCheckUtils]: 42: Hoare triple {60007#(<= main_~c~0 11)} assume !(~c~0 == ~last~0); {60007#(<= main_~c~0 11)} is VALID [2022-04-15 06:31:28,181 INFO L290 TraceCheckUtils]: 43: Hoare triple {60007#(<= main_~c~0 11)} #t~post5 := ~c~0;~c~0 := 1 + #t~post5;havoc #t~post5; {60008#(<= main_~c~0 12)} is VALID [2022-04-15 06:31:28,181 INFO L290 TraceCheckUtils]: 44: Hoare triple {60008#(<= main_~c~0 12)} assume !(~c~0 < 200000); {59992#false} is VALID [2022-04-15 06:31:28,181 INFO L290 TraceCheckUtils]: 45: Hoare triple {59992#false} assume 0 == ~st~0 && ~c~0 == 1 + ~last~0;~a~0 := 3 + ~a~0;~b~0 := 3 + ~b~0; {59992#false} is VALID [2022-04-15 06:31:28,181 INFO L290 TraceCheckUtils]: 46: Hoare triple {59992#false} assume !(~c~0 == ~last~0 && 0 == ~st~0); {59992#false} is VALID [2022-04-15 06:31:28,181 INFO L272 TraceCheckUtils]: 47: Hoare triple {59992#false} call __VERIFIER_assert((if ~a~0 == ~b~0 && 200000 == ~c~0 then 1 else 0)); {59992#false} is VALID [2022-04-15 06:31:28,181 INFO L290 TraceCheckUtils]: 48: Hoare triple {59992#false} ~cond := #in~cond; {59992#false} is VALID [2022-04-15 06:31:28,182 INFO L290 TraceCheckUtils]: 49: Hoare triple {59992#false} assume 0 == ~cond; {59992#false} is VALID [2022-04-15 06:31:28,182 INFO L290 TraceCheckUtils]: 50: Hoare triple {59992#false} assume !false; {59992#false} is VALID [2022-04-15 06:31:28,182 INFO L134 CoverageAnalysis]: Checked inductivity of 210 backedges. 0 proven. 210 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 06:31:28,182 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 06:31:28,182 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [159774152] [2022-04-15 06:31:28,182 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [159774152] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 06:31:28,182 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1260102894] [2022-04-15 06:31:28,182 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 06:31:28,182 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 06:31:28,182 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 06:31:28,183 INFO L229 MonitoredProcess]: Starting monitored process 38 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-15 06:31:28,184 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (38)] Waiting until timeout for monitored process [2022-04-15 06:31:28,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:31:28,221 INFO L263 TraceCheckSpWp]: Trace formula consists of 134 conjuncts, 14 conjunts are in the unsatisfiable core [2022-04-15 06:31:28,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:31:28,233 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 06:31:28,471 INFO L272 TraceCheckUtils]: 0: Hoare triple {59991#true} call ULTIMATE.init(); {59991#true} is VALID [2022-04-15 06:31:28,472 INFO L290 TraceCheckUtils]: 1: Hoare triple {59991#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(11, 2);call #Ultimate.allocInit(12, 3);~last~0 := 0; {59991#true} is VALID [2022-04-15 06:31:28,472 INFO L290 TraceCheckUtils]: 2: Hoare triple {59991#true} assume true; {59991#true} is VALID [2022-04-15 06:31:28,472 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {59991#true} {59991#true} #66#return; {59991#true} is VALID [2022-04-15 06:31:28,472 INFO L272 TraceCheckUtils]: 4: Hoare triple {59991#true} call #t~ret6 := main(); {59991#true} is VALID [2022-04-15 06:31:28,472 INFO L290 TraceCheckUtils]: 5: Hoare triple {59991#true} assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~last~0 := #t~nondet4;havoc #t~nondet4;~a~0 := 0;~b~0 := 0;~c~0 := 0;~st~0 := 0; {59991#true} is VALID [2022-04-15 06:31:28,472 INFO L290 TraceCheckUtils]: 6: Hoare triple {59991#true} [202] L30-->L23-3_primed: Formula: (let ((.cse0 (= v_main_~st~0_365 v_main_~st~0_363)) (.cse1 (= v_main_~b~0_188 v_main_~b~0_187)) (.cse2 (= v_main_~a~0_191 v_main_~a~0_190)) (.cse3 (= |v_main_#t~post5_538| |v_main_#t~post5_526|))) (or (and .cse0 (= v_main_~c~0_1174 v_main_~c~0_1187) .cse1 .cse2 .cse3) (and .cse0 .cse1 (= v_main_~c~0_1187 v_main_~c~0_1174) .cse2 .cse3))) InVars {main_~c~0=v_main_~c~0_1187, main_#t~post5=|v_main_#t~post5_538|, main_~st~0=v_main_~st~0_365, main_~b~0=v_main_~b~0_188, main_~a~0=v_main_~a~0_191} OutVars{main_~c~0=v_main_~c~0_1174, main_#t~post5=|v_main_#t~post5_526|, main_~st~0=v_main_~st~0_363, main_~b~0=v_main_~b~0_187, main_~a~0=v_main_~a~0_190} AuxVars[] AssignedVars[main_~c~0, main_#t~post5, main_~st~0, main_~b~0, main_~a~0] {59991#true} is VALID [2022-04-15 06:31:28,472 INFO L290 TraceCheckUtils]: 7: Hoare triple {59991#true} [201] L23-3_primed-->L23-3: Formula: (and (= v_main_~c~0_7 0) (= v_main_~st~0_6 1)) InVars {} OutVars{main_~c~0=v_main_~c~0_7, main_~st~0=v_main_~st~0_6} AuxVars[] AssignedVars[main_~c~0, main_~st~0] {60034#(<= main_~c~0 0)} is VALID [2022-04-15 06:31:28,473 INFO L290 TraceCheckUtils]: 8: Hoare triple {60034#(<= main_~c~0 0)} assume !!(~c~0 < 200000); {60034#(<= main_~c~0 0)} is VALID [2022-04-15 06:31:28,473 INFO L290 TraceCheckUtils]: 9: Hoare triple {60034#(<= main_~c~0 0)} assume ~c~0 == ~last~0;~st~0 := 0; {60034#(<= main_~c~0 0)} is VALID [2022-04-15 06:31:28,473 INFO L290 TraceCheckUtils]: 10: Hoare triple {60034#(<= main_~c~0 0)} #t~post5 := ~c~0;~c~0 := 1 + #t~post5;havoc #t~post5; {59997#(<= main_~c~0 1)} is VALID [2022-04-15 06:31:28,474 INFO L290 TraceCheckUtils]: 11: Hoare triple {59997#(<= main_~c~0 1)} assume !!(~c~0 < 200000); {59997#(<= main_~c~0 1)} is VALID [2022-04-15 06:31:28,474 INFO L290 TraceCheckUtils]: 12: Hoare triple {59997#(<= main_~c~0 1)} assume !(~c~0 == ~last~0); {59997#(<= main_~c~0 1)} is VALID [2022-04-15 06:31:28,474 INFO L290 TraceCheckUtils]: 13: Hoare triple {59997#(<= main_~c~0 1)} #t~post5 := ~c~0;~c~0 := 1 + #t~post5;havoc #t~post5; {59998#(<= main_~c~0 2)} is VALID [2022-04-15 06:31:28,475 INFO L290 TraceCheckUtils]: 14: Hoare triple {59998#(<= main_~c~0 2)} assume !!(~c~0 < 200000); {59998#(<= main_~c~0 2)} is VALID [2022-04-15 06:31:28,475 INFO L290 TraceCheckUtils]: 15: Hoare triple {59998#(<= main_~c~0 2)} assume !(~c~0 == ~last~0); {59998#(<= main_~c~0 2)} is VALID [2022-04-15 06:31:28,475 INFO L290 TraceCheckUtils]: 16: Hoare triple {59998#(<= main_~c~0 2)} #t~post5 := ~c~0;~c~0 := 1 + #t~post5;havoc #t~post5; {59999#(<= main_~c~0 3)} is VALID [2022-04-15 06:31:28,476 INFO L290 TraceCheckUtils]: 17: Hoare triple {59999#(<= main_~c~0 3)} assume !!(~c~0 < 200000); {59999#(<= main_~c~0 3)} is VALID [2022-04-15 06:31:28,476 INFO L290 TraceCheckUtils]: 18: Hoare triple {59999#(<= main_~c~0 3)} assume !(~c~0 == ~last~0); {59999#(<= main_~c~0 3)} is VALID [2022-04-15 06:31:28,476 INFO L290 TraceCheckUtils]: 19: Hoare triple {59999#(<= main_~c~0 3)} #t~post5 := ~c~0;~c~0 := 1 + #t~post5;havoc #t~post5; {60000#(<= main_~c~0 4)} is VALID [2022-04-15 06:31:28,477 INFO L290 TraceCheckUtils]: 20: Hoare triple {60000#(<= main_~c~0 4)} assume !!(~c~0 < 200000); {60000#(<= main_~c~0 4)} is VALID [2022-04-15 06:31:28,477 INFO L290 TraceCheckUtils]: 21: Hoare triple {60000#(<= main_~c~0 4)} assume !(~c~0 == ~last~0); {60000#(<= main_~c~0 4)} is VALID [2022-04-15 06:31:28,477 INFO L290 TraceCheckUtils]: 22: Hoare triple {60000#(<= main_~c~0 4)} #t~post5 := ~c~0;~c~0 := 1 + #t~post5;havoc #t~post5; {60001#(<= main_~c~0 5)} is VALID [2022-04-15 06:31:28,478 INFO L290 TraceCheckUtils]: 23: Hoare triple {60001#(<= main_~c~0 5)} assume !!(~c~0 < 200000); {60001#(<= main_~c~0 5)} is VALID [2022-04-15 06:31:28,478 INFO L290 TraceCheckUtils]: 24: Hoare triple {60001#(<= main_~c~0 5)} assume !(~c~0 == ~last~0); {60001#(<= main_~c~0 5)} is VALID [2022-04-15 06:31:28,478 INFO L290 TraceCheckUtils]: 25: Hoare triple {60001#(<= main_~c~0 5)} #t~post5 := ~c~0;~c~0 := 1 + #t~post5;havoc #t~post5; {60002#(<= main_~c~0 6)} is VALID [2022-04-15 06:31:28,479 INFO L290 TraceCheckUtils]: 26: Hoare triple {60002#(<= main_~c~0 6)} assume !!(~c~0 < 200000); {60002#(<= main_~c~0 6)} is VALID [2022-04-15 06:31:28,479 INFO L290 TraceCheckUtils]: 27: Hoare triple {60002#(<= main_~c~0 6)} assume !(~c~0 == ~last~0); {60002#(<= main_~c~0 6)} is VALID [2022-04-15 06:31:28,479 INFO L290 TraceCheckUtils]: 28: Hoare triple {60002#(<= main_~c~0 6)} #t~post5 := ~c~0;~c~0 := 1 + #t~post5;havoc #t~post5; {60003#(<= main_~c~0 7)} is VALID [2022-04-15 06:31:28,480 INFO L290 TraceCheckUtils]: 29: Hoare triple {60003#(<= main_~c~0 7)} assume !!(~c~0 < 200000); {60003#(<= main_~c~0 7)} is VALID [2022-04-15 06:31:28,480 INFO L290 TraceCheckUtils]: 30: Hoare triple {60003#(<= main_~c~0 7)} assume !(~c~0 == ~last~0); {60003#(<= main_~c~0 7)} is VALID [2022-04-15 06:31:28,480 INFO L290 TraceCheckUtils]: 31: Hoare triple {60003#(<= main_~c~0 7)} #t~post5 := ~c~0;~c~0 := 1 + #t~post5;havoc #t~post5; {60004#(<= main_~c~0 8)} is VALID [2022-04-15 06:31:28,481 INFO L290 TraceCheckUtils]: 32: Hoare triple {60004#(<= main_~c~0 8)} assume !!(~c~0 < 200000); {60004#(<= main_~c~0 8)} is VALID [2022-04-15 06:31:28,481 INFO L290 TraceCheckUtils]: 33: Hoare triple {60004#(<= main_~c~0 8)} assume !(~c~0 == ~last~0); {60004#(<= main_~c~0 8)} is VALID [2022-04-15 06:31:28,481 INFO L290 TraceCheckUtils]: 34: Hoare triple {60004#(<= main_~c~0 8)} #t~post5 := ~c~0;~c~0 := 1 + #t~post5;havoc #t~post5; {60005#(<= main_~c~0 9)} is VALID [2022-04-15 06:31:28,482 INFO L290 TraceCheckUtils]: 35: Hoare triple {60005#(<= main_~c~0 9)} assume !!(~c~0 < 200000); {60005#(<= main_~c~0 9)} is VALID [2022-04-15 06:31:28,482 INFO L290 TraceCheckUtils]: 36: Hoare triple {60005#(<= main_~c~0 9)} assume !(~c~0 == ~last~0); {60005#(<= main_~c~0 9)} is VALID [2022-04-15 06:31:28,483 INFO L290 TraceCheckUtils]: 37: Hoare triple {60005#(<= main_~c~0 9)} #t~post5 := ~c~0;~c~0 := 1 + #t~post5;havoc #t~post5; {60006#(<= main_~c~0 10)} is VALID [2022-04-15 06:31:28,483 INFO L290 TraceCheckUtils]: 38: Hoare triple {60006#(<= main_~c~0 10)} assume !!(~c~0 < 200000); {60006#(<= main_~c~0 10)} is VALID [2022-04-15 06:31:28,483 INFO L290 TraceCheckUtils]: 39: Hoare triple {60006#(<= main_~c~0 10)} assume !(~c~0 == ~last~0); {60006#(<= main_~c~0 10)} is VALID [2022-04-15 06:31:28,484 INFO L290 TraceCheckUtils]: 40: Hoare triple {60006#(<= main_~c~0 10)} #t~post5 := ~c~0;~c~0 := 1 + #t~post5;havoc #t~post5; {60007#(<= main_~c~0 11)} is VALID [2022-04-15 06:31:28,484 INFO L290 TraceCheckUtils]: 41: Hoare triple {60007#(<= main_~c~0 11)} assume !!(~c~0 < 200000); {60007#(<= main_~c~0 11)} is VALID [2022-04-15 06:31:28,485 INFO L290 TraceCheckUtils]: 42: Hoare triple {60007#(<= main_~c~0 11)} assume !(~c~0 == ~last~0); {60007#(<= main_~c~0 11)} is VALID [2022-04-15 06:31:28,485 INFO L290 TraceCheckUtils]: 43: Hoare triple {60007#(<= main_~c~0 11)} #t~post5 := ~c~0;~c~0 := 1 + #t~post5;havoc #t~post5; {60008#(<= main_~c~0 12)} is VALID [2022-04-15 06:31:28,486 INFO L290 TraceCheckUtils]: 44: Hoare triple {60008#(<= main_~c~0 12)} assume !(~c~0 < 200000); {59992#false} is VALID [2022-04-15 06:31:28,486 INFO L290 TraceCheckUtils]: 45: Hoare triple {59992#false} assume 0 == ~st~0 && ~c~0 == 1 + ~last~0;~a~0 := 3 + ~a~0;~b~0 := 3 + ~b~0; {59992#false} is VALID [2022-04-15 06:31:28,486 INFO L290 TraceCheckUtils]: 46: Hoare triple {59992#false} assume !(~c~0 == ~last~0 && 0 == ~st~0); {59992#false} is VALID [2022-04-15 06:31:28,486 INFO L272 TraceCheckUtils]: 47: Hoare triple {59992#false} call __VERIFIER_assert((if ~a~0 == ~b~0 && 200000 == ~c~0 then 1 else 0)); {59992#false} is VALID [2022-04-15 06:31:28,486 INFO L290 TraceCheckUtils]: 48: Hoare triple {59992#false} ~cond := #in~cond; {59992#false} is VALID [2022-04-15 06:31:28,486 INFO L290 TraceCheckUtils]: 49: Hoare triple {59992#false} assume 0 == ~cond; {59992#false} is VALID [2022-04-15 06:31:28,486 INFO L290 TraceCheckUtils]: 50: Hoare triple {59992#false} assume !false; {59992#false} is VALID [2022-04-15 06:31:28,486 INFO L134 CoverageAnalysis]: Checked inductivity of 210 backedges. 0 proven. 210 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 06:31:28,486 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 06:31:28,919 INFO L290 TraceCheckUtils]: 50: Hoare triple {59992#false} assume !false; {59992#false} is VALID [2022-04-15 06:31:28,919 INFO L290 TraceCheckUtils]: 49: Hoare triple {59992#false} assume 0 == ~cond; {59992#false} is VALID [2022-04-15 06:31:28,919 INFO L290 TraceCheckUtils]: 48: Hoare triple {59992#false} ~cond := #in~cond; {59992#false} is VALID [2022-04-15 06:31:28,919 INFO L272 TraceCheckUtils]: 47: Hoare triple {59992#false} call __VERIFIER_assert((if ~a~0 == ~b~0 && 200000 == ~c~0 then 1 else 0)); {59992#false} is VALID [2022-04-15 06:31:28,919 INFO L290 TraceCheckUtils]: 46: Hoare triple {59992#false} assume !(~c~0 == ~last~0 && 0 == ~st~0); {59992#false} is VALID [2022-04-15 06:31:28,920 INFO L290 TraceCheckUtils]: 45: Hoare triple {59992#false} assume 0 == ~st~0 && ~c~0 == 1 + ~last~0;~a~0 := 3 + ~a~0;~b~0 := 3 + ~b~0; {59992#false} is VALID [2022-04-15 06:31:28,920 INFO L290 TraceCheckUtils]: 44: Hoare triple {60182#(< main_~c~0 200000)} assume !(~c~0 < 200000); {59992#false} is VALID [2022-04-15 06:31:28,920 INFO L290 TraceCheckUtils]: 43: Hoare triple {60186#(< main_~c~0 199999)} #t~post5 := ~c~0;~c~0 := 1 + #t~post5;havoc #t~post5; {60182#(< main_~c~0 200000)} is VALID [2022-04-15 06:31:28,921 INFO L290 TraceCheckUtils]: 42: Hoare triple {60186#(< main_~c~0 199999)} assume !(~c~0 == ~last~0); {60186#(< main_~c~0 199999)} is VALID [2022-04-15 06:31:28,921 INFO L290 TraceCheckUtils]: 41: Hoare triple {60186#(< main_~c~0 199999)} assume !!(~c~0 < 200000); {60186#(< main_~c~0 199999)} is VALID [2022-04-15 06:31:28,921 INFO L290 TraceCheckUtils]: 40: Hoare triple {60196#(< main_~c~0 199998)} #t~post5 := ~c~0;~c~0 := 1 + #t~post5;havoc #t~post5; {60186#(< main_~c~0 199999)} is VALID [2022-04-15 06:31:28,922 INFO L290 TraceCheckUtils]: 39: Hoare triple {60196#(< main_~c~0 199998)} assume !(~c~0 == ~last~0); {60196#(< main_~c~0 199998)} is VALID [2022-04-15 06:31:28,922 INFO L290 TraceCheckUtils]: 38: Hoare triple {60196#(< main_~c~0 199998)} assume !!(~c~0 < 200000); {60196#(< main_~c~0 199998)} is VALID [2022-04-15 06:31:28,922 INFO L290 TraceCheckUtils]: 37: Hoare triple {60206#(< main_~c~0 199997)} #t~post5 := ~c~0;~c~0 := 1 + #t~post5;havoc #t~post5; {60196#(< main_~c~0 199998)} is VALID [2022-04-15 06:31:28,923 INFO L290 TraceCheckUtils]: 36: Hoare triple {60206#(< main_~c~0 199997)} assume !(~c~0 == ~last~0); {60206#(< main_~c~0 199997)} is VALID [2022-04-15 06:31:28,923 INFO L290 TraceCheckUtils]: 35: Hoare triple {60206#(< main_~c~0 199997)} assume !!(~c~0 < 200000); {60206#(< main_~c~0 199997)} is VALID [2022-04-15 06:31:28,923 INFO L290 TraceCheckUtils]: 34: Hoare triple {60216#(< main_~c~0 199996)} #t~post5 := ~c~0;~c~0 := 1 + #t~post5;havoc #t~post5; {60206#(< main_~c~0 199997)} is VALID [2022-04-15 06:31:28,924 INFO L290 TraceCheckUtils]: 33: Hoare triple {60216#(< main_~c~0 199996)} assume !(~c~0 == ~last~0); {60216#(< main_~c~0 199996)} is VALID [2022-04-15 06:31:28,924 INFO L290 TraceCheckUtils]: 32: Hoare triple {60216#(< main_~c~0 199996)} assume !!(~c~0 < 200000); {60216#(< main_~c~0 199996)} is VALID [2022-04-15 06:31:28,924 INFO L290 TraceCheckUtils]: 31: Hoare triple {60226#(< main_~c~0 199995)} #t~post5 := ~c~0;~c~0 := 1 + #t~post5;havoc #t~post5; {60216#(< main_~c~0 199996)} is VALID [2022-04-15 06:31:28,925 INFO L290 TraceCheckUtils]: 30: Hoare triple {60226#(< main_~c~0 199995)} assume !(~c~0 == ~last~0); {60226#(< main_~c~0 199995)} is VALID [2022-04-15 06:31:28,925 INFO L290 TraceCheckUtils]: 29: Hoare triple {60226#(< main_~c~0 199995)} assume !!(~c~0 < 200000); {60226#(< main_~c~0 199995)} is VALID [2022-04-15 06:31:28,925 INFO L290 TraceCheckUtils]: 28: Hoare triple {60236#(< main_~c~0 199994)} #t~post5 := ~c~0;~c~0 := 1 + #t~post5;havoc #t~post5; {60226#(< main_~c~0 199995)} is VALID [2022-04-15 06:31:28,925 INFO L290 TraceCheckUtils]: 27: Hoare triple {60236#(< main_~c~0 199994)} assume !(~c~0 == ~last~0); {60236#(< main_~c~0 199994)} is VALID [2022-04-15 06:31:28,926 INFO L290 TraceCheckUtils]: 26: Hoare triple {60236#(< main_~c~0 199994)} assume !!(~c~0 < 200000); {60236#(< main_~c~0 199994)} is VALID [2022-04-15 06:31:28,926 INFO L290 TraceCheckUtils]: 25: Hoare triple {60246#(< main_~c~0 199993)} #t~post5 := ~c~0;~c~0 := 1 + #t~post5;havoc #t~post5; {60236#(< main_~c~0 199994)} is VALID [2022-04-15 06:31:28,926 INFO L290 TraceCheckUtils]: 24: Hoare triple {60246#(< main_~c~0 199993)} assume !(~c~0 == ~last~0); {60246#(< main_~c~0 199993)} is VALID [2022-04-15 06:31:28,927 INFO L290 TraceCheckUtils]: 23: Hoare triple {60246#(< main_~c~0 199993)} assume !!(~c~0 < 200000); {60246#(< main_~c~0 199993)} is VALID [2022-04-15 06:31:28,927 INFO L290 TraceCheckUtils]: 22: Hoare triple {60256#(< main_~c~0 199992)} #t~post5 := ~c~0;~c~0 := 1 + #t~post5;havoc #t~post5; {60246#(< main_~c~0 199993)} is VALID [2022-04-15 06:31:28,927 INFO L290 TraceCheckUtils]: 21: Hoare triple {60256#(< main_~c~0 199992)} assume !(~c~0 == ~last~0); {60256#(< main_~c~0 199992)} is VALID [2022-04-15 06:31:28,928 INFO L290 TraceCheckUtils]: 20: Hoare triple {60256#(< main_~c~0 199992)} assume !!(~c~0 < 200000); {60256#(< main_~c~0 199992)} is VALID [2022-04-15 06:31:28,928 INFO L290 TraceCheckUtils]: 19: Hoare triple {60266#(< main_~c~0 199991)} #t~post5 := ~c~0;~c~0 := 1 + #t~post5;havoc #t~post5; {60256#(< main_~c~0 199992)} is VALID [2022-04-15 06:31:28,928 INFO L290 TraceCheckUtils]: 18: Hoare triple {60266#(< main_~c~0 199991)} assume !(~c~0 == ~last~0); {60266#(< main_~c~0 199991)} is VALID [2022-04-15 06:31:28,929 INFO L290 TraceCheckUtils]: 17: Hoare triple {60266#(< main_~c~0 199991)} assume !!(~c~0 < 200000); {60266#(< main_~c~0 199991)} is VALID [2022-04-15 06:31:28,929 INFO L290 TraceCheckUtils]: 16: Hoare triple {60276#(< main_~c~0 199990)} #t~post5 := ~c~0;~c~0 := 1 + #t~post5;havoc #t~post5; {60266#(< main_~c~0 199991)} is VALID [2022-04-15 06:31:28,929 INFO L290 TraceCheckUtils]: 15: Hoare triple {60276#(< main_~c~0 199990)} assume !(~c~0 == ~last~0); {60276#(< main_~c~0 199990)} is VALID [2022-04-15 06:31:28,930 INFO L290 TraceCheckUtils]: 14: Hoare triple {60276#(< main_~c~0 199990)} assume !!(~c~0 < 200000); {60276#(< main_~c~0 199990)} is VALID [2022-04-15 06:31:28,930 INFO L290 TraceCheckUtils]: 13: Hoare triple {60286#(< main_~c~0 199989)} #t~post5 := ~c~0;~c~0 := 1 + #t~post5;havoc #t~post5; {60276#(< main_~c~0 199990)} is VALID [2022-04-15 06:31:28,930 INFO L290 TraceCheckUtils]: 12: Hoare triple {60286#(< main_~c~0 199989)} assume !(~c~0 == ~last~0); {60286#(< main_~c~0 199989)} is VALID [2022-04-15 06:31:28,931 INFO L290 TraceCheckUtils]: 11: Hoare triple {60286#(< main_~c~0 199989)} assume !!(~c~0 < 200000); {60286#(< main_~c~0 199989)} is VALID [2022-04-15 06:31:28,931 INFO L290 TraceCheckUtils]: 10: Hoare triple {60296#(< main_~c~0 199988)} #t~post5 := ~c~0;~c~0 := 1 + #t~post5;havoc #t~post5; {60286#(< main_~c~0 199989)} is VALID [2022-04-15 06:31:28,931 INFO L290 TraceCheckUtils]: 9: Hoare triple {60296#(< main_~c~0 199988)} assume ~c~0 == ~last~0;~st~0 := 0; {60296#(< main_~c~0 199988)} is VALID [2022-04-15 06:31:28,932 INFO L290 TraceCheckUtils]: 8: Hoare triple {60296#(< main_~c~0 199988)} assume !!(~c~0 < 200000); {60296#(< main_~c~0 199988)} is VALID [2022-04-15 06:31:28,932 INFO L290 TraceCheckUtils]: 7: Hoare triple {59991#true} [201] L23-3_primed-->L23-3: Formula: (and (= v_main_~c~0_7 0) (= v_main_~st~0_6 1)) InVars {} OutVars{main_~c~0=v_main_~c~0_7, main_~st~0=v_main_~st~0_6} AuxVars[] AssignedVars[main_~c~0, main_~st~0] {60296#(< main_~c~0 199988)} is VALID [2022-04-15 06:31:28,932 INFO L290 TraceCheckUtils]: 6: Hoare triple {59991#true} [202] L30-->L23-3_primed: Formula: (let ((.cse0 (= v_main_~st~0_365 v_main_~st~0_363)) (.cse1 (= v_main_~b~0_188 v_main_~b~0_187)) (.cse2 (= v_main_~a~0_191 v_main_~a~0_190)) (.cse3 (= |v_main_#t~post5_538| |v_main_#t~post5_526|))) (or (and .cse0 (= v_main_~c~0_1174 v_main_~c~0_1187) .cse1 .cse2 .cse3) (and .cse0 .cse1 (= v_main_~c~0_1187 v_main_~c~0_1174) .cse2 .cse3))) InVars {main_~c~0=v_main_~c~0_1187, main_#t~post5=|v_main_#t~post5_538|, main_~st~0=v_main_~st~0_365, main_~b~0=v_main_~b~0_188, main_~a~0=v_main_~a~0_191} OutVars{main_~c~0=v_main_~c~0_1174, main_#t~post5=|v_main_#t~post5_526|, main_~st~0=v_main_~st~0_363, main_~b~0=v_main_~b~0_187, main_~a~0=v_main_~a~0_190} AuxVars[] AssignedVars[main_~c~0, main_#t~post5, main_~st~0, main_~b~0, main_~a~0] {59991#true} is VALID [2022-04-15 06:31:28,932 INFO L290 TraceCheckUtils]: 5: Hoare triple {59991#true} assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~last~0 := #t~nondet4;havoc #t~nondet4;~a~0 := 0;~b~0 := 0;~c~0 := 0;~st~0 := 0; {59991#true} is VALID [2022-04-15 06:31:28,932 INFO L272 TraceCheckUtils]: 4: Hoare triple {59991#true} call #t~ret6 := main(); {59991#true} is VALID [2022-04-15 06:31:28,932 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {59991#true} {59991#true} #66#return; {59991#true} is VALID [2022-04-15 06:31:28,932 INFO L290 TraceCheckUtils]: 2: Hoare triple {59991#true} assume true; {59991#true} is VALID [2022-04-15 06:31:28,933 INFO L290 TraceCheckUtils]: 1: Hoare triple {59991#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(11, 2);call #Ultimate.allocInit(12, 3);~last~0 := 0; {59991#true} is VALID [2022-04-15 06:31:28,933 INFO L272 TraceCheckUtils]: 0: Hoare triple {59991#true} call ULTIMATE.init(); {59991#true} is VALID [2022-04-15 06:31:28,933 INFO L134 CoverageAnalysis]: Checked inductivity of 210 backedges. 0 proven. 210 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 06:31:28,933 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1260102894] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 06:31:28,933 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 06:31:28,933 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 15, 15] total 30 [2022-04-15 06:31:29,330 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 06:31:29,330 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [579026489] [2022-04-15 06:31:29,330 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [579026489] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 06:31:29,330 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 06:31:29,330 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [30] imperfect sequences [] total 30 [2022-04-15 06:31:29,330 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1947672356] [2022-04-15 06:31:29,330 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 06:31:29,331 INFO L78 Accepts]: Start accepts. Automaton has has 30 states, 30 states have (on average 2.9) internal successors, (87), 29 states have internal predecessors, (87), 2 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 95 [2022-04-15 06:31:29,331 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 06:31:29,331 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 30 states, 30 states have (on average 2.9) internal successors, (87), 29 states have internal predecessors, (87), 2 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-15 06:31:29,395 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-15 06:31:29,395 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2022-04-15 06:31:29,395 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 06:31:29,396 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2022-04-15 06:31:29,396 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=724, Invalid=1168, Unknown=0, NotChecked=0, Total=1892 [2022-04-15 06:31:29,397 INFO L87 Difference]: Start difference. First operand 402 states and 457 transitions. Second operand has 30 states, 30 states have (on average 2.9) internal successors, (87), 29 states have internal predecessors, (87), 2 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-15 06:31:32,880 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:31:32,881 INFO L93 Difference]: Finished difference Result 608 states and 700 transitions. [2022-04-15 06:31:32,881 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2022-04-15 06:31:32,881 INFO L78 Accepts]: Start accepts. Automaton has has 30 states, 30 states have (on average 2.9) internal successors, (87), 29 states have internal predecessors, (87), 2 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 95 [2022-04-15 06:31:32,881 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 06:31:32,881 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30 states, 30 states have (on average 2.9) internal successors, (87), 29 states have internal predecessors, (87), 2 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-15 06:31:32,882 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 130 transitions. [2022-04-15 06:31:32,882 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30 states, 30 states have (on average 2.9) internal successors, (87), 29 states have internal predecessors, (87), 2 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-15 06:31:32,883 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 130 transitions. [2022-04-15 06:31:32,883 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 30 states and 130 transitions. [2022-04-15 06:31:32,971 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 130 edges. 130 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 06:31:32,981 INFO L225 Difference]: With dead ends: 608 [2022-04-15 06:31:32,982 INFO L226 Difference]: Without dead ends: 514 [2022-04-15 06:31:32,982 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 171 GetRequests, 110 SyntacticMatches, 19 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1751 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=724, Invalid=1168, Unknown=0, NotChecked=0, Total=1892 [2022-04-15 06:31:32,982 INFO L913 BasicCegarLoop]: 18 mSDtfsCounter, 85 mSDsluCounter, 16 mSDsCounter, 0 mSdLazyCounter, 579 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 85 SdHoareTripleChecker+Valid, 34 SdHoareTripleChecker+Invalid, 594 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 579 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-04-15 06:31:32,982 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [85 Valid, 34 Invalid, 594 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 579 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-04-15 06:31:32,983 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 514 states. [2022-04-15 06:31:35,290 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 514 to 446. [2022-04-15 06:31:35,290 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 06:31:35,291 INFO L82 GeneralOperation]: Start isEquivalent. First operand 514 states. Second operand has 446 states, 438 states have (on average 1.1324200913242009) internal successors, (496), 439 states have internal predecessors, (496), 4 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-15 06:31:35,291 INFO L74 IsIncluded]: Start isIncluded. First operand 514 states. Second operand has 446 states, 438 states have (on average 1.1324200913242009) internal successors, (496), 439 states have internal predecessors, (496), 4 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-15 06:31:35,291 INFO L87 Difference]: Start difference. First operand 514 states. Second operand has 446 states, 438 states have (on average 1.1324200913242009) internal successors, (496), 439 states have internal predecessors, (496), 4 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-15 06:31:35,299 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:31:35,299 INFO L93 Difference]: Finished difference Result 514 states and 573 transitions. [2022-04-15 06:31:35,299 INFO L276 IsEmpty]: Start isEmpty. Operand 514 states and 573 transitions. [2022-04-15 06:31:35,299 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 06:31:35,299 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 06:31:35,299 INFO L74 IsIncluded]: Start isIncluded. First operand has 446 states, 438 states have (on average 1.1324200913242009) internal successors, (496), 439 states have internal predecessors, (496), 4 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) Second operand 514 states. [2022-04-15 06:31:35,300 INFO L87 Difference]: Start difference. First operand has 446 states, 438 states have (on average 1.1324200913242009) internal successors, (496), 439 states have internal predecessors, (496), 4 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) Second operand 514 states. [2022-04-15 06:31:35,307 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:31:35,307 INFO L93 Difference]: Finished difference Result 514 states and 573 transitions. [2022-04-15 06:31:35,307 INFO L276 IsEmpty]: Start isEmpty. Operand 514 states and 573 transitions. [2022-04-15 06:31:35,307 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 06:31:35,307 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 06:31:35,307 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 06:31:35,307 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 06:31:35,307 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 446 states, 438 states have (on average 1.1324200913242009) internal successors, (496), 439 states have internal predecessors, (496), 4 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-15 06:31:35,315 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 446 states to 446 states and 503 transitions. [2022-04-15 06:31:35,316 INFO L78 Accepts]: Start accepts. Automaton has 446 states and 503 transitions. Word has length 95 [2022-04-15 06:31:35,316 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 06:31:35,316 INFO L478 AbstractCegarLoop]: Abstraction has 446 states and 503 transitions. [2022-04-15 06:31:35,316 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 30 states, 30 states have (on average 2.9) internal successors, (87), 29 states have internal predecessors, (87), 2 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-15 06:31:35,316 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 446 states and 503 transitions. [2022-04-15 06:31:36,698 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 503 edges. 503 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 06:31:36,698 INFO L276 IsEmpty]: Start isEmpty. Operand 446 states and 503 transitions. [2022-04-15 06:31:36,699 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2022-04-15 06:31:36,699 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 06:31:36,699 INFO L499 BasicCegarLoop]: trace histogram [27, 27, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 06:31:36,716 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (38)] Ended with exit code 0 [2022-04-15 06:31:36,916 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable41,38 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 06:31:36,916 INFO L403 AbstractCegarLoop]: === Iteration 43 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 06:31:36,916 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 06:31:36,916 INFO L85 PathProgramCache]: Analyzing trace with hash -91153980, now seen corresponding path program 26 times [2022-04-15 06:31:36,916 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 06:31:36,916 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1441434700] [2022-04-15 06:31:37,870 WARN L970 rdanLoopAcceleration]: Unable to prove correctness of quantifier elimination. [2022-04-15 06:31:37,988 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 1 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-15 06:31:38,195 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {0={1=1}, 1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-15 06:31:38,196 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-15 06:31:38,198 INFO L85 PathProgramCache]: Analyzing trace with hash -951001528, now seen corresponding path program 1 times [2022-04-15 06:31:38,198 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 06:31:38,198 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [184713370] [2022-04-15 06:31:38,198 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 06:31:38,198 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 06:31:38,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:31:38,311 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 06:31:38,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:31:38,314 INFO L290 TraceCheckUtils]: 0: Hoare triple {63491#(and (= ~last~0 |old(~last~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(11, 2);call #Ultimate.allocInit(12, 3);~last~0 := 0; {63479#true} is VALID [2022-04-15 06:31:38,315 INFO L290 TraceCheckUtils]: 1: Hoare triple {63479#true} assume true; {63479#true} is VALID [2022-04-15 06:31:38,315 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {63479#true} {63479#true} #66#return; {63479#true} is VALID [2022-04-15 06:31:38,315 INFO L272 TraceCheckUtils]: 0: Hoare triple {63479#true} call ULTIMATE.init(); {63491#(and (= ~last~0 |old(~last~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 06:31:38,315 INFO L290 TraceCheckUtils]: 1: Hoare triple {63491#(and (= ~last~0 |old(~last~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(11, 2);call #Ultimate.allocInit(12, 3);~last~0 := 0; {63479#true} is VALID [2022-04-15 06:31:38,315 INFO L290 TraceCheckUtils]: 2: Hoare triple {63479#true} assume true; {63479#true} is VALID [2022-04-15 06:31:38,315 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {63479#true} {63479#true} #66#return; {63479#true} is VALID [2022-04-15 06:31:38,315 INFO L272 TraceCheckUtils]: 4: Hoare triple {63479#true} call #t~ret6 := main(); {63479#true} is VALID [2022-04-15 06:31:38,316 INFO L290 TraceCheckUtils]: 5: Hoare triple {63479#true} assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~last~0 := #t~nondet4;havoc #t~nondet4;~a~0 := 0;~b~0 := 0;~c~0 := 0;~st~0 := 0; {63484#(and (= main_~a~0 0) (= main_~b~0 0))} is VALID [2022-04-15 06:31:38,316 INFO L290 TraceCheckUtils]: 6: Hoare triple {63484#(and (= main_~a~0 0) (= main_~b~0 0))} assume !false;~st~0 := 1;~c~0 := 0; {63485#(and (= main_~a~0 0) (= main_~st~0 1) (= main_~b~0 0))} is VALID [2022-04-15 06:31:38,317 INFO L290 TraceCheckUtils]: 7: Hoare triple {63485#(and (= main_~a~0 0) (= main_~st~0 1) (= main_~b~0 0))} [204] L23-3-->L23-4_primed: Formula: (let ((.cse1 (= v_main_~c~0_1227 v_main_~c~0_1226)) (.cse2 (= |v_main_#t~post5_554| |v_main_#t~post5_552|)) (.cse0 (= v_~last~0_280 v_main_~c~0_1227))) (or (and (or (not (<= (+ v_~last~0_280 1) v_main_~c~0_1226)) (not (<= (+ v_main_~c~0_1227 1) v_~last~0_280))) (< v_main_~c~0_1227 v_main_~c~0_1226) (not .cse0) (< v_main_~c~0_1226 200001)) (and .cse1 .cse2 (= v_~last~0_280 v_~last~0_280)) (and .cse1 .cse2 (or (not (< v_main_~c~0_1227 200000)) .cse0)))) InVars {main_~c~0=v_main_~c~0_1227, main_#t~post5=|v_main_#t~post5_554|, ~last~0=v_~last~0_280} OutVars{main_#t~post5=|v_main_#t~post5_552|, main_~c~0=v_main_~c~0_1226, ~last~0=v_~last~0_280} AuxVars[] AssignedVars[main_#t~post5, main_~c~0] {63485#(and (= main_~a~0 0) (= main_~st~0 1) (= main_~b~0 0))} is VALID [2022-04-15 06:31:38,317 INFO L290 TraceCheckUtils]: 8: Hoare triple {63485#(and (= main_~a~0 0) (= main_~st~0 1) (= main_~b~0 0))} [205] L23-4_primed-->L23-3: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {63485#(and (= main_~a~0 0) (= main_~st~0 1) (= main_~b~0 0))} is VALID [2022-04-15 06:31:38,318 INFO L290 TraceCheckUtils]: 9: Hoare triple {63485#(and (= main_~a~0 0) (= main_~st~0 1) (= main_~b~0 0))} [206] L23-3-->L23-4_primed: Formula: (let ((.cse0 (= v_main_~c~0_1229 v_main_~c~0_1228)) (.cse1 (= |v_main_#t~post5_557| |v_main_#t~post5_553|)) (.cse2 (= v_main_~st~0_371 v_main_~st~0_370)) (.cse3 (< v_main_~c~0_1229 200000)) (.cse4 (= v_~last~0_281 v_main_~c~0_1229))) (or (and .cse0 .cse1 .cse2 (= v_~last~0_281 v_~last~0_281)) (and (= v_main_~st~0_370 0) .cse3 (< v_main_~c~0_1229 v_main_~c~0_1228) .cse4 (<= v_main_~c~0_1228 (+ v_~last~0_281 1))) (and .cse0 .cse1 .cse2 (or (not .cse3) (not .cse4))))) InVars {main_~c~0=v_main_~c~0_1229, main_#t~post5=|v_main_#t~post5_557|, main_~st~0=v_main_~st~0_371, ~last~0=v_~last~0_281} OutVars{main_#t~post5=|v_main_#t~post5_553|, main_~c~0=v_main_~c~0_1228, main_~st~0=v_main_~st~0_370, ~last~0=v_~last~0_281} AuxVars[] AssignedVars[main_#t~post5, main_~c~0, main_~st~0] {63486#(or (= main_~st~0 1) (and (= main_~a~0 0) (or (<= ~last~0 199999) (<= main_~c~0 200000)) (= main_~b~0 0)))} is VALID [2022-04-15 06:31:38,318 INFO L290 TraceCheckUtils]: 10: Hoare triple {63486#(or (= main_~st~0 1) (and (= main_~a~0 0) (or (<= ~last~0 199999) (<= main_~c~0 200000)) (= main_~b~0 0)))} [203] L23-4_primed-->L23-4: Formula: (not (< v_main_~c~0_8 200000)) InVars {main_~c~0=v_main_~c~0_8} OutVars{main_~c~0=v_main_~c~0_8} AuxVars[] AssignedVars[] {63487#(or (= main_~st~0 1) (and (= main_~a~0 0) (or (<= ~last~0 199999) (<= main_~c~0 200000)) (= main_~b~0 0) (< 199999 main_~c~0)))} is VALID [2022-04-15 06:31:38,319 INFO L290 TraceCheckUtils]: 11: Hoare triple {63487#(or (= main_~st~0 1) (and (= main_~a~0 0) (or (<= ~last~0 199999) (<= main_~c~0 200000)) (= main_~b~0 0) (< 199999 main_~c~0)))} assume 0 == ~st~0 && ~c~0 == 1 + ~last~0;~a~0 := 3 + ~a~0;~b~0 := 3 + ~b~0; {63488#(and (<= main_~b~0 main_~a~0) (< main_~a~0 (+ main_~b~0 1)) (< 199999 main_~c~0) (<= main_~c~0 200000))} is VALID [2022-04-15 06:31:38,319 INFO L290 TraceCheckUtils]: 12: Hoare triple {63488#(and (<= main_~b~0 main_~a~0) (< main_~a~0 (+ main_~b~0 1)) (< 199999 main_~c~0) (<= main_~c~0 200000))} assume !(~c~0 == ~last~0 && 0 == ~st~0); {63488#(and (<= main_~b~0 main_~a~0) (< main_~a~0 (+ main_~b~0 1)) (< 199999 main_~c~0) (<= main_~c~0 200000))} is VALID [2022-04-15 06:31:38,320 INFO L272 TraceCheckUtils]: 13: Hoare triple {63488#(and (<= main_~b~0 main_~a~0) (< main_~a~0 (+ main_~b~0 1)) (< 199999 main_~c~0) (<= main_~c~0 200000))} call __VERIFIER_assert((if ~a~0 == ~b~0 && 200000 == ~c~0 then 1 else 0)); {63489#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-15 06:31:38,320 INFO L290 TraceCheckUtils]: 14: Hoare triple {63489#(not (= |__VERIFIER_assert_#in~cond| 0))} ~cond := #in~cond; {63490#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-15 06:31:38,320 INFO L290 TraceCheckUtils]: 15: Hoare triple {63490#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {63480#false} is VALID [2022-04-15 06:31:38,321 INFO L290 TraceCheckUtils]: 16: Hoare triple {63480#false} assume !false; {63480#false} is VALID [2022-04-15 06:31:38,321 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-04-15 06:31:38,321 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 06:31:38,321 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [184713370] [2022-04-15 06:31:38,321 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [184713370] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 06:31:38,321 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [831576414] [2022-04-15 06:31:38,321 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 06:31:38,321 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 06:31:38,321 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 06:31:38,327 INFO L229 MonitoredProcess]: Starting monitored process 39 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-15 06:31:38,328 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (39)] Waiting until timeout for monitored process [2022-04-15 06:31:38,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:31:38,355 INFO L263 TraceCheckSpWp]: Trace formula consists of 85 conjuncts, 18 conjunts are in the unsatisfiable core [2022-04-15 06:31:38,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:31:38,361 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 06:31:38,662 INFO L272 TraceCheckUtils]: 0: Hoare triple {63479#true} call ULTIMATE.init(); {63479#true} is VALID [2022-04-15 06:31:38,662 INFO L290 TraceCheckUtils]: 1: Hoare triple {63479#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(11, 2);call #Ultimate.allocInit(12, 3);~last~0 := 0; {63479#true} is VALID [2022-04-15 06:31:38,662 INFO L290 TraceCheckUtils]: 2: Hoare triple {63479#true} assume true; {63479#true} is VALID [2022-04-15 06:31:38,662 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {63479#true} {63479#true} #66#return; {63479#true} is VALID [2022-04-15 06:31:38,662 INFO L272 TraceCheckUtils]: 4: Hoare triple {63479#true} call #t~ret6 := main(); {63479#true} is VALID [2022-04-15 06:31:38,663 INFO L290 TraceCheckUtils]: 5: Hoare triple {63479#true} assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~last~0 := #t~nondet4;havoc #t~nondet4;~a~0 := 0;~b~0 := 0;~c~0 := 0;~st~0 := 0; {63484#(and (= main_~a~0 0) (= main_~b~0 0))} is VALID [2022-04-15 06:31:38,663 INFO L290 TraceCheckUtils]: 6: Hoare triple {63484#(and (= main_~a~0 0) (= main_~b~0 0))} assume !false;~st~0 := 1;~c~0 := 0; {63485#(and (= main_~a~0 0) (= main_~st~0 1) (= main_~b~0 0))} is VALID [2022-04-15 06:31:38,664 INFO L290 TraceCheckUtils]: 7: Hoare triple {63485#(and (= main_~a~0 0) (= main_~st~0 1) (= main_~b~0 0))} [204] L23-3-->L23-4_primed: Formula: (let ((.cse1 (= v_main_~c~0_1227 v_main_~c~0_1226)) (.cse2 (= |v_main_#t~post5_554| |v_main_#t~post5_552|)) (.cse0 (= v_~last~0_280 v_main_~c~0_1227))) (or (and (or (not (<= (+ v_~last~0_280 1) v_main_~c~0_1226)) (not (<= (+ v_main_~c~0_1227 1) v_~last~0_280))) (< v_main_~c~0_1227 v_main_~c~0_1226) (not .cse0) (< v_main_~c~0_1226 200001)) (and .cse1 .cse2 (= v_~last~0_280 v_~last~0_280)) (and .cse1 .cse2 (or (not (< v_main_~c~0_1227 200000)) .cse0)))) InVars {main_~c~0=v_main_~c~0_1227, main_#t~post5=|v_main_#t~post5_554|, ~last~0=v_~last~0_280} OutVars{main_#t~post5=|v_main_#t~post5_552|, main_~c~0=v_main_~c~0_1226, ~last~0=v_~last~0_280} AuxVars[] AssignedVars[main_#t~post5, main_~c~0] {63485#(and (= main_~a~0 0) (= main_~st~0 1) (= main_~b~0 0))} is VALID [2022-04-15 06:31:38,664 INFO L290 TraceCheckUtils]: 8: Hoare triple {63485#(and (= main_~a~0 0) (= main_~st~0 1) (= main_~b~0 0))} [205] L23-4_primed-->L23-3: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {63485#(and (= main_~a~0 0) (= main_~st~0 1) (= main_~b~0 0))} is VALID [2022-04-15 06:31:38,665 INFO L290 TraceCheckUtils]: 9: Hoare triple {63485#(and (= main_~a~0 0) (= main_~st~0 1) (= main_~b~0 0))} [206] L23-3-->L23-4_primed: Formula: (let ((.cse0 (= v_main_~c~0_1229 v_main_~c~0_1228)) (.cse1 (= |v_main_#t~post5_557| |v_main_#t~post5_553|)) (.cse2 (= v_main_~st~0_371 v_main_~st~0_370)) (.cse3 (< v_main_~c~0_1229 200000)) (.cse4 (= v_~last~0_281 v_main_~c~0_1229))) (or (and .cse0 .cse1 .cse2 (= v_~last~0_281 v_~last~0_281)) (and (= v_main_~st~0_370 0) .cse3 (< v_main_~c~0_1229 v_main_~c~0_1228) .cse4 (<= v_main_~c~0_1228 (+ v_~last~0_281 1))) (and .cse0 .cse1 .cse2 (or (not .cse3) (not .cse4))))) InVars {main_~c~0=v_main_~c~0_1229, main_#t~post5=|v_main_#t~post5_557|, main_~st~0=v_main_~st~0_371, ~last~0=v_~last~0_281} OutVars{main_#t~post5=|v_main_#t~post5_553|, main_~c~0=v_main_~c~0_1228, main_~st~0=v_main_~st~0_370, ~last~0=v_~last~0_281} AuxVars[] AssignedVars[main_#t~post5, main_~c~0, main_~st~0] {63522#(and (= main_~a~0 0) (= main_~b~0 0) (or (and (< ~last~0 200000) (< ~last~0 main_~c~0) (<= main_~c~0 (+ ~last~0 1)) (= main_~st~0 0)) (= main_~st~0 1)))} is VALID [2022-04-15 06:31:38,666 INFO L290 TraceCheckUtils]: 10: Hoare triple {63522#(and (= main_~a~0 0) (= main_~b~0 0) (or (and (< ~last~0 200000) (< ~last~0 main_~c~0) (<= main_~c~0 (+ ~last~0 1)) (= main_~st~0 0)) (= main_~st~0 1)))} [203] L23-4_primed-->L23-4: Formula: (not (< v_main_~c~0_8 200000)) InVars {main_~c~0=v_main_~c~0_8} OutVars{main_~c~0=v_main_~c~0_8} AuxVars[] AssignedVars[] {63526#(and (= main_~a~0 0) (or (= main_~st~0 1) (and (< ~last~0 200000) (<= main_~c~0 (+ ~last~0 1)) (= main_~st~0 0))) (= main_~b~0 0) (not (< main_~c~0 200000)))} is VALID [2022-04-15 06:31:38,666 INFO L290 TraceCheckUtils]: 11: Hoare triple {63526#(and (= main_~a~0 0) (or (= main_~st~0 1) (and (< ~last~0 200000) (<= main_~c~0 (+ ~last~0 1)) (= main_~st~0 0))) (= main_~b~0 0) (not (< main_~c~0 200000)))} assume 0 == ~st~0 && ~c~0 == 1 + ~last~0;~a~0 := 3 + ~a~0;~b~0 := 3 + ~b~0; {63530#(and (= main_~b~0 3) (<= 200000 main_~c~0) (< main_~c~0 200001) (= main_~a~0 3))} is VALID [2022-04-15 06:31:38,667 INFO L290 TraceCheckUtils]: 12: Hoare triple {63530#(and (= main_~b~0 3) (<= 200000 main_~c~0) (< main_~c~0 200001) (= main_~a~0 3))} assume !(~c~0 == ~last~0 && 0 == ~st~0); {63530#(and (= main_~b~0 3) (<= 200000 main_~c~0) (< main_~c~0 200001) (= main_~a~0 3))} is VALID [2022-04-15 06:31:38,668 INFO L272 TraceCheckUtils]: 13: Hoare triple {63530#(and (= main_~b~0 3) (<= 200000 main_~c~0) (< main_~c~0 200001) (= main_~a~0 3))} call __VERIFIER_assert((if ~a~0 == ~b~0 && 200000 == ~c~0 then 1 else 0)); {63537#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-15 06:31:38,668 INFO L290 TraceCheckUtils]: 14: Hoare triple {63537#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {63541#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-15 06:31:38,669 INFO L290 TraceCheckUtils]: 15: Hoare triple {63541#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {63480#false} is VALID [2022-04-15 06:31:38,669 INFO L290 TraceCheckUtils]: 16: Hoare triple {63480#false} assume !false; {63480#false} is VALID [2022-04-15 06:31:38,669 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-04-15 06:31:38,669 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 06:31:39,127 INFO L290 TraceCheckUtils]: 16: Hoare triple {63480#false} assume !false; {63480#false} is VALID [2022-04-15 06:31:39,128 INFO L290 TraceCheckUtils]: 15: Hoare triple {63541#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {63480#false} is VALID [2022-04-15 06:31:39,128 INFO L290 TraceCheckUtils]: 14: Hoare triple {63537#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {63541#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-15 06:31:39,129 INFO L272 TraceCheckUtils]: 13: Hoare triple {63488#(and (<= main_~b~0 main_~a~0) (< main_~a~0 (+ main_~b~0 1)) (< 199999 main_~c~0) (<= main_~c~0 200000))} call __VERIFIER_assert((if ~a~0 == ~b~0 && 200000 == ~c~0 then 1 else 0)); {63537#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-15 06:31:39,130 INFO L290 TraceCheckUtils]: 12: Hoare triple {63488#(and (<= main_~b~0 main_~a~0) (< main_~a~0 (+ main_~b~0 1)) (< 199999 main_~c~0) (<= main_~c~0 200000))} assume !(~c~0 == ~last~0 && 0 == ~st~0); {63488#(and (<= main_~b~0 main_~a~0) (< main_~a~0 (+ main_~b~0 1)) (< 199999 main_~c~0) (<= main_~c~0 200000))} is VALID [2022-04-15 06:31:39,131 INFO L290 TraceCheckUtils]: 11: Hoare triple {63563#(or (not (<= main_~c~0 (+ ~last~0 1))) (and (<= main_~b~0 main_~a~0) (< main_~a~0 (+ main_~b~0 1)) (< 199999 main_~c~0) (<= main_~c~0 200000)) (not (= main_~st~0 0)))} assume 0 == ~st~0 && ~c~0 == 1 + ~last~0;~a~0 := 3 + ~a~0;~b~0 := 3 + ~b~0; {63488#(and (<= main_~b~0 main_~a~0) (< main_~a~0 (+ main_~b~0 1)) (< 199999 main_~c~0) (<= main_~c~0 200000))} is VALID [2022-04-15 06:31:39,131 INFO L290 TraceCheckUtils]: 10: Hoare triple {63567#(or (not (<= main_~c~0 (+ ~last~0 1))) (and (<= main_~b~0 main_~a~0) (< main_~a~0 (+ main_~b~0 1)) (<= main_~c~0 200000)) (not (= main_~st~0 0)) (< main_~c~0 200000))} [203] L23-4_primed-->L23-4: Formula: (not (< v_main_~c~0_8 200000)) InVars {main_~c~0=v_main_~c~0_8} OutVars{main_~c~0=v_main_~c~0_8} AuxVars[] AssignedVars[] {63563#(or (not (<= main_~c~0 (+ ~last~0 1))) (and (<= main_~b~0 main_~a~0) (< main_~a~0 (+ main_~b~0 1)) (< 199999 main_~c~0) (<= main_~c~0 200000)) (not (= main_~st~0 0)))} is VALID [2022-04-15 06:31:39,132 INFO L290 TraceCheckUtils]: 9: Hoare triple {63571#(and (<= main_~b~0 main_~a~0) (< main_~a~0 (+ main_~b~0 1)) (not (= main_~st~0 0)))} [206] L23-3-->L23-4_primed: Formula: (let ((.cse0 (= v_main_~c~0_1229 v_main_~c~0_1228)) (.cse1 (= |v_main_#t~post5_557| |v_main_#t~post5_553|)) (.cse2 (= v_main_~st~0_371 v_main_~st~0_370)) (.cse3 (< v_main_~c~0_1229 200000)) (.cse4 (= v_~last~0_281 v_main_~c~0_1229))) (or (and .cse0 .cse1 .cse2 (= v_~last~0_281 v_~last~0_281)) (and (= v_main_~st~0_370 0) .cse3 (< v_main_~c~0_1229 v_main_~c~0_1228) .cse4 (<= v_main_~c~0_1228 (+ v_~last~0_281 1))) (and .cse0 .cse1 .cse2 (or (not .cse3) (not .cse4))))) InVars {main_~c~0=v_main_~c~0_1229, main_#t~post5=|v_main_#t~post5_557|, main_~st~0=v_main_~st~0_371, ~last~0=v_~last~0_281} OutVars{main_#t~post5=|v_main_#t~post5_553|, main_~c~0=v_main_~c~0_1228, main_~st~0=v_main_~st~0_370, ~last~0=v_~last~0_281} AuxVars[] AssignedVars[main_#t~post5, main_~c~0, main_~st~0] {63567#(or (not (<= main_~c~0 (+ ~last~0 1))) (and (<= main_~b~0 main_~a~0) (< main_~a~0 (+ main_~b~0 1)) (<= main_~c~0 200000)) (not (= main_~st~0 0)) (< main_~c~0 200000))} is VALID [2022-04-15 06:31:39,133 INFO L290 TraceCheckUtils]: 8: Hoare triple {63571#(and (<= main_~b~0 main_~a~0) (< main_~a~0 (+ main_~b~0 1)) (not (= main_~st~0 0)))} [205] L23-4_primed-->L23-3: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {63571#(and (<= main_~b~0 main_~a~0) (< main_~a~0 (+ main_~b~0 1)) (not (= main_~st~0 0)))} is VALID [2022-04-15 06:31:39,133 INFO L290 TraceCheckUtils]: 7: Hoare triple {63571#(and (<= main_~b~0 main_~a~0) (< main_~a~0 (+ main_~b~0 1)) (not (= main_~st~0 0)))} [204] L23-3-->L23-4_primed: Formula: (let ((.cse1 (= v_main_~c~0_1227 v_main_~c~0_1226)) (.cse2 (= |v_main_#t~post5_554| |v_main_#t~post5_552|)) (.cse0 (= v_~last~0_280 v_main_~c~0_1227))) (or (and (or (not (<= (+ v_~last~0_280 1) v_main_~c~0_1226)) (not (<= (+ v_main_~c~0_1227 1) v_~last~0_280))) (< v_main_~c~0_1227 v_main_~c~0_1226) (not .cse0) (< v_main_~c~0_1226 200001)) (and .cse1 .cse2 (= v_~last~0_280 v_~last~0_280)) (and .cse1 .cse2 (or (not (< v_main_~c~0_1227 200000)) .cse0)))) InVars {main_~c~0=v_main_~c~0_1227, main_#t~post5=|v_main_#t~post5_554|, ~last~0=v_~last~0_280} OutVars{main_#t~post5=|v_main_#t~post5_552|, main_~c~0=v_main_~c~0_1226, ~last~0=v_~last~0_280} AuxVars[] AssignedVars[main_#t~post5, main_~c~0] {63571#(and (<= main_~b~0 main_~a~0) (< main_~a~0 (+ main_~b~0 1)) (not (= main_~st~0 0)))} is VALID [2022-04-15 06:31:39,134 INFO L290 TraceCheckUtils]: 6: Hoare triple {63581#(and (<= main_~b~0 main_~a~0) (< main_~a~0 (+ main_~b~0 1)))} assume !false;~st~0 := 1;~c~0 := 0; {63571#(and (<= main_~b~0 main_~a~0) (< main_~a~0 (+ main_~b~0 1)) (not (= main_~st~0 0)))} is VALID [2022-04-15 06:31:39,134 INFO L290 TraceCheckUtils]: 5: Hoare triple {63479#true} assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~last~0 := #t~nondet4;havoc #t~nondet4;~a~0 := 0;~b~0 := 0;~c~0 := 0;~st~0 := 0; {63581#(and (<= main_~b~0 main_~a~0) (< main_~a~0 (+ main_~b~0 1)))} is VALID [2022-04-15 06:31:39,134 INFO L272 TraceCheckUtils]: 4: Hoare triple {63479#true} call #t~ret6 := main(); {63479#true} is VALID [2022-04-15 06:31:39,134 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {63479#true} {63479#true} #66#return; {63479#true} is VALID [2022-04-15 06:31:39,134 INFO L290 TraceCheckUtils]: 2: Hoare triple {63479#true} assume true; {63479#true} is VALID [2022-04-15 06:31:39,135 INFO L290 TraceCheckUtils]: 1: Hoare triple {63479#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(11, 2);call #Ultimate.allocInit(12, 3);~last~0 := 0; {63479#true} is VALID [2022-04-15 06:31:39,135 INFO L272 TraceCheckUtils]: 0: Hoare triple {63479#true} call ULTIMATE.init(); {63479#true} is VALID [2022-04-15 06:31:39,135 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-04-15 06:31:39,135 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [831576414] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 06:31:39,135 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 06:31:39,135 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9, 9] total 19 [2022-04-15 06:31:41,298 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 06:31:41,298 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1441434700] [2022-04-15 06:31:41,298 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1441434700] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 06:31:41,298 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 06:31:41,298 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [64] imperfect sequences [] total 64 [2022-04-15 06:31:41,298 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1455062082] [2022-04-15 06:31:41,298 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 06:31:41,299 INFO L78 Accepts]: Start accepts. Automaton has has 64 states, 64 states have (on average 1.421875) internal successors, (91), 62 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-15 06:31:41,299 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 06:31:41,299 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 64 states, 64 states have (on average 1.421875) internal successors, (91), 62 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-15 06:31:41,343 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 95 edges. 95 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 06:31:41,343 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 64 states [2022-04-15 06:31:41,343 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 06:31:41,344 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 64 interpolants. [2022-04-15 06:31:41,344 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=486, Invalid=4916, Unknown=0, NotChecked=0, Total=5402 [2022-04-15 06:31:41,344 INFO L87 Difference]: Start difference. First operand 446 states and 503 transitions. Second operand has 64 states, 64 states have (on average 1.421875) internal successors, (91), 62 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-15 06:31:52,406 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:31:52,406 INFO L93 Difference]: Finished difference Result 587 states and 666 transitions. [2022-04-15 06:31:52,406 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 92 states. [2022-04-15 06:31:52,407 INFO L78 Accepts]: Start accepts. Automaton has has 64 states, 64 states have (on average 1.421875) internal successors, (91), 62 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-15 06:31:52,407 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 06:31:52,407 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 64 states, 64 states have (on average 1.421875) internal successors, (91), 62 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-15 06:31:52,409 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 205 transitions. [2022-04-15 06:31:52,409 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 64 states, 64 states have (on average 1.421875) internal successors, (91), 62 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-15 06:31:52,410 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 205 transitions. [2022-04-15 06:31:52,410 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 92 states and 205 transitions. [2022-04-15 06:31:52,510 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 205 edges. 205 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 06:31:52,520 INFO L225 Difference]: With dead ends: 587 [2022-04-15 06:31:52,520 INFO L226 Difference]: Without dead ends: 495 [2022-04-15 06:31:52,521 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 157 GetRequests, 53 SyntacticMatches, 2 SemanticMatches, 102 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3037 ImplicationChecksByTransitivity, 3.1s TimeCoverageRelationStatistics Valid=773, Invalid=9939, Unknown=0, NotChecked=0, Total=10712 [2022-04-15 06:31:52,525 INFO L913 BasicCegarLoop]: 16 mSDtfsCounter, 115 mSDsluCounter, 191 mSDsCounter, 0 mSdLazyCounter, 7081 mSolverCounterSat, 121 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 117 SdHoareTripleChecker+Valid, 207 SdHoareTripleChecker+Invalid, 7202 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 121 IncrementalHoareTripleChecker+Valid, 7081 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.2s IncrementalHoareTripleChecker+Time [2022-04-15 06:31:52,525 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [117 Valid, 207 Invalid, 7202 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [121 Valid, 7081 Invalid, 0 Unknown, 0 Unchecked, 4.2s Time] [2022-04-15 06:31:52,526 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 495 states. [2022-04-15 06:31:54,120 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 495 to 449. [2022-04-15 06:31:54,120 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 06:31:54,121 INFO L82 GeneralOperation]: Start isEquivalent. First operand 495 states. Second operand has 449 states, 441 states have (on average 1.1337868480725624) internal successors, (500), 442 states have internal predecessors, (500), 4 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-15 06:31:54,121 INFO L74 IsIncluded]: Start isIncluded. First operand 495 states. Second operand has 449 states, 441 states have (on average 1.1337868480725624) internal successors, (500), 442 states have internal predecessors, (500), 4 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-15 06:31:54,122 INFO L87 Difference]: Start difference. First operand 495 states. Second operand has 449 states, 441 states have (on average 1.1337868480725624) internal successors, (500), 442 states have internal predecessors, (500), 4 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-15 06:31:54,133 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:31:54,133 INFO L93 Difference]: Finished difference Result 495 states and 555 transitions. [2022-04-15 06:31:54,133 INFO L276 IsEmpty]: Start isEmpty. Operand 495 states and 555 transitions. [2022-04-15 06:31:54,133 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 06:31:54,134 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 06:31:54,134 INFO L74 IsIncluded]: Start isIncluded. First operand has 449 states, 441 states have (on average 1.1337868480725624) internal successors, (500), 442 states have internal predecessors, (500), 4 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) Second operand 495 states. [2022-04-15 06:31:54,135 INFO L87 Difference]: Start difference. First operand has 449 states, 441 states have (on average 1.1337868480725624) internal successors, (500), 442 states have internal predecessors, (500), 4 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) Second operand 495 states. [2022-04-15 06:31:54,145 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:31:54,145 INFO L93 Difference]: Finished difference Result 495 states and 555 transitions. [2022-04-15 06:31:54,145 INFO L276 IsEmpty]: Start isEmpty. Operand 495 states and 555 transitions. [2022-04-15 06:31:54,146 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 06:31:54,146 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 06:31:54,146 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 06:31:54,146 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 06:31:54,146 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 449 states, 441 states have (on average 1.1337868480725624) internal successors, (500), 442 states have internal predecessors, (500), 4 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-15 06:31:54,158 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 449 states to 449 states and 507 transitions. [2022-04-15 06:31:54,158 INFO L78 Accepts]: Start accepts. Automaton has 449 states and 507 transitions. Word has length 95 [2022-04-15 06:31:54,158 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 06:31:54,158 INFO L478 AbstractCegarLoop]: Abstraction has 449 states and 507 transitions. [2022-04-15 06:31:54,158 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 64 states, 64 states have (on average 1.421875) internal successors, (91), 62 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-15 06:31:54,158 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 449 states and 507 transitions. [2022-04-15 06:31:55,641 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 507 edges. 507 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 06:31:55,641 INFO L276 IsEmpty]: Start isEmpty. Operand 449 states and 507 transitions. [2022-04-15 06:31:55,641 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2022-04-15 06:31:55,642 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 06:31:55,642 INFO L499 BasicCegarLoop]: trace histogram [28, 28, 27, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 06:31:55,657 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (39)] Ended with exit code 0 [2022-04-15 06:31:55,842 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 39 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable42 [2022-04-15 06:31:55,842 INFO L403 AbstractCegarLoop]: === Iteration 44 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 06:31:55,842 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 06:31:55,842 INFO L85 PathProgramCache]: Analyzing trace with hash -1353390233, now seen corresponding path program 27 times [2022-04-15 06:31:55,842 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 06:31:55,843 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [710535671] [2022-04-15 06:31:59,977 WARN L977 rdanLoopAcceleration]: Unable to prove correctness of quantifier elimination. [2022-04-15 06:32:00,076 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 1 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-15 06:32:00,214 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {0={1=1}, 1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-15 06:32:00,215 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-15 06:32:00,216 INFO L85 PathProgramCache]: Analyzing trace with hash 1554382664, now seen corresponding path program 1 times [2022-04-15 06:32:00,217 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 06:32:00,217 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1490549138] [2022-04-15 06:32:00,217 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 06:32:00,217 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 06:32:00,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:32:00,328 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 06:32:00,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:32:00,335 INFO L290 TraceCheckUtils]: 0: Hoare triple {66791#(and (= ~last~0 |old(~last~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(11, 2);call #Ultimate.allocInit(12, 3);~last~0 := 0; {66779#true} is VALID [2022-04-15 06:32:00,335 INFO L290 TraceCheckUtils]: 1: Hoare triple {66779#true} assume true; {66779#true} is VALID [2022-04-15 06:32:00,335 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {66779#true} {66779#true} #66#return; {66779#true} is VALID [2022-04-15 06:32:00,335 INFO L272 TraceCheckUtils]: 0: Hoare triple {66779#true} call ULTIMATE.init(); {66791#(and (= ~last~0 |old(~last~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 06:32:00,335 INFO L290 TraceCheckUtils]: 1: Hoare triple {66791#(and (= ~last~0 |old(~last~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(11, 2);call #Ultimate.allocInit(12, 3);~last~0 := 0; {66779#true} is VALID [2022-04-15 06:32:00,335 INFO L290 TraceCheckUtils]: 2: Hoare triple {66779#true} assume true; {66779#true} is VALID [2022-04-15 06:32:00,335 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {66779#true} {66779#true} #66#return; {66779#true} is VALID [2022-04-15 06:32:00,336 INFO L272 TraceCheckUtils]: 4: Hoare triple {66779#true} call #t~ret6 := main(); {66779#true} is VALID [2022-04-15 06:32:00,336 INFO L290 TraceCheckUtils]: 5: Hoare triple {66779#true} assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~last~0 := #t~nondet4;havoc #t~nondet4;~a~0 := 0;~b~0 := 0;~c~0 := 0;~st~0 := 0; {66784#(and (= main_~a~0 0) (= main_~b~0 0))} is VALID [2022-04-15 06:32:00,336 INFO L290 TraceCheckUtils]: 6: Hoare triple {66784#(and (= main_~a~0 0) (= main_~b~0 0))} assume !false;~st~0 := 1;~c~0 := 0; {66785#(and (= main_~a~0 0) (= main_~st~0 1) (= main_~b~0 0))} is VALID [2022-04-15 06:32:00,336 INFO L290 TraceCheckUtils]: 7: Hoare triple {66785#(and (= main_~a~0 0) (= main_~st~0 1) (= main_~b~0 0))} [208] L23-3-->L23-4_primed: Formula: (let ((.cse0 (= |v_main_#t~post5_567| |v_main_#t~post5_565|)) (.cse1 (= v_main_~c~0_1271 v_main_~c~0_1270)) (.cse2 (= v_~last~0_288 v_main_~c~0_1271))) (or (and (= v_~last~0_288 v_~last~0_288) .cse0 .cse1) (and (or .cse2 (not (< v_main_~c~0_1271 200000))) .cse0 .cse1) (and (< v_main_~c~0_1271 v_main_~c~0_1270) (or (not (<= (+ v_main_~c~0_1271 1) v_~last~0_288)) (not (<= (+ v_~last~0_288 1) v_main_~c~0_1270))) (not .cse2) (< v_main_~c~0_1270 200001)))) InVars {main_~c~0=v_main_~c~0_1271, main_#t~post5=|v_main_#t~post5_567|, ~last~0=v_~last~0_288} OutVars{main_#t~post5=|v_main_#t~post5_565|, main_~c~0=v_main_~c~0_1270, ~last~0=v_~last~0_288} AuxVars[] AssignedVars[main_#t~post5, main_~c~0] {66785#(and (= main_~a~0 0) (= main_~st~0 1) (= main_~b~0 0))} is VALID [2022-04-15 06:32:00,337 INFO L290 TraceCheckUtils]: 8: Hoare triple {66785#(and (= main_~a~0 0) (= main_~st~0 1) (= main_~b~0 0))} [209] L23-4_primed-->L23-3: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {66785#(and (= main_~a~0 0) (= main_~st~0 1) (= main_~b~0 0))} is VALID [2022-04-15 06:32:00,337 INFO L290 TraceCheckUtils]: 9: Hoare triple {66785#(and (= main_~a~0 0) (= main_~st~0 1) (= main_~b~0 0))} [210] L23-3-->L23-4_primed: Formula: (let ((.cse2 (< v_main_~c~0_1273 200000)) (.cse3 (= v_~last~0_289 v_main_~c~0_1273)) (.cse0 (= v_main_~c~0_1273 v_main_~c~0_1272)) (.cse1 (= v_main_~st~0_381 v_main_~st~0_380))) (or (and (= |v_main_#t~post5_566| |v_main_#t~post5_570|) .cse0 .cse1 (or (not .cse2) (not .cse3))) (and (<= v_main_~c~0_1272 (+ v_~last~0_289 1)) .cse2 (= v_main_~st~0_380 0) (< v_main_~c~0_1273 v_main_~c~0_1272) .cse3) (and .cse0 (= v_~last~0_289 v_~last~0_289) .cse1 (= |v_main_#t~post5_570| |v_main_#t~post5_566|)))) InVars {main_~c~0=v_main_~c~0_1273, main_#t~post5=|v_main_#t~post5_570|, main_~st~0=v_main_~st~0_381, ~last~0=v_~last~0_289} OutVars{main_#t~post5=|v_main_#t~post5_566|, main_~c~0=v_main_~c~0_1272, main_~st~0=v_main_~st~0_380, ~last~0=v_~last~0_289} AuxVars[] AssignedVars[main_#t~post5, main_~c~0, main_~st~0] {66786#(or (= main_~st~0 1) (and (= main_~a~0 0) (or (<= ~last~0 199999) (<= main_~c~0 200000)) (= main_~b~0 0)))} is VALID [2022-04-15 06:32:00,338 INFO L290 TraceCheckUtils]: 10: Hoare triple {66786#(or (= main_~st~0 1) (and (= main_~a~0 0) (or (<= ~last~0 199999) (<= main_~c~0 200000)) (= main_~b~0 0)))} [207] L23-4_primed-->L23-4: Formula: (not (< v_main_~c~0_8 200000)) InVars {main_~c~0=v_main_~c~0_8} OutVars{main_~c~0=v_main_~c~0_8} AuxVars[] AssignedVars[] {66787#(or (= main_~st~0 1) (and (= main_~a~0 0) (or (<= ~last~0 199999) (<= main_~c~0 200000)) (= main_~b~0 0) (< 199999 main_~c~0)))} is VALID [2022-04-15 06:32:00,338 INFO L290 TraceCheckUtils]: 11: Hoare triple {66787#(or (= main_~st~0 1) (and (= main_~a~0 0) (or (<= ~last~0 199999) (<= main_~c~0 200000)) (= main_~b~0 0) (< 199999 main_~c~0)))} assume 0 == ~st~0 && ~c~0 == 1 + ~last~0;~a~0 := 3 + ~a~0;~b~0 := 3 + ~b~0; {66788#(and (<= main_~b~0 main_~a~0) (< main_~a~0 (+ main_~b~0 1)) (< 199999 main_~c~0) (<= main_~c~0 200000))} is VALID [2022-04-15 06:32:00,338 INFO L290 TraceCheckUtils]: 12: Hoare triple {66788#(and (<= main_~b~0 main_~a~0) (< main_~a~0 (+ main_~b~0 1)) (< 199999 main_~c~0) (<= main_~c~0 200000))} assume !(~c~0 == ~last~0 && 0 == ~st~0); {66788#(and (<= main_~b~0 main_~a~0) (< main_~a~0 (+ main_~b~0 1)) (< 199999 main_~c~0) (<= main_~c~0 200000))} is VALID [2022-04-15 06:32:00,339 INFO L272 TraceCheckUtils]: 13: Hoare triple {66788#(and (<= main_~b~0 main_~a~0) (< main_~a~0 (+ main_~b~0 1)) (< 199999 main_~c~0) (<= main_~c~0 200000))} call __VERIFIER_assert((if ~a~0 == ~b~0 && 200000 == ~c~0 then 1 else 0)); {66789#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-15 06:32:00,339 INFO L290 TraceCheckUtils]: 14: Hoare triple {66789#(not (= |__VERIFIER_assert_#in~cond| 0))} ~cond := #in~cond; {66790#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-15 06:32:00,339 INFO L290 TraceCheckUtils]: 15: Hoare triple {66790#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {66780#false} is VALID [2022-04-15 06:32:00,339 INFO L290 TraceCheckUtils]: 16: Hoare triple {66780#false} assume !false; {66780#false} is VALID [2022-04-15 06:32:00,340 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-04-15 06:32:00,340 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 06:32:00,340 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1490549138] [2022-04-15 06:32:00,340 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1490549138] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 06:32:00,340 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1346530291] [2022-04-15 06:32:00,340 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 06:32:00,340 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 06:32:00,340 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 06:32:00,341 INFO L229 MonitoredProcess]: Starting monitored process 40 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-15 06:32:00,342 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (40)] Waiting until timeout for monitored process [2022-04-15 06:32:00,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:32:00,367 INFO L263 TraceCheckSpWp]: Trace formula consists of 85 conjuncts, 18 conjunts are in the unsatisfiable core [2022-04-15 06:32:00,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:32:00,371 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 06:32:00,538 INFO L272 TraceCheckUtils]: 0: Hoare triple {66779#true} call ULTIMATE.init(); {66779#true} is VALID [2022-04-15 06:32:00,538 INFO L290 TraceCheckUtils]: 1: Hoare triple {66779#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(11, 2);call #Ultimate.allocInit(12, 3);~last~0 := 0; {66779#true} is VALID [2022-04-15 06:32:00,538 INFO L290 TraceCheckUtils]: 2: Hoare triple {66779#true} assume true; {66779#true} is VALID [2022-04-15 06:32:00,538 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {66779#true} {66779#true} #66#return; {66779#true} is VALID [2022-04-15 06:32:00,538 INFO L272 TraceCheckUtils]: 4: Hoare triple {66779#true} call #t~ret6 := main(); {66779#true} is VALID [2022-04-15 06:32:00,538 INFO L290 TraceCheckUtils]: 5: Hoare triple {66779#true} assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~last~0 := #t~nondet4;havoc #t~nondet4;~a~0 := 0;~b~0 := 0;~c~0 := 0;~st~0 := 0; {66784#(and (= main_~a~0 0) (= main_~b~0 0))} is VALID [2022-04-15 06:32:00,539 INFO L290 TraceCheckUtils]: 6: Hoare triple {66784#(and (= main_~a~0 0) (= main_~b~0 0))} assume !false;~st~0 := 1;~c~0 := 0; {66785#(and (= main_~a~0 0) (= main_~st~0 1) (= main_~b~0 0))} is VALID [2022-04-15 06:32:00,539 INFO L290 TraceCheckUtils]: 7: Hoare triple {66785#(and (= main_~a~0 0) (= main_~st~0 1) (= main_~b~0 0))} [208] L23-3-->L23-4_primed: Formula: (let ((.cse0 (= |v_main_#t~post5_567| |v_main_#t~post5_565|)) (.cse1 (= v_main_~c~0_1271 v_main_~c~0_1270)) (.cse2 (= v_~last~0_288 v_main_~c~0_1271))) (or (and (= v_~last~0_288 v_~last~0_288) .cse0 .cse1) (and (or .cse2 (not (< v_main_~c~0_1271 200000))) .cse0 .cse1) (and (< v_main_~c~0_1271 v_main_~c~0_1270) (or (not (<= (+ v_main_~c~0_1271 1) v_~last~0_288)) (not (<= (+ v_~last~0_288 1) v_main_~c~0_1270))) (not .cse2) (< v_main_~c~0_1270 200001)))) InVars {main_~c~0=v_main_~c~0_1271, main_#t~post5=|v_main_#t~post5_567|, ~last~0=v_~last~0_288} OutVars{main_#t~post5=|v_main_#t~post5_565|, main_~c~0=v_main_~c~0_1270, ~last~0=v_~last~0_288} AuxVars[] AssignedVars[main_#t~post5, main_~c~0] {66785#(and (= main_~a~0 0) (= main_~st~0 1) (= main_~b~0 0))} is VALID [2022-04-15 06:32:00,539 INFO L290 TraceCheckUtils]: 8: Hoare triple {66785#(and (= main_~a~0 0) (= main_~st~0 1) (= main_~b~0 0))} [209] L23-4_primed-->L23-3: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {66785#(and (= main_~a~0 0) (= main_~st~0 1) (= main_~b~0 0))} is VALID [2022-04-15 06:32:00,540 INFO L290 TraceCheckUtils]: 9: Hoare triple {66785#(and (= main_~a~0 0) (= main_~st~0 1) (= main_~b~0 0))} [210] L23-3-->L23-4_primed: Formula: (let ((.cse2 (< v_main_~c~0_1273 200000)) (.cse3 (= v_~last~0_289 v_main_~c~0_1273)) (.cse0 (= v_main_~c~0_1273 v_main_~c~0_1272)) (.cse1 (= v_main_~st~0_381 v_main_~st~0_380))) (or (and (= |v_main_#t~post5_566| |v_main_#t~post5_570|) .cse0 .cse1 (or (not .cse2) (not .cse3))) (and (<= v_main_~c~0_1272 (+ v_~last~0_289 1)) .cse2 (= v_main_~st~0_380 0) (< v_main_~c~0_1273 v_main_~c~0_1272) .cse3) (and .cse0 (= v_~last~0_289 v_~last~0_289) .cse1 (= |v_main_#t~post5_570| |v_main_#t~post5_566|)))) InVars {main_~c~0=v_main_~c~0_1273, main_#t~post5=|v_main_#t~post5_570|, main_~st~0=v_main_~st~0_381, ~last~0=v_~last~0_289} OutVars{main_#t~post5=|v_main_#t~post5_566|, main_~c~0=v_main_~c~0_1272, main_~st~0=v_main_~st~0_380, ~last~0=v_~last~0_289} AuxVars[] AssignedVars[main_#t~post5, main_~c~0, main_~st~0] {66822#(and (= main_~a~0 0) (= main_~b~0 0) (or (and (< ~last~0 200000) (< ~last~0 main_~c~0) (<= main_~c~0 (+ ~last~0 1)) (= main_~st~0 0)) (= main_~st~0 1)))} is VALID [2022-04-15 06:32:00,540 INFO L290 TraceCheckUtils]: 10: Hoare triple {66822#(and (= main_~a~0 0) (= main_~b~0 0) (or (and (< ~last~0 200000) (< ~last~0 main_~c~0) (<= main_~c~0 (+ ~last~0 1)) (= main_~st~0 0)) (= main_~st~0 1)))} [207] L23-4_primed-->L23-4: Formula: (not (< v_main_~c~0_8 200000)) InVars {main_~c~0=v_main_~c~0_8} OutVars{main_~c~0=v_main_~c~0_8} AuxVars[] AssignedVars[] {66826#(and (= main_~a~0 0) (or (= main_~st~0 1) (and (< ~last~0 200000) (<= main_~c~0 (+ ~last~0 1)) (= main_~st~0 0))) (= main_~b~0 0) (not (< main_~c~0 200000)))} is VALID [2022-04-15 06:32:00,541 INFO L290 TraceCheckUtils]: 11: Hoare triple {66826#(and (= main_~a~0 0) (or (= main_~st~0 1) (and (< ~last~0 200000) (<= main_~c~0 (+ ~last~0 1)) (= main_~st~0 0))) (= main_~b~0 0) (not (< main_~c~0 200000)))} assume 0 == ~st~0 && ~c~0 == 1 + ~last~0;~a~0 := 3 + ~a~0;~b~0 := 3 + ~b~0; {66830#(and (= main_~b~0 3) (<= 200000 main_~c~0) (< main_~c~0 200001) (= main_~a~0 3))} is VALID [2022-04-15 06:32:00,541 INFO L290 TraceCheckUtils]: 12: Hoare triple {66830#(and (= main_~b~0 3) (<= 200000 main_~c~0) (< main_~c~0 200001) (= main_~a~0 3))} assume !(~c~0 == ~last~0 && 0 == ~st~0); {66830#(and (= main_~b~0 3) (<= 200000 main_~c~0) (< main_~c~0 200001) (= main_~a~0 3))} is VALID [2022-04-15 06:32:00,541 INFO L272 TraceCheckUtils]: 13: Hoare triple {66830#(and (= main_~b~0 3) (<= 200000 main_~c~0) (< main_~c~0 200001) (= main_~a~0 3))} call __VERIFIER_assert((if ~a~0 == ~b~0 && 200000 == ~c~0 then 1 else 0)); {66837#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-15 06:32:00,542 INFO L290 TraceCheckUtils]: 14: Hoare triple {66837#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {66841#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-15 06:32:00,542 INFO L290 TraceCheckUtils]: 15: Hoare triple {66841#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {66780#false} is VALID [2022-04-15 06:32:00,542 INFO L290 TraceCheckUtils]: 16: Hoare triple {66780#false} assume !false; {66780#false} is VALID [2022-04-15 06:32:00,542 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-04-15 06:32:00,542 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 06:32:00,789 INFO L290 TraceCheckUtils]: 16: Hoare triple {66780#false} assume !false; {66780#false} is VALID [2022-04-15 06:32:00,789 INFO L290 TraceCheckUtils]: 15: Hoare triple {66841#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {66780#false} is VALID [2022-04-15 06:32:00,790 INFO L290 TraceCheckUtils]: 14: Hoare triple {66837#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {66841#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-15 06:32:00,790 INFO L272 TraceCheckUtils]: 13: Hoare triple {66788#(and (<= main_~b~0 main_~a~0) (< main_~a~0 (+ main_~b~0 1)) (< 199999 main_~c~0) (<= main_~c~0 200000))} call __VERIFIER_assert((if ~a~0 == ~b~0 && 200000 == ~c~0 then 1 else 0)); {66837#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-15 06:32:00,791 INFO L290 TraceCheckUtils]: 12: Hoare triple {66788#(and (<= main_~b~0 main_~a~0) (< main_~a~0 (+ main_~b~0 1)) (< 199999 main_~c~0) (<= main_~c~0 200000))} assume !(~c~0 == ~last~0 && 0 == ~st~0); {66788#(and (<= main_~b~0 main_~a~0) (< main_~a~0 (+ main_~b~0 1)) (< 199999 main_~c~0) (<= main_~c~0 200000))} is VALID [2022-04-15 06:32:00,791 INFO L290 TraceCheckUtils]: 11: Hoare triple {66863#(or (not (<= main_~c~0 (+ ~last~0 1))) (and (<= main_~b~0 main_~a~0) (< main_~a~0 (+ main_~b~0 1)) (< 199999 main_~c~0) (<= main_~c~0 200000)) (not (= main_~st~0 0)))} assume 0 == ~st~0 && ~c~0 == 1 + ~last~0;~a~0 := 3 + ~a~0;~b~0 := 3 + ~b~0; {66788#(and (<= main_~b~0 main_~a~0) (< main_~a~0 (+ main_~b~0 1)) (< 199999 main_~c~0) (<= main_~c~0 200000))} is VALID [2022-04-15 06:32:00,792 INFO L290 TraceCheckUtils]: 10: Hoare triple {66867#(or (not (<= main_~c~0 (+ ~last~0 1))) (and (<= main_~b~0 main_~a~0) (< main_~a~0 (+ main_~b~0 1)) (<= main_~c~0 200000)) (not (= main_~st~0 0)) (< main_~c~0 200000))} [207] L23-4_primed-->L23-4: Formula: (not (< v_main_~c~0_8 200000)) InVars {main_~c~0=v_main_~c~0_8} OutVars{main_~c~0=v_main_~c~0_8} AuxVars[] AssignedVars[] {66863#(or (not (<= main_~c~0 (+ ~last~0 1))) (and (<= main_~b~0 main_~a~0) (< main_~a~0 (+ main_~b~0 1)) (< 199999 main_~c~0) (<= main_~c~0 200000)) (not (= main_~st~0 0)))} is VALID [2022-04-15 06:32:00,792 INFO L290 TraceCheckUtils]: 9: Hoare triple {66871#(and (<= main_~b~0 main_~a~0) (< main_~a~0 (+ main_~b~0 1)) (not (= main_~st~0 0)))} [210] L23-3-->L23-4_primed: Formula: (let ((.cse2 (< v_main_~c~0_1273 200000)) (.cse3 (= v_~last~0_289 v_main_~c~0_1273)) (.cse0 (= v_main_~c~0_1273 v_main_~c~0_1272)) (.cse1 (= v_main_~st~0_381 v_main_~st~0_380))) (or (and (= |v_main_#t~post5_566| |v_main_#t~post5_570|) .cse0 .cse1 (or (not .cse2) (not .cse3))) (and (<= v_main_~c~0_1272 (+ v_~last~0_289 1)) .cse2 (= v_main_~st~0_380 0) (< v_main_~c~0_1273 v_main_~c~0_1272) .cse3) (and .cse0 (= v_~last~0_289 v_~last~0_289) .cse1 (= |v_main_#t~post5_570| |v_main_#t~post5_566|)))) InVars {main_~c~0=v_main_~c~0_1273, main_#t~post5=|v_main_#t~post5_570|, main_~st~0=v_main_~st~0_381, ~last~0=v_~last~0_289} OutVars{main_#t~post5=|v_main_#t~post5_566|, main_~c~0=v_main_~c~0_1272, main_~st~0=v_main_~st~0_380, ~last~0=v_~last~0_289} AuxVars[] AssignedVars[main_#t~post5, main_~c~0, main_~st~0] {66867#(or (not (<= main_~c~0 (+ ~last~0 1))) (and (<= main_~b~0 main_~a~0) (< main_~a~0 (+ main_~b~0 1)) (<= main_~c~0 200000)) (not (= main_~st~0 0)) (< main_~c~0 200000))} is VALID [2022-04-15 06:32:00,792 INFO L290 TraceCheckUtils]: 8: Hoare triple {66871#(and (<= main_~b~0 main_~a~0) (< main_~a~0 (+ main_~b~0 1)) (not (= main_~st~0 0)))} [209] L23-4_primed-->L23-3: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {66871#(and (<= main_~b~0 main_~a~0) (< main_~a~0 (+ main_~b~0 1)) (not (= main_~st~0 0)))} is VALID [2022-04-15 06:32:00,793 INFO L290 TraceCheckUtils]: 7: Hoare triple {66871#(and (<= main_~b~0 main_~a~0) (< main_~a~0 (+ main_~b~0 1)) (not (= main_~st~0 0)))} [208] L23-3-->L23-4_primed: Formula: (let ((.cse0 (= |v_main_#t~post5_567| |v_main_#t~post5_565|)) (.cse1 (= v_main_~c~0_1271 v_main_~c~0_1270)) (.cse2 (= v_~last~0_288 v_main_~c~0_1271))) (or (and (= v_~last~0_288 v_~last~0_288) .cse0 .cse1) (and (or .cse2 (not (< v_main_~c~0_1271 200000))) .cse0 .cse1) (and (< v_main_~c~0_1271 v_main_~c~0_1270) (or (not (<= (+ v_main_~c~0_1271 1) v_~last~0_288)) (not (<= (+ v_~last~0_288 1) v_main_~c~0_1270))) (not .cse2) (< v_main_~c~0_1270 200001)))) InVars {main_~c~0=v_main_~c~0_1271, main_#t~post5=|v_main_#t~post5_567|, ~last~0=v_~last~0_288} OutVars{main_#t~post5=|v_main_#t~post5_565|, main_~c~0=v_main_~c~0_1270, ~last~0=v_~last~0_288} AuxVars[] AssignedVars[main_#t~post5, main_~c~0] {66871#(and (<= main_~b~0 main_~a~0) (< main_~a~0 (+ main_~b~0 1)) (not (= main_~st~0 0)))} is VALID [2022-04-15 06:32:00,793 INFO L290 TraceCheckUtils]: 6: Hoare triple {66881#(and (<= main_~b~0 main_~a~0) (< main_~a~0 (+ main_~b~0 1)))} assume !false;~st~0 := 1;~c~0 := 0; {66871#(and (<= main_~b~0 main_~a~0) (< main_~a~0 (+ main_~b~0 1)) (not (= main_~st~0 0)))} is VALID [2022-04-15 06:32:00,793 INFO L290 TraceCheckUtils]: 5: Hoare triple {66779#true} assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~last~0 := #t~nondet4;havoc #t~nondet4;~a~0 := 0;~b~0 := 0;~c~0 := 0;~st~0 := 0; {66881#(and (<= main_~b~0 main_~a~0) (< main_~a~0 (+ main_~b~0 1)))} is VALID [2022-04-15 06:32:00,793 INFO L272 TraceCheckUtils]: 4: Hoare triple {66779#true} call #t~ret6 := main(); {66779#true} is VALID [2022-04-15 06:32:00,794 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {66779#true} {66779#true} #66#return; {66779#true} is VALID [2022-04-15 06:32:00,794 INFO L290 TraceCheckUtils]: 2: Hoare triple {66779#true} assume true; {66779#true} is VALID [2022-04-15 06:32:00,794 INFO L290 TraceCheckUtils]: 1: Hoare triple {66779#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(11, 2);call #Ultimate.allocInit(12, 3);~last~0 := 0; {66779#true} is VALID [2022-04-15 06:32:00,794 INFO L272 TraceCheckUtils]: 0: Hoare triple {66779#true} call ULTIMATE.init(); {66779#true} is VALID [2022-04-15 06:32:00,794 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-04-15 06:32:00,794 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1346530291] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 06:32:00,794 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 06:32:00,794 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9, 9] total 19 [2022-04-15 06:32:02,598 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 06:32:02,598 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [710535671] [2022-04-15 06:32:02,598 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [710535671] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 06:32:02,598 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 06:32:02,598 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [66] imperfect sequences [] total 66 [2022-04-15 06:32:02,598 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [561723624] [2022-04-15 06:32:02,598 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 06:32:02,599 INFO L78 Accepts]: Start accepts. Automaton has has 66 states, 66 states have (on average 1.4242424242424243) internal successors, (94), 64 states have internal predecessors, (94), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 98 [2022-04-15 06:32:02,599 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 06:32:02,599 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 66 states, 66 states have (on average 1.4242424242424243) internal successors, (94), 64 states have internal predecessors, (94), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:32:02,645 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 98 edges. 98 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 06:32:02,645 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 66 states [2022-04-15 06:32:02,646 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 06:32:02,646 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 66 interpolants. [2022-04-15 06:32:02,646 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=501, Invalid=5199, Unknown=0, NotChecked=0, Total=5700 [2022-04-15 06:32:02,647 INFO L87 Difference]: Start difference. First operand 449 states and 507 transitions. Second operand has 66 states, 66 states have (on average 1.4242424242424243) internal successors, (94), 64 states have internal predecessors, (94), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:32:11,958 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:32:11,959 INFO L93 Difference]: Finished difference Result 591 states and 671 transitions. [2022-04-15 06:32:11,959 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 95 states. [2022-04-15 06:32:11,959 INFO L78 Accepts]: Start accepts. Automaton has has 66 states, 66 states have (on average 1.4242424242424243) internal successors, (94), 64 states have internal predecessors, (94), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 98 [2022-04-15 06:32:11,959 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 06:32:11,959 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 66 states, 66 states have (on average 1.4242424242424243) internal successors, (94), 64 states have internal predecessors, (94), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:32:11,960 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 210 transitions. [2022-04-15 06:32:11,960 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 66 states, 66 states have (on average 1.4242424242424243) internal successors, (94), 64 states have internal predecessors, (94), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:32:11,961 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 210 transitions. [2022-04-15 06:32:11,961 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 95 states and 210 transitions. [2022-04-15 06:32:12,071 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 210 edges. 210 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 06:32:12,081 INFO L225 Difference]: With dead ends: 591 [2022-04-15 06:32:12,081 INFO L226 Difference]: Without dead ends: 499 [2022-04-15 06:32:12,081 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 161 GetRequests, 54 SyntacticMatches, 2 SemanticMatches, 105 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3214 ImplicationChecksByTransitivity, 2.8s TimeCoverageRelationStatistics Valid=798, Invalid=10544, Unknown=0, NotChecked=0, Total=11342 [2022-04-15 06:32:12,082 INFO L913 BasicCegarLoop]: 16 mSDtfsCounter, 193 mSDsluCounter, 58 mSDsCounter, 0 mSdLazyCounter, 6228 mSolverCounterSat, 127 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 195 SdHoareTripleChecker+Valid, 74 SdHoareTripleChecker+Invalid, 6355 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 127 IncrementalHoareTripleChecker+Valid, 6228 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.3s IncrementalHoareTripleChecker+Time [2022-04-15 06:32:12,082 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [195 Valid, 74 Invalid, 6355 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [127 Valid, 6228 Invalid, 0 Unknown, 0 Unchecked, 3.3s Time] [2022-04-15 06:32:12,082 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 499 states. [2022-04-15 06:32:14,216 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 499 to 452. [2022-04-15 06:32:14,216 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 06:32:14,216 INFO L82 GeneralOperation]: Start isEquivalent. First operand 499 states. Second operand has 452 states, 444 states have (on average 1.135135135135135) internal successors, (504), 445 states have internal predecessors, (504), 4 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-15 06:32:14,217 INFO L74 IsIncluded]: Start isIncluded. First operand 499 states. Second operand has 452 states, 444 states have (on average 1.135135135135135) internal successors, (504), 445 states have internal predecessors, (504), 4 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-15 06:32:14,217 INFO L87 Difference]: Start difference. First operand 499 states. Second operand has 452 states, 444 states have (on average 1.135135135135135) internal successors, (504), 445 states have internal predecessors, (504), 4 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-15 06:32:14,224 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:32:14,224 INFO L93 Difference]: Finished difference Result 499 states and 560 transitions. [2022-04-15 06:32:14,224 INFO L276 IsEmpty]: Start isEmpty. Operand 499 states and 560 transitions. [2022-04-15 06:32:14,225 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 06:32:14,225 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 06:32:14,225 INFO L74 IsIncluded]: Start isIncluded. First operand has 452 states, 444 states have (on average 1.135135135135135) internal successors, (504), 445 states have internal predecessors, (504), 4 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) Second operand 499 states. [2022-04-15 06:32:14,225 INFO L87 Difference]: Start difference. First operand has 452 states, 444 states have (on average 1.135135135135135) internal successors, (504), 445 states have internal predecessors, (504), 4 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) Second operand 499 states. [2022-04-15 06:32:14,237 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:32:14,237 INFO L93 Difference]: Finished difference Result 499 states and 560 transitions. [2022-04-15 06:32:14,237 INFO L276 IsEmpty]: Start isEmpty. Operand 499 states and 560 transitions. [2022-04-15 06:32:14,238 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 06:32:14,238 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 06:32:14,238 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 06:32:14,238 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 06:32:14,238 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 452 states, 444 states have (on average 1.135135135135135) internal successors, (504), 445 states have internal predecessors, (504), 4 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-15 06:32:14,247 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 452 states to 452 states and 511 transitions. [2022-04-15 06:32:14,247 INFO L78 Accepts]: Start accepts. Automaton has 452 states and 511 transitions. Word has length 98 [2022-04-15 06:32:14,247 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 06:32:14,247 INFO L478 AbstractCegarLoop]: Abstraction has 452 states and 511 transitions. [2022-04-15 06:32:14,247 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 66 states, 66 states have (on average 1.4242424242424243) internal successors, (94), 64 states have internal predecessors, (94), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:32:14,247 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 452 states and 511 transitions. [2022-04-15 06:32:15,635 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 511 edges. 511 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 06:32:15,635 INFO L276 IsEmpty]: Start isEmpty. Operand 452 states and 511 transitions. [2022-04-15 06:32:15,636 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2022-04-15 06:32:15,636 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 06:32:15,636 INFO L499 BasicCegarLoop]: trace histogram [26, 26, 24, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 06:32:15,652 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (40)] Forceful destruction successful, exit code 0 [2022-04-15 06:32:15,851 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 40 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable43 [2022-04-15 06:32:15,852 INFO L403 AbstractCegarLoop]: === Iteration 45 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 06:32:15,852 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 06:32:15,852 INFO L85 PathProgramCache]: Analyzing trace with hash 572673894, now seen corresponding path program 12 times [2022-04-15 06:32:15,852 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 06:32:15,852 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [915251338] [2022-04-15 06:32:15,988 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 4 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {0={1=2}, 1={1=1, 2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-15 06:32:15,988 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-15 06:32:15,988 INFO L85 PathProgramCache]: Analyzing trace with hash 1806898520, now seen corresponding path program 1 times [2022-04-15 06:32:15,988 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 06:32:15,988 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1564578295] [2022-04-15 06:32:15,988 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 06:32:15,988 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 06:32:15,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:32:16,107 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 06:32:16,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:32:16,110 INFO L290 TraceCheckUtils]: 0: Hoare triple {70124#(and (= ~last~0 |old(~last~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(11, 2);call #Ultimate.allocInit(12, 3);~last~0 := 0; {70105#true} is VALID [2022-04-15 06:32:16,110 INFO L290 TraceCheckUtils]: 1: Hoare triple {70105#true} assume true; {70105#true} is VALID [2022-04-15 06:32:16,110 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {70105#true} {70105#true} #66#return; {70105#true} is VALID [2022-04-15 06:32:16,111 INFO L272 TraceCheckUtils]: 0: Hoare triple {70105#true} call ULTIMATE.init(); {70124#(and (= ~last~0 |old(~last~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 06:32:16,111 INFO L290 TraceCheckUtils]: 1: Hoare triple {70124#(and (= ~last~0 |old(~last~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(11, 2);call #Ultimate.allocInit(12, 3);~last~0 := 0; {70105#true} is VALID [2022-04-15 06:32:16,111 INFO L290 TraceCheckUtils]: 2: Hoare triple {70105#true} assume true; {70105#true} is VALID [2022-04-15 06:32:16,111 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {70105#true} {70105#true} #66#return; {70105#true} is VALID [2022-04-15 06:32:16,111 INFO L272 TraceCheckUtils]: 4: Hoare triple {70105#true} call #t~ret6 := main(); {70105#true} is VALID [2022-04-15 06:32:16,111 INFO L290 TraceCheckUtils]: 5: Hoare triple {70105#true} assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~last~0 := #t~nondet4;havoc #t~nondet4;~a~0 := 0;~b~0 := 0;~c~0 := 0;~st~0 := 0; {70105#true} is VALID [2022-04-15 06:32:16,111 INFO L290 TraceCheckUtils]: 6: Hoare triple {70105#true} [212] L30-->L23-3_primed: Formula: (and (= v_main_~b~0_200 v_main_~b~0_199) (= v_main_~a~0_203 v_main_~a~0_202) (= v_main_~c~0_1331 v_main_~c~0_1317) (= |v_main_#t~post5_591| |v_main_#t~post5_578|) (= v_main_~st~0_392 v_main_~st~0_390)) InVars {main_~c~0=v_main_~c~0_1331, main_#t~post5=|v_main_#t~post5_591|, main_~st~0=v_main_~st~0_392, main_~b~0=v_main_~b~0_200, main_~a~0=v_main_~a~0_203} OutVars{main_~c~0=v_main_~c~0_1317, main_#t~post5=|v_main_#t~post5_578|, main_~st~0=v_main_~st~0_390, main_~b~0=v_main_~b~0_199, main_~a~0=v_main_~a~0_202} AuxVars[] AssignedVars[main_~c~0, main_#t~post5, main_~st~0, main_~b~0, main_~a~0] {70105#true} is VALID [2022-04-15 06:32:16,111 INFO L290 TraceCheckUtils]: 7: Hoare triple {70105#true} [211] L23-3_primed-->L23-3: Formula: (and (= v_main_~c~0_7 0) (= v_main_~st~0_6 1)) InVars {} OutVars{main_~c~0=v_main_~c~0_7, main_~st~0=v_main_~st~0_6} AuxVars[] AssignedVars[main_~c~0, main_~st~0] {70110#(= main_~c~0 0)} is VALID [2022-04-15 06:32:16,112 INFO L290 TraceCheckUtils]: 8: Hoare triple {70110#(= main_~c~0 0)} assume !!(~c~0 < 200000); {70110#(= main_~c~0 0)} is VALID [2022-04-15 06:32:16,112 INFO L290 TraceCheckUtils]: 9: Hoare triple {70110#(= main_~c~0 0)} assume ~c~0 == ~last~0;~st~0 := 0; {70110#(= main_~c~0 0)} is VALID [2022-04-15 06:32:16,112 INFO L290 TraceCheckUtils]: 10: Hoare triple {70110#(= main_~c~0 0)} #t~post5 := ~c~0;~c~0 := 1 + #t~post5;havoc #t~post5; {70111#(<= main_~c~0 1)} is VALID [2022-04-15 06:32:16,112 INFO L290 TraceCheckUtils]: 11: Hoare triple {70111#(<= main_~c~0 1)} assume !!(~c~0 < 200000); {70111#(<= main_~c~0 1)} is VALID [2022-04-15 06:32:16,112 INFO L290 TraceCheckUtils]: 12: Hoare triple {70111#(<= main_~c~0 1)} assume !(~c~0 == ~last~0); {70111#(<= main_~c~0 1)} is VALID [2022-04-15 06:32:16,113 INFO L290 TraceCheckUtils]: 13: Hoare triple {70111#(<= main_~c~0 1)} #t~post5 := ~c~0;~c~0 := 1 + #t~post5;havoc #t~post5; {70112#(<= main_~c~0 2)} is VALID [2022-04-15 06:32:16,113 INFO L290 TraceCheckUtils]: 14: Hoare triple {70112#(<= main_~c~0 2)} assume !!(~c~0 < 200000); {70112#(<= main_~c~0 2)} is VALID [2022-04-15 06:32:16,113 INFO L290 TraceCheckUtils]: 15: Hoare triple {70112#(<= main_~c~0 2)} assume !(~c~0 == ~last~0); {70112#(<= main_~c~0 2)} is VALID [2022-04-15 06:32:16,113 INFO L290 TraceCheckUtils]: 16: Hoare triple {70112#(<= main_~c~0 2)} #t~post5 := ~c~0;~c~0 := 1 + #t~post5;havoc #t~post5; {70113#(<= main_~c~0 3)} is VALID [2022-04-15 06:32:16,113 INFO L290 TraceCheckUtils]: 17: Hoare triple {70113#(<= main_~c~0 3)} assume !!(~c~0 < 200000); {70113#(<= main_~c~0 3)} is VALID [2022-04-15 06:32:16,114 INFO L290 TraceCheckUtils]: 18: Hoare triple {70113#(<= main_~c~0 3)} assume !(~c~0 == ~last~0); {70113#(<= main_~c~0 3)} is VALID [2022-04-15 06:32:16,114 INFO L290 TraceCheckUtils]: 19: Hoare triple {70113#(<= main_~c~0 3)} #t~post5 := ~c~0;~c~0 := 1 + #t~post5;havoc #t~post5; {70114#(<= main_~c~0 4)} is VALID [2022-04-15 06:32:16,114 INFO L290 TraceCheckUtils]: 20: Hoare triple {70114#(<= main_~c~0 4)} assume !!(~c~0 < 200000); {70114#(<= main_~c~0 4)} is VALID [2022-04-15 06:32:16,114 INFO L290 TraceCheckUtils]: 21: Hoare triple {70114#(<= main_~c~0 4)} assume !(~c~0 == ~last~0); {70114#(<= main_~c~0 4)} is VALID [2022-04-15 06:32:16,115 INFO L290 TraceCheckUtils]: 22: Hoare triple {70114#(<= main_~c~0 4)} #t~post5 := ~c~0;~c~0 := 1 + #t~post5;havoc #t~post5; {70115#(<= main_~c~0 5)} is VALID [2022-04-15 06:32:16,115 INFO L290 TraceCheckUtils]: 23: Hoare triple {70115#(<= main_~c~0 5)} assume !!(~c~0 < 200000); {70115#(<= main_~c~0 5)} is VALID [2022-04-15 06:32:16,115 INFO L290 TraceCheckUtils]: 24: Hoare triple {70115#(<= main_~c~0 5)} assume !(~c~0 == ~last~0); {70115#(<= main_~c~0 5)} is VALID [2022-04-15 06:32:16,115 INFO L290 TraceCheckUtils]: 25: Hoare triple {70115#(<= main_~c~0 5)} #t~post5 := ~c~0;~c~0 := 1 + #t~post5;havoc #t~post5; {70116#(<= main_~c~0 6)} is VALID [2022-04-15 06:32:16,115 INFO L290 TraceCheckUtils]: 26: Hoare triple {70116#(<= main_~c~0 6)} assume !!(~c~0 < 200000); {70116#(<= main_~c~0 6)} is VALID [2022-04-15 06:32:16,116 INFO L290 TraceCheckUtils]: 27: Hoare triple {70116#(<= main_~c~0 6)} assume !(~c~0 == ~last~0); {70116#(<= main_~c~0 6)} is VALID [2022-04-15 06:32:16,116 INFO L290 TraceCheckUtils]: 28: Hoare triple {70116#(<= main_~c~0 6)} #t~post5 := ~c~0;~c~0 := 1 + #t~post5;havoc #t~post5; {70117#(<= main_~c~0 7)} is VALID [2022-04-15 06:32:16,116 INFO L290 TraceCheckUtils]: 29: Hoare triple {70117#(<= main_~c~0 7)} assume !!(~c~0 < 200000); {70117#(<= main_~c~0 7)} is VALID [2022-04-15 06:32:16,116 INFO L290 TraceCheckUtils]: 30: Hoare triple {70117#(<= main_~c~0 7)} assume !(~c~0 == ~last~0); {70117#(<= main_~c~0 7)} is VALID [2022-04-15 06:32:16,116 INFO L290 TraceCheckUtils]: 31: Hoare triple {70117#(<= main_~c~0 7)} #t~post5 := ~c~0;~c~0 := 1 + #t~post5;havoc #t~post5; {70118#(<= main_~c~0 8)} is VALID [2022-04-15 06:32:16,117 INFO L290 TraceCheckUtils]: 32: Hoare triple {70118#(<= main_~c~0 8)} assume !!(~c~0 < 200000); {70118#(<= main_~c~0 8)} is VALID [2022-04-15 06:32:16,117 INFO L290 TraceCheckUtils]: 33: Hoare triple {70118#(<= main_~c~0 8)} assume !(~c~0 == ~last~0); {70118#(<= main_~c~0 8)} is VALID [2022-04-15 06:32:16,117 INFO L290 TraceCheckUtils]: 34: Hoare triple {70118#(<= main_~c~0 8)} #t~post5 := ~c~0;~c~0 := 1 + #t~post5;havoc #t~post5; {70119#(<= main_~c~0 9)} is VALID [2022-04-15 06:32:16,117 INFO L290 TraceCheckUtils]: 35: Hoare triple {70119#(<= main_~c~0 9)} assume !!(~c~0 < 200000); {70119#(<= main_~c~0 9)} is VALID [2022-04-15 06:32:16,117 INFO L290 TraceCheckUtils]: 36: Hoare triple {70119#(<= main_~c~0 9)} assume !(~c~0 == ~last~0); {70119#(<= main_~c~0 9)} is VALID [2022-04-15 06:32:16,118 INFO L290 TraceCheckUtils]: 37: Hoare triple {70119#(<= main_~c~0 9)} #t~post5 := ~c~0;~c~0 := 1 + #t~post5;havoc #t~post5; {70120#(<= main_~c~0 10)} is VALID [2022-04-15 06:32:16,118 INFO L290 TraceCheckUtils]: 38: Hoare triple {70120#(<= main_~c~0 10)} assume !!(~c~0 < 200000); {70120#(<= main_~c~0 10)} is VALID [2022-04-15 06:32:16,118 INFO L290 TraceCheckUtils]: 39: Hoare triple {70120#(<= main_~c~0 10)} assume !(~c~0 == ~last~0); {70120#(<= main_~c~0 10)} is VALID [2022-04-15 06:32:16,118 INFO L290 TraceCheckUtils]: 40: Hoare triple {70120#(<= main_~c~0 10)} #t~post5 := ~c~0;~c~0 := 1 + #t~post5;havoc #t~post5; {70121#(<= main_~c~0 11)} is VALID [2022-04-15 06:32:16,118 INFO L290 TraceCheckUtils]: 41: Hoare triple {70121#(<= main_~c~0 11)} assume !!(~c~0 < 200000); {70121#(<= main_~c~0 11)} is VALID [2022-04-15 06:32:16,119 INFO L290 TraceCheckUtils]: 42: Hoare triple {70121#(<= main_~c~0 11)} assume !(~c~0 == ~last~0); {70121#(<= main_~c~0 11)} is VALID [2022-04-15 06:32:16,119 INFO L290 TraceCheckUtils]: 43: Hoare triple {70121#(<= main_~c~0 11)} #t~post5 := ~c~0;~c~0 := 1 + #t~post5;havoc #t~post5; {70122#(<= main_~c~0 12)} is VALID [2022-04-15 06:32:16,119 INFO L290 TraceCheckUtils]: 44: Hoare triple {70122#(<= main_~c~0 12)} assume !!(~c~0 < 200000); {70122#(<= main_~c~0 12)} is VALID [2022-04-15 06:32:16,119 INFO L290 TraceCheckUtils]: 45: Hoare triple {70122#(<= main_~c~0 12)} assume !(~c~0 == ~last~0); {70122#(<= main_~c~0 12)} is VALID [2022-04-15 06:32:16,120 INFO L290 TraceCheckUtils]: 46: Hoare triple {70122#(<= main_~c~0 12)} #t~post5 := ~c~0;~c~0 := 1 + #t~post5;havoc #t~post5; {70123#(<= main_~c~0 13)} is VALID [2022-04-15 06:32:16,120 INFO L290 TraceCheckUtils]: 47: Hoare triple {70123#(<= main_~c~0 13)} assume !(~c~0 < 200000); {70106#false} is VALID [2022-04-15 06:32:16,120 INFO L290 TraceCheckUtils]: 48: Hoare triple {70106#false} assume 0 == ~st~0 && ~c~0 == 1 + ~last~0;~a~0 := 3 + ~a~0;~b~0 := 3 + ~b~0; {70106#false} is VALID [2022-04-15 06:32:16,120 INFO L290 TraceCheckUtils]: 49: Hoare triple {70106#false} assume !(~c~0 == ~last~0 && 0 == ~st~0); {70106#false} is VALID [2022-04-15 06:32:16,120 INFO L272 TraceCheckUtils]: 50: Hoare triple {70106#false} call __VERIFIER_assert((if ~a~0 == ~b~0 && 200000 == ~c~0 then 1 else 0)); {70106#false} is VALID [2022-04-15 06:32:16,120 INFO L290 TraceCheckUtils]: 51: Hoare triple {70106#false} ~cond := #in~cond; {70106#false} is VALID [2022-04-15 06:32:16,120 INFO L290 TraceCheckUtils]: 52: Hoare triple {70106#false} assume 0 == ~cond; {70106#false} is VALID [2022-04-15 06:32:16,120 INFO L290 TraceCheckUtils]: 53: Hoare triple {70106#false} assume !false; {70106#false} is VALID [2022-04-15 06:32:16,120 INFO L134 CoverageAnalysis]: Checked inductivity of 247 backedges. 0 proven. 247 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 06:32:16,120 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 06:32:16,120 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1564578295] [2022-04-15 06:32:16,121 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1564578295] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 06:32:16,121 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [899769406] [2022-04-15 06:32:16,121 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 06:32:16,121 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 06:32:16,121 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 06:32:16,122 INFO L229 MonitoredProcess]: Starting monitored process 41 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-15 06:32:16,122 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (41)] Waiting until timeout for monitored process [2022-04-15 06:32:16,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:32:16,159 INFO L263 TraceCheckSpWp]: Trace formula consists of 147 conjuncts, 15 conjunts are in the unsatisfiable core [2022-04-15 06:32:16,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:32:16,167 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 06:32:16,316 INFO L272 TraceCheckUtils]: 0: Hoare triple {70105#true} call ULTIMATE.init(); {70105#true} is VALID [2022-04-15 06:32:16,316 INFO L290 TraceCheckUtils]: 1: Hoare triple {70105#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(11, 2);call #Ultimate.allocInit(12, 3);~last~0 := 0; {70105#true} is VALID [2022-04-15 06:32:16,316 INFO L290 TraceCheckUtils]: 2: Hoare triple {70105#true} assume true; {70105#true} is VALID [2022-04-15 06:32:16,316 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {70105#true} {70105#true} #66#return; {70105#true} is VALID [2022-04-15 06:32:16,316 INFO L272 TraceCheckUtils]: 4: Hoare triple {70105#true} call #t~ret6 := main(); {70105#true} is VALID [2022-04-15 06:32:16,316 INFO L290 TraceCheckUtils]: 5: Hoare triple {70105#true} assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~last~0 := #t~nondet4;havoc #t~nondet4;~a~0 := 0;~b~0 := 0;~c~0 := 0;~st~0 := 0; {70105#true} is VALID [2022-04-15 06:32:16,316 INFO L290 TraceCheckUtils]: 6: Hoare triple {70105#true} [212] L30-->L23-3_primed: Formula: (and (= v_main_~b~0_200 v_main_~b~0_199) (= v_main_~a~0_203 v_main_~a~0_202) (= v_main_~c~0_1331 v_main_~c~0_1317) (= |v_main_#t~post5_591| |v_main_#t~post5_578|) (= v_main_~st~0_392 v_main_~st~0_390)) InVars {main_~c~0=v_main_~c~0_1331, main_#t~post5=|v_main_#t~post5_591|, main_~st~0=v_main_~st~0_392, main_~b~0=v_main_~b~0_200, main_~a~0=v_main_~a~0_203} OutVars{main_~c~0=v_main_~c~0_1317, main_#t~post5=|v_main_#t~post5_578|, main_~st~0=v_main_~st~0_390, main_~b~0=v_main_~b~0_199, main_~a~0=v_main_~a~0_202} AuxVars[] AssignedVars[main_~c~0, main_#t~post5, main_~st~0, main_~b~0, main_~a~0] {70105#true} is VALID [2022-04-15 06:32:16,316 INFO L290 TraceCheckUtils]: 7: Hoare triple {70105#true} [211] L23-3_primed-->L23-3: Formula: (and (= v_main_~c~0_7 0) (= v_main_~st~0_6 1)) InVars {} OutVars{main_~c~0=v_main_~c~0_7, main_~st~0=v_main_~st~0_6} AuxVars[] AssignedVars[main_~c~0, main_~st~0] {70149#(<= main_~c~0 0)} is VALID [2022-04-15 06:32:16,317 INFO L290 TraceCheckUtils]: 8: Hoare triple {70149#(<= main_~c~0 0)} assume !!(~c~0 < 200000); {70149#(<= main_~c~0 0)} is VALID [2022-04-15 06:32:16,317 INFO L290 TraceCheckUtils]: 9: Hoare triple {70149#(<= main_~c~0 0)} assume ~c~0 == ~last~0;~st~0 := 0; {70149#(<= main_~c~0 0)} is VALID [2022-04-15 06:32:16,317 INFO L290 TraceCheckUtils]: 10: Hoare triple {70149#(<= main_~c~0 0)} #t~post5 := ~c~0;~c~0 := 1 + #t~post5;havoc #t~post5; {70111#(<= main_~c~0 1)} is VALID [2022-04-15 06:32:16,317 INFO L290 TraceCheckUtils]: 11: Hoare triple {70111#(<= main_~c~0 1)} assume !!(~c~0 < 200000); {70111#(<= main_~c~0 1)} is VALID [2022-04-15 06:32:16,317 INFO L290 TraceCheckUtils]: 12: Hoare triple {70111#(<= main_~c~0 1)} assume !(~c~0 == ~last~0); {70111#(<= main_~c~0 1)} is VALID [2022-04-15 06:32:16,318 INFO L290 TraceCheckUtils]: 13: Hoare triple {70111#(<= main_~c~0 1)} #t~post5 := ~c~0;~c~0 := 1 + #t~post5;havoc #t~post5; {70112#(<= main_~c~0 2)} is VALID [2022-04-15 06:32:16,318 INFO L290 TraceCheckUtils]: 14: Hoare triple {70112#(<= main_~c~0 2)} assume !!(~c~0 < 200000); {70112#(<= main_~c~0 2)} is VALID [2022-04-15 06:32:16,318 INFO L290 TraceCheckUtils]: 15: Hoare triple {70112#(<= main_~c~0 2)} assume !(~c~0 == ~last~0); {70112#(<= main_~c~0 2)} is VALID [2022-04-15 06:32:16,318 INFO L290 TraceCheckUtils]: 16: Hoare triple {70112#(<= main_~c~0 2)} #t~post5 := ~c~0;~c~0 := 1 + #t~post5;havoc #t~post5; {70113#(<= main_~c~0 3)} is VALID [2022-04-15 06:32:16,319 INFO L290 TraceCheckUtils]: 17: Hoare triple {70113#(<= main_~c~0 3)} assume !!(~c~0 < 200000); {70113#(<= main_~c~0 3)} is VALID [2022-04-15 06:32:16,319 INFO L290 TraceCheckUtils]: 18: Hoare triple {70113#(<= main_~c~0 3)} assume !(~c~0 == ~last~0); {70113#(<= main_~c~0 3)} is VALID [2022-04-15 06:32:16,319 INFO L290 TraceCheckUtils]: 19: Hoare triple {70113#(<= main_~c~0 3)} #t~post5 := ~c~0;~c~0 := 1 + #t~post5;havoc #t~post5; {70114#(<= main_~c~0 4)} is VALID [2022-04-15 06:32:16,319 INFO L290 TraceCheckUtils]: 20: Hoare triple {70114#(<= main_~c~0 4)} assume !!(~c~0 < 200000); {70114#(<= main_~c~0 4)} is VALID [2022-04-15 06:32:16,319 INFO L290 TraceCheckUtils]: 21: Hoare triple {70114#(<= main_~c~0 4)} assume !(~c~0 == ~last~0); {70114#(<= main_~c~0 4)} is VALID [2022-04-15 06:32:16,320 INFO L290 TraceCheckUtils]: 22: Hoare triple {70114#(<= main_~c~0 4)} #t~post5 := ~c~0;~c~0 := 1 + #t~post5;havoc #t~post5; {70115#(<= main_~c~0 5)} is VALID [2022-04-15 06:32:16,320 INFO L290 TraceCheckUtils]: 23: Hoare triple {70115#(<= main_~c~0 5)} assume !!(~c~0 < 200000); {70115#(<= main_~c~0 5)} is VALID [2022-04-15 06:32:16,320 INFO L290 TraceCheckUtils]: 24: Hoare triple {70115#(<= main_~c~0 5)} assume !(~c~0 == ~last~0); {70115#(<= main_~c~0 5)} is VALID [2022-04-15 06:32:16,320 INFO L290 TraceCheckUtils]: 25: Hoare triple {70115#(<= main_~c~0 5)} #t~post5 := ~c~0;~c~0 := 1 + #t~post5;havoc #t~post5; {70116#(<= main_~c~0 6)} is VALID [2022-04-15 06:32:16,320 INFO L290 TraceCheckUtils]: 26: Hoare triple {70116#(<= main_~c~0 6)} assume !!(~c~0 < 200000); {70116#(<= main_~c~0 6)} is VALID [2022-04-15 06:32:16,321 INFO L290 TraceCheckUtils]: 27: Hoare triple {70116#(<= main_~c~0 6)} assume !(~c~0 == ~last~0); {70116#(<= main_~c~0 6)} is VALID [2022-04-15 06:32:16,321 INFO L290 TraceCheckUtils]: 28: Hoare triple {70116#(<= main_~c~0 6)} #t~post5 := ~c~0;~c~0 := 1 + #t~post5;havoc #t~post5; {70117#(<= main_~c~0 7)} is VALID [2022-04-15 06:32:16,321 INFO L290 TraceCheckUtils]: 29: Hoare triple {70117#(<= main_~c~0 7)} assume !!(~c~0 < 200000); {70117#(<= main_~c~0 7)} is VALID [2022-04-15 06:32:16,321 INFO L290 TraceCheckUtils]: 30: Hoare triple {70117#(<= main_~c~0 7)} assume !(~c~0 == ~last~0); {70117#(<= main_~c~0 7)} is VALID [2022-04-15 06:32:16,322 INFO L290 TraceCheckUtils]: 31: Hoare triple {70117#(<= main_~c~0 7)} #t~post5 := ~c~0;~c~0 := 1 + #t~post5;havoc #t~post5; {70118#(<= main_~c~0 8)} is VALID [2022-04-15 06:32:16,322 INFO L290 TraceCheckUtils]: 32: Hoare triple {70118#(<= main_~c~0 8)} assume !!(~c~0 < 200000); {70118#(<= main_~c~0 8)} is VALID [2022-04-15 06:32:16,322 INFO L290 TraceCheckUtils]: 33: Hoare triple {70118#(<= main_~c~0 8)} assume !(~c~0 == ~last~0); {70118#(<= main_~c~0 8)} is VALID [2022-04-15 06:32:16,322 INFO L290 TraceCheckUtils]: 34: Hoare triple {70118#(<= main_~c~0 8)} #t~post5 := ~c~0;~c~0 := 1 + #t~post5;havoc #t~post5; {70119#(<= main_~c~0 9)} is VALID [2022-04-15 06:32:16,322 INFO L290 TraceCheckUtils]: 35: Hoare triple {70119#(<= main_~c~0 9)} assume !!(~c~0 < 200000); {70119#(<= main_~c~0 9)} is VALID [2022-04-15 06:32:16,323 INFO L290 TraceCheckUtils]: 36: Hoare triple {70119#(<= main_~c~0 9)} assume !(~c~0 == ~last~0); {70119#(<= main_~c~0 9)} is VALID [2022-04-15 06:32:16,323 INFO L290 TraceCheckUtils]: 37: Hoare triple {70119#(<= main_~c~0 9)} #t~post5 := ~c~0;~c~0 := 1 + #t~post5;havoc #t~post5; {70120#(<= main_~c~0 10)} is VALID [2022-04-15 06:32:16,323 INFO L290 TraceCheckUtils]: 38: Hoare triple {70120#(<= main_~c~0 10)} assume !!(~c~0 < 200000); {70120#(<= main_~c~0 10)} is VALID [2022-04-15 06:32:16,323 INFO L290 TraceCheckUtils]: 39: Hoare triple {70120#(<= main_~c~0 10)} assume !(~c~0 == ~last~0); {70120#(<= main_~c~0 10)} is VALID [2022-04-15 06:32:16,324 INFO L290 TraceCheckUtils]: 40: Hoare triple {70120#(<= main_~c~0 10)} #t~post5 := ~c~0;~c~0 := 1 + #t~post5;havoc #t~post5; {70121#(<= main_~c~0 11)} is VALID [2022-04-15 06:32:16,324 INFO L290 TraceCheckUtils]: 41: Hoare triple {70121#(<= main_~c~0 11)} assume !!(~c~0 < 200000); {70121#(<= main_~c~0 11)} is VALID [2022-04-15 06:32:16,324 INFO L290 TraceCheckUtils]: 42: Hoare triple {70121#(<= main_~c~0 11)} assume !(~c~0 == ~last~0); {70121#(<= main_~c~0 11)} is VALID [2022-04-15 06:32:16,324 INFO L290 TraceCheckUtils]: 43: Hoare triple {70121#(<= main_~c~0 11)} #t~post5 := ~c~0;~c~0 := 1 + #t~post5;havoc #t~post5; {70122#(<= main_~c~0 12)} is VALID [2022-04-15 06:32:16,324 INFO L290 TraceCheckUtils]: 44: Hoare triple {70122#(<= main_~c~0 12)} assume !!(~c~0 < 200000); {70122#(<= main_~c~0 12)} is VALID [2022-04-15 06:32:16,325 INFO L290 TraceCheckUtils]: 45: Hoare triple {70122#(<= main_~c~0 12)} assume !(~c~0 == ~last~0); {70122#(<= main_~c~0 12)} is VALID [2022-04-15 06:32:16,325 INFO L290 TraceCheckUtils]: 46: Hoare triple {70122#(<= main_~c~0 12)} #t~post5 := ~c~0;~c~0 := 1 + #t~post5;havoc #t~post5; {70123#(<= main_~c~0 13)} is VALID [2022-04-15 06:32:16,325 INFO L290 TraceCheckUtils]: 47: Hoare triple {70123#(<= main_~c~0 13)} assume !(~c~0 < 200000); {70106#false} is VALID [2022-04-15 06:32:16,325 INFO L290 TraceCheckUtils]: 48: Hoare triple {70106#false} assume 0 == ~st~0 && ~c~0 == 1 + ~last~0;~a~0 := 3 + ~a~0;~b~0 := 3 + ~b~0; {70106#false} is VALID [2022-04-15 06:32:16,325 INFO L290 TraceCheckUtils]: 49: Hoare triple {70106#false} assume !(~c~0 == ~last~0 && 0 == ~st~0); {70106#false} is VALID [2022-04-15 06:32:16,325 INFO L272 TraceCheckUtils]: 50: Hoare triple {70106#false} call __VERIFIER_assert((if ~a~0 == ~b~0 && 200000 == ~c~0 then 1 else 0)); {70106#false} is VALID [2022-04-15 06:32:16,325 INFO L290 TraceCheckUtils]: 51: Hoare triple {70106#false} ~cond := #in~cond; {70106#false} is VALID [2022-04-15 06:32:16,325 INFO L290 TraceCheckUtils]: 52: Hoare triple {70106#false} assume 0 == ~cond; {70106#false} is VALID [2022-04-15 06:32:16,325 INFO L290 TraceCheckUtils]: 53: Hoare triple {70106#false} assume !false; {70106#false} is VALID [2022-04-15 06:32:16,326 INFO L134 CoverageAnalysis]: Checked inductivity of 247 backedges. 0 proven. 247 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 06:32:16,326 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 06:32:16,763 INFO L290 TraceCheckUtils]: 53: Hoare triple {70106#false} assume !false; {70106#false} is VALID [2022-04-15 06:32:16,763 INFO L290 TraceCheckUtils]: 52: Hoare triple {70106#false} assume 0 == ~cond; {70106#false} is VALID [2022-04-15 06:32:16,763 INFO L290 TraceCheckUtils]: 51: Hoare triple {70106#false} ~cond := #in~cond; {70106#false} is VALID [2022-04-15 06:32:16,763 INFO L272 TraceCheckUtils]: 50: Hoare triple {70106#false} call __VERIFIER_assert((if ~a~0 == ~b~0 && 200000 == ~c~0 then 1 else 0)); {70106#false} is VALID [2022-04-15 06:32:16,763 INFO L290 TraceCheckUtils]: 49: Hoare triple {70106#false} assume !(~c~0 == ~last~0 && 0 == ~st~0); {70106#false} is VALID [2022-04-15 06:32:16,763 INFO L290 TraceCheckUtils]: 48: Hoare triple {70106#false} assume 0 == ~st~0 && ~c~0 == 1 + ~last~0;~a~0 := 3 + ~a~0;~b~0 := 3 + ~b~0; {70106#false} is VALID [2022-04-15 06:32:16,764 INFO L290 TraceCheckUtils]: 47: Hoare triple {70306#(< main_~c~0 200000)} assume !(~c~0 < 200000); {70106#false} is VALID [2022-04-15 06:32:16,764 INFO L290 TraceCheckUtils]: 46: Hoare triple {70310#(< main_~c~0 199999)} #t~post5 := ~c~0;~c~0 := 1 + #t~post5;havoc #t~post5; {70306#(< main_~c~0 200000)} is VALID [2022-04-15 06:32:16,764 INFO L290 TraceCheckUtils]: 45: Hoare triple {70310#(< main_~c~0 199999)} assume !(~c~0 == ~last~0); {70310#(< main_~c~0 199999)} is VALID [2022-04-15 06:32:16,765 INFO L290 TraceCheckUtils]: 44: Hoare triple {70310#(< main_~c~0 199999)} assume !!(~c~0 < 200000); {70310#(< main_~c~0 199999)} is VALID [2022-04-15 06:32:16,765 INFO L290 TraceCheckUtils]: 43: Hoare triple {70320#(< main_~c~0 199998)} #t~post5 := ~c~0;~c~0 := 1 + #t~post5;havoc #t~post5; {70310#(< main_~c~0 199999)} is VALID [2022-04-15 06:32:16,765 INFO L290 TraceCheckUtils]: 42: Hoare triple {70320#(< main_~c~0 199998)} assume !(~c~0 == ~last~0); {70320#(< main_~c~0 199998)} is VALID [2022-04-15 06:32:16,765 INFO L290 TraceCheckUtils]: 41: Hoare triple {70320#(< main_~c~0 199998)} assume !!(~c~0 < 200000); {70320#(< main_~c~0 199998)} is VALID [2022-04-15 06:32:16,766 INFO L290 TraceCheckUtils]: 40: Hoare triple {70330#(< main_~c~0 199997)} #t~post5 := ~c~0;~c~0 := 1 + #t~post5;havoc #t~post5; {70320#(< main_~c~0 199998)} is VALID [2022-04-15 06:32:16,766 INFO L290 TraceCheckUtils]: 39: Hoare triple {70330#(< main_~c~0 199997)} assume !(~c~0 == ~last~0); {70330#(< main_~c~0 199997)} is VALID [2022-04-15 06:32:16,766 INFO L290 TraceCheckUtils]: 38: Hoare triple {70330#(< main_~c~0 199997)} assume !!(~c~0 < 200000); {70330#(< main_~c~0 199997)} is VALID [2022-04-15 06:32:16,767 INFO L290 TraceCheckUtils]: 37: Hoare triple {70340#(< main_~c~0 199996)} #t~post5 := ~c~0;~c~0 := 1 + #t~post5;havoc #t~post5; {70330#(< main_~c~0 199997)} is VALID [2022-04-15 06:32:16,767 INFO L290 TraceCheckUtils]: 36: Hoare triple {70340#(< main_~c~0 199996)} assume !(~c~0 == ~last~0); {70340#(< main_~c~0 199996)} is VALID [2022-04-15 06:32:16,767 INFO L290 TraceCheckUtils]: 35: Hoare triple {70340#(< main_~c~0 199996)} assume !!(~c~0 < 200000); {70340#(< main_~c~0 199996)} is VALID [2022-04-15 06:32:16,768 INFO L290 TraceCheckUtils]: 34: Hoare triple {70350#(< main_~c~0 199995)} #t~post5 := ~c~0;~c~0 := 1 + #t~post5;havoc #t~post5; {70340#(< main_~c~0 199996)} is VALID [2022-04-15 06:32:16,768 INFO L290 TraceCheckUtils]: 33: Hoare triple {70350#(< main_~c~0 199995)} assume !(~c~0 == ~last~0); {70350#(< main_~c~0 199995)} is VALID [2022-04-15 06:32:16,768 INFO L290 TraceCheckUtils]: 32: Hoare triple {70350#(< main_~c~0 199995)} assume !!(~c~0 < 200000); {70350#(< main_~c~0 199995)} is VALID [2022-04-15 06:32:16,769 INFO L290 TraceCheckUtils]: 31: Hoare triple {70360#(< main_~c~0 199994)} #t~post5 := ~c~0;~c~0 := 1 + #t~post5;havoc #t~post5; {70350#(< main_~c~0 199995)} is VALID [2022-04-15 06:32:16,769 INFO L290 TraceCheckUtils]: 30: Hoare triple {70360#(< main_~c~0 199994)} assume !(~c~0 == ~last~0); {70360#(< main_~c~0 199994)} is VALID [2022-04-15 06:32:16,769 INFO L290 TraceCheckUtils]: 29: Hoare triple {70360#(< main_~c~0 199994)} assume !!(~c~0 < 200000); {70360#(< main_~c~0 199994)} is VALID [2022-04-15 06:32:16,769 INFO L290 TraceCheckUtils]: 28: Hoare triple {70370#(< main_~c~0 199993)} #t~post5 := ~c~0;~c~0 := 1 + #t~post5;havoc #t~post5; {70360#(< main_~c~0 199994)} is VALID [2022-04-15 06:32:16,770 INFO L290 TraceCheckUtils]: 27: Hoare triple {70370#(< main_~c~0 199993)} assume !(~c~0 == ~last~0); {70370#(< main_~c~0 199993)} is VALID [2022-04-15 06:32:16,770 INFO L290 TraceCheckUtils]: 26: Hoare triple {70370#(< main_~c~0 199993)} assume !!(~c~0 < 200000); {70370#(< main_~c~0 199993)} is VALID [2022-04-15 06:32:16,770 INFO L290 TraceCheckUtils]: 25: Hoare triple {70380#(< main_~c~0 199992)} #t~post5 := ~c~0;~c~0 := 1 + #t~post5;havoc #t~post5; {70370#(< main_~c~0 199993)} is VALID [2022-04-15 06:32:16,771 INFO L290 TraceCheckUtils]: 24: Hoare triple {70380#(< main_~c~0 199992)} assume !(~c~0 == ~last~0); {70380#(< main_~c~0 199992)} is VALID [2022-04-15 06:32:16,771 INFO L290 TraceCheckUtils]: 23: Hoare triple {70380#(< main_~c~0 199992)} assume !!(~c~0 < 200000); {70380#(< main_~c~0 199992)} is VALID [2022-04-15 06:32:16,771 INFO L290 TraceCheckUtils]: 22: Hoare triple {70390#(< main_~c~0 199991)} #t~post5 := ~c~0;~c~0 := 1 + #t~post5;havoc #t~post5; {70380#(< main_~c~0 199992)} is VALID [2022-04-15 06:32:16,771 INFO L290 TraceCheckUtils]: 21: Hoare triple {70390#(< main_~c~0 199991)} assume !(~c~0 == ~last~0); {70390#(< main_~c~0 199991)} is VALID [2022-04-15 06:32:16,772 INFO L290 TraceCheckUtils]: 20: Hoare triple {70390#(< main_~c~0 199991)} assume !!(~c~0 < 200000); {70390#(< main_~c~0 199991)} is VALID [2022-04-15 06:32:16,772 INFO L290 TraceCheckUtils]: 19: Hoare triple {70400#(< main_~c~0 199990)} #t~post5 := ~c~0;~c~0 := 1 + #t~post5;havoc #t~post5; {70390#(< main_~c~0 199991)} is VALID [2022-04-15 06:32:16,772 INFO L290 TraceCheckUtils]: 18: Hoare triple {70400#(< main_~c~0 199990)} assume !(~c~0 == ~last~0); {70400#(< main_~c~0 199990)} is VALID [2022-04-15 06:32:16,773 INFO L290 TraceCheckUtils]: 17: Hoare triple {70400#(< main_~c~0 199990)} assume !!(~c~0 < 200000); {70400#(< main_~c~0 199990)} is VALID [2022-04-15 06:32:16,773 INFO L290 TraceCheckUtils]: 16: Hoare triple {70410#(< main_~c~0 199989)} #t~post5 := ~c~0;~c~0 := 1 + #t~post5;havoc #t~post5; {70400#(< main_~c~0 199990)} is VALID [2022-04-15 06:32:16,773 INFO L290 TraceCheckUtils]: 15: Hoare triple {70410#(< main_~c~0 199989)} assume !(~c~0 == ~last~0); {70410#(< main_~c~0 199989)} is VALID [2022-04-15 06:32:16,774 INFO L290 TraceCheckUtils]: 14: Hoare triple {70410#(< main_~c~0 199989)} assume !!(~c~0 < 200000); {70410#(< main_~c~0 199989)} is VALID [2022-04-15 06:32:16,774 INFO L290 TraceCheckUtils]: 13: Hoare triple {70420#(< main_~c~0 199988)} #t~post5 := ~c~0;~c~0 := 1 + #t~post5;havoc #t~post5; {70410#(< main_~c~0 199989)} is VALID [2022-04-15 06:32:16,774 INFO L290 TraceCheckUtils]: 12: Hoare triple {70420#(< main_~c~0 199988)} assume !(~c~0 == ~last~0); {70420#(< main_~c~0 199988)} is VALID [2022-04-15 06:32:16,774 INFO L290 TraceCheckUtils]: 11: Hoare triple {70420#(< main_~c~0 199988)} assume !!(~c~0 < 200000); {70420#(< main_~c~0 199988)} is VALID [2022-04-15 06:32:16,775 INFO L290 TraceCheckUtils]: 10: Hoare triple {70430#(< main_~c~0 199987)} #t~post5 := ~c~0;~c~0 := 1 + #t~post5;havoc #t~post5; {70420#(< main_~c~0 199988)} is VALID [2022-04-15 06:32:16,775 INFO L290 TraceCheckUtils]: 9: Hoare triple {70430#(< main_~c~0 199987)} assume ~c~0 == ~last~0;~st~0 := 0; {70430#(< main_~c~0 199987)} is VALID [2022-04-15 06:32:16,775 INFO L290 TraceCheckUtils]: 8: Hoare triple {70430#(< main_~c~0 199987)} assume !!(~c~0 < 200000); {70430#(< main_~c~0 199987)} is VALID [2022-04-15 06:32:16,776 INFO L290 TraceCheckUtils]: 7: Hoare triple {70105#true} [211] L23-3_primed-->L23-3: Formula: (and (= v_main_~c~0_7 0) (= v_main_~st~0_6 1)) InVars {} OutVars{main_~c~0=v_main_~c~0_7, main_~st~0=v_main_~st~0_6} AuxVars[] AssignedVars[main_~c~0, main_~st~0] {70430#(< main_~c~0 199987)} is VALID [2022-04-15 06:32:16,776 INFO L290 TraceCheckUtils]: 6: Hoare triple {70105#true} [212] L30-->L23-3_primed: Formula: (and (= v_main_~b~0_200 v_main_~b~0_199) (= v_main_~a~0_203 v_main_~a~0_202) (= v_main_~c~0_1331 v_main_~c~0_1317) (= |v_main_#t~post5_591| |v_main_#t~post5_578|) (= v_main_~st~0_392 v_main_~st~0_390)) InVars {main_~c~0=v_main_~c~0_1331, main_#t~post5=|v_main_#t~post5_591|, main_~st~0=v_main_~st~0_392, main_~b~0=v_main_~b~0_200, main_~a~0=v_main_~a~0_203} OutVars{main_~c~0=v_main_~c~0_1317, main_#t~post5=|v_main_#t~post5_578|, main_~st~0=v_main_~st~0_390, main_~b~0=v_main_~b~0_199, main_~a~0=v_main_~a~0_202} AuxVars[] AssignedVars[main_~c~0, main_#t~post5, main_~st~0, main_~b~0, main_~a~0] {70105#true} is VALID [2022-04-15 06:32:16,776 INFO L290 TraceCheckUtils]: 5: Hoare triple {70105#true} assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~last~0 := #t~nondet4;havoc #t~nondet4;~a~0 := 0;~b~0 := 0;~c~0 := 0;~st~0 := 0; {70105#true} is VALID [2022-04-15 06:32:16,776 INFO L272 TraceCheckUtils]: 4: Hoare triple {70105#true} call #t~ret6 := main(); {70105#true} is VALID [2022-04-15 06:32:16,776 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {70105#true} {70105#true} #66#return; {70105#true} is VALID [2022-04-15 06:32:16,776 INFO L290 TraceCheckUtils]: 2: Hoare triple {70105#true} assume true; {70105#true} is VALID [2022-04-15 06:32:16,776 INFO L290 TraceCheckUtils]: 1: Hoare triple {70105#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(11, 2);call #Ultimate.allocInit(12, 3);~last~0 := 0; {70105#true} is VALID [2022-04-15 06:32:16,776 INFO L272 TraceCheckUtils]: 0: Hoare triple {70105#true} call ULTIMATE.init(); {70105#true} is VALID [2022-04-15 06:32:16,776 INFO L134 CoverageAnalysis]: Checked inductivity of 247 backedges. 0 proven. 247 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 06:32:16,776 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [899769406] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 06:32:16,776 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 06:32:16,776 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 16, 16] total 32 [2022-04-15 06:32:17,115 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 06:32:17,116 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [915251338] [2022-04-15 06:32:17,116 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [915251338] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 06:32:17,116 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 06:32:17,116 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [32] imperfect sequences [] total 32 [2022-04-15 06:32:17,116 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2123686627] [2022-04-15 06:32:17,116 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 06:32:17,116 INFO L78 Accepts]: Start accepts. Automaton has has 32 states, 32 states have (on average 2.90625) internal successors, (93), 31 states have internal predecessors, (93), 2 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 101 [2022-04-15 06:32:17,116 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 06:32:17,116 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 32 states, 32 states have (on average 2.90625) internal successors, (93), 31 states have internal predecessors, (93), 2 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-15 06:32:17,156 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 98 edges. 98 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 06:32:17,156 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2022-04-15 06:32:17,156 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 06:32:17,157 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2022-04-15 06:32:17,157 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=828, Invalid=1334, Unknown=0, NotChecked=0, Total=2162 [2022-04-15 06:32:17,157 INFO L87 Difference]: Start difference. First operand 452 states and 511 transitions. Second operand has 32 states, 32 states have (on average 2.90625) internal successors, (93), 31 states have internal predecessors, (93), 2 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-15 06:32:19,804 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:32:19,804 INFO L93 Difference]: Finished difference Result 672 states and 770 transitions. [2022-04-15 06:32:19,804 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2022-04-15 06:32:19,804 INFO L78 Accepts]: Start accepts. Automaton has has 32 states, 32 states have (on average 2.90625) internal successors, (93), 31 states have internal predecessors, (93), 2 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 101 [2022-04-15 06:32:19,805 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 06:32:19,805 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32 states, 32 states have (on average 2.90625) internal successors, (93), 31 states have internal predecessors, (93), 2 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-15 06:32:19,805 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 137 transitions. [2022-04-15 06:32:19,805 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32 states, 32 states have (on average 2.90625) internal successors, (93), 31 states have internal predecessors, (93), 2 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-15 06:32:19,806 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 137 transitions. [2022-04-15 06:32:19,806 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 32 states and 137 transitions. [2022-04-15 06:32:19,894 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 137 edges. 137 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 06:32:19,907 INFO L225 Difference]: With dead ends: 672 [2022-04-15 06:32:19,907 INFO L226 Difference]: Without dead ends: 572 [2022-04-15 06:32:19,907 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 181 GetRequests, 119 SyntacticMatches, 17 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1828 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=828, Invalid=1334, Unknown=0, NotChecked=0, Total=2162 [2022-04-15 06:32:19,907 INFO L913 BasicCegarLoop]: 18 mSDtfsCounter, 98 mSDsluCounter, 24 mSDsCounter, 0 mSdLazyCounter, 746 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 98 SdHoareTripleChecker+Valid, 42 SdHoareTripleChecker+Invalid, 765 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 746 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-04-15 06:32:19,908 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [98 Valid, 42 Invalid, 765 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 746 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-04-15 06:32:19,908 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 572 states. [2022-04-15 06:32:21,513 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 572 to 499. [2022-04-15 06:32:21,513 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 06:32:21,514 INFO L82 GeneralOperation]: Start isEquivalent. First operand 572 states. Second operand has 499 states, 491 states have (on average 1.1262729124236253) internal successors, (553), 492 states have internal predecessors, (553), 4 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-15 06:32:21,514 INFO L74 IsIncluded]: Start isIncluded. First operand 572 states. Second operand has 499 states, 491 states have (on average 1.1262729124236253) internal successors, (553), 492 states have internal predecessors, (553), 4 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-15 06:32:21,514 INFO L87 Difference]: Start difference. First operand 572 states. Second operand has 499 states, 491 states have (on average 1.1262729124236253) internal successors, (553), 492 states have internal predecessors, (553), 4 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-15 06:32:21,524 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:32:21,524 INFO L93 Difference]: Finished difference Result 572 states and 635 transitions. [2022-04-15 06:32:21,524 INFO L276 IsEmpty]: Start isEmpty. Operand 572 states and 635 transitions. [2022-04-15 06:32:21,524 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 06:32:21,524 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 06:32:21,524 INFO L74 IsIncluded]: Start isIncluded. First operand has 499 states, 491 states have (on average 1.1262729124236253) internal successors, (553), 492 states have internal predecessors, (553), 4 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) Second operand 572 states. [2022-04-15 06:32:21,525 INFO L87 Difference]: Start difference. First operand has 499 states, 491 states have (on average 1.1262729124236253) internal successors, (553), 492 states have internal predecessors, (553), 4 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) Second operand 572 states. [2022-04-15 06:32:21,533 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:32:21,533 INFO L93 Difference]: Finished difference Result 572 states and 635 transitions. [2022-04-15 06:32:21,534 INFO L276 IsEmpty]: Start isEmpty. Operand 572 states and 635 transitions. [2022-04-15 06:32:21,534 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 06:32:21,534 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 06:32:21,534 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 06:32:21,534 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 06:32:21,534 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 499 states, 491 states have (on average 1.1262729124236253) internal successors, (553), 492 states have internal predecessors, (553), 4 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-15 06:32:21,548 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 499 states to 499 states and 560 transitions. [2022-04-15 06:32:21,549 INFO L78 Accepts]: Start accepts. Automaton has 499 states and 560 transitions. Word has length 101 [2022-04-15 06:32:21,549 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 06:32:21,549 INFO L478 AbstractCegarLoop]: Abstraction has 499 states and 560 transitions. [2022-04-15 06:32:21,549 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 32 states, 32 states have (on average 2.90625) internal successors, (93), 31 states have internal predecessors, (93), 2 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-15 06:32:21,549 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 499 states and 560 transitions. [2022-04-15 06:32:23,108 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 560 edges. 560 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 06:32:23,109 INFO L276 IsEmpty]: Start isEmpty. Operand 499 states and 560 transitions. [2022-04-15 06:32:23,109 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2022-04-15 06:32:23,109 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 06:32:23,109 INFO L499 BasicCegarLoop]: trace histogram [29, 29, 28, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 06:32:23,126 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-15 06:32:23,325 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 41 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable44 [2022-04-15 06:32:23,325 INFO L403 AbstractCegarLoop]: === Iteration 46 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 06:32:23,326 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 06:32:23,326 INFO L85 PathProgramCache]: Analyzing trace with hash 2100040420, now seen corresponding path program 28 times [2022-04-15 06:32:23,326 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 06:32:23,326 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [151521013] [2022-04-15 06:32:27,403 WARN L977 rdanLoopAcceleration]: Unable to prove correctness of quantifier elimination. [2022-04-15 06:32:27,497 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 1 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-15 06:32:27,698 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {0={1=1}, 1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-15 06:32:27,699 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-15 06:32:27,702 INFO L85 PathProgramCache]: Analyzing trace with hash 1017491656, now seen corresponding path program 1 times [2022-04-15 06:32:27,702 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 06:32:27,702 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [433721040] [2022-04-15 06:32:27,702 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 06:32:27,702 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 06:32:27,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:32:27,814 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 06:32:27,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:32:27,817 INFO L290 TraceCheckUtils]: 0: Hoare triple {73976#(and (= ~last~0 |old(~last~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(11, 2);call #Ultimate.allocInit(12, 3);~last~0 := 0; {73964#true} is VALID [2022-04-15 06:32:27,817 INFO L290 TraceCheckUtils]: 1: Hoare triple {73964#true} assume true; {73964#true} is VALID [2022-04-15 06:32:27,817 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {73964#true} {73964#true} #66#return; {73964#true} is VALID [2022-04-15 06:32:27,818 INFO L272 TraceCheckUtils]: 0: Hoare triple {73964#true} call ULTIMATE.init(); {73976#(and (= ~last~0 |old(~last~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 06:32:27,818 INFO L290 TraceCheckUtils]: 1: Hoare triple {73976#(and (= ~last~0 |old(~last~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(11, 2);call #Ultimate.allocInit(12, 3);~last~0 := 0; {73964#true} is VALID [2022-04-15 06:32:27,818 INFO L290 TraceCheckUtils]: 2: Hoare triple {73964#true} assume true; {73964#true} is VALID [2022-04-15 06:32:27,818 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {73964#true} {73964#true} #66#return; {73964#true} is VALID [2022-04-15 06:32:27,818 INFO L272 TraceCheckUtils]: 4: Hoare triple {73964#true} call #t~ret6 := main(); {73964#true} is VALID [2022-04-15 06:32:27,818 INFO L290 TraceCheckUtils]: 5: Hoare triple {73964#true} assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~last~0 := #t~nondet4;havoc #t~nondet4;~a~0 := 0;~b~0 := 0;~c~0 := 0;~st~0 := 0; {73969#(and (= main_~a~0 0) (= main_~b~0 0))} is VALID [2022-04-15 06:32:27,819 INFO L290 TraceCheckUtils]: 6: Hoare triple {73969#(and (= main_~a~0 0) (= main_~b~0 0))} assume !false;~st~0 := 1;~c~0 := 0; {73970#(and (= main_~a~0 0) (= main_~st~0 1) (= main_~b~0 0))} is VALID [2022-04-15 06:32:27,819 INFO L290 TraceCheckUtils]: 7: Hoare triple {73970#(and (= main_~a~0 0) (= main_~st~0 1) (= main_~b~0 0))} [214] L23-3-->L23-4_primed: Formula: (let ((.cse0 (= v_~last~0_301 v_main_~c~0_1376)) (.cse1 (= v_main_~c~0_1376 v_main_~c~0_1375))) (or (and (or (not (< v_main_~c~0_1376 200000)) .cse0) (= |v_main_#t~post5_608| |v_main_#t~post5_610|) .cse1) (and (< v_main_~c~0_1375 200001) (not .cse0) (< v_main_~c~0_1376 v_main_~c~0_1375) (or (not (<= (+ v_main_~c~0_1376 1) v_~last~0_301)) (not (<= (+ v_~last~0_301 1) v_main_~c~0_1375)))) (and (= v_~last~0_301 v_~last~0_301) (= |v_main_#t~post5_610| |v_main_#t~post5_608|) .cse1))) InVars {main_~c~0=v_main_~c~0_1376, main_#t~post5=|v_main_#t~post5_610|, ~last~0=v_~last~0_301} OutVars{main_#t~post5=|v_main_#t~post5_608|, main_~c~0=v_main_~c~0_1375, ~last~0=v_~last~0_301} AuxVars[] AssignedVars[main_#t~post5, main_~c~0] {73970#(and (= main_~a~0 0) (= main_~st~0 1) (= main_~b~0 0))} is VALID [2022-04-15 06:32:27,819 INFO L290 TraceCheckUtils]: 8: Hoare triple {73970#(and (= main_~a~0 0) (= main_~st~0 1) (= main_~b~0 0))} [215] L23-4_primed-->L23-3: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {73970#(and (= main_~a~0 0) (= main_~st~0 1) (= main_~b~0 0))} is VALID [2022-04-15 06:32:27,820 INFO L290 TraceCheckUtils]: 9: Hoare triple {73970#(and (= main_~a~0 0) (= main_~st~0 1) (= main_~b~0 0))} [216] L23-3-->L23-4_primed: Formula: (let ((.cse1 (< v_main_~c~0_1378 200000)) (.cse0 (= v_~last~0_302 v_main_~c~0_1378)) (.cse2 (= v_main_~c~0_1378 v_main_~c~0_1377)) (.cse3 (= v_main_~st~0_400 v_main_~st~0_399))) (or (and (< v_main_~c~0_1378 v_main_~c~0_1377) .cse0 (= v_main_~st~0_399 0) .cse1 (< v_main_~c~0_1377 (+ 2 v_main_~c~0_1378))) (and (or (not .cse1) (not .cse0)) .cse2 .cse3 (= |v_main_#t~post5_609| |v_main_#t~post5_613|)) (and (= v_~last~0_302 v_~last~0_302) .cse2 (= |v_main_#t~post5_613| |v_main_#t~post5_609|) .cse3))) InVars {main_~c~0=v_main_~c~0_1378, main_#t~post5=|v_main_#t~post5_613|, main_~st~0=v_main_~st~0_400, ~last~0=v_~last~0_302} OutVars{main_#t~post5=|v_main_#t~post5_609|, main_~c~0=v_main_~c~0_1377, main_~st~0=v_main_~st~0_399, ~last~0=v_~last~0_302} AuxVars[] AssignedVars[main_#t~post5, main_~c~0, main_~st~0] {73971#(or (and (= main_~a~0 0) (= main_~b~0 0) (<= main_~c~0 200000)) (= main_~st~0 1))} is VALID [2022-04-15 06:32:27,821 INFO L290 TraceCheckUtils]: 10: Hoare triple {73971#(or (and (= main_~a~0 0) (= main_~b~0 0) (<= main_~c~0 200000)) (= main_~st~0 1))} [213] L23-4_primed-->L23-4: Formula: (not (< v_main_~c~0_8 200000)) InVars {main_~c~0=v_main_~c~0_8} OutVars{main_~c~0=v_main_~c~0_8} AuxVars[] AssignedVars[] {73972#(or (and (= main_~a~0 0) (= main_~b~0 0) (< 199999 main_~c~0) (<= main_~c~0 200000)) (= main_~st~0 1))} is VALID [2022-04-15 06:32:27,821 INFO L290 TraceCheckUtils]: 11: Hoare triple {73972#(or (and (= main_~a~0 0) (= main_~b~0 0) (< 199999 main_~c~0) (<= main_~c~0 200000)) (= main_~st~0 1))} assume 0 == ~st~0 && ~c~0 == 1 + ~last~0;~a~0 := 3 + ~a~0;~b~0 := 3 + ~b~0; {73973#(and (<= main_~b~0 main_~a~0) (< main_~a~0 (+ main_~b~0 1)) (< 199999 main_~c~0) (<= main_~c~0 200000))} is VALID [2022-04-15 06:32:27,822 INFO L290 TraceCheckUtils]: 12: Hoare triple {73973#(and (<= main_~b~0 main_~a~0) (< main_~a~0 (+ main_~b~0 1)) (< 199999 main_~c~0) (<= main_~c~0 200000))} assume !(~c~0 == ~last~0 && 0 == ~st~0); {73973#(and (<= main_~b~0 main_~a~0) (< main_~a~0 (+ main_~b~0 1)) (< 199999 main_~c~0) (<= main_~c~0 200000))} is VALID [2022-04-15 06:32:27,822 INFO L272 TraceCheckUtils]: 13: Hoare triple {73973#(and (<= main_~b~0 main_~a~0) (< main_~a~0 (+ main_~b~0 1)) (< 199999 main_~c~0) (<= main_~c~0 200000))} call __VERIFIER_assert((if ~a~0 == ~b~0 && 200000 == ~c~0 then 1 else 0)); {73974#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-15 06:32:27,823 INFO L290 TraceCheckUtils]: 14: Hoare triple {73974#(not (= |__VERIFIER_assert_#in~cond| 0))} ~cond := #in~cond; {73975#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-15 06:32:27,823 INFO L290 TraceCheckUtils]: 15: Hoare triple {73975#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {73965#false} is VALID [2022-04-15 06:32:27,823 INFO L290 TraceCheckUtils]: 16: Hoare triple {73965#false} assume !false; {73965#false} is VALID [2022-04-15 06:32:27,823 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-04-15 06:32:27,823 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 06:32:27,823 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [433721040] [2022-04-15 06:32:27,823 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [433721040] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 06:32:27,823 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [829685693] [2022-04-15 06:32:27,823 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 06:32:27,823 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 06:32:27,824 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 06:32:27,824 INFO L229 MonitoredProcess]: Starting monitored process 42 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-15 06:32:27,825 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (42)] Waiting until timeout for monitored process [2022-04-15 06:32:27,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:32:27,853 INFO L263 TraceCheckSpWp]: Trace formula consists of 85 conjuncts, 18 conjunts are in the unsatisfiable core [2022-04-15 06:32:27,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:32:27,859 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 06:32:28,130 INFO L272 TraceCheckUtils]: 0: Hoare triple {73964#true} call ULTIMATE.init(); {73964#true} is VALID [2022-04-15 06:32:28,130 INFO L290 TraceCheckUtils]: 1: Hoare triple {73964#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(11, 2);call #Ultimate.allocInit(12, 3);~last~0 := 0; {73964#true} is VALID [2022-04-15 06:32:28,130 INFO L290 TraceCheckUtils]: 2: Hoare triple {73964#true} assume true; {73964#true} is VALID [2022-04-15 06:32:28,130 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {73964#true} {73964#true} #66#return; {73964#true} is VALID [2022-04-15 06:32:28,130 INFO L272 TraceCheckUtils]: 4: Hoare triple {73964#true} call #t~ret6 := main(); {73964#true} is VALID [2022-04-15 06:32:28,130 INFO L290 TraceCheckUtils]: 5: Hoare triple {73964#true} assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~last~0 := #t~nondet4;havoc #t~nondet4;~a~0 := 0;~b~0 := 0;~c~0 := 0;~st~0 := 0; {73969#(and (= main_~a~0 0) (= main_~b~0 0))} is VALID [2022-04-15 06:32:28,131 INFO L290 TraceCheckUtils]: 6: Hoare triple {73969#(and (= main_~a~0 0) (= main_~b~0 0))} assume !false;~st~0 := 1;~c~0 := 0; {73970#(and (= main_~a~0 0) (= main_~st~0 1) (= main_~b~0 0))} is VALID [2022-04-15 06:32:28,131 INFO L290 TraceCheckUtils]: 7: Hoare triple {73970#(and (= main_~a~0 0) (= main_~st~0 1) (= main_~b~0 0))} [214] L23-3-->L23-4_primed: Formula: (let ((.cse0 (= v_~last~0_301 v_main_~c~0_1376)) (.cse1 (= v_main_~c~0_1376 v_main_~c~0_1375))) (or (and (or (not (< v_main_~c~0_1376 200000)) .cse0) (= |v_main_#t~post5_608| |v_main_#t~post5_610|) .cse1) (and (< v_main_~c~0_1375 200001) (not .cse0) (< v_main_~c~0_1376 v_main_~c~0_1375) (or (not (<= (+ v_main_~c~0_1376 1) v_~last~0_301)) (not (<= (+ v_~last~0_301 1) v_main_~c~0_1375)))) (and (= v_~last~0_301 v_~last~0_301) (= |v_main_#t~post5_610| |v_main_#t~post5_608|) .cse1))) InVars {main_~c~0=v_main_~c~0_1376, main_#t~post5=|v_main_#t~post5_610|, ~last~0=v_~last~0_301} OutVars{main_#t~post5=|v_main_#t~post5_608|, main_~c~0=v_main_~c~0_1375, ~last~0=v_~last~0_301} AuxVars[] AssignedVars[main_#t~post5, main_~c~0] {73970#(and (= main_~a~0 0) (= main_~st~0 1) (= main_~b~0 0))} is VALID [2022-04-15 06:32:28,132 INFO L290 TraceCheckUtils]: 8: Hoare triple {73970#(and (= main_~a~0 0) (= main_~st~0 1) (= main_~b~0 0))} [215] L23-4_primed-->L23-3: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {73970#(and (= main_~a~0 0) (= main_~st~0 1) (= main_~b~0 0))} is VALID [2022-04-15 06:32:28,132 INFO L290 TraceCheckUtils]: 9: Hoare triple {73970#(and (= main_~a~0 0) (= main_~st~0 1) (= main_~b~0 0))} [216] L23-3-->L23-4_primed: Formula: (let ((.cse1 (< v_main_~c~0_1378 200000)) (.cse0 (= v_~last~0_302 v_main_~c~0_1378)) (.cse2 (= v_main_~c~0_1378 v_main_~c~0_1377)) (.cse3 (= v_main_~st~0_400 v_main_~st~0_399))) (or (and (< v_main_~c~0_1378 v_main_~c~0_1377) .cse0 (= v_main_~st~0_399 0) .cse1 (< v_main_~c~0_1377 (+ 2 v_main_~c~0_1378))) (and (or (not .cse1) (not .cse0)) .cse2 .cse3 (= |v_main_#t~post5_609| |v_main_#t~post5_613|)) (and (= v_~last~0_302 v_~last~0_302) .cse2 (= |v_main_#t~post5_613| |v_main_#t~post5_609|) .cse3))) InVars {main_~c~0=v_main_~c~0_1378, main_#t~post5=|v_main_#t~post5_613|, main_~st~0=v_main_~st~0_400, ~last~0=v_~last~0_302} OutVars{main_#t~post5=|v_main_#t~post5_609|, main_~c~0=v_main_~c~0_1377, main_~st~0=v_main_~st~0_399, ~last~0=v_~last~0_302} AuxVars[] AssignedVars[main_#t~post5, main_~c~0, main_~st~0] {74007#(and (= main_~a~0 0) (= main_~b~0 0) (or (= main_~st~0 1) (and (< ~last~0 200000) (< ~last~0 main_~c~0) (< main_~c~0 (+ ~last~0 2)) (= main_~st~0 0))))} is VALID [2022-04-15 06:32:28,133 INFO L290 TraceCheckUtils]: 10: Hoare triple {74007#(and (= main_~a~0 0) (= main_~b~0 0) (or (= main_~st~0 1) (and (< ~last~0 200000) (< ~last~0 main_~c~0) (< main_~c~0 (+ ~last~0 2)) (= main_~st~0 0))))} [213] L23-4_primed-->L23-4: Formula: (not (< v_main_~c~0_8 200000)) InVars {main_~c~0=v_main_~c~0_8} OutVars{main_~c~0=v_main_~c~0_8} AuxVars[] AssignedVars[] {74011#(and (= main_~a~0 0) (or (and (< ~last~0 200000) (< main_~c~0 (+ ~last~0 2)) (= main_~st~0 0)) (= main_~st~0 1)) (= main_~b~0 0) (not (< main_~c~0 200000)))} is VALID [2022-04-15 06:32:28,134 INFO L290 TraceCheckUtils]: 11: Hoare triple {74011#(and (= main_~a~0 0) (or (and (< ~last~0 200000) (< main_~c~0 (+ ~last~0 2)) (= main_~st~0 0)) (= main_~st~0 1)) (= main_~b~0 0) (not (< main_~c~0 200000)))} assume 0 == ~st~0 && ~c~0 == 1 + ~last~0;~a~0 := 3 + ~a~0;~b~0 := 3 + ~b~0; {74015#(and (= main_~b~0 3) (<= 200000 main_~c~0) (< main_~c~0 200001) (= main_~a~0 3))} is VALID [2022-04-15 06:32:28,134 INFO L290 TraceCheckUtils]: 12: Hoare triple {74015#(and (= main_~b~0 3) (<= 200000 main_~c~0) (< main_~c~0 200001) (= main_~a~0 3))} assume !(~c~0 == ~last~0 && 0 == ~st~0); {74015#(and (= main_~b~0 3) (<= 200000 main_~c~0) (< main_~c~0 200001) (= main_~a~0 3))} is VALID [2022-04-15 06:32:28,135 INFO L272 TraceCheckUtils]: 13: Hoare triple {74015#(and (= main_~b~0 3) (<= 200000 main_~c~0) (< main_~c~0 200001) (= main_~a~0 3))} call __VERIFIER_assert((if ~a~0 == ~b~0 && 200000 == ~c~0 then 1 else 0)); {74022#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-15 06:32:28,135 INFO L290 TraceCheckUtils]: 14: Hoare triple {74022#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {74026#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-15 06:32:28,135 INFO L290 TraceCheckUtils]: 15: Hoare triple {74026#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {73965#false} is VALID [2022-04-15 06:32:28,135 INFO L290 TraceCheckUtils]: 16: Hoare triple {73965#false} assume !false; {73965#false} is VALID [2022-04-15 06:32:28,135 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-04-15 06:32:28,136 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 06:32:28,566 INFO L290 TraceCheckUtils]: 16: Hoare triple {73965#false} assume !false; {73965#false} is VALID [2022-04-15 06:32:28,566 INFO L290 TraceCheckUtils]: 15: Hoare triple {74026#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {73965#false} is VALID [2022-04-15 06:32:28,567 INFO L290 TraceCheckUtils]: 14: Hoare triple {74022#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {74026#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-15 06:32:28,567 INFO L272 TraceCheckUtils]: 13: Hoare triple {73973#(and (<= main_~b~0 main_~a~0) (< main_~a~0 (+ main_~b~0 1)) (< 199999 main_~c~0) (<= main_~c~0 200000))} call __VERIFIER_assert((if ~a~0 == ~b~0 && 200000 == ~c~0 then 1 else 0)); {74022#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-15 06:32:28,568 INFO L290 TraceCheckUtils]: 12: Hoare triple {73973#(and (<= main_~b~0 main_~a~0) (< main_~a~0 (+ main_~b~0 1)) (< 199999 main_~c~0) (<= main_~c~0 200000))} assume !(~c~0 == ~last~0 && 0 == ~st~0); {73973#(and (<= main_~b~0 main_~a~0) (< main_~a~0 (+ main_~b~0 1)) (< 199999 main_~c~0) (<= main_~c~0 200000))} is VALID [2022-04-15 06:32:28,569 INFO L290 TraceCheckUtils]: 11: Hoare triple {74048#(or (not (<= main_~c~0 (+ ~last~0 1))) (and (<= main_~b~0 main_~a~0) (< main_~a~0 (+ main_~b~0 1)) (< 199999 main_~c~0) (<= main_~c~0 200000)) (not (= main_~st~0 0)))} assume 0 == ~st~0 && ~c~0 == 1 + ~last~0;~a~0 := 3 + ~a~0;~b~0 := 3 + ~b~0; {73973#(and (<= main_~b~0 main_~a~0) (< main_~a~0 (+ main_~b~0 1)) (< 199999 main_~c~0) (<= main_~c~0 200000))} is VALID [2022-04-15 06:32:28,569 INFO L290 TraceCheckUtils]: 10: Hoare triple {74052#(or (not (<= main_~c~0 (+ ~last~0 1))) (and (<= main_~b~0 main_~a~0) (< main_~a~0 (+ main_~b~0 1)) (<= main_~c~0 200000)) (not (= main_~st~0 0)) (< main_~c~0 200000))} [213] L23-4_primed-->L23-4: Formula: (not (< v_main_~c~0_8 200000)) InVars {main_~c~0=v_main_~c~0_8} OutVars{main_~c~0=v_main_~c~0_8} AuxVars[] AssignedVars[] {74048#(or (not (<= main_~c~0 (+ ~last~0 1))) (and (<= main_~b~0 main_~a~0) (< main_~a~0 (+ main_~b~0 1)) (< 199999 main_~c~0) (<= main_~c~0 200000)) (not (= main_~st~0 0)))} is VALID [2022-04-15 06:32:28,570 INFO L290 TraceCheckUtils]: 9: Hoare triple {74056#(and (<= main_~b~0 main_~a~0) (< main_~a~0 (+ main_~b~0 1)) (not (= main_~st~0 0)))} [216] L23-3-->L23-4_primed: Formula: (let ((.cse1 (< v_main_~c~0_1378 200000)) (.cse0 (= v_~last~0_302 v_main_~c~0_1378)) (.cse2 (= v_main_~c~0_1378 v_main_~c~0_1377)) (.cse3 (= v_main_~st~0_400 v_main_~st~0_399))) (or (and (< v_main_~c~0_1378 v_main_~c~0_1377) .cse0 (= v_main_~st~0_399 0) .cse1 (< v_main_~c~0_1377 (+ 2 v_main_~c~0_1378))) (and (or (not .cse1) (not .cse0)) .cse2 .cse3 (= |v_main_#t~post5_609| |v_main_#t~post5_613|)) (and (= v_~last~0_302 v_~last~0_302) .cse2 (= |v_main_#t~post5_613| |v_main_#t~post5_609|) .cse3))) InVars {main_~c~0=v_main_~c~0_1378, main_#t~post5=|v_main_#t~post5_613|, main_~st~0=v_main_~st~0_400, ~last~0=v_~last~0_302} OutVars{main_#t~post5=|v_main_#t~post5_609|, main_~c~0=v_main_~c~0_1377, main_~st~0=v_main_~st~0_399, ~last~0=v_~last~0_302} AuxVars[] AssignedVars[main_#t~post5, main_~c~0, main_~st~0] {74052#(or (not (<= main_~c~0 (+ ~last~0 1))) (and (<= main_~b~0 main_~a~0) (< main_~a~0 (+ main_~b~0 1)) (<= main_~c~0 200000)) (not (= main_~st~0 0)) (< main_~c~0 200000))} is VALID [2022-04-15 06:32:28,570 INFO L290 TraceCheckUtils]: 8: Hoare triple {74056#(and (<= main_~b~0 main_~a~0) (< main_~a~0 (+ main_~b~0 1)) (not (= main_~st~0 0)))} [215] L23-4_primed-->L23-3: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {74056#(and (<= main_~b~0 main_~a~0) (< main_~a~0 (+ main_~b~0 1)) (not (= main_~st~0 0)))} is VALID [2022-04-15 06:32:28,571 INFO L290 TraceCheckUtils]: 7: Hoare triple {74056#(and (<= main_~b~0 main_~a~0) (< main_~a~0 (+ main_~b~0 1)) (not (= main_~st~0 0)))} [214] L23-3-->L23-4_primed: Formula: (let ((.cse0 (= v_~last~0_301 v_main_~c~0_1376)) (.cse1 (= v_main_~c~0_1376 v_main_~c~0_1375))) (or (and (or (not (< v_main_~c~0_1376 200000)) .cse0) (= |v_main_#t~post5_608| |v_main_#t~post5_610|) .cse1) (and (< v_main_~c~0_1375 200001) (not .cse0) (< v_main_~c~0_1376 v_main_~c~0_1375) (or (not (<= (+ v_main_~c~0_1376 1) v_~last~0_301)) (not (<= (+ v_~last~0_301 1) v_main_~c~0_1375)))) (and (= v_~last~0_301 v_~last~0_301) (= |v_main_#t~post5_610| |v_main_#t~post5_608|) .cse1))) InVars {main_~c~0=v_main_~c~0_1376, main_#t~post5=|v_main_#t~post5_610|, ~last~0=v_~last~0_301} OutVars{main_#t~post5=|v_main_#t~post5_608|, main_~c~0=v_main_~c~0_1375, ~last~0=v_~last~0_301} AuxVars[] AssignedVars[main_#t~post5, main_~c~0] {74056#(and (<= main_~b~0 main_~a~0) (< main_~a~0 (+ main_~b~0 1)) (not (= main_~st~0 0)))} is VALID [2022-04-15 06:32:28,571 INFO L290 TraceCheckUtils]: 6: Hoare triple {74066#(and (<= main_~b~0 main_~a~0) (< main_~a~0 (+ main_~b~0 1)))} assume !false;~st~0 := 1;~c~0 := 0; {74056#(and (<= main_~b~0 main_~a~0) (< main_~a~0 (+ main_~b~0 1)) (not (= main_~st~0 0)))} is VALID [2022-04-15 06:32:28,572 INFO L290 TraceCheckUtils]: 5: Hoare triple {73964#true} assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~last~0 := #t~nondet4;havoc #t~nondet4;~a~0 := 0;~b~0 := 0;~c~0 := 0;~st~0 := 0; {74066#(and (<= main_~b~0 main_~a~0) (< main_~a~0 (+ main_~b~0 1)))} is VALID [2022-04-15 06:32:28,572 INFO L272 TraceCheckUtils]: 4: Hoare triple {73964#true} call #t~ret6 := main(); {73964#true} is VALID [2022-04-15 06:32:28,572 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {73964#true} {73964#true} #66#return; {73964#true} is VALID [2022-04-15 06:32:28,572 INFO L290 TraceCheckUtils]: 2: Hoare triple {73964#true} assume true; {73964#true} is VALID [2022-04-15 06:32:28,572 INFO L290 TraceCheckUtils]: 1: Hoare triple {73964#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(11, 2);call #Ultimate.allocInit(12, 3);~last~0 := 0; {73964#true} is VALID [2022-04-15 06:32:28,572 INFO L272 TraceCheckUtils]: 0: Hoare triple {73964#true} call ULTIMATE.init(); {73964#true} is VALID [2022-04-15 06:32:28,572 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-04-15 06:32:28,572 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [829685693] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 06:32:28,572 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 06:32:28,572 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9, 9] total 19 [2022-04-15 06:32:31,142 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 06:32:31,143 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [151521013] [2022-04-15 06:32:31,143 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [151521013] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 06:32:31,143 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 06:32:31,143 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [68] imperfect sequences [] total 68 [2022-04-15 06:32:31,143 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [575817644] [2022-04-15 06:32:31,143 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 06:32:31,143 INFO L78 Accepts]: Start accepts. Automaton has has 68 states, 68 states have (on average 1.4264705882352942) internal successors, (97), 66 states have internal predecessors, (97), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 101 [2022-04-15 06:32:31,143 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 06:32:31,143 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 68 states, 68 states have (on average 1.4264705882352942) internal successors, (97), 66 states have internal predecessors, (97), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:32:31,195 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 101 edges. 101 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 06:32:31,196 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 68 states [2022-04-15 06:32:31,196 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 06:32:31,196 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 68 interpolants. [2022-04-15 06:32:31,196 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=516, Invalid=5490, Unknown=0, NotChecked=0, Total=6006 [2022-04-15 06:32:31,197 INFO L87 Difference]: Start difference. First operand 499 states and 560 transitions. Second operand has 68 states, 68 states have (on average 1.4264705882352942) internal successors, (97), 66 states have internal predecessors, (97), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:32:43,035 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:32:43,035 INFO L93 Difference]: Finished difference Result 648 states and 732 transitions. [2022-04-15 06:32:43,035 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 98 states. [2022-04-15 06:32:43,035 INFO L78 Accepts]: Start accepts. Automaton has has 68 states, 68 states have (on average 1.4264705882352942) internal successors, (97), 66 states have internal predecessors, (97), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 101 [2022-04-15 06:32:43,035 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 06:32:43,035 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 68 states, 68 states have (on average 1.4264705882352942) internal successors, (97), 66 states have internal predecessors, (97), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:32:43,037 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 215 transitions. [2022-04-15 06:32:43,037 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 68 states, 68 states have (on average 1.4264705882352942) internal successors, (97), 66 states have internal predecessors, (97), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:32:43,038 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 215 transitions. [2022-04-15 06:32:43,038 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 98 states and 215 transitions. [2022-04-15 06:32:43,144 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-15 06:32:43,155 INFO L225 Difference]: With dead ends: 648 [2022-04-15 06:32:43,155 INFO L226 Difference]: Without dead ends: 550 [2022-04-15 06:32:43,156 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 165 GetRequests, 55 SyntacticMatches, 2 SemanticMatches, 108 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3396 ImplicationChecksByTransitivity, 3.5s TimeCoverageRelationStatistics Valid=823, Invalid=11167, Unknown=0, NotChecked=0, Total=11990 [2022-04-15 06:32:43,156 INFO L913 BasicCegarLoop]: 17 mSDtfsCounter, 145 mSDsluCounter, 175 mSDsCounter, 0 mSdLazyCounter, 7717 mSolverCounterSat, 130 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 147 SdHoareTripleChecker+Valid, 192 SdHoareTripleChecker+Invalid, 7847 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 130 IncrementalHoareTripleChecker+Valid, 7717 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.5s IncrementalHoareTripleChecker+Time [2022-04-15 06:32:43,157 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [147 Valid, 192 Invalid, 7847 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [130 Valid, 7717 Invalid, 0 Unknown, 0 Unchecked, 4.5s Time] [2022-04-15 06:32:43,157 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 550 states. [2022-04-15 06:32:44,848 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 550 to 502. [2022-04-15 06:32:44,848 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 06:32:44,848 INFO L82 GeneralOperation]: Start isEquivalent. First operand 550 states. Second operand has 502 states, 494 states have (on average 1.1275303643724697) internal successors, (557), 495 states have internal predecessors, (557), 4 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-15 06:32:44,849 INFO L74 IsIncluded]: Start isIncluded. First operand 550 states. Second operand has 502 states, 494 states have (on average 1.1275303643724697) internal successors, (557), 495 states have internal predecessors, (557), 4 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-15 06:32:44,849 INFO L87 Difference]: Start difference. First operand 550 states. Second operand has 502 states, 494 states have (on average 1.1275303643724697) internal successors, (557), 495 states have internal predecessors, (557), 4 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-15 06:32:44,857 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:32:44,858 INFO L93 Difference]: Finished difference Result 550 states and 614 transitions. [2022-04-15 06:32:44,858 INFO L276 IsEmpty]: Start isEmpty. Operand 550 states and 614 transitions. [2022-04-15 06:32:44,858 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 06:32:44,858 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 06:32:44,858 INFO L74 IsIncluded]: Start isIncluded. First operand has 502 states, 494 states have (on average 1.1275303643724697) internal successors, (557), 495 states have internal predecessors, (557), 4 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) Second operand 550 states. [2022-04-15 06:32:44,859 INFO L87 Difference]: Start difference. First operand has 502 states, 494 states have (on average 1.1275303643724697) internal successors, (557), 495 states have internal predecessors, (557), 4 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) Second operand 550 states. [2022-04-15 06:32:44,868 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:32:44,868 INFO L93 Difference]: Finished difference Result 550 states and 614 transitions. [2022-04-15 06:32:44,868 INFO L276 IsEmpty]: Start isEmpty. Operand 550 states and 614 transitions. [2022-04-15 06:32:44,869 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 06:32:44,869 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 06:32:44,869 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 06:32:44,869 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 06:32:44,870 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 502 states, 494 states have (on average 1.1275303643724697) internal successors, (557), 495 states have internal predecessors, (557), 4 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-15 06:32:44,881 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 502 states to 502 states and 564 transitions. [2022-04-15 06:32:44,881 INFO L78 Accepts]: Start accepts. Automaton has 502 states and 564 transitions. Word has length 101 [2022-04-15 06:32:44,881 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 06:32:44,881 INFO L478 AbstractCegarLoop]: Abstraction has 502 states and 564 transitions. [2022-04-15 06:32:44,881 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 68 states, 68 states have (on average 1.4264705882352942) internal successors, (97), 66 states have internal predecessors, (97), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:32:44,882 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 502 states and 564 transitions. [2022-04-15 06:32:46,385 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 564 edges. 564 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 06:32:46,385 INFO L276 IsEmpty]: Start isEmpty. Operand 502 states and 564 transitions. [2022-04-15 06:32:46,386 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2022-04-15 06:32:46,386 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 06:32:46,386 INFO L499 BasicCegarLoop]: trace histogram [30, 30, 29, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 06:32:46,403 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-15 06:32:46,603 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 42 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable45 [2022-04-15 06:32:46,603 INFO L403 AbstractCegarLoop]: === Iteration 47 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 06:32:46,603 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 06:32:46,603 INFO L85 PathProgramCache]: Analyzing trace with hash 1606015559, now seen corresponding path program 29 times [2022-04-15 06:32:46,603 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 06:32:46,603 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1013412612] [2022-04-15 06:32:47,615 WARN L970 rdanLoopAcceleration]: Unable to prove correctness of quantifier elimination. [2022-04-15 06:32:47,758 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 1 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-15 06:32:47,957 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {0={1=1}, 1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-15 06:32:47,958 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-15 06:32:47,960 INFO L85 PathProgramCache]: Analyzing trace with hash -772091448, now seen corresponding path program 1 times [2022-04-15 06:32:47,960 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 06:32:47,960 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2048031382] [2022-04-15 06:32:47,960 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 06:32:47,961 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 06:32:47,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:32:48,080 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 06:32:48,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:32:48,089 INFO L290 TraceCheckUtils]: 0: Hoare triple {77622#(and (= ~last~0 |old(~last~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(11, 2);call #Ultimate.allocInit(12, 3);~last~0 := 0; {77610#true} is VALID [2022-04-15 06:32:48,089 INFO L290 TraceCheckUtils]: 1: Hoare triple {77610#true} assume true; {77610#true} is VALID [2022-04-15 06:32:48,089 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {77610#true} {77610#true} #66#return; {77610#true} is VALID [2022-04-15 06:32:48,089 INFO L272 TraceCheckUtils]: 0: Hoare triple {77610#true} call ULTIMATE.init(); {77622#(and (= ~last~0 |old(~last~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 06:32:48,089 INFO L290 TraceCheckUtils]: 1: Hoare triple {77622#(and (= ~last~0 |old(~last~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(11, 2);call #Ultimate.allocInit(12, 3);~last~0 := 0; {77610#true} is VALID [2022-04-15 06:32:48,089 INFO L290 TraceCheckUtils]: 2: Hoare triple {77610#true} assume true; {77610#true} is VALID [2022-04-15 06:32:48,089 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {77610#true} {77610#true} #66#return; {77610#true} is VALID [2022-04-15 06:32:48,089 INFO L272 TraceCheckUtils]: 4: Hoare triple {77610#true} call #t~ret6 := main(); {77610#true} is VALID [2022-04-15 06:32:48,090 INFO L290 TraceCheckUtils]: 5: Hoare triple {77610#true} assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~last~0 := #t~nondet4;havoc #t~nondet4;~a~0 := 0;~b~0 := 0;~c~0 := 0;~st~0 := 0; {77615#(and (= main_~a~0 0) (= main_~b~0 0))} is VALID [2022-04-15 06:32:48,090 INFO L290 TraceCheckUtils]: 6: Hoare triple {77615#(and (= main_~a~0 0) (= main_~b~0 0))} assume !false;~st~0 := 1;~c~0 := 0; {77616#(and (= main_~a~0 0) (= main_~st~0 1) (= main_~b~0 0))} is VALID [2022-04-15 06:32:48,091 INFO L290 TraceCheckUtils]: 7: Hoare triple {77616#(and (= main_~a~0 0) (= main_~st~0 1) (= main_~b~0 0))} [218] L23-3-->L23-4_primed: Formula: (let ((.cse0 (= |v_main_#t~post5_623| |v_main_#t~post5_621|)) (.cse1 (= v_main_~c~0_1422 v_main_~c~0_1421)) (.cse2 (= v_~last~0_309 v_main_~c~0_1422))) (or (and .cse0 (= v_~last~0_309 v_~last~0_309) .cse1) (and .cse0 (or (not (< v_main_~c~0_1422 200000)) .cse2) .cse1) (and (< v_main_~c~0_1421 200001) (not .cse2) (< v_main_~c~0_1422 v_main_~c~0_1421) (or (not (<= (+ v_main_~c~0_1422 1) v_~last~0_309)) (not (<= (+ v_~last~0_309 1) v_main_~c~0_1421)))))) InVars {main_~c~0=v_main_~c~0_1422, main_#t~post5=|v_main_#t~post5_623|, ~last~0=v_~last~0_309} OutVars{main_#t~post5=|v_main_#t~post5_621|, main_~c~0=v_main_~c~0_1421, ~last~0=v_~last~0_309} AuxVars[] AssignedVars[main_#t~post5, main_~c~0] {77616#(and (= main_~a~0 0) (= main_~st~0 1) (= main_~b~0 0))} is VALID [2022-04-15 06:32:48,091 INFO L290 TraceCheckUtils]: 8: Hoare triple {77616#(and (= main_~a~0 0) (= main_~st~0 1) (= main_~b~0 0))} [219] L23-4_primed-->L23-3: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {77616#(and (= main_~a~0 0) (= main_~st~0 1) (= main_~b~0 0))} is VALID [2022-04-15 06:32:48,092 INFO L290 TraceCheckUtils]: 9: Hoare triple {77616#(and (= main_~a~0 0) (= main_~st~0 1) (= main_~b~0 0))} [220] L23-3-->L23-4_primed: Formula: (let ((.cse0 (= v_main_~st~0_410 v_main_~st~0_409)) (.cse1 (= |v_main_#t~post5_626| |v_main_#t~post5_622|)) (.cse2 (< v_main_~c~0_1424 200000)) (.cse3 (= v_~last~0_310 v_main_~c~0_1424))) (or (and .cse0 (= v_~last~0_310 v_~last~0_310) .cse1 (= v_main_~c~0_1424 v_main_~c~0_1423)) (and .cse0 .cse1 (or (not .cse2) (not .cse3)) (= v_main_~c~0_1423 v_main_~c~0_1424)) (and (< v_main_~c~0_1424 v_main_~c~0_1423) .cse2 (= v_main_~st~0_409 0) (< v_main_~c~0_1423 (+ 2 v_main_~c~0_1424)) .cse3))) InVars {main_~c~0=v_main_~c~0_1424, main_#t~post5=|v_main_#t~post5_626|, main_~st~0=v_main_~st~0_410, ~last~0=v_~last~0_310} OutVars{main_#t~post5=|v_main_#t~post5_622|, main_~c~0=v_main_~c~0_1423, main_~st~0=v_main_~st~0_409, ~last~0=v_~last~0_310} AuxVars[] AssignedVars[main_#t~post5, main_~c~0, main_~st~0] {77617#(or (and (= main_~a~0 0) (= main_~b~0 0) (<= main_~c~0 200000)) (= main_~st~0 1))} is VALID [2022-04-15 06:32:48,092 INFO L290 TraceCheckUtils]: 10: Hoare triple {77617#(or (and (= main_~a~0 0) (= main_~b~0 0) (<= main_~c~0 200000)) (= main_~st~0 1))} [217] L23-4_primed-->L23-4: Formula: (not (< v_main_~c~0_8 200000)) InVars {main_~c~0=v_main_~c~0_8} OutVars{main_~c~0=v_main_~c~0_8} AuxVars[] AssignedVars[] {77618#(or (and (= main_~a~0 0) (= main_~b~0 0) (< 199999 main_~c~0) (<= main_~c~0 200000)) (= main_~st~0 1))} is VALID [2022-04-15 06:32:48,093 INFO L290 TraceCheckUtils]: 11: Hoare triple {77618#(or (and (= main_~a~0 0) (= main_~b~0 0) (< 199999 main_~c~0) (<= main_~c~0 200000)) (= main_~st~0 1))} assume 0 == ~st~0 && ~c~0 == 1 + ~last~0;~a~0 := 3 + ~a~0;~b~0 := 3 + ~b~0; {77619#(and (<= main_~b~0 main_~a~0) (< main_~a~0 (+ main_~b~0 1)) (< 199999 main_~c~0) (<= main_~c~0 200000))} is VALID [2022-04-15 06:32:48,093 INFO L290 TraceCheckUtils]: 12: Hoare triple {77619#(and (<= main_~b~0 main_~a~0) (< main_~a~0 (+ main_~b~0 1)) (< 199999 main_~c~0) (<= main_~c~0 200000))} assume !(~c~0 == ~last~0 && 0 == ~st~0); {77619#(and (<= main_~b~0 main_~a~0) (< main_~a~0 (+ main_~b~0 1)) (< 199999 main_~c~0) (<= main_~c~0 200000))} is VALID [2022-04-15 06:32:48,094 INFO L272 TraceCheckUtils]: 13: Hoare triple {77619#(and (<= main_~b~0 main_~a~0) (< main_~a~0 (+ main_~b~0 1)) (< 199999 main_~c~0) (<= main_~c~0 200000))} call __VERIFIER_assert((if ~a~0 == ~b~0 && 200000 == ~c~0 then 1 else 0)); {77620#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-15 06:32:48,094 INFO L290 TraceCheckUtils]: 14: Hoare triple {77620#(not (= |__VERIFIER_assert_#in~cond| 0))} ~cond := #in~cond; {77621#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-15 06:32:48,094 INFO L290 TraceCheckUtils]: 15: Hoare triple {77621#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {77611#false} is VALID [2022-04-15 06:32:48,094 INFO L290 TraceCheckUtils]: 16: Hoare triple {77611#false} assume !false; {77611#false} is VALID [2022-04-15 06:32:48,094 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-04-15 06:32:48,094 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 06:32:48,095 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2048031382] [2022-04-15 06:32:48,095 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2048031382] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 06:32:48,095 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [124908199] [2022-04-15 06:32:48,095 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 06:32:48,095 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 06:32:48,095 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 06:32:48,096 INFO L229 MonitoredProcess]: Starting monitored process 43 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-15 06:32:48,096 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (43)] Waiting until timeout for monitored process [2022-04-15 06:32:48,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:32:48,134 INFO L263 TraceCheckSpWp]: Trace formula consists of 85 conjuncts, 18 conjunts are in the unsatisfiable core [2022-04-15 06:32:48,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:32:48,140 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 06:32:48,399 INFO L272 TraceCheckUtils]: 0: Hoare triple {77610#true} call ULTIMATE.init(); {77610#true} is VALID [2022-04-15 06:32:48,399 INFO L290 TraceCheckUtils]: 1: Hoare triple {77610#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(11, 2);call #Ultimate.allocInit(12, 3);~last~0 := 0; {77610#true} is VALID [2022-04-15 06:32:48,399 INFO L290 TraceCheckUtils]: 2: Hoare triple {77610#true} assume true; {77610#true} is VALID [2022-04-15 06:32:48,399 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {77610#true} {77610#true} #66#return; {77610#true} is VALID [2022-04-15 06:32:48,399 INFO L272 TraceCheckUtils]: 4: Hoare triple {77610#true} call #t~ret6 := main(); {77610#true} is VALID [2022-04-15 06:32:48,400 INFO L290 TraceCheckUtils]: 5: Hoare triple {77610#true} assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~last~0 := #t~nondet4;havoc #t~nondet4;~a~0 := 0;~b~0 := 0;~c~0 := 0;~st~0 := 0; {77615#(and (= main_~a~0 0) (= main_~b~0 0))} is VALID [2022-04-15 06:32:48,400 INFO L290 TraceCheckUtils]: 6: Hoare triple {77615#(and (= main_~a~0 0) (= main_~b~0 0))} assume !false;~st~0 := 1;~c~0 := 0; {77616#(and (= main_~a~0 0) (= main_~st~0 1) (= main_~b~0 0))} is VALID [2022-04-15 06:32:48,401 INFO L290 TraceCheckUtils]: 7: Hoare triple {77616#(and (= main_~a~0 0) (= main_~st~0 1) (= main_~b~0 0))} [218] L23-3-->L23-4_primed: Formula: (let ((.cse0 (= |v_main_#t~post5_623| |v_main_#t~post5_621|)) (.cse1 (= v_main_~c~0_1422 v_main_~c~0_1421)) (.cse2 (= v_~last~0_309 v_main_~c~0_1422))) (or (and .cse0 (= v_~last~0_309 v_~last~0_309) .cse1) (and .cse0 (or (not (< v_main_~c~0_1422 200000)) .cse2) .cse1) (and (< v_main_~c~0_1421 200001) (not .cse2) (< v_main_~c~0_1422 v_main_~c~0_1421) (or (not (<= (+ v_main_~c~0_1422 1) v_~last~0_309)) (not (<= (+ v_~last~0_309 1) v_main_~c~0_1421)))))) InVars {main_~c~0=v_main_~c~0_1422, main_#t~post5=|v_main_#t~post5_623|, ~last~0=v_~last~0_309} OutVars{main_#t~post5=|v_main_#t~post5_621|, main_~c~0=v_main_~c~0_1421, ~last~0=v_~last~0_309} AuxVars[] AssignedVars[main_#t~post5, main_~c~0] {77616#(and (= main_~a~0 0) (= main_~st~0 1) (= main_~b~0 0))} is VALID [2022-04-15 06:32:48,401 INFO L290 TraceCheckUtils]: 8: Hoare triple {77616#(and (= main_~a~0 0) (= main_~st~0 1) (= main_~b~0 0))} [219] L23-4_primed-->L23-3: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {77616#(and (= main_~a~0 0) (= main_~st~0 1) (= main_~b~0 0))} is VALID [2022-04-15 06:32:48,402 INFO L290 TraceCheckUtils]: 9: Hoare triple {77616#(and (= main_~a~0 0) (= main_~st~0 1) (= main_~b~0 0))} [220] L23-3-->L23-4_primed: Formula: (let ((.cse0 (= v_main_~st~0_410 v_main_~st~0_409)) (.cse1 (= |v_main_#t~post5_626| |v_main_#t~post5_622|)) (.cse2 (< v_main_~c~0_1424 200000)) (.cse3 (= v_~last~0_310 v_main_~c~0_1424))) (or (and .cse0 (= v_~last~0_310 v_~last~0_310) .cse1 (= v_main_~c~0_1424 v_main_~c~0_1423)) (and .cse0 .cse1 (or (not .cse2) (not .cse3)) (= v_main_~c~0_1423 v_main_~c~0_1424)) (and (< v_main_~c~0_1424 v_main_~c~0_1423) .cse2 (= v_main_~st~0_409 0) (< v_main_~c~0_1423 (+ 2 v_main_~c~0_1424)) .cse3))) InVars {main_~c~0=v_main_~c~0_1424, main_#t~post5=|v_main_#t~post5_626|, main_~st~0=v_main_~st~0_410, ~last~0=v_~last~0_310} OutVars{main_#t~post5=|v_main_#t~post5_622|, main_~c~0=v_main_~c~0_1423, main_~st~0=v_main_~st~0_409, ~last~0=v_~last~0_310} AuxVars[] AssignedVars[main_#t~post5, main_~c~0, main_~st~0] {77653#(and (= main_~a~0 0) (= main_~b~0 0) (or (= main_~st~0 1) (and (< ~last~0 200000) (< ~last~0 main_~c~0) (< main_~c~0 (+ ~last~0 2)) (= main_~st~0 0))))} is VALID [2022-04-15 06:32:48,402 INFO L290 TraceCheckUtils]: 10: Hoare triple {77653#(and (= main_~a~0 0) (= main_~b~0 0) (or (= main_~st~0 1) (and (< ~last~0 200000) (< ~last~0 main_~c~0) (< main_~c~0 (+ ~last~0 2)) (= main_~st~0 0))))} [217] L23-4_primed-->L23-4: Formula: (not (< v_main_~c~0_8 200000)) InVars {main_~c~0=v_main_~c~0_8} OutVars{main_~c~0=v_main_~c~0_8} AuxVars[] AssignedVars[] {77657#(and (= main_~a~0 0) (or (and (< ~last~0 200000) (< main_~c~0 (+ ~last~0 2)) (= main_~st~0 0)) (= main_~st~0 1)) (= main_~b~0 0) (not (< main_~c~0 200000)))} is VALID [2022-04-15 06:32:48,403 INFO L290 TraceCheckUtils]: 11: Hoare triple {77657#(and (= main_~a~0 0) (or (and (< ~last~0 200000) (< main_~c~0 (+ ~last~0 2)) (= main_~st~0 0)) (= main_~st~0 1)) (= main_~b~0 0) (not (< main_~c~0 200000)))} assume 0 == ~st~0 && ~c~0 == 1 + ~last~0;~a~0 := 3 + ~a~0;~b~0 := 3 + ~b~0; {77661#(and (= main_~b~0 3) (<= 200000 main_~c~0) (< main_~c~0 200001) (= main_~a~0 3))} is VALID [2022-04-15 06:32:48,403 INFO L290 TraceCheckUtils]: 12: Hoare triple {77661#(and (= main_~b~0 3) (<= 200000 main_~c~0) (< main_~c~0 200001) (= main_~a~0 3))} assume !(~c~0 == ~last~0 && 0 == ~st~0); {77661#(and (= main_~b~0 3) (<= 200000 main_~c~0) (< main_~c~0 200001) (= main_~a~0 3))} is VALID [2022-04-15 06:32:48,404 INFO L272 TraceCheckUtils]: 13: Hoare triple {77661#(and (= main_~b~0 3) (<= 200000 main_~c~0) (< main_~c~0 200001) (= main_~a~0 3))} call __VERIFIER_assert((if ~a~0 == ~b~0 && 200000 == ~c~0 then 1 else 0)); {77668#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-15 06:32:48,404 INFO L290 TraceCheckUtils]: 14: Hoare triple {77668#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {77672#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-15 06:32:48,405 INFO L290 TraceCheckUtils]: 15: Hoare triple {77672#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {77611#false} is VALID [2022-04-15 06:32:48,405 INFO L290 TraceCheckUtils]: 16: Hoare triple {77611#false} assume !false; {77611#false} is VALID [2022-04-15 06:32:48,405 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-04-15 06:32:48,405 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 06:32:48,817 INFO L290 TraceCheckUtils]: 16: Hoare triple {77611#false} assume !false; {77611#false} is VALID [2022-04-15 06:32:48,818 INFO L290 TraceCheckUtils]: 15: Hoare triple {77672#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {77611#false} is VALID [2022-04-15 06:32:48,818 INFO L290 TraceCheckUtils]: 14: Hoare triple {77668#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {77672#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-15 06:32:48,819 INFO L272 TraceCheckUtils]: 13: Hoare triple {77619#(and (<= main_~b~0 main_~a~0) (< main_~a~0 (+ main_~b~0 1)) (< 199999 main_~c~0) (<= main_~c~0 200000))} call __VERIFIER_assert((if ~a~0 == ~b~0 && 200000 == ~c~0 then 1 else 0)); {77668#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-15 06:32:48,819 INFO L290 TraceCheckUtils]: 12: Hoare triple {77619#(and (<= main_~b~0 main_~a~0) (< main_~a~0 (+ main_~b~0 1)) (< 199999 main_~c~0) (<= main_~c~0 200000))} assume !(~c~0 == ~last~0 && 0 == ~st~0); {77619#(and (<= main_~b~0 main_~a~0) (< main_~a~0 (+ main_~b~0 1)) (< 199999 main_~c~0) (<= main_~c~0 200000))} is VALID [2022-04-15 06:32:48,820 INFO L290 TraceCheckUtils]: 11: Hoare triple {77694#(or (not (<= main_~c~0 (+ ~last~0 1))) (and (<= main_~b~0 main_~a~0) (< main_~a~0 (+ main_~b~0 1)) (< 199999 main_~c~0) (<= main_~c~0 200000)) (not (= main_~st~0 0)))} assume 0 == ~st~0 && ~c~0 == 1 + ~last~0;~a~0 := 3 + ~a~0;~b~0 := 3 + ~b~0; {77619#(and (<= main_~b~0 main_~a~0) (< main_~a~0 (+ main_~b~0 1)) (< 199999 main_~c~0) (<= main_~c~0 200000))} is VALID [2022-04-15 06:32:48,821 INFO L290 TraceCheckUtils]: 10: Hoare triple {77698#(or (not (<= main_~c~0 (+ ~last~0 1))) (and (<= main_~b~0 main_~a~0) (< main_~a~0 (+ main_~b~0 1)) (<= main_~c~0 200000)) (not (= main_~st~0 0)) (< main_~c~0 200000))} [217] L23-4_primed-->L23-4: Formula: (not (< v_main_~c~0_8 200000)) InVars {main_~c~0=v_main_~c~0_8} OutVars{main_~c~0=v_main_~c~0_8} AuxVars[] AssignedVars[] {77694#(or (not (<= main_~c~0 (+ ~last~0 1))) (and (<= main_~b~0 main_~a~0) (< main_~a~0 (+ main_~b~0 1)) (< 199999 main_~c~0) (<= main_~c~0 200000)) (not (= main_~st~0 0)))} is VALID [2022-04-15 06:32:48,821 INFO L290 TraceCheckUtils]: 9: Hoare triple {77702#(and (<= main_~b~0 main_~a~0) (< main_~a~0 (+ main_~b~0 1)) (not (= main_~st~0 0)))} [220] L23-3-->L23-4_primed: Formula: (let ((.cse0 (= v_main_~st~0_410 v_main_~st~0_409)) (.cse1 (= |v_main_#t~post5_626| |v_main_#t~post5_622|)) (.cse2 (< v_main_~c~0_1424 200000)) (.cse3 (= v_~last~0_310 v_main_~c~0_1424))) (or (and .cse0 (= v_~last~0_310 v_~last~0_310) .cse1 (= v_main_~c~0_1424 v_main_~c~0_1423)) (and .cse0 .cse1 (or (not .cse2) (not .cse3)) (= v_main_~c~0_1423 v_main_~c~0_1424)) (and (< v_main_~c~0_1424 v_main_~c~0_1423) .cse2 (= v_main_~st~0_409 0) (< v_main_~c~0_1423 (+ 2 v_main_~c~0_1424)) .cse3))) InVars {main_~c~0=v_main_~c~0_1424, main_#t~post5=|v_main_#t~post5_626|, main_~st~0=v_main_~st~0_410, ~last~0=v_~last~0_310} OutVars{main_#t~post5=|v_main_#t~post5_622|, main_~c~0=v_main_~c~0_1423, main_~st~0=v_main_~st~0_409, ~last~0=v_~last~0_310} AuxVars[] AssignedVars[main_#t~post5, main_~c~0, main_~st~0] {77698#(or (not (<= main_~c~0 (+ ~last~0 1))) (and (<= main_~b~0 main_~a~0) (< main_~a~0 (+ main_~b~0 1)) (<= main_~c~0 200000)) (not (= main_~st~0 0)) (< main_~c~0 200000))} is VALID [2022-04-15 06:32:48,822 INFO L290 TraceCheckUtils]: 8: Hoare triple {77702#(and (<= main_~b~0 main_~a~0) (< main_~a~0 (+ main_~b~0 1)) (not (= main_~st~0 0)))} [219] L23-4_primed-->L23-3: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {77702#(and (<= main_~b~0 main_~a~0) (< main_~a~0 (+ main_~b~0 1)) (not (= main_~st~0 0)))} is VALID [2022-04-15 06:32:48,822 INFO L290 TraceCheckUtils]: 7: Hoare triple {77702#(and (<= main_~b~0 main_~a~0) (< main_~a~0 (+ main_~b~0 1)) (not (= main_~st~0 0)))} [218] L23-3-->L23-4_primed: Formula: (let ((.cse0 (= |v_main_#t~post5_623| |v_main_#t~post5_621|)) (.cse1 (= v_main_~c~0_1422 v_main_~c~0_1421)) (.cse2 (= v_~last~0_309 v_main_~c~0_1422))) (or (and .cse0 (= v_~last~0_309 v_~last~0_309) .cse1) (and .cse0 (or (not (< v_main_~c~0_1422 200000)) .cse2) .cse1) (and (< v_main_~c~0_1421 200001) (not .cse2) (< v_main_~c~0_1422 v_main_~c~0_1421) (or (not (<= (+ v_main_~c~0_1422 1) v_~last~0_309)) (not (<= (+ v_~last~0_309 1) v_main_~c~0_1421)))))) InVars {main_~c~0=v_main_~c~0_1422, main_#t~post5=|v_main_#t~post5_623|, ~last~0=v_~last~0_309} OutVars{main_#t~post5=|v_main_#t~post5_621|, main_~c~0=v_main_~c~0_1421, ~last~0=v_~last~0_309} AuxVars[] AssignedVars[main_#t~post5, main_~c~0] {77702#(and (<= main_~b~0 main_~a~0) (< main_~a~0 (+ main_~b~0 1)) (not (= main_~st~0 0)))} is VALID [2022-04-15 06:32:48,823 INFO L290 TraceCheckUtils]: 6: Hoare triple {77712#(and (<= main_~b~0 main_~a~0) (< main_~a~0 (+ main_~b~0 1)))} assume !false;~st~0 := 1;~c~0 := 0; {77702#(and (<= main_~b~0 main_~a~0) (< main_~a~0 (+ main_~b~0 1)) (not (= main_~st~0 0)))} is VALID [2022-04-15 06:32:48,823 INFO L290 TraceCheckUtils]: 5: Hoare triple {77610#true} assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~last~0 := #t~nondet4;havoc #t~nondet4;~a~0 := 0;~b~0 := 0;~c~0 := 0;~st~0 := 0; {77712#(and (<= main_~b~0 main_~a~0) (< main_~a~0 (+ main_~b~0 1)))} is VALID [2022-04-15 06:32:48,823 INFO L272 TraceCheckUtils]: 4: Hoare triple {77610#true} call #t~ret6 := main(); {77610#true} is VALID [2022-04-15 06:32:48,823 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {77610#true} {77610#true} #66#return; {77610#true} is VALID [2022-04-15 06:32:48,823 INFO L290 TraceCheckUtils]: 2: Hoare triple {77610#true} assume true; {77610#true} is VALID [2022-04-15 06:32:48,823 INFO L290 TraceCheckUtils]: 1: Hoare triple {77610#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(11, 2);call #Ultimate.allocInit(12, 3);~last~0 := 0; {77610#true} is VALID [2022-04-15 06:32:48,823 INFO L272 TraceCheckUtils]: 0: Hoare triple {77610#true} call ULTIMATE.init(); {77610#true} is VALID [2022-04-15 06:32:48,823 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-04-15 06:32:48,824 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [124908199] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 06:32:48,824 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 06:32:48,824 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9, 9] total 19 [2022-04-15 06:32:50,937 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 06:32:50,937 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1013412612] [2022-04-15 06:32:50,937 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1013412612] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 06:32:50,937 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 06:32:50,937 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [70] imperfect sequences [] total 70 [2022-04-15 06:32:50,937 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1522053755] [2022-04-15 06:32:50,937 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 06:32:50,938 INFO L78 Accepts]: Start accepts. Automaton has has 70 states, 70 states have (on average 1.4285714285714286) internal successors, (100), 68 states have internal predecessors, (100), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 104 [2022-04-15 06:32:50,938 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 06:32:50,938 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 70 states, 70 states have (on average 1.4285714285714286) internal successors, (100), 68 states have internal predecessors, (100), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:32:51,000 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-15 06:32:51,000 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 70 states [2022-04-15 06:32:51,000 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 06:32:51,000 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 70 interpolants. [2022-04-15 06:32:51,001 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=531, Invalid=5789, Unknown=0, NotChecked=0, Total=6320 [2022-04-15 06:32:51,001 INFO L87 Difference]: Start difference. First operand 502 states and 564 transitions. Second operand has 70 states, 70 states have (on average 1.4285714285714286) internal successors, (100), 68 states have internal predecessors, (100), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:33:02,099 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:33:02,100 INFO L93 Difference]: Finished difference Result 652 states and 737 transitions. [2022-04-15 06:33:02,100 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 101 states. [2022-04-15 06:33:02,100 INFO L78 Accepts]: Start accepts. Automaton has has 70 states, 70 states have (on average 1.4285714285714286) internal successors, (100), 68 states have internal predecessors, (100), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 104 [2022-04-15 06:33:02,100 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 06:33:02,100 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 70 states, 70 states have (on average 1.4285714285714286) internal successors, (100), 68 states have internal predecessors, (100), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:33:02,101 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 220 transitions. [2022-04-15 06:33:02,102 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 70 states, 70 states have (on average 1.4285714285714286) internal successors, (100), 68 states have internal predecessors, (100), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:33:02,103 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 220 transitions. [2022-04-15 06:33:02,103 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 101 states and 220 transitions. [2022-04-15 06:33:02,283 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-15 06:33:02,295 INFO L225 Difference]: With dead ends: 652 [2022-04-15 06:33:02,295 INFO L226 Difference]: Without dead ends: 554 [2022-04-15 06:33:02,296 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 169 GetRequests, 56 SyntacticMatches, 2 SemanticMatches, 111 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3583 ImplicationChecksByTransitivity, 3.1s TimeCoverageRelationStatistics Valid=848, Invalid=11808, Unknown=0, NotChecked=0, Total=12656 [2022-04-15 06:33:02,296 INFO L913 BasicCegarLoop]: 17 mSDtfsCounter, 186 mSDsluCounter, 96 mSDsCounter, 0 mSdLazyCounter, 7620 mSolverCounterSat, 132 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 188 SdHoareTripleChecker+Valid, 113 SdHoareTripleChecker+Invalid, 7752 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 132 IncrementalHoareTripleChecker+Valid, 7620 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.0s IncrementalHoareTripleChecker+Time [2022-04-15 06:33:02,296 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [188 Valid, 113 Invalid, 7752 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [132 Valid, 7620 Invalid, 0 Unknown, 0 Unchecked, 4.0s Time] [2022-04-15 06:33:02,297 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 554 states. [2022-04-15 06:33:04,925 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 554 to 505. [2022-04-15 06:33:04,926 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 06:33:04,926 INFO L82 GeneralOperation]: Start isEquivalent. First operand 554 states. Second operand has 505 states, 497 states have (on average 1.1287726358148893) internal successors, (561), 498 states have internal predecessors, (561), 4 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-15 06:33:04,927 INFO L74 IsIncluded]: Start isIncluded. First operand 554 states. Second operand has 505 states, 497 states have (on average 1.1287726358148893) internal successors, (561), 498 states have internal predecessors, (561), 4 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-15 06:33:04,927 INFO L87 Difference]: Start difference. First operand 554 states. Second operand has 505 states, 497 states have (on average 1.1287726358148893) internal successors, (561), 498 states have internal predecessors, (561), 4 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-15 06:33:04,935 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:33:04,936 INFO L93 Difference]: Finished difference Result 554 states and 619 transitions. [2022-04-15 06:33:04,936 INFO L276 IsEmpty]: Start isEmpty. Operand 554 states and 619 transitions. [2022-04-15 06:33:04,936 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 06:33:04,936 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 06:33:04,936 INFO L74 IsIncluded]: Start isIncluded. First operand has 505 states, 497 states have (on average 1.1287726358148893) internal successors, (561), 498 states have internal predecessors, (561), 4 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) Second operand 554 states. [2022-04-15 06:33:04,937 INFO L87 Difference]: Start difference. First operand has 505 states, 497 states have (on average 1.1287726358148893) internal successors, (561), 498 states have internal predecessors, (561), 4 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) Second operand 554 states. [2022-04-15 06:33:04,946 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:33:04,946 INFO L93 Difference]: Finished difference Result 554 states and 619 transitions. [2022-04-15 06:33:04,946 INFO L276 IsEmpty]: Start isEmpty. Operand 554 states and 619 transitions. [2022-04-15 06:33:04,946 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 06:33:04,946 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 06:33:04,946 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 06:33:04,946 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 06:33:04,947 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 505 states, 497 states have (on average 1.1287726358148893) internal successors, (561), 498 states have internal predecessors, (561), 4 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-15 06:33:04,957 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 505 states to 505 states and 568 transitions. [2022-04-15 06:33:04,957 INFO L78 Accepts]: Start accepts. Automaton has 505 states and 568 transitions. Word has length 104 [2022-04-15 06:33:04,957 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 06:33:04,957 INFO L478 AbstractCegarLoop]: Abstraction has 505 states and 568 transitions. [2022-04-15 06:33:04,957 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 70 states, 70 states have (on average 1.4285714285714286) internal successors, (100), 68 states have internal predecessors, (100), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:33:04,958 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 505 states and 568 transitions. [2022-04-15 06:33:06,734 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 568 edges. 568 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 06:33:06,734 INFO L276 IsEmpty]: Start isEmpty. Operand 505 states and 568 transitions. [2022-04-15 06:33:06,735 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2022-04-15 06:33:06,735 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 06:33:06,735 INFO L499 BasicCegarLoop]: trace histogram [28, 28, 26, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 06:33:06,752 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (43)] Ended with exit code 0 [2022-04-15 06:33:06,949 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable46,43 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 06:33:06,949 INFO L403 AbstractCegarLoop]: === Iteration 48 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 06:33:06,949 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 06:33:06,949 INFO L85 PathProgramCache]: Analyzing trace with hash 2071662658, now seen corresponding path program 13 times [2022-04-15 06:33:06,949 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 06:33:06,949 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [968242979] [2022-04-15 06:33:07,089 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 4 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {0={1=3}, 1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-15 06:33:07,089 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-15 06:33:07,090 INFO L85 PathProgramCache]: Analyzing trace with hash 620755475, now seen corresponding path program 1 times [2022-04-15 06:33:07,090 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 06:33:07,090 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1418760565] [2022-04-15 06:33:07,090 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 06:33:07,090 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 06:33:07,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:33:07,239 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 06:33:07,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:33:07,242 INFO L290 TraceCheckUtils]: 0: Hoare triple {81302#(and (= ~last~0 |old(~last~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(11, 2);call #Ultimate.allocInit(12, 3);~last~0 := 0; {81282#true} is VALID [2022-04-15 06:33:07,242 INFO L290 TraceCheckUtils]: 1: Hoare triple {81282#true} assume true; {81282#true} is VALID [2022-04-15 06:33:07,242 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {81282#true} {81282#true} #66#return; {81282#true} is VALID [2022-04-15 06:33:07,243 INFO L272 TraceCheckUtils]: 0: Hoare triple {81282#true} call ULTIMATE.init(); {81302#(and (= ~last~0 |old(~last~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 06:33:07,243 INFO L290 TraceCheckUtils]: 1: Hoare triple {81302#(and (= ~last~0 |old(~last~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(11, 2);call #Ultimate.allocInit(12, 3);~last~0 := 0; {81282#true} is VALID [2022-04-15 06:33:07,243 INFO L290 TraceCheckUtils]: 2: Hoare triple {81282#true} assume true; {81282#true} is VALID [2022-04-15 06:33:07,243 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {81282#true} {81282#true} #66#return; {81282#true} is VALID [2022-04-15 06:33:07,243 INFO L272 TraceCheckUtils]: 4: Hoare triple {81282#true} call #t~ret6 := main(); {81282#true} is VALID [2022-04-15 06:33:07,243 INFO L290 TraceCheckUtils]: 5: Hoare triple {81282#true} assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~last~0 := #t~nondet4;havoc #t~nondet4;~a~0 := 0;~b~0 := 0;~c~0 := 0;~st~0 := 0; {81282#true} is VALID [2022-04-15 06:33:07,243 INFO L290 TraceCheckUtils]: 6: Hoare triple {81282#true} [222] L30-->L23-3_primed: Formula: (let ((.cse0 (= v_main_~b~0_215 v_main_~b~0_214)) (.cse1 (= |v_main_#t~post5_648| |v_main_#t~post5_634|)) (.cse2 (= v_main_~a~0_218 v_main_~a~0_217))) (or (and .cse0 (= v_main_~c~0_1470 v_main_~c~0_1485) (= v_main_~st~0_419 v_main_~st~0_421) .cse1 .cse2) (and (= v_main_~st~0_421 v_main_~st~0_419) (= v_main_~c~0_1485 v_main_~c~0_1470) .cse0 .cse1 .cse2))) InVars {main_~c~0=v_main_~c~0_1485, main_#t~post5=|v_main_#t~post5_648|, main_~st~0=v_main_~st~0_421, main_~b~0=v_main_~b~0_215, main_~a~0=v_main_~a~0_218} OutVars{main_~c~0=v_main_~c~0_1470, main_#t~post5=|v_main_#t~post5_634|, main_~st~0=v_main_~st~0_419, main_~b~0=v_main_~b~0_214, main_~a~0=v_main_~a~0_217} AuxVars[] AssignedVars[main_~c~0, main_#t~post5, main_~st~0, main_~b~0, main_~a~0] {81282#true} is VALID [2022-04-15 06:33:07,243 INFO L290 TraceCheckUtils]: 7: Hoare triple {81282#true} [221] L23-3_primed-->L23-3: Formula: (and (= v_main_~c~0_7 0) (= v_main_~st~0_6 1)) InVars {} OutVars{main_~c~0=v_main_~c~0_7, main_~st~0=v_main_~st~0_6} AuxVars[] AssignedVars[main_~c~0, main_~st~0] {81287#(= main_~c~0 0)} is VALID [2022-04-15 06:33:07,244 INFO L290 TraceCheckUtils]: 8: Hoare triple {81287#(= main_~c~0 0)} assume !!(~c~0 < 200000); {81287#(= main_~c~0 0)} is VALID [2022-04-15 06:33:07,244 INFO L290 TraceCheckUtils]: 9: Hoare triple {81287#(= main_~c~0 0)} assume ~c~0 == ~last~0;~st~0 := 0; {81287#(= main_~c~0 0)} is VALID [2022-04-15 06:33:07,244 INFO L290 TraceCheckUtils]: 10: Hoare triple {81287#(= main_~c~0 0)} #t~post5 := ~c~0;~c~0 := 1 + #t~post5;havoc #t~post5; {81288#(<= main_~c~0 1)} is VALID [2022-04-15 06:33:07,245 INFO L290 TraceCheckUtils]: 11: Hoare triple {81288#(<= main_~c~0 1)} assume !!(~c~0 < 200000); {81288#(<= main_~c~0 1)} is VALID [2022-04-15 06:33:07,245 INFO L290 TraceCheckUtils]: 12: Hoare triple {81288#(<= main_~c~0 1)} assume !(~c~0 == ~last~0); {81288#(<= main_~c~0 1)} is VALID [2022-04-15 06:33:07,245 INFO L290 TraceCheckUtils]: 13: Hoare triple {81288#(<= main_~c~0 1)} #t~post5 := ~c~0;~c~0 := 1 + #t~post5;havoc #t~post5; {81289#(<= main_~c~0 2)} is VALID [2022-04-15 06:33:07,246 INFO L290 TraceCheckUtils]: 14: Hoare triple {81289#(<= main_~c~0 2)} assume !!(~c~0 < 200000); {81289#(<= main_~c~0 2)} is VALID [2022-04-15 06:33:07,246 INFO L290 TraceCheckUtils]: 15: Hoare triple {81289#(<= main_~c~0 2)} assume !(~c~0 == ~last~0); {81289#(<= main_~c~0 2)} is VALID [2022-04-15 06:33:07,246 INFO L290 TraceCheckUtils]: 16: Hoare triple {81289#(<= main_~c~0 2)} #t~post5 := ~c~0;~c~0 := 1 + #t~post5;havoc #t~post5; {81290#(<= main_~c~0 3)} is VALID [2022-04-15 06:33:07,246 INFO L290 TraceCheckUtils]: 17: Hoare triple {81290#(<= main_~c~0 3)} assume !!(~c~0 < 200000); {81290#(<= main_~c~0 3)} is VALID [2022-04-15 06:33:07,247 INFO L290 TraceCheckUtils]: 18: Hoare triple {81290#(<= main_~c~0 3)} assume !(~c~0 == ~last~0); {81290#(<= main_~c~0 3)} is VALID [2022-04-15 06:33:07,247 INFO L290 TraceCheckUtils]: 19: Hoare triple {81290#(<= main_~c~0 3)} #t~post5 := ~c~0;~c~0 := 1 + #t~post5;havoc #t~post5; {81291#(<= main_~c~0 4)} is VALID [2022-04-15 06:33:07,247 INFO L290 TraceCheckUtils]: 20: Hoare triple {81291#(<= main_~c~0 4)} assume !!(~c~0 < 200000); {81291#(<= main_~c~0 4)} is VALID [2022-04-15 06:33:07,248 INFO L290 TraceCheckUtils]: 21: Hoare triple {81291#(<= main_~c~0 4)} assume !(~c~0 == ~last~0); {81291#(<= main_~c~0 4)} is VALID [2022-04-15 06:33:07,248 INFO L290 TraceCheckUtils]: 22: Hoare triple {81291#(<= main_~c~0 4)} #t~post5 := ~c~0;~c~0 := 1 + #t~post5;havoc #t~post5; {81292#(<= main_~c~0 5)} is VALID [2022-04-15 06:33:07,248 INFO L290 TraceCheckUtils]: 23: Hoare triple {81292#(<= main_~c~0 5)} assume !!(~c~0 < 200000); {81292#(<= main_~c~0 5)} is VALID [2022-04-15 06:33:07,248 INFO L290 TraceCheckUtils]: 24: Hoare triple {81292#(<= main_~c~0 5)} assume !(~c~0 == ~last~0); {81292#(<= main_~c~0 5)} is VALID [2022-04-15 06:33:07,249 INFO L290 TraceCheckUtils]: 25: Hoare triple {81292#(<= main_~c~0 5)} #t~post5 := ~c~0;~c~0 := 1 + #t~post5;havoc #t~post5; {81293#(<= main_~c~0 6)} is VALID [2022-04-15 06:33:07,249 INFO L290 TraceCheckUtils]: 26: Hoare triple {81293#(<= main_~c~0 6)} assume !!(~c~0 < 200000); {81293#(<= main_~c~0 6)} is VALID [2022-04-15 06:33:07,249 INFO L290 TraceCheckUtils]: 27: Hoare triple {81293#(<= main_~c~0 6)} assume !(~c~0 == ~last~0); {81293#(<= main_~c~0 6)} is VALID [2022-04-15 06:33:07,250 INFO L290 TraceCheckUtils]: 28: Hoare triple {81293#(<= main_~c~0 6)} #t~post5 := ~c~0;~c~0 := 1 + #t~post5;havoc #t~post5; {81294#(<= main_~c~0 7)} is VALID [2022-04-15 06:33:07,250 INFO L290 TraceCheckUtils]: 29: Hoare triple {81294#(<= main_~c~0 7)} assume !!(~c~0 < 200000); {81294#(<= main_~c~0 7)} is VALID [2022-04-15 06:33:07,250 INFO L290 TraceCheckUtils]: 30: Hoare triple {81294#(<= main_~c~0 7)} assume !(~c~0 == ~last~0); {81294#(<= main_~c~0 7)} is VALID [2022-04-15 06:33:07,251 INFO L290 TraceCheckUtils]: 31: Hoare triple {81294#(<= main_~c~0 7)} #t~post5 := ~c~0;~c~0 := 1 + #t~post5;havoc #t~post5; {81295#(<= main_~c~0 8)} is VALID [2022-04-15 06:33:07,251 INFO L290 TraceCheckUtils]: 32: Hoare triple {81295#(<= main_~c~0 8)} assume !!(~c~0 < 200000); {81295#(<= main_~c~0 8)} is VALID [2022-04-15 06:33:07,251 INFO L290 TraceCheckUtils]: 33: Hoare triple {81295#(<= main_~c~0 8)} assume !(~c~0 == ~last~0); {81295#(<= main_~c~0 8)} is VALID [2022-04-15 06:33:07,252 INFO L290 TraceCheckUtils]: 34: Hoare triple {81295#(<= main_~c~0 8)} #t~post5 := ~c~0;~c~0 := 1 + #t~post5;havoc #t~post5; {81296#(<= main_~c~0 9)} is VALID [2022-04-15 06:33:07,252 INFO L290 TraceCheckUtils]: 35: Hoare triple {81296#(<= main_~c~0 9)} assume !!(~c~0 < 200000); {81296#(<= main_~c~0 9)} is VALID [2022-04-15 06:33:07,252 INFO L290 TraceCheckUtils]: 36: Hoare triple {81296#(<= main_~c~0 9)} assume !(~c~0 == ~last~0); {81296#(<= main_~c~0 9)} is VALID [2022-04-15 06:33:07,252 INFO L290 TraceCheckUtils]: 37: Hoare triple {81296#(<= main_~c~0 9)} #t~post5 := ~c~0;~c~0 := 1 + #t~post5;havoc #t~post5; {81297#(<= main_~c~0 10)} is VALID [2022-04-15 06:33:07,253 INFO L290 TraceCheckUtils]: 38: Hoare triple {81297#(<= main_~c~0 10)} assume !!(~c~0 < 200000); {81297#(<= main_~c~0 10)} is VALID [2022-04-15 06:33:07,253 INFO L290 TraceCheckUtils]: 39: Hoare triple {81297#(<= main_~c~0 10)} assume !(~c~0 == ~last~0); {81297#(<= main_~c~0 10)} is VALID [2022-04-15 06:33:07,253 INFO L290 TraceCheckUtils]: 40: Hoare triple {81297#(<= main_~c~0 10)} #t~post5 := ~c~0;~c~0 := 1 + #t~post5;havoc #t~post5; {81298#(<= main_~c~0 11)} is VALID [2022-04-15 06:33:07,254 INFO L290 TraceCheckUtils]: 41: Hoare triple {81298#(<= main_~c~0 11)} assume !!(~c~0 < 200000); {81298#(<= main_~c~0 11)} is VALID [2022-04-15 06:33:07,254 INFO L290 TraceCheckUtils]: 42: Hoare triple {81298#(<= main_~c~0 11)} assume !(~c~0 == ~last~0); {81298#(<= main_~c~0 11)} is VALID [2022-04-15 06:33:07,254 INFO L290 TraceCheckUtils]: 43: Hoare triple {81298#(<= main_~c~0 11)} #t~post5 := ~c~0;~c~0 := 1 + #t~post5;havoc #t~post5; {81299#(<= main_~c~0 12)} is VALID [2022-04-15 06:33:07,255 INFO L290 TraceCheckUtils]: 44: Hoare triple {81299#(<= main_~c~0 12)} assume !!(~c~0 < 200000); {81299#(<= main_~c~0 12)} is VALID [2022-04-15 06:33:07,255 INFO L290 TraceCheckUtils]: 45: Hoare triple {81299#(<= main_~c~0 12)} assume !(~c~0 == ~last~0); {81299#(<= main_~c~0 12)} is VALID [2022-04-15 06:33:07,255 INFO L290 TraceCheckUtils]: 46: Hoare triple {81299#(<= main_~c~0 12)} #t~post5 := ~c~0;~c~0 := 1 + #t~post5;havoc #t~post5; {81300#(<= main_~c~0 13)} is VALID [2022-04-15 06:33:07,255 INFO L290 TraceCheckUtils]: 47: Hoare triple {81300#(<= main_~c~0 13)} assume !!(~c~0 < 200000); {81300#(<= main_~c~0 13)} is VALID [2022-04-15 06:33:07,256 INFO L290 TraceCheckUtils]: 48: Hoare triple {81300#(<= main_~c~0 13)} assume !(~c~0 == ~last~0); {81300#(<= main_~c~0 13)} is VALID [2022-04-15 06:33:07,256 INFO L290 TraceCheckUtils]: 49: Hoare triple {81300#(<= main_~c~0 13)} #t~post5 := ~c~0;~c~0 := 1 + #t~post5;havoc #t~post5; {81301#(<= main_~c~0 14)} is VALID [2022-04-15 06:33:07,256 INFO L290 TraceCheckUtils]: 50: Hoare triple {81301#(<= main_~c~0 14)} assume !(~c~0 < 200000); {81283#false} is VALID [2022-04-15 06:33:07,257 INFO L290 TraceCheckUtils]: 51: Hoare triple {81283#false} assume 0 == ~st~0 && ~c~0 == 1 + ~last~0;~a~0 := 3 + ~a~0;~b~0 := 3 + ~b~0; {81283#false} is VALID [2022-04-15 06:33:07,257 INFO L290 TraceCheckUtils]: 52: Hoare triple {81283#false} assume !(~c~0 == ~last~0 && 0 == ~st~0); {81283#false} is VALID [2022-04-15 06:33:07,257 INFO L272 TraceCheckUtils]: 53: Hoare triple {81283#false} call __VERIFIER_assert((if ~a~0 == ~b~0 && 200000 == ~c~0 then 1 else 0)); {81283#false} is VALID [2022-04-15 06:33:07,257 INFO L290 TraceCheckUtils]: 54: Hoare triple {81283#false} ~cond := #in~cond; {81283#false} is VALID [2022-04-15 06:33:07,257 INFO L290 TraceCheckUtils]: 55: Hoare triple {81283#false} assume 0 == ~cond; {81283#false} is VALID [2022-04-15 06:33:07,257 INFO L290 TraceCheckUtils]: 56: Hoare triple {81283#false} assume !false; {81283#false} is VALID [2022-04-15 06:33:07,257 INFO L134 CoverageAnalysis]: Checked inductivity of 287 backedges. 0 proven. 287 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 06:33:07,257 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 06:33:07,257 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1418760565] [2022-04-15 06:33:07,257 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1418760565] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 06:33:07,257 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1726645438] [2022-04-15 06:33:07,257 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 06:33:07,257 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 06:33:07,258 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 06:33:07,258 INFO L229 MonitoredProcess]: Starting monitored process 44 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-15 06:33:07,259 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (44)] Waiting until timeout for monitored process [2022-04-15 06:33:07,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:33:07,297 INFO L263 TraceCheckSpWp]: Trace formula consists of 142 conjuncts, 16 conjunts are in the unsatisfiable core [2022-04-15 06:33:07,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:33:07,309 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 06:33:07,575 INFO L272 TraceCheckUtils]: 0: Hoare triple {81282#true} call ULTIMATE.init(); {81282#true} is VALID [2022-04-15 06:33:07,575 INFO L290 TraceCheckUtils]: 1: Hoare triple {81282#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(11, 2);call #Ultimate.allocInit(12, 3);~last~0 := 0; {81282#true} is VALID [2022-04-15 06:33:07,575 INFO L290 TraceCheckUtils]: 2: Hoare triple {81282#true} assume true; {81282#true} is VALID [2022-04-15 06:33:07,575 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {81282#true} {81282#true} #66#return; {81282#true} is VALID [2022-04-15 06:33:07,575 INFO L272 TraceCheckUtils]: 4: Hoare triple {81282#true} call #t~ret6 := main(); {81282#true} is VALID [2022-04-15 06:33:07,575 INFO L290 TraceCheckUtils]: 5: Hoare triple {81282#true} assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~last~0 := #t~nondet4;havoc #t~nondet4;~a~0 := 0;~b~0 := 0;~c~0 := 0;~st~0 := 0; {81282#true} is VALID [2022-04-15 06:33:07,575 INFO L290 TraceCheckUtils]: 6: Hoare triple {81282#true} [222] L30-->L23-3_primed: Formula: (let ((.cse0 (= v_main_~b~0_215 v_main_~b~0_214)) (.cse1 (= |v_main_#t~post5_648| |v_main_#t~post5_634|)) (.cse2 (= v_main_~a~0_218 v_main_~a~0_217))) (or (and .cse0 (= v_main_~c~0_1470 v_main_~c~0_1485) (= v_main_~st~0_419 v_main_~st~0_421) .cse1 .cse2) (and (= v_main_~st~0_421 v_main_~st~0_419) (= v_main_~c~0_1485 v_main_~c~0_1470) .cse0 .cse1 .cse2))) InVars {main_~c~0=v_main_~c~0_1485, main_#t~post5=|v_main_#t~post5_648|, main_~st~0=v_main_~st~0_421, main_~b~0=v_main_~b~0_215, main_~a~0=v_main_~a~0_218} OutVars{main_~c~0=v_main_~c~0_1470, main_#t~post5=|v_main_#t~post5_634|, main_~st~0=v_main_~st~0_419, main_~b~0=v_main_~b~0_214, main_~a~0=v_main_~a~0_217} AuxVars[] AssignedVars[main_~c~0, main_#t~post5, main_~st~0, main_~b~0, main_~a~0] {81282#true} is VALID [2022-04-15 06:33:07,576 INFO L290 TraceCheckUtils]: 7: Hoare triple {81282#true} [221] L23-3_primed-->L23-3: Formula: (and (= v_main_~c~0_7 0) (= v_main_~st~0_6 1)) InVars {} OutVars{main_~c~0=v_main_~c~0_7, main_~st~0=v_main_~st~0_6} AuxVars[] AssignedVars[main_~c~0, main_~st~0] {81327#(<= main_~c~0 0)} is VALID [2022-04-15 06:33:07,576 INFO L290 TraceCheckUtils]: 8: Hoare triple {81327#(<= main_~c~0 0)} assume !!(~c~0 < 200000); {81327#(<= main_~c~0 0)} is VALID [2022-04-15 06:33:07,576 INFO L290 TraceCheckUtils]: 9: Hoare triple {81327#(<= main_~c~0 0)} assume ~c~0 == ~last~0;~st~0 := 0; {81327#(<= main_~c~0 0)} is VALID [2022-04-15 06:33:07,577 INFO L290 TraceCheckUtils]: 10: Hoare triple {81327#(<= main_~c~0 0)} #t~post5 := ~c~0;~c~0 := 1 + #t~post5;havoc #t~post5; {81288#(<= main_~c~0 1)} is VALID [2022-04-15 06:33:07,577 INFO L290 TraceCheckUtils]: 11: Hoare triple {81288#(<= main_~c~0 1)} assume !!(~c~0 < 200000); {81288#(<= main_~c~0 1)} is VALID [2022-04-15 06:33:07,577 INFO L290 TraceCheckUtils]: 12: Hoare triple {81288#(<= main_~c~0 1)} assume !(~c~0 == ~last~0); {81288#(<= main_~c~0 1)} is VALID [2022-04-15 06:33:07,578 INFO L290 TraceCheckUtils]: 13: Hoare triple {81288#(<= main_~c~0 1)} #t~post5 := ~c~0;~c~0 := 1 + #t~post5;havoc #t~post5; {81289#(<= main_~c~0 2)} is VALID [2022-04-15 06:33:07,578 INFO L290 TraceCheckUtils]: 14: Hoare triple {81289#(<= main_~c~0 2)} assume !!(~c~0 < 200000); {81289#(<= main_~c~0 2)} is VALID [2022-04-15 06:33:07,578 INFO L290 TraceCheckUtils]: 15: Hoare triple {81289#(<= main_~c~0 2)} assume !(~c~0 == ~last~0); {81289#(<= main_~c~0 2)} is VALID [2022-04-15 06:33:07,578 INFO L290 TraceCheckUtils]: 16: Hoare triple {81289#(<= main_~c~0 2)} #t~post5 := ~c~0;~c~0 := 1 + #t~post5;havoc #t~post5; {81290#(<= main_~c~0 3)} is VALID [2022-04-15 06:33:07,579 INFO L290 TraceCheckUtils]: 17: Hoare triple {81290#(<= main_~c~0 3)} assume !!(~c~0 < 200000); {81290#(<= main_~c~0 3)} is VALID [2022-04-15 06:33:07,579 INFO L290 TraceCheckUtils]: 18: Hoare triple {81290#(<= main_~c~0 3)} assume !(~c~0 == ~last~0); {81290#(<= main_~c~0 3)} is VALID [2022-04-15 06:33:07,579 INFO L290 TraceCheckUtils]: 19: Hoare triple {81290#(<= main_~c~0 3)} #t~post5 := ~c~0;~c~0 := 1 + #t~post5;havoc #t~post5; {81291#(<= main_~c~0 4)} is VALID [2022-04-15 06:33:07,580 INFO L290 TraceCheckUtils]: 20: Hoare triple {81291#(<= main_~c~0 4)} assume !!(~c~0 < 200000); {81291#(<= main_~c~0 4)} is VALID [2022-04-15 06:33:07,580 INFO L290 TraceCheckUtils]: 21: Hoare triple {81291#(<= main_~c~0 4)} assume !(~c~0 == ~last~0); {81291#(<= main_~c~0 4)} is VALID [2022-04-15 06:33:07,580 INFO L290 TraceCheckUtils]: 22: Hoare triple {81291#(<= main_~c~0 4)} #t~post5 := ~c~0;~c~0 := 1 + #t~post5;havoc #t~post5; {81292#(<= main_~c~0 5)} is VALID [2022-04-15 06:33:07,581 INFO L290 TraceCheckUtils]: 23: Hoare triple {81292#(<= main_~c~0 5)} assume !!(~c~0 < 200000); {81292#(<= main_~c~0 5)} is VALID [2022-04-15 06:33:07,581 INFO L290 TraceCheckUtils]: 24: Hoare triple {81292#(<= main_~c~0 5)} assume !(~c~0 == ~last~0); {81292#(<= main_~c~0 5)} is VALID [2022-04-15 06:33:07,581 INFO L290 TraceCheckUtils]: 25: Hoare triple {81292#(<= main_~c~0 5)} #t~post5 := ~c~0;~c~0 := 1 + #t~post5;havoc #t~post5; {81293#(<= main_~c~0 6)} is VALID [2022-04-15 06:33:07,581 INFO L290 TraceCheckUtils]: 26: Hoare triple {81293#(<= main_~c~0 6)} assume !!(~c~0 < 200000); {81293#(<= main_~c~0 6)} is VALID [2022-04-15 06:33:07,582 INFO L290 TraceCheckUtils]: 27: Hoare triple {81293#(<= main_~c~0 6)} assume !(~c~0 == ~last~0); {81293#(<= main_~c~0 6)} is VALID [2022-04-15 06:33:07,582 INFO L290 TraceCheckUtils]: 28: Hoare triple {81293#(<= main_~c~0 6)} #t~post5 := ~c~0;~c~0 := 1 + #t~post5;havoc #t~post5; {81294#(<= main_~c~0 7)} is VALID [2022-04-15 06:33:07,582 INFO L290 TraceCheckUtils]: 29: Hoare triple {81294#(<= main_~c~0 7)} assume !!(~c~0 < 200000); {81294#(<= main_~c~0 7)} is VALID [2022-04-15 06:33:07,583 INFO L290 TraceCheckUtils]: 30: Hoare triple {81294#(<= main_~c~0 7)} assume !(~c~0 == ~last~0); {81294#(<= main_~c~0 7)} is VALID [2022-04-15 06:33:07,583 INFO L290 TraceCheckUtils]: 31: Hoare triple {81294#(<= main_~c~0 7)} #t~post5 := ~c~0;~c~0 := 1 + #t~post5;havoc #t~post5; {81295#(<= main_~c~0 8)} is VALID [2022-04-15 06:33:07,583 INFO L290 TraceCheckUtils]: 32: Hoare triple {81295#(<= main_~c~0 8)} assume !!(~c~0 < 200000); {81295#(<= main_~c~0 8)} is VALID [2022-04-15 06:33:07,584 INFO L290 TraceCheckUtils]: 33: Hoare triple {81295#(<= main_~c~0 8)} assume !(~c~0 == ~last~0); {81295#(<= main_~c~0 8)} is VALID [2022-04-15 06:33:07,584 INFO L290 TraceCheckUtils]: 34: Hoare triple {81295#(<= main_~c~0 8)} #t~post5 := ~c~0;~c~0 := 1 + #t~post5;havoc #t~post5; {81296#(<= main_~c~0 9)} is VALID [2022-04-15 06:33:07,584 INFO L290 TraceCheckUtils]: 35: Hoare triple {81296#(<= main_~c~0 9)} assume !!(~c~0 < 200000); {81296#(<= main_~c~0 9)} is VALID [2022-04-15 06:33:07,584 INFO L290 TraceCheckUtils]: 36: Hoare triple {81296#(<= main_~c~0 9)} assume !(~c~0 == ~last~0); {81296#(<= main_~c~0 9)} is VALID [2022-04-15 06:33:07,585 INFO L290 TraceCheckUtils]: 37: Hoare triple {81296#(<= main_~c~0 9)} #t~post5 := ~c~0;~c~0 := 1 + #t~post5;havoc #t~post5; {81297#(<= main_~c~0 10)} is VALID [2022-04-15 06:33:07,585 INFO L290 TraceCheckUtils]: 38: Hoare triple {81297#(<= main_~c~0 10)} assume !!(~c~0 < 200000); {81297#(<= main_~c~0 10)} is VALID [2022-04-15 06:33:07,585 INFO L290 TraceCheckUtils]: 39: Hoare triple {81297#(<= main_~c~0 10)} assume !(~c~0 == ~last~0); {81297#(<= main_~c~0 10)} is VALID [2022-04-15 06:33:07,586 INFO L290 TraceCheckUtils]: 40: Hoare triple {81297#(<= main_~c~0 10)} #t~post5 := ~c~0;~c~0 := 1 + #t~post5;havoc #t~post5; {81298#(<= main_~c~0 11)} is VALID [2022-04-15 06:33:07,586 INFO L290 TraceCheckUtils]: 41: Hoare triple {81298#(<= main_~c~0 11)} assume !!(~c~0 < 200000); {81298#(<= main_~c~0 11)} is VALID [2022-04-15 06:33:07,586 INFO L290 TraceCheckUtils]: 42: Hoare triple {81298#(<= main_~c~0 11)} assume !(~c~0 == ~last~0); {81298#(<= main_~c~0 11)} is VALID [2022-04-15 06:33:07,587 INFO L290 TraceCheckUtils]: 43: Hoare triple {81298#(<= main_~c~0 11)} #t~post5 := ~c~0;~c~0 := 1 + #t~post5;havoc #t~post5; {81299#(<= main_~c~0 12)} is VALID [2022-04-15 06:33:07,587 INFO L290 TraceCheckUtils]: 44: Hoare triple {81299#(<= main_~c~0 12)} assume !!(~c~0 < 200000); {81299#(<= main_~c~0 12)} is VALID [2022-04-15 06:33:07,587 INFO L290 TraceCheckUtils]: 45: Hoare triple {81299#(<= main_~c~0 12)} assume !(~c~0 == ~last~0); {81299#(<= main_~c~0 12)} is VALID [2022-04-15 06:33:07,588 INFO L290 TraceCheckUtils]: 46: Hoare triple {81299#(<= main_~c~0 12)} #t~post5 := ~c~0;~c~0 := 1 + #t~post5;havoc #t~post5; {81300#(<= main_~c~0 13)} is VALID [2022-04-15 06:33:07,588 INFO L290 TraceCheckUtils]: 47: Hoare triple {81300#(<= main_~c~0 13)} assume !!(~c~0 < 200000); {81300#(<= main_~c~0 13)} is VALID [2022-04-15 06:33:07,588 INFO L290 TraceCheckUtils]: 48: Hoare triple {81300#(<= main_~c~0 13)} assume !(~c~0 == ~last~0); {81300#(<= main_~c~0 13)} is VALID [2022-04-15 06:33:07,589 INFO L290 TraceCheckUtils]: 49: Hoare triple {81300#(<= main_~c~0 13)} #t~post5 := ~c~0;~c~0 := 1 + #t~post5;havoc #t~post5; {81301#(<= main_~c~0 14)} is VALID [2022-04-15 06:33:07,589 INFO L290 TraceCheckUtils]: 50: Hoare triple {81301#(<= main_~c~0 14)} assume !(~c~0 < 200000); {81283#false} is VALID [2022-04-15 06:33:07,589 INFO L290 TraceCheckUtils]: 51: Hoare triple {81283#false} assume 0 == ~st~0 && ~c~0 == 1 + ~last~0;~a~0 := 3 + ~a~0;~b~0 := 3 + ~b~0; {81283#false} is VALID [2022-04-15 06:33:07,589 INFO L290 TraceCheckUtils]: 52: Hoare triple {81283#false} assume !(~c~0 == ~last~0 && 0 == ~st~0); {81283#false} is VALID [2022-04-15 06:33:07,589 INFO L272 TraceCheckUtils]: 53: Hoare triple {81283#false} call __VERIFIER_assert((if ~a~0 == ~b~0 && 200000 == ~c~0 then 1 else 0)); {81283#false} is VALID [2022-04-15 06:33:07,589 INFO L290 TraceCheckUtils]: 54: Hoare triple {81283#false} ~cond := #in~cond; {81283#false} is VALID [2022-04-15 06:33:07,589 INFO L290 TraceCheckUtils]: 55: Hoare triple {81283#false} assume 0 == ~cond; {81283#false} is VALID [2022-04-15 06:33:07,589 INFO L290 TraceCheckUtils]: 56: Hoare triple {81283#false} assume !false; {81283#false} is VALID [2022-04-15 06:33:07,589 INFO L134 CoverageAnalysis]: Checked inductivity of 287 backedges. 0 proven. 287 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 06:33:07,589 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 06:33:07,906 INFO L290 TraceCheckUtils]: 56: Hoare triple {81283#false} assume !false; {81283#false} is VALID [2022-04-15 06:33:07,906 INFO L290 TraceCheckUtils]: 55: Hoare triple {81283#false} assume 0 == ~cond; {81283#false} is VALID [2022-04-15 06:33:07,906 INFO L290 TraceCheckUtils]: 54: Hoare triple {81283#false} ~cond := #in~cond; {81283#false} is VALID [2022-04-15 06:33:07,906 INFO L272 TraceCheckUtils]: 53: Hoare triple {81283#false} call __VERIFIER_assert((if ~a~0 == ~b~0 && 200000 == ~c~0 then 1 else 0)); {81283#false} is VALID [2022-04-15 06:33:07,906 INFO L290 TraceCheckUtils]: 52: Hoare triple {81283#false} assume !(~c~0 == ~last~0 && 0 == ~st~0); {81283#false} is VALID [2022-04-15 06:33:07,906 INFO L290 TraceCheckUtils]: 51: Hoare triple {81283#false} assume 0 == ~st~0 && ~c~0 == 1 + ~last~0;~a~0 := 3 + ~a~0;~b~0 := 3 + ~b~0; {81283#false} is VALID [2022-04-15 06:33:07,906 INFO L290 TraceCheckUtils]: 50: Hoare triple {81493#(< main_~c~0 200000)} assume !(~c~0 < 200000); {81283#false} is VALID [2022-04-15 06:33:07,906 INFO L290 TraceCheckUtils]: 49: Hoare triple {81497#(< main_~c~0 199999)} #t~post5 := ~c~0;~c~0 := 1 + #t~post5;havoc #t~post5; {81493#(< main_~c~0 200000)} is VALID [2022-04-15 06:33:07,907 INFO L290 TraceCheckUtils]: 48: Hoare triple {81497#(< main_~c~0 199999)} assume !(~c~0 == ~last~0); {81497#(< main_~c~0 199999)} is VALID [2022-04-15 06:33:07,907 INFO L290 TraceCheckUtils]: 47: Hoare triple {81497#(< main_~c~0 199999)} assume !!(~c~0 < 200000); {81497#(< main_~c~0 199999)} is VALID [2022-04-15 06:33:07,907 INFO L290 TraceCheckUtils]: 46: Hoare triple {81507#(< main_~c~0 199998)} #t~post5 := ~c~0;~c~0 := 1 + #t~post5;havoc #t~post5; {81497#(< main_~c~0 199999)} is VALID [2022-04-15 06:33:07,907 INFO L290 TraceCheckUtils]: 45: Hoare triple {81507#(< main_~c~0 199998)} assume !(~c~0 == ~last~0); {81507#(< main_~c~0 199998)} is VALID [2022-04-15 06:33:07,908 INFO L290 TraceCheckUtils]: 44: Hoare triple {81507#(< main_~c~0 199998)} assume !!(~c~0 < 200000); {81507#(< main_~c~0 199998)} is VALID [2022-04-15 06:33:07,908 INFO L290 TraceCheckUtils]: 43: Hoare triple {81517#(< main_~c~0 199997)} #t~post5 := ~c~0;~c~0 := 1 + #t~post5;havoc #t~post5; {81507#(< main_~c~0 199998)} is VALID [2022-04-15 06:33:07,908 INFO L290 TraceCheckUtils]: 42: Hoare triple {81517#(< main_~c~0 199997)} assume !(~c~0 == ~last~0); {81517#(< main_~c~0 199997)} is VALID [2022-04-15 06:33:07,908 INFO L290 TraceCheckUtils]: 41: Hoare triple {81517#(< main_~c~0 199997)} assume !!(~c~0 < 200000); {81517#(< main_~c~0 199997)} is VALID [2022-04-15 06:33:07,908 INFO L290 TraceCheckUtils]: 40: Hoare triple {81527#(< main_~c~0 199996)} #t~post5 := ~c~0;~c~0 := 1 + #t~post5;havoc #t~post5; {81517#(< main_~c~0 199997)} is VALID [2022-04-15 06:33:07,909 INFO L290 TraceCheckUtils]: 39: Hoare triple {81527#(< main_~c~0 199996)} assume !(~c~0 == ~last~0); {81527#(< main_~c~0 199996)} is VALID [2022-04-15 06:33:07,909 INFO L290 TraceCheckUtils]: 38: Hoare triple {81527#(< main_~c~0 199996)} assume !!(~c~0 < 200000); {81527#(< main_~c~0 199996)} is VALID [2022-04-15 06:33:07,909 INFO L290 TraceCheckUtils]: 37: Hoare triple {81537#(< main_~c~0 199995)} #t~post5 := ~c~0;~c~0 := 1 + #t~post5;havoc #t~post5; {81527#(< main_~c~0 199996)} is VALID [2022-04-15 06:33:07,909 INFO L290 TraceCheckUtils]: 36: Hoare triple {81537#(< main_~c~0 199995)} assume !(~c~0 == ~last~0); {81537#(< main_~c~0 199995)} is VALID [2022-04-15 06:33:07,909 INFO L290 TraceCheckUtils]: 35: Hoare triple {81537#(< main_~c~0 199995)} assume !!(~c~0 < 200000); {81537#(< main_~c~0 199995)} is VALID [2022-04-15 06:33:07,910 INFO L290 TraceCheckUtils]: 34: Hoare triple {81547#(< main_~c~0 199994)} #t~post5 := ~c~0;~c~0 := 1 + #t~post5;havoc #t~post5; {81537#(< main_~c~0 199995)} is VALID [2022-04-15 06:33:07,910 INFO L290 TraceCheckUtils]: 33: Hoare triple {81547#(< main_~c~0 199994)} assume !(~c~0 == ~last~0); {81547#(< main_~c~0 199994)} is VALID [2022-04-15 06:33:07,910 INFO L290 TraceCheckUtils]: 32: Hoare triple {81547#(< main_~c~0 199994)} assume !!(~c~0 < 200000); {81547#(< main_~c~0 199994)} is VALID [2022-04-15 06:33:07,910 INFO L290 TraceCheckUtils]: 31: Hoare triple {81557#(< main_~c~0 199993)} #t~post5 := ~c~0;~c~0 := 1 + #t~post5;havoc #t~post5; {81547#(< main_~c~0 199994)} is VALID [2022-04-15 06:33:07,911 INFO L290 TraceCheckUtils]: 30: Hoare triple {81557#(< main_~c~0 199993)} assume !(~c~0 == ~last~0); {81557#(< main_~c~0 199993)} is VALID [2022-04-15 06:33:07,912 INFO L290 TraceCheckUtils]: 29: Hoare triple {81557#(< main_~c~0 199993)} assume !!(~c~0 < 200000); {81557#(< main_~c~0 199993)} is VALID [2022-04-15 06:33:07,912 INFO L290 TraceCheckUtils]: 28: Hoare triple {81567#(< main_~c~0 199992)} #t~post5 := ~c~0;~c~0 := 1 + #t~post5;havoc #t~post5; {81557#(< main_~c~0 199993)} is VALID [2022-04-15 06:33:07,913 INFO L290 TraceCheckUtils]: 27: Hoare triple {81567#(< main_~c~0 199992)} assume !(~c~0 == ~last~0); {81567#(< main_~c~0 199992)} is VALID [2022-04-15 06:33:07,913 INFO L290 TraceCheckUtils]: 26: Hoare triple {81567#(< main_~c~0 199992)} assume !!(~c~0 < 200000); {81567#(< main_~c~0 199992)} is VALID [2022-04-15 06:33:07,913 INFO L290 TraceCheckUtils]: 25: Hoare triple {81577#(< main_~c~0 199991)} #t~post5 := ~c~0;~c~0 := 1 + #t~post5;havoc #t~post5; {81567#(< main_~c~0 199992)} is VALID [2022-04-15 06:33:07,914 INFO L290 TraceCheckUtils]: 24: Hoare triple {81577#(< main_~c~0 199991)} assume !(~c~0 == ~last~0); {81577#(< main_~c~0 199991)} is VALID [2022-04-15 06:33:07,914 INFO L290 TraceCheckUtils]: 23: Hoare triple {81577#(< main_~c~0 199991)} assume !!(~c~0 < 200000); {81577#(< main_~c~0 199991)} is VALID [2022-04-15 06:33:07,914 INFO L290 TraceCheckUtils]: 22: Hoare triple {81587#(< main_~c~0 199990)} #t~post5 := ~c~0;~c~0 := 1 + #t~post5;havoc #t~post5; {81577#(< main_~c~0 199991)} is VALID [2022-04-15 06:33:07,915 INFO L290 TraceCheckUtils]: 21: Hoare triple {81587#(< main_~c~0 199990)} assume !(~c~0 == ~last~0); {81587#(< main_~c~0 199990)} is VALID [2022-04-15 06:33:07,915 INFO L290 TraceCheckUtils]: 20: Hoare triple {81587#(< main_~c~0 199990)} assume !!(~c~0 < 200000); {81587#(< main_~c~0 199990)} is VALID [2022-04-15 06:33:07,915 INFO L290 TraceCheckUtils]: 19: Hoare triple {81597#(< main_~c~0 199989)} #t~post5 := ~c~0;~c~0 := 1 + #t~post5;havoc #t~post5; {81587#(< main_~c~0 199990)} is VALID [2022-04-15 06:33:07,915 INFO L290 TraceCheckUtils]: 18: Hoare triple {81597#(< main_~c~0 199989)} assume !(~c~0 == ~last~0); {81597#(< main_~c~0 199989)} is VALID [2022-04-15 06:33:07,915 INFO L290 TraceCheckUtils]: 17: Hoare triple {81597#(< main_~c~0 199989)} assume !!(~c~0 < 200000); {81597#(< main_~c~0 199989)} is VALID [2022-04-15 06:33:07,916 INFO L290 TraceCheckUtils]: 16: Hoare triple {81607#(< main_~c~0 199988)} #t~post5 := ~c~0;~c~0 := 1 + #t~post5;havoc #t~post5; {81597#(< main_~c~0 199989)} is VALID [2022-04-15 06:33:07,916 INFO L290 TraceCheckUtils]: 15: Hoare triple {81607#(< main_~c~0 199988)} assume !(~c~0 == ~last~0); {81607#(< main_~c~0 199988)} is VALID [2022-04-15 06:33:07,916 INFO L290 TraceCheckUtils]: 14: Hoare triple {81607#(< main_~c~0 199988)} assume !!(~c~0 < 200000); {81607#(< main_~c~0 199988)} is VALID [2022-04-15 06:33:07,916 INFO L290 TraceCheckUtils]: 13: Hoare triple {81617#(< main_~c~0 199987)} #t~post5 := ~c~0;~c~0 := 1 + #t~post5;havoc #t~post5; {81607#(< main_~c~0 199988)} is VALID [2022-04-15 06:33:07,917 INFO L290 TraceCheckUtils]: 12: Hoare triple {81617#(< main_~c~0 199987)} assume !(~c~0 == ~last~0); {81617#(< main_~c~0 199987)} is VALID [2022-04-15 06:33:07,917 INFO L290 TraceCheckUtils]: 11: Hoare triple {81617#(< main_~c~0 199987)} assume !!(~c~0 < 200000); {81617#(< main_~c~0 199987)} is VALID [2022-04-15 06:33:07,917 INFO L290 TraceCheckUtils]: 10: Hoare triple {81627#(< main_~c~0 199986)} #t~post5 := ~c~0;~c~0 := 1 + #t~post5;havoc #t~post5; {81617#(< main_~c~0 199987)} is VALID [2022-04-15 06:33:07,917 INFO L290 TraceCheckUtils]: 9: Hoare triple {81627#(< main_~c~0 199986)} assume ~c~0 == ~last~0;~st~0 := 0; {81627#(< main_~c~0 199986)} is VALID [2022-04-15 06:33:07,918 INFO L290 TraceCheckUtils]: 8: Hoare triple {81627#(< main_~c~0 199986)} assume !!(~c~0 < 200000); {81627#(< main_~c~0 199986)} is VALID [2022-04-15 06:33:07,918 INFO L290 TraceCheckUtils]: 7: Hoare triple {81282#true} [221] L23-3_primed-->L23-3: Formula: (and (= v_main_~c~0_7 0) (= v_main_~st~0_6 1)) InVars {} OutVars{main_~c~0=v_main_~c~0_7, main_~st~0=v_main_~st~0_6} AuxVars[] AssignedVars[main_~c~0, main_~st~0] {81627#(< main_~c~0 199986)} is VALID [2022-04-15 06:33:07,918 INFO L290 TraceCheckUtils]: 6: Hoare triple {81282#true} [222] L30-->L23-3_primed: Formula: (let ((.cse0 (= v_main_~b~0_215 v_main_~b~0_214)) (.cse1 (= |v_main_#t~post5_648| |v_main_#t~post5_634|)) (.cse2 (= v_main_~a~0_218 v_main_~a~0_217))) (or (and .cse0 (= v_main_~c~0_1470 v_main_~c~0_1485) (= v_main_~st~0_419 v_main_~st~0_421) .cse1 .cse2) (and (= v_main_~st~0_421 v_main_~st~0_419) (= v_main_~c~0_1485 v_main_~c~0_1470) .cse0 .cse1 .cse2))) InVars {main_~c~0=v_main_~c~0_1485, main_#t~post5=|v_main_#t~post5_648|, main_~st~0=v_main_~st~0_421, main_~b~0=v_main_~b~0_215, main_~a~0=v_main_~a~0_218} OutVars{main_~c~0=v_main_~c~0_1470, main_#t~post5=|v_main_#t~post5_634|, main_~st~0=v_main_~st~0_419, main_~b~0=v_main_~b~0_214, main_~a~0=v_main_~a~0_217} AuxVars[] AssignedVars[main_~c~0, main_#t~post5, main_~st~0, main_~b~0, main_~a~0] {81282#true} is VALID [2022-04-15 06:33:07,918 INFO L290 TraceCheckUtils]: 5: Hoare triple {81282#true} assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~last~0 := #t~nondet4;havoc #t~nondet4;~a~0 := 0;~b~0 := 0;~c~0 := 0;~st~0 := 0; {81282#true} is VALID [2022-04-15 06:33:07,918 INFO L272 TraceCheckUtils]: 4: Hoare triple {81282#true} call #t~ret6 := main(); {81282#true} is VALID [2022-04-15 06:33:07,919 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {81282#true} {81282#true} #66#return; {81282#true} is VALID [2022-04-15 06:33:07,919 INFO L290 TraceCheckUtils]: 2: Hoare triple {81282#true} assume true; {81282#true} is VALID [2022-04-15 06:33:07,919 INFO L290 TraceCheckUtils]: 1: Hoare triple {81282#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(11, 2);call #Ultimate.allocInit(12, 3);~last~0 := 0; {81282#true} is VALID [2022-04-15 06:33:07,919 INFO L272 TraceCheckUtils]: 0: Hoare triple {81282#true} call ULTIMATE.init(); {81282#true} is VALID [2022-04-15 06:33:07,919 INFO L134 CoverageAnalysis]: Checked inductivity of 287 backedges. 0 proven. 287 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 06:33:07,919 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1726645438] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 06:33:07,919 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 06:33:07,919 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 17, 17] total 34 [2022-04-15 06:33:08,361 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 06:33:08,361 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [968242979] [2022-04-15 06:33:08,361 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [968242979] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 06:33:08,361 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 06:33:08,361 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [34] imperfect sequences [] total 34 [2022-04-15 06:33:08,361 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1012160166] [2022-04-15 06:33:08,361 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 06:33:08,362 INFO L78 Accepts]: Start accepts. Automaton has has 34 states, 34 states have (on average 2.911764705882353) internal successors, (99), 33 states have internal predecessors, (99), 2 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 107 [2022-04-15 06:33:08,362 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 06:33:08,362 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 34 states, 34 states have (on average 2.911764705882353) internal successors, (99), 33 states have internal predecessors, (99), 2 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-15 06:33:08,415 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-15 06:33:08,415 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 34 states [2022-04-15 06:33:08,415 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 06:33:08,415 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2022-04-15 06:33:08,416 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=939, Invalid=1511, Unknown=0, NotChecked=0, Total=2450 [2022-04-15 06:33:08,416 INFO L87 Difference]: Start difference. First operand 505 states and 568 transitions. Second operand has 34 states, 34 states have (on average 2.911764705882353) internal successors, (99), 33 states have internal predecessors, (99), 2 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-15 06:33:13,366 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:33:13,366 INFO L93 Difference]: Finished difference Result 739 states and 843 transitions. [2022-04-15 06:33:13,366 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2022-04-15 06:33:13,366 INFO L78 Accepts]: Start accepts. Automaton has has 34 states, 34 states have (on average 2.911764705882353) internal successors, (99), 33 states have internal predecessors, (99), 2 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 107 [2022-04-15 06:33:13,366 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 06:33:13,366 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34 states, 34 states have (on average 2.911764705882353) internal successors, (99), 33 states have internal predecessors, (99), 2 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-15 06:33:13,367 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 144 transitions. [2022-04-15 06:33:13,367 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34 states, 34 states have (on average 2.911764705882353) internal successors, (99), 33 states have internal predecessors, (99), 2 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-15 06:33:13,368 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 144 transitions. [2022-04-15 06:33:13,368 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 34 states and 144 transitions. [2022-04-15 06:33:13,464 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 144 edges. 144 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 06:33:13,480 INFO L225 Difference]: With dead ends: 739 [2022-04-15 06:33:13,480 INFO L226 Difference]: Without dead ends: 633 [2022-04-15 06:33:13,481 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 191 GetRequests, 123 SyntacticMatches, 20 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2262 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=939, Invalid=1511, Unknown=0, NotChecked=0, Total=2450 [2022-04-15 06:33:13,481 INFO L913 BasicCegarLoop]: 18 mSDtfsCounter, 90 mSDsluCounter, 52 mSDsCounter, 0 mSdLazyCounter, 878 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 90 SdHoareTripleChecker+Valid, 70 SdHoareTripleChecker+Invalid, 888 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 878 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-04-15 06:33:13,481 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [90 Valid, 70 Invalid, 888 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 878 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-04-15 06:33:13,481 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 633 states. [2022-04-15 06:33:15,432 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 633 to 555. [2022-04-15 06:33:15,432 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 06:33:15,433 INFO L82 GeneralOperation]: Start isEquivalent. First operand 633 states. Second operand has 555 states, 547 states have (on average 1.1206581352833638) internal successors, (613), 548 states have internal predecessors, (613), 4 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-15 06:33:15,433 INFO L74 IsIncluded]: Start isIncluded. First operand 633 states. Second operand has 555 states, 547 states have (on average 1.1206581352833638) internal successors, (613), 548 states have internal predecessors, (613), 4 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-15 06:33:15,434 INFO L87 Difference]: Start difference. First operand 633 states. Second operand has 555 states, 547 states have (on average 1.1206581352833638) internal successors, (613), 548 states have internal predecessors, (613), 4 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-15 06:33:15,444 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:33:15,444 INFO L93 Difference]: Finished difference Result 633 states and 700 transitions. [2022-04-15 06:33:15,444 INFO L276 IsEmpty]: Start isEmpty. Operand 633 states and 700 transitions. [2022-04-15 06:33:15,445 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 06:33:15,445 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 06:33:15,445 INFO L74 IsIncluded]: Start isIncluded. First operand has 555 states, 547 states have (on average 1.1206581352833638) internal successors, (613), 548 states have internal predecessors, (613), 4 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) Second operand 633 states. [2022-04-15 06:33:15,446 INFO L87 Difference]: Start difference. First operand has 555 states, 547 states have (on average 1.1206581352833638) internal successors, (613), 548 states have internal predecessors, (613), 4 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) Second operand 633 states. [2022-04-15 06:33:15,457 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:33:15,457 INFO L93 Difference]: Finished difference Result 633 states and 700 transitions. [2022-04-15 06:33:15,457 INFO L276 IsEmpty]: Start isEmpty. Operand 633 states and 700 transitions. [2022-04-15 06:33:15,457 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 06:33:15,457 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 06:33:15,457 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 06:33:15,457 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 06:33:15,458 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 555 states, 547 states have (on average 1.1206581352833638) internal successors, (613), 548 states have internal predecessors, (613), 4 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-15 06:33:15,470 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 555 states to 555 states and 620 transitions. [2022-04-15 06:33:15,470 INFO L78 Accepts]: Start accepts. Automaton has 555 states and 620 transitions. Word has length 107 [2022-04-15 06:33:15,470 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 06:33:15,470 INFO L478 AbstractCegarLoop]: Abstraction has 555 states and 620 transitions. [2022-04-15 06:33:15,471 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 34 states, 34 states have (on average 2.911764705882353) internal successors, (99), 33 states have internal predecessors, (99), 2 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-15 06:33:15,471 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 555 states and 620 transitions. [2022-04-15 06:33:17,392 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 620 edges. 620 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 06:33:17,393 INFO L276 IsEmpty]: Start isEmpty. Operand 555 states and 620 transitions. [2022-04-15 06:33:17,393 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2022-04-15 06:33:17,393 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 06:33:17,393 INFO L499 BasicCegarLoop]: trace histogram [31, 31, 30, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 06:33:17,410 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (44)] Ended with exit code 0 [2022-04-15 06:33:17,610 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 44 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable47 [2022-04-15 06:33:17,610 INFO L403 AbstractCegarLoop]: === Iteration 49 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 06:33:17,611 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 06:33:17,611 INFO L85 PathProgramCache]: Analyzing trace with hash -1330662396, now seen corresponding path program 30 times [2022-04-15 06:33:17,611 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 06:33:17,611 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [563160083] [2022-04-15 06:33:21,737 WARN L977 rdanLoopAcceleration]: Unable to prove correctness of quantifier elimination. [2022-04-15 06:33:21,840 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 1 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-15 06:33:22,056 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {0={1=1}, 1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-15 06:33:22,057 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-15 06:33:22,060 INFO L85 PathProgramCache]: Analyzing trace with hash -1308982456, now seen corresponding path program 1 times [2022-04-15 06:33:22,060 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 06:33:22,060 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1392679378] [2022-04-15 06:33:22,060 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 06:33:22,060 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 06:33:22,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:33:22,172 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 06:33:22,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:33:22,175 INFO L290 TraceCheckUtils]: 0: Hoare triple {85542#(and (= ~last~0 |old(~last~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(11, 2);call #Ultimate.allocInit(12, 3);~last~0 := 0; {85530#true} is VALID [2022-04-15 06:33:22,175 INFO L290 TraceCheckUtils]: 1: Hoare triple {85530#true} assume true; {85530#true} is VALID [2022-04-15 06:33:22,175 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {85530#true} {85530#true} #66#return; {85530#true} is VALID [2022-04-15 06:33:22,175 INFO L272 TraceCheckUtils]: 0: Hoare triple {85530#true} call ULTIMATE.init(); {85542#(and (= ~last~0 |old(~last~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 06:33:22,175 INFO L290 TraceCheckUtils]: 1: Hoare triple {85542#(and (= ~last~0 |old(~last~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(11, 2);call #Ultimate.allocInit(12, 3);~last~0 := 0; {85530#true} is VALID [2022-04-15 06:33:22,175 INFO L290 TraceCheckUtils]: 2: Hoare triple {85530#true} assume true; {85530#true} is VALID [2022-04-15 06:33:22,175 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {85530#true} {85530#true} #66#return; {85530#true} is VALID [2022-04-15 06:33:22,175 INFO L272 TraceCheckUtils]: 4: Hoare triple {85530#true} call #t~ret6 := main(); {85530#true} is VALID [2022-04-15 06:33:22,176 INFO L290 TraceCheckUtils]: 5: Hoare triple {85530#true} assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~last~0 := #t~nondet4;havoc #t~nondet4;~a~0 := 0;~b~0 := 0;~c~0 := 0;~st~0 := 0; {85535#(and (= main_~a~0 0) (= main_~b~0 0))} is VALID [2022-04-15 06:33:22,176 INFO L290 TraceCheckUtils]: 6: Hoare triple {85535#(and (= main_~a~0 0) (= main_~b~0 0))} assume !false;~st~0 := 1;~c~0 := 0; {85536#(and (= main_~a~0 0) (= main_~st~0 1) (= main_~b~0 0))} is VALID [2022-04-15 06:33:22,177 INFO L290 TraceCheckUtils]: 7: Hoare triple {85536#(and (= main_~a~0 0) (= main_~st~0 1) (= main_~b~0 0))} [224] L23-3-->L23-4_primed: Formula: (let ((.cse0 (= v_~last~0_322 v_main_~c~0_1533)) (.cse1 (= |v_main_#t~post5_668| |v_main_#t~post5_666|)) (.cse2 (= v_main_~c~0_1533 v_main_~c~0_1532))) (or (and (or (not (< v_main_~c~0_1533 200000)) .cse0) .cse1 .cse2) (and (< v_main_~c~0_1532 200001) (or (not (<= (+ v_main_~c~0_1533 1) v_~last~0_322)) (not (<= (+ v_~last~0_322 1) v_main_~c~0_1532))) (< v_main_~c~0_1533 v_main_~c~0_1532) (not .cse0)) (and (= v_~last~0_322 v_~last~0_322) .cse1 .cse2))) InVars {main_~c~0=v_main_~c~0_1533, main_#t~post5=|v_main_#t~post5_668|, ~last~0=v_~last~0_322} OutVars{main_#t~post5=|v_main_#t~post5_666|, main_~c~0=v_main_~c~0_1532, ~last~0=v_~last~0_322} AuxVars[] AssignedVars[main_#t~post5, main_~c~0] {85536#(and (= main_~a~0 0) (= main_~st~0 1) (= main_~b~0 0))} is VALID [2022-04-15 06:33:22,177 INFO L290 TraceCheckUtils]: 8: Hoare triple {85536#(and (= main_~a~0 0) (= main_~st~0 1) (= main_~b~0 0))} [225] L23-4_primed-->L23-3: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {85536#(and (= main_~a~0 0) (= main_~st~0 1) (= main_~b~0 0))} is VALID [2022-04-15 06:33:22,178 INFO L290 TraceCheckUtils]: 9: Hoare triple {85536#(and (= main_~a~0 0) (= main_~st~0 1) (= main_~b~0 0))} [226] L23-3-->L23-4_primed: Formula: (let ((.cse0 (= v_main_~c~0_1535 v_main_~c~0_1534)) (.cse1 (= |v_main_#t~post5_671| |v_main_#t~post5_667|)) (.cse2 (< v_main_~c~0_1535 200000)) (.cse3 (= v_~last~0_323 v_main_~c~0_1535))) (or (and (= v_main_~st~0_429 v_main_~st~0_428) (= v_~last~0_323 v_~last~0_323) .cse0 .cse1) (and .cse2 (<= v_main_~c~0_1534 (+ v_~last~0_323 1)) .cse3 (= v_main_~st~0_428 0) (< v_main_~c~0_1535 v_main_~c~0_1534)) (and (= v_main_~st~0_428 v_main_~st~0_429) .cse0 .cse1 (or (not .cse2) (not .cse3))))) InVars {main_~c~0=v_main_~c~0_1535, main_#t~post5=|v_main_#t~post5_671|, main_~st~0=v_main_~st~0_429, ~last~0=v_~last~0_323} OutVars{main_#t~post5=|v_main_#t~post5_667|, main_~c~0=v_main_~c~0_1534, main_~st~0=v_main_~st~0_428, ~last~0=v_~last~0_323} AuxVars[] AssignedVars[main_#t~post5, main_~c~0, main_~st~0] {85537#(or (= main_~st~0 1) (and (= main_~a~0 0) (or (<= ~last~0 199999) (<= main_~c~0 200000)) (= main_~b~0 0)))} is VALID [2022-04-15 06:33:22,178 INFO L290 TraceCheckUtils]: 10: Hoare triple {85537#(or (= main_~st~0 1) (and (= main_~a~0 0) (or (<= ~last~0 199999) (<= main_~c~0 200000)) (= main_~b~0 0)))} [223] L23-4_primed-->L23-4: Formula: (not (< v_main_~c~0_8 200000)) InVars {main_~c~0=v_main_~c~0_8} OutVars{main_~c~0=v_main_~c~0_8} AuxVars[] AssignedVars[] {85538#(or (= main_~st~0 1) (and (= main_~a~0 0) (or (<= ~last~0 199999) (<= main_~c~0 200000)) (= main_~b~0 0) (< 199999 main_~c~0)))} is VALID [2022-04-15 06:33:22,179 INFO L290 TraceCheckUtils]: 11: Hoare triple {85538#(or (= main_~st~0 1) (and (= main_~a~0 0) (or (<= ~last~0 199999) (<= main_~c~0 200000)) (= main_~b~0 0) (< 199999 main_~c~0)))} assume 0 == ~st~0 && ~c~0 == 1 + ~last~0;~a~0 := 3 + ~a~0;~b~0 := 3 + ~b~0; {85539#(and (<= main_~b~0 main_~a~0) (< main_~a~0 (+ main_~b~0 1)) (< 199999 main_~c~0) (<= main_~c~0 200000))} is VALID [2022-04-15 06:33:22,179 INFO L290 TraceCheckUtils]: 12: Hoare triple {85539#(and (<= main_~b~0 main_~a~0) (< main_~a~0 (+ main_~b~0 1)) (< 199999 main_~c~0) (<= main_~c~0 200000))} assume !(~c~0 == ~last~0 && 0 == ~st~0); {85539#(and (<= main_~b~0 main_~a~0) (< main_~a~0 (+ main_~b~0 1)) (< 199999 main_~c~0) (<= main_~c~0 200000))} is VALID [2022-04-15 06:33:22,180 INFO L272 TraceCheckUtils]: 13: Hoare triple {85539#(and (<= main_~b~0 main_~a~0) (< main_~a~0 (+ main_~b~0 1)) (< 199999 main_~c~0) (<= main_~c~0 200000))} call __VERIFIER_assert((if ~a~0 == ~b~0 && 200000 == ~c~0 then 1 else 0)); {85540#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-15 06:33:22,180 INFO L290 TraceCheckUtils]: 14: Hoare triple {85540#(not (= |__VERIFIER_assert_#in~cond| 0))} ~cond := #in~cond; {85541#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-15 06:33:22,181 INFO L290 TraceCheckUtils]: 15: Hoare triple {85541#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {85531#false} is VALID [2022-04-15 06:33:22,181 INFO L290 TraceCheckUtils]: 16: Hoare triple {85531#false} assume !false; {85531#false} is VALID [2022-04-15 06:33:22,181 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-04-15 06:33:22,181 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 06:33:22,181 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1392679378] [2022-04-15 06:33:22,181 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1392679378] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 06:33:22,181 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [317829208] [2022-04-15 06:33:22,181 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 06:33:22,181 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 06:33:22,181 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 06:33:22,182 INFO L229 MonitoredProcess]: Starting monitored process 45 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-15 06:33:22,183 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (45)] Waiting until timeout for monitored process [2022-04-15 06:33:22,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:33:22,213 INFO L263 TraceCheckSpWp]: Trace formula consists of 85 conjuncts, 18 conjunts are in the unsatisfiable core [2022-04-15 06:33:22,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:33:22,220 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 06:33:22,496 INFO L272 TraceCheckUtils]: 0: Hoare triple {85530#true} call ULTIMATE.init(); {85530#true} is VALID [2022-04-15 06:33:22,496 INFO L290 TraceCheckUtils]: 1: Hoare triple {85530#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(11, 2);call #Ultimate.allocInit(12, 3);~last~0 := 0; {85530#true} is VALID [2022-04-15 06:33:22,496 INFO L290 TraceCheckUtils]: 2: Hoare triple {85530#true} assume true; {85530#true} is VALID [2022-04-15 06:33:22,497 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {85530#true} {85530#true} #66#return; {85530#true} is VALID [2022-04-15 06:33:22,497 INFO L272 TraceCheckUtils]: 4: Hoare triple {85530#true} call #t~ret6 := main(); {85530#true} is VALID [2022-04-15 06:33:22,497 INFO L290 TraceCheckUtils]: 5: Hoare triple {85530#true} assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~last~0 := #t~nondet4;havoc #t~nondet4;~a~0 := 0;~b~0 := 0;~c~0 := 0;~st~0 := 0; {85535#(and (= main_~a~0 0) (= main_~b~0 0))} is VALID [2022-04-15 06:33:22,497 INFO L290 TraceCheckUtils]: 6: Hoare triple {85535#(and (= main_~a~0 0) (= main_~b~0 0))} assume !false;~st~0 := 1;~c~0 := 0; {85536#(and (= main_~a~0 0) (= main_~st~0 1) (= main_~b~0 0))} is VALID [2022-04-15 06:33:22,498 INFO L290 TraceCheckUtils]: 7: Hoare triple {85536#(and (= main_~a~0 0) (= main_~st~0 1) (= main_~b~0 0))} [224] L23-3-->L23-4_primed: Formula: (let ((.cse0 (= v_~last~0_322 v_main_~c~0_1533)) (.cse1 (= |v_main_#t~post5_668| |v_main_#t~post5_666|)) (.cse2 (= v_main_~c~0_1533 v_main_~c~0_1532))) (or (and (or (not (< v_main_~c~0_1533 200000)) .cse0) .cse1 .cse2) (and (< v_main_~c~0_1532 200001) (or (not (<= (+ v_main_~c~0_1533 1) v_~last~0_322)) (not (<= (+ v_~last~0_322 1) v_main_~c~0_1532))) (< v_main_~c~0_1533 v_main_~c~0_1532) (not .cse0)) (and (= v_~last~0_322 v_~last~0_322) .cse1 .cse2))) InVars {main_~c~0=v_main_~c~0_1533, main_#t~post5=|v_main_#t~post5_668|, ~last~0=v_~last~0_322} OutVars{main_#t~post5=|v_main_#t~post5_666|, main_~c~0=v_main_~c~0_1532, ~last~0=v_~last~0_322} AuxVars[] AssignedVars[main_#t~post5, main_~c~0] {85536#(and (= main_~a~0 0) (= main_~st~0 1) (= main_~b~0 0))} is VALID [2022-04-15 06:33:22,498 INFO L290 TraceCheckUtils]: 8: Hoare triple {85536#(and (= main_~a~0 0) (= main_~st~0 1) (= main_~b~0 0))} [225] L23-4_primed-->L23-3: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {85536#(and (= main_~a~0 0) (= main_~st~0 1) (= main_~b~0 0))} is VALID [2022-04-15 06:33:22,499 INFO L290 TraceCheckUtils]: 9: Hoare triple {85536#(and (= main_~a~0 0) (= main_~st~0 1) (= main_~b~0 0))} [226] L23-3-->L23-4_primed: Formula: (let ((.cse0 (= v_main_~c~0_1535 v_main_~c~0_1534)) (.cse1 (= |v_main_#t~post5_671| |v_main_#t~post5_667|)) (.cse2 (< v_main_~c~0_1535 200000)) (.cse3 (= v_~last~0_323 v_main_~c~0_1535))) (or (and (= v_main_~st~0_429 v_main_~st~0_428) (= v_~last~0_323 v_~last~0_323) .cse0 .cse1) (and .cse2 (<= v_main_~c~0_1534 (+ v_~last~0_323 1)) .cse3 (= v_main_~st~0_428 0) (< v_main_~c~0_1535 v_main_~c~0_1534)) (and (= v_main_~st~0_428 v_main_~st~0_429) .cse0 .cse1 (or (not .cse2) (not .cse3))))) InVars {main_~c~0=v_main_~c~0_1535, main_#t~post5=|v_main_#t~post5_671|, main_~st~0=v_main_~st~0_429, ~last~0=v_~last~0_323} OutVars{main_#t~post5=|v_main_#t~post5_667|, main_~c~0=v_main_~c~0_1534, main_~st~0=v_main_~st~0_428, ~last~0=v_~last~0_323} AuxVars[] AssignedVars[main_#t~post5, main_~c~0, main_~st~0] {85573#(and (= main_~a~0 0) (= main_~b~0 0) (or (and (< ~last~0 200000) (< ~last~0 main_~c~0) (<= main_~c~0 (+ ~last~0 1)) (= main_~st~0 0)) (= main_~st~0 1)))} is VALID [2022-04-15 06:33:22,500 INFO L290 TraceCheckUtils]: 10: Hoare triple {85573#(and (= main_~a~0 0) (= main_~b~0 0) (or (and (< ~last~0 200000) (< ~last~0 main_~c~0) (<= main_~c~0 (+ ~last~0 1)) (= main_~st~0 0)) (= main_~st~0 1)))} [223] L23-4_primed-->L23-4: Formula: (not (< v_main_~c~0_8 200000)) InVars {main_~c~0=v_main_~c~0_8} OutVars{main_~c~0=v_main_~c~0_8} AuxVars[] AssignedVars[] {85577#(and (= main_~a~0 0) (or (= main_~st~0 1) (and (< ~last~0 200000) (<= main_~c~0 (+ ~last~0 1)) (= main_~st~0 0))) (= main_~b~0 0) (not (< main_~c~0 200000)))} is VALID [2022-04-15 06:33:22,500 INFO L290 TraceCheckUtils]: 11: Hoare triple {85577#(and (= main_~a~0 0) (or (= main_~st~0 1) (and (< ~last~0 200000) (<= main_~c~0 (+ ~last~0 1)) (= main_~st~0 0))) (= main_~b~0 0) (not (< main_~c~0 200000)))} assume 0 == ~st~0 && ~c~0 == 1 + ~last~0;~a~0 := 3 + ~a~0;~b~0 := 3 + ~b~0; {85581#(and (= main_~b~0 3) (<= 200000 main_~c~0) (< main_~c~0 200001) (= main_~a~0 3))} is VALID [2022-04-15 06:33:22,500 INFO L290 TraceCheckUtils]: 12: Hoare triple {85581#(and (= main_~b~0 3) (<= 200000 main_~c~0) (< main_~c~0 200001) (= main_~a~0 3))} assume !(~c~0 == ~last~0 && 0 == ~st~0); {85581#(and (= main_~b~0 3) (<= 200000 main_~c~0) (< main_~c~0 200001) (= main_~a~0 3))} is VALID [2022-04-15 06:33:22,501 INFO L272 TraceCheckUtils]: 13: Hoare triple {85581#(and (= main_~b~0 3) (<= 200000 main_~c~0) (< main_~c~0 200001) (= main_~a~0 3))} call __VERIFIER_assert((if ~a~0 == ~b~0 && 200000 == ~c~0 then 1 else 0)); {85588#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-15 06:33:22,501 INFO L290 TraceCheckUtils]: 14: Hoare triple {85588#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {85592#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-15 06:33:22,502 INFO L290 TraceCheckUtils]: 15: Hoare triple {85592#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {85531#false} is VALID [2022-04-15 06:33:22,502 INFO L290 TraceCheckUtils]: 16: Hoare triple {85531#false} assume !false; {85531#false} is VALID [2022-04-15 06:33:22,502 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-04-15 06:33:22,502 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 06:33:22,838 INFO L290 TraceCheckUtils]: 16: Hoare triple {85531#false} assume !false; {85531#false} is VALID [2022-04-15 06:33:22,838 INFO L290 TraceCheckUtils]: 15: Hoare triple {85592#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {85531#false} is VALID [2022-04-15 06:33:22,838 INFO L290 TraceCheckUtils]: 14: Hoare triple {85588#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {85592#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-15 06:33:22,839 INFO L272 TraceCheckUtils]: 13: Hoare triple {85539#(and (<= main_~b~0 main_~a~0) (< main_~a~0 (+ main_~b~0 1)) (< 199999 main_~c~0) (<= main_~c~0 200000))} call __VERIFIER_assert((if ~a~0 == ~b~0 && 200000 == ~c~0 then 1 else 0)); {85588#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-15 06:33:22,839 INFO L290 TraceCheckUtils]: 12: Hoare triple {85539#(and (<= main_~b~0 main_~a~0) (< main_~a~0 (+ main_~b~0 1)) (< 199999 main_~c~0) (<= main_~c~0 200000))} assume !(~c~0 == ~last~0 && 0 == ~st~0); {85539#(and (<= main_~b~0 main_~a~0) (< main_~a~0 (+ main_~b~0 1)) (< 199999 main_~c~0) (<= main_~c~0 200000))} is VALID [2022-04-15 06:33:22,840 INFO L290 TraceCheckUtils]: 11: Hoare triple {85614#(or (not (<= main_~c~0 (+ ~last~0 1))) (and (<= main_~b~0 main_~a~0) (< main_~a~0 (+ main_~b~0 1)) (< 199999 main_~c~0) (<= main_~c~0 200000)) (not (= main_~st~0 0)))} assume 0 == ~st~0 && ~c~0 == 1 + ~last~0;~a~0 := 3 + ~a~0;~b~0 := 3 + ~b~0; {85539#(and (<= main_~b~0 main_~a~0) (< main_~a~0 (+ main_~b~0 1)) (< 199999 main_~c~0) (<= main_~c~0 200000))} is VALID [2022-04-15 06:33:22,840 INFO L290 TraceCheckUtils]: 10: Hoare triple {85618#(or (not (<= main_~c~0 (+ ~last~0 1))) (and (<= main_~b~0 main_~a~0) (< main_~a~0 (+ main_~b~0 1)) (<= main_~c~0 200000)) (not (= main_~st~0 0)) (< main_~c~0 200000))} [223] L23-4_primed-->L23-4: Formula: (not (< v_main_~c~0_8 200000)) InVars {main_~c~0=v_main_~c~0_8} OutVars{main_~c~0=v_main_~c~0_8} AuxVars[] AssignedVars[] {85614#(or (not (<= main_~c~0 (+ ~last~0 1))) (and (<= main_~b~0 main_~a~0) (< main_~a~0 (+ main_~b~0 1)) (< 199999 main_~c~0) (<= main_~c~0 200000)) (not (= main_~st~0 0)))} is VALID [2022-04-15 06:33:22,841 INFO L290 TraceCheckUtils]: 9: Hoare triple {85622#(and (<= main_~b~0 main_~a~0) (< main_~a~0 (+ main_~b~0 1)) (not (= main_~st~0 0)))} [226] L23-3-->L23-4_primed: Formula: (let ((.cse0 (= v_main_~c~0_1535 v_main_~c~0_1534)) (.cse1 (= |v_main_#t~post5_671| |v_main_#t~post5_667|)) (.cse2 (< v_main_~c~0_1535 200000)) (.cse3 (= v_~last~0_323 v_main_~c~0_1535))) (or (and (= v_main_~st~0_429 v_main_~st~0_428) (= v_~last~0_323 v_~last~0_323) .cse0 .cse1) (and .cse2 (<= v_main_~c~0_1534 (+ v_~last~0_323 1)) .cse3 (= v_main_~st~0_428 0) (< v_main_~c~0_1535 v_main_~c~0_1534)) (and (= v_main_~st~0_428 v_main_~st~0_429) .cse0 .cse1 (or (not .cse2) (not .cse3))))) InVars {main_~c~0=v_main_~c~0_1535, main_#t~post5=|v_main_#t~post5_671|, main_~st~0=v_main_~st~0_429, ~last~0=v_~last~0_323} OutVars{main_#t~post5=|v_main_#t~post5_667|, main_~c~0=v_main_~c~0_1534, main_~st~0=v_main_~st~0_428, ~last~0=v_~last~0_323} AuxVars[] AssignedVars[main_#t~post5, main_~c~0, main_~st~0] {85618#(or (not (<= main_~c~0 (+ ~last~0 1))) (and (<= main_~b~0 main_~a~0) (< main_~a~0 (+ main_~b~0 1)) (<= main_~c~0 200000)) (not (= main_~st~0 0)) (< main_~c~0 200000))} is VALID [2022-04-15 06:33:22,841 INFO L290 TraceCheckUtils]: 8: Hoare triple {85622#(and (<= main_~b~0 main_~a~0) (< main_~a~0 (+ main_~b~0 1)) (not (= main_~st~0 0)))} [225] L23-4_primed-->L23-3: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {85622#(and (<= main_~b~0 main_~a~0) (< main_~a~0 (+ main_~b~0 1)) (not (= main_~st~0 0)))} is VALID [2022-04-15 06:33:22,842 INFO L290 TraceCheckUtils]: 7: Hoare triple {85622#(and (<= main_~b~0 main_~a~0) (< main_~a~0 (+ main_~b~0 1)) (not (= main_~st~0 0)))} [224] L23-3-->L23-4_primed: Formula: (let ((.cse0 (= v_~last~0_322 v_main_~c~0_1533)) (.cse1 (= |v_main_#t~post5_668| |v_main_#t~post5_666|)) (.cse2 (= v_main_~c~0_1533 v_main_~c~0_1532))) (or (and (or (not (< v_main_~c~0_1533 200000)) .cse0) .cse1 .cse2) (and (< v_main_~c~0_1532 200001) (or (not (<= (+ v_main_~c~0_1533 1) v_~last~0_322)) (not (<= (+ v_~last~0_322 1) v_main_~c~0_1532))) (< v_main_~c~0_1533 v_main_~c~0_1532) (not .cse0)) (and (= v_~last~0_322 v_~last~0_322) .cse1 .cse2))) InVars {main_~c~0=v_main_~c~0_1533, main_#t~post5=|v_main_#t~post5_668|, ~last~0=v_~last~0_322} OutVars{main_#t~post5=|v_main_#t~post5_666|, main_~c~0=v_main_~c~0_1532, ~last~0=v_~last~0_322} AuxVars[] AssignedVars[main_#t~post5, main_~c~0] {85622#(and (<= main_~b~0 main_~a~0) (< main_~a~0 (+ main_~b~0 1)) (not (= main_~st~0 0)))} is VALID [2022-04-15 06:33:22,842 INFO L290 TraceCheckUtils]: 6: Hoare triple {85632#(and (<= main_~b~0 main_~a~0) (< main_~a~0 (+ main_~b~0 1)))} assume !false;~st~0 := 1;~c~0 := 0; {85622#(and (<= main_~b~0 main_~a~0) (< main_~a~0 (+ main_~b~0 1)) (not (= main_~st~0 0)))} is VALID [2022-04-15 06:33:22,842 INFO L290 TraceCheckUtils]: 5: Hoare triple {85530#true} assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~last~0 := #t~nondet4;havoc #t~nondet4;~a~0 := 0;~b~0 := 0;~c~0 := 0;~st~0 := 0; {85632#(and (<= main_~b~0 main_~a~0) (< main_~a~0 (+ main_~b~0 1)))} is VALID [2022-04-15 06:33:22,842 INFO L272 TraceCheckUtils]: 4: Hoare triple {85530#true} call #t~ret6 := main(); {85530#true} is VALID [2022-04-15 06:33:22,842 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {85530#true} {85530#true} #66#return; {85530#true} is VALID [2022-04-15 06:33:22,842 INFO L290 TraceCheckUtils]: 2: Hoare triple {85530#true} assume true; {85530#true} is VALID [2022-04-15 06:33:22,842 INFO L290 TraceCheckUtils]: 1: Hoare triple {85530#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(11, 2);call #Ultimate.allocInit(12, 3);~last~0 := 0; {85530#true} is VALID [2022-04-15 06:33:22,842 INFO L272 TraceCheckUtils]: 0: Hoare triple {85530#true} call ULTIMATE.init(); {85530#true} is VALID [2022-04-15 06:33:22,842 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-04-15 06:33:22,843 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [317829208] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 06:33:22,843 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 06:33:22,843 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9, 9] total 19 [2022-04-15 06:33:25,618 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 06:33:25,618 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [563160083] [2022-04-15 06:33:25,618 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [563160083] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 06:33:25,619 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 06:33:25,619 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [72] imperfect sequences [] total 72 [2022-04-15 06:33:25,619 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [433310252] [2022-04-15 06:33:25,619 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 06:33:25,619 INFO L78 Accepts]: Start accepts. Automaton has has 72 states, 72 states have (on average 1.4305555555555556) internal successors, (103), 70 states have internal predecessors, (103), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 107 [2022-04-15 06:33:25,619 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 06:33:25,619 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 72 states, 72 states have (on average 1.4305555555555556) internal successors, (103), 70 states have internal predecessors, (103), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:33:25,671 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 107 edges. 107 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 06:33:25,671 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 72 states [2022-04-15 06:33:25,671 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 06:33:25,671 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 72 interpolants. [2022-04-15 06:33:25,672 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=546, Invalid=6096, Unknown=0, NotChecked=0, Total=6642 [2022-04-15 06:33:25,672 INFO L87 Difference]: Start difference. First operand 555 states and 620 transitions. Second operand has 72 states, 72 states have (on average 1.4305555555555556) internal successors, (103), 70 states have internal predecessors, (103), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:33:41,605 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:33:41,605 INFO L93 Difference]: Finished difference Result 712 states and 801 transitions. [2022-04-15 06:33:41,605 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 104 states. [2022-04-15 06:33:41,605 INFO L78 Accepts]: Start accepts. Automaton has has 72 states, 72 states have (on average 1.4305555555555556) internal successors, (103), 70 states have internal predecessors, (103), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 107 [2022-04-15 06:33:41,606 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 06:33:41,606 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 72 states, 72 states have (on average 1.4305555555555556) internal successors, (103), 70 states have internal predecessors, (103), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:33:41,607 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 225 transitions. [2022-04-15 06:33:41,607 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 72 states, 72 states have (on average 1.4305555555555556) internal successors, (103), 70 states have internal predecessors, (103), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:33:41,608 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 225 transitions. [2022-04-15 06:33:41,608 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 104 states and 225 transitions. [2022-04-15 06:33:41,739 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-15 06:33:41,753 INFO L225 Difference]: With dead ends: 712 [2022-04-15 06:33:41,753 INFO L226 Difference]: Without dead ends: 608 [2022-04-15 06:33:41,753 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 173 GetRequests, 57 SyntacticMatches, 2 SemanticMatches, 114 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3775 ImplicationChecksByTransitivity, 3.9s TimeCoverageRelationStatistics Valid=873, Invalid=12467, Unknown=0, NotChecked=0, Total=13340 [2022-04-15 06:33:41,754 INFO L913 BasicCegarLoop]: 16 mSDtfsCounter, 130 mSDsluCounter, 235 mSDsCounter, 0 mSdLazyCounter, 10050 mSolverCounterSat, 137 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 132 SdHoareTripleChecker+Valid, 251 SdHoareTripleChecker+Invalid, 10187 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 137 IncrementalHoareTripleChecker+Valid, 10050 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6.2s IncrementalHoareTripleChecker+Time [2022-04-15 06:33:41,754 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [132 Valid, 251 Invalid, 10187 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [137 Valid, 10050 Invalid, 0 Unknown, 0 Unchecked, 6.2s Time] [2022-04-15 06:33:41,754 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 608 states. [2022-04-15 06:33:43,739 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 608 to 558. [2022-04-15 06:33:43,739 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 06:33:43,740 INFO L82 GeneralOperation]: Start isEquivalent. First operand 608 states. Second operand has 558 states, 550 states have (on average 1.1218181818181818) internal successors, (617), 551 states have internal predecessors, (617), 4 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-15 06:33:43,740 INFO L74 IsIncluded]: Start isIncluded. First operand 608 states. Second operand has 558 states, 550 states have (on average 1.1218181818181818) internal successors, (617), 551 states have internal predecessors, (617), 4 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-15 06:33:43,741 INFO L87 Difference]: Start difference. First operand 608 states. Second operand has 558 states, 550 states have (on average 1.1218181818181818) internal successors, (617), 551 states have internal predecessors, (617), 4 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-15 06:33:43,751 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:33:43,751 INFO L93 Difference]: Finished difference Result 608 states and 676 transitions. [2022-04-15 06:33:43,752 INFO L276 IsEmpty]: Start isEmpty. Operand 608 states and 676 transitions. [2022-04-15 06:33:43,752 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 06:33:43,752 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 06:33:43,752 INFO L74 IsIncluded]: Start isIncluded. First operand has 558 states, 550 states have (on average 1.1218181818181818) internal successors, (617), 551 states have internal predecessors, (617), 4 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) Second operand 608 states. [2022-04-15 06:33:43,753 INFO L87 Difference]: Start difference. First operand has 558 states, 550 states have (on average 1.1218181818181818) internal successors, (617), 551 states have internal predecessors, (617), 4 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) Second operand 608 states. [2022-04-15 06:33:43,764 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:33:43,764 INFO L93 Difference]: Finished difference Result 608 states and 676 transitions. [2022-04-15 06:33:43,765 INFO L276 IsEmpty]: Start isEmpty. Operand 608 states and 676 transitions. [2022-04-15 06:33:43,765 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 06:33:43,765 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 06:33:43,765 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 06:33:43,765 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 06:33:43,765 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 558 states, 550 states have (on average 1.1218181818181818) internal successors, (617), 551 states have internal predecessors, (617), 4 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-15 06:33:43,778 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 558 states to 558 states and 624 transitions. [2022-04-15 06:33:43,778 INFO L78 Accepts]: Start accepts. Automaton has 558 states and 624 transitions. Word has length 107 [2022-04-15 06:33:43,778 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 06:33:43,778 INFO L478 AbstractCegarLoop]: Abstraction has 558 states and 624 transitions. [2022-04-15 06:33:43,778 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 72 states, 72 states have (on average 1.4305555555555556) internal successors, (103), 70 states have internal predecessors, (103), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:33:43,778 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 558 states and 624 transitions. [2022-04-15 06:33:45,600 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 624 edges. 624 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 06:33:45,600 INFO L276 IsEmpty]: Start isEmpty. Operand 558 states and 624 transitions. [2022-04-15 06:33:45,601 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2022-04-15 06:33:45,601 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 06:33:45,601 INFO L499 BasicCegarLoop]: trace histogram [32, 32, 31, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 06:33:45,617 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (45)] Forceful destruction successful, exit code 0 [2022-04-15 06:33:45,816 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 45 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable48 [2022-04-15 06:33:45,817 INFO L403 AbstractCegarLoop]: === Iteration 50 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 06:33:45,817 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 06:33:45,817 INFO L85 PathProgramCache]: Analyzing trace with hash 580199719, now seen corresponding path program 31 times [2022-04-15 06:33:45,817 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 06:33:45,817 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1835205306] [2022-04-15 06:33:48,345 WARN L970 rdanLoopAcceleration]: Unable to prove correctness of quantifier elimination. [2022-04-15 06:33:48,448 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 1 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-15 06:33:48,632 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {0={1=1}, 1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-15 06:33:48,632 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-15 06:33:48,634 INFO L85 PathProgramCache]: Analyzing trace with hash 1196401736, now seen corresponding path program 1 times [2022-04-15 06:33:48,634 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 06:33:48,634 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [494613692] [2022-04-15 06:33:48,635 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 06:33:48,635 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 06:33:48,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:33:48,780 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 06:33:48,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:33:48,783 INFO L290 TraceCheckUtils]: 0: Hoare triple {89552#(and (= ~last~0 |old(~last~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(11, 2);call #Ultimate.allocInit(12, 3);~last~0 := 0; {89540#true} is VALID [2022-04-15 06:33:48,784 INFO L290 TraceCheckUtils]: 1: Hoare triple {89540#true} assume true; {89540#true} is VALID [2022-04-15 06:33:48,784 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {89540#true} {89540#true} #66#return; {89540#true} is VALID [2022-04-15 06:33:48,784 INFO L272 TraceCheckUtils]: 0: Hoare triple {89540#true} call ULTIMATE.init(); {89552#(and (= ~last~0 |old(~last~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 06:33:48,784 INFO L290 TraceCheckUtils]: 1: Hoare triple {89552#(and (= ~last~0 |old(~last~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(11, 2);call #Ultimate.allocInit(12, 3);~last~0 := 0; {89540#true} is VALID [2022-04-15 06:33:48,784 INFO L290 TraceCheckUtils]: 2: Hoare triple {89540#true} assume true; {89540#true} is VALID [2022-04-15 06:33:48,784 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {89540#true} {89540#true} #66#return; {89540#true} is VALID [2022-04-15 06:33:48,784 INFO L272 TraceCheckUtils]: 4: Hoare triple {89540#true} call #t~ret6 := main(); {89540#true} is VALID [2022-04-15 06:33:48,785 INFO L290 TraceCheckUtils]: 5: Hoare triple {89540#true} assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~last~0 := #t~nondet4;havoc #t~nondet4;~a~0 := 0;~b~0 := 0;~c~0 := 0;~st~0 := 0; {89545#(and (= main_~a~0 0) (= main_~b~0 0))} is VALID [2022-04-15 06:33:48,785 INFO L290 TraceCheckUtils]: 6: Hoare triple {89545#(and (= main_~a~0 0) (= main_~b~0 0))} assume !false;~st~0 := 1;~c~0 := 0; {89546#(and (= main_~a~0 0) (= main_~st~0 1) (= main_~b~0 0))} is VALID [2022-04-15 06:33:48,786 INFO L290 TraceCheckUtils]: 7: Hoare triple {89546#(and (= main_~a~0 0) (= main_~st~0 1) (= main_~b~0 0))} [228] L23-3-->L23-4_primed: Formula: (let ((.cse0 (= v_main_~c~0_1581 v_main_~c~0_1580)) (.cse1 (= v_~last~0_330 v_main_~c~0_1581))) (or (and .cse0 (= |v_main_#t~post5_679| |v_main_#t~post5_681|) (or .cse1 (not (< v_main_~c~0_1581 200000)))) (and (= v_~last~0_330 v_~last~0_330) .cse0 (= |v_main_#t~post5_681| |v_main_#t~post5_679|)) (and (< v_main_~c~0_1581 v_main_~c~0_1580) (< v_main_~c~0_1580 200001) (or (not (<= (+ v_main_~c~0_1581 1) v_~last~0_330)) (not (<= (+ v_~last~0_330 1) v_main_~c~0_1580))) (not .cse1)))) InVars {main_~c~0=v_main_~c~0_1581, main_#t~post5=|v_main_#t~post5_681|, ~last~0=v_~last~0_330} OutVars{main_#t~post5=|v_main_#t~post5_679|, main_~c~0=v_main_~c~0_1580, ~last~0=v_~last~0_330} AuxVars[] AssignedVars[main_#t~post5, main_~c~0] {89546#(and (= main_~a~0 0) (= main_~st~0 1) (= main_~b~0 0))} is VALID [2022-04-15 06:33:48,786 INFO L290 TraceCheckUtils]: 8: Hoare triple {89546#(and (= main_~a~0 0) (= main_~st~0 1) (= main_~b~0 0))} [229] L23-4_primed-->L23-3: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {89546#(and (= main_~a~0 0) (= main_~st~0 1) (= main_~b~0 0))} is VALID [2022-04-15 06:33:48,787 INFO L290 TraceCheckUtils]: 9: Hoare triple {89546#(and (= main_~a~0 0) (= main_~st~0 1) (= main_~b~0 0))} [230] L23-3-->L23-4_primed: Formula: (let ((.cse1 (= v_~last~0_331 v_main_~c~0_1583)) (.cse0 (< v_main_~c~0_1583 200000)) (.cse2 (= |v_main_#t~post5_684| |v_main_#t~post5_680|)) (.cse3 (= v_main_~st~0_439 v_main_~st~0_438)) (.cse4 (= v_main_~c~0_1583 v_main_~c~0_1582))) (or (and (= v_main_~st~0_438 0) (< v_main_~c~0_1583 v_main_~c~0_1582) (< v_main_~c~0_1582 (+ 2 v_main_~c~0_1583)) .cse0 .cse1) (and .cse2 .cse3 (or (not .cse1) (not .cse0)) .cse4) (and .cse2 .cse3 (= v_~last~0_331 v_~last~0_331) .cse4))) InVars {main_~c~0=v_main_~c~0_1583, main_#t~post5=|v_main_#t~post5_684|, main_~st~0=v_main_~st~0_439, ~last~0=v_~last~0_331} OutVars{main_#t~post5=|v_main_#t~post5_680|, main_~c~0=v_main_~c~0_1582, main_~st~0=v_main_~st~0_438, ~last~0=v_~last~0_331} AuxVars[] AssignedVars[main_#t~post5, main_~c~0, main_~st~0] {89547#(or (= main_~st~0 1) (and (= main_~a~0 0) (or (<= ~last~0 199999) (<= main_~c~0 200000)) (= main_~b~0 0)))} is VALID [2022-04-15 06:33:48,787 INFO L290 TraceCheckUtils]: 10: Hoare triple {89547#(or (= main_~st~0 1) (and (= main_~a~0 0) (or (<= ~last~0 199999) (<= main_~c~0 200000)) (= main_~b~0 0)))} [227] L23-4_primed-->L23-4: Formula: (not (< v_main_~c~0_8 200000)) InVars {main_~c~0=v_main_~c~0_8} OutVars{main_~c~0=v_main_~c~0_8} AuxVars[] AssignedVars[] {89548#(or (= main_~st~0 1) (and (= main_~a~0 0) (or (<= ~last~0 199999) (<= main_~c~0 200000)) (= main_~b~0 0) (< 199999 main_~c~0)))} is VALID [2022-04-15 06:33:48,788 INFO L290 TraceCheckUtils]: 11: Hoare triple {89548#(or (= main_~st~0 1) (and (= main_~a~0 0) (or (<= ~last~0 199999) (<= main_~c~0 200000)) (= main_~b~0 0) (< 199999 main_~c~0)))} assume 0 == ~st~0 && ~c~0 == 1 + ~last~0;~a~0 := 3 + ~a~0;~b~0 := 3 + ~b~0; {89549#(and (<= main_~b~0 main_~a~0) (< main_~a~0 (+ main_~b~0 1)) (< 199999 main_~c~0) (<= main_~c~0 200000))} is VALID [2022-04-15 06:33:48,788 INFO L290 TraceCheckUtils]: 12: Hoare triple {89549#(and (<= main_~b~0 main_~a~0) (< main_~a~0 (+ main_~b~0 1)) (< 199999 main_~c~0) (<= main_~c~0 200000))} assume !(~c~0 == ~last~0 && 0 == ~st~0); {89549#(and (<= main_~b~0 main_~a~0) (< main_~a~0 (+ main_~b~0 1)) (< 199999 main_~c~0) (<= main_~c~0 200000))} is VALID [2022-04-15 06:33:48,789 INFO L272 TraceCheckUtils]: 13: Hoare triple {89549#(and (<= main_~b~0 main_~a~0) (< main_~a~0 (+ main_~b~0 1)) (< 199999 main_~c~0) (<= main_~c~0 200000))} call __VERIFIER_assert((if ~a~0 == ~b~0 && 200000 == ~c~0 then 1 else 0)); {89550#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-15 06:33:48,789 INFO L290 TraceCheckUtils]: 14: Hoare triple {89550#(not (= |__VERIFIER_assert_#in~cond| 0))} ~cond := #in~cond; {89551#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-15 06:33:48,789 INFO L290 TraceCheckUtils]: 15: Hoare triple {89551#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {89541#false} is VALID [2022-04-15 06:33:48,789 INFO L290 TraceCheckUtils]: 16: Hoare triple {89541#false} assume !false; {89541#false} is VALID [2022-04-15 06:33:48,790 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-04-15 06:33:48,790 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 06:33:48,790 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [494613692] [2022-04-15 06:33:48,790 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [494613692] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 06:33:48,790 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [495992601] [2022-04-15 06:33:48,790 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 06:33:48,790 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 06:33:48,790 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 06:33:48,791 INFO L229 MonitoredProcess]: Starting monitored process 46 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-15 06:33:48,793 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (46)] Waiting until timeout for monitored process [2022-04-15 06:33:48,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:33:48,822 INFO L263 TraceCheckSpWp]: Trace formula consists of 85 conjuncts, 18 conjunts are in the unsatisfiable core [2022-04-15 06:33:48,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:33:48,829 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 06:33:49,105 INFO L272 TraceCheckUtils]: 0: Hoare triple {89540#true} call ULTIMATE.init(); {89540#true} is VALID [2022-04-15 06:33:49,106 INFO L290 TraceCheckUtils]: 1: Hoare triple {89540#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(11, 2);call #Ultimate.allocInit(12, 3);~last~0 := 0; {89540#true} is VALID [2022-04-15 06:33:49,106 INFO L290 TraceCheckUtils]: 2: Hoare triple {89540#true} assume true; {89540#true} is VALID [2022-04-15 06:33:49,106 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {89540#true} {89540#true} #66#return; {89540#true} is VALID [2022-04-15 06:33:49,106 INFO L272 TraceCheckUtils]: 4: Hoare triple {89540#true} call #t~ret6 := main(); {89540#true} is VALID [2022-04-15 06:33:49,106 INFO L290 TraceCheckUtils]: 5: Hoare triple {89540#true} assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~last~0 := #t~nondet4;havoc #t~nondet4;~a~0 := 0;~b~0 := 0;~c~0 := 0;~st~0 := 0; {89545#(and (= main_~a~0 0) (= main_~b~0 0))} is VALID [2022-04-15 06:33:49,107 INFO L290 TraceCheckUtils]: 6: Hoare triple {89545#(and (= main_~a~0 0) (= main_~b~0 0))} assume !false;~st~0 := 1;~c~0 := 0; {89546#(and (= main_~a~0 0) (= main_~st~0 1) (= main_~b~0 0))} is VALID [2022-04-15 06:33:49,107 INFO L290 TraceCheckUtils]: 7: Hoare triple {89546#(and (= main_~a~0 0) (= main_~st~0 1) (= main_~b~0 0))} [228] L23-3-->L23-4_primed: Formula: (let ((.cse0 (= v_main_~c~0_1581 v_main_~c~0_1580)) (.cse1 (= v_~last~0_330 v_main_~c~0_1581))) (or (and .cse0 (= |v_main_#t~post5_679| |v_main_#t~post5_681|) (or .cse1 (not (< v_main_~c~0_1581 200000)))) (and (= v_~last~0_330 v_~last~0_330) .cse0 (= |v_main_#t~post5_681| |v_main_#t~post5_679|)) (and (< v_main_~c~0_1581 v_main_~c~0_1580) (< v_main_~c~0_1580 200001) (or (not (<= (+ v_main_~c~0_1581 1) v_~last~0_330)) (not (<= (+ v_~last~0_330 1) v_main_~c~0_1580))) (not .cse1)))) InVars {main_~c~0=v_main_~c~0_1581, main_#t~post5=|v_main_#t~post5_681|, ~last~0=v_~last~0_330} OutVars{main_#t~post5=|v_main_#t~post5_679|, main_~c~0=v_main_~c~0_1580, ~last~0=v_~last~0_330} AuxVars[] AssignedVars[main_#t~post5, main_~c~0] {89546#(and (= main_~a~0 0) (= main_~st~0 1) (= main_~b~0 0))} is VALID [2022-04-15 06:33:49,107 INFO L290 TraceCheckUtils]: 8: Hoare triple {89546#(and (= main_~a~0 0) (= main_~st~0 1) (= main_~b~0 0))} [229] L23-4_primed-->L23-3: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {89546#(and (= main_~a~0 0) (= main_~st~0 1) (= main_~b~0 0))} is VALID [2022-04-15 06:33:49,108 INFO L290 TraceCheckUtils]: 9: Hoare triple {89546#(and (= main_~a~0 0) (= main_~st~0 1) (= main_~b~0 0))} [230] L23-3-->L23-4_primed: Formula: (let ((.cse1 (= v_~last~0_331 v_main_~c~0_1583)) (.cse0 (< v_main_~c~0_1583 200000)) (.cse2 (= |v_main_#t~post5_684| |v_main_#t~post5_680|)) (.cse3 (= v_main_~st~0_439 v_main_~st~0_438)) (.cse4 (= v_main_~c~0_1583 v_main_~c~0_1582))) (or (and (= v_main_~st~0_438 0) (< v_main_~c~0_1583 v_main_~c~0_1582) (< v_main_~c~0_1582 (+ 2 v_main_~c~0_1583)) .cse0 .cse1) (and .cse2 .cse3 (or (not .cse1) (not .cse0)) .cse4) (and .cse2 .cse3 (= v_~last~0_331 v_~last~0_331) .cse4))) InVars {main_~c~0=v_main_~c~0_1583, main_#t~post5=|v_main_#t~post5_684|, main_~st~0=v_main_~st~0_439, ~last~0=v_~last~0_331} OutVars{main_#t~post5=|v_main_#t~post5_680|, main_~c~0=v_main_~c~0_1582, main_~st~0=v_main_~st~0_438, ~last~0=v_~last~0_331} AuxVars[] AssignedVars[main_#t~post5, main_~c~0, main_~st~0] {89583#(and (= main_~a~0 0) (= main_~b~0 0) (or (= main_~st~0 1) (and (< ~last~0 200000) (< ~last~0 main_~c~0) (< main_~c~0 (+ ~last~0 2)) (= main_~st~0 0))))} is VALID [2022-04-15 06:33:49,109 INFO L290 TraceCheckUtils]: 10: Hoare triple {89583#(and (= main_~a~0 0) (= main_~b~0 0) (or (= main_~st~0 1) (and (< ~last~0 200000) (< ~last~0 main_~c~0) (< main_~c~0 (+ ~last~0 2)) (= main_~st~0 0))))} [227] L23-4_primed-->L23-4: Formula: (not (< v_main_~c~0_8 200000)) InVars {main_~c~0=v_main_~c~0_8} OutVars{main_~c~0=v_main_~c~0_8} AuxVars[] AssignedVars[] {89587#(and (= main_~a~0 0) (or (and (< ~last~0 200000) (< main_~c~0 (+ ~last~0 2)) (= main_~st~0 0)) (= main_~st~0 1)) (= main_~b~0 0) (not (< main_~c~0 200000)))} is VALID [2022-04-15 06:33:49,109 INFO L290 TraceCheckUtils]: 11: Hoare triple {89587#(and (= main_~a~0 0) (or (and (< ~last~0 200000) (< main_~c~0 (+ ~last~0 2)) (= main_~st~0 0)) (= main_~st~0 1)) (= main_~b~0 0) (not (< main_~c~0 200000)))} assume 0 == ~st~0 && ~c~0 == 1 + ~last~0;~a~0 := 3 + ~a~0;~b~0 := 3 + ~b~0; {89591#(and (= main_~b~0 3) (<= 200000 main_~c~0) (< main_~c~0 200001) (= main_~a~0 3))} is VALID [2022-04-15 06:33:49,110 INFO L290 TraceCheckUtils]: 12: Hoare triple {89591#(and (= main_~b~0 3) (<= 200000 main_~c~0) (< main_~c~0 200001) (= main_~a~0 3))} assume !(~c~0 == ~last~0 && 0 == ~st~0); {89591#(and (= main_~b~0 3) (<= 200000 main_~c~0) (< main_~c~0 200001) (= main_~a~0 3))} is VALID [2022-04-15 06:33:49,110 INFO L272 TraceCheckUtils]: 13: Hoare triple {89591#(and (= main_~b~0 3) (<= 200000 main_~c~0) (< main_~c~0 200001) (= main_~a~0 3))} call __VERIFIER_assert((if ~a~0 == ~b~0 && 200000 == ~c~0 then 1 else 0)); {89598#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-15 06:33:49,111 INFO L290 TraceCheckUtils]: 14: Hoare triple {89598#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {89602#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-15 06:33:49,111 INFO L290 TraceCheckUtils]: 15: Hoare triple {89602#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {89541#false} is VALID [2022-04-15 06:33:49,111 INFO L290 TraceCheckUtils]: 16: Hoare triple {89541#false} assume !false; {89541#false} is VALID [2022-04-15 06:33:49,111 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-04-15 06:33:49,111 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 06:33:49,509 INFO L290 TraceCheckUtils]: 16: Hoare triple {89541#false} assume !false; {89541#false} is VALID [2022-04-15 06:33:49,510 INFO L290 TraceCheckUtils]: 15: Hoare triple {89602#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {89541#false} is VALID [2022-04-15 06:33:49,510 INFO L290 TraceCheckUtils]: 14: Hoare triple {89598#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {89602#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-15 06:33:49,511 INFO L272 TraceCheckUtils]: 13: Hoare triple {89549#(and (<= main_~b~0 main_~a~0) (< main_~a~0 (+ main_~b~0 1)) (< 199999 main_~c~0) (<= main_~c~0 200000))} call __VERIFIER_assert((if ~a~0 == ~b~0 && 200000 == ~c~0 then 1 else 0)); {89598#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-15 06:33:49,511 INFO L290 TraceCheckUtils]: 12: Hoare triple {89549#(and (<= main_~b~0 main_~a~0) (< main_~a~0 (+ main_~b~0 1)) (< 199999 main_~c~0) (<= main_~c~0 200000))} assume !(~c~0 == ~last~0 && 0 == ~st~0); {89549#(and (<= main_~b~0 main_~a~0) (< main_~a~0 (+ main_~b~0 1)) (< 199999 main_~c~0) (<= main_~c~0 200000))} is VALID [2022-04-15 06:33:49,512 INFO L290 TraceCheckUtils]: 11: Hoare triple {89624#(or (not (<= main_~c~0 (+ ~last~0 1))) (and (<= main_~b~0 main_~a~0) (< main_~a~0 (+ main_~b~0 1)) (< 199999 main_~c~0) (<= main_~c~0 200000)) (not (= main_~st~0 0)))} assume 0 == ~st~0 && ~c~0 == 1 + ~last~0;~a~0 := 3 + ~a~0;~b~0 := 3 + ~b~0; {89549#(and (<= main_~b~0 main_~a~0) (< main_~a~0 (+ main_~b~0 1)) (< 199999 main_~c~0) (<= main_~c~0 200000))} is VALID [2022-04-15 06:33:49,512 INFO L290 TraceCheckUtils]: 10: Hoare triple {89628#(or (not (<= main_~c~0 (+ ~last~0 1))) (and (<= main_~b~0 main_~a~0) (< main_~a~0 (+ main_~b~0 1)) (<= main_~c~0 200000)) (not (= main_~st~0 0)) (< main_~c~0 200000))} [227] L23-4_primed-->L23-4: Formula: (not (< v_main_~c~0_8 200000)) InVars {main_~c~0=v_main_~c~0_8} OutVars{main_~c~0=v_main_~c~0_8} AuxVars[] AssignedVars[] {89624#(or (not (<= main_~c~0 (+ ~last~0 1))) (and (<= main_~b~0 main_~a~0) (< main_~a~0 (+ main_~b~0 1)) (< 199999 main_~c~0) (<= main_~c~0 200000)) (not (= main_~st~0 0)))} is VALID [2022-04-15 06:33:49,513 INFO L290 TraceCheckUtils]: 9: Hoare triple {89632#(and (<= main_~b~0 main_~a~0) (< main_~a~0 (+ main_~b~0 1)) (not (= main_~st~0 0)))} [230] L23-3-->L23-4_primed: Formula: (let ((.cse1 (= v_~last~0_331 v_main_~c~0_1583)) (.cse0 (< v_main_~c~0_1583 200000)) (.cse2 (= |v_main_#t~post5_684| |v_main_#t~post5_680|)) (.cse3 (= v_main_~st~0_439 v_main_~st~0_438)) (.cse4 (= v_main_~c~0_1583 v_main_~c~0_1582))) (or (and (= v_main_~st~0_438 0) (< v_main_~c~0_1583 v_main_~c~0_1582) (< v_main_~c~0_1582 (+ 2 v_main_~c~0_1583)) .cse0 .cse1) (and .cse2 .cse3 (or (not .cse1) (not .cse0)) .cse4) (and .cse2 .cse3 (= v_~last~0_331 v_~last~0_331) .cse4))) InVars {main_~c~0=v_main_~c~0_1583, main_#t~post5=|v_main_#t~post5_684|, main_~st~0=v_main_~st~0_439, ~last~0=v_~last~0_331} OutVars{main_#t~post5=|v_main_#t~post5_680|, main_~c~0=v_main_~c~0_1582, main_~st~0=v_main_~st~0_438, ~last~0=v_~last~0_331} AuxVars[] AssignedVars[main_#t~post5, main_~c~0, main_~st~0] {89628#(or (not (<= main_~c~0 (+ ~last~0 1))) (and (<= main_~b~0 main_~a~0) (< main_~a~0 (+ main_~b~0 1)) (<= main_~c~0 200000)) (not (= main_~st~0 0)) (< main_~c~0 200000))} is VALID [2022-04-15 06:33:49,514 INFO L290 TraceCheckUtils]: 8: Hoare triple {89632#(and (<= main_~b~0 main_~a~0) (< main_~a~0 (+ main_~b~0 1)) (not (= main_~st~0 0)))} [229] L23-4_primed-->L23-3: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {89632#(and (<= main_~b~0 main_~a~0) (< main_~a~0 (+ main_~b~0 1)) (not (= main_~st~0 0)))} is VALID [2022-04-15 06:33:49,514 INFO L290 TraceCheckUtils]: 7: Hoare triple {89632#(and (<= main_~b~0 main_~a~0) (< main_~a~0 (+ main_~b~0 1)) (not (= main_~st~0 0)))} [228] L23-3-->L23-4_primed: Formula: (let ((.cse0 (= v_main_~c~0_1581 v_main_~c~0_1580)) (.cse1 (= v_~last~0_330 v_main_~c~0_1581))) (or (and .cse0 (= |v_main_#t~post5_679| |v_main_#t~post5_681|) (or .cse1 (not (< v_main_~c~0_1581 200000)))) (and (= v_~last~0_330 v_~last~0_330) .cse0 (= |v_main_#t~post5_681| |v_main_#t~post5_679|)) (and (< v_main_~c~0_1581 v_main_~c~0_1580) (< v_main_~c~0_1580 200001) (or (not (<= (+ v_main_~c~0_1581 1) v_~last~0_330)) (not (<= (+ v_~last~0_330 1) v_main_~c~0_1580))) (not .cse1)))) InVars {main_~c~0=v_main_~c~0_1581, main_#t~post5=|v_main_#t~post5_681|, ~last~0=v_~last~0_330} OutVars{main_#t~post5=|v_main_#t~post5_679|, main_~c~0=v_main_~c~0_1580, ~last~0=v_~last~0_330} AuxVars[] AssignedVars[main_#t~post5, main_~c~0] {89632#(and (<= main_~b~0 main_~a~0) (< main_~a~0 (+ main_~b~0 1)) (not (= main_~st~0 0)))} is VALID [2022-04-15 06:33:49,514 INFO L290 TraceCheckUtils]: 6: Hoare triple {89642#(and (<= main_~b~0 main_~a~0) (< main_~a~0 (+ main_~b~0 1)))} assume !false;~st~0 := 1;~c~0 := 0; {89632#(and (<= main_~b~0 main_~a~0) (< main_~a~0 (+ main_~b~0 1)) (not (= main_~st~0 0)))} is VALID [2022-04-15 06:33:49,515 INFO L290 TraceCheckUtils]: 5: Hoare triple {89540#true} assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~last~0 := #t~nondet4;havoc #t~nondet4;~a~0 := 0;~b~0 := 0;~c~0 := 0;~st~0 := 0; {89642#(and (<= main_~b~0 main_~a~0) (< main_~a~0 (+ main_~b~0 1)))} is VALID [2022-04-15 06:33:49,515 INFO L272 TraceCheckUtils]: 4: Hoare triple {89540#true} call #t~ret6 := main(); {89540#true} is VALID [2022-04-15 06:33:49,515 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {89540#true} {89540#true} #66#return; {89540#true} is VALID [2022-04-15 06:33:49,515 INFO L290 TraceCheckUtils]: 2: Hoare triple {89540#true} assume true; {89540#true} is VALID [2022-04-15 06:33:49,515 INFO L290 TraceCheckUtils]: 1: Hoare triple {89540#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(11, 2);call #Ultimate.allocInit(12, 3);~last~0 := 0; {89540#true} is VALID [2022-04-15 06:33:49,515 INFO L272 TraceCheckUtils]: 0: Hoare triple {89540#true} call ULTIMATE.init(); {89540#true} is VALID [2022-04-15 06:33:49,515 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-04-15 06:33:49,515 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [495992601] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 06:33:49,515 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 06:33:49,516 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9, 9] total 19 [2022-04-15 06:33:52,544 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 06:33:52,544 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1835205306] [2022-04-15 06:33:52,544 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1835205306] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 06:33:52,544 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 06:33:52,544 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [74] imperfect sequences [] total 74 [2022-04-15 06:33:52,544 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [418704302] [2022-04-15 06:33:52,544 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 06:33:52,544 INFO L78 Accepts]: Start accepts. Automaton has has 74 states, 74 states have (on average 1.4324324324324325) internal successors, (106), 72 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-15 06:33:52,545 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 06:33:52,545 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 74 states, 74 states have (on average 1.4324324324324325) internal successors, (106), 72 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-15 06:33:52,624 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 110 edges. 110 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 06:33:52,624 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 74 states [2022-04-15 06:33:52,625 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 06:33:52,625 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 74 interpolants. [2022-04-15 06:33:52,625 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=561, Invalid=6411, Unknown=0, NotChecked=0, Total=6972 [2022-04-15 06:33:52,625 INFO L87 Difference]: Start difference. First operand 558 states and 624 transitions. Second operand has 74 states, 74 states have (on average 1.4324324324324325) internal successors, (106), 72 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-15 06:34:08,150 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:34:08,151 INFO L93 Difference]: Finished difference Result 716 states and 806 transitions. [2022-04-15 06:34:08,151 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 107 states. [2022-04-15 06:34:08,151 INFO L78 Accepts]: Start accepts. Automaton has has 74 states, 74 states have (on average 1.4324324324324325) internal successors, (106), 72 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-15 06:34:08,151 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 06:34:08,151 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 74 states, 74 states have (on average 1.4324324324324325) internal successors, (106), 72 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-15 06:34:08,152 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 230 transitions. [2022-04-15 06:34:08,153 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 74 states, 74 states have (on average 1.4324324324324325) internal successors, (106), 72 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-15 06:34:08,154 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 230 transitions. [2022-04-15 06:34:08,154 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 107 states and 230 transitions. [2022-04-15 06:34:08,294 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-15 06:34:08,309 INFO L225 Difference]: With dead ends: 716 [2022-04-15 06:34:08,309 INFO L226 Difference]: Without dead ends: 612 [2022-04-15 06:34:08,310 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 177 GetRequests, 58 SyntacticMatches, 2 SemanticMatches, 117 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3972 ImplicationChecksByTransitivity, 4.0s TimeCoverageRelationStatistics Valid=898, Invalid=13144, Unknown=0, NotChecked=0, Total=14042 [2022-04-15 06:34:08,310 INFO L913 BasicCegarLoop]: 16 mSDtfsCounter, 137 mSDsluCounter, 231 mSDsCounter, 0 mSdLazyCounter, 10386 mSolverCounterSat, 140 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 139 SdHoareTripleChecker+Valid, 247 SdHoareTripleChecker+Invalid, 10526 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 140 IncrementalHoareTripleChecker+Valid, 10386 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6.1s IncrementalHoareTripleChecker+Time [2022-04-15 06:34:08,310 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [139 Valid, 247 Invalid, 10526 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [140 Valid, 10386 Invalid, 0 Unknown, 0 Unchecked, 6.1s Time] [2022-04-15 06:34:08,311 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 612 states. [2022-04-15 06:34:10,419 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 612 to 561. [2022-04-15 06:34:10,419 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 06:34:10,420 INFO L82 GeneralOperation]: Start isEquivalent. First operand 612 states. Second operand has 561 states, 553 states have (on average 1.1229656419529837) internal successors, (621), 554 states have internal predecessors, (621), 4 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-15 06:34:10,420 INFO L74 IsIncluded]: Start isIncluded. First operand 612 states. Second operand has 561 states, 553 states have (on average 1.1229656419529837) internal successors, (621), 554 states have internal predecessors, (621), 4 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-15 06:34:10,421 INFO L87 Difference]: Start difference. First operand 612 states. Second operand has 561 states, 553 states have (on average 1.1229656419529837) internal successors, (621), 554 states have internal predecessors, (621), 4 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-15 06:34:10,431 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:34:10,431 INFO L93 Difference]: Finished difference Result 612 states and 681 transitions. [2022-04-15 06:34:10,431 INFO L276 IsEmpty]: Start isEmpty. Operand 612 states and 681 transitions. [2022-04-15 06:34:10,432 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 06:34:10,432 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 06:34:10,432 INFO L74 IsIncluded]: Start isIncluded. First operand has 561 states, 553 states have (on average 1.1229656419529837) internal successors, (621), 554 states have internal predecessors, (621), 4 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) Second operand 612 states. [2022-04-15 06:34:10,432 INFO L87 Difference]: Start difference. First operand has 561 states, 553 states have (on average 1.1229656419529837) internal successors, (621), 554 states have internal predecessors, (621), 4 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) Second operand 612 states. [2022-04-15 06:34:10,443 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:34:10,443 INFO L93 Difference]: Finished difference Result 612 states and 681 transitions. [2022-04-15 06:34:10,443 INFO L276 IsEmpty]: Start isEmpty. Operand 612 states and 681 transitions. [2022-04-15 06:34:10,443 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 06:34:10,443 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 06:34:10,443 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 06:34:10,443 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 06:34:10,444 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 561 states, 553 states have (on average 1.1229656419529837) internal successors, (621), 554 states have internal predecessors, (621), 4 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-15 06:34:10,457 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 561 states to 561 states and 628 transitions. [2022-04-15 06:34:10,457 INFO L78 Accepts]: Start accepts. Automaton has 561 states and 628 transitions. Word has length 110 [2022-04-15 06:34:10,457 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 06:34:10,457 INFO L478 AbstractCegarLoop]: Abstraction has 561 states and 628 transitions. [2022-04-15 06:34:10,457 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 74 states, 74 states have (on average 1.4324324324324325) internal successors, (106), 72 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-15 06:34:10,457 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 561 states and 628 transitions. [2022-04-15 06:34:12,258 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 628 edges. 628 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 06:34:12,258 INFO L276 IsEmpty]: Start isEmpty. Operand 561 states and 628 transitions. [2022-04-15 06:34:12,258 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2022-04-15 06:34:12,259 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 06:34:12,259 INFO L499 BasicCegarLoop]: trace histogram [30, 30, 28, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 06:34:12,275 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (46)] Ended with exit code 0 [2022-04-15 06:34:12,474 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 46 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable49 [2022-04-15 06:34:12,475 INFO L403 AbstractCegarLoop]: === Iteration 51 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 06:34:12,475 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 06:34:12,475 INFO L85 PathProgramCache]: Analyzing trace with hash -985575386, now seen corresponding path program 14 times [2022-04-15 06:34:12,475 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 06:34:12,475 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1730393762] [2022-04-15 06:34:12,644 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 4 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {0={1=2}, 1={1=1, 2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-15 06:34:12,644 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-15 06:34:12,644 INFO L85 PathProgramCache]: Analyzing trace with hash 897307128, now seen corresponding path program 1 times [2022-04-15 06:34:12,645 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 06:34:12,645 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1082406879] [2022-04-15 06:34:12,645 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 06:34:12,645 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 06:34:12,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:34:12,805 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 06:34:12,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:34:12,808 INFO L290 TraceCheckUtils]: 0: Hoare triple {93597#(and (= ~last~0 |old(~last~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(11, 2);call #Ultimate.allocInit(12, 3);~last~0 := 0; {93576#true} is VALID [2022-04-15 06:34:12,808 INFO L290 TraceCheckUtils]: 1: Hoare triple {93576#true} assume true; {93576#true} is VALID [2022-04-15 06:34:12,808 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {93576#true} {93576#true} #66#return; {93576#true} is VALID [2022-04-15 06:34:12,809 INFO L272 TraceCheckUtils]: 0: Hoare triple {93576#true} call ULTIMATE.init(); {93597#(and (= ~last~0 |old(~last~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 06:34:12,809 INFO L290 TraceCheckUtils]: 1: Hoare triple {93597#(and (= ~last~0 |old(~last~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(11, 2);call #Ultimate.allocInit(12, 3);~last~0 := 0; {93576#true} is VALID [2022-04-15 06:34:12,809 INFO L290 TraceCheckUtils]: 2: Hoare triple {93576#true} assume true; {93576#true} is VALID [2022-04-15 06:34:12,809 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {93576#true} {93576#true} #66#return; {93576#true} is VALID [2022-04-15 06:34:12,809 INFO L272 TraceCheckUtils]: 4: Hoare triple {93576#true} call #t~ret6 := main(); {93576#true} is VALID [2022-04-15 06:34:12,809 INFO L290 TraceCheckUtils]: 5: Hoare triple {93576#true} assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~last~0 := #t~nondet4;havoc #t~nondet4;~a~0 := 0;~b~0 := 0;~c~0 := 0;~st~0 := 0; {93576#true} is VALID [2022-04-15 06:34:12,809 INFO L290 TraceCheckUtils]: 6: Hoare triple {93576#true} [232] L30-->L23-3_primed: Formula: (let ((.cse0 (= v_main_~a~0_233 v_main_~a~0_232)) (.cse1 (= |v_main_#t~post5_707| |v_main_#t~post5_692|)) (.cse2 (= v_main_~st~0_450 v_main_~st~0_448))) (or (and (= v_main_~c~0_1631 v_main_~c~0_1647) .cse0 (= v_main_~b~0_229 v_main_~b~0_230) .cse1 .cse2) (and .cse0 .cse1 (= v_main_~b~0_230 v_main_~b~0_229) .cse2 (= v_main_~c~0_1647 v_main_~c~0_1631)))) InVars {main_~c~0=v_main_~c~0_1647, main_#t~post5=|v_main_#t~post5_707|, main_~st~0=v_main_~st~0_450, main_~b~0=v_main_~b~0_230, main_~a~0=v_main_~a~0_233} OutVars{main_~c~0=v_main_~c~0_1631, main_#t~post5=|v_main_#t~post5_692|, main_~st~0=v_main_~st~0_448, main_~b~0=v_main_~b~0_229, main_~a~0=v_main_~a~0_232} AuxVars[] AssignedVars[main_~c~0, main_#t~post5, main_~st~0, main_~b~0, main_~a~0] {93576#true} is VALID [2022-04-15 06:34:12,809 INFO L290 TraceCheckUtils]: 7: Hoare triple {93576#true} [231] L23-3_primed-->L23-3: Formula: (and (= v_main_~c~0_7 0) (= v_main_~st~0_6 1)) InVars {} OutVars{main_~c~0=v_main_~c~0_7, main_~st~0=v_main_~st~0_6} AuxVars[] AssignedVars[main_~c~0, main_~st~0] {93581#(= main_~c~0 0)} is VALID [2022-04-15 06:34:12,810 INFO L290 TraceCheckUtils]: 8: Hoare triple {93581#(= main_~c~0 0)} assume !!(~c~0 < 200000); {93581#(= main_~c~0 0)} is VALID [2022-04-15 06:34:12,810 INFO L290 TraceCheckUtils]: 9: Hoare triple {93581#(= main_~c~0 0)} assume ~c~0 == ~last~0;~st~0 := 0; {93581#(= main_~c~0 0)} is VALID [2022-04-15 06:34:12,810 INFO L290 TraceCheckUtils]: 10: Hoare triple {93581#(= main_~c~0 0)} #t~post5 := ~c~0;~c~0 := 1 + #t~post5;havoc #t~post5; {93582#(<= main_~c~0 1)} is VALID [2022-04-15 06:34:12,811 INFO L290 TraceCheckUtils]: 11: Hoare triple {93582#(<= main_~c~0 1)} assume !!(~c~0 < 200000); {93582#(<= main_~c~0 1)} is VALID [2022-04-15 06:34:12,811 INFO L290 TraceCheckUtils]: 12: Hoare triple {93582#(<= main_~c~0 1)} assume !(~c~0 == ~last~0); {93582#(<= main_~c~0 1)} is VALID [2022-04-15 06:34:12,811 INFO L290 TraceCheckUtils]: 13: Hoare triple {93582#(<= main_~c~0 1)} #t~post5 := ~c~0;~c~0 := 1 + #t~post5;havoc #t~post5; {93583#(<= main_~c~0 2)} is VALID [2022-04-15 06:34:12,812 INFO L290 TraceCheckUtils]: 14: Hoare triple {93583#(<= main_~c~0 2)} assume !!(~c~0 < 200000); {93583#(<= main_~c~0 2)} is VALID [2022-04-15 06:34:12,812 INFO L290 TraceCheckUtils]: 15: Hoare triple {93583#(<= main_~c~0 2)} assume !(~c~0 == ~last~0); {93583#(<= main_~c~0 2)} is VALID [2022-04-15 06:34:12,812 INFO L290 TraceCheckUtils]: 16: Hoare triple {93583#(<= main_~c~0 2)} #t~post5 := ~c~0;~c~0 := 1 + #t~post5;havoc #t~post5; {93584#(<= main_~c~0 3)} is VALID [2022-04-15 06:34:12,812 INFO L290 TraceCheckUtils]: 17: Hoare triple {93584#(<= main_~c~0 3)} assume !!(~c~0 < 200000); {93584#(<= main_~c~0 3)} is VALID [2022-04-15 06:34:12,813 INFO L290 TraceCheckUtils]: 18: Hoare triple {93584#(<= main_~c~0 3)} assume !(~c~0 == ~last~0); {93584#(<= main_~c~0 3)} is VALID [2022-04-15 06:34:12,813 INFO L290 TraceCheckUtils]: 19: Hoare triple {93584#(<= main_~c~0 3)} #t~post5 := ~c~0;~c~0 := 1 + #t~post5;havoc #t~post5; {93585#(<= main_~c~0 4)} is VALID [2022-04-15 06:34:12,813 INFO L290 TraceCheckUtils]: 20: Hoare triple {93585#(<= main_~c~0 4)} assume !!(~c~0 < 200000); {93585#(<= main_~c~0 4)} is VALID [2022-04-15 06:34:12,814 INFO L290 TraceCheckUtils]: 21: Hoare triple {93585#(<= main_~c~0 4)} assume !(~c~0 == ~last~0); {93585#(<= main_~c~0 4)} is VALID [2022-04-15 06:34:12,814 INFO L290 TraceCheckUtils]: 22: Hoare triple {93585#(<= main_~c~0 4)} #t~post5 := ~c~0;~c~0 := 1 + #t~post5;havoc #t~post5; {93586#(<= main_~c~0 5)} is VALID [2022-04-15 06:34:12,814 INFO L290 TraceCheckUtils]: 23: Hoare triple {93586#(<= main_~c~0 5)} assume !!(~c~0 < 200000); {93586#(<= main_~c~0 5)} is VALID [2022-04-15 06:34:12,815 INFO L290 TraceCheckUtils]: 24: Hoare triple {93586#(<= main_~c~0 5)} assume !(~c~0 == ~last~0); {93586#(<= main_~c~0 5)} is VALID [2022-04-15 06:34:12,815 INFO L290 TraceCheckUtils]: 25: Hoare triple {93586#(<= main_~c~0 5)} #t~post5 := ~c~0;~c~0 := 1 + #t~post5;havoc #t~post5; {93587#(<= main_~c~0 6)} is VALID [2022-04-15 06:34:12,815 INFO L290 TraceCheckUtils]: 26: Hoare triple {93587#(<= main_~c~0 6)} assume !!(~c~0 < 200000); {93587#(<= main_~c~0 6)} is VALID [2022-04-15 06:34:12,816 INFO L290 TraceCheckUtils]: 27: Hoare triple {93587#(<= main_~c~0 6)} assume !(~c~0 == ~last~0); {93587#(<= main_~c~0 6)} is VALID [2022-04-15 06:34:12,816 INFO L290 TraceCheckUtils]: 28: Hoare triple {93587#(<= main_~c~0 6)} #t~post5 := ~c~0;~c~0 := 1 + #t~post5;havoc #t~post5; {93588#(<= main_~c~0 7)} is VALID [2022-04-15 06:34:12,816 INFO L290 TraceCheckUtils]: 29: Hoare triple {93588#(<= main_~c~0 7)} assume !!(~c~0 < 200000); {93588#(<= main_~c~0 7)} is VALID [2022-04-15 06:34:12,816 INFO L290 TraceCheckUtils]: 30: Hoare triple {93588#(<= main_~c~0 7)} assume !(~c~0 == ~last~0); {93588#(<= main_~c~0 7)} is VALID [2022-04-15 06:34:12,817 INFO L290 TraceCheckUtils]: 31: Hoare triple {93588#(<= main_~c~0 7)} #t~post5 := ~c~0;~c~0 := 1 + #t~post5;havoc #t~post5; {93589#(<= main_~c~0 8)} is VALID [2022-04-15 06:34:12,817 INFO L290 TraceCheckUtils]: 32: Hoare triple {93589#(<= main_~c~0 8)} assume !!(~c~0 < 200000); {93589#(<= main_~c~0 8)} is VALID [2022-04-15 06:34:12,817 INFO L290 TraceCheckUtils]: 33: Hoare triple {93589#(<= main_~c~0 8)} assume !(~c~0 == ~last~0); {93589#(<= main_~c~0 8)} is VALID [2022-04-15 06:34:12,818 INFO L290 TraceCheckUtils]: 34: Hoare triple {93589#(<= main_~c~0 8)} #t~post5 := ~c~0;~c~0 := 1 + #t~post5;havoc #t~post5; {93590#(<= main_~c~0 9)} is VALID [2022-04-15 06:34:12,818 INFO L290 TraceCheckUtils]: 35: Hoare triple {93590#(<= main_~c~0 9)} assume !!(~c~0 < 200000); {93590#(<= main_~c~0 9)} is VALID [2022-04-15 06:34:12,818 INFO L290 TraceCheckUtils]: 36: Hoare triple {93590#(<= main_~c~0 9)} assume !(~c~0 == ~last~0); {93590#(<= main_~c~0 9)} is VALID [2022-04-15 06:34:12,819 INFO L290 TraceCheckUtils]: 37: Hoare triple {93590#(<= main_~c~0 9)} #t~post5 := ~c~0;~c~0 := 1 + #t~post5;havoc #t~post5; {93591#(<= main_~c~0 10)} is VALID [2022-04-15 06:34:12,819 INFO L290 TraceCheckUtils]: 38: Hoare triple {93591#(<= main_~c~0 10)} assume !!(~c~0 < 200000); {93591#(<= main_~c~0 10)} is VALID [2022-04-15 06:34:12,819 INFO L290 TraceCheckUtils]: 39: Hoare triple {93591#(<= main_~c~0 10)} assume !(~c~0 == ~last~0); {93591#(<= main_~c~0 10)} is VALID [2022-04-15 06:34:12,820 INFO L290 TraceCheckUtils]: 40: Hoare triple {93591#(<= main_~c~0 10)} #t~post5 := ~c~0;~c~0 := 1 + #t~post5;havoc #t~post5; {93592#(<= main_~c~0 11)} is VALID [2022-04-15 06:34:12,820 INFO L290 TraceCheckUtils]: 41: Hoare triple {93592#(<= main_~c~0 11)} assume !!(~c~0 < 200000); {93592#(<= main_~c~0 11)} is VALID [2022-04-15 06:34:12,820 INFO L290 TraceCheckUtils]: 42: Hoare triple {93592#(<= main_~c~0 11)} assume !(~c~0 == ~last~0); {93592#(<= main_~c~0 11)} is VALID [2022-04-15 06:34:12,820 INFO L290 TraceCheckUtils]: 43: Hoare triple {93592#(<= main_~c~0 11)} #t~post5 := ~c~0;~c~0 := 1 + #t~post5;havoc #t~post5; {93593#(<= main_~c~0 12)} is VALID [2022-04-15 06:34:12,821 INFO L290 TraceCheckUtils]: 44: Hoare triple {93593#(<= main_~c~0 12)} assume !!(~c~0 < 200000); {93593#(<= main_~c~0 12)} is VALID [2022-04-15 06:34:12,821 INFO L290 TraceCheckUtils]: 45: Hoare triple {93593#(<= main_~c~0 12)} assume !(~c~0 == ~last~0); {93593#(<= main_~c~0 12)} is VALID [2022-04-15 06:34:12,821 INFO L290 TraceCheckUtils]: 46: Hoare triple {93593#(<= main_~c~0 12)} #t~post5 := ~c~0;~c~0 := 1 + #t~post5;havoc #t~post5; {93594#(<= main_~c~0 13)} is VALID [2022-04-15 06:34:12,822 INFO L290 TraceCheckUtils]: 47: Hoare triple {93594#(<= main_~c~0 13)} assume !!(~c~0 < 200000); {93594#(<= main_~c~0 13)} is VALID [2022-04-15 06:34:12,822 INFO L290 TraceCheckUtils]: 48: Hoare triple {93594#(<= main_~c~0 13)} assume !(~c~0 == ~last~0); {93594#(<= main_~c~0 13)} is VALID [2022-04-15 06:34:12,822 INFO L290 TraceCheckUtils]: 49: Hoare triple {93594#(<= main_~c~0 13)} #t~post5 := ~c~0;~c~0 := 1 + #t~post5;havoc #t~post5; {93595#(<= main_~c~0 14)} is VALID [2022-04-15 06:34:12,823 INFO L290 TraceCheckUtils]: 50: Hoare triple {93595#(<= main_~c~0 14)} assume !!(~c~0 < 200000); {93595#(<= main_~c~0 14)} is VALID [2022-04-15 06:34:12,823 INFO L290 TraceCheckUtils]: 51: Hoare triple {93595#(<= main_~c~0 14)} assume !(~c~0 == ~last~0); {93595#(<= main_~c~0 14)} is VALID [2022-04-15 06:34:12,823 INFO L290 TraceCheckUtils]: 52: Hoare triple {93595#(<= main_~c~0 14)} #t~post5 := ~c~0;~c~0 := 1 + #t~post5;havoc #t~post5; {93596#(<= main_~c~0 15)} is VALID [2022-04-15 06:34:12,824 INFO L290 TraceCheckUtils]: 53: Hoare triple {93596#(<= main_~c~0 15)} assume !(~c~0 < 200000); {93577#false} is VALID [2022-04-15 06:34:12,824 INFO L290 TraceCheckUtils]: 54: Hoare triple {93577#false} assume 0 == ~st~0 && ~c~0 == 1 + ~last~0;~a~0 := 3 + ~a~0;~b~0 := 3 + ~b~0; {93577#false} is VALID [2022-04-15 06:34:12,824 INFO L290 TraceCheckUtils]: 55: Hoare triple {93577#false} assume !(~c~0 == ~last~0 && 0 == ~st~0); {93577#false} is VALID [2022-04-15 06:34:12,824 INFO L272 TraceCheckUtils]: 56: Hoare triple {93577#false} call __VERIFIER_assert((if ~a~0 == ~b~0 && 200000 == ~c~0 then 1 else 0)); {93577#false} is VALID [2022-04-15 06:34:12,824 INFO L290 TraceCheckUtils]: 57: Hoare triple {93577#false} ~cond := #in~cond; {93577#false} is VALID [2022-04-15 06:34:12,824 INFO L290 TraceCheckUtils]: 58: Hoare triple {93577#false} assume 0 == ~cond; {93577#false} is VALID [2022-04-15 06:34:12,824 INFO L290 TraceCheckUtils]: 59: Hoare triple {93577#false} assume !false; {93577#false} is VALID [2022-04-15 06:34:12,824 INFO L134 CoverageAnalysis]: Checked inductivity of 330 backedges. 0 proven. 330 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 06:34:12,824 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 06:34:12,824 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1082406879] [2022-04-15 06:34:12,824 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1082406879] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 06:34:12,824 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1039613567] [2022-04-15 06:34:12,824 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 06:34:12,824 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 06:34:12,825 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 06:34:12,825 INFO L229 MonitoredProcess]: Starting monitored process 47 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-15 06:34:12,826 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (47)] Waiting until timeout for monitored process [2022-04-15 06:34:12,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:34:12,864 INFO L263 TraceCheckSpWp]: Trace formula consists of 146 conjuncts, 17 conjunts are in the unsatisfiable core [2022-04-15 06:34:12,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:34:12,875 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 06:34:13,149 INFO L272 TraceCheckUtils]: 0: Hoare triple {93576#true} call ULTIMATE.init(); {93576#true} is VALID [2022-04-15 06:34:13,150 INFO L290 TraceCheckUtils]: 1: Hoare triple {93576#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(11, 2);call #Ultimate.allocInit(12, 3);~last~0 := 0; {93576#true} is VALID [2022-04-15 06:34:13,150 INFO L290 TraceCheckUtils]: 2: Hoare triple {93576#true} assume true; {93576#true} is VALID [2022-04-15 06:34:13,150 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {93576#true} {93576#true} #66#return; {93576#true} is VALID [2022-04-15 06:34:13,150 INFO L272 TraceCheckUtils]: 4: Hoare triple {93576#true} call #t~ret6 := main(); {93576#true} is VALID [2022-04-15 06:34:13,150 INFO L290 TraceCheckUtils]: 5: Hoare triple {93576#true} assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~last~0 := #t~nondet4;havoc #t~nondet4;~a~0 := 0;~b~0 := 0;~c~0 := 0;~st~0 := 0; {93576#true} is VALID [2022-04-15 06:34:13,150 INFO L290 TraceCheckUtils]: 6: Hoare triple {93576#true} [232] L30-->L23-3_primed: Formula: (let ((.cse0 (= v_main_~a~0_233 v_main_~a~0_232)) (.cse1 (= |v_main_#t~post5_707| |v_main_#t~post5_692|)) (.cse2 (= v_main_~st~0_450 v_main_~st~0_448))) (or (and (= v_main_~c~0_1631 v_main_~c~0_1647) .cse0 (= v_main_~b~0_229 v_main_~b~0_230) .cse1 .cse2) (and .cse0 .cse1 (= v_main_~b~0_230 v_main_~b~0_229) .cse2 (= v_main_~c~0_1647 v_main_~c~0_1631)))) InVars {main_~c~0=v_main_~c~0_1647, main_#t~post5=|v_main_#t~post5_707|, main_~st~0=v_main_~st~0_450, main_~b~0=v_main_~b~0_230, main_~a~0=v_main_~a~0_233} OutVars{main_~c~0=v_main_~c~0_1631, main_#t~post5=|v_main_#t~post5_692|, main_~st~0=v_main_~st~0_448, main_~b~0=v_main_~b~0_229, main_~a~0=v_main_~a~0_232} AuxVars[] AssignedVars[main_~c~0, main_#t~post5, main_~st~0, main_~b~0, main_~a~0] {93576#true} is VALID [2022-04-15 06:34:13,150 INFO L290 TraceCheckUtils]: 7: Hoare triple {93576#true} [231] L23-3_primed-->L23-3: Formula: (and (= v_main_~c~0_7 0) (= v_main_~st~0_6 1)) InVars {} OutVars{main_~c~0=v_main_~c~0_7, main_~st~0=v_main_~st~0_6} AuxVars[] AssignedVars[main_~c~0, main_~st~0] {93622#(<= main_~c~0 0)} is VALID [2022-04-15 06:34:13,151 INFO L290 TraceCheckUtils]: 8: Hoare triple {93622#(<= main_~c~0 0)} assume !!(~c~0 < 200000); {93622#(<= main_~c~0 0)} is VALID [2022-04-15 06:34:13,151 INFO L290 TraceCheckUtils]: 9: Hoare triple {93622#(<= main_~c~0 0)} assume ~c~0 == ~last~0;~st~0 := 0; {93622#(<= main_~c~0 0)} is VALID [2022-04-15 06:34:13,151 INFO L290 TraceCheckUtils]: 10: Hoare triple {93622#(<= main_~c~0 0)} #t~post5 := ~c~0;~c~0 := 1 + #t~post5;havoc #t~post5; {93582#(<= main_~c~0 1)} is VALID [2022-04-15 06:34:13,151 INFO L290 TraceCheckUtils]: 11: Hoare triple {93582#(<= main_~c~0 1)} assume !!(~c~0 < 200000); {93582#(<= main_~c~0 1)} is VALID [2022-04-15 06:34:13,152 INFO L290 TraceCheckUtils]: 12: Hoare triple {93582#(<= main_~c~0 1)} assume !(~c~0 == ~last~0); {93582#(<= main_~c~0 1)} is VALID [2022-04-15 06:34:13,152 INFO L290 TraceCheckUtils]: 13: Hoare triple {93582#(<= main_~c~0 1)} #t~post5 := ~c~0;~c~0 := 1 + #t~post5;havoc #t~post5; {93583#(<= main_~c~0 2)} is VALID [2022-04-15 06:34:13,152 INFO L290 TraceCheckUtils]: 14: Hoare triple {93583#(<= main_~c~0 2)} assume !!(~c~0 < 200000); {93583#(<= main_~c~0 2)} is VALID [2022-04-15 06:34:13,153 INFO L290 TraceCheckUtils]: 15: Hoare triple {93583#(<= main_~c~0 2)} assume !(~c~0 == ~last~0); {93583#(<= main_~c~0 2)} is VALID [2022-04-15 06:34:13,153 INFO L290 TraceCheckUtils]: 16: Hoare triple {93583#(<= main_~c~0 2)} #t~post5 := ~c~0;~c~0 := 1 + #t~post5;havoc #t~post5; {93584#(<= main_~c~0 3)} is VALID [2022-04-15 06:34:13,153 INFO L290 TraceCheckUtils]: 17: Hoare triple {93584#(<= main_~c~0 3)} assume !!(~c~0 < 200000); {93584#(<= main_~c~0 3)} is VALID [2022-04-15 06:34:13,154 INFO L290 TraceCheckUtils]: 18: Hoare triple {93584#(<= main_~c~0 3)} assume !(~c~0 == ~last~0); {93584#(<= main_~c~0 3)} is VALID [2022-04-15 06:34:13,154 INFO L290 TraceCheckUtils]: 19: Hoare triple {93584#(<= main_~c~0 3)} #t~post5 := ~c~0;~c~0 := 1 + #t~post5;havoc #t~post5; {93585#(<= main_~c~0 4)} is VALID [2022-04-15 06:34:13,154 INFO L290 TraceCheckUtils]: 20: Hoare triple {93585#(<= main_~c~0 4)} assume !!(~c~0 < 200000); {93585#(<= main_~c~0 4)} is VALID [2022-04-15 06:34:13,154 INFO L290 TraceCheckUtils]: 21: Hoare triple {93585#(<= main_~c~0 4)} assume !(~c~0 == ~last~0); {93585#(<= main_~c~0 4)} is VALID [2022-04-15 06:34:13,155 INFO L290 TraceCheckUtils]: 22: Hoare triple {93585#(<= main_~c~0 4)} #t~post5 := ~c~0;~c~0 := 1 + #t~post5;havoc #t~post5; {93586#(<= main_~c~0 5)} is VALID [2022-04-15 06:34:13,155 INFO L290 TraceCheckUtils]: 23: Hoare triple {93586#(<= main_~c~0 5)} assume !!(~c~0 < 200000); {93586#(<= main_~c~0 5)} is VALID [2022-04-15 06:34:13,155 INFO L290 TraceCheckUtils]: 24: Hoare triple {93586#(<= main_~c~0 5)} assume !(~c~0 == ~last~0); {93586#(<= main_~c~0 5)} is VALID [2022-04-15 06:34:13,156 INFO L290 TraceCheckUtils]: 25: Hoare triple {93586#(<= main_~c~0 5)} #t~post5 := ~c~0;~c~0 := 1 + #t~post5;havoc #t~post5; {93587#(<= main_~c~0 6)} is VALID [2022-04-15 06:34:13,156 INFO L290 TraceCheckUtils]: 26: Hoare triple {93587#(<= main_~c~0 6)} assume !!(~c~0 < 200000); {93587#(<= main_~c~0 6)} is VALID [2022-04-15 06:34:13,156 INFO L290 TraceCheckUtils]: 27: Hoare triple {93587#(<= main_~c~0 6)} assume !(~c~0 == ~last~0); {93587#(<= main_~c~0 6)} is VALID [2022-04-15 06:34:13,157 INFO L290 TraceCheckUtils]: 28: Hoare triple {93587#(<= main_~c~0 6)} #t~post5 := ~c~0;~c~0 := 1 + #t~post5;havoc #t~post5; {93588#(<= main_~c~0 7)} is VALID [2022-04-15 06:34:13,157 INFO L290 TraceCheckUtils]: 29: Hoare triple {93588#(<= main_~c~0 7)} assume !!(~c~0 < 200000); {93588#(<= main_~c~0 7)} is VALID [2022-04-15 06:34:13,157 INFO L290 TraceCheckUtils]: 30: Hoare triple {93588#(<= main_~c~0 7)} assume !(~c~0 == ~last~0); {93588#(<= main_~c~0 7)} is VALID [2022-04-15 06:34:13,158 INFO L290 TraceCheckUtils]: 31: Hoare triple {93588#(<= main_~c~0 7)} #t~post5 := ~c~0;~c~0 := 1 + #t~post5;havoc #t~post5; {93589#(<= main_~c~0 8)} is VALID [2022-04-15 06:34:13,158 INFO L290 TraceCheckUtils]: 32: Hoare triple {93589#(<= main_~c~0 8)} assume !!(~c~0 < 200000); {93589#(<= main_~c~0 8)} is VALID [2022-04-15 06:34:13,158 INFO L290 TraceCheckUtils]: 33: Hoare triple {93589#(<= main_~c~0 8)} assume !(~c~0 == ~last~0); {93589#(<= main_~c~0 8)} is VALID [2022-04-15 06:34:13,159 INFO L290 TraceCheckUtils]: 34: Hoare triple {93589#(<= main_~c~0 8)} #t~post5 := ~c~0;~c~0 := 1 + #t~post5;havoc #t~post5; {93590#(<= main_~c~0 9)} is VALID [2022-04-15 06:34:13,159 INFO L290 TraceCheckUtils]: 35: Hoare triple {93590#(<= main_~c~0 9)} assume !!(~c~0 < 200000); {93590#(<= main_~c~0 9)} is VALID [2022-04-15 06:34:13,159 INFO L290 TraceCheckUtils]: 36: Hoare triple {93590#(<= main_~c~0 9)} assume !(~c~0 == ~last~0); {93590#(<= main_~c~0 9)} is VALID [2022-04-15 06:34:13,159 INFO L290 TraceCheckUtils]: 37: Hoare triple {93590#(<= main_~c~0 9)} #t~post5 := ~c~0;~c~0 := 1 + #t~post5;havoc #t~post5; {93591#(<= main_~c~0 10)} is VALID [2022-04-15 06:34:13,160 INFO L290 TraceCheckUtils]: 38: Hoare triple {93591#(<= main_~c~0 10)} assume !!(~c~0 < 200000); {93591#(<= main_~c~0 10)} is VALID [2022-04-15 06:34:13,160 INFO L290 TraceCheckUtils]: 39: Hoare triple {93591#(<= main_~c~0 10)} assume !(~c~0 == ~last~0); {93591#(<= main_~c~0 10)} is VALID [2022-04-15 06:34:13,160 INFO L290 TraceCheckUtils]: 40: Hoare triple {93591#(<= main_~c~0 10)} #t~post5 := ~c~0;~c~0 := 1 + #t~post5;havoc #t~post5; {93592#(<= main_~c~0 11)} is VALID [2022-04-15 06:34:13,161 INFO L290 TraceCheckUtils]: 41: Hoare triple {93592#(<= main_~c~0 11)} assume !!(~c~0 < 200000); {93592#(<= main_~c~0 11)} is VALID [2022-04-15 06:34:13,161 INFO L290 TraceCheckUtils]: 42: Hoare triple {93592#(<= main_~c~0 11)} assume !(~c~0 == ~last~0); {93592#(<= main_~c~0 11)} is VALID [2022-04-15 06:34:13,161 INFO L290 TraceCheckUtils]: 43: Hoare triple {93592#(<= main_~c~0 11)} #t~post5 := ~c~0;~c~0 := 1 + #t~post5;havoc #t~post5; {93593#(<= main_~c~0 12)} is VALID [2022-04-15 06:34:13,162 INFO L290 TraceCheckUtils]: 44: Hoare triple {93593#(<= main_~c~0 12)} assume !!(~c~0 < 200000); {93593#(<= main_~c~0 12)} is VALID [2022-04-15 06:34:13,162 INFO L290 TraceCheckUtils]: 45: Hoare triple {93593#(<= main_~c~0 12)} assume !(~c~0 == ~last~0); {93593#(<= main_~c~0 12)} is VALID [2022-04-15 06:34:13,162 INFO L290 TraceCheckUtils]: 46: Hoare triple {93593#(<= main_~c~0 12)} #t~post5 := ~c~0;~c~0 := 1 + #t~post5;havoc #t~post5; {93594#(<= main_~c~0 13)} is VALID [2022-04-15 06:34:13,163 INFO L290 TraceCheckUtils]: 47: Hoare triple {93594#(<= main_~c~0 13)} assume !!(~c~0 < 200000); {93594#(<= main_~c~0 13)} is VALID [2022-04-15 06:34:13,163 INFO L290 TraceCheckUtils]: 48: Hoare triple {93594#(<= main_~c~0 13)} assume !(~c~0 == ~last~0); {93594#(<= main_~c~0 13)} is VALID [2022-04-15 06:34:13,163 INFO L290 TraceCheckUtils]: 49: Hoare triple {93594#(<= main_~c~0 13)} #t~post5 := ~c~0;~c~0 := 1 + #t~post5;havoc #t~post5; {93595#(<= main_~c~0 14)} is VALID [2022-04-15 06:34:13,163 INFO L290 TraceCheckUtils]: 50: Hoare triple {93595#(<= main_~c~0 14)} assume !!(~c~0 < 200000); {93595#(<= main_~c~0 14)} is VALID [2022-04-15 06:34:13,164 INFO L290 TraceCheckUtils]: 51: Hoare triple {93595#(<= main_~c~0 14)} assume !(~c~0 == ~last~0); {93595#(<= main_~c~0 14)} is VALID [2022-04-15 06:34:13,164 INFO L290 TraceCheckUtils]: 52: Hoare triple {93595#(<= main_~c~0 14)} #t~post5 := ~c~0;~c~0 := 1 + #t~post5;havoc #t~post5; {93596#(<= main_~c~0 15)} is VALID [2022-04-15 06:34:13,164 INFO L290 TraceCheckUtils]: 53: Hoare triple {93596#(<= main_~c~0 15)} assume !(~c~0 < 200000); {93577#false} is VALID [2022-04-15 06:34:13,165 INFO L290 TraceCheckUtils]: 54: Hoare triple {93577#false} assume 0 == ~st~0 && ~c~0 == 1 + ~last~0;~a~0 := 3 + ~a~0;~b~0 := 3 + ~b~0; {93577#false} is VALID [2022-04-15 06:34:13,165 INFO L290 TraceCheckUtils]: 55: Hoare triple {93577#false} assume !(~c~0 == ~last~0 && 0 == ~st~0); {93577#false} is VALID [2022-04-15 06:34:13,165 INFO L272 TraceCheckUtils]: 56: Hoare triple {93577#false} call __VERIFIER_assert((if ~a~0 == ~b~0 && 200000 == ~c~0 then 1 else 0)); {93577#false} is VALID [2022-04-15 06:34:13,165 INFO L290 TraceCheckUtils]: 57: Hoare triple {93577#false} ~cond := #in~cond; {93577#false} is VALID [2022-04-15 06:34:13,165 INFO L290 TraceCheckUtils]: 58: Hoare triple {93577#false} assume 0 == ~cond; {93577#false} is VALID [2022-04-15 06:34:13,165 INFO L290 TraceCheckUtils]: 59: Hoare triple {93577#false} assume !false; {93577#false} is VALID [2022-04-15 06:34:13,165 INFO L134 CoverageAnalysis]: Checked inductivity of 330 backedges. 0 proven. 330 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 06:34:13,165 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 06:34:13,734 INFO L290 TraceCheckUtils]: 59: Hoare triple {93577#false} assume !false; {93577#false} is VALID [2022-04-15 06:34:13,734 INFO L290 TraceCheckUtils]: 58: Hoare triple {93577#false} assume 0 == ~cond; {93577#false} is VALID [2022-04-15 06:34:13,734 INFO L290 TraceCheckUtils]: 57: Hoare triple {93577#false} ~cond := #in~cond; {93577#false} is VALID [2022-04-15 06:34:13,734 INFO L272 TraceCheckUtils]: 56: Hoare triple {93577#false} call __VERIFIER_assert((if ~a~0 == ~b~0 && 200000 == ~c~0 then 1 else 0)); {93577#false} is VALID [2022-04-15 06:34:13,734 INFO L290 TraceCheckUtils]: 55: Hoare triple {93577#false} assume !(~c~0 == ~last~0 && 0 == ~st~0); {93577#false} is VALID [2022-04-15 06:34:13,735 INFO L290 TraceCheckUtils]: 54: Hoare triple {93577#false} assume 0 == ~st~0 && ~c~0 == 1 + ~last~0;~a~0 := 3 + ~a~0;~b~0 := 3 + ~b~0; {93577#false} is VALID [2022-04-15 06:34:13,735 INFO L290 TraceCheckUtils]: 53: Hoare triple {93797#(< main_~c~0 200000)} assume !(~c~0 < 200000); {93577#false} is VALID [2022-04-15 06:34:13,735 INFO L290 TraceCheckUtils]: 52: Hoare triple {93801#(< main_~c~0 199999)} #t~post5 := ~c~0;~c~0 := 1 + #t~post5;havoc #t~post5; {93797#(< main_~c~0 200000)} is VALID [2022-04-15 06:34:13,736 INFO L290 TraceCheckUtils]: 51: Hoare triple {93801#(< main_~c~0 199999)} assume !(~c~0 == ~last~0); {93801#(< main_~c~0 199999)} is VALID [2022-04-15 06:34:13,736 INFO L290 TraceCheckUtils]: 50: Hoare triple {93801#(< main_~c~0 199999)} assume !!(~c~0 < 200000); {93801#(< main_~c~0 199999)} is VALID [2022-04-15 06:34:13,736 INFO L290 TraceCheckUtils]: 49: Hoare triple {93811#(< main_~c~0 199998)} #t~post5 := ~c~0;~c~0 := 1 + #t~post5;havoc #t~post5; {93801#(< main_~c~0 199999)} is VALID [2022-04-15 06:34:13,737 INFO L290 TraceCheckUtils]: 48: Hoare triple {93811#(< main_~c~0 199998)} assume !(~c~0 == ~last~0); {93811#(< main_~c~0 199998)} is VALID [2022-04-15 06:34:13,737 INFO L290 TraceCheckUtils]: 47: Hoare triple {93811#(< main_~c~0 199998)} assume !!(~c~0 < 200000); {93811#(< main_~c~0 199998)} is VALID [2022-04-15 06:34:13,737 INFO L290 TraceCheckUtils]: 46: Hoare triple {93821#(< main_~c~0 199997)} #t~post5 := ~c~0;~c~0 := 1 + #t~post5;havoc #t~post5; {93811#(< main_~c~0 199998)} is VALID [2022-04-15 06:34:13,737 INFO L290 TraceCheckUtils]: 45: Hoare triple {93821#(< main_~c~0 199997)} assume !(~c~0 == ~last~0); {93821#(< main_~c~0 199997)} is VALID [2022-04-15 06:34:13,738 INFO L290 TraceCheckUtils]: 44: Hoare triple {93821#(< main_~c~0 199997)} assume !!(~c~0 < 200000); {93821#(< main_~c~0 199997)} is VALID [2022-04-15 06:34:13,738 INFO L290 TraceCheckUtils]: 43: Hoare triple {93831#(< main_~c~0 199996)} #t~post5 := ~c~0;~c~0 := 1 + #t~post5;havoc #t~post5; {93821#(< main_~c~0 199997)} is VALID [2022-04-15 06:34:13,738 INFO L290 TraceCheckUtils]: 42: Hoare triple {93831#(< main_~c~0 199996)} assume !(~c~0 == ~last~0); {93831#(< main_~c~0 199996)} is VALID [2022-04-15 06:34:13,739 INFO L290 TraceCheckUtils]: 41: Hoare triple {93831#(< main_~c~0 199996)} assume !!(~c~0 < 200000); {93831#(< main_~c~0 199996)} is VALID [2022-04-15 06:34:13,739 INFO L290 TraceCheckUtils]: 40: Hoare triple {93841#(< main_~c~0 199995)} #t~post5 := ~c~0;~c~0 := 1 + #t~post5;havoc #t~post5; {93831#(< main_~c~0 199996)} is VALID [2022-04-15 06:34:13,739 INFO L290 TraceCheckUtils]: 39: Hoare triple {93841#(< main_~c~0 199995)} assume !(~c~0 == ~last~0); {93841#(< main_~c~0 199995)} is VALID [2022-04-15 06:34:13,740 INFO L290 TraceCheckUtils]: 38: Hoare triple {93841#(< main_~c~0 199995)} assume !!(~c~0 < 200000); {93841#(< main_~c~0 199995)} is VALID [2022-04-15 06:34:13,740 INFO L290 TraceCheckUtils]: 37: Hoare triple {93851#(< main_~c~0 199994)} #t~post5 := ~c~0;~c~0 := 1 + #t~post5;havoc #t~post5; {93841#(< main_~c~0 199995)} is VALID [2022-04-15 06:34:13,740 INFO L290 TraceCheckUtils]: 36: Hoare triple {93851#(< main_~c~0 199994)} assume !(~c~0 == ~last~0); {93851#(< main_~c~0 199994)} is VALID [2022-04-15 06:34:13,741 INFO L290 TraceCheckUtils]: 35: Hoare triple {93851#(< main_~c~0 199994)} assume !!(~c~0 < 200000); {93851#(< main_~c~0 199994)} is VALID [2022-04-15 06:34:13,741 INFO L290 TraceCheckUtils]: 34: Hoare triple {93861#(< main_~c~0 199993)} #t~post5 := ~c~0;~c~0 := 1 + #t~post5;havoc #t~post5; {93851#(< main_~c~0 199994)} is VALID [2022-04-15 06:34:13,741 INFO L290 TraceCheckUtils]: 33: Hoare triple {93861#(< main_~c~0 199993)} assume !(~c~0 == ~last~0); {93861#(< main_~c~0 199993)} is VALID [2022-04-15 06:34:13,742 INFO L290 TraceCheckUtils]: 32: Hoare triple {93861#(< main_~c~0 199993)} assume !!(~c~0 < 200000); {93861#(< main_~c~0 199993)} is VALID [2022-04-15 06:34:13,742 INFO L290 TraceCheckUtils]: 31: Hoare triple {93871#(< main_~c~0 199992)} #t~post5 := ~c~0;~c~0 := 1 + #t~post5;havoc #t~post5; {93861#(< main_~c~0 199993)} is VALID [2022-04-15 06:34:13,742 INFO L290 TraceCheckUtils]: 30: Hoare triple {93871#(< main_~c~0 199992)} assume !(~c~0 == ~last~0); {93871#(< main_~c~0 199992)} is VALID [2022-04-15 06:34:13,743 INFO L290 TraceCheckUtils]: 29: Hoare triple {93871#(< main_~c~0 199992)} assume !!(~c~0 < 200000); {93871#(< main_~c~0 199992)} is VALID [2022-04-15 06:34:13,743 INFO L290 TraceCheckUtils]: 28: Hoare triple {93881#(< main_~c~0 199991)} #t~post5 := ~c~0;~c~0 := 1 + #t~post5;havoc #t~post5; {93871#(< main_~c~0 199992)} is VALID [2022-04-15 06:34:13,743 INFO L290 TraceCheckUtils]: 27: Hoare triple {93881#(< main_~c~0 199991)} assume !(~c~0 == ~last~0); {93881#(< main_~c~0 199991)} is VALID [2022-04-15 06:34:13,744 INFO L290 TraceCheckUtils]: 26: Hoare triple {93881#(< main_~c~0 199991)} assume !!(~c~0 < 200000); {93881#(< main_~c~0 199991)} is VALID [2022-04-15 06:34:13,744 INFO L290 TraceCheckUtils]: 25: Hoare triple {93891#(< main_~c~0 199990)} #t~post5 := ~c~0;~c~0 := 1 + #t~post5;havoc #t~post5; {93881#(< main_~c~0 199991)} is VALID [2022-04-15 06:34:13,744 INFO L290 TraceCheckUtils]: 24: Hoare triple {93891#(< main_~c~0 199990)} assume !(~c~0 == ~last~0); {93891#(< main_~c~0 199990)} is VALID [2022-04-15 06:34:13,745 INFO L290 TraceCheckUtils]: 23: Hoare triple {93891#(< main_~c~0 199990)} assume !!(~c~0 < 200000); {93891#(< main_~c~0 199990)} is VALID [2022-04-15 06:34:13,745 INFO L290 TraceCheckUtils]: 22: Hoare triple {93901#(< main_~c~0 199989)} #t~post5 := ~c~0;~c~0 := 1 + #t~post5;havoc #t~post5; {93891#(< main_~c~0 199990)} is VALID [2022-04-15 06:34:13,745 INFO L290 TraceCheckUtils]: 21: Hoare triple {93901#(< main_~c~0 199989)} assume !(~c~0 == ~last~0); {93901#(< main_~c~0 199989)} is VALID [2022-04-15 06:34:13,746 INFO L290 TraceCheckUtils]: 20: Hoare triple {93901#(< main_~c~0 199989)} assume !!(~c~0 < 200000); {93901#(< main_~c~0 199989)} is VALID [2022-04-15 06:34:13,746 INFO L290 TraceCheckUtils]: 19: Hoare triple {93911#(< main_~c~0 199988)} #t~post5 := ~c~0;~c~0 := 1 + #t~post5;havoc #t~post5; {93901#(< main_~c~0 199989)} is VALID [2022-04-15 06:34:13,746 INFO L290 TraceCheckUtils]: 18: Hoare triple {93911#(< main_~c~0 199988)} assume !(~c~0 == ~last~0); {93911#(< main_~c~0 199988)} is VALID [2022-04-15 06:34:13,747 INFO L290 TraceCheckUtils]: 17: Hoare triple {93911#(< main_~c~0 199988)} assume !!(~c~0 < 200000); {93911#(< main_~c~0 199988)} is VALID [2022-04-15 06:34:13,747 INFO L290 TraceCheckUtils]: 16: Hoare triple {93921#(< main_~c~0 199987)} #t~post5 := ~c~0;~c~0 := 1 + #t~post5;havoc #t~post5; {93911#(< main_~c~0 199988)} is VALID [2022-04-15 06:34:13,747 INFO L290 TraceCheckUtils]: 15: Hoare triple {93921#(< main_~c~0 199987)} assume !(~c~0 == ~last~0); {93921#(< main_~c~0 199987)} is VALID [2022-04-15 06:34:13,747 INFO L290 TraceCheckUtils]: 14: Hoare triple {93921#(< main_~c~0 199987)} assume !!(~c~0 < 200000); {93921#(< main_~c~0 199987)} is VALID [2022-04-15 06:34:13,748 INFO L290 TraceCheckUtils]: 13: Hoare triple {93931#(< main_~c~0 199986)} #t~post5 := ~c~0;~c~0 := 1 + #t~post5;havoc #t~post5; {93921#(< main_~c~0 199987)} is VALID [2022-04-15 06:34:13,748 INFO L290 TraceCheckUtils]: 12: Hoare triple {93931#(< main_~c~0 199986)} assume !(~c~0 == ~last~0); {93931#(< main_~c~0 199986)} is VALID [2022-04-15 06:34:13,748 INFO L290 TraceCheckUtils]: 11: Hoare triple {93931#(< main_~c~0 199986)} assume !!(~c~0 < 200000); {93931#(< main_~c~0 199986)} is VALID [2022-04-15 06:34:13,749 INFO L290 TraceCheckUtils]: 10: Hoare triple {93941#(< main_~c~0 199985)} #t~post5 := ~c~0;~c~0 := 1 + #t~post5;havoc #t~post5; {93931#(< main_~c~0 199986)} is VALID [2022-04-15 06:34:13,749 INFO L290 TraceCheckUtils]: 9: Hoare triple {93941#(< main_~c~0 199985)} assume ~c~0 == ~last~0;~st~0 := 0; {93941#(< main_~c~0 199985)} is VALID [2022-04-15 06:34:13,749 INFO L290 TraceCheckUtils]: 8: Hoare triple {93941#(< main_~c~0 199985)} assume !!(~c~0 < 200000); {93941#(< main_~c~0 199985)} is VALID [2022-04-15 06:34:13,750 INFO L290 TraceCheckUtils]: 7: Hoare triple {93576#true} [231] L23-3_primed-->L23-3: Formula: (and (= v_main_~c~0_7 0) (= v_main_~st~0_6 1)) InVars {} OutVars{main_~c~0=v_main_~c~0_7, main_~st~0=v_main_~st~0_6} AuxVars[] AssignedVars[main_~c~0, main_~st~0] {93941#(< main_~c~0 199985)} is VALID [2022-04-15 06:34:13,750 INFO L290 TraceCheckUtils]: 6: Hoare triple {93576#true} [232] L30-->L23-3_primed: Formula: (let ((.cse0 (= v_main_~a~0_233 v_main_~a~0_232)) (.cse1 (= |v_main_#t~post5_707| |v_main_#t~post5_692|)) (.cse2 (= v_main_~st~0_450 v_main_~st~0_448))) (or (and (= v_main_~c~0_1631 v_main_~c~0_1647) .cse0 (= v_main_~b~0_229 v_main_~b~0_230) .cse1 .cse2) (and .cse0 .cse1 (= v_main_~b~0_230 v_main_~b~0_229) .cse2 (= v_main_~c~0_1647 v_main_~c~0_1631)))) InVars {main_~c~0=v_main_~c~0_1647, main_#t~post5=|v_main_#t~post5_707|, main_~st~0=v_main_~st~0_450, main_~b~0=v_main_~b~0_230, main_~a~0=v_main_~a~0_233} OutVars{main_~c~0=v_main_~c~0_1631, main_#t~post5=|v_main_#t~post5_692|, main_~st~0=v_main_~st~0_448, main_~b~0=v_main_~b~0_229, main_~a~0=v_main_~a~0_232} AuxVars[] AssignedVars[main_~c~0, main_#t~post5, main_~st~0, main_~b~0, main_~a~0] {93576#true} is VALID [2022-04-15 06:34:13,750 INFO L290 TraceCheckUtils]: 5: Hoare triple {93576#true} assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~last~0 := #t~nondet4;havoc #t~nondet4;~a~0 := 0;~b~0 := 0;~c~0 := 0;~st~0 := 0; {93576#true} is VALID [2022-04-15 06:34:13,750 INFO L272 TraceCheckUtils]: 4: Hoare triple {93576#true} call #t~ret6 := main(); {93576#true} is VALID [2022-04-15 06:34:13,750 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {93576#true} {93576#true} #66#return; {93576#true} is VALID [2022-04-15 06:34:13,750 INFO L290 TraceCheckUtils]: 2: Hoare triple {93576#true} assume true; {93576#true} is VALID [2022-04-15 06:34:13,750 INFO L290 TraceCheckUtils]: 1: Hoare triple {93576#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(11, 2);call #Ultimate.allocInit(12, 3);~last~0 := 0; {93576#true} is VALID [2022-04-15 06:34:13,750 INFO L272 TraceCheckUtils]: 0: Hoare triple {93576#true} call ULTIMATE.init(); {93576#true} is VALID [2022-04-15 06:34:13,750 INFO L134 CoverageAnalysis]: Checked inductivity of 330 backedges. 0 proven. 330 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 06:34:13,750 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1039613567] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 06:34:13,751 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 06:34:13,751 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 18, 18] total 36 [2022-04-15 06:34:14,258 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 06:34:14,258 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1730393762] [2022-04-15 06:34:14,258 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1730393762] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 06:34:14,258 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 06:34:14,258 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [36] imperfect sequences [] total 36 [2022-04-15 06:34:14,258 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1730980012] [2022-04-15 06:34:14,258 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 06:34:14,259 INFO L78 Accepts]: Start accepts. Automaton has has 36 states, 36 states have (on average 2.9166666666666665) internal successors, (105), 35 states have internal predecessors, (105), 2 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 113 [2022-04-15 06:34:14,259 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 06:34:14,259 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 36 states, 36 states have (on average 2.9166666666666665) internal successors, (105), 35 states have internal predecessors, (105), 2 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-15 06:34:14,331 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 110 edges. 110 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 06:34:14,331 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 36 states [2022-04-15 06:34:14,331 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 06:34:14,332 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2022-04-15 06:34:14,332 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1057, Invalid=1699, Unknown=0, NotChecked=0, Total=2756 [2022-04-15 06:34:14,332 INFO L87 Difference]: Start difference. First operand 561 states and 628 transitions. Second operand has 36 states, 36 states have (on average 2.9166666666666665) internal successors, (105), 35 states have internal predecessors, (105), 2 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-15 06:34:19,766 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:34:19,766 INFO L93 Difference]: Finished difference Result 809 states and 919 transitions. [2022-04-15 06:34:19,766 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2022-04-15 06:34:19,766 INFO L78 Accepts]: Start accepts. Automaton has has 36 states, 36 states have (on average 2.9166666666666665) internal successors, (105), 35 states have internal predecessors, (105), 2 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 113 [2022-04-15 06:34:19,767 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 06:34:19,767 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 36 states, 36 states have (on average 2.9166666666666665) internal successors, (105), 35 states have internal predecessors, (105), 2 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-15 06:34:19,767 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 151 transitions. [2022-04-15 06:34:19,768 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 36 states, 36 states have (on average 2.9166666666666665) internal successors, (105), 35 states have internal predecessors, (105), 2 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-15 06:34:19,768 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 151 transitions. [2022-04-15 06:34:19,768 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 36 states and 151 transitions. [2022-04-15 06:34:19,865 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 151 edges. 151 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 06:34:19,886 INFO L225 Difference]: With dead ends: 809 [2022-04-15 06:34:19,886 INFO L226 Difference]: Without dead ends: 697 [2022-04-15 06:34:19,887 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 201 GetRequests, 129 SyntacticMatches, 21 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2541 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=1057, Invalid=1699, Unknown=0, NotChecked=0, Total=2756 [2022-04-15 06:34:19,887 INFO L913 BasicCegarLoop]: 18 mSDtfsCounter, 102 mSDsluCounter, 37 mSDsCounter, 0 mSdLazyCounter, 876 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 102 SdHoareTripleChecker+Valid, 55 SdHoareTripleChecker+Invalid, 887 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 876 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-04-15 06:34:19,887 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [102 Valid, 55 Invalid, 887 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 876 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-04-15 06:34:19,888 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 697 states. [2022-04-15 06:34:23,359 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 697 to 614. [2022-04-15 06:34:23,359 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 06:34:23,359 INFO L82 GeneralOperation]: Start isEquivalent. First operand 697 states. Second operand has 614 states, 606 states have (on average 1.1155115511551155) internal successors, (676), 607 states have internal predecessors, (676), 4 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-15 06:34:23,360 INFO L74 IsIncluded]: Start isIncluded. First operand 697 states. Second operand has 614 states, 606 states have (on average 1.1155115511551155) internal successors, (676), 607 states have internal predecessors, (676), 4 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-15 06:34:23,360 INFO L87 Difference]: Start difference. First operand 697 states. Second operand has 614 states, 606 states have (on average 1.1155115511551155) internal successors, (676), 607 states have internal predecessors, (676), 4 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-15 06:34:23,373 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:34:23,373 INFO L93 Difference]: Finished difference Result 697 states and 768 transitions. [2022-04-15 06:34:23,373 INFO L276 IsEmpty]: Start isEmpty. Operand 697 states and 768 transitions. [2022-04-15 06:34:23,374 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 06:34:23,374 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 06:34:23,374 INFO L74 IsIncluded]: Start isIncluded. First operand has 614 states, 606 states have (on average 1.1155115511551155) internal successors, (676), 607 states have internal predecessors, (676), 4 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) Second operand 697 states. [2022-04-15 06:34:23,374 INFO L87 Difference]: Start difference. First operand has 614 states, 606 states have (on average 1.1155115511551155) internal successors, (676), 607 states have internal predecessors, (676), 4 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) Second operand 697 states. [2022-04-15 06:34:23,387 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:34:23,388 INFO L93 Difference]: Finished difference Result 697 states and 768 transitions. [2022-04-15 06:34:23,388 INFO L276 IsEmpty]: Start isEmpty. Operand 697 states and 768 transitions. [2022-04-15 06:34:23,388 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 06:34:23,388 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 06:34:23,388 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 06:34:23,388 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 06:34:23,388 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 614 states, 606 states have (on average 1.1155115511551155) internal successors, (676), 607 states have internal predecessors, (676), 4 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-15 06:34:23,403 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 614 states to 614 states and 683 transitions. [2022-04-15 06:34:23,404 INFO L78 Accepts]: Start accepts. Automaton has 614 states and 683 transitions. Word has length 113 [2022-04-15 06:34:23,404 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 06:34:23,404 INFO L478 AbstractCegarLoop]: Abstraction has 614 states and 683 transitions. [2022-04-15 06:34:23,404 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 36 states, 36 states have (on average 2.9166666666666665) internal successors, (105), 35 states have internal predecessors, (105), 2 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-15 06:34:23,404 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 614 states and 683 transitions. [2022-04-15 06:34:25,497 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 683 edges. 683 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 06:34:25,498 INFO L276 IsEmpty]: Start isEmpty. Operand 614 states and 683 transitions. [2022-04-15 06:34:25,498 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2022-04-15 06:34:25,498 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 06:34:25,498 INFO L499 BasicCegarLoop]: trace histogram [33, 33, 32, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 06:34:25,517 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (47)] Forceful destruction successful, exit code 0 [2022-04-15 06:34:25,721 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable50,47 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 06:34:25,722 INFO L403 AbstractCegarLoop]: === Iteration 52 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 06:34:25,722 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 06:34:25,722 INFO L85 PathProgramCache]: Analyzing trace with hash 1576926500, now seen corresponding path program 32 times [2022-04-15 06:34:25,722 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 06:34:25,722 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1327710263] [2022-04-15 06:34:27,439 WARN L970 rdanLoopAcceleration]: Unable to prove correctness of quantifier elimination. [2022-04-15 06:34:31,458 WARN L977 rdanLoopAcceleration]: Unable to prove correctness of quantifier elimination. [2022-04-15 06:34:31,569 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 1 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-15 06:34:31,778 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {0={1=1}, 1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-15 06:34:31,779 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-15 06:34:31,782 INFO L85 PathProgramCache]: Analyzing trace with hash 659510728, now seen corresponding path program 1 times [2022-04-15 06:34:31,782 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 06:34:31,782 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [38935551] [2022-04-15 06:34:31,782 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 06:34:31,782 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 06:34:31,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:34:31,916 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 06:34:31,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:34:31,919 INFO L290 TraceCheckUtils]: 0: Hoare triple {98243#(and (= ~last~0 |old(~last~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(11, 2);call #Ultimate.allocInit(12, 3);~last~0 := 0; {98231#true} is VALID [2022-04-15 06:34:31,919 INFO L290 TraceCheckUtils]: 1: Hoare triple {98231#true} assume true; {98231#true} is VALID [2022-04-15 06:34:31,919 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {98231#true} {98231#true} #66#return; {98231#true} is VALID [2022-04-15 06:34:31,919 INFO L272 TraceCheckUtils]: 0: Hoare triple {98231#true} call ULTIMATE.init(); {98243#(and (= ~last~0 |old(~last~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 06:34:31,920 INFO L290 TraceCheckUtils]: 1: Hoare triple {98243#(and (= ~last~0 |old(~last~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(11, 2);call #Ultimate.allocInit(12, 3);~last~0 := 0; {98231#true} is VALID [2022-04-15 06:34:31,920 INFO L290 TraceCheckUtils]: 2: Hoare triple {98231#true} assume true; {98231#true} is VALID [2022-04-15 06:34:31,920 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {98231#true} {98231#true} #66#return; {98231#true} is VALID [2022-04-15 06:34:31,920 INFO L272 TraceCheckUtils]: 4: Hoare triple {98231#true} call #t~ret6 := main(); {98231#true} is VALID [2022-04-15 06:34:31,920 INFO L290 TraceCheckUtils]: 5: Hoare triple {98231#true} assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~last~0 := #t~nondet4;havoc #t~nondet4;~a~0 := 0;~b~0 := 0;~c~0 := 0;~st~0 := 0; {98236#(and (= main_~a~0 0) (= main_~b~0 0))} is VALID [2022-04-15 06:34:31,920 INFO L290 TraceCheckUtils]: 6: Hoare triple {98236#(and (= main_~a~0 0) (= main_~b~0 0))} assume !false;~st~0 := 1;~c~0 := 0; {98237#(and (= main_~a~0 0) (= main_~st~0 1) (= main_~b~0 0))} is VALID [2022-04-15 06:34:31,921 INFO L290 TraceCheckUtils]: 7: Hoare triple {98237#(and (= main_~a~0 0) (= main_~st~0 1) (= main_~b~0 0))} [234] L23-3-->L23-4_primed: Formula: (let ((.cse1 (= |v_main_#t~post5_728| |v_main_#t~post5_726|)) (.cse0 (= v_~last~0_343 v_main_~c~0_1698)) (.cse2 (= v_main_~c~0_1698 v_main_~c~0_1697))) (or (and (not .cse0) (< v_main_~c~0_1698 v_main_~c~0_1697) (< v_main_~c~0_1697 200001) (or (not (<= (+ v_main_~c~0_1698 1) v_~last~0_343)) (not (<= (+ v_~last~0_343 1) v_main_~c~0_1697)))) (and .cse1 (= v_~last~0_343 v_~last~0_343) .cse2) (and .cse1 (or .cse0 (not (< v_main_~c~0_1698 200000))) .cse2))) InVars {main_~c~0=v_main_~c~0_1698, main_#t~post5=|v_main_#t~post5_728|, ~last~0=v_~last~0_343} OutVars{main_#t~post5=|v_main_#t~post5_726|, main_~c~0=v_main_~c~0_1697, ~last~0=v_~last~0_343} AuxVars[] AssignedVars[main_#t~post5, main_~c~0] {98237#(and (= main_~a~0 0) (= main_~st~0 1) (= main_~b~0 0))} is VALID [2022-04-15 06:34:31,921 INFO L290 TraceCheckUtils]: 8: Hoare triple {98237#(and (= main_~a~0 0) (= main_~st~0 1) (= main_~b~0 0))} [235] L23-4_primed-->L23-3: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {98237#(and (= main_~a~0 0) (= main_~st~0 1) (= main_~b~0 0))} is VALID [2022-04-15 06:34:31,922 INFO L290 TraceCheckUtils]: 9: Hoare triple {98237#(and (= main_~a~0 0) (= main_~st~0 1) (= main_~b~0 0))} [236] L23-3-->L23-4_primed: Formula: (let ((.cse2 (< v_main_~c~0_1700 200000)) (.cse3 (= v_~last~0_344 v_main_~c~0_1700)) (.cse0 (= v_main_~st~0_458 v_main_~st~0_457)) (.cse1 (= v_main_~c~0_1700 v_main_~c~0_1699))) (or (and (= |v_main_#t~post5_731| |v_main_#t~post5_727|) .cse0 .cse1 (= v_~last~0_344 v_~last~0_344)) (and (< v_main_~c~0_1700 v_main_~c~0_1699) .cse2 .cse3 (< v_main_~c~0_1699 (+ 2 v_main_~c~0_1700)) (= v_main_~st~0_457 0)) (and (= |v_main_#t~post5_727| |v_main_#t~post5_731|) (or (not .cse2) (not .cse3)) .cse0 .cse1))) InVars {main_~c~0=v_main_~c~0_1700, main_#t~post5=|v_main_#t~post5_731|, main_~st~0=v_main_~st~0_458, ~last~0=v_~last~0_344} OutVars{main_#t~post5=|v_main_#t~post5_727|, main_~c~0=v_main_~c~0_1699, main_~st~0=v_main_~st~0_457, ~last~0=v_~last~0_344} AuxVars[] AssignedVars[main_#t~post5, main_~c~0, main_~st~0] {98238#(or (= main_~st~0 1) (and (= main_~a~0 0) (or (<= ~last~0 199999) (<= main_~c~0 200000)) (= main_~b~0 0)))} is VALID [2022-04-15 06:34:31,922 INFO L290 TraceCheckUtils]: 10: Hoare triple {98238#(or (= main_~st~0 1) (and (= main_~a~0 0) (or (<= ~last~0 199999) (<= main_~c~0 200000)) (= main_~b~0 0)))} [233] L23-4_primed-->L23-4: Formula: (not (< v_main_~c~0_8 200000)) InVars {main_~c~0=v_main_~c~0_8} OutVars{main_~c~0=v_main_~c~0_8} AuxVars[] AssignedVars[] {98239#(or (= main_~st~0 1) (and (= main_~a~0 0) (= main_~b~0 0) (or (and (< 199999 main_~c~0) (<= main_~c~0 200000)) (and (<= ~last~0 199999) (< 199999 main_~c~0)))))} is VALID [2022-04-15 06:34:31,923 INFO L290 TraceCheckUtils]: 11: Hoare triple {98239#(or (= main_~st~0 1) (and (= main_~a~0 0) (= main_~b~0 0) (or (and (< 199999 main_~c~0) (<= main_~c~0 200000)) (and (<= ~last~0 199999) (< 199999 main_~c~0)))))} assume 0 == ~st~0 && ~c~0 == 1 + ~last~0;~a~0 := 3 + ~a~0;~b~0 := 3 + ~b~0; {98240#(and (<= main_~b~0 main_~a~0) (< main_~a~0 (+ main_~b~0 1)) (< 199999 main_~c~0) (<= main_~c~0 200000))} is VALID [2022-04-15 06:34:31,924 INFO L290 TraceCheckUtils]: 12: Hoare triple {98240#(and (<= main_~b~0 main_~a~0) (< main_~a~0 (+ main_~b~0 1)) (< 199999 main_~c~0) (<= main_~c~0 200000))} assume !(~c~0 == ~last~0 && 0 == ~st~0); {98240#(and (<= main_~b~0 main_~a~0) (< main_~a~0 (+ main_~b~0 1)) (< 199999 main_~c~0) (<= main_~c~0 200000))} is VALID [2022-04-15 06:34:31,924 INFO L272 TraceCheckUtils]: 13: Hoare triple {98240#(and (<= main_~b~0 main_~a~0) (< main_~a~0 (+ main_~b~0 1)) (< 199999 main_~c~0) (<= main_~c~0 200000))} call __VERIFIER_assert((if ~a~0 == ~b~0 && 200000 == ~c~0 then 1 else 0)); {98241#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-15 06:34:31,925 INFO L290 TraceCheckUtils]: 14: Hoare triple {98241#(not (= |__VERIFIER_assert_#in~cond| 0))} ~cond := #in~cond; {98242#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-15 06:34:31,925 INFO L290 TraceCheckUtils]: 15: Hoare triple {98242#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {98232#false} is VALID [2022-04-15 06:34:31,925 INFO L290 TraceCheckUtils]: 16: Hoare triple {98232#false} assume !false; {98232#false} is VALID [2022-04-15 06:34:31,925 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-04-15 06:34:31,925 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 06:34:31,925 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [38935551] [2022-04-15 06:34:31,925 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [38935551] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 06:34:31,925 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1299459316] [2022-04-15 06:34:31,925 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 06:34:31,925 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 06:34:31,925 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 06:34:31,926 INFO L229 MonitoredProcess]: Starting monitored process 48 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-15 06:34:31,927 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (48)] Waiting until timeout for monitored process [2022-04-15 06:34:31,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:34:31,957 INFO L263 TraceCheckSpWp]: Trace formula consists of 85 conjuncts, 18 conjunts are in the unsatisfiable core [2022-04-15 06:34:31,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:34:31,963 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 06:34:32,232 INFO L272 TraceCheckUtils]: 0: Hoare triple {98231#true} call ULTIMATE.init(); {98231#true} is VALID [2022-04-15 06:34:32,232 INFO L290 TraceCheckUtils]: 1: Hoare triple {98231#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(11, 2);call #Ultimate.allocInit(12, 3);~last~0 := 0; {98231#true} is VALID [2022-04-15 06:34:32,232 INFO L290 TraceCheckUtils]: 2: Hoare triple {98231#true} assume true; {98231#true} is VALID [2022-04-15 06:34:32,232 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {98231#true} {98231#true} #66#return; {98231#true} is VALID [2022-04-15 06:34:32,232 INFO L272 TraceCheckUtils]: 4: Hoare triple {98231#true} call #t~ret6 := main(); {98231#true} is VALID [2022-04-15 06:34:32,233 INFO L290 TraceCheckUtils]: 5: Hoare triple {98231#true} assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~last~0 := #t~nondet4;havoc #t~nondet4;~a~0 := 0;~b~0 := 0;~c~0 := 0;~st~0 := 0; {98236#(and (= main_~a~0 0) (= main_~b~0 0))} is VALID [2022-04-15 06:34:32,233 INFO L290 TraceCheckUtils]: 6: Hoare triple {98236#(and (= main_~a~0 0) (= main_~b~0 0))} assume !false;~st~0 := 1;~c~0 := 0; {98237#(and (= main_~a~0 0) (= main_~st~0 1) (= main_~b~0 0))} is VALID [2022-04-15 06:34:32,234 INFO L290 TraceCheckUtils]: 7: Hoare triple {98237#(and (= main_~a~0 0) (= main_~st~0 1) (= main_~b~0 0))} [234] L23-3-->L23-4_primed: Formula: (let ((.cse1 (= |v_main_#t~post5_728| |v_main_#t~post5_726|)) (.cse0 (= v_~last~0_343 v_main_~c~0_1698)) (.cse2 (= v_main_~c~0_1698 v_main_~c~0_1697))) (or (and (not .cse0) (< v_main_~c~0_1698 v_main_~c~0_1697) (< v_main_~c~0_1697 200001) (or (not (<= (+ v_main_~c~0_1698 1) v_~last~0_343)) (not (<= (+ v_~last~0_343 1) v_main_~c~0_1697)))) (and .cse1 (= v_~last~0_343 v_~last~0_343) .cse2) (and .cse1 (or .cse0 (not (< v_main_~c~0_1698 200000))) .cse2))) InVars {main_~c~0=v_main_~c~0_1698, main_#t~post5=|v_main_#t~post5_728|, ~last~0=v_~last~0_343} OutVars{main_#t~post5=|v_main_#t~post5_726|, main_~c~0=v_main_~c~0_1697, ~last~0=v_~last~0_343} AuxVars[] AssignedVars[main_#t~post5, main_~c~0] {98237#(and (= main_~a~0 0) (= main_~st~0 1) (= main_~b~0 0))} is VALID [2022-04-15 06:34:32,234 INFO L290 TraceCheckUtils]: 8: Hoare triple {98237#(and (= main_~a~0 0) (= main_~st~0 1) (= main_~b~0 0))} [235] L23-4_primed-->L23-3: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {98237#(and (= main_~a~0 0) (= main_~st~0 1) (= main_~b~0 0))} is VALID [2022-04-15 06:34:32,235 INFO L290 TraceCheckUtils]: 9: Hoare triple {98237#(and (= main_~a~0 0) (= main_~st~0 1) (= main_~b~0 0))} [236] L23-3-->L23-4_primed: Formula: (let ((.cse2 (< v_main_~c~0_1700 200000)) (.cse3 (= v_~last~0_344 v_main_~c~0_1700)) (.cse0 (= v_main_~st~0_458 v_main_~st~0_457)) (.cse1 (= v_main_~c~0_1700 v_main_~c~0_1699))) (or (and (= |v_main_#t~post5_731| |v_main_#t~post5_727|) .cse0 .cse1 (= v_~last~0_344 v_~last~0_344)) (and (< v_main_~c~0_1700 v_main_~c~0_1699) .cse2 .cse3 (< v_main_~c~0_1699 (+ 2 v_main_~c~0_1700)) (= v_main_~st~0_457 0)) (and (= |v_main_#t~post5_727| |v_main_#t~post5_731|) (or (not .cse2) (not .cse3)) .cse0 .cse1))) InVars {main_~c~0=v_main_~c~0_1700, main_#t~post5=|v_main_#t~post5_731|, main_~st~0=v_main_~st~0_458, ~last~0=v_~last~0_344} OutVars{main_#t~post5=|v_main_#t~post5_727|, main_~c~0=v_main_~c~0_1699, main_~st~0=v_main_~st~0_457, ~last~0=v_~last~0_344} AuxVars[] AssignedVars[main_#t~post5, main_~c~0, main_~st~0] {98274#(and (= main_~a~0 0) (= main_~b~0 0) (or (= main_~st~0 1) (and (< ~last~0 200000) (< ~last~0 main_~c~0) (< main_~c~0 (+ ~last~0 2)) (= main_~st~0 0))))} is VALID [2022-04-15 06:34:32,236 INFO L290 TraceCheckUtils]: 10: Hoare triple {98274#(and (= main_~a~0 0) (= main_~b~0 0) (or (= main_~st~0 1) (and (< ~last~0 200000) (< ~last~0 main_~c~0) (< main_~c~0 (+ ~last~0 2)) (= main_~st~0 0))))} [233] L23-4_primed-->L23-4: Formula: (not (< v_main_~c~0_8 200000)) InVars {main_~c~0=v_main_~c~0_8} OutVars{main_~c~0=v_main_~c~0_8} AuxVars[] AssignedVars[] {98278#(and (= main_~a~0 0) (or (and (< ~last~0 200000) (< main_~c~0 (+ ~last~0 2)) (= main_~st~0 0)) (= main_~st~0 1)) (= main_~b~0 0) (not (< main_~c~0 200000)))} is VALID [2022-04-15 06:34:32,236 INFO L290 TraceCheckUtils]: 11: Hoare triple {98278#(and (= main_~a~0 0) (or (and (< ~last~0 200000) (< main_~c~0 (+ ~last~0 2)) (= main_~st~0 0)) (= main_~st~0 1)) (= main_~b~0 0) (not (< main_~c~0 200000)))} assume 0 == ~st~0 && ~c~0 == 1 + ~last~0;~a~0 := 3 + ~a~0;~b~0 := 3 + ~b~0; {98282#(and (= main_~b~0 3) (<= 200000 main_~c~0) (< main_~c~0 200001) (= main_~a~0 3))} is VALID [2022-04-15 06:34:32,237 INFO L290 TraceCheckUtils]: 12: Hoare triple {98282#(and (= main_~b~0 3) (<= 200000 main_~c~0) (< main_~c~0 200001) (= main_~a~0 3))} assume !(~c~0 == ~last~0 && 0 == ~st~0); {98282#(and (= main_~b~0 3) (<= 200000 main_~c~0) (< main_~c~0 200001) (= main_~a~0 3))} is VALID [2022-04-15 06:34:32,237 INFO L272 TraceCheckUtils]: 13: Hoare triple {98282#(and (= main_~b~0 3) (<= 200000 main_~c~0) (< main_~c~0 200001) (= main_~a~0 3))} call __VERIFIER_assert((if ~a~0 == ~b~0 && 200000 == ~c~0 then 1 else 0)); {98289#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-15 06:34:32,238 INFO L290 TraceCheckUtils]: 14: Hoare triple {98289#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {98293#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-15 06:34:32,238 INFO L290 TraceCheckUtils]: 15: Hoare triple {98293#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {98232#false} is VALID [2022-04-15 06:34:32,238 INFO L290 TraceCheckUtils]: 16: Hoare triple {98232#false} assume !false; {98232#false} is VALID [2022-04-15 06:34:32,238 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-04-15 06:34:32,238 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 06:34:32,651 INFO L290 TraceCheckUtils]: 16: Hoare triple {98232#false} assume !false; {98232#false} is VALID [2022-04-15 06:34:32,651 INFO L290 TraceCheckUtils]: 15: Hoare triple {98293#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {98232#false} is VALID [2022-04-15 06:34:32,652 INFO L290 TraceCheckUtils]: 14: Hoare triple {98289#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {98293#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-15 06:34:32,652 INFO L272 TraceCheckUtils]: 13: Hoare triple {98240#(and (<= main_~b~0 main_~a~0) (< main_~a~0 (+ main_~b~0 1)) (< 199999 main_~c~0) (<= main_~c~0 200000))} call __VERIFIER_assert((if ~a~0 == ~b~0 && 200000 == ~c~0 then 1 else 0)); {98289#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-15 06:34:32,653 INFO L290 TraceCheckUtils]: 12: Hoare triple {98240#(and (<= main_~b~0 main_~a~0) (< main_~a~0 (+ main_~b~0 1)) (< 199999 main_~c~0) (<= main_~c~0 200000))} assume !(~c~0 == ~last~0 && 0 == ~st~0); {98240#(and (<= main_~b~0 main_~a~0) (< main_~a~0 (+ main_~b~0 1)) (< 199999 main_~c~0) (<= main_~c~0 200000))} is VALID [2022-04-15 06:34:32,654 INFO L290 TraceCheckUtils]: 11: Hoare triple {98315#(or (not (<= main_~c~0 (+ ~last~0 1))) (and (<= main_~b~0 main_~a~0) (< main_~a~0 (+ main_~b~0 1)) (< 199999 main_~c~0) (<= main_~c~0 200000)) (not (= main_~st~0 0)))} assume 0 == ~st~0 && ~c~0 == 1 + ~last~0;~a~0 := 3 + ~a~0;~b~0 := 3 + ~b~0; {98240#(and (<= main_~b~0 main_~a~0) (< main_~a~0 (+ main_~b~0 1)) (< 199999 main_~c~0) (<= main_~c~0 200000))} is VALID [2022-04-15 06:34:32,654 INFO L290 TraceCheckUtils]: 10: Hoare triple {98319#(or (not (<= main_~c~0 (+ ~last~0 1))) (and (<= main_~b~0 main_~a~0) (< main_~a~0 (+ main_~b~0 1)) (<= main_~c~0 200000)) (not (= main_~st~0 0)) (< main_~c~0 200000))} [233] L23-4_primed-->L23-4: Formula: (not (< v_main_~c~0_8 200000)) InVars {main_~c~0=v_main_~c~0_8} OutVars{main_~c~0=v_main_~c~0_8} AuxVars[] AssignedVars[] {98315#(or (not (<= main_~c~0 (+ ~last~0 1))) (and (<= main_~b~0 main_~a~0) (< main_~a~0 (+ main_~b~0 1)) (< 199999 main_~c~0) (<= main_~c~0 200000)) (not (= main_~st~0 0)))} is VALID [2022-04-15 06:34:32,655 INFO L290 TraceCheckUtils]: 9: Hoare triple {98323#(and (<= main_~b~0 main_~a~0) (< main_~a~0 (+ main_~b~0 1)) (not (= main_~st~0 0)))} [236] L23-3-->L23-4_primed: Formula: (let ((.cse2 (< v_main_~c~0_1700 200000)) (.cse3 (= v_~last~0_344 v_main_~c~0_1700)) (.cse0 (= v_main_~st~0_458 v_main_~st~0_457)) (.cse1 (= v_main_~c~0_1700 v_main_~c~0_1699))) (or (and (= |v_main_#t~post5_731| |v_main_#t~post5_727|) .cse0 .cse1 (= v_~last~0_344 v_~last~0_344)) (and (< v_main_~c~0_1700 v_main_~c~0_1699) .cse2 .cse3 (< v_main_~c~0_1699 (+ 2 v_main_~c~0_1700)) (= v_main_~st~0_457 0)) (and (= |v_main_#t~post5_727| |v_main_#t~post5_731|) (or (not .cse2) (not .cse3)) .cse0 .cse1))) InVars {main_~c~0=v_main_~c~0_1700, main_#t~post5=|v_main_#t~post5_731|, main_~st~0=v_main_~st~0_458, ~last~0=v_~last~0_344} OutVars{main_#t~post5=|v_main_#t~post5_727|, main_~c~0=v_main_~c~0_1699, main_~st~0=v_main_~st~0_457, ~last~0=v_~last~0_344} AuxVars[] AssignedVars[main_#t~post5, main_~c~0, main_~st~0] {98319#(or (not (<= main_~c~0 (+ ~last~0 1))) (and (<= main_~b~0 main_~a~0) (< main_~a~0 (+ main_~b~0 1)) (<= main_~c~0 200000)) (not (= main_~st~0 0)) (< main_~c~0 200000))} is VALID [2022-04-15 06:34:32,655 INFO L290 TraceCheckUtils]: 8: Hoare triple {98323#(and (<= main_~b~0 main_~a~0) (< main_~a~0 (+ main_~b~0 1)) (not (= main_~st~0 0)))} [235] L23-4_primed-->L23-3: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {98323#(and (<= main_~b~0 main_~a~0) (< main_~a~0 (+ main_~b~0 1)) (not (= main_~st~0 0)))} is VALID [2022-04-15 06:34:32,656 INFO L290 TraceCheckUtils]: 7: Hoare triple {98323#(and (<= main_~b~0 main_~a~0) (< main_~a~0 (+ main_~b~0 1)) (not (= main_~st~0 0)))} [234] L23-3-->L23-4_primed: Formula: (let ((.cse1 (= |v_main_#t~post5_728| |v_main_#t~post5_726|)) (.cse0 (= v_~last~0_343 v_main_~c~0_1698)) (.cse2 (= v_main_~c~0_1698 v_main_~c~0_1697))) (or (and (not .cse0) (< v_main_~c~0_1698 v_main_~c~0_1697) (< v_main_~c~0_1697 200001) (or (not (<= (+ v_main_~c~0_1698 1) v_~last~0_343)) (not (<= (+ v_~last~0_343 1) v_main_~c~0_1697)))) (and .cse1 (= v_~last~0_343 v_~last~0_343) .cse2) (and .cse1 (or .cse0 (not (< v_main_~c~0_1698 200000))) .cse2))) InVars {main_~c~0=v_main_~c~0_1698, main_#t~post5=|v_main_#t~post5_728|, ~last~0=v_~last~0_343} OutVars{main_#t~post5=|v_main_#t~post5_726|, main_~c~0=v_main_~c~0_1697, ~last~0=v_~last~0_343} AuxVars[] AssignedVars[main_#t~post5, main_~c~0] {98323#(and (<= main_~b~0 main_~a~0) (< main_~a~0 (+ main_~b~0 1)) (not (= main_~st~0 0)))} is VALID [2022-04-15 06:34:32,656 INFO L290 TraceCheckUtils]: 6: Hoare triple {98333#(and (<= main_~b~0 main_~a~0) (< main_~a~0 (+ main_~b~0 1)))} assume !false;~st~0 := 1;~c~0 := 0; {98323#(and (<= main_~b~0 main_~a~0) (< main_~a~0 (+ main_~b~0 1)) (not (= main_~st~0 0)))} is VALID [2022-04-15 06:34:32,657 INFO L290 TraceCheckUtils]: 5: Hoare triple {98231#true} assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~last~0 := #t~nondet4;havoc #t~nondet4;~a~0 := 0;~b~0 := 0;~c~0 := 0;~st~0 := 0; {98333#(and (<= main_~b~0 main_~a~0) (< main_~a~0 (+ main_~b~0 1)))} is VALID [2022-04-15 06:34:32,657 INFO L272 TraceCheckUtils]: 4: Hoare triple {98231#true} call #t~ret6 := main(); {98231#true} is VALID [2022-04-15 06:34:32,657 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {98231#true} {98231#true} #66#return; {98231#true} is VALID [2022-04-15 06:34:32,657 INFO L290 TraceCheckUtils]: 2: Hoare triple {98231#true} assume true; {98231#true} is VALID [2022-04-15 06:34:32,657 INFO L290 TraceCheckUtils]: 1: Hoare triple {98231#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(11, 2);call #Ultimate.allocInit(12, 3);~last~0 := 0; {98231#true} is VALID [2022-04-15 06:34:32,657 INFO L272 TraceCheckUtils]: 0: Hoare triple {98231#true} call ULTIMATE.init(); {98231#true} is VALID [2022-04-15 06:34:32,657 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-04-15 06:34:32,657 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1299459316] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 06:34:32,657 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 06:34:32,657 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9, 9] total 19 [2022-04-15 06:34:35,312 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 06:34:35,312 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1327710263] [2022-04-15 06:34:35,312 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1327710263] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 06:34:35,312 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 06:34:35,312 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [76] imperfect sequences [] total 76 [2022-04-15 06:34:35,313 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1044007460] [2022-04-15 06:34:35,313 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 06:34:35,313 INFO L78 Accepts]: Start accepts. Automaton has has 76 states, 76 states have (on average 1.4342105263157894) internal successors, (109), 74 states have internal predecessors, (109), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 113 [2022-04-15 06:34:35,313 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 06:34:35,313 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 76 states, 76 states have (on average 1.4342105263157894) internal successors, (109), 74 states have internal predecessors, (109), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:34:35,368 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 113 edges. 113 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 06:34:35,368 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 76 states [2022-04-15 06:34:35,368 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 06:34:35,368 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 76 interpolants. [2022-04-15 06:34:35,369 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=576, Invalid=6734, Unknown=0, NotChecked=0, Total=7310 [2022-04-15 06:34:35,369 INFO L87 Difference]: Start difference. First operand 614 states and 683 transitions. Second operand has 76 states, 76 states have (on average 1.4342105263157894) internal successors, (109), 74 states have internal predecessors, (109), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:34:48,535 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:34:48,536 INFO L93 Difference]: Finished difference Result 779 states and 873 transitions. [2022-04-15 06:34:48,536 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 110 states. [2022-04-15 06:34:48,536 INFO L78 Accepts]: Start accepts. Automaton has has 76 states, 76 states have (on average 1.4342105263157894) internal successors, (109), 74 states have internal predecessors, (109), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 113 [2022-04-15 06:34:48,536 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 06:34:48,537 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 76 states, 76 states have (on average 1.4342105263157894) internal successors, (109), 74 states have internal predecessors, (109), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:34:48,538 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 110 states and 235 transitions. [2022-04-15 06:34:48,538 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 76 states, 76 states have (on average 1.4342105263157894) internal successors, (109), 74 states have internal predecessors, (109), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:34:48,540 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 110 states and 235 transitions. [2022-04-15 06:34:48,540 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 110 states and 235 transitions. [2022-04-15 06:34:48,674 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 235 edges. 235 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 06:34:48,690 INFO L225 Difference]: With dead ends: 779 [2022-04-15 06:34:48,691 INFO L226 Difference]: Without dead ends: 669 [2022-04-15 06:34:48,691 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 181 GetRequests, 59 SyntacticMatches, 2 SemanticMatches, 120 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4174 ImplicationChecksByTransitivity, 3.9s TimeCoverageRelationStatistics Valid=923, Invalid=13839, Unknown=0, NotChecked=0, Total=14762 [2022-04-15 06:34:48,693 INFO L913 BasicCegarLoop]: 16 mSDtfsCounter, 217 mSDsluCounter, 74 mSDsCounter, 0 mSdLazyCounter, 8216 mSolverCounterSat, 146 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 219 SdHoareTripleChecker+Valid, 90 SdHoareTripleChecker+Invalid, 8362 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 146 IncrementalHoareTripleChecker+Valid, 8216 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.6s IncrementalHoareTripleChecker+Time [2022-04-15 06:34:48,693 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [219 Valid, 90 Invalid, 8362 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [146 Valid, 8216 Invalid, 0 Unknown, 0 Unchecked, 4.6s Time] [2022-04-15 06:34:48,693 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 669 states. [2022-04-15 06:34:52,448 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 669 to 617. [2022-04-15 06:34:52,448 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 06:34:52,448 INFO L82 GeneralOperation]: Start isEquivalent. First operand 669 states. Second operand has 617 states, 609 states have (on average 1.116584564860427) internal successors, (680), 610 states have internal predecessors, (680), 4 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-15 06:34:52,449 INFO L74 IsIncluded]: Start isIncluded. First operand 669 states. Second operand has 617 states, 609 states have (on average 1.116584564860427) internal successors, (680), 610 states have internal predecessors, (680), 4 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-15 06:34:52,449 INFO L87 Difference]: Start difference. First operand 669 states. Second operand has 617 states, 609 states have (on average 1.116584564860427) internal successors, (680), 610 states have internal predecessors, (680), 4 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-15 06:34:52,460 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:34:52,461 INFO L93 Difference]: Finished difference Result 669 states and 741 transitions. [2022-04-15 06:34:52,461 INFO L276 IsEmpty]: Start isEmpty. Operand 669 states and 741 transitions. [2022-04-15 06:34:52,461 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 06:34:52,461 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 06:34:52,462 INFO L74 IsIncluded]: Start isIncluded. First operand has 617 states, 609 states have (on average 1.116584564860427) internal successors, (680), 610 states have internal predecessors, (680), 4 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) Second operand 669 states. [2022-04-15 06:34:52,462 INFO L87 Difference]: Start difference. First operand has 617 states, 609 states have (on average 1.116584564860427) internal successors, (680), 610 states have internal predecessors, (680), 4 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) Second operand 669 states. [2022-04-15 06:34:52,474 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:34:52,474 INFO L93 Difference]: Finished difference Result 669 states and 741 transitions. [2022-04-15 06:34:52,474 INFO L276 IsEmpty]: Start isEmpty. Operand 669 states and 741 transitions. [2022-04-15 06:34:52,474 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 06:34:52,474 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 06:34:52,474 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 06:34:52,474 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 06:34:52,474 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 617 states, 609 states have (on average 1.116584564860427) internal successors, (680), 610 states have internal predecessors, (680), 4 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-15 06:34:52,488 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 617 states to 617 states and 687 transitions. [2022-04-15 06:34:52,489 INFO L78 Accepts]: Start accepts. Automaton has 617 states and 687 transitions. Word has length 113 [2022-04-15 06:34:52,489 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 06:34:52,489 INFO L478 AbstractCegarLoop]: Abstraction has 617 states and 687 transitions. [2022-04-15 06:34:52,489 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 76 states, 76 states have (on average 1.4342105263157894) internal successors, (109), 74 states have internal predecessors, (109), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:34:52,489 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 617 states and 687 transitions. [2022-04-15 06:34:54,816 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 687 edges. 687 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 06:34:54,816 INFO L276 IsEmpty]: Start isEmpty. Operand 617 states and 687 transitions. [2022-04-15 06:34:54,817 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2022-04-15 06:34:54,817 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 06:34:54,817 INFO L499 BasicCegarLoop]: trace histogram [34, 34, 33, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 06:34:54,833 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (48)] Forceful destruction successful, exit code 0 [2022-04-15 06:34:55,031 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable51,48 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 06:34:55,031 INFO L403 AbstractCegarLoop]: === Iteration 53 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 06:34:55,031 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 06:34:55,032 INFO L85 PathProgramCache]: Analyzing trace with hash -339425273, now seen corresponding path program 33 times [2022-04-15 06:34:55,032 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 06:34:55,032 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [511020728] [2022-04-15 06:34:59,152 WARN L977 rdanLoopAcceleration]: Unable to prove correctness of quantifier elimination. [2022-04-15 06:34:59,263 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 1 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-15 06:34:59,522 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {0={1=1}, 1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-15 06:34:59,524 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-15 06:34:59,526 INFO L85 PathProgramCache]: Analyzing trace with hash -1130072376, now seen corresponding path program 1 times [2022-04-15 06:34:59,527 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 06:34:59,527 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1822215218] [2022-04-15 06:34:59,527 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 06:34:59,527 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 06:34:59,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:34:59,664 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 06:34:59,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:34:59,676 INFO L290 TraceCheckUtils]: 0: Hoare triple {102636#(and (= ~last~0 |old(~last~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(11, 2);call #Ultimate.allocInit(12, 3);~last~0 := 0; {102623#true} is VALID [2022-04-15 06:34:59,676 INFO L290 TraceCheckUtils]: 1: Hoare triple {102623#true} assume true; {102623#true} is VALID [2022-04-15 06:34:59,676 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {102623#true} {102623#true} #66#return; {102623#true} is VALID [2022-04-15 06:34:59,676 INFO L272 TraceCheckUtils]: 0: Hoare triple {102623#true} call ULTIMATE.init(); {102636#(and (= ~last~0 |old(~last~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 06:34:59,676 INFO L290 TraceCheckUtils]: 1: Hoare triple {102636#(and (= ~last~0 |old(~last~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(11, 2);call #Ultimate.allocInit(12, 3);~last~0 := 0; {102623#true} is VALID [2022-04-15 06:34:59,676 INFO L290 TraceCheckUtils]: 2: Hoare triple {102623#true} assume true; {102623#true} is VALID [2022-04-15 06:34:59,676 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {102623#true} {102623#true} #66#return; {102623#true} is VALID [2022-04-15 06:34:59,676 INFO L272 TraceCheckUtils]: 4: Hoare triple {102623#true} call #t~ret6 := main(); {102623#true} is VALID [2022-04-15 06:34:59,677 INFO L290 TraceCheckUtils]: 5: Hoare triple {102623#true} assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~last~0 := #t~nondet4;havoc #t~nondet4;~a~0 := 0;~b~0 := 0;~c~0 := 0;~st~0 := 0; {102628#(and (= main_~a~0 0) (= main_~b~0 0))} is VALID [2022-04-15 06:34:59,677 INFO L290 TraceCheckUtils]: 6: Hoare triple {102628#(and (= main_~a~0 0) (= main_~b~0 0))} assume !false;~st~0 := 1;~c~0 := 0; {102629#(and (= main_~a~0 0) (= main_~b~0 0) (= main_~c~0 0))} is VALID [2022-04-15 06:34:59,678 INFO L290 TraceCheckUtils]: 7: Hoare triple {102629#(and (= main_~a~0 0) (= main_~b~0 0) (= main_~c~0 0))} [238] L23-3-->L23-4_primed: Formula: (let ((.cse0 (= v_~last~0_351 v_main_~c~0_1748)) (.cse1 (= v_main_~c~0_1748 v_main_~c~0_1747))) (or (and (< v_main_~c~0_1747 200001) (or (not (<= (+ v_~last~0_351 1) v_main_~c~0_1747)) (not (<= (+ v_main_~c~0_1748 1) v_~last~0_351))) (not .cse0) (< v_main_~c~0_1748 v_main_~c~0_1747)) (and (or .cse0 (not (< v_main_~c~0_1748 200000))) (= |v_main_#t~post5_739| |v_main_#t~post5_741|) .cse1) (and (= v_~last~0_351 v_~last~0_351) .cse1 (= |v_main_#t~post5_741| |v_main_#t~post5_739|)))) InVars {main_~c~0=v_main_~c~0_1748, main_#t~post5=|v_main_#t~post5_741|, ~last~0=v_~last~0_351} OutVars{main_#t~post5=|v_main_#t~post5_739|, main_~c~0=v_main_~c~0_1747, ~last~0=v_~last~0_351} AuxVars[] AssignedVars[main_#t~post5, main_~c~0] {102630#(and (= main_~a~0 0) (= main_~b~0 0) (<= main_~c~0 200000))} is VALID [2022-04-15 06:34:59,678 INFO L290 TraceCheckUtils]: 8: Hoare triple {102630#(and (= main_~a~0 0) (= main_~b~0 0) (<= main_~c~0 200000))} [239] L23-4_primed-->L23-3: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {102630#(and (= main_~a~0 0) (= main_~b~0 0) (<= main_~c~0 200000))} is VALID [2022-04-15 06:34:59,679 INFO L290 TraceCheckUtils]: 9: Hoare triple {102630#(and (= main_~a~0 0) (= main_~b~0 0) (<= main_~c~0 200000))} [240] L23-3-->L23-4_primed: Formula: (let ((.cse2 (= v_~last~0_352 v_main_~c~0_1750)) (.cse3 (< v_main_~c~0_1750 200000)) (.cse0 (= |v_main_#t~post5_744| |v_main_#t~post5_740|)) (.cse1 (= v_main_~c~0_1750 v_main_~c~0_1749)) (.cse4 (= v_main_~st~0_468 v_main_~st~0_467))) (or (and .cse0 .cse1 (or (not .cse2) (not .cse3)) .cse4) (and .cse2 (<= v_main_~c~0_1749 (+ v_~last~0_352 1)) (< v_main_~c~0_1750 v_main_~c~0_1749) .cse3 (= v_main_~st~0_467 0)) (and (= v_~last~0_352 v_~last~0_352) .cse0 .cse1 .cse4))) InVars {main_~c~0=v_main_~c~0_1750, main_#t~post5=|v_main_#t~post5_744|, main_~st~0=v_main_~st~0_468, ~last~0=v_~last~0_352} OutVars{main_#t~post5=|v_main_#t~post5_740|, main_~c~0=v_main_~c~0_1749, main_~st~0=v_main_~st~0_467, ~last~0=v_~last~0_352} AuxVars[] AssignedVars[main_#t~post5, main_~c~0, main_~st~0] {102631#(and (= main_~a~0 0) (or (<= ~last~0 199999) (<= main_~c~0 200000)) (= main_~b~0 0))} is VALID [2022-04-15 06:34:59,679 INFO L290 TraceCheckUtils]: 10: Hoare triple {102631#(and (= main_~a~0 0) (or (<= ~last~0 199999) (<= main_~c~0 200000)) (= main_~b~0 0))} [237] L23-4_primed-->L23-4: Formula: (not (< v_main_~c~0_8 200000)) InVars {main_~c~0=v_main_~c~0_8} OutVars{main_~c~0=v_main_~c~0_8} AuxVars[] AssignedVars[] {102632#(and (= main_~a~0 0) (= main_~b~0 0) (or (and (< 199999 main_~c~0) (<= main_~c~0 200000)) (and (<= ~last~0 199999) (< 199999 main_~c~0))))} is VALID [2022-04-15 06:34:59,680 INFO L290 TraceCheckUtils]: 11: Hoare triple {102632#(and (= main_~a~0 0) (= main_~b~0 0) (or (and (< 199999 main_~c~0) (<= main_~c~0 200000)) (and (<= ~last~0 199999) (< 199999 main_~c~0))))} assume 0 == ~st~0 && ~c~0 == 1 + ~last~0;~a~0 := 3 + ~a~0;~b~0 := 3 + ~b~0; {102633#(and (<= main_~b~0 main_~a~0) (< main_~a~0 (+ main_~b~0 1)) (< 199999 main_~c~0) (<= main_~c~0 200000))} is VALID [2022-04-15 06:34:59,680 INFO L290 TraceCheckUtils]: 12: Hoare triple {102633#(and (<= main_~b~0 main_~a~0) (< main_~a~0 (+ main_~b~0 1)) (< 199999 main_~c~0) (<= main_~c~0 200000))} assume !(~c~0 == ~last~0 && 0 == ~st~0); {102633#(and (<= main_~b~0 main_~a~0) (< main_~a~0 (+ main_~b~0 1)) (< 199999 main_~c~0) (<= main_~c~0 200000))} is VALID [2022-04-15 06:34:59,681 INFO L272 TraceCheckUtils]: 13: Hoare triple {102633#(and (<= main_~b~0 main_~a~0) (< main_~a~0 (+ main_~b~0 1)) (< 199999 main_~c~0) (<= main_~c~0 200000))} call __VERIFIER_assert((if ~a~0 == ~b~0 && 200000 == ~c~0 then 1 else 0)); {102634#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-15 06:34:59,681 INFO L290 TraceCheckUtils]: 14: Hoare triple {102634#(not (= |__VERIFIER_assert_#in~cond| 0))} ~cond := #in~cond; {102635#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-15 06:34:59,681 INFO L290 TraceCheckUtils]: 15: Hoare triple {102635#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {102624#false} is VALID [2022-04-15 06:34:59,682 INFO L290 TraceCheckUtils]: 16: Hoare triple {102624#false} assume !false; {102624#false} is VALID [2022-04-15 06:34:59,682 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 06:34:59,682 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 06:34:59,682 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1822215218] [2022-04-15 06:34:59,682 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1822215218] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 06:34:59,682 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2111905124] [2022-04-15 06:34:59,682 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 06:34:59,682 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 06:34:59,682 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 06:34:59,695 INFO L229 MonitoredProcess]: Starting monitored process 49 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-15 06:34:59,714 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (49)] Waiting until timeout for monitored process [2022-04-15 06:34:59,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:34:59,728 INFO L263 TraceCheckSpWp]: Trace formula consists of 85 conjuncts, 18 conjunts are in the unsatisfiable core [2022-04-15 06:34:59,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:34:59,734 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 06:35:00,009 INFO L272 TraceCheckUtils]: 0: Hoare triple {102623#true} call ULTIMATE.init(); {102623#true} is VALID [2022-04-15 06:35:00,009 INFO L290 TraceCheckUtils]: 1: Hoare triple {102623#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(11, 2);call #Ultimate.allocInit(12, 3);~last~0 := 0; {102623#true} is VALID [2022-04-15 06:35:00,010 INFO L290 TraceCheckUtils]: 2: Hoare triple {102623#true} assume true; {102623#true} is VALID [2022-04-15 06:35:00,010 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {102623#true} {102623#true} #66#return; {102623#true} is VALID [2022-04-15 06:35:00,010 INFO L272 TraceCheckUtils]: 4: Hoare triple {102623#true} call #t~ret6 := main(); {102623#true} is VALID [2022-04-15 06:35:00,010 INFO L290 TraceCheckUtils]: 5: Hoare triple {102623#true} assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~last~0 := #t~nondet4;havoc #t~nondet4;~a~0 := 0;~b~0 := 0;~c~0 := 0;~st~0 := 0; {102628#(and (= main_~a~0 0) (= main_~b~0 0))} is VALID [2022-04-15 06:35:00,010 INFO L290 TraceCheckUtils]: 6: Hoare triple {102628#(and (= main_~a~0 0) (= main_~b~0 0))} assume !false;~st~0 := 1;~c~0 := 0; {102658#(and (= main_~a~0 0) (= main_~st~0 1) (= main_~b~0 0))} is VALID [2022-04-15 06:35:00,011 INFO L290 TraceCheckUtils]: 7: Hoare triple {102658#(and (= main_~a~0 0) (= main_~st~0 1) (= main_~b~0 0))} [238] L23-3-->L23-4_primed: Formula: (let ((.cse0 (= v_~last~0_351 v_main_~c~0_1748)) (.cse1 (= v_main_~c~0_1748 v_main_~c~0_1747))) (or (and (< v_main_~c~0_1747 200001) (or (not (<= (+ v_~last~0_351 1) v_main_~c~0_1747)) (not (<= (+ v_main_~c~0_1748 1) v_~last~0_351))) (not .cse0) (< v_main_~c~0_1748 v_main_~c~0_1747)) (and (or .cse0 (not (< v_main_~c~0_1748 200000))) (= |v_main_#t~post5_739| |v_main_#t~post5_741|) .cse1) (and (= v_~last~0_351 v_~last~0_351) .cse1 (= |v_main_#t~post5_741| |v_main_#t~post5_739|)))) InVars {main_~c~0=v_main_~c~0_1748, main_#t~post5=|v_main_#t~post5_741|, ~last~0=v_~last~0_351} OutVars{main_#t~post5=|v_main_#t~post5_739|, main_~c~0=v_main_~c~0_1747, ~last~0=v_~last~0_351} AuxVars[] AssignedVars[main_#t~post5, main_~c~0] {102658#(and (= main_~a~0 0) (= main_~st~0 1) (= main_~b~0 0))} is VALID [2022-04-15 06:35:00,011 INFO L290 TraceCheckUtils]: 8: Hoare triple {102658#(and (= main_~a~0 0) (= main_~st~0 1) (= main_~b~0 0))} [239] L23-4_primed-->L23-3: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {102658#(and (= main_~a~0 0) (= main_~st~0 1) (= main_~b~0 0))} is VALID [2022-04-15 06:35:00,012 INFO L290 TraceCheckUtils]: 9: Hoare triple {102658#(and (= main_~a~0 0) (= main_~st~0 1) (= main_~b~0 0))} [240] L23-3-->L23-4_primed: Formula: (let ((.cse2 (= v_~last~0_352 v_main_~c~0_1750)) (.cse3 (< v_main_~c~0_1750 200000)) (.cse0 (= |v_main_#t~post5_744| |v_main_#t~post5_740|)) (.cse1 (= v_main_~c~0_1750 v_main_~c~0_1749)) (.cse4 (= v_main_~st~0_468 v_main_~st~0_467))) (or (and .cse0 .cse1 (or (not .cse2) (not .cse3)) .cse4) (and .cse2 (<= v_main_~c~0_1749 (+ v_~last~0_352 1)) (< v_main_~c~0_1750 v_main_~c~0_1749) .cse3 (= v_main_~st~0_467 0)) (and (= v_~last~0_352 v_~last~0_352) .cse0 .cse1 .cse4))) InVars {main_~c~0=v_main_~c~0_1750, main_#t~post5=|v_main_#t~post5_744|, main_~st~0=v_main_~st~0_468, ~last~0=v_~last~0_352} OutVars{main_#t~post5=|v_main_#t~post5_740|, main_~c~0=v_main_~c~0_1749, main_~st~0=v_main_~st~0_467, ~last~0=v_~last~0_352} AuxVars[] AssignedVars[main_#t~post5, main_~c~0, main_~st~0] {102668#(and (= main_~a~0 0) (= main_~b~0 0) (or (and (< ~last~0 200000) (< ~last~0 main_~c~0) (<= main_~c~0 (+ ~last~0 1)) (= main_~st~0 0)) (= main_~st~0 1)))} is VALID [2022-04-15 06:35:00,013 INFO L290 TraceCheckUtils]: 10: Hoare triple {102668#(and (= main_~a~0 0) (= main_~b~0 0) (or (and (< ~last~0 200000) (< ~last~0 main_~c~0) (<= main_~c~0 (+ ~last~0 1)) (= main_~st~0 0)) (= main_~st~0 1)))} [237] L23-4_primed-->L23-4: Formula: (not (< v_main_~c~0_8 200000)) InVars {main_~c~0=v_main_~c~0_8} OutVars{main_~c~0=v_main_~c~0_8} AuxVars[] AssignedVars[] {102672#(and (= main_~a~0 0) (or (= main_~st~0 1) (and (< ~last~0 200000) (<= main_~c~0 (+ ~last~0 1)) (= main_~st~0 0))) (= main_~b~0 0) (not (< main_~c~0 200000)))} is VALID [2022-04-15 06:35:00,013 INFO L290 TraceCheckUtils]: 11: Hoare triple {102672#(and (= main_~a~0 0) (or (= main_~st~0 1) (and (< ~last~0 200000) (<= main_~c~0 (+ ~last~0 1)) (= main_~st~0 0))) (= main_~b~0 0) (not (< main_~c~0 200000)))} assume 0 == ~st~0 && ~c~0 == 1 + ~last~0;~a~0 := 3 + ~a~0;~b~0 := 3 + ~b~0; {102676#(and (= main_~b~0 3) (<= 200000 main_~c~0) (< main_~c~0 200001) (= main_~a~0 3))} is VALID [2022-04-15 06:35:00,013 INFO L290 TraceCheckUtils]: 12: Hoare triple {102676#(and (= main_~b~0 3) (<= 200000 main_~c~0) (< main_~c~0 200001) (= main_~a~0 3))} assume !(~c~0 == ~last~0 && 0 == ~st~0); {102676#(and (= main_~b~0 3) (<= 200000 main_~c~0) (< main_~c~0 200001) (= main_~a~0 3))} is VALID [2022-04-15 06:35:00,014 INFO L272 TraceCheckUtils]: 13: Hoare triple {102676#(and (= main_~b~0 3) (<= 200000 main_~c~0) (< main_~c~0 200001) (= main_~a~0 3))} call __VERIFIER_assert((if ~a~0 == ~b~0 && 200000 == ~c~0 then 1 else 0)); {102683#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-15 06:35:00,014 INFO L290 TraceCheckUtils]: 14: Hoare triple {102683#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {102687#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-15 06:35:00,015 INFO L290 TraceCheckUtils]: 15: Hoare triple {102687#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {102624#false} is VALID [2022-04-15 06:35:00,015 INFO L290 TraceCheckUtils]: 16: Hoare triple {102624#false} assume !false; {102624#false} is VALID [2022-04-15 06:35:00,015 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-04-15 06:35:00,015 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 06:35:00,399 INFO L290 TraceCheckUtils]: 16: Hoare triple {102624#false} assume !false; {102624#false} is VALID [2022-04-15 06:35:00,400 INFO L290 TraceCheckUtils]: 15: Hoare triple {102687#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {102624#false} is VALID [2022-04-15 06:35:00,400 INFO L290 TraceCheckUtils]: 14: Hoare triple {102683#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {102687#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-15 06:35:00,401 INFO L272 TraceCheckUtils]: 13: Hoare triple {102633#(and (<= main_~b~0 main_~a~0) (< main_~a~0 (+ main_~b~0 1)) (< 199999 main_~c~0) (<= main_~c~0 200000))} call __VERIFIER_assert((if ~a~0 == ~b~0 && 200000 == ~c~0 then 1 else 0)); {102683#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-15 06:35:00,401 INFO L290 TraceCheckUtils]: 12: Hoare triple {102633#(and (<= main_~b~0 main_~a~0) (< main_~a~0 (+ main_~b~0 1)) (< 199999 main_~c~0) (<= main_~c~0 200000))} assume !(~c~0 == ~last~0 && 0 == ~st~0); {102633#(and (<= main_~b~0 main_~a~0) (< main_~a~0 (+ main_~b~0 1)) (< 199999 main_~c~0) (<= main_~c~0 200000))} is VALID [2022-04-15 06:35:00,402 INFO L290 TraceCheckUtils]: 11: Hoare triple {102709#(or (not (<= main_~c~0 (+ ~last~0 1))) (and (<= main_~b~0 main_~a~0) (< main_~a~0 (+ main_~b~0 1)) (< 199999 main_~c~0) (<= main_~c~0 200000)) (not (= main_~st~0 0)))} assume 0 == ~st~0 && ~c~0 == 1 + ~last~0;~a~0 := 3 + ~a~0;~b~0 := 3 + ~b~0; {102633#(and (<= main_~b~0 main_~a~0) (< main_~a~0 (+ main_~b~0 1)) (< 199999 main_~c~0) (<= main_~c~0 200000))} is VALID [2022-04-15 06:35:00,402 INFO L290 TraceCheckUtils]: 10: Hoare triple {102713#(or (not (<= main_~c~0 (+ ~last~0 1))) (and (<= main_~b~0 main_~a~0) (< main_~a~0 (+ main_~b~0 1)) (<= main_~c~0 200000)) (not (= main_~st~0 0)) (< main_~c~0 200000))} [237] L23-4_primed-->L23-4: Formula: (not (< v_main_~c~0_8 200000)) InVars {main_~c~0=v_main_~c~0_8} OutVars{main_~c~0=v_main_~c~0_8} AuxVars[] AssignedVars[] {102709#(or (not (<= main_~c~0 (+ ~last~0 1))) (and (<= main_~b~0 main_~a~0) (< main_~a~0 (+ main_~b~0 1)) (< 199999 main_~c~0) (<= main_~c~0 200000)) (not (= main_~st~0 0)))} is VALID [2022-04-15 06:35:00,403 INFO L290 TraceCheckUtils]: 9: Hoare triple {102717#(and (<= main_~b~0 main_~a~0) (< main_~a~0 (+ main_~b~0 1)) (not (= main_~st~0 0)))} [240] L23-3-->L23-4_primed: Formula: (let ((.cse2 (= v_~last~0_352 v_main_~c~0_1750)) (.cse3 (< v_main_~c~0_1750 200000)) (.cse0 (= |v_main_#t~post5_744| |v_main_#t~post5_740|)) (.cse1 (= v_main_~c~0_1750 v_main_~c~0_1749)) (.cse4 (= v_main_~st~0_468 v_main_~st~0_467))) (or (and .cse0 .cse1 (or (not .cse2) (not .cse3)) .cse4) (and .cse2 (<= v_main_~c~0_1749 (+ v_~last~0_352 1)) (< v_main_~c~0_1750 v_main_~c~0_1749) .cse3 (= v_main_~st~0_467 0)) (and (= v_~last~0_352 v_~last~0_352) .cse0 .cse1 .cse4))) InVars {main_~c~0=v_main_~c~0_1750, main_#t~post5=|v_main_#t~post5_744|, main_~st~0=v_main_~st~0_468, ~last~0=v_~last~0_352} OutVars{main_#t~post5=|v_main_#t~post5_740|, main_~c~0=v_main_~c~0_1749, main_~st~0=v_main_~st~0_467, ~last~0=v_~last~0_352} AuxVars[] AssignedVars[main_#t~post5, main_~c~0, main_~st~0] {102713#(or (not (<= main_~c~0 (+ ~last~0 1))) (and (<= main_~b~0 main_~a~0) (< main_~a~0 (+ main_~b~0 1)) (<= main_~c~0 200000)) (not (= main_~st~0 0)) (< main_~c~0 200000))} is VALID [2022-04-15 06:35:00,404 INFO L290 TraceCheckUtils]: 8: Hoare triple {102717#(and (<= main_~b~0 main_~a~0) (< main_~a~0 (+ main_~b~0 1)) (not (= main_~st~0 0)))} [239] L23-4_primed-->L23-3: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {102717#(and (<= main_~b~0 main_~a~0) (< main_~a~0 (+ main_~b~0 1)) (not (= main_~st~0 0)))} is VALID [2022-04-15 06:35:00,404 INFO L290 TraceCheckUtils]: 7: Hoare triple {102717#(and (<= main_~b~0 main_~a~0) (< main_~a~0 (+ main_~b~0 1)) (not (= main_~st~0 0)))} [238] L23-3-->L23-4_primed: Formula: (let ((.cse0 (= v_~last~0_351 v_main_~c~0_1748)) (.cse1 (= v_main_~c~0_1748 v_main_~c~0_1747))) (or (and (< v_main_~c~0_1747 200001) (or (not (<= (+ v_~last~0_351 1) v_main_~c~0_1747)) (not (<= (+ v_main_~c~0_1748 1) v_~last~0_351))) (not .cse0) (< v_main_~c~0_1748 v_main_~c~0_1747)) (and (or .cse0 (not (< v_main_~c~0_1748 200000))) (= |v_main_#t~post5_739| |v_main_#t~post5_741|) .cse1) (and (= v_~last~0_351 v_~last~0_351) .cse1 (= |v_main_#t~post5_741| |v_main_#t~post5_739|)))) InVars {main_~c~0=v_main_~c~0_1748, main_#t~post5=|v_main_#t~post5_741|, ~last~0=v_~last~0_351} OutVars{main_#t~post5=|v_main_#t~post5_739|, main_~c~0=v_main_~c~0_1747, ~last~0=v_~last~0_351} AuxVars[] AssignedVars[main_#t~post5, main_~c~0] {102717#(and (<= main_~b~0 main_~a~0) (< main_~a~0 (+ main_~b~0 1)) (not (= main_~st~0 0)))} is VALID [2022-04-15 06:35:00,404 INFO L290 TraceCheckUtils]: 6: Hoare triple {102727#(and (<= main_~b~0 main_~a~0) (< main_~a~0 (+ main_~b~0 1)))} assume !false;~st~0 := 1;~c~0 := 0; {102717#(and (<= main_~b~0 main_~a~0) (< main_~a~0 (+ main_~b~0 1)) (not (= main_~st~0 0)))} is VALID [2022-04-15 06:35:00,405 INFO L290 TraceCheckUtils]: 5: Hoare triple {102623#true} assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~last~0 := #t~nondet4;havoc #t~nondet4;~a~0 := 0;~b~0 := 0;~c~0 := 0;~st~0 := 0; {102727#(and (<= main_~b~0 main_~a~0) (< main_~a~0 (+ main_~b~0 1)))} is VALID [2022-04-15 06:35:00,405 INFO L272 TraceCheckUtils]: 4: Hoare triple {102623#true} call #t~ret6 := main(); {102623#true} is VALID [2022-04-15 06:35:00,405 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {102623#true} {102623#true} #66#return; {102623#true} is VALID [2022-04-15 06:35:00,405 INFO L290 TraceCheckUtils]: 2: Hoare triple {102623#true} assume true; {102623#true} is VALID [2022-04-15 06:35:00,405 INFO L290 TraceCheckUtils]: 1: Hoare triple {102623#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(11, 2);call #Ultimate.allocInit(12, 3);~last~0 := 0; {102623#true} is VALID [2022-04-15 06:35:00,405 INFO L272 TraceCheckUtils]: 0: Hoare triple {102623#true} call ULTIMATE.init(); {102623#true} is VALID [2022-04-15 06:35:00,405 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-04-15 06:35:00,405 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2111905124] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 06:35:00,405 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 06:35:00,405 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 9, 9] total 21 [2022-04-15 06:35:03,826 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 06:35:03,827 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [511020728] [2022-04-15 06:35:03,828 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [511020728] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 06:35:03,828 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 06:35:03,828 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [78] imperfect sequences [] total 78 [2022-04-15 06:35:03,828 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [493994045] [2022-04-15 06:35:03,828 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 06:35:03,828 INFO L78 Accepts]: Start accepts. Automaton has has 78 states, 78 states have (on average 1.435897435897436) internal successors, (112), 76 states have internal predecessors, (112), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 116 [2022-04-15 06:35:03,829 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 06:35:03,829 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 78 states, 78 states have (on average 1.435897435897436) internal successors, (112), 76 states have internal predecessors, (112), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:35:03,892 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 116 edges. 116 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 06:35:03,892 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 78 states [2022-04-15 06:35:03,892 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 06:35:03,898 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 78 interpolants. [2022-04-15 06:35:03,898 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=679, Invalid=7511, Unknown=0, NotChecked=0, Total=8190 [2022-04-15 06:35:03,899 INFO L87 Difference]: Start difference. First operand 617 states and 687 transitions. Second operand has 78 states, 78 states have (on average 1.435897435897436) internal successors, (112), 76 states have internal predecessors, (112), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:35:16,925 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:35:16,925 INFO L93 Difference]: Finished difference Result 822 states and 935 transitions. [2022-04-15 06:35:16,925 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 96 states. [2022-04-15 06:35:16,925 INFO L78 Accepts]: Start accepts. Automaton has has 78 states, 78 states have (on average 1.435897435897436) internal successors, (112), 76 states have internal predecessors, (112), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 116 [2022-04-15 06:35:16,925 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 06:35:16,925 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 78 states, 78 states have (on average 1.435897435897436) internal successors, (112), 76 states have internal predecessors, (112), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:35:16,927 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 200 transitions. [2022-04-15 06:35:16,927 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 78 states, 78 states have (on average 1.435897435897436) internal successors, (112), 76 states have internal predecessors, (112), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:35:16,928 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 200 transitions. [2022-04-15 06:35:16,928 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 96 states and 200 transitions. [2022-04-15 06:35:17,037 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 200 edges. 200 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 06:35:17,056 INFO L225 Difference]: With dead ends: 822 [2022-04-15 06:35:17,056 INFO L226 Difference]: Without dead ends: 712 [2022-04-15 06:35:17,057 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 171 GetRequests, 58 SyntacticMatches, 2 SemanticMatches, 111 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3749 ImplicationChecksByTransitivity, 4.0s TimeCoverageRelationStatistics Valid=903, Invalid=11753, Unknown=0, NotChecked=0, Total=12656 [2022-04-15 06:35:17,057 INFO L913 BasicCegarLoop]: 13 mSDtfsCounter, 116 mSDsluCounter, 92 mSDsCounter, 0 mSdLazyCounter, 7559 mSolverCounterSat, 66 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 117 SdHoareTripleChecker+Valid, 105 SdHoareTripleChecker+Invalid, 7625 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 66 IncrementalHoareTripleChecker+Valid, 7559 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.6s IncrementalHoareTripleChecker+Time [2022-04-15 06:35:17,057 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [117 Valid, 105 Invalid, 7625 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [66 Valid, 7559 Invalid, 0 Unknown, 0 Unchecked, 4.6s Time] [2022-04-15 06:35:17,058 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 712 states. [2022-04-15 06:35:19,404 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 712 to 576. [2022-04-15 06:35:19,405 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 06:35:19,405 INFO L82 GeneralOperation]: Start isEquivalent. First operand 712 states. Second operand has 576 states, 568 states have (on average 1.125) internal successors, (639), 569 states have internal predecessors, (639), 4 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-15 06:35:19,406 INFO L74 IsIncluded]: Start isIncluded. First operand 712 states. Second operand has 576 states, 568 states have (on average 1.125) internal successors, (639), 569 states have internal predecessors, (639), 4 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-15 06:35:19,406 INFO L87 Difference]: Start difference. First operand 712 states. Second operand has 576 states, 568 states have (on average 1.125) internal successors, (639), 569 states have internal predecessors, (639), 4 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-15 06:35:19,419 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:35:19,419 INFO L93 Difference]: Finished difference Result 712 states and 803 transitions. [2022-04-15 06:35:19,419 INFO L276 IsEmpty]: Start isEmpty. Operand 712 states and 803 transitions. [2022-04-15 06:35:19,419 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 06:35:19,419 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 06:35:19,419 INFO L74 IsIncluded]: Start isIncluded. First operand has 576 states, 568 states have (on average 1.125) internal successors, (639), 569 states have internal predecessors, (639), 4 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) Second operand 712 states. [2022-04-15 06:35:19,420 INFO L87 Difference]: Start difference. First operand has 576 states, 568 states have (on average 1.125) internal successors, (639), 569 states have internal predecessors, (639), 4 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) Second operand 712 states. [2022-04-15 06:35:19,433 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:35:19,433 INFO L93 Difference]: Finished difference Result 712 states and 803 transitions. [2022-04-15 06:35:19,433 INFO L276 IsEmpty]: Start isEmpty. Operand 712 states and 803 transitions. [2022-04-15 06:35:19,434 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 06:35:19,434 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 06:35:19,434 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 06:35:19,434 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 06:35:19,434 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 576 states, 568 states have (on average 1.125) internal successors, (639), 569 states have internal predecessors, (639), 4 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-15 06:35:19,447 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 576 states to 576 states and 646 transitions. [2022-04-15 06:35:19,447 INFO L78 Accepts]: Start accepts. Automaton has 576 states and 646 transitions. Word has length 116 [2022-04-15 06:35:19,447 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 06:35:19,447 INFO L478 AbstractCegarLoop]: Abstraction has 576 states and 646 transitions. [2022-04-15 06:35:19,447 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 78 states, 78 states have (on average 1.435897435897436) internal successors, (112), 76 states have internal predecessors, (112), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:35:19,447 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 576 states and 646 transitions. [2022-04-15 06:35:21,916 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 646 edges. 646 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 06:35:21,917 INFO L276 IsEmpty]: Start isEmpty. Operand 576 states and 646 transitions. [2022-04-15 06:35:21,917 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2022-04-15 06:35:21,917 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 06:35:21,917 INFO L499 BasicCegarLoop]: trace histogram [32, 32, 30, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 06:35:21,935 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (49)] Forceful destruction successful, exit code 0 [2022-04-15 06:35:22,123 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable52,49 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 06:35:22,123 INFO L403 AbstractCegarLoop]: === Iteration 54 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 06:35:22,123 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 06:35:22,123 INFO L85 PathProgramCache]: Analyzing trace with hash 1880204290, now seen corresponding path program 15 times [2022-04-15 06:35:22,123 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 06:35:22,123 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [2079136292] [2022-04-15 06:35:22,351 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 4 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {0={1=3}, 1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-15 06:35:22,351 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-15 06:35:22,351 INFO L85 PathProgramCache]: Analyzing trace with hash 1808689523, now seen corresponding path program 1 times [2022-04-15 06:35:22,351 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 06:35:22,351 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1020356550] [2022-04-15 06:35:22,351 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 06:35:22,351 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 06:35:22,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:35:22,530 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 06:35:22,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:35:22,533 INFO L290 TraceCheckUtils]: 0: Hoare triple {107104#(and (= ~last~0 |old(~last~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(11, 2);call #Ultimate.allocInit(12, 3);~last~0 := 0; {107082#true} is VALID [2022-04-15 06:35:22,533 INFO L290 TraceCheckUtils]: 1: Hoare triple {107082#true} assume true; {107082#true} is VALID [2022-04-15 06:35:22,533 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {107082#true} {107082#true} #66#return; {107082#true} is VALID [2022-04-15 06:35:22,533 INFO L272 TraceCheckUtils]: 0: Hoare triple {107082#true} call ULTIMATE.init(); {107104#(and (= ~last~0 |old(~last~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 06:35:22,534 INFO L290 TraceCheckUtils]: 1: Hoare triple {107104#(and (= ~last~0 |old(~last~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(11, 2);call #Ultimate.allocInit(12, 3);~last~0 := 0; {107082#true} is VALID [2022-04-15 06:35:22,534 INFO L290 TraceCheckUtils]: 2: Hoare triple {107082#true} assume true; {107082#true} is VALID [2022-04-15 06:35:22,534 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {107082#true} {107082#true} #66#return; {107082#true} is VALID [2022-04-15 06:35:22,534 INFO L272 TraceCheckUtils]: 4: Hoare triple {107082#true} call #t~ret6 := main(); {107082#true} is VALID [2022-04-15 06:35:22,534 INFO L290 TraceCheckUtils]: 5: Hoare triple {107082#true} assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~last~0 := #t~nondet4;havoc #t~nondet4;~a~0 := 0;~b~0 := 0;~c~0 := 0;~st~0 := 0; {107082#true} is VALID [2022-04-15 06:35:22,534 INFO L290 TraceCheckUtils]: 6: Hoare triple {107082#true} [242] L30-->L23-3_primed: Formula: (let ((.cse0 (= v_main_~c~0_1817 v_main_~c~0_1800)) (.cse1 (= v_main_~st~0_478 v_main_~st~0_476)) (.cse2 (= v_main_~a~0_248 v_main_~a~0_247)) (.cse3 (= v_main_~b~0_245 v_main_~b~0_244))) (or (and .cse0 .cse1 (= |v_main_#t~post5_752| |v_main_#t~post5_768|) .cse2 .cse3) (and .cse0 .cse1 .cse2 (= |v_main_#t~post5_768| |v_main_#t~post5_752|) .cse3))) InVars {main_~c~0=v_main_~c~0_1817, main_#t~post5=|v_main_#t~post5_768|, main_~st~0=v_main_~st~0_478, main_~b~0=v_main_~b~0_245, main_~a~0=v_main_~a~0_248} OutVars{main_~c~0=v_main_~c~0_1800, main_#t~post5=|v_main_#t~post5_752|, main_~st~0=v_main_~st~0_476, main_~b~0=v_main_~b~0_244, main_~a~0=v_main_~a~0_247} AuxVars[] AssignedVars[main_~c~0, main_#t~post5, main_~st~0, main_~b~0, main_~a~0] {107082#true} is VALID [2022-04-15 06:35:22,534 INFO L290 TraceCheckUtils]: 7: Hoare triple {107082#true} [241] L23-3_primed-->L23-3: Formula: (and (= v_main_~c~0_7 0) (= v_main_~st~0_6 1)) InVars {} OutVars{main_~c~0=v_main_~c~0_7, main_~st~0=v_main_~st~0_6} AuxVars[] AssignedVars[main_~c~0, main_~st~0] {107087#(= main_~c~0 0)} is VALID [2022-04-15 06:35:22,534 INFO L290 TraceCheckUtils]: 8: Hoare triple {107087#(= main_~c~0 0)} assume !!(~c~0 < 200000); {107087#(= main_~c~0 0)} is VALID [2022-04-15 06:35:22,535 INFO L290 TraceCheckUtils]: 9: Hoare triple {107087#(= main_~c~0 0)} assume ~c~0 == ~last~0;~st~0 := 0; {107087#(= main_~c~0 0)} is VALID [2022-04-15 06:35:22,535 INFO L290 TraceCheckUtils]: 10: Hoare triple {107087#(= main_~c~0 0)} #t~post5 := ~c~0;~c~0 := 1 + #t~post5;havoc #t~post5; {107088#(<= main_~c~0 1)} is VALID [2022-04-15 06:35:22,535 INFO L290 TraceCheckUtils]: 11: Hoare triple {107088#(<= main_~c~0 1)} assume !!(~c~0 < 200000); {107088#(<= main_~c~0 1)} is VALID [2022-04-15 06:35:22,536 INFO L290 TraceCheckUtils]: 12: Hoare triple {107088#(<= main_~c~0 1)} assume !(~c~0 == ~last~0); {107088#(<= main_~c~0 1)} is VALID [2022-04-15 06:35:22,536 INFO L290 TraceCheckUtils]: 13: Hoare triple {107088#(<= main_~c~0 1)} #t~post5 := ~c~0;~c~0 := 1 + #t~post5;havoc #t~post5; {107089#(<= main_~c~0 2)} is VALID [2022-04-15 06:35:22,536 INFO L290 TraceCheckUtils]: 14: Hoare triple {107089#(<= main_~c~0 2)} assume !!(~c~0 < 200000); {107089#(<= main_~c~0 2)} is VALID [2022-04-15 06:35:22,536 INFO L290 TraceCheckUtils]: 15: Hoare triple {107089#(<= main_~c~0 2)} assume !(~c~0 == ~last~0); {107089#(<= main_~c~0 2)} is VALID [2022-04-15 06:35:22,537 INFO L290 TraceCheckUtils]: 16: Hoare triple {107089#(<= main_~c~0 2)} #t~post5 := ~c~0;~c~0 := 1 + #t~post5;havoc #t~post5; {107090#(<= main_~c~0 3)} is VALID [2022-04-15 06:35:22,537 INFO L290 TraceCheckUtils]: 17: Hoare triple {107090#(<= main_~c~0 3)} assume !!(~c~0 < 200000); {107090#(<= main_~c~0 3)} is VALID [2022-04-15 06:35:22,537 INFO L290 TraceCheckUtils]: 18: Hoare triple {107090#(<= main_~c~0 3)} assume !(~c~0 == ~last~0); {107090#(<= main_~c~0 3)} is VALID [2022-04-15 06:35:22,538 INFO L290 TraceCheckUtils]: 19: Hoare triple {107090#(<= main_~c~0 3)} #t~post5 := ~c~0;~c~0 := 1 + #t~post5;havoc #t~post5; {107091#(<= main_~c~0 4)} is VALID [2022-04-15 06:35:22,538 INFO L290 TraceCheckUtils]: 20: Hoare triple {107091#(<= main_~c~0 4)} assume !!(~c~0 < 200000); {107091#(<= main_~c~0 4)} is VALID [2022-04-15 06:35:22,538 INFO L290 TraceCheckUtils]: 21: Hoare triple {107091#(<= main_~c~0 4)} assume !(~c~0 == ~last~0); {107091#(<= main_~c~0 4)} is VALID [2022-04-15 06:35:22,539 INFO L290 TraceCheckUtils]: 22: Hoare triple {107091#(<= main_~c~0 4)} #t~post5 := ~c~0;~c~0 := 1 + #t~post5;havoc #t~post5; {107092#(<= main_~c~0 5)} is VALID [2022-04-15 06:35:22,539 INFO L290 TraceCheckUtils]: 23: Hoare triple {107092#(<= main_~c~0 5)} assume !!(~c~0 < 200000); {107092#(<= main_~c~0 5)} is VALID [2022-04-15 06:35:22,539 INFO L290 TraceCheckUtils]: 24: Hoare triple {107092#(<= main_~c~0 5)} assume !(~c~0 == ~last~0); {107092#(<= main_~c~0 5)} is VALID [2022-04-15 06:35:22,540 INFO L290 TraceCheckUtils]: 25: Hoare triple {107092#(<= main_~c~0 5)} #t~post5 := ~c~0;~c~0 := 1 + #t~post5;havoc #t~post5; {107093#(<= main_~c~0 6)} is VALID [2022-04-15 06:35:22,540 INFO L290 TraceCheckUtils]: 26: Hoare triple {107093#(<= main_~c~0 6)} assume !!(~c~0 < 200000); {107093#(<= main_~c~0 6)} is VALID [2022-04-15 06:35:22,540 INFO L290 TraceCheckUtils]: 27: Hoare triple {107093#(<= main_~c~0 6)} assume !(~c~0 == ~last~0); {107093#(<= main_~c~0 6)} is VALID [2022-04-15 06:35:22,540 INFO L290 TraceCheckUtils]: 28: Hoare triple {107093#(<= main_~c~0 6)} #t~post5 := ~c~0;~c~0 := 1 + #t~post5;havoc #t~post5; {107094#(<= main_~c~0 7)} is VALID [2022-04-15 06:35:22,541 INFO L290 TraceCheckUtils]: 29: Hoare triple {107094#(<= main_~c~0 7)} assume !!(~c~0 < 200000); {107094#(<= main_~c~0 7)} is VALID [2022-04-15 06:35:22,541 INFO L290 TraceCheckUtils]: 30: Hoare triple {107094#(<= main_~c~0 7)} assume !(~c~0 == ~last~0); {107094#(<= main_~c~0 7)} is VALID [2022-04-15 06:35:22,541 INFO L290 TraceCheckUtils]: 31: Hoare triple {107094#(<= main_~c~0 7)} #t~post5 := ~c~0;~c~0 := 1 + #t~post5;havoc #t~post5; {107095#(<= main_~c~0 8)} is VALID [2022-04-15 06:35:22,542 INFO L290 TraceCheckUtils]: 32: Hoare triple {107095#(<= main_~c~0 8)} assume !!(~c~0 < 200000); {107095#(<= main_~c~0 8)} is VALID [2022-04-15 06:35:22,542 INFO L290 TraceCheckUtils]: 33: Hoare triple {107095#(<= main_~c~0 8)} assume !(~c~0 == ~last~0); {107095#(<= main_~c~0 8)} is VALID [2022-04-15 06:35:22,542 INFO L290 TraceCheckUtils]: 34: Hoare triple {107095#(<= main_~c~0 8)} #t~post5 := ~c~0;~c~0 := 1 + #t~post5;havoc #t~post5; {107096#(<= main_~c~0 9)} is VALID [2022-04-15 06:35:22,542 INFO L290 TraceCheckUtils]: 35: Hoare triple {107096#(<= main_~c~0 9)} assume !!(~c~0 < 200000); {107096#(<= main_~c~0 9)} is VALID [2022-04-15 06:35:22,543 INFO L290 TraceCheckUtils]: 36: Hoare triple {107096#(<= main_~c~0 9)} assume !(~c~0 == ~last~0); {107096#(<= main_~c~0 9)} is VALID [2022-04-15 06:35:22,543 INFO L290 TraceCheckUtils]: 37: Hoare triple {107096#(<= main_~c~0 9)} #t~post5 := ~c~0;~c~0 := 1 + #t~post5;havoc #t~post5; {107097#(<= main_~c~0 10)} is VALID [2022-04-15 06:35:22,543 INFO L290 TraceCheckUtils]: 38: Hoare triple {107097#(<= main_~c~0 10)} assume !!(~c~0 < 200000); {107097#(<= main_~c~0 10)} is VALID [2022-04-15 06:35:22,544 INFO L290 TraceCheckUtils]: 39: Hoare triple {107097#(<= main_~c~0 10)} assume !(~c~0 == ~last~0); {107097#(<= main_~c~0 10)} is VALID [2022-04-15 06:35:22,544 INFO L290 TraceCheckUtils]: 40: Hoare triple {107097#(<= main_~c~0 10)} #t~post5 := ~c~0;~c~0 := 1 + #t~post5;havoc #t~post5; {107098#(<= main_~c~0 11)} is VALID [2022-04-15 06:35:22,544 INFO L290 TraceCheckUtils]: 41: Hoare triple {107098#(<= main_~c~0 11)} assume !!(~c~0 < 200000); {107098#(<= main_~c~0 11)} is VALID [2022-04-15 06:35:22,545 INFO L290 TraceCheckUtils]: 42: Hoare triple {107098#(<= main_~c~0 11)} assume !(~c~0 == ~last~0); {107098#(<= main_~c~0 11)} is VALID [2022-04-15 06:35:22,545 INFO L290 TraceCheckUtils]: 43: Hoare triple {107098#(<= main_~c~0 11)} #t~post5 := ~c~0;~c~0 := 1 + #t~post5;havoc #t~post5; {107099#(<= main_~c~0 12)} is VALID [2022-04-15 06:35:22,545 INFO L290 TraceCheckUtils]: 44: Hoare triple {107099#(<= main_~c~0 12)} assume !!(~c~0 < 200000); {107099#(<= main_~c~0 12)} is VALID [2022-04-15 06:35:22,545 INFO L290 TraceCheckUtils]: 45: Hoare triple {107099#(<= main_~c~0 12)} assume !(~c~0 == ~last~0); {107099#(<= main_~c~0 12)} is VALID [2022-04-15 06:35:22,546 INFO L290 TraceCheckUtils]: 46: Hoare triple {107099#(<= main_~c~0 12)} #t~post5 := ~c~0;~c~0 := 1 + #t~post5;havoc #t~post5; {107100#(<= main_~c~0 13)} is VALID [2022-04-15 06:35:22,546 INFO L290 TraceCheckUtils]: 47: Hoare triple {107100#(<= main_~c~0 13)} assume !!(~c~0 < 200000); {107100#(<= main_~c~0 13)} is VALID [2022-04-15 06:35:22,546 INFO L290 TraceCheckUtils]: 48: Hoare triple {107100#(<= main_~c~0 13)} assume !(~c~0 == ~last~0); {107100#(<= main_~c~0 13)} is VALID [2022-04-15 06:35:22,547 INFO L290 TraceCheckUtils]: 49: Hoare triple {107100#(<= main_~c~0 13)} #t~post5 := ~c~0;~c~0 := 1 + #t~post5;havoc #t~post5; {107101#(<= main_~c~0 14)} is VALID [2022-04-15 06:35:22,547 INFO L290 TraceCheckUtils]: 50: Hoare triple {107101#(<= main_~c~0 14)} assume !!(~c~0 < 200000); {107101#(<= main_~c~0 14)} is VALID [2022-04-15 06:35:22,547 INFO L290 TraceCheckUtils]: 51: Hoare triple {107101#(<= main_~c~0 14)} assume !(~c~0 == ~last~0); {107101#(<= main_~c~0 14)} is VALID [2022-04-15 06:35:22,548 INFO L290 TraceCheckUtils]: 52: Hoare triple {107101#(<= main_~c~0 14)} #t~post5 := ~c~0;~c~0 := 1 + #t~post5;havoc #t~post5; {107102#(<= main_~c~0 15)} is VALID [2022-04-15 06:35:22,548 INFO L290 TraceCheckUtils]: 53: Hoare triple {107102#(<= main_~c~0 15)} assume !!(~c~0 < 200000); {107102#(<= main_~c~0 15)} is VALID [2022-04-15 06:35:22,548 INFO L290 TraceCheckUtils]: 54: Hoare triple {107102#(<= main_~c~0 15)} assume !(~c~0 == ~last~0); {107102#(<= main_~c~0 15)} is VALID [2022-04-15 06:35:22,549 INFO L290 TraceCheckUtils]: 55: Hoare triple {107102#(<= main_~c~0 15)} #t~post5 := ~c~0;~c~0 := 1 + #t~post5;havoc #t~post5; {107103#(<= main_~c~0 16)} is VALID [2022-04-15 06:35:22,549 INFO L290 TraceCheckUtils]: 56: Hoare triple {107103#(<= main_~c~0 16)} assume !(~c~0 < 200000); {107083#false} is VALID [2022-04-15 06:35:22,549 INFO L290 TraceCheckUtils]: 57: Hoare triple {107083#false} assume 0 == ~st~0 && ~c~0 == 1 + ~last~0;~a~0 := 3 + ~a~0;~b~0 := 3 + ~b~0; {107083#false} is VALID [2022-04-15 06:35:22,549 INFO L290 TraceCheckUtils]: 58: Hoare triple {107083#false} assume !(~c~0 == ~last~0 && 0 == ~st~0); {107083#false} is VALID [2022-04-15 06:35:22,549 INFO L272 TraceCheckUtils]: 59: Hoare triple {107083#false} call __VERIFIER_assert((if ~a~0 == ~b~0 && 200000 == ~c~0 then 1 else 0)); {107083#false} is VALID [2022-04-15 06:35:22,549 INFO L290 TraceCheckUtils]: 60: Hoare triple {107083#false} ~cond := #in~cond; {107083#false} is VALID [2022-04-15 06:35:22,549 INFO L290 TraceCheckUtils]: 61: Hoare triple {107083#false} assume 0 == ~cond; {107083#false} is VALID [2022-04-15 06:35:22,549 INFO L290 TraceCheckUtils]: 62: Hoare triple {107083#false} assume !false; {107083#false} is VALID [2022-04-15 06:35:22,549 INFO L134 CoverageAnalysis]: Checked inductivity of 376 backedges. 0 proven. 376 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 06:35:22,549 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 06:35:22,550 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1020356550] [2022-04-15 06:35:22,550 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1020356550] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 06:35:22,550 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1549479114] [2022-04-15 06:35:22,550 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 06:35:22,550 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 06:35:22,550 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 06:35:22,551 INFO L229 MonitoredProcess]: Starting monitored process 50 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-15 06:35:22,552 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (50)] Waiting until timeout for monitored process [2022-04-15 06:35:22,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:35:22,594 INFO L263 TraceCheckSpWp]: Trace formula consists of 150 conjuncts, 18 conjunts are in the unsatisfiable core [2022-04-15 06:35:22,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:35:22,605 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 06:35:22,895 INFO L272 TraceCheckUtils]: 0: Hoare triple {107082#true} call ULTIMATE.init(); {107082#true} is VALID [2022-04-15 06:35:22,895 INFO L290 TraceCheckUtils]: 1: Hoare triple {107082#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(11, 2);call #Ultimate.allocInit(12, 3);~last~0 := 0; {107082#true} is VALID [2022-04-15 06:35:22,895 INFO L290 TraceCheckUtils]: 2: Hoare triple {107082#true} assume true; {107082#true} is VALID [2022-04-15 06:35:22,895 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {107082#true} {107082#true} #66#return; {107082#true} is VALID [2022-04-15 06:35:22,896 INFO L272 TraceCheckUtils]: 4: Hoare triple {107082#true} call #t~ret6 := main(); {107082#true} is VALID [2022-04-15 06:35:22,896 INFO L290 TraceCheckUtils]: 5: Hoare triple {107082#true} assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~last~0 := #t~nondet4;havoc #t~nondet4;~a~0 := 0;~b~0 := 0;~c~0 := 0;~st~0 := 0; {107082#true} is VALID [2022-04-15 06:35:22,896 INFO L290 TraceCheckUtils]: 6: Hoare triple {107082#true} [242] L30-->L23-3_primed: Formula: (let ((.cse0 (= v_main_~c~0_1817 v_main_~c~0_1800)) (.cse1 (= v_main_~st~0_478 v_main_~st~0_476)) (.cse2 (= v_main_~a~0_248 v_main_~a~0_247)) (.cse3 (= v_main_~b~0_245 v_main_~b~0_244))) (or (and .cse0 .cse1 (= |v_main_#t~post5_752| |v_main_#t~post5_768|) .cse2 .cse3) (and .cse0 .cse1 .cse2 (= |v_main_#t~post5_768| |v_main_#t~post5_752|) .cse3))) InVars {main_~c~0=v_main_~c~0_1817, main_#t~post5=|v_main_#t~post5_768|, main_~st~0=v_main_~st~0_478, main_~b~0=v_main_~b~0_245, main_~a~0=v_main_~a~0_248} OutVars{main_~c~0=v_main_~c~0_1800, main_#t~post5=|v_main_#t~post5_752|, main_~st~0=v_main_~st~0_476, main_~b~0=v_main_~b~0_244, main_~a~0=v_main_~a~0_247} AuxVars[] AssignedVars[main_~c~0, main_#t~post5, main_~st~0, main_~b~0, main_~a~0] {107082#true} is VALID [2022-04-15 06:35:22,896 INFO L290 TraceCheckUtils]: 7: Hoare triple {107082#true} [241] L23-3_primed-->L23-3: Formula: (and (= v_main_~c~0_7 0) (= v_main_~st~0_6 1)) InVars {} OutVars{main_~c~0=v_main_~c~0_7, main_~st~0=v_main_~st~0_6} AuxVars[] AssignedVars[main_~c~0, main_~st~0] {107129#(<= main_~c~0 0)} is VALID [2022-04-15 06:35:22,896 INFO L290 TraceCheckUtils]: 8: Hoare triple {107129#(<= main_~c~0 0)} assume !!(~c~0 < 200000); {107129#(<= main_~c~0 0)} is VALID [2022-04-15 06:35:22,897 INFO L290 TraceCheckUtils]: 9: Hoare triple {107129#(<= main_~c~0 0)} assume ~c~0 == ~last~0;~st~0 := 0; {107129#(<= main_~c~0 0)} is VALID [2022-04-15 06:35:22,897 INFO L290 TraceCheckUtils]: 10: Hoare triple {107129#(<= main_~c~0 0)} #t~post5 := ~c~0;~c~0 := 1 + #t~post5;havoc #t~post5; {107088#(<= main_~c~0 1)} is VALID [2022-04-15 06:35:22,897 INFO L290 TraceCheckUtils]: 11: Hoare triple {107088#(<= main_~c~0 1)} assume !!(~c~0 < 200000); {107088#(<= main_~c~0 1)} is VALID [2022-04-15 06:35:22,897 INFO L290 TraceCheckUtils]: 12: Hoare triple {107088#(<= main_~c~0 1)} assume !(~c~0 == ~last~0); {107088#(<= main_~c~0 1)} is VALID [2022-04-15 06:35:22,898 INFO L290 TraceCheckUtils]: 13: Hoare triple {107088#(<= main_~c~0 1)} #t~post5 := ~c~0;~c~0 := 1 + #t~post5;havoc #t~post5; {107089#(<= main_~c~0 2)} is VALID [2022-04-15 06:35:22,898 INFO L290 TraceCheckUtils]: 14: Hoare triple {107089#(<= main_~c~0 2)} assume !!(~c~0 < 200000); {107089#(<= main_~c~0 2)} is VALID [2022-04-15 06:35:22,898 INFO L290 TraceCheckUtils]: 15: Hoare triple {107089#(<= main_~c~0 2)} assume !(~c~0 == ~last~0); {107089#(<= main_~c~0 2)} is VALID [2022-04-15 06:35:22,899 INFO L290 TraceCheckUtils]: 16: Hoare triple {107089#(<= main_~c~0 2)} #t~post5 := ~c~0;~c~0 := 1 + #t~post5;havoc #t~post5; {107090#(<= main_~c~0 3)} is VALID [2022-04-15 06:35:22,899 INFO L290 TraceCheckUtils]: 17: Hoare triple {107090#(<= main_~c~0 3)} assume !!(~c~0 < 200000); {107090#(<= main_~c~0 3)} is VALID [2022-04-15 06:35:22,899 INFO L290 TraceCheckUtils]: 18: Hoare triple {107090#(<= main_~c~0 3)} assume !(~c~0 == ~last~0); {107090#(<= main_~c~0 3)} is VALID [2022-04-15 06:35:22,900 INFO L290 TraceCheckUtils]: 19: Hoare triple {107090#(<= main_~c~0 3)} #t~post5 := ~c~0;~c~0 := 1 + #t~post5;havoc #t~post5; {107091#(<= main_~c~0 4)} is VALID [2022-04-15 06:35:22,900 INFO L290 TraceCheckUtils]: 20: Hoare triple {107091#(<= main_~c~0 4)} assume !!(~c~0 < 200000); {107091#(<= main_~c~0 4)} is VALID [2022-04-15 06:35:22,900 INFO L290 TraceCheckUtils]: 21: Hoare triple {107091#(<= main_~c~0 4)} assume !(~c~0 == ~last~0); {107091#(<= main_~c~0 4)} is VALID [2022-04-15 06:35:22,901 INFO L290 TraceCheckUtils]: 22: Hoare triple {107091#(<= main_~c~0 4)} #t~post5 := ~c~0;~c~0 := 1 + #t~post5;havoc #t~post5; {107092#(<= main_~c~0 5)} is VALID [2022-04-15 06:35:22,901 INFO L290 TraceCheckUtils]: 23: Hoare triple {107092#(<= main_~c~0 5)} assume !!(~c~0 < 200000); {107092#(<= main_~c~0 5)} is VALID [2022-04-15 06:35:22,901 INFO L290 TraceCheckUtils]: 24: Hoare triple {107092#(<= main_~c~0 5)} assume !(~c~0 == ~last~0); {107092#(<= main_~c~0 5)} is VALID [2022-04-15 06:35:22,901 INFO L290 TraceCheckUtils]: 25: Hoare triple {107092#(<= main_~c~0 5)} #t~post5 := ~c~0;~c~0 := 1 + #t~post5;havoc #t~post5; {107093#(<= main_~c~0 6)} is VALID [2022-04-15 06:35:22,902 INFO L290 TraceCheckUtils]: 26: Hoare triple {107093#(<= main_~c~0 6)} assume !!(~c~0 < 200000); {107093#(<= main_~c~0 6)} is VALID [2022-04-15 06:35:22,902 INFO L290 TraceCheckUtils]: 27: Hoare triple {107093#(<= main_~c~0 6)} assume !(~c~0 == ~last~0); {107093#(<= main_~c~0 6)} is VALID [2022-04-15 06:35:22,902 INFO L290 TraceCheckUtils]: 28: Hoare triple {107093#(<= main_~c~0 6)} #t~post5 := ~c~0;~c~0 := 1 + #t~post5;havoc #t~post5; {107094#(<= main_~c~0 7)} is VALID [2022-04-15 06:35:22,903 INFO L290 TraceCheckUtils]: 29: Hoare triple {107094#(<= main_~c~0 7)} assume !!(~c~0 < 200000); {107094#(<= main_~c~0 7)} is VALID [2022-04-15 06:35:22,903 INFO L290 TraceCheckUtils]: 30: Hoare triple {107094#(<= main_~c~0 7)} assume !(~c~0 == ~last~0); {107094#(<= main_~c~0 7)} is VALID [2022-04-15 06:35:22,903 INFO L290 TraceCheckUtils]: 31: Hoare triple {107094#(<= main_~c~0 7)} #t~post5 := ~c~0;~c~0 := 1 + #t~post5;havoc #t~post5; {107095#(<= main_~c~0 8)} is VALID [2022-04-15 06:35:22,904 INFO L290 TraceCheckUtils]: 32: Hoare triple {107095#(<= main_~c~0 8)} assume !!(~c~0 < 200000); {107095#(<= main_~c~0 8)} is VALID [2022-04-15 06:35:22,904 INFO L290 TraceCheckUtils]: 33: Hoare triple {107095#(<= main_~c~0 8)} assume !(~c~0 == ~last~0); {107095#(<= main_~c~0 8)} is VALID [2022-04-15 06:35:22,904 INFO L290 TraceCheckUtils]: 34: Hoare triple {107095#(<= main_~c~0 8)} #t~post5 := ~c~0;~c~0 := 1 + #t~post5;havoc #t~post5; {107096#(<= main_~c~0 9)} is VALID [2022-04-15 06:35:22,905 INFO L290 TraceCheckUtils]: 35: Hoare triple {107096#(<= main_~c~0 9)} assume !!(~c~0 < 200000); {107096#(<= main_~c~0 9)} is VALID [2022-04-15 06:35:22,905 INFO L290 TraceCheckUtils]: 36: Hoare triple {107096#(<= main_~c~0 9)} assume !(~c~0 == ~last~0); {107096#(<= main_~c~0 9)} is VALID [2022-04-15 06:35:22,905 INFO L290 TraceCheckUtils]: 37: Hoare triple {107096#(<= main_~c~0 9)} #t~post5 := ~c~0;~c~0 := 1 + #t~post5;havoc #t~post5; {107097#(<= main_~c~0 10)} is VALID [2022-04-15 06:35:22,905 INFO L290 TraceCheckUtils]: 38: Hoare triple {107097#(<= main_~c~0 10)} assume !!(~c~0 < 200000); {107097#(<= main_~c~0 10)} is VALID [2022-04-15 06:35:22,906 INFO L290 TraceCheckUtils]: 39: Hoare triple {107097#(<= main_~c~0 10)} assume !(~c~0 == ~last~0); {107097#(<= main_~c~0 10)} is VALID [2022-04-15 06:35:22,906 INFO L290 TraceCheckUtils]: 40: Hoare triple {107097#(<= main_~c~0 10)} #t~post5 := ~c~0;~c~0 := 1 + #t~post5;havoc #t~post5; {107098#(<= main_~c~0 11)} is VALID [2022-04-15 06:35:22,906 INFO L290 TraceCheckUtils]: 41: Hoare triple {107098#(<= main_~c~0 11)} assume !!(~c~0 < 200000); {107098#(<= main_~c~0 11)} is VALID [2022-04-15 06:35:22,907 INFO L290 TraceCheckUtils]: 42: Hoare triple {107098#(<= main_~c~0 11)} assume !(~c~0 == ~last~0); {107098#(<= main_~c~0 11)} is VALID [2022-04-15 06:35:22,907 INFO L290 TraceCheckUtils]: 43: Hoare triple {107098#(<= main_~c~0 11)} #t~post5 := ~c~0;~c~0 := 1 + #t~post5;havoc #t~post5; {107099#(<= main_~c~0 12)} is VALID [2022-04-15 06:35:22,907 INFO L290 TraceCheckUtils]: 44: Hoare triple {107099#(<= main_~c~0 12)} assume !!(~c~0 < 200000); {107099#(<= main_~c~0 12)} is VALID [2022-04-15 06:35:22,908 INFO L290 TraceCheckUtils]: 45: Hoare triple {107099#(<= main_~c~0 12)} assume !(~c~0 == ~last~0); {107099#(<= main_~c~0 12)} is VALID [2022-04-15 06:35:22,908 INFO L290 TraceCheckUtils]: 46: Hoare triple {107099#(<= main_~c~0 12)} #t~post5 := ~c~0;~c~0 := 1 + #t~post5;havoc #t~post5; {107100#(<= main_~c~0 13)} is VALID [2022-04-15 06:35:22,908 INFO L290 TraceCheckUtils]: 47: Hoare triple {107100#(<= main_~c~0 13)} assume !!(~c~0 < 200000); {107100#(<= main_~c~0 13)} is VALID [2022-04-15 06:35:22,908 INFO L290 TraceCheckUtils]: 48: Hoare triple {107100#(<= main_~c~0 13)} assume !(~c~0 == ~last~0); {107100#(<= main_~c~0 13)} is VALID [2022-04-15 06:35:22,909 INFO L290 TraceCheckUtils]: 49: Hoare triple {107100#(<= main_~c~0 13)} #t~post5 := ~c~0;~c~0 := 1 + #t~post5;havoc #t~post5; {107101#(<= main_~c~0 14)} is VALID [2022-04-15 06:35:22,909 INFO L290 TraceCheckUtils]: 50: Hoare triple {107101#(<= main_~c~0 14)} assume !!(~c~0 < 200000); {107101#(<= main_~c~0 14)} is VALID [2022-04-15 06:35:22,909 INFO L290 TraceCheckUtils]: 51: Hoare triple {107101#(<= main_~c~0 14)} assume !(~c~0 == ~last~0); {107101#(<= main_~c~0 14)} is VALID [2022-04-15 06:35:22,910 INFO L290 TraceCheckUtils]: 52: Hoare triple {107101#(<= main_~c~0 14)} #t~post5 := ~c~0;~c~0 := 1 + #t~post5;havoc #t~post5; {107102#(<= main_~c~0 15)} is VALID [2022-04-15 06:35:22,910 INFO L290 TraceCheckUtils]: 53: Hoare triple {107102#(<= main_~c~0 15)} assume !!(~c~0 < 200000); {107102#(<= main_~c~0 15)} is VALID [2022-04-15 06:35:22,910 INFO L290 TraceCheckUtils]: 54: Hoare triple {107102#(<= main_~c~0 15)} assume !(~c~0 == ~last~0); {107102#(<= main_~c~0 15)} is VALID [2022-04-15 06:35:22,911 INFO L290 TraceCheckUtils]: 55: Hoare triple {107102#(<= main_~c~0 15)} #t~post5 := ~c~0;~c~0 := 1 + #t~post5;havoc #t~post5; {107103#(<= main_~c~0 16)} is VALID [2022-04-15 06:35:22,911 INFO L290 TraceCheckUtils]: 56: Hoare triple {107103#(<= main_~c~0 16)} assume !(~c~0 < 200000); {107083#false} is VALID [2022-04-15 06:35:22,911 INFO L290 TraceCheckUtils]: 57: Hoare triple {107083#false} assume 0 == ~st~0 && ~c~0 == 1 + ~last~0;~a~0 := 3 + ~a~0;~b~0 := 3 + ~b~0; {107083#false} is VALID [2022-04-15 06:35:22,911 INFO L290 TraceCheckUtils]: 58: Hoare triple {107083#false} assume !(~c~0 == ~last~0 && 0 == ~st~0); {107083#false} is VALID [2022-04-15 06:35:22,911 INFO L272 TraceCheckUtils]: 59: Hoare triple {107083#false} call __VERIFIER_assert((if ~a~0 == ~b~0 && 200000 == ~c~0 then 1 else 0)); {107083#false} is VALID [2022-04-15 06:35:22,911 INFO L290 TraceCheckUtils]: 60: Hoare triple {107083#false} ~cond := #in~cond; {107083#false} is VALID [2022-04-15 06:35:22,911 INFO L290 TraceCheckUtils]: 61: Hoare triple {107083#false} assume 0 == ~cond; {107083#false} is VALID [2022-04-15 06:35:22,911 INFO L290 TraceCheckUtils]: 62: Hoare triple {107083#false} assume !false; {107083#false} is VALID [2022-04-15 06:35:22,912 INFO L134 CoverageAnalysis]: Checked inductivity of 376 backedges. 0 proven. 376 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 06:35:22,912 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 06:35:23,544 INFO L290 TraceCheckUtils]: 62: Hoare triple {107083#false} assume !false; {107083#false} is VALID [2022-04-15 06:35:23,544 INFO L290 TraceCheckUtils]: 61: Hoare triple {107083#false} assume 0 == ~cond; {107083#false} is VALID [2022-04-15 06:35:23,544 INFO L290 TraceCheckUtils]: 60: Hoare triple {107083#false} ~cond := #in~cond; {107083#false} is VALID [2022-04-15 06:35:23,544 INFO L272 TraceCheckUtils]: 59: Hoare triple {107083#false} call __VERIFIER_assert((if ~a~0 == ~b~0 && 200000 == ~c~0 then 1 else 0)); {107083#false} is VALID [2022-04-15 06:35:23,544 INFO L290 TraceCheckUtils]: 58: Hoare triple {107083#false} assume !(~c~0 == ~last~0 && 0 == ~st~0); {107083#false} is VALID [2022-04-15 06:35:23,544 INFO L290 TraceCheckUtils]: 57: Hoare triple {107083#false} assume 0 == ~st~0 && ~c~0 == 1 + ~last~0;~a~0 := 3 + ~a~0;~b~0 := 3 + ~b~0; {107083#false} is VALID [2022-04-15 06:35:23,545 INFO L290 TraceCheckUtils]: 56: Hoare triple {107313#(< main_~c~0 200000)} assume !(~c~0 < 200000); {107083#false} is VALID [2022-04-15 06:35:23,545 INFO L290 TraceCheckUtils]: 55: Hoare triple {107317#(< main_~c~0 199999)} #t~post5 := ~c~0;~c~0 := 1 + #t~post5;havoc #t~post5; {107313#(< main_~c~0 200000)} is VALID [2022-04-15 06:35:23,545 INFO L290 TraceCheckUtils]: 54: Hoare triple {107317#(< main_~c~0 199999)} assume !(~c~0 == ~last~0); {107317#(< main_~c~0 199999)} is VALID [2022-04-15 06:35:23,546 INFO L290 TraceCheckUtils]: 53: Hoare triple {107317#(< main_~c~0 199999)} assume !!(~c~0 < 200000); {107317#(< main_~c~0 199999)} is VALID [2022-04-15 06:35:23,546 INFO L290 TraceCheckUtils]: 52: Hoare triple {107327#(< main_~c~0 199998)} #t~post5 := ~c~0;~c~0 := 1 + #t~post5;havoc #t~post5; {107317#(< main_~c~0 199999)} is VALID [2022-04-15 06:35:23,546 INFO L290 TraceCheckUtils]: 51: Hoare triple {107327#(< main_~c~0 199998)} assume !(~c~0 == ~last~0); {107327#(< main_~c~0 199998)} is VALID [2022-04-15 06:35:23,547 INFO L290 TraceCheckUtils]: 50: Hoare triple {107327#(< main_~c~0 199998)} assume !!(~c~0 < 200000); {107327#(< main_~c~0 199998)} is VALID [2022-04-15 06:35:23,547 INFO L290 TraceCheckUtils]: 49: Hoare triple {107337#(< main_~c~0 199997)} #t~post5 := ~c~0;~c~0 := 1 + #t~post5;havoc #t~post5; {107327#(< main_~c~0 199998)} is VALID [2022-04-15 06:35:23,547 INFO L290 TraceCheckUtils]: 48: Hoare triple {107337#(< main_~c~0 199997)} assume !(~c~0 == ~last~0); {107337#(< main_~c~0 199997)} is VALID [2022-04-15 06:35:23,547 INFO L290 TraceCheckUtils]: 47: Hoare triple {107337#(< main_~c~0 199997)} assume !!(~c~0 < 200000); {107337#(< main_~c~0 199997)} is VALID [2022-04-15 06:35:23,548 INFO L290 TraceCheckUtils]: 46: Hoare triple {107347#(< main_~c~0 199996)} #t~post5 := ~c~0;~c~0 := 1 + #t~post5;havoc #t~post5; {107337#(< main_~c~0 199997)} is VALID [2022-04-15 06:35:23,548 INFO L290 TraceCheckUtils]: 45: Hoare triple {107347#(< main_~c~0 199996)} assume !(~c~0 == ~last~0); {107347#(< main_~c~0 199996)} is VALID [2022-04-15 06:35:23,548 INFO L290 TraceCheckUtils]: 44: Hoare triple {107347#(< main_~c~0 199996)} assume !!(~c~0 < 200000); {107347#(< main_~c~0 199996)} is VALID [2022-04-15 06:35:23,549 INFO L290 TraceCheckUtils]: 43: Hoare triple {107357#(< main_~c~0 199995)} #t~post5 := ~c~0;~c~0 := 1 + #t~post5;havoc #t~post5; {107347#(< main_~c~0 199996)} is VALID [2022-04-15 06:35:23,549 INFO L290 TraceCheckUtils]: 42: Hoare triple {107357#(< main_~c~0 199995)} assume !(~c~0 == ~last~0); {107357#(< main_~c~0 199995)} is VALID [2022-04-15 06:35:23,549 INFO L290 TraceCheckUtils]: 41: Hoare triple {107357#(< main_~c~0 199995)} assume !!(~c~0 < 200000); {107357#(< main_~c~0 199995)} is VALID [2022-04-15 06:35:23,550 INFO L290 TraceCheckUtils]: 40: Hoare triple {107367#(< main_~c~0 199994)} #t~post5 := ~c~0;~c~0 := 1 + #t~post5;havoc #t~post5; {107357#(< main_~c~0 199995)} is VALID [2022-04-15 06:35:23,550 INFO L290 TraceCheckUtils]: 39: Hoare triple {107367#(< main_~c~0 199994)} assume !(~c~0 == ~last~0); {107367#(< main_~c~0 199994)} is VALID [2022-04-15 06:35:23,550 INFO L290 TraceCheckUtils]: 38: Hoare triple {107367#(< main_~c~0 199994)} assume !!(~c~0 < 200000); {107367#(< main_~c~0 199994)} is VALID [2022-04-15 06:35:23,551 INFO L290 TraceCheckUtils]: 37: Hoare triple {107377#(< main_~c~0 199993)} #t~post5 := ~c~0;~c~0 := 1 + #t~post5;havoc #t~post5; {107367#(< main_~c~0 199994)} is VALID [2022-04-15 06:35:23,551 INFO L290 TraceCheckUtils]: 36: Hoare triple {107377#(< main_~c~0 199993)} assume !(~c~0 == ~last~0); {107377#(< main_~c~0 199993)} is VALID [2022-04-15 06:35:23,551 INFO L290 TraceCheckUtils]: 35: Hoare triple {107377#(< main_~c~0 199993)} assume !!(~c~0 < 200000); {107377#(< main_~c~0 199993)} is VALID [2022-04-15 06:35:23,551 INFO L290 TraceCheckUtils]: 34: Hoare triple {107387#(< main_~c~0 199992)} #t~post5 := ~c~0;~c~0 := 1 + #t~post5;havoc #t~post5; {107377#(< main_~c~0 199993)} is VALID [2022-04-15 06:35:23,552 INFO L290 TraceCheckUtils]: 33: Hoare triple {107387#(< main_~c~0 199992)} assume !(~c~0 == ~last~0); {107387#(< main_~c~0 199992)} is VALID [2022-04-15 06:35:23,552 INFO L290 TraceCheckUtils]: 32: Hoare triple {107387#(< main_~c~0 199992)} assume !!(~c~0 < 200000); {107387#(< main_~c~0 199992)} is VALID [2022-04-15 06:35:23,552 INFO L290 TraceCheckUtils]: 31: Hoare triple {107397#(< main_~c~0 199991)} #t~post5 := ~c~0;~c~0 := 1 + #t~post5;havoc #t~post5; {107387#(< main_~c~0 199992)} is VALID [2022-04-15 06:35:23,553 INFO L290 TraceCheckUtils]: 30: Hoare triple {107397#(< main_~c~0 199991)} assume !(~c~0 == ~last~0); {107397#(< main_~c~0 199991)} is VALID [2022-04-15 06:35:23,553 INFO L290 TraceCheckUtils]: 29: Hoare triple {107397#(< main_~c~0 199991)} assume !!(~c~0 < 200000); {107397#(< main_~c~0 199991)} is VALID [2022-04-15 06:35:23,553 INFO L290 TraceCheckUtils]: 28: Hoare triple {107407#(< main_~c~0 199990)} #t~post5 := ~c~0;~c~0 := 1 + #t~post5;havoc #t~post5; {107397#(< main_~c~0 199991)} is VALID [2022-04-15 06:35:23,554 INFO L290 TraceCheckUtils]: 27: Hoare triple {107407#(< main_~c~0 199990)} assume !(~c~0 == ~last~0); {107407#(< main_~c~0 199990)} is VALID [2022-04-15 06:35:23,554 INFO L290 TraceCheckUtils]: 26: Hoare triple {107407#(< main_~c~0 199990)} assume !!(~c~0 < 200000); {107407#(< main_~c~0 199990)} is VALID [2022-04-15 06:35:23,554 INFO L290 TraceCheckUtils]: 25: Hoare triple {107417#(< main_~c~0 199989)} #t~post5 := ~c~0;~c~0 := 1 + #t~post5;havoc #t~post5; {107407#(< main_~c~0 199990)} is VALID [2022-04-15 06:35:23,555 INFO L290 TraceCheckUtils]: 24: Hoare triple {107417#(< main_~c~0 199989)} assume !(~c~0 == ~last~0); {107417#(< main_~c~0 199989)} is VALID [2022-04-15 06:35:23,555 INFO L290 TraceCheckUtils]: 23: Hoare triple {107417#(< main_~c~0 199989)} assume !!(~c~0 < 200000); {107417#(< main_~c~0 199989)} is VALID [2022-04-15 06:35:23,555 INFO L290 TraceCheckUtils]: 22: Hoare triple {107427#(< main_~c~0 199988)} #t~post5 := ~c~0;~c~0 := 1 + #t~post5;havoc #t~post5; {107417#(< main_~c~0 199989)} is VALID [2022-04-15 06:35:23,555 INFO L290 TraceCheckUtils]: 21: Hoare triple {107427#(< main_~c~0 199988)} assume !(~c~0 == ~last~0); {107427#(< main_~c~0 199988)} is VALID [2022-04-15 06:35:23,556 INFO L290 TraceCheckUtils]: 20: Hoare triple {107427#(< main_~c~0 199988)} assume !!(~c~0 < 200000); {107427#(< main_~c~0 199988)} is VALID [2022-04-15 06:35:23,556 INFO L290 TraceCheckUtils]: 19: Hoare triple {107437#(< main_~c~0 199987)} #t~post5 := ~c~0;~c~0 := 1 + #t~post5;havoc #t~post5; {107427#(< main_~c~0 199988)} is VALID [2022-04-15 06:35:23,556 INFO L290 TraceCheckUtils]: 18: Hoare triple {107437#(< main_~c~0 199987)} assume !(~c~0 == ~last~0); {107437#(< main_~c~0 199987)} is VALID [2022-04-15 06:35:23,557 INFO L290 TraceCheckUtils]: 17: Hoare triple {107437#(< main_~c~0 199987)} assume !!(~c~0 < 200000); {107437#(< main_~c~0 199987)} is VALID [2022-04-15 06:35:23,557 INFO L290 TraceCheckUtils]: 16: Hoare triple {107447#(< main_~c~0 199986)} #t~post5 := ~c~0;~c~0 := 1 + #t~post5;havoc #t~post5; {107437#(< main_~c~0 199987)} is VALID [2022-04-15 06:35:23,557 INFO L290 TraceCheckUtils]: 15: Hoare triple {107447#(< main_~c~0 199986)} assume !(~c~0 == ~last~0); {107447#(< main_~c~0 199986)} is VALID [2022-04-15 06:35:23,558 INFO L290 TraceCheckUtils]: 14: Hoare triple {107447#(< main_~c~0 199986)} assume !!(~c~0 < 200000); {107447#(< main_~c~0 199986)} is VALID [2022-04-15 06:35:23,558 INFO L290 TraceCheckUtils]: 13: Hoare triple {107457#(< main_~c~0 199985)} #t~post5 := ~c~0;~c~0 := 1 + #t~post5;havoc #t~post5; {107447#(< main_~c~0 199986)} is VALID [2022-04-15 06:35:23,558 INFO L290 TraceCheckUtils]: 12: Hoare triple {107457#(< main_~c~0 199985)} assume !(~c~0 == ~last~0); {107457#(< main_~c~0 199985)} is VALID [2022-04-15 06:35:23,558 INFO L290 TraceCheckUtils]: 11: Hoare triple {107457#(< main_~c~0 199985)} assume !!(~c~0 < 200000); {107457#(< main_~c~0 199985)} is VALID [2022-04-15 06:35:23,559 INFO L290 TraceCheckUtils]: 10: Hoare triple {107467#(< main_~c~0 199984)} #t~post5 := ~c~0;~c~0 := 1 + #t~post5;havoc #t~post5; {107457#(< main_~c~0 199985)} is VALID [2022-04-15 06:35:23,559 INFO L290 TraceCheckUtils]: 9: Hoare triple {107467#(< main_~c~0 199984)} assume ~c~0 == ~last~0;~st~0 := 0; {107467#(< main_~c~0 199984)} is VALID [2022-04-15 06:35:23,559 INFO L290 TraceCheckUtils]: 8: Hoare triple {107467#(< main_~c~0 199984)} assume !!(~c~0 < 200000); {107467#(< main_~c~0 199984)} is VALID [2022-04-15 06:35:23,560 INFO L290 TraceCheckUtils]: 7: Hoare triple {107082#true} [241] L23-3_primed-->L23-3: Formula: (and (= v_main_~c~0_7 0) (= v_main_~st~0_6 1)) InVars {} OutVars{main_~c~0=v_main_~c~0_7, main_~st~0=v_main_~st~0_6} AuxVars[] AssignedVars[main_~c~0, main_~st~0] {107467#(< main_~c~0 199984)} is VALID [2022-04-15 06:35:23,560 INFO L290 TraceCheckUtils]: 6: Hoare triple {107082#true} [242] L30-->L23-3_primed: Formula: (let ((.cse0 (= v_main_~c~0_1817 v_main_~c~0_1800)) (.cse1 (= v_main_~st~0_478 v_main_~st~0_476)) (.cse2 (= v_main_~a~0_248 v_main_~a~0_247)) (.cse3 (= v_main_~b~0_245 v_main_~b~0_244))) (or (and .cse0 .cse1 (= |v_main_#t~post5_752| |v_main_#t~post5_768|) .cse2 .cse3) (and .cse0 .cse1 .cse2 (= |v_main_#t~post5_768| |v_main_#t~post5_752|) .cse3))) InVars {main_~c~0=v_main_~c~0_1817, main_#t~post5=|v_main_#t~post5_768|, main_~st~0=v_main_~st~0_478, main_~b~0=v_main_~b~0_245, main_~a~0=v_main_~a~0_248} OutVars{main_~c~0=v_main_~c~0_1800, main_#t~post5=|v_main_#t~post5_752|, main_~st~0=v_main_~st~0_476, main_~b~0=v_main_~b~0_244, main_~a~0=v_main_~a~0_247} AuxVars[] AssignedVars[main_~c~0, main_#t~post5, main_~st~0, main_~b~0, main_~a~0] {107082#true} is VALID [2022-04-15 06:35:23,560 INFO L290 TraceCheckUtils]: 5: Hoare triple {107082#true} assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~last~0 := #t~nondet4;havoc #t~nondet4;~a~0 := 0;~b~0 := 0;~c~0 := 0;~st~0 := 0; {107082#true} is VALID [2022-04-15 06:35:23,560 INFO L272 TraceCheckUtils]: 4: Hoare triple {107082#true} call #t~ret6 := main(); {107082#true} is VALID [2022-04-15 06:35:23,560 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {107082#true} {107082#true} #66#return; {107082#true} is VALID [2022-04-15 06:35:23,560 INFO L290 TraceCheckUtils]: 2: Hoare triple {107082#true} assume true; {107082#true} is VALID [2022-04-15 06:35:23,560 INFO L290 TraceCheckUtils]: 1: Hoare triple {107082#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(11, 2);call #Ultimate.allocInit(12, 3);~last~0 := 0; {107082#true} is VALID [2022-04-15 06:35:23,560 INFO L272 TraceCheckUtils]: 0: Hoare triple {107082#true} call ULTIMATE.init(); {107082#true} is VALID [2022-04-15 06:35:23,560 INFO L134 CoverageAnalysis]: Checked inductivity of 376 backedges. 0 proven. 376 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 06:35:23,560 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1549479114] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 06:35:23,560 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 06:35:23,561 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 19, 19] total 38 [2022-04-15 06:35:24,099 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 06:35:24,099 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [2079136292] [2022-04-15 06:35:24,100 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [2079136292] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 06:35:24,100 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 06:35:24,100 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [38] imperfect sequences [] total 38 [2022-04-15 06:35:24,100 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1662521541] [2022-04-15 06:35:24,100 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 06:35:24,100 INFO L78 Accepts]: Start accepts. Automaton has has 38 states, 38 states have (on average 2.9210526315789473) internal successors, (111), 37 states have internal predecessors, (111), 2 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 119 [2022-04-15 06:35:24,100 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 06:35:24,100 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 38 states, 38 states have (on average 2.9210526315789473) internal successors, (111), 37 states have internal predecessors, (111), 2 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-15 06:35:24,174 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 116 edges. 116 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 06:35:24,174 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 38 states [2022-04-15 06:35:24,174 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 06:35:24,174 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2022-04-15 06:35:24,175 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1182, Invalid=1898, Unknown=0, NotChecked=0, Total=3080 [2022-04-15 06:35:24,175 INFO L87 Difference]: Start difference. First operand 576 states and 646 transitions. Second operand has 38 states, 38 states have (on average 2.9210526315789473) internal successors, (111), 37 states have internal predecessors, (111), 2 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-15 06:35:29,087 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:35:29,087 INFO L93 Difference]: Finished difference Result 879 states and 994 transitions. [2022-04-15 06:35:29,087 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2022-04-15 06:35:29,087 INFO L78 Accepts]: Start accepts. Automaton has has 38 states, 38 states have (on average 2.9210526315789473) internal successors, (111), 37 states have internal predecessors, (111), 2 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 119 [2022-04-15 06:35:29,087 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 06:35:29,087 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 38 states, 38 states have (on average 2.9210526315789473) internal successors, (111), 37 states have internal predecessors, (111), 2 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-15 06:35:29,088 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 158 transitions. [2022-04-15 06:35:29,088 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 38 states, 38 states have (on average 2.9210526315789473) internal successors, (111), 37 states have internal predecessors, (111), 2 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-15 06:35:29,089 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 158 transitions. [2022-04-15 06:35:29,089 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 38 states and 158 transitions. [2022-04-15 06:35:29,150 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-15 06:35:29,170 INFO L225 Difference]: With dead ends: 879 [2022-04-15 06:35:29,170 INFO L226 Difference]: Without dead ends: 761 [2022-04-15 06:35:29,170 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 211 GetRequests, 135 SyntacticMatches, 22 SemanticMatches, 54 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2766 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=1182, Invalid=1898, Unknown=0, NotChecked=0, Total=3080 [2022-04-15 06:35:29,195 INFO L913 BasicCegarLoop]: 18 mSDtfsCounter, 109 mSDsluCounter, 30 mSDsCounter, 0 mSdLazyCounter, 922 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 109 SdHoareTripleChecker+Valid, 48 SdHoareTripleChecker+Invalid, 937 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 922 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-04-15 06:35:29,195 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [109 Valid, 48 Invalid, 937 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 922 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-04-15 06:35:29,196 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 761 states. [2022-04-15 06:35:31,569 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 761 to 629. [2022-04-15 06:35:31,569 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 06:35:31,570 INFO L82 GeneralOperation]: Start isEquivalent. First operand 761 states. Second operand has 629 states, 621 states have (on average 1.1175523349436394) internal successors, (694), 622 states have internal predecessors, (694), 4 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-15 06:35:31,570 INFO L74 IsIncluded]: Start isIncluded. First operand 761 states. Second operand has 629 states, 621 states have (on average 1.1175523349436394) internal successors, (694), 622 states have internal predecessors, (694), 4 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-15 06:35:31,571 INFO L87 Difference]: Start difference. First operand 761 states. Second operand has 629 states, 621 states have (on average 1.1175523349436394) internal successors, (694), 622 states have internal predecessors, (694), 4 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-15 06:35:31,584 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:35:31,585 INFO L93 Difference]: Finished difference Result 761 states and 835 transitions. [2022-04-15 06:35:31,585 INFO L276 IsEmpty]: Start isEmpty. Operand 761 states and 835 transitions. [2022-04-15 06:35:31,585 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 06:35:31,585 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 06:35:31,585 INFO L74 IsIncluded]: Start isIncluded. First operand has 629 states, 621 states have (on average 1.1175523349436394) internal successors, (694), 622 states have internal predecessors, (694), 4 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) Second operand 761 states. [2022-04-15 06:35:31,586 INFO L87 Difference]: Start difference. First operand has 629 states, 621 states have (on average 1.1175523349436394) internal successors, (694), 622 states have internal predecessors, (694), 4 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) Second operand 761 states. [2022-04-15 06:35:31,600 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:35:31,600 INFO L93 Difference]: Finished difference Result 761 states and 835 transitions. [2022-04-15 06:35:31,600 INFO L276 IsEmpty]: Start isEmpty. Operand 761 states and 835 transitions. [2022-04-15 06:35:31,600 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 06:35:31,600 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 06:35:31,600 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 06:35:31,601 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 06:35:31,601 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 629 states, 621 states have (on average 1.1175523349436394) internal successors, (694), 622 states have internal predecessors, (694), 4 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-15 06:35:31,616 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 629 states to 629 states and 701 transitions. [2022-04-15 06:35:31,616 INFO L78 Accepts]: Start accepts. Automaton has 629 states and 701 transitions. Word has length 119 [2022-04-15 06:35:31,616 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 06:35:31,616 INFO L478 AbstractCegarLoop]: Abstraction has 629 states and 701 transitions. [2022-04-15 06:35:31,616 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 38 states, 38 states have (on average 2.9210526315789473) internal successors, (111), 37 states have internal predecessors, (111), 2 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-15 06:35:31,616 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 629 states and 701 transitions. [2022-04-15 06:35:34,215 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 701 edges. 701 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 06:35:34,216 INFO L276 IsEmpty]: Start isEmpty. Operand 629 states and 701 transitions. [2022-04-15 06:35:34,227 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2022-04-15 06:35:34,227 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 06:35:34,227 INFO L499 BasicCegarLoop]: trace histogram [35, 35, 34, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 06:35:34,246 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (50)] Forceful destruction successful, exit code 0 [2022-04-15 06:35:34,440 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 50 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable53 [2022-04-15 06:35:34,441 INFO L403 AbstractCegarLoop]: === Iteration 55 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 06:35:34,442 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 06:35:34,442 INFO L85 PathProgramCache]: Analyzing trace with hash -1669796284, now seen corresponding path program 34 times [2022-04-15 06:35:34,442 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 06:35:34,442 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [152638519] [2022-04-15 06:35:35,510 WARN L970 rdanLoopAcceleration]: Unable to prove correctness of quantifier elimination. [2022-04-15 06:35:37,912 WARN L977 rdanLoopAcceleration]: Unable to prove correctness of quantifier elimination. [2022-04-15 06:35:38,028 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 1 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-15 06:35:38,229 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {0={1=1}, 1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-15 06:35:38,230 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-15 06:35:38,233 INFO L85 PathProgramCache]: Analyzing trace with hash -1666963384, now seen corresponding path program 1 times [2022-04-15 06:35:38,233 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 06:35:38,233 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1359740655] [2022-04-15 06:35:38,233 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 06:35:38,233 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 06:35:38,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:35:38,337 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 06:35:38,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:35:38,339 INFO L290 TraceCheckUtils]: 0: Hoare triple {112068#(and (= ~last~0 |old(~last~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(11, 2);call #Ultimate.allocInit(12, 3);~last~0 := 0; {112056#true} is VALID [2022-04-15 06:35:38,339 INFO L290 TraceCheckUtils]: 1: Hoare triple {112056#true} assume true; {112056#true} is VALID [2022-04-15 06:35:38,339 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {112056#true} {112056#true} #66#return; {112056#true} is VALID [2022-04-15 06:35:38,340 INFO L272 TraceCheckUtils]: 0: Hoare triple {112056#true} call ULTIMATE.init(); {112068#(and (= ~last~0 |old(~last~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 06:35:38,340 INFO L290 TraceCheckUtils]: 1: Hoare triple {112068#(and (= ~last~0 |old(~last~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(11, 2);call #Ultimate.allocInit(12, 3);~last~0 := 0; {112056#true} is VALID [2022-04-15 06:35:38,340 INFO L290 TraceCheckUtils]: 2: Hoare triple {112056#true} assume true; {112056#true} is VALID [2022-04-15 06:35:38,340 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {112056#true} {112056#true} #66#return; {112056#true} is VALID [2022-04-15 06:35:38,340 INFO L272 TraceCheckUtils]: 4: Hoare triple {112056#true} call #t~ret6 := main(); {112056#true} is VALID [2022-04-15 06:35:38,340 INFO L290 TraceCheckUtils]: 5: Hoare triple {112056#true} assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~last~0 := #t~nondet4;havoc #t~nondet4;~a~0 := 0;~b~0 := 0;~c~0 := 0;~st~0 := 0; {112061#(and (= main_~a~0 0) (= main_~b~0 0))} is VALID [2022-04-15 06:35:38,341 INFO L290 TraceCheckUtils]: 6: Hoare triple {112061#(and (= main_~a~0 0) (= main_~b~0 0))} assume !false;~st~0 := 1;~c~0 := 0; {112062#(and (= main_~a~0 0) (= main_~st~0 1) (= main_~b~0 0))} is VALID [2022-04-15 06:35:38,341 INFO L290 TraceCheckUtils]: 7: Hoare triple {112062#(and (= main_~a~0 0) (= main_~st~0 1) (= main_~b~0 0))} [244] L23-3-->L23-4_primed: Formula: (let ((.cse0 (= v_~last~0_364 v_main_~c~0_1871)) (.cse1 (= |v_main_#t~post5_790| |v_main_#t~post5_788|)) (.cse2 (= v_main_~c~0_1871 v_main_~c~0_1870))) (or (and (not .cse0) (< v_main_~c~0_1871 v_main_~c~0_1870) (or (not (<= (+ v_main_~c~0_1871 1) v_~last~0_364)) (not (<= (+ v_~last~0_364 1) v_main_~c~0_1870))) (< v_main_~c~0_1870 200001)) (and .cse1 .cse2 (or .cse0 (not (< v_main_~c~0_1871 200000)))) (and .cse1 .cse2 (= v_~last~0_364 v_~last~0_364)))) InVars {main_~c~0=v_main_~c~0_1871, main_#t~post5=|v_main_#t~post5_790|, ~last~0=v_~last~0_364} OutVars{main_#t~post5=|v_main_#t~post5_788|, main_~c~0=v_main_~c~0_1870, ~last~0=v_~last~0_364} AuxVars[] AssignedVars[main_#t~post5, main_~c~0] {112062#(and (= main_~a~0 0) (= main_~st~0 1) (= main_~b~0 0))} is VALID [2022-04-15 06:35:38,341 INFO L290 TraceCheckUtils]: 8: Hoare triple {112062#(and (= main_~a~0 0) (= main_~st~0 1) (= main_~b~0 0))} [245] L23-4_primed-->L23-3: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {112062#(and (= main_~a~0 0) (= main_~st~0 1) (= main_~b~0 0))} is VALID [2022-04-15 06:35:38,342 INFO L290 TraceCheckUtils]: 9: Hoare triple {112062#(and (= main_~a~0 0) (= main_~st~0 1) (= main_~b~0 0))} [246] L23-3-->L23-4_primed: Formula: (let ((.cse2 (= v_main_~st~0_486 v_main_~st~0_485)) (.cse3 (= v_main_~c~0_1873 v_main_~c~0_1872)) (.cse4 (= |v_main_#t~post5_793| |v_main_#t~post5_789|)) (.cse1 (< v_main_~c~0_1873 200000)) (.cse0 (= v_~last~0_365 v_main_~c~0_1873))) (or (and (= v_main_~st~0_485 0) (< v_main_~c~0_1873 v_main_~c~0_1872) (<= v_main_~c~0_1872 (+ v_~last~0_365 1)) .cse0 .cse1) (and .cse2 (= v_~last~0_365 v_~last~0_365) .cse3 .cse4) (and .cse2 .cse3 .cse4 (or (not .cse1) (not .cse0))))) InVars {main_~c~0=v_main_~c~0_1873, main_#t~post5=|v_main_#t~post5_793|, main_~st~0=v_main_~st~0_486, ~last~0=v_~last~0_365} OutVars{main_#t~post5=|v_main_#t~post5_789|, main_~c~0=v_main_~c~0_1872, main_~st~0=v_main_~st~0_485, ~last~0=v_~last~0_365} AuxVars[] AssignedVars[main_#t~post5, main_~c~0, main_~st~0] {112063#(or (= main_~st~0 1) (and (= main_~a~0 0) (or (<= ~last~0 199999) (<= main_~c~0 200000)) (= main_~b~0 0)))} is VALID [2022-04-15 06:35:38,343 INFO L290 TraceCheckUtils]: 10: Hoare triple {112063#(or (= main_~st~0 1) (and (= main_~a~0 0) (or (<= ~last~0 199999) (<= main_~c~0 200000)) (= main_~b~0 0)))} [243] L23-4_primed-->L23-4: Formula: (not (< v_main_~c~0_8 200000)) InVars {main_~c~0=v_main_~c~0_8} OutVars{main_~c~0=v_main_~c~0_8} AuxVars[] AssignedVars[] {112064#(or (= main_~st~0 1) (and (= main_~a~0 0) (or (<= ~last~0 199999) (<= main_~c~0 200000)) (= main_~b~0 0) (< 199999 main_~c~0)))} is VALID [2022-04-15 06:35:38,343 INFO L290 TraceCheckUtils]: 11: Hoare triple {112064#(or (= main_~st~0 1) (and (= main_~a~0 0) (or (<= ~last~0 199999) (<= main_~c~0 200000)) (= main_~b~0 0) (< 199999 main_~c~0)))} assume 0 == ~st~0 && ~c~0 == 1 + ~last~0;~a~0 := 3 + ~a~0;~b~0 := 3 + ~b~0; {112065#(and (<= main_~b~0 main_~a~0) (< main_~a~0 (+ main_~b~0 1)) (< 199999 main_~c~0) (<= main_~c~0 200000))} is VALID [2022-04-15 06:35:38,344 INFO L290 TraceCheckUtils]: 12: Hoare triple {112065#(and (<= main_~b~0 main_~a~0) (< main_~a~0 (+ main_~b~0 1)) (< 199999 main_~c~0) (<= main_~c~0 200000))} assume !(~c~0 == ~last~0 && 0 == ~st~0); {112065#(and (<= main_~b~0 main_~a~0) (< main_~a~0 (+ main_~b~0 1)) (< 199999 main_~c~0) (<= main_~c~0 200000))} is VALID [2022-04-15 06:35:38,344 INFO L272 TraceCheckUtils]: 13: Hoare triple {112065#(and (<= main_~b~0 main_~a~0) (< main_~a~0 (+ main_~b~0 1)) (< 199999 main_~c~0) (<= main_~c~0 200000))} call __VERIFIER_assert((if ~a~0 == ~b~0 && 200000 == ~c~0 then 1 else 0)); {112066#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-15 06:35:38,345 INFO L290 TraceCheckUtils]: 14: Hoare triple {112066#(not (= |__VERIFIER_assert_#in~cond| 0))} ~cond := #in~cond; {112067#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-15 06:35:38,345 INFO L290 TraceCheckUtils]: 15: Hoare triple {112067#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {112057#false} is VALID [2022-04-15 06:35:38,345 INFO L290 TraceCheckUtils]: 16: Hoare triple {112057#false} assume !false; {112057#false} is VALID [2022-04-15 06:35:38,345 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-04-15 06:35:38,345 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 06:35:38,345 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1359740655] [2022-04-15 06:35:38,345 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1359740655] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 06:35:38,345 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2068440044] [2022-04-15 06:35:38,345 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 06:35:38,345 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 06:35:38,346 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 06:35:38,359 INFO L229 MonitoredProcess]: Starting monitored process 51 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-15 06:35:38,359 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (51)] Waiting until timeout for monitored process [2022-04-15 06:35:38,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:35:38,395 INFO L263 TraceCheckSpWp]: Trace formula consists of 85 conjuncts, 18 conjunts are in the unsatisfiable core [2022-04-15 06:35:38,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:35:38,400 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 06:35:38,632 INFO L272 TraceCheckUtils]: 0: Hoare triple {112056#true} call ULTIMATE.init(); {112056#true} is VALID [2022-04-15 06:35:38,632 INFO L290 TraceCheckUtils]: 1: Hoare triple {112056#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(11, 2);call #Ultimate.allocInit(12, 3);~last~0 := 0; {112056#true} is VALID [2022-04-15 06:35:38,632 INFO L290 TraceCheckUtils]: 2: Hoare triple {112056#true} assume true; {112056#true} is VALID [2022-04-15 06:35:38,632 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {112056#true} {112056#true} #66#return; {112056#true} is VALID [2022-04-15 06:35:38,632 INFO L272 TraceCheckUtils]: 4: Hoare triple {112056#true} call #t~ret6 := main(); {112056#true} is VALID [2022-04-15 06:35:38,633 INFO L290 TraceCheckUtils]: 5: Hoare triple {112056#true} assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~last~0 := #t~nondet4;havoc #t~nondet4;~a~0 := 0;~b~0 := 0;~c~0 := 0;~st~0 := 0; {112061#(and (= main_~a~0 0) (= main_~b~0 0))} is VALID [2022-04-15 06:35:38,633 INFO L290 TraceCheckUtils]: 6: Hoare triple {112061#(and (= main_~a~0 0) (= main_~b~0 0))} assume !false;~st~0 := 1;~c~0 := 0; {112062#(and (= main_~a~0 0) (= main_~st~0 1) (= main_~b~0 0))} is VALID [2022-04-15 06:35:38,634 INFO L290 TraceCheckUtils]: 7: Hoare triple {112062#(and (= main_~a~0 0) (= main_~st~0 1) (= main_~b~0 0))} [244] L23-3-->L23-4_primed: Formula: (let ((.cse0 (= v_~last~0_364 v_main_~c~0_1871)) (.cse1 (= |v_main_#t~post5_790| |v_main_#t~post5_788|)) (.cse2 (= v_main_~c~0_1871 v_main_~c~0_1870))) (or (and (not .cse0) (< v_main_~c~0_1871 v_main_~c~0_1870) (or (not (<= (+ v_main_~c~0_1871 1) v_~last~0_364)) (not (<= (+ v_~last~0_364 1) v_main_~c~0_1870))) (< v_main_~c~0_1870 200001)) (and .cse1 .cse2 (or .cse0 (not (< v_main_~c~0_1871 200000)))) (and .cse1 .cse2 (= v_~last~0_364 v_~last~0_364)))) InVars {main_~c~0=v_main_~c~0_1871, main_#t~post5=|v_main_#t~post5_790|, ~last~0=v_~last~0_364} OutVars{main_#t~post5=|v_main_#t~post5_788|, main_~c~0=v_main_~c~0_1870, ~last~0=v_~last~0_364} AuxVars[] AssignedVars[main_#t~post5, main_~c~0] {112062#(and (= main_~a~0 0) (= main_~st~0 1) (= main_~b~0 0))} is VALID [2022-04-15 06:35:38,634 INFO L290 TraceCheckUtils]: 8: Hoare triple {112062#(and (= main_~a~0 0) (= main_~st~0 1) (= main_~b~0 0))} [245] L23-4_primed-->L23-3: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {112062#(and (= main_~a~0 0) (= main_~st~0 1) (= main_~b~0 0))} is VALID [2022-04-15 06:35:38,635 INFO L290 TraceCheckUtils]: 9: Hoare triple {112062#(and (= main_~a~0 0) (= main_~st~0 1) (= main_~b~0 0))} [246] L23-3-->L23-4_primed: Formula: (let ((.cse2 (= v_main_~st~0_486 v_main_~st~0_485)) (.cse3 (= v_main_~c~0_1873 v_main_~c~0_1872)) (.cse4 (= |v_main_#t~post5_793| |v_main_#t~post5_789|)) (.cse1 (< v_main_~c~0_1873 200000)) (.cse0 (= v_~last~0_365 v_main_~c~0_1873))) (or (and (= v_main_~st~0_485 0) (< v_main_~c~0_1873 v_main_~c~0_1872) (<= v_main_~c~0_1872 (+ v_~last~0_365 1)) .cse0 .cse1) (and .cse2 (= v_~last~0_365 v_~last~0_365) .cse3 .cse4) (and .cse2 .cse3 .cse4 (or (not .cse1) (not .cse0))))) InVars {main_~c~0=v_main_~c~0_1873, main_#t~post5=|v_main_#t~post5_793|, main_~st~0=v_main_~st~0_486, ~last~0=v_~last~0_365} OutVars{main_#t~post5=|v_main_#t~post5_789|, main_~c~0=v_main_~c~0_1872, main_~st~0=v_main_~st~0_485, ~last~0=v_~last~0_365} AuxVars[] AssignedVars[main_#t~post5, main_~c~0, main_~st~0] {112099#(and (= main_~a~0 0) (= main_~b~0 0) (or (and (< ~last~0 200000) (< ~last~0 main_~c~0) (<= main_~c~0 (+ ~last~0 1)) (= main_~st~0 0)) (= main_~st~0 1)))} is VALID [2022-04-15 06:35:38,635 INFO L290 TraceCheckUtils]: 10: Hoare triple {112099#(and (= main_~a~0 0) (= main_~b~0 0) (or (and (< ~last~0 200000) (< ~last~0 main_~c~0) (<= main_~c~0 (+ ~last~0 1)) (= main_~st~0 0)) (= main_~st~0 1)))} [243] L23-4_primed-->L23-4: Formula: (not (< v_main_~c~0_8 200000)) InVars {main_~c~0=v_main_~c~0_8} OutVars{main_~c~0=v_main_~c~0_8} AuxVars[] AssignedVars[] {112103#(and (= main_~a~0 0) (or (= main_~st~0 1) (and (< ~last~0 200000) (<= main_~c~0 (+ ~last~0 1)) (= main_~st~0 0))) (= main_~b~0 0) (not (< main_~c~0 200000)))} is VALID [2022-04-15 06:35:38,636 INFO L290 TraceCheckUtils]: 11: Hoare triple {112103#(and (= main_~a~0 0) (or (= main_~st~0 1) (and (< ~last~0 200000) (<= main_~c~0 (+ ~last~0 1)) (= main_~st~0 0))) (= main_~b~0 0) (not (< main_~c~0 200000)))} assume 0 == ~st~0 && ~c~0 == 1 + ~last~0;~a~0 := 3 + ~a~0;~b~0 := 3 + ~b~0; {112107#(and (= main_~b~0 3) (<= 200000 main_~c~0) (< main_~c~0 200001) (= main_~a~0 3))} is VALID [2022-04-15 06:35:38,636 INFO L290 TraceCheckUtils]: 12: Hoare triple {112107#(and (= main_~b~0 3) (<= 200000 main_~c~0) (< main_~c~0 200001) (= main_~a~0 3))} assume !(~c~0 == ~last~0 && 0 == ~st~0); {112107#(and (= main_~b~0 3) (<= 200000 main_~c~0) (< main_~c~0 200001) (= main_~a~0 3))} is VALID [2022-04-15 06:35:38,637 INFO L272 TraceCheckUtils]: 13: Hoare triple {112107#(and (= main_~b~0 3) (<= 200000 main_~c~0) (< main_~c~0 200001) (= main_~a~0 3))} call __VERIFIER_assert((if ~a~0 == ~b~0 && 200000 == ~c~0 then 1 else 0)); {112114#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-15 06:35:38,637 INFO L290 TraceCheckUtils]: 14: Hoare triple {112114#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {112118#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-15 06:35:38,637 INFO L290 TraceCheckUtils]: 15: Hoare triple {112118#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {112057#false} is VALID [2022-04-15 06:35:38,637 INFO L290 TraceCheckUtils]: 16: Hoare triple {112057#false} assume !false; {112057#false} is VALID [2022-04-15 06:35:38,638 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-04-15 06:35:38,638 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 06:35:38,933 INFO L290 TraceCheckUtils]: 16: Hoare triple {112057#false} assume !false; {112057#false} is VALID [2022-04-15 06:35:38,933 INFO L290 TraceCheckUtils]: 15: Hoare triple {112118#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {112057#false} is VALID [2022-04-15 06:35:38,933 INFO L290 TraceCheckUtils]: 14: Hoare triple {112114#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {112118#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-15 06:35:38,934 INFO L272 TraceCheckUtils]: 13: Hoare triple {112065#(and (<= main_~b~0 main_~a~0) (< main_~a~0 (+ main_~b~0 1)) (< 199999 main_~c~0) (<= main_~c~0 200000))} call __VERIFIER_assert((if ~a~0 == ~b~0 && 200000 == ~c~0 then 1 else 0)); {112114#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-15 06:35:38,934 INFO L290 TraceCheckUtils]: 12: Hoare triple {112065#(and (<= main_~b~0 main_~a~0) (< main_~a~0 (+ main_~b~0 1)) (< 199999 main_~c~0) (<= main_~c~0 200000))} assume !(~c~0 == ~last~0 && 0 == ~st~0); {112065#(and (<= main_~b~0 main_~a~0) (< main_~a~0 (+ main_~b~0 1)) (< 199999 main_~c~0) (<= main_~c~0 200000))} is VALID [2022-04-15 06:35:38,935 INFO L290 TraceCheckUtils]: 11: Hoare triple {112140#(or (not (<= main_~c~0 (+ ~last~0 1))) (and (<= main_~b~0 main_~a~0) (< main_~a~0 (+ main_~b~0 1)) (< 199999 main_~c~0) (<= main_~c~0 200000)) (not (= main_~st~0 0)))} assume 0 == ~st~0 && ~c~0 == 1 + ~last~0;~a~0 := 3 + ~a~0;~b~0 := 3 + ~b~0; {112065#(and (<= main_~b~0 main_~a~0) (< main_~a~0 (+ main_~b~0 1)) (< 199999 main_~c~0) (<= main_~c~0 200000))} is VALID [2022-04-15 06:35:38,936 INFO L290 TraceCheckUtils]: 10: Hoare triple {112144#(or (not (<= main_~c~0 (+ ~last~0 1))) (and (<= main_~b~0 main_~a~0) (< main_~a~0 (+ main_~b~0 1)) (<= main_~c~0 200000)) (not (= main_~st~0 0)) (< main_~c~0 200000))} [243] L23-4_primed-->L23-4: Formula: (not (< v_main_~c~0_8 200000)) InVars {main_~c~0=v_main_~c~0_8} OutVars{main_~c~0=v_main_~c~0_8} AuxVars[] AssignedVars[] {112140#(or (not (<= main_~c~0 (+ ~last~0 1))) (and (<= main_~b~0 main_~a~0) (< main_~a~0 (+ main_~b~0 1)) (< 199999 main_~c~0) (<= main_~c~0 200000)) (not (= main_~st~0 0)))} is VALID [2022-04-15 06:35:38,936 INFO L290 TraceCheckUtils]: 9: Hoare triple {112148#(and (<= main_~b~0 main_~a~0) (< main_~a~0 (+ main_~b~0 1)) (not (= main_~st~0 0)))} [246] L23-3-->L23-4_primed: Formula: (let ((.cse2 (= v_main_~st~0_486 v_main_~st~0_485)) (.cse3 (= v_main_~c~0_1873 v_main_~c~0_1872)) (.cse4 (= |v_main_#t~post5_793| |v_main_#t~post5_789|)) (.cse1 (< v_main_~c~0_1873 200000)) (.cse0 (= v_~last~0_365 v_main_~c~0_1873))) (or (and (= v_main_~st~0_485 0) (< v_main_~c~0_1873 v_main_~c~0_1872) (<= v_main_~c~0_1872 (+ v_~last~0_365 1)) .cse0 .cse1) (and .cse2 (= v_~last~0_365 v_~last~0_365) .cse3 .cse4) (and .cse2 .cse3 .cse4 (or (not .cse1) (not .cse0))))) InVars {main_~c~0=v_main_~c~0_1873, main_#t~post5=|v_main_#t~post5_793|, main_~st~0=v_main_~st~0_486, ~last~0=v_~last~0_365} OutVars{main_#t~post5=|v_main_#t~post5_789|, main_~c~0=v_main_~c~0_1872, main_~st~0=v_main_~st~0_485, ~last~0=v_~last~0_365} AuxVars[] AssignedVars[main_#t~post5, main_~c~0, main_~st~0] {112144#(or (not (<= main_~c~0 (+ ~last~0 1))) (and (<= main_~b~0 main_~a~0) (< main_~a~0 (+ main_~b~0 1)) (<= main_~c~0 200000)) (not (= main_~st~0 0)) (< main_~c~0 200000))} is VALID [2022-04-15 06:35:38,937 INFO L290 TraceCheckUtils]: 8: Hoare triple {112148#(and (<= main_~b~0 main_~a~0) (< main_~a~0 (+ main_~b~0 1)) (not (= main_~st~0 0)))} [245] L23-4_primed-->L23-3: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {112148#(and (<= main_~b~0 main_~a~0) (< main_~a~0 (+ main_~b~0 1)) (not (= main_~st~0 0)))} is VALID [2022-04-15 06:35:38,937 INFO L290 TraceCheckUtils]: 7: Hoare triple {112148#(and (<= main_~b~0 main_~a~0) (< main_~a~0 (+ main_~b~0 1)) (not (= main_~st~0 0)))} [244] L23-3-->L23-4_primed: Formula: (let ((.cse0 (= v_~last~0_364 v_main_~c~0_1871)) (.cse1 (= |v_main_#t~post5_790| |v_main_#t~post5_788|)) (.cse2 (= v_main_~c~0_1871 v_main_~c~0_1870))) (or (and (not .cse0) (< v_main_~c~0_1871 v_main_~c~0_1870) (or (not (<= (+ v_main_~c~0_1871 1) v_~last~0_364)) (not (<= (+ v_~last~0_364 1) v_main_~c~0_1870))) (< v_main_~c~0_1870 200001)) (and .cse1 .cse2 (or .cse0 (not (< v_main_~c~0_1871 200000)))) (and .cse1 .cse2 (= v_~last~0_364 v_~last~0_364)))) InVars {main_~c~0=v_main_~c~0_1871, main_#t~post5=|v_main_#t~post5_790|, ~last~0=v_~last~0_364} OutVars{main_#t~post5=|v_main_#t~post5_788|, main_~c~0=v_main_~c~0_1870, ~last~0=v_~last~0_364} AuxVars[] AssignedVars[main_#t~post5, main_~c~0] {112148#(and (<= main_~b~0 main_~a~0) (< main_~a~0 (+ main_~b~0 1)) (not (= main_~st~0 0)))} is VALID [2022-04-15 06:35:38,937 INFO L290 TraceCheckUtils]: 6: Hoare triple {112158#(and (<= main_~b~0 main_~a~0) (< main_~a~0 (+ main_~b~0 1)))} assume !false;~st~0 := 1;~c~0 := 0; {112148#(and (<= main_~b~0 main_~a~0) (< main_~a~0 (+ main_~b~0 1)) (not (= main_~st~0 0)))} is VALID [2022-04-15 06:35:38,938 INFO L290 TraceCheckUtils]: 5: Hoare triple {112056#true} assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~last~0 := #t~nondet4;havoc #t~nondet4;~a~0 := 0;~b~0 := 0;~c~0 := 0;~st~0 := 0; {112158#(and (<= main_~b~0 main_~a~0) (< main_~a~0 (+ main_~b~0 1)))} is VALID [2022-04-15 06:35:38,938 INFO L272 TraceCheckUtils]: 4: Hoare triple {112056#true} call #t~ret6 := main(); {112056#true} is VALID [2022-04-15 06:35:38,938 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {112056#true} {112056#true} #66#return; {112056#true} is VALID [2022-04-15 06:35:38,938 INFO L290 TraceCheckUtils]: 2: Hoare triple {112056#true} assume true; {112056#true} is VALID [2022-04-15 06:35:38,938 INFO L290 TraceCheckUtils]: 1: Hoare triple {112056#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(11, 2);call #Ultimate.allocInit(12, 3);~last~0 := 0; {112056#true} is VALID [2022-04-15 06:35:38,938 INFO L272 TraceCheckUtils]: 0: Hoare triple {112056#true} call ULTIMATE.init(); {112056#true} is VALID [2022-04-15 06:35:38,938 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-04-15 06:35:38,938 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2068440044] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 06:35:38,938 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 06:35:38,938 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9, 9] total 19 [2022-04-15 06:35:41,817 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 06:35:41,818 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [152638519] [2022-04-15 06:35:41,818 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [152638519] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 06:35:41,818 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 06:35:41,818 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [80] imperfect sequences [] total 80 [2022-04-15 06:35:41,818 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1710414680] [2022-04-15 06:35:41,818 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 06:35:41,818 INFO L78 Accepts]: Start accepts. Automaton has has 80 states, 80 states have (on average 1.4375) internal successors, (115), 78 states have internal predecessors, (115), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 119 [2022-04-15 06:35:41,818 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 06:35:41,818 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 80 states, 80 states have (on average 1.4375) internal successors, (115), 78 states have internal predecessors, (115), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:35:41,874 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 119 edges. 119 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 06:35:41,874 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 80 states [2022-04-15 06:35:41,874 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 06:35:41,874 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 80 interpolants. [2022-04-15 06:35:41,875 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=606, Invalid=7404, Unknown=0, NotChecked=0, Total=8010 [2022-04-15 06:35:41,875 INFO L87 Difference]: Start difference. First operand 629 states and 701 transitions. Second operand has 80 states, 80 states have (on average 1.4375) internal successors, (115), 78 states have internal predecessors, (115), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:35:59,308 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:35:59,308 INFO L93 Difference]: Finished difference Result 904 states and 1022 transitions. [2022-04-15 06:35:59,308 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 116 states. [2022-04-15 06:35:59,309 INFO L78 Accepts]: Start accepts. Automaton has has 80 states, 80 states have (on average 1.4375) internal successors, (115), 78 states have internal predecessors, (115), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 119 [2022-04-15 06:35:59,309 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 06:35:59,309 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 80 states, 80 states have (on average 1.4375) internal successors, (115), 78 states have internal predecessors, (115), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:35:59,310 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 116 states to 116 states and 246 transitions. [2022-04-15 06:35:59,310 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 80 states, 80 states have (on average 1.4375) internal successors, (115), 78 states have internal predecessors, (115), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:35:59,312 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 116 states to 116 states and 246 transitions. [2022-04-15 06:35:59,312 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 116 states and 246 transitions. [2022-04-15 06:35:59,433 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 246 edges. 246 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 06:35:59,456 INFO L225 Difference]: With dead ends: 904 [2022-04-15 06:35:59,456 INFO L226 Difference]: Without dead ends: 788 [2022-04-15 06:35:59,457 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 189 GetRequests, 61 SyntacticMatches, 2 SemanticMatches, 126 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4593 ImplicationChecksByTransitivity, 4.1s TimeCoverageRelationStatistics Valid=973, Invalid=15283, Unknown=0, NotChecked=0, Total=16256 [2022-04-15 06:35:59,458 INFO L913 BasicCegarLoop]: 16 mSDtfsCounter, 178 mSDsluCounter, 211 mSDsCounter, 0 mSdLazyCounter, 11609 mSolverCounterSat, 155 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 180 SdHoareTripleChecker+Valid, 227 SdHoareTripleChecker+Invalid, 11764 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 155 IncrementalHoareTripleChecker+Valid, 11609 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6.5s IncrementalHoareTripleChecker+Time [2022-04-15 06:35:59,458 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [180 Valid, 227 Invalid, 11764 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [155 Valid, 11609 Invalid, 0 Unknown, 0 Unchecked, 6.5s Time] [2022-04-15 06:35:59,458 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 788 states. [2022-04-15 06:36:02,183 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 788 to 679. [2022-04-15 06:36:02,184 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 06:36:02,184 INFO L82 GeneralOperation]: Start isEquivalent. First operand 788 states. Second operand has 679 states, 671 states have (on average 1.11177347242921) internal successors, (746), 672 states have internal predecessors, (746), 4 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-15 06:36:02,185 INFO L74 IsIncluded]: Start isIncluded. First operand 788 states. Second operand has 679 states, 671 states have (on average 1.11177347242921) internal successors, (746), 672 states have internal predecessors, (746), 4 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-15 06:36:02,185 INFO L87 Difference]: Start difference. First operand 788 states. Second operand has 679 states, 671 states have (on average 1.11177347242921) internal successors, (746), 672 states have internal predecessors, (746), 4 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-15 06:36:02,202 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:36:02,202 INFO L93 Difference]: Finished difference Result 788 states and 882 transitions. [2022-04-15 06:36:02,202 INFO L276 IsEmpty]: Start isEmpty. Operand 788 states and 882 transitions. [2022-04-15 06:36:02,202 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 06:36:02,202 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 06:36:02,203 INFO L74 IsIncluded]: Start isIncluded. First operand has 679 states, 671 states have (on average 1.11177347242921) internal successors, (746), 672 states have internal predecessors, (746), 4 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) Second operand 788 states. [2022-04-15 06:36:02,203 INFO L87 Difference]: Start difference. First operand has 679 states, 671 states have (on average 1.11177347242921) internal successors, (746), 672 states have internal predecessors, (746), 4 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) Second operand 788 states. [2022-04-15 06:36:02,219 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:36:02,219 INFO L93 Difference]: Finished difference Result 788 states and 882 transitions. [2022-04-15 06:36:02,220 INFO L276 IsEmpty]: Start isEmpty. Operand 788 states and 882 transitions. [2022-04-15 06:36:02,220 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 06:36:02,220 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 06:36:02,220 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 06:36:02,220 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 06:36:02,220 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 679 states, 671 states have (on average 1.11177347242921) internal successors, (746), 672 states have internal predecessors, (746), 4 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-15 06:36:02,237 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 679 states to 679 states and 753 transitions. [2022-04-15 06:36:02,238 INFO L78 Accepts]: Start accepts. Automaton has 679 states and 753 transitions. Word has length 119 [2022-04-15 06:36:02,238 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 06:36:02,238 INFO L478 AbstractCegarLoop]: Abstraction has 679 states and 753 transitions. [2022-04-15 06:36:02,238 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 80 states, 80 states have (on average 1.4375) internal successors, (115), 78 states have internal predecessors, (115), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:36:02,238 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 679 states and 753 transitions. [2022-04-15 06:36:04,864 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 753 edges. 753 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 06:36:04,864 INFO L276 IsEmpty]: Start isEmpty. Operand 679 states and 753 transitions. [2022-04-15 06:36:04,865 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2022-04-15 06:36:04,865 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 06:36:04,865 INFO L499 BasicCegarLoop]: trace histogram [36, 36, 35, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 06:36:04,881 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (51)] Forceful destruction successful, exit code 0 [2022-04-15 06:36:05,065 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 51 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable54 [2022-04-15 06:36:05,065 INFO L403 AbstractCegarLoop]: === Iteration 56 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 06:36:05,066 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 06:36:05,066 INFO L85 PathProgramCache]: Analyzing trace with hash -794377497, now seen corresponding path program 35 times [2022-04-15 06:36:05,066 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 06:36:05,066 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [2036510887] [2022-04-15 06:36:09,222 WARN L977 rdanLoopAcceleration]: Unable to prove correctness of quantifier elimination. [2022-04-15 06:36:09,358 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 1 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-15 06:36:09,600 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {0={1=1}, 1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-15 06:36:09,601 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-15 06:36:09,603 INFO L85 PathProgramCache]: Analyzing trace with hash 838420808, now seen corresponding path program 1 times [2022-04-15 06:36:09,604 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 06:36:09,604 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1158679458] [2022-04-15 06:36:09,604 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 06:36:09,604 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 06:36:09,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:36:09,782 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 06:36:09,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:36:09,785 INFO L290 TraceCheckUtils]: 0: Hoare triple {117081#(and (= ~last~0 |old(~last~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(11, 2);call #Ultimate.allocInit(12, 3);~last~0 := 0; {117068#true} is VALID [2022-04-15 06:36:09,786 INFO L290 TraceCheckUtils]: 1: Hoare triple {117068#true} assume true; {117068#true} is VALID [2022-04-15 06:36:09,786 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {117068#true} {117068#true} #66#return; {117068#true} is VALID [2022-04-15 06:36:09,786 INFO L272 TraceCheckUtils]: 0: Hoare triple {117068#true} call ULTIMATE.init(); {117081#(and (= ~last~0 |old(~last~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 06:36:09,786 INFO L290 TraceCheckUtils]: 1: Hoare triple {117081#(and (= ~last~0 |old(~last~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(11, 2);call #Ultimate.allocInit(12, 3);~last~0 := 0; {117068#true} is VALID [2022-04-15 06:36:09,786 INFO L290 TraceCheckUtils]: 2: Hoare triple {117068#true} assume true; {117068#true} is VALID [2022-04-15 06:36:09,786 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {117068#true} {117068#true} #66#return; {117068#true} is VALID [2022-04-15 06:36:09,786 INFO L272 TraceCheckUtils]: 4: Hoare triple {117068#true} call #t~ret6 := main(); {117068#true} is VALID [2022-04-15 06:36:09,787 INFO L290 TraceCheckUtils]: 5: Hoare triple {117068#true} assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~last~0 := #t~nondet4;havoc #t~nondet4;~a~0 := 0;~b~0 := 0;~c~0 := 0;~st~0 := 0; {117073#(and (= main_~a~0 0) (= main_~b~0 0))} is VALID [2022-04-15 06:36:09,787 INFO L290 TraceCheckUtils]: 6: Hoare triple {117073#(and (= main_~a~0 0) (= main_~b~0 0))} assume !false;~st~0 := 1;~c~0 := 0; {117074#(and (= main_~a~0 0) (= main_~b~0 0) (= main_~c~0 0))} is VALID [2022-04-15 06:36:09,788 INFO L290 TraceCheckUtils]: 7: Hoare triple {117074#(and (= main_~a~0 0) (= main_~b~0 0) (= main_~c~0 0))} [248] L23-3-->L23-4_primed: Formula: (let ((.cse1 (= |v_main_#t~post5_803| |v_main_#t~post5_801|)) (.cse2 (= v_main_~c~0_1923 v_main_~c~0_1922)) (.cse0 (= v_~last~0_372 v_main_~c~0_1923))) (or (and (or (not (<= (+ v_main_~c~0_1923 1) v_~last~0_372)) (not (<= (+ v_~last~0_372 1) v_main_~c~0_1922))) (not .cse0) (< v_main_~c~0_1923 v_main_~c~0_1922) (< v_main_~c~0_1922 200001)) (and .cse1 (= v_~last~0_372 v_~last~0_372) .cse2) (and .cse1 .cse2 (or (not (< v_main_~c~0_1923 200000)) .cse0)))) InVars {main_~c~0=v_main_~c~0_1923, main_#t~post5=|v_main_#t~post5_803|, ~last~0=v_~last~0_372} OutVars{main_#t~post5=|v_main_#t~post5_801|, main_~c~0=v_main_~c~0_1922, ~last~0=v_~last~0_372} AuxVars[] AssignedVars[main_#t~post5, main_~c~0] {117075#(and (= main_~a~0 0) (= main_~b~0 0) (<= main_~c~0 200000))} is VALID [2022-04-15 06:36:09,789 INFO L290 TraceCheckUtils]: 8: Hoare triple {117075#(and (= main_~a~0 0) (= main_~b~0 0) (<= main_~c~0 200000))} [249] L23-4_primed-->L23-3: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {117075#(and (= main_~a~0 0) (= main_~b~0 0) (<= main_~c~0 200000))} is VALID [2022-04-15 06:36:09,789 INFO L290 TraceCheckUtils]: 9: Hoare triple {117075#(and (= main_~a~0 0) (= main_~b~0 0) (<= main_~c~0 200000))} [250] L23-3-->L23-4_primed: Formula: (let ((.cse1 (< v_main_~c~0_1925 200000)) (.cse2 (= v_~last~0_373 v_main_~c~0_1925)) (.cse0 (= v_main_~c~0_1925 v_main_~c~0_1924)) (.cse3 (= |v_main_#t~post5_806| |v_main_#t~post5_802|)) (.cse4 (= v_main_~st~0_496 v_main_~st~0_495))) (or (and .cse0 (or (not .cse1) (not .cse2)) .cse3 .cse4) (and .cse1 (= v_main_~st~0_495 0) (< v_main_~c~0_1924 (+ 2 v_main_~c~0_1925)) (< v_main_~c~0_1925 v_main_~c~0_1924) .cse2) (and .cse0 (= v_~last~0_373 v_~last~0_373) .cse3 .cse4))) InVars {main_~c~0=v_main_~c~0_1925, main_#t~post5=|v_main_#t~post5_806|, main_~st~0=v_main_~st~0_496, ~last~0=v_~last~0_373} OutVars{main_#t~post5=|v_main_#t~post5_802|, main_~c~0=v_main_~c~0_1924, main_~st~0=v_main_~st~0_495, ~last~0=v_~last~0_373} AuxVars[] AssignedVars[main_#t~post5, main_~c~0, main_~st~0] {117076#(and (= main_~a~0 0) (or (<= ~last~0 199999) (<= main_~c~0 200000)) (= main_~b~0 0))} is VALID [2022-04-15 06:36:09,790 INFO L290 TraceCheckUtils]: 10: Hoare triple {117076#(and (= main_~a~0 0) (or (<= ~last~0 199999) (<= main_~c~0 200000)) (= main_~b~0 0))} [247] L23-4_primed-->L23-4: Formula: (not (< v_main_~c~0_8 200000)) InVars {main_~c~0=v_main_~c~0_8} OutVars{main_~c~0=v_main_~c~0_8} AuxVars[] AssignedVars[] {117077#(and (= main_~a~0 0) (= main_~b~0 0) (or (and (< 199999 main_~c~0) (<= main_~c~0 200000)) (and (<= ~last~0 199999) (< 199999 main_~c~0))))} is VALID [2022-04-15 06:36:09,791 INFO L290 TraceCheckUtils]: 11: Hoare triple {117077#(and (= main_~a~0 0) (= main_~b~0 0) (or (and (< 199999 main_~c~0) (<= main_~c~0 200000)) (and (<= ~last~0 199999) (< 199999 main_~c~0))))} assume 0 == ~st~0 && ~c~0 == 1 + ~last~0;~a~0 := 3 + ~a~0;~b~0 := 3 + ~b~0; {117078#(and (<= main_~b~0 main_~a~0) (< main_~a~0 (+ main_~b~0 1)) (< 199999 main_~c~0) (<= main_~c~0 200000))} is VALID [2022-04-15 06:36:09,791 INFO L290 TraceCheckUtils]: 12: Hoare triple {117078#(and (<= main_~b~0 main_~a~0) (< main_~a~0 (+ main_~b~0 1)) (< 199999 main_~c~0) (<= main_~c~0 200000))} assume !(~c~0 == ~last~0 && 0 == ~st~0); {117078#(and (<= main_~b~0 main_~a~0) (< main_~a~0 (+ main_~b~0 1)) (< 199999 main_~c~0) (<= main_~c~0 200000))} is VALID [2022-04-15 06:36:09,792 INFO L272 TraceCheckUtils]: 13: Hoare triple {117078#(and (<= main_~b~0 main_~a~0) (< main_~a~0 (+ main_~b~0 1)) (< 199999 main_~c~0) (<= main_~c~0 200000))} call __VERIFIER_assert((if ~a~0 == ~b~0 && 200000 == ~c~0 then 1 else 0)); {117079#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-15 06:36:09,792 INFO L290 TraceCheckUtils]: 14: Hoare triple {117079#(not (= |__VERIFIER_assert_#in~cond| 0))} ~cond := #in~cond; {117080#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-15 06:36:09,793 INFO L290 TraceCheckUtils]: 15: Hoare triple {117080#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {117069#false} is VALID [2022-04-15 06:36:09,793 INFO L290 TraceCheckUtils]: 16: Hoare triple {117069#false} assume !false; {117069#false} is VALID [2022-04-15 06:36:09,793 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 06:36:09,793 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 06:36:09,793 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1158679458] [2022-04-15 06:36:09,793 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1158679458] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 06:36:09,793 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1283737961] [2022-04-15 06:36:09,793 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 06:36:09,794 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 06:36:09,794 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 06:36:09,794 INFO L229 MonitoredProcess]: Starting monitored process 52 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-15 06:36:09,795 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (52)] Waiting until timeout for monitored process [2022-04-15 06:36:09,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:36:09,830 INFO L263 TraceCheckSpWp]: Trace formula consists of 85 conjuncts, 18 conjunts are in the unsatisfiable core [2022-04-15 06:36:09,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:36:09,842 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 06:36:10,136 INFO L272 TraceCheckUtils]: 0: Hoare triple {117068#true} call ULTIMATE.init(); {117068#true} is VALID [2022-04-15 06:36:10,136 INFO L290 TraceCheckUtils]: 1: Hoare triple {117068#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(11, 2);call #Ultimate.allocInit(12, 3);~last~0 := 0; {117068#true} is VALID [2022-04-15 06:36:10,136 INFO L290 TraceCheckUtils]: 2: Hoare triple {117068#true} assume true; {117068#true} is VALID [2022-04-15 06:36:10,136 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {117068#true} {117068#true} #66#return; {117068#true} is VALID [2022-04-15 06:36:10,136 INFO L272 TraceCheckUtils]: 4: Hoare triple {117068#true} call #t~ret6 := main(); {117068#true} is VALID [2022-04-15 06:36:10,137 INFO L290 TraceCheckUtils]: 5: Hoare triple {117068#true} assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~last~0 := #t~nondet4;havoc #t~nondet4;~a~0 := 0;~b~0 := 0;~c~0 := 0;~st~0 := 0; {117073#(and (= main_~a~0 0) (= main_~b~0 0))} is VALID [2022-04-15 06:36:10,137 INFO L290 TraceCheckUtils]: 6: Hoare triple {117073#(and (= main_~a~0 0) (= main_~b~0 0))} assume !false;~st~0 := 1;~c~0 := 0; {117103#(and (= main_~a~0 0) (= main_~st~0 1) (= main_~b~0 0))} is VALID [2022-04-15 06:36:10,137 INFO L290 TraceCheckUtils]: 7: Hoare triple {117103#(and (= main_~a~0 0) (= main_~st~0 1) (= main_~b~0 0))} [248] L23-3-->L23-4_primed: Formula: (let ((.cse1 (= |v_main_#t~post5_803| |v_main_#t~post5_801|)) (.cse2 (= v_main_~c~0_1923 v_main_~c~0_1922)) (.cse0 (= v_~last~0_372 v_main_~c~0_1923))) (or (and (or (not (<= (+ v_main_~c~0_1923 1) v_~last~0_372)) (not (<= (+ v_~last~0_372 1) v_main_~c~0_1922))) (not .cse0) (< v_main_~c~0_1923 v_main_~c~0_1922) (< v_main_~c~0_1922 200001)) (and .cse1 (= v_~last~0_372 v_~last~0_372) .cse2) (and .cse1 .cse2 (or (not (< v_main_~c~0_1923 200000)) .cse0)))) InVars {main_~c~0=v_main_~c~0_1923, main_#t~post5=|v_main_#t~post5_803|, ~last~0=v_~last~0_372} OutVars{main_#t~post5=|v_main_#t~post5_801|, main_~c~0=v_main_~c~0_1922, ~last~0=v_~last~0_372} AuxVars[] AssignedVars[main_#t~post5, main_~c~0] {117103#(and (= main_~a~0 0) (= main_~st~0 1) (= main_~b~0 0))} is VALID [2022-04-15 06:36:10,138 INFO L290 TraceCheckUtils]: 8: Hoare triple {117103#(and (= main_~a~0 0) (= main_~st~0 1) (= main_~b~0 0))} [249] L23-4_primed-->L23-3: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {117103#(and (= main_~a~0 0) (= main_~st~0 1) (= main_~b~0 0))} is VALID [2022-04-15 06:36:10,139 INFO L290 TraceCheckUtils]: 9: Hoare triple {117103#(and (= main_~a~0 0) (= main_~st~0 1) (= main_~b~0 0))} [250] L23-3-->L23-4_primed: Formula: (let ((.cse1 (< v_main_~c~0_1925 200000)) (.cse2 (= v_~last~0_373 v_main_~c~0_1925)) (.cse0 (= v_main_~c~0_1925 v_main_~c~0_1924)) (.cse3 (= |v_main_#t~post5_806| |v_main_#t~post5_802|)) (.cse4 (= v_main_~st~0_496 v_main_~st~0_495))) (or (and .cse0 (or (not .cse1) (not .cse2)) .cse3 .cse4) (and .cse1 (= v_main_~st~0_495 0) (< v_main_~c~0_1924 (+ 2 v_main_~c~0_1925)) (< v_main_~c~0_1925 v_main_~c~0_1924) .cse2) (and .cse0 (= v_~last~0_373 v_~last~0_373) .cse3 .cse4))) InVars {main_~c~0=v_main_~c~0_1925, main_#t~post5=|v_main_#t~post5_806|, main_~st~0=v_main_~st~0_496, ~last~0=v_~last~0_373} OutVars{main_#t~post5=|v_main_#t~post5_802|, main_~c~0=v_main_~c~0_1924, main_~st~0=v_main_~st~0_495, ~last~0=v_~last~0_373} AuxVars[] AssignedVars[main_#t~post5, main_~c~0, main_~st~0] {117113#(and (= main_~a~0 0) (= main_~b~0 0) (or (= main_~st~0 1) (and (< ~last~0 200000) (< ~last~0 main_~c~0) (< main_~c~0 (+ ~last~0 2)) (= main_~st~0 0))))} is VALID [2022-04-15 06:36:10,139 INFO L290 TraceCheckUtils]: 10: Hoare triple {117113#(and (= main_~a~0 0) (= main_~b~0 0) (or (= main_~st~0 1) (and (< ~last~0 200000) (< ~last~0 main_~c~0) (< main_~c~0 (+ ~last~0 2)) (= main_~st~0 0))))} [247] L23-4_primed-->L23-4: Formula: (not (< v_main_~c~0_8 200000)) InVars {main_~c~0=v_main_~c~0_8} OutVars{main_~c~0=v_main_~c~0_8} AuxVars[] AssignedVars[] {117117#(and (= main_~a~0 0) (or (and (< ~last~0 200000) (< main_~c~0 (+ ~last~0 2)) (= main_~st~0 0)) (= main_~st~0 1)) (= main_~b~0 0) (not (< main_~c~0 200000)))} is VALID [2022-04-15 06:36:10,140 INFO L290 TraceCheckUtils]: 11: Hoare triple {117117#(and (= main_~a~0 0) (or (and (< ~last~0 200000) (< main_~c~0 (+ ~last~0 2)) (= main_~st~0 0)) (= main_~st~0 1)) (= main_~b~0 0) (not (< main_~c~0 200000)))} assume 0 == ~st~0 && ~c~0 == 1 + ~last~0;~a~0 := 3 + ~a~0;~b~0 := 3 + ~b~0; {117121#(and (= main_~b~0 3) (<= 200000 main_~c~0) (< main_~c~0 200001) (= main_~a~0 3))} is VALID [2022-04-15 06:36:10,140 INFO L290 TraceCheckUtils]: 12: Hoare triple {117121#(and (= main_~b~0 3) (<= 200000 main_~c~0) (< main_~c~0 200001) (= main_~a~0 3))} assume !(~c~0 == ~last~0 && 0 == ~st~0); {117121#(and (= main_~b~0 3) (<= 200000 main_~c~0) (< main_~c~0 200001) (= main_~a~0 3))} is VALID [2022-04-15 06:36:10,141 INFO L272 TraceCheckUtils]: 13: Hoare triple {117121#(and (= main_~b~0 3) (<= 200000 main_~c~0) (< main_~c~0 200001) (= main_~a~0 3))} call __VERIFIER_assert((if ~a~0 == ~b~0 && 200000 == ~c~0 then 1 else 0)); {117128#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-15 06:36:10,141 INFO L290 TraceCheckUtils]: 14: Hoare triple {117128#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {117132#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-15 06:36:10,141 INFO L290 TraceCheckUtils]: 15: Hoare triple {117132#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {117069#false} is VALID [2022-04-15 06:36:10,141 INFO L290 TraceCheckUtils]: 16: Hoare triple {117069#false} assume !false; {117069#false} is VALID [2022-04-15 06:36:10,141 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-04-15 06:36:10,142 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 06:36:10,526 INFO L290 TraceCheckUtils]: 16: Hoare triple {117069#false} assume !false; {117069#false} is VALID [2022-04-15 06:36:10,526 INFO L290 TraceCheckUtils]: 15: Hoare triple {117132#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {117069#false} is VALID [2022-04-15 06:36:10,527 INFO L290 TraceCheckUtils]: 14: Hoare triple {117128#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {117132#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-15 06:36:10,527 INFO L272 TraceCheckUtils]: 13: Hoare triple {117078#(and (<= main_~b~0 main_~a~0) (< main_~a~0 (+ main_~b~0 1)) (< 199999 main_~c~0) (<= main_~c~0 200000))} call __VERIFIER_assert((if ~a~0 == ~b~0 && 200000 == ~c~0 then 1 else 0)); {117128#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-15 06:36:10,528 INFO L290 TraceCheckUtils]: 12: Hoare triple {117078#(and (<= main_~b~0 main_~a~0) (< main_~a~0 (+ main_~b~0 1)) (< 199999 main_~c~0) (<= main_~c~0 200000))} assume !(~c~0 == ~last~0 && 0 == ~st~0); {117078#(and (<= main_~b~0 main_~a~0) (< main_~a~0 (+ main_~b~0 1)) (< 199999 main_~c~0) (<= main_~c~0 200000))} is VALID [2022-04-15 06:36:10,529 INFO L290 TraceCheckUtils]: 11: Hoare triple {117154#(or (not (<= main_~c~0 (+ ~last~0 1))) (and (<= main_~b~0 main_~a~0) (< main_~a~0 (+ main_~b~0 1)) (< 199999 main_~c~0) (<= main_~c~0 200000)) (not (= main_~st~0 0)))} assume 0 == ~st~0 && ~c~0 == 1 + ~last~0;~a~0 := 3 + ~a~0;~b~0 := 3 + ~b~0; {117078#(and (<= main_~b~0 main_~a~0) (< main_~a~0 (+ main_~b~0 1)) (< 199999 main_~c~0) (<= main_~c~0 200000))} is VALID [2022-04-15 06:36:10,529 INFO L290 TraceCheckUtils]: 10: Hoare triple {117158#(or (not (<= main_~c~0 (+ ~last~0 1))) (and (<= main_~b~0 main_~a~0) (< main_~a~0 (+ main_~b~0 1)) (<= main_~c~0 200000)) (not (= main_~st~0 0)) (< main_~c~0 200000))} [247] L23-4_primed-->L23-4: Formula: (not (< v_main_~c~0_8 200000)) InVars {main_~c~0=v_main_~c~0_8} OutVars{main_~c~0=v_main_~c~0_8} AuxVars[] AssignedVars[] {117154#(or (not (<= main_~c~0 (+ ~last~0 1))) (and (<= main_~b~0 main_~a~0) (< main_~a~0 (+ main_~b~0 1)) (< 199999 main_~c~0) (<= main_~c~0 200000)) (not (= main_~st~0 0)))} is VALID [2022-04-15 06:36:10,530 INFO L290 TraceCheckUtils]: 9: Hoare triple {117162#(and (<= main_~b~0 main_~a~0) (< main_~a~0 (+ main_~b~0 1)) (not (= main_~st~0 0)))} [250] L23-3-->L23-4_primed: Formula: (let ((.cse1 (< v_main_~c~0_1925 200000)) (.cse2 (= v_~last~0_373 v_main_~c~0_1925)) (.cse0 (= v_main_~c~0_1925 v_main_~c~0_1924)) (.cse3 (= |v_main_#t~post5_806| |v_main_#t~post5_802|)) (.cse4 (= v_main_~st~0_496 v_main_~st~0_495))) (or (and .cse0 (or (not .cse1) (not .cse2)) .cse3 .cse4) (and .cse1 (= v_main_~st~0_495 0) (< v_main_~c~0_1924 (+ 2 v_main_~c~0_1925)) (< v_main_~c~0_1925 v_main_~c~0_1924) .cse2) (and .cse0 (= v_~last~0_373 v_~last~0_373) .cse3 .cse4))) InVars {main_~c~0=v_main_~c~0_1925, main_#t~post5=|v_main_#t~post5_806|, main_~st~0=v_main_~st~0_496, ~last~0=v_~last~0_373} OutVars{main_#t~post5=|v_main_#t~post5_802|, main_~c~0=v_main_~c~0_1924, main_~st~0=v_main_~st~0_495, ~last~0=v_~last~0_373} AuxVars[] AssignedVars[main_#t~post5, main_~c~0, main_~st~0] {117158#(or (not (<= main_~c~0 (+ ~last~0 1))) (and (<= main_~b~0 main_~a~0) (< main_~a~0 (+ main_~b~0 1)) (<= main_~c~0 200000)) (not (= main_~st~0 0)) (< main_~c~0 200000))} is VALID [2022-04-15 06:36:10,530 INFO L290 TraceCheckUtils]: 8: Hoare triple {117162#(and (<= main_~b~0 main_~a~0) (< main_~a~0 (+ main_~b~0 1)) (not (= main_~st~0 0)))} [249] L23-4_primed-->L23-3: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {117162#(and (<= main_~b~0 main_~a~0) (< main_~a~0 (+ main_~b~0 1)) (not (= main_~st~0 0)))} is VALID [2022-04-15 06:36:10,531 INFO L290 TraceCheckUtils]: 7: Hoare triple {117162#(and (<= main_~b~0 main_~a~0) (< main_~a~0 (+ main_~b~0 1)) (not (= main_~st~0 0)))} [248] L23-3-->L23-4_primed: Formula: (let ((.cse1 (= |v_main_#t~post5_803| |v_main_#t~post5_801|)) (.cse2 (= v_main_~c~0_1923 v_main_~c~0_1922)) (.cse0 (= v_~last~0_372 v_main_~c~0_1923))) (or (and (or (not (<= (+ v_main_~c~0_1923 1) v_~last~0_372)) (not (<= (+ v_~last~0_372 1) v_main_~c~0_1922))) (not .cse0) (< v_main_~c~0_1923 v_main_~c~0_1922) (< v_main_~c~0_1922 200001)) (and .cse1 (= v_~last~0_372 v_~last~0_372) .cse2) (and .cse1 .cse2 (or (not (< v_main_~c~0_1923 200000)) .cse0)))) InVars {main_~c~0=v_main_~c~0_1923, main_#t~post5=|v_main_#t~post5_803|, ~last~0=v_~last~0_372} OutVars{main_#t~post5=|v_main_#t~post5_801|, main_~c~0=v_main_~c~0_1922, ~last~0=v_~last~0_372} AuxVars[] AssignedVars[main_#t~post5, main_~c~0] {117162#(and (<= main_~b~0 main_~a~0) (< main_~a~0 (+ main_~b~0 1)) (not (= main_~st~0 0)))} is VALID [2022-04-15 06:36:10,531 INFO L290 TraceCheckUtils]: 6: Hoare triple {117172#(and (<= main_~b~0 main_~a~0) (< main_~a~0 (+ main_~b~0 1)))} assume !false;~st~0 := 1;~c~0 := 0; {117162#(and (<= main_~b~0 main_~a~0) (< main_~a~0 (+ main_~b~0 1)) (not (= main_~st~0 0)))} is VALID [2022-04-15 06:36:10,531 INFO L290 TraceCheckUtils]: 5: Hoare triple {117068#true} assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~last~0 := #t~nondet4;havoc #t~nondet4;~a~0 := 0;~b~0 := 0;~c~0 := 0;~st~0 := 0; {117172#(and (<= main_~b~0 main_~a~0) (< main_~a~0 (+ main_~b~0 1)))} is VALID [2022-04-15 06:36:10,531 INFO L272 TraceCheckUtils]: 4: Hoare triple {117068#true} call #t~ret6 := main(); {117068#true} is VALID [2022-04-15 06:36:10,532 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {117068#true} {117068#true} #66#return; {117068#true} is VALID [2022-04-15 06:36:10,532 INFO L290 TraceCheckUtils]: 2: Hoare triple {117068#true} assume true; {117068#true} is VALID [2022-04-15 06:36:10,532 INFO L290 TraceCheckUtils]: 1: Hoare triple {117068#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(11, 2);call #Ultimate.allocInit(12, 3);~last~0 := 0; {117068#true} is VALID [2022-04-15 06:36:10,532 INFO L272 TraceCheckUtils]: 0: Hoare triple {117068#true} call ULTIMATE.init(); {117068#true} is VALID [2022-04-15 06:36:10,532 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-04-15 06:36:10,532 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1283737961] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 06:36:10,532 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 06:36:10,532 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 9, 9] total 21 [2022-04-15 06:36:14,263 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 06:36:14,263 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [2036510887] [2022-04-15 06:36:14,263 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [2036510887] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 06:36:14,263 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 06:36:14,263 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [82] imperfect sequences [] total 82 [2022-04-15 06:36:14,263 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1202560330] [2022-04-15 06:36:14,263 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 06:36:14,264 INFO L78 Accepts]: Start accepts. Automaton has has 82 states, 82 states have (on average 1.4390243902439024) internal successors, (118), 80 states have internal predecessors, (118), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 122 [2022-04-15 06:36:14,264 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 06:36:14,264 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 82 states, 82 states have (on average 1.4390243902439024) internal successors, (118), 80 states have internal predecessors, (118), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:36:14,327 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 122 edges. 122 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 06:36:14,327 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 82 states [2022-04-15 06:36:14,327 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 06:36:14,328 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 82 interpolants. [2022-04-15 06:36:14,328 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=713, Invalid=8217, Unknown=0, NotChecked=0, Total=8930 [2022-04-15 06:36:14,328 INFO L87 Difference]: Start difference. First operand 679 states and 753 transitions. Second operand has 82 states, 82 states have (on average 1.4390243902439024) internal successors, (118), 80 states have internal predecessors, (118), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:36:32,070 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:36:32,070 INFO L93 Difference]: Finished difference Result 894 states and 1013 transitions. [2022-04-15 06:36:32,070 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 101 states. [2022-04-15 06:36:32,070 INFO L78 Accepts]: Start accepts. Automaton has has 82 states, 82 states have (on average 1.4390243902439024) internal successors, (118), 80 states have internal predecessors, (118), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 122 [2022-04-15 06:36:32,071 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 06:36:32,071 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 82 states, 82 states have (on average 1.4390243902439024) internal successors, (118), 80 states have internal predecessors, (118), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:36:32,072 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 208 transitions. [2022-04-15 06:36:32,072 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 82 states, 82 states have (on average 1.4390243902439024) internal successors, (118), 80 states have internal predecessors, (118), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:36:32,073 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 208 transitions. [2022-04-15 06:36:32,073 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 101 states and 208 transitions. [2022-04-15 06:36:32,241 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 208 edges. 208 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 06:36:32,267 INFO L225 Difference]: With dead ends: 894 [2022-04-15 06:36:32,267 INFO L226 Difference]: Without dead ends: 778 [2022-04-15 06:36:32,268 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 178 GetRequests, 60 SyntacticMatches, 2 SemanticMatches, 116 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4073 ImplicationChecksByTransitivity, 4.4s TimeCoverageRelationStatistics Valid=948, Invalid=12858, Unknown=0, NotChecked=0, Total=13806 [2022-04-15 06:36:32,268 INFO L913 BasicCegarLoop]: 13 mSDtfsCounter, 114 mSDsluCounter, 256 mSDsCounter, 0 mSdLazyCounter, 10456 mSolverCounterSat, 69 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 115 SdHoareTripleChecker+Valid, 269 SdHoareTripleChecker+Invalid, 10525 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 69 IncrementalHoareTripleChecker+Valid, 10456 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6.7s IncrementalHoareTripleChecker+Time [2022-04-15 06:36:32,268 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [115 Valid, 269 Invalid, 10525 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [69 Valid, 10456 Invalid, 0 Unknown, 0 Unchecked, 6.7s Time] [2022-04-15 06:36:32,269 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 778 states. [2022-04-15 06:36:36,410 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 778 to 635. [2022-04-15 06:36:36,410 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 06:36:36,411 INFO L82 GeneralOperation]: Start isEquivalent. First operand 778 states. Second operand has 635 states, 627 states have (on average 1.1196172248803828) internal successors, (702), 628 states have internal predecessors, (702), 4 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-15 06:36:36,411 INFO L74 IsIncluded]: Start isIncluded. First operand 778 states. Second operand has 635 states, 627 states have (on average 1.1196172248803828) internal successors, (702), 628 states have internal predecessors, (702), 4 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-15 06:36:36,412 INFO L87 Difference]: Start difference. First operand 778 states. Second operand has 635 states, 627 states have (on average 1.1196172248803828) internal successors, (702), 628 states have internal predecessors, (702), 4 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-15 06:36:36,429 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:36:36,429 INFO L93 Difference]: Finished difference Result 778 states and 874 transitions. [2022-04-15 06:36:36,429 INFO L276 IsEmpty]: Start isEmpty. Operand 778 states and 874 transitions. [2022-04-15 06:36:36,429 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 06:36:36,429 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 06:36:36,429 INFO L74 IsIncluded]: Start isIncluded. First operand has 635 states, 627 states have (on average 1.1196172248803828) internal successors, (702), 628 states have internal predecessors, (702), 4 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) Second operand 778 states. [2022-04-15 06:36:36,430 INFO L87 Difference]: Start difference. First operand has 635 states, 627 states have (on average 1.1196172248803828) internal successors, (702), 628 states have internal predecessors, (702), 4 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) Second operand 778 states. [2022-04-15 06:36:36,446 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:36:36,446 INFO L93 Difference]: Finished difference Result 778 states and 874 transitions. [2022-04-15 06:36:36,447 INFO L276 IsEmpty]: Start isEmpty. Operand 778 states and 874 transitions. [2022-04-15 06:36:36,447 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 06:36:36,447 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 06:36:36,447 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 06:36:36,447 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 06:36:36,447 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 635 states, 627 states have (on average 1.1196172248803828) internal successors, (702), 628 states have internal predecessors, (702), 4 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-15 06:36:36,463 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 635 states to 635 states and 709 transitions. [2022-04-15 06:36:36,463 INFO L78 Accepts]: Start accepts. Automaton has 635 states and 709 transitions. Word has length 122 [2022-04-15 06:36:36,463 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 06:36:36,463 INFO L478 AbstractCegarLoop]: Abstraction has 635 states and 709 transitions. [2022-04-15 06:36:36,463 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 82 states, 82 states have (on average 1.4390243902439024) internal successors, (118), 80 states have internal predecessors, (118), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:36:36,463 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 635 states and 709 transitions. [2022-04-15 06:36:39,334 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 709 edges. 709 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 06:36:39,334 INFO L276 IsEmpty]: Start isEmpty. Operand 635 states and 709 transitions. [2022-04-15 06:36:39,335 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2022-04-15 06:36:39,335 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 06:36:39,335 INFO L499 BasicCegarLoop]: trace histogram [34, 34, 32, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 06:36:39,352 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (52)] Forceful destruction successful, exit code 0 [2022-04-15 06:36:39,535 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 52 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable55 [2022-04-15 06:36:39,535 INFO L403 AbstractCegarLoop]: === Iteration 57 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 06:36:39,536 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 06:36:39,536 INFO L85 PathProgramCache]: Analyzing trace with hash -1442311962, now seen corresponding path program 16 times [2022-04-15 06:36:39,536 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 06:36:39,536 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [296080099] [2022-04-15 06:36:39,820 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 4 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {0={1=2}, 1={1=1, 2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-15 06:36:39,820 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-15 06:36:39,820 INFO L85 PathProgramCache]: Analyzing trace with hash 1617999512, now seen corresponding path program 1 times [2022-04-15 06:36:39,820 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 06:36:39,820 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1518449461] [2022-04-15 06:36:39,820 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 06:36:39,820 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 06:36:39,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:36:40,033 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 06:36:40,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:36:40,036 INFO L290 TraceCheckUtils]: 0: Hoare triple {121950#(and (= ~last~0 |old(~last~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(11, 2);call #Ultimate.allocInit(12, 3);~last~0 := 0; {121927#true} is VALID [2022-04-15 06:36:40,036 INFO L290 TraceCheckUtils]: 1: Hoare triple {121927#true} assume true; {121927#true} is VALID [2022-04-15 06:36:40,036 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {121927#true} {121927#true} #66#return; {121927#true} is VALID [2022-04-15 06:36:40,037 INFO L272 TraceCheckUtils]: 0: Hoare triple {121927#true} call ULTIMATE.init(); {121950#(and (= ~last~0 |old(~last~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 06:36:40,037 INFO L290 TraceCheckUtils]: 1: Hoare triple {121950#(and (= ~last~0 |old(~last~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(11, 2);call #Ultimate.allocInit(12, 3);~last~0 := 0; {121927#true} is VALID [2022-04-15 06:36:40,037 INFO L290 TraceCheckUtils]: 2: Hoare triple {121927#true} assume true; {121927#true} is VALID [2022-04-15 06:36:40,037 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {121927#true} {121927#true} #66#return; {121927#true} is VALID [2022-04-15 06:36:40,037 INFO L272 TraceCheckUtils]: 4: Hoare triple {121927#true} call #t~ret6 := main(); {121927#true} is VALID [2022-04-15 06:36:40,037 INFO L290 TraceCheckUtils]: 5: Hoare triple {121927#true} assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~last~0 := #t~nondet4;havoc #t~nondet4;~a~0 := 0;~b~0 := 0;~c~0 := 0;~st~0 := 0; {121927#true} is VALID [2022-04-15 06:36:40,037 INFO L290 TraceCheckUtils]: 6: Hoare triple {121927#true} [252] L30-->L23-3_primed: Formula: (let ((.cse0 (= v_main_~b~0_260 v_main_~b~0_259)) (.cse1 (= |v_main_#t~post5_831| |v_main_#t~post5_814|)) (.cse2 (= v_main_~a~0_263 v_main_~a~0_262)) (.cse3 (= v_main_~c~0_1995 v_main_~c~0_1977))) (or (and .cse0 .cse1 (= v_main_~st~0_506 v_main_~st~0_504) .cse2 .cse3) (and .cse0 .cse1 .cse2 (= v_main_~st~0_504 v_main_~st~0_506) .cse3))) InVars {main_~c~0=v_main_~c~0_1995, main_#t~post5=|v_main_#t~post5_831|, main_~st~0=v_main_~st~0_506, main_~b~0=v_main_~b~0_260, main_~a~0=v_main_~a~0_263} OutVars{main_~c~0=v_main_~c~0_1977, main_#t~post5=|v_main_#t~post5_814|, main_~st~0=v_main_~st~0_504, main_~b~0=v_main_~b~0_259, main_~a~0=v_main_~a~0_262} AuxVars[] AssignedVars[main_~c~0, main_#t~post5, main_~st~0, main_~b~0, main_~a~0] {121927#true} is VALID [2022-04-15 06:36:40,038 INFO L290 TraceCheckUtils]: 7: Hoare triple {121927#true} [251] L23-3_primed-->L23-3: Formula: (and (= v_main_~c~0_7 0) (= v_main_~st~0_6 1)) InVars {} OutVars{main_~c~0=v_main_~c~0_7, main_~st~0=v_main_~st~0_6} AuxVars[] AssignedVars[main_~c~0, main_~st~0] {121932#(= main_~c~0 0)} is VALID [2022-04-15 06:36:40,038 INFO L290 TraceCheckUtils]: 8: Hoare triple {121932#(= main_~c~0 0)} assume !!(~c~0 < 200000); {121932#(= main_~c~0 0)} is VALID [2022-04-15 06:36:40,038 INFO L290 TraceCheckUtils]: 9: Hoare triple {121932#(= main_~c~0 0)} assume ~c~0 == ~last~0;~st~0 := 0; {121932#(= main_~c~0 0)} is VALID [2022-04-15 06:36:40,038 INFO L290 TraceCheckUtils]: 10: Hoare triple {121932#(= main_~c~0 0)} #t~post5 := ~c~0;~c~0 := 1 + #t~post5;havoc #t~post5; {121933#(<= main_~c~0 1)} is VALID [2022-04-15 06:36:40,039 INFO L290 TraceCheckUtils]: 11: Hoare triple {121933#(<= main_~c~0 1)} assume !!(~c~0 < 200000); {121933#(<= main_~c~0 1)} is VALID [2022-04-15 06:36:40,039 INFO L290 TraceCheckUtils]: 12: Hoare triple {121933#(<= main_~c~0 1)} assume !(~c~0 == ~last~0); {121933#(<= main_~c~0 1)} is VALID [2022-04-15 06:36:40,039 INFO L290 TraceCheckUtils]: 13: Hoare triple {121933#(<= main_~c~0 1)} #t~post5 := ~c~0;~c~0 := 1 + #t~post5;havoc #t~post5; {121934#(<= main_~c~0 2)} is VALID [2022-04-15 06:36:40,040 INFO L290 TraceCheckUtils]: 14: Hoare triple {121934#(<= main_~c~0 2)} assume !!(~c~0 < 200000); {121934#(<= main_~c~0 2)} is VALID [2022-04-15 06:36:40,040 INFO L290 TraceCheckUtils]: 15: Hoare triple {121934#(<= main_~c~0 2)} assume !(~c~0 == ~last~0); {121934#(<= main_~c~0 2)} is VALID [2022-04-15 06:36:40,040 INFO L290 TraceCheckUtils]: 16: Hoare triple {121934#(<= main_~c~0 2)} #t~post5 := ~c~0;~c~0 := 1 + #t~post5;havoc #t~post5; {121935#(<= main_~c~0 3)} is VALID [2022-04-15 06:36:40,040 INFO L290 TraceCheckUtils]: 17: Hoare triple {121935#(<= main_~c~0 3)} assume !!(~c~0 < 200000); {121935#(<= main_~c~0 3)} is VALID [2022-04-15 06:36:40,041 INFO L290 TraceCheckUtils]: 18: Hoare triple {121935#(<= main_~c~0 3)} assume !(~c~0 == ~last~0); {121935#(<= main_~c~0 3)} is VALID [2022-04-15 06:36:40,041 INFO L290 TraceCheckUtils]: 19: Hoare triple {121935#(<= main_~c~0 3)} #t~post5 := ~c~0;~c~0 := 1 + #t~post5;havoc #t~post5; {121936#(<= main_~c~0 4)} is VALID [2022-04-15 06:36:40,041 INFO L290 TraceCheckUtils]: 20: Hoare triple {121936#(<= main_~c~0 4)} assume !!(~c~0 < 200000); {121936#(<= main_~c~0 4)} is VALID [2022-04-15 06:36:40,042 INFO L290 TraceCheckUtils]: 21: Hoare triple {121936#(<= main_~c~0 4)} assume !(~c~0 == ~last~0); {121936#(<= main_~c~0 4)} is VALID [2022-04-15 06:36:40,042 INFO L290 TraceCheckUtils]: 22: Hoare triple {121936#(<= main_~c~0 4)} #t~post5 := ~c~0;~c~0 := 1 + #t~post5;havoc #t~post5; {121937#(<= main_~c~0 5)} is VALID [2022-04-15 06:36:40,042 INFO L290 TraceCheckUtils]: 23: Hoare triple {121937#(<= main_~c~0 5)} assume !!(~c~0 < 200000); {121937#(<= main_~c~0 5)} is VALID [2022-04-15 06:36:40,043 INFO L290 TraceCheckUtils]: 24: Hoare triple {121937#(<= main_~c~0 5)} assume !(~c~0 == ~last~0); {121937#(<= main_~c~0 5)} is VALID [2022-04-15 06:36:40,043 INFO L290 TraceCheckUtils]: 25: Hoare triple {121937#(<= main_~c~0 5)} #t~post5 := ~c~0;~c~0 := 1 + #t~post5;havoc #t~post5; {121938#(<= main_~c~0 6)} is VALID [2022-04-15 06:36:40,043 INFO L290 TraceCheckUtils]: 26: Hoare triple {121938#(<= main_~c~0 6)} assume !!(~c~0 < 200000); {121938#(<= main_~c~0 6)} is VALID [2022-04-15 06:36:40,043 INFO L290 TraceCheckUtils]: 27: Hoare triple {121938#(<= main_~c~0 6)} assume !(~c~0 == ~last~0); {121938#(<= main_~c~0 6)} is VALID [2022-04-15 06:36:40,044 INFO L290 TraceCheckUtils]: 28: Hoare triple {121938#(<= main_~c~0 6)} #t~post5 := ~c~0;~c~0 := 1 + #t~post5;havoc #t~post5; {121939#(<= main_~c~0 7)} is VALID [2022-04-15 06:36:40,044 INFO L290 TraceCheckUtils]: 29: Hoare triple {121939#(<= main_~c~0 7)} assume !!(~c~0 < 200000); {121939#(<= main_~c~0 7)} is VALID [2022-04-15 06:36:40,044 INFO L290 TraceCheckUtils]: 30: Hoare triple {121939#(<= main_~c~0 7)} assume !(~c~0 == ~last~0); {121939#(<= main_~c~0 7)} is VALID [2022-04-15 06:36:40,045 INFO L290 TraceCheckUtils]: 31: Hoare triple {121939#(<= main_~c~0 7)} #t~post5 := ~c~0;~c~0 := 1 + #t~post5;havoc #t~post5; {121940#(<= main_~c~0 8)} is VALID [2022-04-15 06:36:40,045 INFO L290 TraceCheckUtils]: 32: Hoare triple {121940#(<= main_~c~0 8)} assume !!(~c~0 < 200000); {121940#(<= main_~c~0 8)} is VALID [2022-04-15 06:36:40,045 INFO L290 TraceCheckUtils]: 33: Hoare triple {121940#(<= main_~c~0 8)} assume !(~c~0 == ~last~0); {121940#(<= main_~c~0 8)} is VALID [2022-04-15 06:36:40,046 INFO L290 TraceCheckUtils]: 34: Hoare triple {121940#(<= main_~c~0 8)} #t~post5 := ~c~0;~c~0 := 1 + #t~post5;havoc #t~post5; {121941#(<= main_~c~0 9)} is VALID [2022-04-15 06:36:40,046 INFO L290 TraceCheckUtils]: 35: Hoare triple {121941#(<= main_~c~0 9)} assume !!(~c~0 < 200000); {121941#(<= main_~c~0 9)} is VALID [2022-04-15 06:36:40,046 INFO L290 TraceCheckUtils]: 36: Hoare triple {121941#(<= main_~c~0 9)} assume !(~c~0 == ~last~0); {121941#(<= main_~c~0 9)} is VALID [2022-04-15 06:36:40,047 INFO L290 TraceCheckUtils]: 37: Hoare triple {121941#(<= main_~c~0 9)} #t~post5 := ~c~0;~c~0 := 1 + #t~post5;havoc #t~post5; {121942#(<= main_~c~0 10)} is VALID [2022-04-15 06:36:40,047 INFO L290 TraceCheckUtils]: 38: Hoare triple {121942#(<= main_~c~0 10)} assume !!(~c~0 < 200000); {121942#(<= main_~c~0 10)} is VALID [2022-04-15 06:36:40,047 INFO L290 TraceCheckUtils]: 39: Hoare triple {121942#(<= main_~c~0 10)} assume !(~c~0 == ~last~0); {121942#(<= main_~c~0 10)} is VALID [2022-04-15 06:36:40,047 INFO L290 TraceCheckUtils]: 40: Hoare triple {121942#(<= main_~c~0 10)} #t~post5 := ~c~0;~c~0 := 1 + #t~post5;havoc #t~post5; {121943#(<= main_~c~0 11)} is VALID [2022-04-15 06:36:40,048 INFO L290 TraceCheckUtils]: 41: Hoare triple {121943#(<= main_~c~0 11)} assume !!(~c~0 < 200000); {121943#(<= main_~c~0 11)} is VALID [2022-04-15 06:36:40,048 INFO L290 TraceCheckUtils]: 42: Hoare triple {121943#(<= main_~c~0 11)} assume !(~c~0 == ~last~0); {121943#(<= main_~c~0 11)} is VALID [2022-04-15 06:36:40,048 INFO L290 TraceCheckUtils]: 43: Hoare triple {121943#(<= main_~c~0 11)} #t~post5 := ~c~0;~c~0 := 1 + #t~post5;havoc #t~post5; {121944#(<= main_~c~0 12)} is VALID [2022-04-15 06:36:40,049 INFO L290 TraceCheckUtils]: 44: Hoare triple {121944#(<= main_~c~0 12)} assume !!(~c~0 < 200000); {121944#(<= main_~c~0 12)} is VALID [2022-04-15 06:36:40,049 INFO L290 TraceCheckUtils]: 45: Hoare triple {121944#(<= main_~c~0 12)} assume !(~c~0 == ~last~0); {121944#(<= main_~c~0 12)} is VALID [2022-04-15 06:36:40,049 INFO L290 TraceCheckUtils]: 46: Hoare triple {121944#(<= main_~c~0 12)} #t~post5 := ~c~0;~c~0 := 1 + #t~post5;havoc #t~post5; {121945#(<= main_~c~0 13)} is VALID [2022-04-15 06:36:40,049 INFO L290 TraceCheckUtils]: 47: Hoare triple {121945#(<= main_~c~0 13)} assume !!(~c~0 < 200000); {121945#(<= main_~c~0 13)} is VALID [2022-04-15 06:36:40,050 INFO L290 TraceCheckUtils]: 48: Hoare triple {121945#(<= main_~c~0 13)} assume !(~c~0 == ~last~0); {121945#(<= main_~c~0 13)} is VALID [2022-04-15 06:36:40,050 INFO L290 TraceCheckUtils]: 49: Hoare triple {121945#(<= main_~c~0 13)} #t~post5 := ~c~0;~c~0 := 1 + #t~post5;havoc #t~post5; {121946#(<= main_~c~0 14)} is VALID [2022-04-15 06:36:40,050 INFO L290 TraceCheckUtils]: 50: Hoare triple {121946#(<= main_~c~0 14)} assume !!(~c~0 < 200000); {121946#(<= main_~c~0 14)} is VALID [2022-04-15 06:36:40,051 INFO L290 TraceCheckUtils]: 51: Hoare triple {121946#(<= main_~c~0 14)} assume !(~c~0 == ~last~0); {121946#(<= main_~c~0 14)} is VALID [2022-04-15 06:36:40,051 INFO L290 TraceCheckUtils]: 52: Hoare triple {121946#(<= main_~c~0 14)} #t~post5 := ~c~0;~c~0 := 1 + #t~post5;havoc #t~post5; {121947#(<= main_~c~0 15)} is VALID [2022-04-15 06:36:40,051 INFO L290 TraceCheckUtils]: 53: Hoare triple {121947#(<= main_~c~0 15)} assume !!(~c~0 < 200000); {121947#(<= main_~c~0 15)} is VALID [2022-04-15 06:36:40,052 INFO L290 TraceCheckUtils]: 54: Hoare triple {121947#(<= main_~c~0 15)} assume !(~c~0 == ~last~0); {121947#(<= main_~c~0 15)} is VALID [2022-04-15 06:36:40,052 INFO L290 TraceCheckUtils]: 55: Hoare triple {121947#(<= main_~c~0 15)} #t~post5 := ~c~0;~c~0 := 1 + #t~post5;havoc #t~post5; {121948#(<= main_~c~0 16)} is VALID [2022-04-15 06:36:40,052 INFO L290 TraceCheckUtils]: 56: Hoare triple {121948#(<= main_~c~0 16)} assume !!(~c~0 < 200000); {121948#(<= main_~c~0 16)} is VALID [2022-04-15 06:36:40,052 INFO L290 TraceCheckUtils]: 57: Hoare triple {121948#(<= main_~c~0 16)} assume !(~c~0 == ~last~0); {121948#(<= main_~c~0 16)} is VALID [2022-04-15 06:36:40,053 INFO L290 TraceCheckUtils]: 58: Hoare triple {121948#(<= main_~c~0 16)} #t~post5 := ~c~0;~c~0 := 1 + #t~post5;havoc #t~post5; {121949#(<= main_~c~0 17)} is VALID [2022-04-15 06:36:40,053 INFO L290 TraceCheckUtils]: 59: Hoare triple {121949#(<= main_~c~0 17)} assume !(~c~0 < 200000); {121928#false} is VALID [2022-04-15 06:36:40,053 INFO L290 TraceCheckUtils]: 60: Hoare triple {121928#false} assume 0 == ~st~0 && ~c~0 == 1 + ~last~0;~a~0 := 3 + ~a~0;~b~0 := 3 + ~b~0; {121928#false} is VALID [2022-04-15 06:36:40,053 INFO L290 TraceCheckUtils]: 61: Hoare triple {121928#false} assume !(~c~0 == ~last~0 && 0 == ~st~0); {121928#false} is VALID [2022-04-15 06:36:40,053 INFO L272 TraceCheckUtils]: 62: Hoare triple {121928#false} call __VERIFIER_assert((if ~a~0 == ~b~0 && 200000 == ~c~0 then 1 else 0)); {121928#false} is VALID [2022-04-15 06:36:40,053 INFO L290 TraceCheckUtils]: 63: Hoare triple {121928#false} ~cond := #in~cond; {121928#false} is VALID [2022-04-15 06:36:40,053 INFO L290 TraceCheckUtils]: 64: Hoare triple {121928#false} assume 0 == ~cond; {121928#false} is VALID [2022-04-15 06:36:40,053 INFO L290 TraceCheckUtils]: 65: Hoare triple {121928#false} assume !false; {121928#false} is VALID [2022-04-15 06:36:40,054 INFO L134 CoverageAnalysis]: Checked inductivity of 425 backedges. 0 proven. 425 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 06:36:40,054 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 06:36:40,054 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1518449461] [2022-04-15 06:36:40,054 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1518449461] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 06:36:40,054 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [214927362] [2022-04-15 06:36:40,054 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 06:36:40,054 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 06:36:40,054 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 06:36:40,056 INFO L229 MonitoredProcess]: Starting monitored process 53 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-15 06:36:40,057 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (53)] Waiting until timeout for monitored process [2022-04-15 06:36:40,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:36:40,109 INFO L263 TraceCheckSpWp]: Trace formula consists of 154 conjuncts, 19 conjunts are in the unsatisfiable core [2022-04-15 06:36:40,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:36:40,121 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 06:36:40,421 INFO L272 TraceCheckUtils]: 0: Hoare triple {121927#true} call ULTIMATE.init(); {121927#true} is VALID [2022-04-15 06:36:40,421 INFO L290 TraceCheckUtils]: 1: Hoare triple {121927#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(11, 2);call #Ultimate.allocInit(12, 3);~last~0 := 0; {121927#true} is VALID [2022-04-15 06:36:40,421 INFO L290 TraceCheckUtils]: 2: Hoare triple {121927#true} assume true; {121927#true} is VALID [2022-04-15 06:36:40,421 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {121927#true} {121927#true} #66#return; {121927#true} is VALID [2022-04-15 06:36:40,421 INFO L272 TraceCheckUtils]: 4: Hoare triple {121927#true} call #t~ret6 := main(); {121927#true} is VALID [2022-04-15 06:36:40,421 INFO L290 TraceCheckUtils]: 5: Hoare triple {121927#true} assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~last~0 := #t~nondet4;havoc #t~nondet4;~a~0 := 0;~b~0 := 0;~c~0 := 0;~st~0 := 0; {121927#true} is VALID [2022-04-15 06:36:40,421 INFO L290 TraceCheckUtils]: 6: Hoare triple {121927#true} [252] L30-->L23-3_primed: Formula: (let ((.cse0 (= v_main_~b~0_260 v_main_~b~0_259)) (.cse1 (= |v_main_#t~post5_831| |v_main_#t~post5_814|)) (.cse2 (= v_main_~a~0_263 v_main_~a~0_262)) (.cse3 (= v_main_~c~0_1995 v_main_~c~0_1977))) (or (and .cse0 .cse1 (= v_main_~st~0_506 v_main_~st~0_504) .cse2 .cse3) (and .cse0 .cse1 .cse2 (= v_main_~st~0_504 v_main_~st~0_506) .cse3))) InVars {main_~c~0=v_main_~c~0_1995, main_#t~post5=|v_main_#t~post5_831|, main_~st~0=v_main_~st~0_506, main_~b~0=v_main_~b~0_260, main_~a~0=v_main_~a~0_263} OutVars{main_~c~0=v_main_~c~0_1977, main_#t~post5=|v_main_#t~post5_814|, main_~st~0=v_main_~st~0_504, main_~b~0=v_main_~b~0_259, main_~a~0=v_main_~a~0_262} AuxVars[] AssignedVars[main_~c~0, main_#t~post5, main_~st~0, main_~b~0, main_~a~0] {121927#true} is VALID [2022-04-15 06:36:40,421 INFO L290 TraceCheckUtils]: 7: Hoare triple {121927#true} [251] L23-3_primed-->L23-3: Formula: (and (= v_main_~c~0_7 0) (= v_main_~st~0_6 1)) InVars {} OutVars{main_~c~0=v_main_~c~0_7, main_~st~0=v_main_~st~0_6} AuxVars[] AssignedVars[main_~c~0, main_~st~0] {121975#(<= main_~c~0 0)} is VALID [2022-04-15 06:36:40,422 INFO L290 TraceCheckUtils]: 8: Hoare triple {121975#(<= main_~c~0 0)} assume !!(~c~0 < 200000); {121975#(<= main_~c~0 0)} is VALID [2022-04-15 06:36:40,422 INFO L290 TraceCheckUtils]: 9: Hoare triple {121975#(<= main_~c~0 0)} assume ~c~0 == ~last~0;~st~0 := 0; {121975#(<= main_~c~0 0)} is VALID [2022-04-15 06:36:40,422 INFO L290 TraceCheckUtils]: 10: Hoare triple {121975#(<= main_~c~0 0)} #t~post5 := ~c~0;~c~0 := 1 + #t~post5;havoc #t~post5; {121933#(<= main_~c~0 1)} is VALID [2022-04-15 06:36:40,423 INFO L290 TraceCheckUtils]: 11: Hoare triple {121933#(<= main_~c~0 1)} assume !!(~c~0 < 200000); {121933#(<= main_~c~0 1)} is VALID [2022-04-15 06:36:40,423 INFO L290 TraceCheckUtils]: 12: Hoare triple {121933#(<= main_~c~0 1)} assume !(~c~0 == ~last~0); {121933#(<= main_~c~0 1)} is VALID [2022-04-15 06:36:40,423 INFO L290 TraceCheckUtils]: 13: Hoare triple {121933#(<= main_~c~0 1)} #t~post5 := ~c~0;~c~0 := 1 + #t~post5;havoc #t~post5; {121934#(<= main_~c~0 2)} is VALID [2022-04-15 06:36:40,424 INFO L290 TraceCheckUtils]: 14: Hoare triple {121934#(<= main_~c~0 2)} assume !!(~c~0 < 200000); {121934#(<= main_~c~0 2)} is VALID [2022-04-15 06:36:40,424 INFO L290 TraceCheckUtils]: 15: Hoare triple {121934#(<= main_~c~0 2)} assume !(~c~0 == ~last~0); {121934#(<= main_~c~0 2)} is VALID [2022-04-15 06:36:40,424 INFO L290 TraceCheckUtils]: 16: Hoare triple {121934#(<= main_~c~0 2)} #t~post5 := ~c~0;~c~0 := 1 + #t~post5;havoc #t~post5; {121935#(<= main_~c~0 3)} is VALID [2022-04-15 06:36:40,425 INFO L290 TraceCheckUtils]: 17: Hoare triple {121935#(<= main_~c~0 3)} assume !!(~c~0 < 200000); {121935#(<= main_~c~0 3)} is VALID [2022-04-15 06:36:40,425 INFO L290 TraceCheckUtils]: 18: Hoare triple {121935#(<= main_~c~0 3)} assume !(~c~0 == ~last~0); {121935#(<= main_~c~0 3)} is VALID [2022-04-15 06:36:40,425 INFO L290 TraceCheckUtils]: 19: Hoare triple {121935#(<= main_~c~0 3)} #t~post5 := ~c~0;~c~0 := 1 + #t~post5;havoc #t~post5; {121936#(<= main_~c~0 4)} is VALID [2022-04-15 06:36:40,425 INFO L290 TraceCheckUtils]: 20: Hoare triple {121936#(<= main_~c~0 4)} assume !!(~c~0 < 200000); {121936#(<= main_~c~0 4)} is VALID [2022-04-15 06:36:40,426 INFO L290 TraceCheckUtils]: 21: Hoare triple {121936#(<= main_~c~0 4)} assume !(~c~0 == ~last~0); {121936#(<= main_~c~0 4)} is VALID [2022-04-15 06:36:40,426 INFO L290 TraceCheckUtils]: 22: Hoare triple {121936#(<= main_~c~0 4)} #t~post5 := ~c~0;~c~0 := 1 + #t~post5;havoc #t~post5; {121937#(<= main_~c~0 5)} is VALID [2022-04-15 06:36:40,426 INFO L290 TraceCheckUtils]: 23: Hoare triple {121937#(<= main_~c~0 5)} assume !!(~c~0 < 200000); {121937#(<= main_~c~0 5)} is VALID [2022-04-15 06:36:40,427 INFO L290 TraceCheckUtils]: 24: Hoare triple {121937#(<= main_~c~0 5)} assume !(~c~0 == ~last~0); {121937#(<= main_~c~0 5)} is VALID [2022-04-15 06:36:40,427 INFO L290 TraceCheckUtils]: 25: Hoare triple {121937#(<= main_~c~0 5)} #t~post5 := ~c~0;~c~0 := 1 + #t~post5;havoc #t~post5; {121938#(<= main_~c~0 6)} is VALID [2022-04-15 06:36:40,427 INFO L290 TraceCheckUtils]: 26: Hoare triple {121938#(<= main_~c~0 6)} assume !!(~c~0 < 200000); {121938#(<= main_~c~0 6)} is VALID [2022-04-15 06:36:40,428 INFO L290 TraceCheckUtils]: 27: Hoare triple {121938#(<= main_~c~0 6)} assume !(~c~0 == ~last~0); {121938#(<= main_~c~0 6)} is VALID [2022-04-15 06:36:40,428 INFO L290 TraceCheckUtils]: 28: Hoare triple {121938#(<= main_~c~0 6)} #t~post5 := ~c~0;~c~0 := 1 + #t~post5;havoc #t~post5; {121939#(<= main_~c~0 7)} is VALID [2022-04-15 06:36:40,428 INFO L290 TraceCheckUtils]: 29: Hoare triple {121939#(<= main_~c~0 7)} assume !!(~c~0 < 200000); {121939#(<= main_~c~0 7)} is VALID [2022-04-15 06:36:40,428 INFO L290 TraceCheckUtils]: 30: Hoare triple {121939#(<= main_~c~0 7)} assume !(~c~0 == ~last~0); {121939#(<= main_~c~0 7)} is VALID [2022-04-15 06:36:40,429 INFO L290 TraceCheckUtils]: 31: Hoare triple {121939#(<= main_~c~0 7)} #t~post5 := ~c~0;~c~0 := 1 + #t~post5;havoc #t~post5; {121940#(<= main_~c~0 8)} is VALID [2022-04-15 06:36:40,429 INFO L290 TraceCheckUtils]: 32: Hoare triple {121940#(<= main_~c~0 8)} assume !!(~c~0 < 200000); {121940#(<= main_~c~0 8)} is VALID [2022-04-15 06:36:40,429 INFO L290 TraceCheckUtils]: 33: Hoare triple {121940#(<= main_~c~0 8)} assume !(~c~0 == ~last~0); {121940#(<= main_~c~0 8)} is VALID [2022-04-15 06:36:40,430 INFO L290 TraceCheckUtils]: 34: Hoare triple {121940#(<= main_~c~0 8)} #t~post5 := ~c~0;~c~0 := 1 + #t~post5;havoc #t~post5; {121941#(<= main_~c~0 9)} is VALID [2022-04-15 06:36:40,430 INFO L290 TraceCheckUtils]: 35: Hoare triple {121941#(<= main_~c~0 9)} assume !!(~c~0 < 200000); {121941#(<= main_~c~0 9)} is VALID [2022-04-15 06:36:40,430 INFO L290 TraceCheckUtils]: 36: Hoare triple {121941#(<= main_~c~0 9)} assume !(~c~0 == ~last~0); {121941#(<= main_~c~0 9)} is VALID [2022-04-15 06:36:40,431 INFO L290 TraceCheckUtils]: 37: Hoare triple {121941#(<= main_~c~0 9)} #t~post5 := ~c~0;~c~0 := 1 + #t~post5;havoc #t~post5; {121942#(<= main_~c~0 10)} is VALID [2022-04-15 06:36:40,431 INFO L290 TraceCheckUtils]: 38: Hoare triple {121942#(<= main_~c~0 10)} assume !!(~c~0 < 200000); {121942#(<= main_~c~0 10)} is VALID [2022-04-15 06:36:40,431 INFO L290 TraceCheckUtils]: 39: Hoare triple {121942#(<= main_~c~0 10)} assume !(~c~0 == ~last~0); {121942#(<= main_~c~0 10)} is VALID [2022-04-15 06:36:40,432 INFO L290 TraceCheckUtils]: 40: Hoare triple {121942#(<= main_~c~0 10)} #t~post5 := ~c~0;~c~0 := 1 + #t~post5;havoc #t~post5; {121943#(<= main_~c~0 11)} is VALID [2022-04-15 06:36:40,432 INFO L290 TraceCheckUtils]: 41: Hoare triple {121943#(<= main_~c~0 11)} assume !!(~c~0 < 200000); {121943#(<= main_~c~0 11)} is VALID [2022-04-15 06:36:40,432 INFO L290 TraceCheckUtils]: 42: Hoare triple {121943#(<= main_~c~0 11)} assume !(~c~0 == ~last~0); {121943#(<= main_~c~0 11)} is VALID [2022-04-15 06:36:40,432 INFO L290 TraceCheckUtils]: 43: Hoare triple {121943#(<= main_~c~0 11)} #t~post5 := ~c~0;~c~0 := 1 + #t~post5;havoc #t~post5; {121944#(<= main_~c~0 12)} is VALID [2022-04-15 06:36:40,433 INFO L290 TraceCheckUtils]: 44: Hoare triple {121944#(<= main_~c~0 12)} assume !!(~c~0 < 200000); {121944#(<= main_~c~0 12)} is VALID [2022-04-15 06:36:40,433 INFO L290 TraceCheckUtils]: 45: Hoare triple {121944#(<= main_~c~0 12)} assume !(~c~0 == ~last~0); {121944#(<= main_~c~0 12)} is VALID [2022-04-15 06:36:40,433 INFO L290 TraceCheckUtils]: 46: Hoare triple {121944#(<= main_~c~0 12)} #t~post5 := ~c~0;~c~0 := 1 + #t~post5;havoc #t~post5; {121945#(<= main_~c~0 13)} is VALID [2022-04-15 06:36:40,434 INFO L290 TraceCheckUtils]: 47: Hoare triple {121945#(<= main_~c~0 13)} assume !!(~c~0 < 200000); {121945#(<= main_~c~0 13)} is VALID [2022-04-15 06:36:40,434 INFO L290 TraceCheckUtils]: 48: Hoare triple {121945#(<= main_~c~0 13)} assume !(~c~0 == ~last~0); {121945#(<= main_~c~0 13)} is VALID [2022-04-15 06:36:40,434 INFO L290 TraceCheckUtils]: 49: Hoare triple {121945#(<= main_~c~0 13)} #t~post5 := ~c~0;~c~0 := 1 + #t~post5;havoc #t~post5; {121946#(<= main_~c~0 14)} is VALID [2022-04-15 06:36:40,435 INFO L290 TraceCheckUtils]: 50: Hoare triple {121946#(<= main_~c~0 14)} assume !!(~c~0 < 200000); {121946#(<= main_~c~0 14)} is VALID [2022-04-15 06:36:40,435 INFO L290 TraceCheckUtils]: 51: Hoare triple {121946#(<= main_~c~0 14)} assume !(~c~0 == ~last~0); {121946#(<= main_~c~0 14)} is VALID [2022-04-15 06:36:40,435 INFO L290 TraceCheckUtils]: 52: Hoare triple {121946#(<= main_~c~0 14)} #t~post5 := ~c~0;~c~0 := 1 + #t~post5;havoc #t~post5; {121947#(<= main_~c~0 15)} is VALID [2022-04-15 06:36:40,436 INFO L290 TraceCheckUtils]: 53: Hoare triple {121947#(<= main_~c~0 15)} assume !!(~c~0 < 200000); {121947#(<= main_~c~0 15)} is VALID [2022-04-15 06:36:40,436 INFO L290 TraceCheckUtils]: 54: Hoare triple {121947#(<= main_~c~0 15)} assume !(~c~0 == ~last~0); {121947#(<= main_~c~0 15)} is VALID [2022-04-15 06:36:40,436 INFO L290 TraceCheckUtils]: 55: Hoare triple {121947#(<= main_~c~0 15)} #t~post5 := ~c~0;~c~0 := 1 + #t~post5;havoc #t~post5; {121948#(<= main_~c~0 16)} is VALID [2022-04-15 06:36:40,436 INFO L290 TraceCheckUtils]: 56: Hoare triple {121948#(<= main_~c~0 16)} assume !!(~c~0 < 200000); {121948#(<= main_~c~0 16)} is VALID [2022-04-15 06:36:40,437 INFO L290 TraceCheckUtils]: 57: Hoare triple {121948#(<= main_~c~0 16)} assume !(~c~0 == ~last~0); {121948#(<= main_~c~0 16)} is VALID [2022-04-15 06:36:40,437 INFO L290 TraceCheckUtils]: 58: Hoare triple {121948#(<= main_~c~0 16)} #t~post5 := ~c~0;~c~0 := 1 + #t~post5;havoc #t~post5; {121949#(<= main_~c~0 17)} is VALID [2022-04-15 06:36:40,437 INFO L290 TraceCheckUtils]: 59: Hoare triple {121949#(<= main_~c~0 17)} assume !(~c~0 < 200000); {121928#false} is VALID [2022-04-15 06:36:40,438 INFO L290 TraceCheckUtils]: 60: Hoare triple {121928#false} assume 0 == ~st~0 && ~c~0 == 1 + ~last~0;~a~0 := 3 + ~a~0;~b~0 := 3 + ~b~0; {121928#false} is VALID [2022-04-15 06:36:40,438 INFO L290 TraceCheckUtils]: 61: Hoare triple {121928#false} assume !(~c~0 == ~last~0 && 0 == ~st~0); {121928#false} is VALID [2022-04-15 06:36:40,438 INFO L272 TraceCheckUtils]: 62: Hoare triple {121928#false} call __VERIFIER_assert((if ~a~0 == ~b~0 && 200000 == ~c~0 then 1 else 0)); {121928#false} is VALID [2022-04-15 06:36:40,438 INFO L290 TraceCheckUtils]: 63: Hoare triple {121928#false} ~cond := #in~cond; {121928#false} is VALID [2022-04-15 06:36:40,438 INFO L290 TraceCheckUtils]: 64: Hoare triple {121928#false} assume 0 == ~cond; {121928#false} is VALID [2022-04-15 06:36:40,438 INFO L290 TraceCheckUtils]: 65: Hoare triple {121928#false} assume !false; {121928#false} is VALID [2022-04-15 06:36:40,438 INFO L134 CoverageAnalysis]: Checked inductivity of 425 backedges. 0 proven. 425 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 06:36:40,438 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 06:36:41,085 INFO L290 TraceCheckUtils]: 65: Hoare triple {121928#false} assume !false; {121928#false} is VALID [2022-04-15 06:36:41,085 INFO L290 TraceCheckUtils]: 64: Hoare triple {121928#false} assume 0 == ~cond; {121928#false} is VALID [2022-04-15 06:36:41,085 INFO L290 TraceCheckUtils]: 63: Hoare triple {121928#false} ~cond := #in~cond; {121928#false} is VALID [2022-04-15 06:36:41,085 INFO L272 TraceCheckUtils]: 62: Hoare triple {121928#false} call __VERIFIER_assert((if ~a~0 == ~b~0 && 200000 == ~c~0 then 1 else 0)); {121928#false} is VALID [2022-04-15 06:36:41,085 INFO L290 TraceCheckUtils]: 61: Hoare triple {121928#false} assume !(~c~0 == ~last~0 && 0 == ~st~0); {121928#false} is VALID [2022-04-15 06:36:41,085 INFO L290 TraceCheckUtils]: 60: Hoare triple {121928#false} assume 0 == ~st~0 && ~c~0 == 1 + ~last~0;~a~0 := 3 + ~a~0;~b~0 := 3 + ~b~0; {121928#false} is VALID [2022-04-15 06:36:41,086 INFO L290 TraceCheckUtils]: 59: Hoare triple {122168#(< main_~c~0 200000)} assume !(~c~0 < 200000); {121928#false} is VALID [2022-04-15 06:36:41,086 INFO L290 TraceCheckUtils]: 58: Hoare triple {122172#(< main_~c~0 199999)} #t~post5 := ~c~0;~c~0 := 1 + #t~post5;havoc #t~post5; {122168#(< main_~c~0 200000)} is VALID [2022-04-15 06:36:41,086 INFO L290 TraceCheckUtils]: 57: Hoare triple {122172#(< main_~c~0 199999)} assume !(~c~0 == ~last~0); {122172#(< main_~c~0 199999)} is VALID [2022-04-15 06:36:41,086 INFO L290 TraceCheckUtils]: 56: Hoare triple {122172#(< main_~c~0 199999)} assume !!(~c~0 < 200000); {122172#(< main_~c~0 199999)} is VALID [2022-04-15 06:36:41,087 INFO L290 TraceCheckUtils]: 55: Hoare triple {122182#(< main_~c~0 199998)} #t~post5 := ~c~0;~c~0 := 1 + #t~post5;havoc #t~post5; {122172#(< main_~c~0 199999)} is VALID [2022-04-15 06:36:41,087 INFO L290 TraceCheckUtils]: 54: Hoare triple {122182#(< main_~c~0 199998)} assume !(~c~0 == ~last~0); {122182#(< main_~c~0 199998)} is VALID [2022-04-15 06:36:41,087 INFO L290 TraceCheckUtils]: 53: Hoare triple {122182#(< main_~c~0 199998)} assume !!(~c~0 < 200000); {122182#(< main_~c~0 199998)} is VALID [2022-04-15 06:36:41,087 INFO L290 TraceCheckUtils]: 52: Hoare triple {122192#(< main_~c~0 199997)} #t~post5 := ~c~0;~c~0 := 1 + #t~post5;havoc #t~post5; {122182#(< main_~c~0 199998)} is VALID [2022-04-15 06:36:41,087 INFO L290 TraceCheckUtils]: 51: Hoare triple {122192#(< main_~c~0 199997)} assume !(~c~0 == ~last~0); {122192#(< main_~c~0 199997)} is VALID [2022-04-15 06:36:41,088 INFO L290 TraceCheckUtils]: 50: Hoare triple {122192#(< main_~c~0 199997)} assume !!(~c~0 < 200000); {122192#(< main_~c~0 199997)} is VALID [2022-04-15 06:36:41,088 INFO L290 TraceCheckUtils]: 49: Hoare triple {122202#(< main_~c~0 199996)} #t~post5 := ~c~0;~c~0 := 1 + #t~post5;havoc #t~post5; {122192#(< main_~c~0 199997)} is VALID [2022-04-15 06:36:41,088 INFO L290 TraceCheckUtils]: 48: Hoare triple {122202#(< main_~c~0 199996)} assume !(~c~0 == ~last~0); {122202#(< main_~c~0 199996)} is VALID [2022-04-15 06:36:41,088 INFO L290 TraceCheckUtils]: 47: Hoare triple {122202#(< main_~c~0 199996)} assume !!(~c~0 < 200000); {122202#(< main_~c~0 199996)} is VALID [2022-04-15 06:36:41,088 INFO L290 TraceCheckUtils]: 46: Hoare triple {122212#(< main_~c~0 199995)} #t~post5 := ~c~0;~c~0 := 1 + #t~post5;havoc #t~post5; {122202#(< main_~c~0 199996)} is VALID [2022-04-15 06:36:41,089 INFO L290 TraceCheckUtils]: 45: Hoare triple {122212#(< main_~c~0 199995)} assume !(~c~0 == ~last~0); {122212#(< main_~c~0 199995)} is VALID [2022-04-15 06:36:41,089 INFO L290 TraceCheckUtils]: 44: Hoare triple {122212#(< main_~c~0 199995)} assume !!(~c~0 < 200000); {122212#(< main_~c~0 199995)} is VALID [2022-04-15 06:36:41,089 INFO L290 TraceCheckUtils]: 43: Hoare triple {122222#(< main_~c~0 199994)} #t~post5 := ~c~0;~c~0 := 1 + #t~post5;havoc #t~post5; {122212#(< main_~c~0 199995)} is VALID [2022-04-15 06:36:41,089 INFO L290 TraceCheckUtils]: 42: Hoare triple {122222#(< main_~c~0 199994)} assume !(~c~0 == ~last~0); {122222#(< main_~c~0 199994)} is VALID [2022-04-15 06:36:41,090 INFO L290 TraceCheckUtils]: 41: Hoare triple {122222#(< main_~c~0 199994)} assume !!(~c~0 < 200000); {122222#(< main_~c~0 199994)} is VALID [2022-04-15 06:36:41,090 INFO L290 TraceCheckUtils]: 40: Hoare triple {122232#(< main_~c~0 199993)} #t~post5 := ~c~0;~c~0 := 1 + #t~post5;havoc #t~post5; {122222#(< main_~c~0 199994)} is VALID [2022-04-15 06:36:41,090 INFO L290 TraceCheckUtils]: 39: Hoare triple {122232#(< main_~c~0 199993)} assume !(~c~0 == ~last~0); {122232#(< main_~c~0 199993)} is VALID [2022-04-15 06:36:41,090 INFO L290 TraceCheckUtils]: 38: Hoare triple {122232#(< main_~c~0 199993)} assume !!(~c~0 < 200000); {122232#(< main_~c~0 199993)} is VALID [2022-04-15 06:36:41,091 INFO L290 TraceCheckUtils]: 37: Hoare triple {122242#(< main_~c~0 199992)} #t~post5 := ~c~0;~c~0 := 1 + #t~post5;havoc #t~post5; {122232#(< main_~c~0 199993)} is VALID [2022-04-15 06:36:41,091 INFO L290 TraceCheckUtils]: 36: Hoare triple {122242#(< main_~c~0 199992)} assume !(~c~0 == ~last~0); {122242#(< main_~c~0 199992)} is VALID [2022-04-15 06:36:41,091 INFO L290 TraceCheckUtils]: 35: Hoare triple {122242#(< main_~c~0 199992)} assume !!(~c~0 < 200000); {122242#(< main_~c~0 199992)} is VALID [2022-04-15 06:36:41,091 INFO L290 TraceCheckUtils]: 34: Hoare triple {122252#(< main_~c~0 199991)} #t~post5 := ~c~0;~c~0 := 1 + #t~post5;havoc #t~post5; {122242#(< main_~c~0 199992)} is VALID [2022-04-15 06:36:41,091 INFO L290 TraceCheckUtils]: 33: Hoare triple {122252#(< main_~c~0 199991)} assume !(~c~0 == ~last~0); {122252#(< main_~c~0 199991)} is VALID [2022-04-15 06:36:41,092 INFO L290 TraceCheckUtils]: 32: Hoare triple {122252#(< main_~c~0 199991)} assume !!(~c~0 < 200000); {122252#(< main_~c~0 199991)} is VALID [2022-04-15 06:36:41,092 INFO L290 TraceCheckUtils]: 31: Hoare triple {122262#(< main_~c~0 199990)} #t~post5 := ~c~0;~c~0 := 1 + #t~post5;havoc #t~post5; {122252#(< main_~c~0 199991)} is VALID [2022-04-15 06:36:41,092 INFO L290 TraceCheckUtils]: 30: Hoare triple {122262#(< main_~c~0 199990)} assume !(~c~0 == ~last~0); {122262#(< main_~c~0 199990)} is VALID [2022-04-15 06:36:41,092 INFO L290 TraceCheckUtils]: 29: Hoare triple {122262#(< main_~c~0 199990)} assume !!(~c~0 < 200000); {122262#(< main_~c~0 199990)} is VALID [2022-04-15 06:36:41,092 INFO L290 TraceCheckUtils]: 28: Hoare triple {122272#(< main_~c~0 199989)} #t~post5 := ~c~0;~c~0 := 1 + #t~post5;havoc #t~post5; {122262#(< main_~c~0 199990)} is VALID [2022-04-15 06:36:41,093 INFO L290 TraceCheckUtils]: 27: Hoare triple {122272#(< main_~c~0 199989)} assume !(~c~0 == ~last~0); {122272#(< main_~c~0 199989)} is VALID [2022-04-15 06:36:41,093 INFO L290 TraceCheckUtils]: 26: Hoare triple {122272#(< main_~c~0 199989)} assume !!(~c~0 < 200000); {122272#(< main_~c~0 199989)} is VALID [2022-04-15 06:36:41,093 INFO L290 TraceCheckUtils]: 25: Hoare triple {122282#(< main_~c~0 199988)} #t~post5 := ~c~0;~c~0 := 1 + #t~post5;havoc #t~post5; {122272#(< main_~c~0 199989)} is VALID [2022-04-15 06:36:41,093 INFO L290 TraceCheckUtils]: 24: Hoare triple {122282#(< main_~c~0 199988)} assume !(~c~0 == ~last~0); {122282#(< main_~c~0 199988)} is VALID [2022-04-15 06:36:41,093 INFO L290 TraceCheckUtils]: 23: Hoare triple {122282#(< main_~c~0 199988)} assume !!(~c~0 < 200000); {122282#(< main_~c~0 199988)} is VALID [2022-04-15 06:36:41,094 INFO L290 TraceCheckUtils]: 22: Hoare triple {122292#(< main_~c~0 199987)} #t~post5 := ~c~0;~c~0 := 1 + #t~post5;havoc #t~post5; {122282#(< main_~c~0 199988)} is VALID [2022-04-15 06:36:41,094 INFO L290 TraceCheckUtils]: 21: Hoare triple {122292#(< main_~c~0 199987)} assume !(~c~0 == ~last~0); {122292#(< main_~c~0 199987)} is VALID [2022-04-15 06:36:41,094 INFO L290 TraceCheckUtils]: 20: Hoare triple {122292#(< main_~c~0 199987)} assume !!(~c~0 < 200000); {122292#(< main_~c~0 199987)} is VALID [2022-04-15 06:36:41,094 INFO L290 TraceCheckUtils]: 19: Hoare triple {122302#(< main_~c~0 199986)} #t~post5 := ~c~0;~c~0 := 1 + #t~post5;havoc #t~post5; {122292#(< main_~c~0 199987)} is VALID [2022-04-15 06:36:41,094 INFO L290 TraceCheckUtils]: 18: Hoare triple {122302#(< main_~c~0 199986)} assume !(~c~0 == ~last~0); {122302#(< main_~c~0 199986)} is VALID [2022-04-15 06:36:41,095 INFO L290 TraceCheckUtils]: 17: Hoare triple {122302#(< main_~c~0 199986)} assume !!(~c~0 < 200000); {122302#(< main_~c~0 199986)} is VALID [2022-04-15 06:36:41,095 INFO L290 TraceCheckUtils]: 16: Hoare triple {122312#(< main_~c~0 199985)} #t~post5 := ~c~0;~c~0 := 1 + #t~post5;havoc #t~post5; {122302#(< main_~c~0 199986)} is VALID [2022-04-15 06:36:41,095 INFO L290 TraceCheckUtils]: 15: Hoare triple {122312#(< main_~c~0 199985)} assume !(~c~0 == ~last~0); {122312#(< main_~c~0 199985)} is VALID [2022-04-15 06:36:41,095 INFO L290 TraceCheckUtils]: 14: Hoare triple {122312#(< main_~c~0 199985)} assume !!(~c~0 < 200000); {122312#(< main_~c~0 199985)} is VALID [2022-04-15 06:36:41,096 INFO L290 TraceCheckUtils]: 13: Hoare triple {122322#(< main_~c~0 199984)} #t~post5 := ~c~0;~c~0 := 1 + #t~post5;havoc #t~post5; {122312#(< main_~c~0 199985)} is VALID [2022-04-15 06:36:41,096 INFO L290 TraceCheckUtils]: 12: Hoare triple {122322#(< main_~c~0 199984)} assume !(~c~0 == ~last~0); {122322#(< main_~c~0 199984)} is VALID [2022-04-15 06:36:41,096 INFO L290 TraceCheckUtils]: 11: Hoare triple {122322#(< main_~c~0 199984)} assume !!(~c~0 < 200000); {122322#(< main_~c~0 199984)} is VALID [2022-04-15 06:36:41,096 INFO L290 TraceCheckUtils]: 10: Hoare triple {122332#(< main_~c~0 199983)} #t~post5 := ~c~0;~c~0 := 1 + #t~post5;havoc #t~post5; {122322#(< main_~c~0 199984)} is VALID [2022-04-15 06:36:41,096 INFO L290 TraceCheckUtils]: 9: Hoare triple {122332#(< main_~c~0 199983)} assume ~c~0 == ~last~0;~st~0 := 0; {122332#(< main_~c~0 199983)} is VALID [2022-04-15 06:36:41,096 INFO L290 TraceCheckUtils]: 8: Hoare triple {122332#(< main_~c~0 199983)} assume !!(~c~0 < 200000); {122332#(< main_~c~0 199983)} is VALID [2022-04-15 06:36:41,097 INFO L290 TraceCheckUtils]: 7: Hoare triple {121927#true} [251] L23-3_primed-->L23-3: Formula: (and (= v_main_~c~0_7 0) (= v_main_~st~0_6 1)) InVars {} OutVars{main_~c~0=v_main_~c~0_7, main_~st~0=v_main_~st~0_6} AuxVars[] AssignedVars[main_~c~0, main_~st~0] {122332#(< main_~c~0 199983)} is VALID [2022-04-15 06:36:41,097 INFO L290 TraceCheckUtils]: 6: Hoare triple {121927#true} [252] L30-->L23-3_primed: Formula: (let ((.cse0 (= v_main_~b~0_260 v_main_~b~0_259)) (.cse1 (= |v_main_#t~post5_831| |v_main_#t~post5_814|)) (.cse2 (= v_main_~a~0_263 v_main_~a~0_262)) (.cse3 (= v_main_~c~0_1995 v_main_~c~0_1977))) (or (and .cse0 .cse1 (= v_main_~st~0_506 v_main_~st~0_504) .cse2 .cse3) (and .cse0 .cse1 .cse2 (= v_main_~st~0_504 v_main_~st~0_506) .cse3))) InVars {main_~c~0=v_main_~c~0_1995, main_#t~post5=|v_main_#t~post5_831|, main_~st~0=v_main_~st~0_506, main_~b~0=v_main_~b~0_260, main_~a~0=v_main_~a~0_263} OutVars{main_~c~0=v_main_~c~0_1977, main_#t~post5=|v_main_#t~post5_814|, main_~st~0=v_main_~st~0_504, main_~b~0=v_main_~b~0_259, main_~a~0=v_main_~a~0_262} AuxVars[] AssignedVars[main_~c~0, main_#t~post5, main_~st~0, main_~b~0, main_~a~0] {121927#true} is VALID [2022-04-15 06:36:41,097 INFO L290 TraceCheckUtils]: 5: Hoare triple {121927#true} assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~last~0 := #t~nondet4;havoc #t~nondet4;~a~0 := 0;~b~0 := 0;~c~0 := 0;~st~0 := 0; {121927#true} is VALID [2022-04-15 06:36:41,097 INFO L272 TraceCheckUtils]: 4: Hoare triple {121927#true} call #t~ret6 := main(); {121927#true} is VALID [2022-04-15 06:36:41,097 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {121927#true} {121927#true} #66#return; {121927#true} is VALID [2022-04-15 06:36:41,097 INFO L290 TraceCheckUtils]: 2: Hoare triple {121927#true} assume true; {121927#true} is VALID [2022-04-15 06:36:41,097 INFO L290 TraceCheckUtils]: 1: Hoare triple {121927#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(11, 2);call #Ultimate.allocInit(12, 3);~last~0 := 0; {121927#true} is VALID [2022-04-15 06:36:41,097 INFO L272 TraceCheckUtils]: 0: Hoare triple {121927#true} call ULTIMATE.init(); {121927#true} is VALID [2022-04-15 06:36:41,097 INFO L134 CoverageAnalysis]: Checked inductivity of 425 backedges. 0 proven. 425 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 06:36:41,097 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [214927362] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 06:36:41,097 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 06:36:41,098 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 20, 20] total 40 [2022-04-15 06:36:41,471 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 06:36:41,471 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [296080099] [2022-04-15 06:36:41,471 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [296080099] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 06:36:41,471 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 06:36:41,471 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [40] imperfect sequences [] total 40 [2022-04-15 06:36:41,471 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1057005609] [2022-04-15 06:36:41,471 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 06:36:41,472 INFO L78 Accepts]: Start accepts. Automaton has has 40 states, 40 states have (on average 2.925) internal successors, (117), 39 states have internal predecessors, (117), 2 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 125 [2022-04-15 06:36:41,472 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 06:36:41,472 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 40 states, 40 states have (on average 2.925) internal successors, (117), 39 states have internal predecessors, (117), 2 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-15 06:36:41,518 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 122 edges. 122 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 06:36:41,518 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 40 states [2022-04-15 06:36:41,518 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 06:36:41,518 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2022-04-15 06:36:41,519 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1314, Invalid=2108, Unknown=0, NotChecked=0, Total=3422 [2022-04-15 06:36:41,519 INFO L87 Difference]: Start difference. First operand 635 states and 709 transitions. Second operand has 40 states, 40 states have (on average 2.925) internal successors, (117), 39 states have internal predecessors, (117), 2 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-15 06:36:45,845 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:36:45,846 INFO L93 Difference]: Finished difference Result 955 states and 1076 transitions. [2022-04-15 06:36:45,846 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2022-04-15 06:36:45,846 INFO L78 Accepts]: Start accepts. Automaton has has 40 states, 40 states have (on average 2.925) internal successors, (117), 39 states have internal predecessors, (117), 2 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 125 [2022-04-15 06:36:45,846 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 06:36:45,846 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 40 states, 40 states have (on average 2.925) internal successors, (117), 39 states have internal predecessors, (117), 2 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-15 06:36:45,847 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 165 transitions. [2022-04-15 06:36:45,847 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 40 states, 40 states have (on average 2.925) internal successors, (117), 39 states have internal predecessors, (117), 2 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-15 06:36:45,865 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 165 transitions. [2022-04-15 06:36:45,865 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 40 states and 165 transitions. [2022-04-15 06:36:45,928 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-15 06:36:45,954 INFO L225 Difference]: With dead ends: 955 [2022-04-15 06:36:45,954 INFO L226 Difference]: Without dead ends: 831 [2022-04-15 06:36:45,954 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 221 GetRequests, 141 SyntacticMatches, 23 SemanticMatches, 57 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3147 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=1314, Invalid=2108, Unknown=0, NotChecked=0, Total=3422 [2022-04-15 06:36:45,957 INFO L913 BasicCegarLoop]: 18 mSDtfsCounter, 113 mSDsluCounter, 38 mSDsCounter, 0 mSdLazyCounter, 991 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 113 SdHoareTripleChecker+Valid, 56 SdHoareTripleChecker+Invalid, 1012 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 991 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-04-15 06:36:45,957 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [113 Valid, 56 Invalid, 1012 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 991 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-04-15 06:36:45,958 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 831 states. [2022-04-15 06:36:48,630 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 831 to 691. [2022-04-15 06:36:48,630 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 06:36:48,631 INFO L82 GeneralOperation]: Start isEquivalent. First operand 831 states. Second operand has 691 states, 683 states have (on average 1.1127379209370425) internal successors, (760), 684 states have internal predecessors, (760), 4 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-15 06:36:48,631 INFO L74 IsIncluded]: Start isIncluded. First operand 831 states. Second operand has 691 states, 683 states have (on average 1.1127379209370425) internal successors, (760), 684 states have internal predecessors, (760), 4 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-15 06:36:48,631 INFO L87 Difference]: Start difference. First operand 831 states. Second operand has 691 states, 683 states have (on average 1.1127379209370425) internal successors, (760), 684 states have internal predecessors, (760), 4 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-15 06:36:48,650 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:36:48,650 INFO L93 Difference]: Finished difference Result 831 states and 909 transitions. [2022-04-15 06:36:48,650 INFO L276 IsEmpty]: Start isEmpty. Operand 831 states and 909 transitions. [2022-04-15 06:36:48,651 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 06:36:48,651 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 06:36:48,651 INFO L74 IsIncluded]: Start isIncluded. First operand has 691 states, 683 states have (on average 1.1127379209370425) internal successors, (760), 684 states have internal predecessors, (760), 4 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) Second operand 831 states. [2022-04-15 06:36:48,652 INFO L87 Difference]: Start difference. First operand has 691 states, 683 states have (on average 1.1127379209370425) internal successors, (760), 684 states have internal predecessors, (760), 4 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) Second operand 831 states. [2022-04-15 06:36:48,670 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:36:48,670 INFO L93 Difference]: Finished difference Result 831 states and 909 transitions. [2022-04-15 06:36:48,670 INFO L276 IsEmpty]: Start isEmpty. Operand 831 states and 909 transitions. [2022-04-15 06:36:48,670 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 06:36:48,671 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 06:36:48,671 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 06:36:48,671 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 06:36:48,671 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 691 states, 683 states have (on average 1.1127379209370425) internal successors, (760), 684 states have internal predecessors, (760), 4 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-15 06:36:48,698 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 691 states to 691 states and 767 transitions. [2022-04-15 06:36:48,698 INFO L78 Accepts]: Start accepts. Automaton has 691 states and 767 transitions. Word has length 125 [2022-04-15 06:36:48,698 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 06:36:48,698 INFO L478 AbstractCegarLoop]: Abstraction has 691 states and 767 transitions. [2022-04-15 06:36:48,698 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 40 states, 40 states have (on average 2.925) internal successors, (117), 39 states have internal predecessors, (117), 2 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-15 06:36:48,698 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 691 states and 767 transitions. [2022-04-15 06:36:51,692 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 767 edges. 767 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 06:36:51,692 INFO L276 IsEmpty]: Start isEmpty. Operand 691 states and 767 transitions. [2022-04-15 06:36:51,693 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2022-04-15 06:36:51,693 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 06:36:51,693 INFO L499 BasicCegarLoop]: trace histogram [37, 37, 36, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 06:36:51,709 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (53)] Ended with exit code 0 [2022-04-15 06:36:51,907 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 53 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable56 [2022-04-15 06:36:51,908 INFO L403 AbstractCegarLoop]: === Iteration 58 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 06:36:51,908 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 06:36:51,908 INFO L85 PathProgramCache]: Analyzing trace with hash -234715292, now seen corresponding path program 36 times [2022-04-15 06:36:51,908 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 06:36:51,908 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [411403488] [2022-04-15 06:36:52,115 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 1 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-15 06:36:52,333 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {0={1=1}, 1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-15 06:36:52,334 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-15 06:36:52,336 INFO L85 PathProgramCache]: Analyzing trace with hash 301529800, now seen corresponding path program 1 times [2022-04-15 06:36:52,336 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 06:36:52,336 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2018609643] [2022-04-15 06:36:52,336 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 06:36:52,336 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 06:36:52,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:36:52,441 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 06:36:52,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:36:52,444 INFO L290 TraceCheckUtils]: 0: Hoare triple {127350#(and (= ~last~0 |old(~last~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(11, 2);call #Ultimate.allocInit(12, 3);~last~0 := 0; {127338#true} is VALID [2022-04-15 06:36:52,444 INFO L290 TraceCheckUtils]: 1: Hoare triple {127338#true} assume true; {127338#true} is VALID [2022-04-15 06:36:52,444 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {127338#true} {127338#true} #66#return; {127338#true} is VALID [2022-04-15 06:36:52,444 INFO L272 TraceCheckUtils]: 0: Hoare triple {127338#true} call ULTIMATE.init(); {127350#(and (= ~last~0 |old(~last~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 06:36:52,445 INFO L290 TraceCheckUtils]: 1: Hoare triple {127350#(and (= ~last~0 |old(~last~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(11, 2);call #Ultimate.allocInit(12, 3);~last~0 := 0; {127338#true} is VALID [2022-04-15 06:36:52,445 INFO L290 TraceCheckUtils]: 2: Hoare triple {127338#true} assume true; {127338#true} is VALID [2022-04-15 06:36:52,445 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {127338#true} {127338#true} #66#return; {127338#true} is VALID [2022-04-15 06:36:52,445 INFO L272 TraceCheckUtils]: 4: Hoare triple {127338#true} call #t~ret6 := main(); {127338#true} is VALID [2022-04-15 06:36:52,445 INFO L290 TraceCheckUtils]: 5: Hoare triple {127338#true} assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~last~0 := #t~nondet4;havoc #t~nondet4;~a~0 := 0;~b~0 := 0;~c~0 := 0;~st~0 := 0; {127343#(and (= main_~a~0 0) (= main_~b~0 0))} is VALID [2022-04-15 06:36:52,445 INFO L290 TraceCheckUtils]: 6: Hoare triple {127343#(and (= main_~a~0 0) (= main_~b~0 0))} assume !false;~st~0 := 1;~c~0 := 0; {127344#(and (= main_~a~0 0) (= main_~st~0 1) (= main_~b~0 0))} is VALID [2022-04-15 06:36:52,446 INFO L290 TraceCheckUtils]: 7: Hoare triple {127344#(and (= main_~a~0 0) (= main_~st~0 1) (= main_~b~0 0))} [254] L23-3-->L23-4_primed: Formula: (let ((.cse2 (= v_~last~0_385 v_main_~c~0_2052)) (.cse0 (= |v_main_#t~post5_854| |v_main_#t~post5_852|)) (.cse1 (= v_main_~c~0_2052 v_main_~c~0_2051))) (or (and .cse0 .cse1 (or .cse2 (not (< v_main_~c~0_2052 200000)))) (and (or (not (<= (+ v_~last~0_385 1) v_main_~c~0_2051)) (not (<= (+ v_main_~c~0_2052 1) v_~last~0_385))) (< v_main_~c~0_2052 v_main_~c~0_2051) (not .cse2) (< v_main_~c~0_2051 200001)) (and .cse0 (= v_~last~0_385 v_~last~0_385) .cse1))) InVars {main_~c~0=v_main_~c~0_2052, main_#t~post5=|v_main_#t~post5_854|, ~last~0=v_~last~0_385} OutVars{main_#t~post5=|v_main_#t~post5_852|, main_~c~0=v_main_~c~0_2051, ~last~0=v_~last~0_385} AuxVars[] AssignedVars[main_#t~post5, main_~c~0] {127344#(and (= main_~a~0 0) (= main_~st~0 1) (= main_~b~0 0))} is VALID [2022-04-15 06:36:52,446 INFO L290 TraceCheckUtils]: 8: Hoare triple {127344#(and (= main_~a~0 0) (= main_~st~0 1) (= main_~b~0 0))} [255] L23-4_primed-->L23-3: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {127344#(and (= main_~a~0 0) (= main_~st~0 1) (= main_~b~0 0))} is VALID [2022-04-15 06:36:52,447 INFO L290 TraceCheckUtils]: 9: Hoare triple {127344#(and (= main_~a~0 0) (= main_~st~0 1) (= main_~b~0 0))} [256] L23-3-->L23-4_primed: Formula: (let ((.cse0 (= v_main_~c~0_2054 v_main_~c~0_2053)) (.cse1 (= v_main_~st~0_514 v_main_~st~0_513)) (.cse2 (= v_~last~0_386 v_main_~c~0_2054)) (.cse3 (< v_main_~c~0_2054 200000))) (or (and .cse0 .cse1 (= |v_main_#t~post5_857| |v_main_#t~post5_853|) (= v_~last~0_386 v_~last~0_386)) (and .cse0 (or (not .cse2) (not .cse3)) .cse1 (= |v_main_#t~post5_853| |v_main_#t~post5_857|)) (and .cse2 (< v_main_~c~0_2054 v_main_~c~0_2053) .cse3 (<= v_main_~c~0_2053 (+ v_~last~0_386 1)) (= v_main_~st~0_513 0)))) InVars {main_~c~0=v_main_~c~0_2054, main_#t~post5=|v_main_#t~post5_857|, main_~st~0=v_main_~st~0_514, ~last~0=v_~last~0_386} OutVars{main_#t~post5=|v_main_#t~post5_853|, main_~c~0=v_main_~c~0_2053, main_~st~0=v_main_~st~0_513, ~last~0=v_~last~0_386} AuxVars[] AssignedVars[main_#t~post5, main_~c~0, main_~st~0] {127345#(or (= main_~st~0 1) (and (= main_~a~0 0) (or (<= ~last~0 199999) (<= main_~c~0 200000)) (= main_~b~0 0)))} is VALID [2022-04-15 06:36:52,447 INFO L290 TraceCheckUtils]: 10: Hoare triple {127345#(or (= main_~st~0 1) (and (= main_~a~0 0) (or (<= ~last~0 199999) (<= main_~c~0 200000)) (= main_~b~0 0)))} [253] L23-4_primed-->L23-4: Formula: (not (< v_main_~c~0_8 200000)) InVars {main_~c~0=v_main_~c~0_8} OutVars{main_~c~0=v_main_~c~0_8} AuxVars[] AssignedVars[] {127346#(or (= main_~st~0 1) (and (= main_~a~0 0) (or (<= ~last~0 199999) (<= main_~c~0 200000)) (= main_~b~0 0) (< 199999 main_~c~0)))} is VALID [2022-04-15 06:36:52,448 INFO L290 TraceCheckUtils]: 11: Hoare triple {127346#(or (= main_~st~0 1) (and (= main_~a~0 0) (or (<= ~last~0 199999) (<= main_~c~0 200000)) (= main_~b~0 0) (< 199999 main_~c~0)))} assume 0 == ~st~0 && ~c~0 == 1 + ~last~0;~a~0 := 3 + ~a~0;~b~0 := 3 + ~b~0; {127347#(and (<= main_~b~0 main_~a~0) (< main_~a~0 (+ main_~b~0 1)) (< 199999 main_~c~0) (<= main_~c~0 200000))} is VALID [2022-04-15 06:36:52,448 INFO L290 TraceCheckUtils]: 12: Hoare triple {127347#(and (<= main_~b~0 main_~a~0) (< main_~a~0 (+ main_~b~0 1)) (< 199999 main_~c~0) (<= main_~c~0 200000))} assume !(~c~0 == ~last~0 && 0 == ~st~0); {127347#(and (<= main_~b~0 main_~a~0) (< main_~a~0 (+ main_~b~0 1)) (< 199999 main_~c~0) (<= main_~c~0 200000))} is VALID [2022-04-15 06:36:52,449 INFO L272 TraceCheckUtils]: 13: Hoare triple {127347#(and (<= main_~b~0 main_~a~0) (< main_~a~0 (+ main_~b~0 1)) (< 199999 main_~c~0) (<= main_~c~0 200000))} call __VERIFIER_assert((if ~a~0 == ~b~0 && 200000 == ~c~0 then 1 else 0)); {127348#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-15 06:36:52,449 INFO L290 TraceCheckUtils]: 14: Hoare triple {127348#(not (= |__VERIFIER_assert_#in~cond| 0))} ~cond := #in~cond; {127349#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-15 06:36:52,450 INFO L290 TraceCheckUtils]: 15: Hoare triple {127349#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {127339#false} is VALID [2022-04-15 06:36:52,450 INFO L290 TraceCheckUtils]: 16: Hoare triple {127339#false} assume !false; {127339#false} is VALID [2022-04-15 06:36:52,450 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-04-15 06:36:52,450 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 06:36:52,450 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2018609643] [2022-04-15 06:36:52,450 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2018609643] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 06:36:52,450 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [781201692] [2022-04-15 06:36:52,450 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 06:36:52,450 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 06:36:52,450 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 06:36:52,451 INFO L229 MonitoredProcess]: Starting monitored process 54 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-15 06:36:52,452 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (54)] Waiting until timeout for monitored process [2022-04-15 06:36:52,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:36:52,480 INFO L263 TraceCheckSpWp]: Trace formula consists of 85 conjuncts, 18 conjunts are in the unsatisfiable core [2022-04-15 06:36:52,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:36:52,486 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 06:36:52,758 INFO L272 TraceCheckUtils]: 0: Hoare triple {127338#true} call ULTIMATE.init(); {127338#true} is VALID [2022-04-15 06:36:52,758 INFO L290 TraceCheckUtils]: 1: Hoare triple {127338#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(11, 2);call #Ultimate.allocInit(12, 3);~last~0 := 0; {127338#true} is VALID [2022-04-15 06:36:52,759 INFO L290 TraceCheckUtils]: 2: Hoare triple {127338#true} assume true; {127338#true} is VALID [2022-04-15 06:36:52,759 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {127338#true} {127338#true} #66#return; {127338#true} is VALID [2022-04-15 06:36:52,759 INFO L272 TraceCheckUtils]: 4: Hoare triple {127338#true} call #t~ret6 := main(); {127338#true} is VALID [2022-04-15 06:36:52,759 INFO L290 TraceCheckUtils]: 5: Hoare triple {127338#true} assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~last~0 := #t~nondet4;havoc #t~nondet4;~a~0 := 0;~b~0 := 0;~c~0 := 0;~st~0 := 0; {127343#(and (= main_~a~0 0) (= main_~b~0 0))} is VALID [2022-04-15 06:36:52,759 INFO L290 TraceCheckUtils]: 6: Hoare triple {127343#(and (= main_~a~0 0) (= main_~b~0 0))} assume !false;~st~0 := 1;~c~0 := 0; {127344#(and (= main_~a~0 0) (= main_~st~0 1) (= main_~b~0 0))} is VALID [2022-04-15 06:36:52,760 INFO L290 TraceCheckUtils]: 7: Hoare triple {127344#(and (= main_~a~0 0) (= main_~st~0 1) (= main_~b~0 0))} [254] L23-3-->L23-4_primed: Formula: (let ((.cse2 (= v_~last~0_385 v_main_~c~0_2052)) (.cse0 (= |v_main_#t~post5_854| |v_main_#t~post5_852|)) (.cse1 (= v_main_~c~0_2052 v_main_~c~0_2051))) (or (and .cse0 .cse1 (or .cse2 (not (< v_main_~c~0_2052 200000)))) (and (or (not (<= (+ v_~last~0_385 1) v_main_~c~0_2051)) (not (<= (+ v_main_~c~0_2052 1) v_~last~0_385))) (< v_main_~c~0_2052 v_main_~c~0_2051) (not .cse2) (< v_main_~c~0_2051 200001)) (and .cse0 (= v_~last~0_385 v_~last~0_385) .cse1))) InVars {main_~c~0=v_main_~c~0_2052, main_#t~post5=|v_main_#t~post5_854|, ~last~0=v_~last~0_385} OutVars{main_#t~post5=|v_main_#t~post5_852|, main_~c~0=v_main_~c~0_2051, ~last~0=v_~last~0_385} AuxVars[] AssignedVars[main_#t~post5, main_~c~0] {127344#(and (= main_~a~0 0) (= main_~st~0 1) (= main_~b~0 0))} is VALID [2022-04-15 06:36:52,760 INFO L290 TraceCheckUtils]: 8: Hoare triple {127344#(and (= main_~a~0 0) (= main_~st~0 1) (= main_~b~0 0))} [255] L23-4_primed-->L23-3: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {127344#(and (= main_~a~0 0) (= main_~st~0 1) (= main_~b~0 0))} is VALID [2022-04-15 06:36:52,761 INFO L290 TraceCheckUtils]: 9: Hoare triple {127344#(and (= main_~a~0 0) (= main_~st~0 1) (= main_~b~0 0))} [256] L23-3-->L23-4_primed: Formula: (let ((.cse0 (= v_main_~c~0_2054 v_main_~c~0_2053)) (.cse1 (= v_main_~st~0_514 v_main_~st~0_513)) (.cse2 (= v_~last~0_386 v_main_~c~0_2054)) (.cse3 (< v_main_~c~0_2054 200000))) (or (and .cse0 .cse1 (= |v_main_#t~post5_857| |v_main_#t~post5_853|) (= v_~last~0_386 v_~last~0_386)) (and .cse0 (or (not .cse2) (not .cse3)) .cse1 (= |v_main_#t~post5_853| |v_main_#t~post5_857|)) (and .cse2 (< v_main_~c~0_2054 v_main_~c~0_2053) .cse3 (<= v_main_~c~0_2053 (+ v_~last~0_386 1)) (= v_main_~st~0_513 0)))) InVars {main_~c~0=v_main_~c~0_2054, main_#t~post5=|v_main_#t~post5_857|, main_~st~0=v_main_~st~0_514, ~last~0=v_~last~0_386} OutVars{main_#t~post5=|v_main_#t~post5_853|, main_~c~0=v_main_~c~0_2053, main_~st~0=v_main_~st~0_513, ~last~0=v_~last~0_386} AuxVars[] AssignedVars[main_#t~post5, main_~c~0, main_~st~0] {127381#(and (= main_~a~0 0) (= main_~b~0 0) (or (and (< ~last~0 200000) (< ~last~0 main_~c~0) (<= main_~c~0 (+ ~last~0 1)) (= main_~st~0 0)) (= main_~st~0 1)))} is VALID [2022-04-15 06:36:52,761 INFO L290 TraceCheckUtils]: 10: Hoare triple {127381#(and (= main_~a~0 0) (= main_~b~0 0) (or (and (< ~last~0 200000) (< ~last~0 main_~c~0) (<= main_~c~0 (+ ~last~0 1)) (= main_~st~0 0)) (= main_~st~0 1)))} [253] L23-4_primed-->L23-4: Formula: (not (< v_main_~c~0_8 200000)) InVars {main_~c~0=v_main_~c~0_8} OutVars{main_~c~0=v_main_~c~0_8} AuxVars[] AssignedVars[] {127385#(and (= main_~a~0 0) (or (= main_~st~0 1) (and (< ~last~0 200000) (<= main_~c~0 (+ ~last~0 1)) (= main_~st~0 0))) (= main_~b~0 0) (not (< main_~c~0 200000)))} is VALID [2022-04-15 06:36:52,762 INFO L290 TraceCheckUtils]: 11: Hoare triple {127385#(and (= main_~a~0 0) (or (= main_~st~0 1) (and (< ~last~0 200000) (<= main_~c~0 (+ ~last~0 1)) (= main_~st~0 0))) (= main_~b~0 0) (not (< main_~c~0 200000)))} assume 0 == ~st~0 && ~c~0 == 1 + ~last~0;~a~0 := 3 + ~a~0;~b~0 := 3 + ~b~0; {127389#(and (= main_~b~0 3) (<= 200000 main_~c~0) (< main_~c~0 200001) (= main_~a~0 3))} is VALID [2022-04-15 06:36:52,762 INFO L290 TraceCheckUtils]: 12: Hoare triple {127389#(and (= main_~b~0 3) (<= 200000 main_~c~0) (< main_~c~0 200001) (= main_~a~0 3))} assume !(~c~0 == ~last~0 && 0 == ~st~0); {127389#(and (= main_~b~0 3) (<= 200000 main_~c~0) (< main_~c~0 200001) (= main_~a~0 3))} is VALID [2022-04-15 06:36:52,763 INFO L272 TraceCheckUtils]: 13: Hoare triple {127389#(and (= main_~b~0 3) (<= 200000 main_~c~0) (< main_~c~0 200001) (= main_~a~0 3))} call __VERIFIER_assert((if ~a~0 == ~b~0 && 200000 == ~c~0 then 1 else 0)); {127396#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-15 06:36:52,763 INFO L290 TraceCheckUtils]: 14: Hoare triple {127396#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {127400#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-15 06:36:52,764 INFO L290 TraceCheckUtils]: 15: Hoare triple {127400#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {127339#false} is VALID [2022-04-15 06:36:52,764 INFO L290 TraceCheckUtils]: 16: Hoare triple {127339#false} assume !false; {127339#false} is VALID [2022-04-15 06:36:52,764 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-04-15 06:36:52,764 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 06:36:53,153 INFO L290 TraceCheckUtils]: 16: Hoare triple {127339#false} assume !false; {127339#false} is VALID [2022-04-15 06:36:53,154 INFO L290 TraceCheckUtils]: 15: Hoare triple {127400#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {127339#false} is VALID [2022-04-15 06:36:53,154 INFO L290 TraceCheckUtils]: 14: Hoare triple {127396#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {127400#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-15 06:36:53,155 INFO L272 TraceCheckUtils]: 13: Hoare triple {127347#(and (<= main_~b~0 main_~a~0) (< main_~a~0 (+ main_~b~0 1)) (< 199999 main_~c~0) (<= main_~c~0 200000))} call __VERIFIER_assert((if ~a~0 == ~b~0 && 200000 == ~c~0 then 1 else 0)); {127396#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-15 06:36:53,155 INFO L290 TraceCheckUtils]: 12: Hoare triple {127347#(and (<= main_~b~0 main_~a~0) (< main_~a~0 (+ main_~b~0 1)) (< 199999 main_~c~0) (<= main_~c~0 200000))} assume !(~c~0 == ~last~0 && 0 == ~st~0); {127347#(and (<= main_~b~0 main_~a~0) (< main_~a~0 (+ main_~b~0 1)) (< 199999 main_~c~0) (<= main_~c~0 200000))} is VALID [2022-04-15 06:36:53,156 INFO L290 TraceCheckUtils]: 11: Hoare triple {127422#(or (not (<= main_~c~0 (+ ~last~0 1))) (and (<= main_~b~0 main_~a~0) (< main_~a~0 (+ main_~b~0 1)) (< 199999 main_~c~0) (<= main_~c~0 200000)) (not (= main_~st~0 0)))} assume 0 == ~st~0 && ~c~0 == 1 + ~last~0;~a~0 := 3 + ~a~0;~b~0 := 3 + ~b~0; {127347#(and (<= main_~b~0 main_~a~0) (< main_~a~0 (+ main_~b~0 1)) (< 199999 main_~c~0) (<= main_~c~0 200000))} is VALID [2022-04-15 06:36:53,156 INFO L290 TraceCheckUtils]: 10: Hoare triple {127426#(or (not (<= main_~c~0 (+ ~last~0 1))) (and (<= main_~b~0 main_~a~0) (< main_~a~0 (+ main_~b~0 1)) (<= main_~c~0 200000)) (not (= main_~st~0 0)) (< main_~c~0 200000))} [253] L23-4_primed-->L23-4: Formula: (not (< v_main_~c~0_8 200000)) InVars {main_~c~0=v_main_~c~0_8} OutVars{main_~c~0=v_main_~c~0_8} AuxVars[] AssignedVars[] {127422#(or (not (<= main_~c~0 (+ ~last~0 1))) (and (<= main_~b~0 main_~a~0) (< main_~a~0 (+ main_~b~0 1)) (< 199999 main_~c~0) (<= main_~c~0 200000)) (not (= main_~st~0 0)))} is VALID [2022-04-15 06:36:53,157 INFO L290 TraceCheckUtils]: 9: Hoare triple {127430#(and (<= main_~b~0 main_~a~0) (< main_~a~0 (+ main_~b~0 1)) (not (= main_~st~0 0)))} [256] L23-3-->L23-4_primed: Formula: (let ((.cse0 (= v_main_~c~0_2054 v_main_~c~0_2053)) (.cse1 (= v_main_~st~0_514 v_main_~st~0_513)) (.cse2 (= v_~last~0_386 v_main_~c~0_2054)) (.cse3 (< v_main_~c~0_2054 200000))) (or (and .cse0 .cse1 (= |v_main_#t~post5_857| |v_main_#t~post5_853|) (= v_~last~0_386 v_~last~0_386)) (and .cse0 (or (not .cse2) (not .cse3)) .cse1 (= |v_main_#t~post5_853| |v_main_#t~post5_857|)) (and .cse2 (< v_main_~c~0_2054 v_main_~c~0_2053) .cse3 (<= v_main_~c~0_2053 (+ v_~last~0_386 1)) (= v_main_~st~0_513 0)))) InVars {main_~c~0=v_main_~c~0_2054, main_#t~post5=|v_main_#t~post5_857|, main_~st~0=v_main_~st~0_514, ~last~0=v_~last~0_386} OutVars{main_#t~post5=|v_main_#t~post5_853|, main_~c~0=v_main_~c~0_2053, main_~st~0=v_main_~st~0_513, ~last~0=v_~last~0_386} AuxVars[] AssignedVars[main_#t~post5, main_~c~0, main_~st~0] {127426#(or (not (<= main_~c~0 (+ ~last~0 1))) (and (<= main_~b~0 main_~a~0) (< main_~a~0 (+ main_~b~0 1)) (<= main_~c~0 200000)) (not (= main_~st~0 0)) (< main_~c~0 200000))} is VALID [2022-04-15 06:36:53,157 INFO L290 TraceCheckUtils]: 8: Hoare triple {127430#(and (<= main_~b~0 main_~a~0) (< main_~a~0 (+ main_~b~0 1)) (not (= main_~st~0 0)))} [255] L23-4_primed-->L23-3: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {127430#(and (<= main_~b~0 main_~a~0) (< main_~a~0 (+ main_~b~0 1)) (not (= main_~st~0 0)))} is VALID [2022-04-15 06:36:53,158 INFO L290 TraceCheckUtils]: 7: Hoare triple {127430#(and (<= main_~b~0 main_~a~0) (< main_~a~0 (+ main_~b~0 1)) (not (= main_~st~0 0)))} [254] L23-3-->L23-4_primed: Formula: (let ((.cse2 (= v_~last~0_385 v_main_~c~0_2052)) (.cse0 (= |v_main_#t~post5_854| |v_main_#t~post5_852|)) (.cse1 (= v_main_~c~0_2052 v_main_~c~0_2051))) (or (and .cse0 .cse1 (or .cse2 (not (< v_main_~c~0_2052 200000)))) (and (or (not (<= (+ v_~last~0_385 1) v_main_~c~0_2051)) (not (<= (+ v_main_~c~0_2052 1) v_~last~0_385))) (< v_main_~c~0_2052 v_main_~c~0_2051) (not .cse2) (< v_main_~c~0_2051 200001)) (and .cse0 (= v_~last~0_385 v_~last~0_385) .cse1))) InVars {main_~c~0=v_main_~c~0_2052, main_#t~post5=|v_main_#t~post5_854|, ~last~0=v_~last~0_385} OutVars{main_#t~post5=|v_main_#t~post5_852|, main_~c~0=v_main_~c~0_2051, ~last~0=v_~last~0_385} AuxVars[] AssignedVars[main_#t~post5, main_~c~0] {127430#(and (<= main_~b~0 main_~a~0) (< main_~a~0 (+ main_~b~0 1)) (not (= main_~st~0 0)))} is VALID [2022-04-15 06:36:53,158 INFO L290 TraceCheckUtils]: 6: Hoare triple {127440#(and (<= main_~b~0 main_~a~0) (< main_~a~0 (+ main_~b~0 1)))} assume !false;~st~0 := 1;~c~0 := 0; {127430#(and (<= main_~b~0 main_~a~0) (< main_~a~0 (+ main_~b~0 1)) (not (= main_~st~0 0)))} is VALID [2022-04-15 06:36:53,159 INFO L290 TraceCheckUtils]: 5: Hoare triple {127338#true} assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~last~0 := #t~nondet4;havoc #t~nondet4;~a~0 := 0;~b~0 := 0;~c~0 := 0;~st~0 := 0; {127440#(and (<= main_~b~0 main_~a~0) (< main_~a~0 (+ main_~b~0 1)))} is VALID [2022-04-15 06:36:53,159 INFO L272 TraceCheckUtils]: 4: Hoare triple {127338#true} call #t~ret6 := main(); {127338#true} is VALID [2022-04-15 06:36:53,159 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {127338#true} {127338#true} #66#return; {127338#true} is VALID [2022-04-15 06:36:53,159 INFO L290 TraceCheckUtils]: 2: Hoare triple {127338#true} assume true; {127338#true} is VALID [2022-04-15 06:36:53,159 INFO L290 TraceCheckUtils]: 1: Hoare triple {127338#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(11, 2);call #Ultimate.allocInit(12, 3);~last~0 := 0; {127338#true} is VALID [2022-04-15 06:36:53,159 INFO L272 TraceCheckUtils]: 0: Hoare triple {127338#true} call ULTIMATE.init(); {127338#true} is VALID [2022-04-15 06:36:53,159 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-04-15 06:36:53,159 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [781201692] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 06:36:53,159 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 06:36:53,159 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9, 9] total 19 [2022-04-15 06:36:56,216 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 06:36:56,216 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [411403488] [2022-04-15 06:36:56,216 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [411403488] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 06:36:56,216 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 06:36:56,216 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [84] imperfect sequences [] total 84 [2022-04-15 06:36:56,216 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1528914612] [2022-04-15 06:36:56,217 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 06:36:56,217 INFO L78 Accepts]: Start accepts. Automaton has has 84 states, 84 states have (on average 1.4404761904761905) internal successors, (121), 82 states have internal predecessors, (121), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 125 [2022-04-15 06:36:56,217 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 06:36:56,217 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 84 states, 84 states have (on average 1.4404761904761905) internal successors, (121), 82 states have internal predecessors, (121), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:36:56,278 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 125 edges. 125 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 06:36:56,278 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 84 states [2022-04-15 06:36:56,278 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 06:36:56,279 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 84 interpolants. [2022-04-15 06:36:56,279 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=636, Invalid=8106, Unknown=0, NotChecked=0, Total=8742 [2022-04-15 06:36:56,279 INFO L87 Difference]: Start difference. First operand 691 states and 767 transitions. Second operand has 84 states, 84 states have (on average 1.4404761904761905) internal successors, (121), 82 states have internal predecessors, (121), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:37:13,659 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:37:13,659 INFO L93 Difference]: Finished difference Result 980 states and 1104 transitions. [2022-04-15 06:37:13,659 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 122 states. [2022-04-15 06:37:13,659 INFO L78 Accepts]: Start accepts. Automaton has has 84 states, 84 states have (on average 1.4404761904761905) internal successors, (121), 82 states have internal predecessors, (121), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 125 [2022-04-15 06:37:13,660 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 06:37:13,660 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 84 states, 84 states have (on average 1.4404761904761905) internal successors, (121), 82 states have internal predecessors, (121), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:37:13,662 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 122 states to 122 states and 256 transitions. [2022-04-15 06:37:13,662 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 84 states, 84 states have (on average 1.4404761904761905) internal successors, (121), 82 states have internal predecessors, (121), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:37:13,664 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 122 states to 122 states and 256 transitions. [2022-04-15 06:37:13,664 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 122 states and 256 transitions. [2022-04-15 06:37:13,857 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 256 edges. 256 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 06:37:13,885 INFO L225 Difference]: With dead ends: 980 [2022-04-15 06:37:13,885 INFO L226 Difference]: Without dead ends: 858 [2022-04-15 06:37:13,886 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 197 GetRequests, 63 SyntacticMatches, 2 SemanticMatches, 132 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5032 ImplicationChecksByTransitivity, 4.5s TimeCoverageRelationStatistics Valid=1023, Invalid=16799, Unknown=0, NotChecked=0, Total=17822 [2022-04-15 06:37:13,886 INFO L913 BasicCegarLoop]: 16 mSDtfsCounter, 192 mSDsluCounter, 178 mSDsCounter, 0 mSdLazyCounter, 11332 mSolverCounterSat, 163 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 194 SdHoareTripleChecker+Valid, 194 SdHoareTripleChecker+Invalid, 11495 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 163 IncrementalHoareTripleChecker+Valid, 11332 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6.1s IncrementalHoareTripleChecker+Time [2022-04-15 06:37:13,886 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [194 Valid, 194 Invalid, 11495 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [163 Valid, 11332 Invalid, 0 Unknown, 0 Unchecked, 6.1s Time] [2022-04-15 06:37:13,886 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 858 states. [2022-04-15 06:37:16,887 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 858 to 744. [2022-04-15 06:37:16,887 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 06:37:16,888 INFO L82 GeneralOperation]: Start isEquivalent. First operand 858 states. Second operand has 744 states, 736 states have (on average 1.107336956521739) internal successors, (815), 737 states have internal predecessors, (815), 4 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-15 06:37:16,889 INFO L74 IsIncluded]: Start isIncluded. First operand 858 states. Second operand has 744 states, 736 states have (on average 1.107336956521739) internal successors, (815), 737 states have internal predecessors, (815), 4 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-15 06:37:16,889 INFO L87 Difference]: Start difference. First operand 858 states. Second operand has 744 states, 736 states have (on average 1.107336956521739) internal successors, (815), 737 states have internal predecessors, (815), 4 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-15 06:37:16,908 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:37:16,909 INFO L93 Difference]: Finished difference Result 858 states and 957 transitions. [2022-04-15 06:37:16,909 INFO L276 IsEmpty]: Start isEmpty. Operand 858 states and 957 transitions. [2022-04-15 06:37:16,909 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 06:37:16,909 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 06:37:16,910 INFO L74 IsIncluded]: Start isIncluded. First operand has 744 states, 736 states have (on average 1.107336956521739) internal successors, (815), 737 states have internal predecessors, (815), 4 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) Second operand 858 states. [2022-04-15 06:37:16,910 INFO L87 Difference]: Start difference. First operand has 744 states, 736 states have (on average 1.107336956521739) internal successors, (815), 737 states have internal predecessors, (815), 4 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) Second operand 858 states. [2022-04-15 06:37:16,930 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:37:16,930 INFO L93 Difference]: Finished difference Result 858 states and 957 transitions. [2022-04-15 06:37:16,930 INFO L276 IsEmpty]: Start isEmpty. Operand 858 states and 957 transitions. [2022-04-15 06:37:16,930 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 06:37:16,930 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 06:37:16,930 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 06:37:16,930 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 06:37:16,931 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 744 states, 736 states have (on average 1.107336956521739) internal successors, (815), 737 states have internal predecessors, (815), 4 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-15 06:37:16,951 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 744 states to 744 states and 822 transitions. [2022-04-15 06:37:16,951 INFO L78 Accepts]: Start accepts. Automaton has 744 states and 822 transitions. Word has length 125 [2022-04-15 06:37:16,951 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 06:37:16,952 INFO L478 AbstractCegarLoop]: Abstraction has 744 states and 822 transitions. [2022-04-15 06:37:16,952 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 84 states, 84 states have (on average 1.4404761904761905) internal successors, (121), 82 states have internal predecessors, (121), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:37:16,952 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 744 states and 822 transitions. [2022-04-15 06:37:20,154 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 822 edges. 822 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 06:37:20,154 INFO L276 IsEmpty]: Start isEmpty. Operand 744 states and 822 transitions. [2022-04-15 06:37:20,155 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2022-04-15 06:37:20,155 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 06:37:20,155 INFO L499 BasicCegarLoop]: trace histogram [38, 38, 37, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 06:37:20,173 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (54)] Ended with exit code 0 [2022-04-15 06:37:20,373 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 54 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable57 [2022-04-15 06:37:20,373 INFO L403 AbstractCegarLoop]: === Iteration 59 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 06:37:20,373 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 06:37:20,373 INFO L85 PathProgramCache]: Analyzing trace with hash -401009209, now seen corresponding path program 37 times [2022-04-15 06:37:20,373 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 06:37:20,373 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1490556850] [2022-04-15 06:37:22,990 WARN L977 rdanLoopAcceleration]: Unable to prove correctness of quantifier elimination. [2022-04-15 06:37:23,107 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 1 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-15 06:37:23,310 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {0={1=1}, 1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-15 06:37:23,311 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-15 06:37:23,313 INFO L85 PathProgramCache]: Analyzing trace with hash -1488053304, now seen corresponding path program 1 times [2022-04-15 06:37:23,313 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 06:37:23,314 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1407878583] [2022-04-15 06:37:23,314 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 06:37:23,314 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 06:37:23,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:37:23,415 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 06:37:23,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:37:23,418 INFO L290 TraceCheckUtils]: 0: Hoare triple {132792#(and (= ~last~0 |old(~last~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(11, 2);call #Ultimate.allocInit(12, 3);~last~0 := 0; {132780#true} is VALID [2022-04-15 06:37:23,418 INFO L290 TraceCheckUtils]: 1: Hoare triple {132780#true} assume true; {132780#true} is VALID [2022-04-15 06:37:23,418 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {132780#true} {132780#true} #66#return; {132780#true} is VALID [2022-04-15 06:37:23,418 INFO L272 TraceCheckUtils]: 0: Hoare triple {132780#true} call ULTIMATE.init(); {132792#(and (= ~last~0 |old(~last~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 06:37:23,418 INFO L290 TraceCheckUtils]: 1: Hoare triple {132792#(and (= ~last~0 |old(~last~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(11, 2);call #Ultimate.allocInit(12, 3);~last~0 := 0; {132780#true} is VALID [2022-04-15 06:37:23,418 INFO L290 TraceCheckUtils]: 2: Hoare triple {132780#true} assume true; {132780#true} is VALID [2022-04-15 06:37:23,418 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {132780#true} {132780#true} #66#return; {132780#true} is VALID [2022-04-15 06:37:23,419 INFO L272 TraceCheckUtils]: 4: Hoare triple {132780#true} call #t~ret6 := main(); {132780#true} is VALID [2022-04-15 06:37:23,419 INFO L290 TraceCheckUtils]: 5: Hoare triple {132780#true} assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~last~0 := #t~nondet4;havoc #t~nondet4;~a~0 := 0;~b~0 := 0;~c~0 := 0;~st~0 := 0; {132785#(and (= main_~a~0 0) (= main_~b~0 0))} is VALID [2022-04-15 06:37:23,419 INFO L290 TraceCheckUtils]: 6: Hoare triple {132785#(and (= main_~a~0 0) (= main_~b~0 0))} assume !false;~st~0 := 1;~c~0 := 0; {132786#(and (= main_~a~0 0) (= main_~st~0 1) (= main_~b~0 0))} is VALID [2022-04-15 06:37:23,420 INFO L290 TraceCheckUtils]: 7: Hoare triple {132786#(and (= main_~a~0 0) (= main_~st~0 1) (= main_~b~0 0))} [258] L23-3-->L23-4_primed: Formula: (let ((.cse1 (= v_~last~0_393 v_main_~c~0_2106)) (.cse0 (= |v_main_#t~post5_867| |v_main_#t~post5_865|))) (or (and .cse0 (or .cse1 (not (< v_main_~c~0_2106 200000))) (= v_main_~c~0_2105 v_main_~c~0_2106)) (and (< v_main_~c~0_2106 v_main_~c~0_2105) (not .cse1) (or (not (<= (+ v_main_~c~0_2106 1) v_~last~0_393)) (not (<= (+ v_~last~0_393 1) v_main_~c~0_2105))) (< v_main_~c~0_2105 200001)) (and .cse0 (= v_main_~c~0_2106 v_main_~c~0_2105) (= v_~last~0_393 v_~last~0_393)))) InVars {main_~c~0=v_main_~c~0_2106, main_#t~post5=|v_main_#t~post5_867|, ~last~0=v_~last~0_393} OutVars{main_#t~post5=|v_main_#t~post5_865|, main_~c~0=v_main_~c~0_2105, ~last~0=v_~last~0_393} AuxVars[] AssignedVars[main_#t~post5, main_~c~0] {132786#(and (= main_~a~0 0) (= main_~st~0 1) (= main_~b~0 0))} is VALID [2022-04-15 06:37:23,420 INFO L290 TraceCheckUtils]: 8: Hoare triple {132786#(and (= main_~a~0 0) (= main_~st~0 1) (= main_~b~0 0))} [259] L23-4_primed-->L23-3: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {132786#(and (= main_~a~0 0) (= main_~st~0 1) (= main_~b~0 0))} is VALID [2022-04-15 06:37:23,421 INFO L290 TraceCheckUtils]: 9: Hoare triple {132786#(and (= main_~a~0 0) (= main_~st~0 1) (= main_~b~0 0))} [260] L23-3-->L23-4_primed: Formula: (let ((.cse0 (= |v_main_#t~post5_870| |v_main_#t~post5_866|)) (.cse1 (= v_main_~st~0_524 v_main_~st~0_523)) (.cse2 (= v_main_~c~0_2108 v_main_~c~0_2107)) (.cse4 (= v_~last~0_394 v_main_~c~0_2108)) (.cse3 (< v_main_~c~0_2108 200000))) (or (and .cse0 .cse1 (= v_~last~0_394 v_~last~0_394) .cse2) (and .cse0 .cse1 .cse2 (or (not .cse3) (not .cse4))) (and .cse4 (< v_main_~c~0_2107 (+ 2 v_main_~c~0_2108)) .cse3 (< v_main_~c~0_2108 v_main_~c~0_2107) (= v_main_~st~0_523 0)))) InVars {main_~c~0=v_main_~c~0_2108, main_#t~post5=|v_main_#t~post5_870|, main_~st~0=v_main_~st~0_524, ~last~0=v_~last~0_394} OutVars{main_#t~post5=|v_main_#t~post5_866|, main_~c~0=v_main_~c~0_2107, main_~st~0=v_main_~st~0_523, ~last~0=v_~last~0_394} AuxVars[] AssignedVars[main_#t~post5, main_~c~0, main_~st~0] {132787#(or (and (= main_~a~0 0) (= main_~b~0 0) (<= main_~c~0 200000)) (= main_~st~0 1))} is VALID [2022-04-15 06:37:23,421 INFO L290 TraceCheckUtils]: 10: Hoare triple {132787#(or (and (= main_~a~0 0) (= main_~b~0 0) (<= main_~c~0 200000)) (= main_~st~0 1))} [257] L23-4_primed-->L23-4: Formula: (not (< v_main_~c~0_8 200000)) InVars {main_~c~0=v_main_~c~0_8} OutVars{main_~c~0=v_main_~c~0_8} AuxVars[] AssignedVars[] {132788#(or (and (= main_~a~0 0) (= main_~b~0 0) (< 199999 main_~c~0) (<= main_~c~0 200000)) (= main_~st~0 1))} is VALID [2022-04-15 06:37:23,422 INFO L290 TraceCheckUtils]: 11: Hoare triple {132788#(or (and (= main_~a~0 0) (= main_~b~0 0) (< 199999 main_~c~0) (<= main_~c~0 200000)) (= main_~st~0 1))} assume 0 == ~st~0 && ~c~0 == 1 + ~last~0;~a~0 := 3 + ~a~0;~b~0 := 3 + ~b~0; {132789#(and (<= main_~b~0 main_~a~0) (< main_~a~0 (+ main_~b~0 1)) (< 199999 main_~c~0) (<= main_~c~0 200000))} is VALID [2022-04-15 06:37:23,422 INFO L290 TraceCheckUtils]: 12: Hoare triple {132789#(and (<= main_~b~0 main_~a~0) (< main_~a~0 (+ main_~b~0 1)) (< 199999 main_~c~0) (<= main_~c~0 200000))} assume !(~c~0 == ~last~0 && 0 == ~st~0); {132789#(and (<= main_~b~0 main_~a~0) (< main_~a~0 (+ main_~b~0 1)) (< 199999 main_~c~0) (<= main_~c~0 200000))} is VALID [2022-04-15 06:37:23,423 INFO L272 TraceCheckUtils]: 13: Hoare triple {132789#(and (<= main_~b~0 main_~a~0) (< main_~a~0 (+ main_~b~0 1)) (< 199999 main_~c~0) (<= main_~c~0 200000))} call __VERIFIER_assert((if ~a~0 == ~b~0 && 200000 == ~c~0 then 1 else 0)); {132790#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-15 06:37:23,423 INFO L290 TraceCheckUtils]: 14: Hoare triple {132790#(not (= |__VERIFIER_assert_#in~cond| 0))} ~cond := #in~cond; {132791#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-15 06:37:23,424 INFO L290 TraceCheckUtils]: 15: Hoare triple {132791#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {132781#false} is VALID [2022-04-15 06:37:23,424 INFO L290 TraceCheckUtils]: 16: Hoare triple {132781#false} assume !false; {132781#false} is VALID [2022-04-15 06:37:23,424 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-04-15 06:37:23,424 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 06:37:23,424 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1407878583] [2022-04-15 06:37:23,424 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1407878583] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 06:37:23,424 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1314693081] [2022-04-15 06:37:23,424 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 06:37:23,424 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 06:37:23,424 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 06:37:23,425 INFO L229 MonitoredProcess]: Starting monitored process 55 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-15 06:37:23,426 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (55)] Waiting until timeout for monitored process [2022-04-15 06:37:23,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:37:23,455 INFO L263 TraceCheckSpWp]: Trace formula consists of 85 conjuncts, 18 conjunts are in the unsatisfiable core [2022-04-15 06:37:23,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:37:23,461 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 06:37:23,745 INFO L272 TraceCheckUtils]: 0: Hoare triple {132780#true} call ULTIMATE.init(); {132780#true} is VALID [2022-04-15 06:37:23,745 INFO L290 TraceCheckUtils]: 1: Hoare triple {132780#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(11, 2);call #Ultimate.allocInit(12, 3);~last~0 := 0; {132780#true} is VALID [2022-04-15 06:37:23,745 INFO L290 TraceCheckUtils]: 2: Hoare triple {132780#true} assume true; {132780#true} is VALID [2022-04-15 06:37:23,745 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {132780#true} {132780#true} #66#return; {132780#true} is VALID [2022-04-15 06:37:23,745 INFO L272 TraceCheckUtils]: 4: Hoare triple {132780#true} call #t~ret6 := main(); {132780#true} is VALID [2022-04-15 06:37:23,745 INFO L290 TraceCheckUtils]: 5: Hoare triple {132780#true} assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~last~0 := #t~nondet4;havoc #t~nondet4;~a~0 := 0;~b~0 := 0;~c~0 := 0;~st~0 := 0; {132785#(and (= main_~a~0 0) (= main_~b~0 0))} is VALID [2022-04-15 06:37:23,746 INFO L290 TraceCheckUtils]: 6: Hoare triple {132785#(and (= main_~a~0 0) (= main_~b~0 0))} assume !false;~st~0 := 1;~c~0 := 0; {132786#(and (= main_~a~0 0) (= main_~st~0 1) (= main_~b~0 0))} is VALID [2022-04-15 06:37:23,746 INFO L290 TraceCheckUtils]: 7: Hoare triple {132786#(and (= main_~a~0 0) (= main_~st~0 1) (= main_~b~0 0))} [258] L23-3-->L23-4_primed: Formula: (let ((.cse1 (= v_~last~0_393 v_main_~c~0_2106)) (.cse0 (= |v_main_#t~post5_867| |v_main_#t~post5_865|))) (or (and .cse0 (or .cse1 (not (< v_main_~c~0_2106 200000))) (= v_main_~c~0_2105 v_main_~c~0_2106)) (and (< v_main_~c~0_2106 v_main_~c~0_2105) (not .cse1) (or (not (<= (+ v_main_~c~0_2106 1) v_~last~0_393)) (not (<= (+ v_~last~0_393 1) v_main_~c~0_2105))) (< v_main_~c~0_2105 200001)) (and .cse0 (= v_main_~c~0_2106 v_main_~c~0_2105) (= v_~last~0_393 v_~last~0_393)))) InVars {main_~c~0=v_main_~c~0_2106, main_#t~post5=|v_main_#t~post5_867|, ~last~0=v_~last~0_393} OutVars{main_#t~post5=|v_main_#t~post5_865|, main_~c~0=v_main_~c~0_2105, ~last~0=v_~last~0_393} AuxVars[] AssignedVars[main_#t~post5, main_~c~0] {132786#(and (= main_~a~0 0) (= main_~st~0 1) (= main_~b~0 0))} is VALID [2022-04-15 06:37:23,747 INFO L290 TraceCheckUtils]: 8: Hoare triple {132786#(and (= main_~a~0 0) (= main_~st~0 1) (= main_~b~0 0))} [259] L23-4_primed-->L23-3: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {132786#(and (= main_~a~0 0) (= main_~st~0 1) (= main_~b~0 0))} is VALID [2022-04-15 06:37:23,748 INFO L290 TraceCheckUtils]: 9: Hoare triple {132786#(and (= main_~a~0 0) (= main_~st~0 1) (= main_~b~0 0))} [260] L23-3-->L23-4_primed: Formula: (let ((.cse0 (= |v_main_#t~post5_870| |v_main_#t~post5_866|)) (.cse1 (= v_main_~st~0_524 v_main_~st~0_523)) (.cse2 (= v_main_~c~0_2108 v_main_~c~0_2107)) (.cse4 (= v_~last~0_394 v_main_~c~0_2108)) (.cse3 (< v_main_~c~0_2108 200000))) (or (and .cse0 .cse1 (= v_~last~0_394 v_~last~0_394) .cse2) (and .cse0 .cse1 .cse2 (or (not .cse3) (not .cse4))) (and .cse4 (< v_main_~c~0_2107 (+ 2 v_main_~c~0_2108)) .cse3 (< v_main_~c~0_2108 v_main_~c~0_2107) (= v_main_~st~0_523 0)))) InVars {main_~c~0=v_main_~c~0_2108, main_#t~post5=|v_main_#t~post5_870|, main_~st~0=v_main_~st~0_524, ~last~0=v_~last~0_394} OutVars{main_#t~post5=|v_main_#t~post5_866|, main_~c~0=v_main_~c~0_2107, main_~st~0=v_main_~st~0_523, ~last~0=v_~last~0_394} AuxVars[] AssignedVars[main_#t~post5, main_~c~0, main_~st~0] {132823#(and (= main_~a~0 0) (= main_~b~0 0) (or (= main_~st~0 1) (and (< ~last~0 200000) (< ~last~0 main_~c~0) (< main_~c~0 (+ ~last~0 2)) (= main_~st~0 0))))} is VALID [2022-04-15 06:37:23,748 INFO L290 TraceCheckUtils]: 10: Hoare triple {132823#(and (= main_~a~0 0) (= main_~b~0 0) (or (= main_~st~0 1) (and (< ~last~0 200000) (< ~last~0 main_~c~0) (< main_~c~0 (+ ~last~0 2)) (= main_~st~0 0))))} [257] L23-4_primed-->L23-4: Formula: (not (< v_main_~c~0_8 200000)) InVars {main_~c~0=v_main_~c~0_8} OutVars{main_~c~0=v_main_~c~0_8} AuxVars[] AssignedVars[] {132827#(and (= main_~a~0 0) (or (and (< ~last~0 200000) (< main_~c~0 (+ ~last~0 2)) (= main_~st~0 0)) (= main_~st~0 1)) (= main_~b~0 0) (not (< main_~c~0 200000)))} is VALID [2022-04-15 06:37:23,749 INFO L290 TraceCheckUtils]: 11: Hoare triple {132827#(and (= main_~a~0 0) (or (and (< ~last~0 200000) (< main_~c~0 (+ ~last~0 2)) (= main_~st~0 0)) (= main_~st~0 1)) (= main_~b~0 0) (not (< main_~c~0 200000)))} assume 0 == ~st~0 && ~c~0 == 1 + ~last~0;~a~0 := 3 + ~a~0;~b~0 := 3 + ~b~0; {132831#(and (= main_~b~0 3) (<= 200000 main_~c~0) (< main_~c~0 200001) (= main_~a~0 3))} is VALID [2022-04-15 06:37:23,749 INFO L290 TraceCheckUtils]: 12: Hoare triple {132831#(and (= main_~b~0 3) (<= 200000 main_~c~0) (< main_~c~0 200001) (= main_~a~0 3))} assume !(~c~0 == ~last~0 && 0 == ~st~0); {132831#(and (= main_~b~0 3) (<= 200000 main_~c~0) (< main_~c~0 200001) (= main_~a~0 3))} is VALID [2022-04-15 06:37:23,750 INFO L272 TraceCheckUtils]: 13: Hoare triple {132831#(and (= main_~b~0 3) (<= 200000 main_~c~0) (< main_~c~0 200001) (= main_~a~0 3))} call __VERIFIER_assert((if ~a~0 == ~b~0 && 200000 == ~c~0 then 1 else 0)); {132838#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-15 06:37:23,750 INFO L290 TraceCheckUtils]: 14: Hoare triple {132838#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {132842#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-15 06:37:23,750 INFO L290 TraceCheckUtils]: 15: Hoare triple {132842#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {132781#false} is VALID [2022-04-15 06:37:23,750 INFO L290 TraceCheckUtils]: 16: Hoare triple {132781#false} assume !false; {132781#false} is VALID [2022-04-15 06:37:23,751 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-04-15 06:37:23,751 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 06:37:24,114 INFO L290 TraceCheckUtils]: 16: Hoare triple {132781#false} assume !false; {132781#false} is VALID [2022-04-15 06:37:24,115 INFO L290 TraceCheckUtils]: 15: Hoare triple {132842#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {132781#false} is VALID [2022-04-15 06:37:24,115 INFO L290 TraceCheckUtils]: 14: Hoare triple {132838#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {132842#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-15 06:37:24,116 INFO L272 TraceCheckUtils]: 13: Hoare triple {132789#(and (<= main_~b~0 main_~a~0) (< main_~a~0 (+ main_~b~0 1)) (< 199999 main_~c~0) (<= main_~c~0 200000))} call __VERIFIER_assert((if ~a~0 == ~b~0 && 200000 == ~c~0 then 1 else 0)); {132838#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-15 06:37:24,116 INFO L290 TraceCheckUtils]: 12: Hoare triple {132789#(and (<= main_~b~0 main_~a~0) (< main_~a~0 (+ main_~b~0 1)) (< 199999 main_~c~0) (<= main_~c~0 200000))} assume !(~c~0 == ~last~0 && 0 == ~st~0); {132789#(and (<= main_~b~0 main_~a~0) (< main_~a~0 (+ main_~b~0 1)) (< 199999 main_~c~0) (<= main_~c~0 200000))} is VALID [2022-04-15 06:37:24,117 INFO L290 TraceCheckUtils]: 11: Hoare triple {132864#(or (not (<= main_~c~0 (+ ~last~0 1))) (and (<= main_~b~0 main_~a~0) (< main_~a~0 (+ main_~b~0 1)) (< 199999 main_~c~0) (<= main_~c~0 200000)) (not (= main_~st~0 0)))} assume 0 == ~st~0 && ~c~0 == 1 + ~last~0;~a~0 := 3 + ~a~0;~b~0 := 3 + ~b~0; {132789#(and (<= main_~b~0 main_~a~0) (< main_~a~0 (+ main_~b~0 1)) (< 199999 main_~c~0) (<= main_~c~0 200000))} is VALID [2022-04-15 06:37:24,118 INFO L290 TraceCheckUtils]: 10: Hoare triple {132868#(or (not (<= main_~c~0 (+ ~last~0 1))) (and (<= main_~b~0 main_~a~0) (< main_~a~0 (+ main_~b~0 1)) (<= main_~c~0 200000)) (not (= main_~st~0 0)) (< main_~c~0 200000))} [257] L23-4_primed-->L23-4: Formula: (not (< v_main_~c~0_8 200000)) InVars {main_~c~0=v_main_~c~0_8} OutVars{main_~c~0=v_main_~c~0_8} AuxVars[] AssignedVars[] {132864#(or (not (<= main_~c~0 (+ ~last~0 1))) (and (<= main_~b~0 main_~a~0) (< main_~a~0 (+ main_~b~0 1)) (< 199999 main_~c~0) (<= main_~c~0 200000)) (not (= main_~st~0 0)))} is VALID [2022-04-15 06:37:24,118 INFO L290 TraceCheckUtils]: 9: Hoare triple {132872#(and (<= main_~b~0 main_~a~0) (< main_~a~0 (+ main_~b~0 1)) (not (= main_~st~0 0)))} [260] L23-3-->L23-4_primed: Formula: (let ((.cse0 (= |v_main_#t~post5_870| |v_main_#t~post5_866|)) (.cse1 (= v_main_~st~0_524 v_main_~st~0_523)) (.cse2 (= v_main_~c~0_2108 v_main_~c~0_2107)) (.cse4 (= v_~last~0_394 v_main_~c~0_2108)) (.cse3 (< v_main_~c~0_2108 200000))) (or (and .cse0 .cse1 (= v_~last~0_394 v_~last~0_394) .cse2) (and .cse0 .cse1 .cse2 (or (not .cse3) (not .cse4))) (and .cse4 (< v_main_~c~0_2107 (+ 2 v_main_~c~0_2108)) .cse3 (< v_main_~c~0_2108 v_main_~c~0_2107) (= v_main_~st~0_523 0)))) InVars {main_~c~0=v_main_~c~0_2108, main_#t~post5=|v_main_#t~post5_870|, main_~st~0=v_main_~st~0_524, ~last~0=v_~last~0_394} OutVars{main_#t~post5=|v_main_#t~post5_866|, main_~c~0=v_main_~c~0_2107, main_~st~0=v_main_~st~0_523, ~last~0=v_~last~0_394} AuxVars[] AssignedVars[main_#t~post5, main_~c~0, main_~st~0] {132868#(or (not (<= main_~c~0 (+ ~last~0 1))) (and (<= main_~b~0 main_~a~0) (< main_~a~0 (+ main_~b~0 1)) (<= main_~c~0 200000)) (not (= main_~st~0 0)) (< main_~c~0 200000))} is VALID [2022-04-15 06:37:24,119 INFO L290 TraceCheckUtils]: 8: Hoare triple {132872#(and (<= main_~b~0 main_~a~0) (< main_~a~0 (+ main_~b~0 1)) (not (= main_~st~0 0)))} [259] L23-4_primed-->L23-3: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {132872#(and (<= main_~b~0 main_~a~0) (< main_~a~0 (+ main_~b~0 1)) (not (= main_~st~0 0)))} is VALID [2022-04-15 06:37:24,119 INFO L290 TraceCheckUtils]: 7: Hoare triple {132872#(and (<= main_~b~0 main_~a~0) (< main_~a~0 (+ main_~b~0 1)) (not (= main_~st~0 0)))} [258] L23-3-->L23-4_primed: Formula: (let ((.cse1 (= v_~last~0_393 v_main_~c~0_2106)) (.cse0 (= |v_main_#t~post5_867| |v_main_#t~post5_865|))) (or (and .cse0 (or .cse1 (not (< v_main_~c~0_2106 200000))) (= v_main_~c~0_2105 v_main_~c~0_2106)) (and (< v_main_~c~0_2106 v_main_~c~0_2105) (not .cse1) (or (not (<= (+ v_main_~c~0_2106 1) v_~last~0_393)) (not (<= (+ v_~last~0_393 1) v_main_~c~0_2105))) (< v_main_~c~0_2105 200001)) (and .cse0 (= v_main_~c~0_2106 v_main_~c~0_2105) (= v_~last~0_393 v_~last~0_393)))) InVars {main_~c~0=v_main_~c~0_2106, main_#t~post5=|v_main_#t~post5_867|, ~last~0=v_~last~0_393} OutVars{main_#t~post5=|v_main_#t~post5_865|, main_~c~0=v_main_~c~0_2105, ~last~0=v_~last~0_393} AuxVars[] AssignedVars[main_#t~post5, main_~c~0] {132872#(and (<= main_~b~0 main_~a~0) (< main_~a~0 (+ main_~b~0 1)) (not (= main_~st~0 0)))} is VALID [2022-04-15 06:37:24,120 INFO L290 TraceCheckUtils]: 6: Hoare triple {132882#(and (<= main_~b~0 main_~a~0) (< main_~a~0 (+ main_~b~0 1)))} assume !false;~st~0 := 1;~c~0 := 0; {132872#(and (<= main_~b~0 main_~a~0) (< main_~a~0 (+ main_~b~0 1)) (not (= main_~st~0 0)))} is VALID [2022-04-15 06:37:24,120 INFO L290 TraceCheckUtils]: 5: Hoare triple {132780#true} assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~last~0 := #t~nondet4;havoc #t~nondet4;~a~0 := 0;~b~0 := 0;~c~0 := 0;~st~0 := 0; {132882#(and (<= main_~b~0 main_~a~0) (< main_~a~0 (+ main_~b~0 1)))} is VALID [2022-04-15 06:37:24,120 INFO L272 TraceCheckUtils]: 4: Hoare triple {132780#true} call #t~ret6 := main(); {132780#true} is VALID [2022-04-15 06:37:24,120 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {132780#true} {132780#true} #66#return; {132780#true} is VALID [2022-04-15 06:37:24,120 INFO L290 TraceCheckUtils]: 2: Hoare triple {132780#true} assume true; {132780#true} is VALID [2022-04-15 06:37:24,120 INFO L290 TraceCheckUtils]: 1: Hoare triple {132780#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(11, 2);call #Ultimate.allocInit(12, 3);~last~0 := 0; {132780#true} is VALID [2022-04-15 06:37:24,120 INFO L272 TraceCheckUtils]: 0: Hoare triple {132780#true} call ULTIMATE.init(); {132780#true} is VALID [2022-04-15 06:37:24,120 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-04-15 06:37:24,120 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1314693081] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 06:37:24,121 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 06:37:24,121 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9, 9] total 19 [2022-04-15 06:37:27,307 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 06:37:27,307 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1490556850] [2022-04-15 06:37:27,307 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1490556850] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 06:37:27,307 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 06:37:27,307 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [86] imperfect sequences [] total 86 [2022-04-15 06:37:27,307 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [539987209] [2022-04-15 06:37:27,307 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 06:37:27,308 INFO L78 Accepts]: Start accepts. Automaton has has 86 states, 86 states have (on average 1.441860465116279) internal successors, (124), 84 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-15 06:37:27,308 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 06:37:27,308 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 86 states, 86 states have (on average 1.441860465116279) internal successors, (124), 84 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-15 06:37:27,371 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 128 edges. 128 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 06:37:27,371 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 86 states [2022-04-15 06:37:27,372 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 06:37:27,372 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 86 interpolants. [2022-04-15 06:37:27,372 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=651, Invalid=8469, Unknown=0, NotChecked=0, Total=9120 [2022-04-15 06:37:27,372 INFO L87 Difference]: Start difference. First operand 744 states and 822 transitions. Second operand has 86 states, 86 states have (on average 1.441860465116279) internal successors, (124), 84 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-15 06:37:48,511 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:37:48,511 INFO L93 Difference]: Finished difference Result 926 states and 1031 transitions. [2022-04-15 06:37:48,511 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 125 states. [2022-04-15 06:37:48,511 INFO L78 Accepts]: Start accepts. Automaton has has 86 states, 86 states have (on average 1.441860465116279) internal successors, (124), 84 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-15 06:37:48,511 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 06:37:48,511 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 86 states, 86 states have (on average 1.441860465116279) internal successors, (124), 84 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-15 06:37:48,513 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 125 states to 125 states and 260 transitions. [2022-04-15 06:37:48,513 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 86 states, 86 states have (on average 1.441860465116279) internal successors, (124), 84 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-15 06:37:48,514 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 125 states to 125 states and 260 transitions. [2022-04-15 06:37:48,514 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 125 states and 260 transitions. [2022-04-15 06:37:48,642 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 260 edges. 260 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 06:37:48,666 INFO L225 Difference]: With dead ends: 926 [2022-04-15 06:37:48,666 INFO L226 Difference]: Without dead ends: 804 [2022-04-15 06:37:48,667 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 201 GetRequests, 64 SyntacticMatches, 2 SemanticMatches, 135 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5259 ImplicationChecksByTransitivity, 4.6s TimeCoverageRelationStatistics Valid=1048, Invalid=17584, Unknown=0, NotChecked=0, Total=18632 [2022-04-15 06:37:48,667 INFO L913 BasicCegarLoop]: 17 mSDtfsCounter, 160 mSDsluCounter, 257 mSDsCounter, 0 mSdLazyCounter, 13696 mSolverCounterSat, 164 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 7.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 162 SdHoareTripleChecker+Valid, 274 SdHoareTripleChecker+Invalid, 13860 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 164 IncrementalHoareTripleChecker+Valid, 13696 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 7.9s IncrementalHoareTripleChecker+Time [2022-04-15 06:37:48,668 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [162 Valid, 274 Invalid, 13860 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [164 Valid, 13696 Invalid, 0 Unknown, 0 Unchecked, 7.9s Time] [2022-04-15 06:37:48,668 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 804 states. [2022-04-15 06:37:51,633 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 804 to 747. [2022-04-15 06:37:51,633 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 06:37:51,634 INFO L82 GeneralOperation]: Start isEquivalent. First operand 804 states. Second operand has 747 states, 739 states have (on average 1.108254397834912) internal successors, (819), 740 states have internal predecessors, (819), 4 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-15 06:37:51,635 INFO L74 IsIncluded]: Start isIncluded. First operand 804 states. Second operand has 747 states, 739 states have (on average 1.108254397834912) internal successors, (819), 740 states have internal predecessors, (819), 4 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-15 06:37:51,635 INFO L87 Difference]: Start difference. First operand 804 states. Second operand has 747 states, 739 states have (on average 1.108254397834912) internal successors, (819), 740 states have internal predecessors, (819), 4 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-15 06:37:51,659 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:37:51,659 INFO L93 Difference]: Finished difference Result 804 states and 885 transitions. [2022-04-15 06:37:51,659 INFO L276 IsEmpty]: Start isEmpty. Operand 804 states and 885 transitions. [2022-04-15 06:37:51,659 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 06:37:51,659 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 06:37:51,660 INFO L74 IsIncluded]: Start isIncluded. First operand has 747 states, 739 states have (on average 1.108254397834912) internal successors, (819), 740 states have internal predecessors, (819), 4 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) Second operand 804 states. [2022-04-15 06:37:51,660 INFO L87 Difference]: Start difference. First operand has 747 states, 739 states have (on average 1.108254397834912) internal successors, (819), 740 states have internal predecessors, (819), 4 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) Second operand 804 states. [2022-04-15 06:37:51,681 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:37:51,681 INFO L93 Difference]: Finished difference Result 804 states and 885 transitions. [2022-04-15 06:37:51,681 INFO L276 IsEmpty]: Start isEmpty. Operand 804 states and 885 transitions. [2022-04-15 06:37:51,682 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 06:37:51,682 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 06:37:51,682 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 06:37:51,682 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 06:37:51,683 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 747 states, 739 states have (on average 1.108254397834912) internal successors, (819), 740 states have internal predecessors, (819), 4 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-15 06:37:51,709 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 747 states to 747 states and 826 transitions. [2022-04-15 06:37:51,709 INFO L78 Accepts]: Start accepts. Automaton has 747 states and 826 transitions. Word has length 128 [2022-04-15 06:37:51,709 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 06:37:51,709 INFO L478 AbstractCegarLoop]: Abstraction has 747 states and 826 transitions. [2022-04-15 06:37:51,710 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 86 states, 86 states have (on average 1.441860465116279) internal successors, (124), 84 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-15 06:37:51,710 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 747 states and 826 transitions. [2022-04-15 06:37:54,783 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 826 edges. 826 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 06:37:54,783 INFO L276 IsEmpty]: Start isEmpty. Operand 747 states and 826 transitions. [2022-04-15 06:37:54,784 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2022-04-15 06:37:54,784 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 06:37:54,784 INFO L499 BasicCegarLoop]: trace histogram [36, 36, 34, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 06:37:54,802 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (55)] Forceful destruction successful, exit code 0 [2022-04-15 06:37:54,990 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 55 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable58 [2022-04-15 06:37:54,990 INFO L403 AbstractCegarLoop]: === Iteration 60 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 06:37:54,991 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 06:37:54,991 INFO L85 PathProgramCache]: Analyzing trace with hash 1062844354, now seen corresponding path program 17 times [2022-04-15 06:37:54,991 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 06:37:54,991 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [2075017766] [2022-04-15 06:37:55,282 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 4 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {0={1=2}, 1={1=1, 2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-15 06:37:55,282 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-15 06:37:55,282 INFO L85 PathProgramCache]: Analyzing trace with hash 510374099, now seen corresponding path program 1 times [2022-04-15 06:37:55,282 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 06:37:55,282 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1726278660] [2022-04-15 06:37:55,282 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 06:37:55,282 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 06:37:55,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:37:55,487 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 06:37:55,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:37:55,490 INFO L290 TraceCheckUtils]: 0: Hoare triple {138040#(and (= ~last~0 |old(~last~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(11, 2);call #Ultimate.allocInit(12, 3);~last~0 := 0; {138016#true} is VALID [2022-04-15 06:37:55,490 INFO L290 TraceCheckUtils]: 1: Hoare triple {138016#true} assume true; {138016#true} is VALID [2022-04-15 06:37:55,490 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {138016#true} {138016#true} #66#return; {138016#true} is VALID [2022-04-15 06:37:55,490 INFO L272 TraceCheckUtils]: 0: Hoare triple {138016#true} call ULTIMATE.init(); {138040#(and (= ~last~0 |old(~last~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 06:37:55,490 INFO L290 TraceCheckUtils]: 1: Hoare triple {138040#(and (= ~last~0 |old(~last~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(11, 2);call #Ultimate.allocInit(12, 3);~last~0 := 0; {138016#true} is VALID [2022-04-15 06:37:55,490 INFO L290 TraceCheckUtils]: 2: Hoare triple {138016#true} assume true; {138016#true} is VALID [2022-04-15 06:37:55,490 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {138016#true} {138016#true} #66#return; {138016#true} is VALID [2022-04-15 06:37:55,490 INFO L272 TraceCheckUtils]: 4: Hoare triple {138016#true} call #t~ret6 := main(); {138016#true} is VALID [2022-04-15 06:37:55,490 INFO L290 TraceCheckUtils]: 5: Hoare triple {138016#true} assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~last~0 := #t~nondet4;havoc #t~nondet4;~a~0 := 0;~b~0 := 0;~c~0 := 0;~st~0 := 0; {138016#true} is VALID [2022-04-15 06:37:55,491 INFO L290 TraceCheckUtils]: 6: Hoare triple {138016#true} [262] L30-->L23-3_primed: Formula: (and (= v_main_~a~0_278 v_main_~a~0_277) (= v_main_~c~0_2181 v_main_~c~0_2162) (= |v_main_#t~post5_896| |v_main_#t~post5_878|) (= v_main_~st~0_535 v_main_~st~0_533) (= v_main_~b~0_275 v_main_~b~0_274)) InVars {main_~c~0=v_main_~c~0_2181, main_#t~post5=|v_main_#t~post5_896|, main_~st~0=v_main_~st~0_535, main_~b~0=v_main_~b~0_275, main_~a~0=v_main_~a~0_278} OutVars{main_~c~0=v_main_~c~0_2162, main_#t~post5=|v_main_#t~post5_878|, main_~st~0=v_main_~st~0_533, main_~b~0=v_main_~b~0_274, main_~a~0=v_main_~a~0_277} AuxVars[] AssignedVars[main_~c~0, main_#t~post5, main_~st~0, main_~b~0, main_~a~0] {138016#true} is VALID [2022-04-15 06:37:55,491 INFO L290 TraceCheckUtils]: 7: Hoare triple {138016#true} [261] L23-3_primed-->L23-3: Formula: (and (= v_main_~c~0_7 0) (= v_main_~st~0_6 1)) InVars {} OutVars{main_~c~0=v_main_~c~0_7, main_~st~0=v_main_~st~0_6} AuxVars[] AssignedVars[main_~c~0, main_~st~0] {138021#(= main_~c~0 0)} is VALID [2022-04-15 06:37:55,491 INFO L290 TraceCheckUtils]: 8: Hoare triple {138021#(= main_~c~0 0)} assume !!(~c~0 < 200000); {138021#(= main_~c~0 0)} is VALID [2022-04-15 06:37:55,491 INFO L290 TraceCheckUtils]: 9: Hoare triple {138021#(= main_~c~0 0)} assume ~c~0 == ~last~0;~st~0 := 0; {138021#(= main_~c~0 0)} is VALID [2022-04-15 06:37:55,492 INFO L290 TraceCheckUtils]: 10: Hoare triple {138021#(= main_~c~0 0)} #t~post5 := ~c~0;~c~0 := 1 + #t~post5;havoc #t~post5; {138022#(<= main_~c~0 1)} is VALID [2022-04-15 06:37:55,492 INFO L290 TraceCheckUtils]: 11: Hoare triple {138022#(<= main_~c~0 1)} assume !!(~c~0 < 200000); {138022#(<= main_~c~0 1)} is VALID [2022-04-15 06:37:55,492 INFO L290 TraceCheckUtils]: 12: Hoare triple {138022#(<= main_~c~0 1)} assume !(~c~0 == ~last~0); {138022#(<= main_~c~0 1)} is VALID [2022-04-15 06:37:55,493 INFO L290 TraceCheckUtils]: 13: Hoare triple {138022#(<= main_~c~0 1)} #t~post5 := ~c~0;~c~0 := 1 + #t~post5;havoc #t~post5; {138023#(<= main_~c~0 2)} is VALID [2022-04-15 06:37:55,493 INFO L290 TraceCheckUtils]: 14: Hoare triple {138023#(<= main_~c~0 2)} assume !!(~c~0 < 200000); {138023#(<= main_~c~0 2)} is VALID [2022-04-15 06:37:55,493 INFO L290 TraceCheckUtils]: 15: Hoare triple {138023#(<= main_~c~0 2)} assume !(~c~0 == ~last~0); {138023#(<= main_~c~0 2)} is VALID [2022-04-15 06:37:55,493 INFO L290 TraceCheckUtils]: 16: Hoare triple {138023#(<= main_~c~0 2)} #t~post5 := ~c~0;~c~0 := 1 + #t~post5;havoc #t~post5; {138024#(<= main_~c~0 3)} is VALID [2022-04-15 06:37:55,494 INFO L290 TraceCheckUtils]: 17: Hoare triple {138024#(<= main_~c~0 3)} assume !!(~c~0 < 200000); {138024#(<= main_~c~0 3)} is VALID [2022-04-15 06:37:55,494 INFO L290 TraceCheckUtils]: 18: Hoare triple {138024#(<= main_~c~0 3)} assume !(~c~0 == ~last~0); {138024#(<= main_~c~0 3)} is VALID [2022-04-15 06:37:55,494 INFO L290 TraceCheckUtils]: 19: Hoare triple {138024#(<= main_~c~0 3)} #t~post5 := ~c~0;~c~0 := 1 + #t~post5;havoc #t~post5; {138025#(<= main_~c~0 4)} is VALID [2022-04-15 06:37:55,495 INFO L290 TraceCheckUtils]: 20: Hoare triple {138025#(<= main_~c~0 4)} assume !!(~c~0 < 200000); {138025#(<= main_~c~0 4)} is VALID [2022-04-15 06:37:55,495 INFO L290 TraceCheckUtils]: 21: Hoare triple {138025#(<= main_~c~0 4)} assume !(~c~0 == ~last~0); {138025#(<= main_~c~0 4)} is VALID [2022-04-15 06:37:55,495 INFO L290 TraceCheckUtils]: 22: Hoare triple {138025#(<= main_~c~0 4)} #t~post5 := ~c~0;~c~0 := 1 + #t~post5;havoc #t~post5; {138026#(<= main_~c~0 5)} is VALID [2022-04-15 06:37:55,496 INFO L290 TraceCheckUtils]: 23: Hoare triple {138026#(<= main_~c~0 5)} assume !!(~c~0 < 200000); {138026#(<= main_~c~0 5)} is VALID [2022-04-15 06:37:55,496 INFO L290 TraceCheckUtils]: 24: Hoare triple {138026#(<= main_~c~0 5)} assume !(~c~0 == ~last~0); {138026#(<= main_~c~0 5)} is VALID [2022-04-15 06:37:55,496 INFO L290 TraceCheckUtils]: 25: Hoare triple {138026#(<= main_~c~0 5)} #t~post5 := ~c~0;~c~0 := 1 + #t~post5;havoc #t~post5; {138027#(<= main_~c~0 6)} is VALID [2022-04-15 06:37:55,496 INFO L290 TraceCheckUtils]: 26: Hoare triple {138027#(<= main_~c~0 6)} assume !!(~c~0 < 200000); {138027#(<= main_~c~0 6)} is VALID [2022-04-15 06:37:55,497 INFO L290 TraceCheckUtils]: 27: Hoare triple {138027#(<= main_~c~0 6)} assume !(~c~0 == ~last~0); {138027#(<= main_~c~0 6)} is VALID [2022-04-15 06:37:55,497 INFO L290 TraceCheckUtils]: 28: Hoare triple {138027#(<= main_~c~0 6)} #t~post5 := ~c~0;~c~0 := 1 + #t~post5;havoc #t~post5; {138028#(<= main_~c~0 7)} is VALID [2022-04-15 06:37:55,497 INFO L290 TraceCheckUtils]: 29: Hoare triple {138028#(<= main_~c~0 7)} assume !!(~c~0 < 200000); {138028#(<= main_~c~0 7)} is VALID [2022-04-15 06:37:55,498 INFO L290 TraceCheckUtils]: 30: Hoare triple {138028#(<= main_~c~0 7)} assume !(~c~0 == ~last~0); {138028#(<= main_~c~0 7)} is VALID [2022-04-15 06:37:55,498 INFO L290 TraceCheckUtils]: 31: Hoare triple {138028#(<= main_~c~0 7)} #t~post5 := ~c~0;~c~0 := 1 + #t~post5;havoc #t~post5; {138029#(<= main_~c~0 8)} is VALID [2022-04-15 06:37:55,498 INFO L290 TraceCheckUtils]: 32: Hoare triple {138029#(<= main_~c~0 8)} assume !!(~c~0 < 200000); {138029#(<= main_~c~0 8)} is VALID [2022-04-15 06:37:55,499 INFO L290 TraceCheckUtils]: 33: Hoare triple {138029#(<= main_~c~0 8)} assume !(~c~0 == ~last~0); {138029#(<= main_~c~0 8)} is VALID [2022-04-15 06:37:55,499 INFO L290 TraceCheckUtils]: 34: Hoare triple {138029#(<= main_~c~0 8)} #t~post5 := ~c~0;~c~0 := 1 + #t~post5;havoc #t~post5; {138030#(<= main_~c~0 9)} is VALID [2022-04-15 06:37:55,499 INFO L290 TraceCheckUtils]: 35: Hoare triple {138030#(<= main_~c~0 9)} assume !!(~c~0 < 200000); {138030#(<= main_~c~0 9)} is VALID [2022-04-15 06:37:55,499 INFO L290 TraceCheckUtils]: 36: Hoare triple {138030#(<= main_~c~0 9)} assume !(~c~0 == ~last~0); {138030#(<= main_~c~0 9)} is VALID [2022-04-15 06:37:55,500 INFO L290 TraceCheckUtils]: 37: Hoare triple {138030#(<= main_~c~0 9)} #t~post5 := ~c~0;~c~0 := 1 + #t~post5;havoc #t~post5; {138031#(<= main_~c~0 10)} is VALID [2022-04-15 06:37:55,500 INFO L290 TraceCheckUtils]: 38: Hoare triple {138031#(<= main_~c~0 10)} assume !!(~c~0 < 200000); {138031#(<= main_~c~0 10)} is VALID [2022-04-15 06:37:55,500 INFO L290 TraceCheckUtils]: 39: Hoare triple {138031#(<= main_~c~0 10)} assume !(~c~0 == ~last~0); {138031#(<= main_~c~0 10)} is VALID [2022-04-15 06:37:55,501 INFO L290 TraceCheckUtils]: 40: Hoare triple {138031#(<= main_~c~0 10)} #t~post5 := ~c~0;~c~0 := 1 + #t~post5;havoc #t~post5; {138032#(<= main_~c~0 11)} is VALID [2022-04-15 06:37:55,501 INFO L290 TraceCheckUtils]: 41: Hoare triple {138032#(<= main_~c~0 11)} assume !!(~c~0 < 200000); {138032#(<= main_~c~0 11)} is VALID [2022-04-15 06:37:55,501 INFO L290 TraceCheckUtils]: 42: Hoare triple {138032#(<= main_~c~0 11)} assume !(~c~0 == ~last~0); {138032#(<= main_~c~0 11)} is VALID [2022-04-15 06:37:55,502 INFO L290 TraceCheckUtils]: 43: Hoare triple {138032#(<= main_~c~0 11)} #t~post5 := ~c~0;~c~0 := 1 + #t~post5;havoc #t~post5; {138033#(<= main_~c~0 12)} is VALID [2022-04-15 06:37:55,502 INFO L290 TraceCheckUtils]: 44: Hoare triple {138033#(<= main_~c~0 12)} assume !!(~c~0 < 200000); {138033#(<= main_~c~0 12)} is VALID [2022-04-15 06:37:55,502 INFO L290 TraceCheckUtils]: 45: Hoare triple {138033#(<= main_~c~0 12)} assume !(~c~0 == ~last~0); {138033#(<= main_~c~0 12)} is VALID [2022-04-15 06:37:55,503 INFO L290 TraceCheckUtils]: 46: Hoare triple {138033#(<= main_~c~0 12)} #t~post5 := ~c~0;~c~0 := 1 + #t~post5;havoc #t~post5; {138034#(<= main_~c~0 13)} is VALID [2022-04-15 06:37:55,503 INFO L290 TraceCheckUtils]: 47: Hoare triple {138034#(<= main_~c~0 13)} assume !!(~c~0 < 200000); {138034#(<= main_~c~0 13)} is VALID [2022-04-15 06:37:55,503 INFO L290 TraceCheckUtils]: 48: Hoare triple {138034#(<= main_~c~0 13)} assume !(~c~0 == ~last~0); {138034#(<= main_~c~0 13)} is VALID [2022-04-15 06:37:55,503 INFO L290 TraceCheckUtils]: 49: Hoare triple {138034#(<= main_~c~0 13)} #t~post5 := ~c~0;~c~0 := 1 + #t~post5;havoc #t~post5; {138035#(<= main_~c~0 14)} is VALID [2022-04-15 06:37:55,504 INFO L290 TraceCheckUtils]: 50: Hoare triple {138035#(<= main_~c~0 14)} assume !!(~c~0 < 200000); {138035#(<= main_~c~0 14)} is VALID [2022-04-15 06:37:55,504 INFO L290 TraceCheckUtils]: 51: Hoare triple {138035#(<= main_~c~0 14)} assume !(~c~0 == ~last~0); {138035#(<= main_~c~0 14)} is VALID [2022-04-15 06:37:55,504 INFO L290 TraceCheckUtils]: 52: Hoare triple {138035#(<= main_~c~0 14)} #t~post5 := ~c~0;~c~0 := 1 + #t~post5;havoc #t~post5; {138036#(<= main_~c~0 15)} is VALID [2022-04-15 06:37:55,505 INFO L290 TraceCheckUtils]: 53: Hoare triple {138036#(<= main_~c~0 15)} assume !!(~c~0 < 200000); {138036#(<= main_~c~0 15)} is VALID [2022-04-15 06:37:55,505 INFO L290 TraceCheckUtils]: 54: Hoare triple {138036#(<= main_~c~0 15)} assume !(~c~0 == ~last~0); {138036#(<= main_~c~0 15)} is VALID [2022-04-15 06:37:55,505 INFO L290 TraceCheckUtils]: 55: Hoare triple {138036#(<= main_~c~0 15)} #t~post5 := ~c~0;~c~0 := 1 + #t~post5;havoc #t~post5; {138037#(<= main_~c~0 16)} is VALID [2022-04-15 06:37:55,506 INFO L290 TraceCheckUtils]: 56: Hoare triple {138037#(<= main_~c~0 16)} assume !!(~c~0 < 200000); {138037#(<= main_~c~0 16)} is VALID [2022-04-15 06:37:55,506 INFO L290 TraceCheckUtils]: 57: Hoare triple {138037#(<= main_~c~0 16)} assume !(~c~0 == ~last~0); {138037#(<= main_~c~0 16)} is VALID [2022-04-15 06:37:55,506 INFO L290 TraceCheckUtils]: 58: Hoare triple {138037#(<= main_~c~0 16)} #t~post5 := ~c~0;~c~0 := 1 + #t~post5;havoc #t~post5; {138038#(<= main_~c~0 17)} is VALID [2022-04-15 06:37:55,507 INFO L290 TraceCheckUtils]: 59: Hoare triple {138038#(<= main_~c~0 17)} assume !!(~c~0 < 200000); {138038#(<= main_~c~0 17)} is VALID [2022-04-15 06:37:55,507 INFO L290 TraceCheckUtils]: 60: Hoare triple {138038#(<= main_~c~0 17)} assume !(~c~0 == ~last~0); {138038#(<= main_~c~0 17)} is VALID [2022-04-15 06:37:55,507 INFO L290 TraceCheckUtils]: 61: Hoare triple {138038#(<= main_~c~0 17)} #t~post5 := ~c~0;~c~0 := 1 + #t~post5;havoc #t~post5; {138039#(<= main_~c~0 18)} is VALID [2022-04-15 06:37:55,508 INFO L290 TraceCheckUtils]: 62: Hoare triple {138039#(<= main_~c~0 18)} assume !(~c~0 < 200000); {138017#false} is VALID [2022-04-15 06:37:55,508 INFO L290 TraceCheckUtils]: 63: Hoare triple {138017#false} assume 0 == ~st~0 && ~c~0 == 1 + ~last~0;~a~0 := 3 + ~a~0;~b~0 := 3 + ~b~0; {138017#false} is VALID [2022-04-15 06:37:55,508 INFO L290 TraceCheckUtils]: 64: Hoare triple {138017#false} assume !(~c~0 == ~last~0 && 0 == ~st~0); {138017#false} is VALID [2022-04-15 06:37:55,508 INFO L272 TraceCheckUtils]: 65: Hoare triple {138017#false} call __VERIFIER_assert((if ~a~0 == ~b~0 && 200000 == ~c~0 then 1 else 0)); {138017#false} is VALID [2022-04-15 06:37:55,508 INFO L290 TraceCheckUtils]: 66: Hoare triple {138017#false} ~cond := #in~cond; {138017#false} is VALID [2022-04-15 06:37:55,508 INFO L290 TraceCheckUtils]: 67: Hoare triple {138017#false} assume 0 == ~cond; {138017#false} is VALID [2022-04-15 06:37:55,508 INFO L290 TraceCheckUtils]: 68: Hoare triple {138017#false} assume !false; {138017#false} is VALID [2022-04-15 06:37:55,508 INFO L134 CoverageAnalysis]: Checked inductivity of 477 backedges. 0 proven. 477 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 06:37:55,508 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 06:37:55,508 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1726278660] [2022-04-15 06:37:55,508 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1726278660] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 06:37:55,508 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [878136555] [2022-04-15 06:37:55,508 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 06:37:55,508 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 06:37:55,509 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 06:37:55,509 INFO L229 MonitoredProcess]: Starting monitored process 56 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-15 06:37:55,510 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (56)] Waiting until timeout for monitored process [2022-04-15 06:37:55,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:37:55,553 INFO L263 TraceCheckSpWp]: Trace formula consists of 167 conjuncts, 20 conjunts are in the unsatisfiable core [2022-04-15 06:37:55,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:37:55,568 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 06:37:55,883 INFO L272 TraceCheckUtils]: 0: Hoare triple {138016#true} call ULTIMATE.init(); {138016#true} is VALID [2022-04-15 06:37:55,883 INFO L290 TraceCheckUtils]: 1: Hoare triple {138016#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(11, 2);call #Ultimate.allocInit(12, 3);~last~0 := 0; {138016#true} is VALID [2022-04-15 06:37:55,883 INFO L290 TraceCheckUtils]: 2: Hoare triple {138016#true} assume true; {138016#true} is VALID [2022-04-15 06:37:55,883 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {138016#true} {138016#true} #66#return; {138016#true} is VALID [2022-04-15 06:37:55,883 INFO L272 TraceCheckUtils]: 4: Hoare triple {138016#true} call #t~ret6 := main(); {138016#true} is VALID [2022-04-15 06:37:55,883 INFO L290 TraceCheckUtils]: 5: Hoare triple {138016#true} assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~last~0 := #t~nondet4;havoc #t~nondet4;~a~0 := 0;~b~0 := 0;~c~0 := 0;~st~0 := 0; {138016#true} is VALID [2022-04-15 06:37:55,883 INFO L290 TraceCheckUtils]: 6: Hoare triple {138016#true} [262] L30-->L23-3_primed: Formula: (and (= v_main_~a~0_278 v_main_~a~0_277) (= v_main_~c~0_2181 v_main_~c~0_2162) (= |v_main_#t~post5_896| |v_main_#t~post5_878|) (= v_main_~st~0_535 v_main_~st~0_533) (= v_main_~b~0_275 v_main_~b~0_274)) InVars {main_~c~0=v_main_~c~0_2181, main_#t~post5=|v_main_#t~post5_896|, main_~st~0=v_main_~st~0_535, main_~b~0=v_main_~b~0_275, main_~a~0=v_main_~a~0_278} OutVars{main_~c~0=v_main_~c~0_2162, main_#t~post5=|v_main_#t~post5_878|, main_~st~0=v_main_~st~0_533, main_~b~0=v_main_~b~0_274, main_~a~0=v_main_~a~0_277} AuxVars[] AssignedVars[main_~c~0, main_#t~post5, main_~st~0, main_~b~0, main_~a~0] {138016#true} is VALID [2022-04-15 06:37:55,884 INFO L290 TraceCheckUtils]: 7: Hoare triple {138016#true} [261] L23-3_primed-->L23-3: Formula: (and (= v_main_~c~0_7 0) (= v_main_~st~0_6 1)) InVars {} OutVars{main_~c~0=v_main_~c~0_7, main_~st~0=v_main_~st~0_6} AuxVars[] AssignedVars[main_~c~0, main_~st~0] {138065#(<= main_~c~0 0)} is VALID [2022-04-15 06:37:55,884 INFO L290 TraceCheckUtils]: 8: Hoare triple {138065#(<= main_~c~0 0)} assume !!(~c~0 < 200000); {138065#(<= main_~c~0 0)} is VALID [2022-04-15 06:37:55,884 INFO L290 TraceCheckUtils]: 9: Hoare triple {138065#(<= main_~c~0 0)} assume ~c~0 == ~last~0;~st~0 := 0; {138065#(<= main_~c~0 0)} is VALID [2022-04-15 06:37:55,885 INFO L290 TraceCheckUtils]: 10: Hoare triple {138065#(<= main_~c~0 0)} #t~post5 := ~c~0;~c~0 := 1 + #t~post5;havoc #t~post5; {138022#(<= main_~c~0 1)} is VALID [2022-04-15 06:37:55,885 INFO L290 TraceCheckUtils]: 11: Hoare triple {138022#(<= main_~c~0 1)} assume !!(~c~0 < 200000); {138022#(<= main_~c~0 1)} is VALID [2022-04-15 06:37:55,885 INFO L290 TraceCheckUtils]: 12: Hoare triple {138022#(<= main_~c~0 1)} assume !(~c~0 == ~last~0); {138022#(<= main_~c~0 1)} is VALID [2022-04-15 06:37:55,886 INFO L290 TraceCheckUtils]: 13: Hoare triple {138022#(<= main_~c~0 1)} #t~post5 := ~c~0;~c~0 := 1 + #t~post5;havoc #t~post5; {138023#(<= main_~c~0 2)} is VALID [2022-04-15 06:37:55,886 INFO L290 TraceCheckUtils]: 14: Hoare triple {138023#(<= main_~c~0 2)} assume !!(~c~0 < 200000); {138023#(<= main_~c~0 2)} is VALID [2022-04-15 06:37:55,886 INFO L290 TraceCheckUtils]: 15: Hoare triple {138023#(<= main_~c~0 2)} assume !(~c~0 == ~last~0); {138023#(<= main_~c~0 2)} is VALID [2022-04-15 06:37:55,886 INFO L290 TraceCheckUtils]: 16: Hoare triple {138023#(<= main_~c~0 2)} #t~post5 := ~c~0;~c~0 := 1 + #t~post5;havoc #t~post5; {138024#(<= main_~c~0 3)} is VALID [2022-04-15 06:37:55,887 INFO L290 TraceCheckUtils]: 17: Hoare triple {138024#(<= main_~c~0 3)} assume !!(~c~0 < 200000); {138024#(<= main_~c~0 3)} is VALID [2022-04-15 06:37:55,887 INFO L290 TraceCheckUtils]: 18: Hoare triple {138024#(<= main_~c~0 3)} assume !(~c~0 == ~last~0); {138024#(<= main_~c~0 3)} is VALID [2022-04-15 06:37:55,887 INFO L290 TraceCheckUtils]: 19: Hoare triple {138024#(<= main_~c~0 3)} #t~post5 := ~c~0;~c~0 := 1 + #t~post5;havoc #t~post5; {138025#(<= main_~c~0 4)} is VALID [2022-04-15 06:37:55,888 INFO L290 TraceCheckUtils]: 20: Hoare triple {138025#(<= main_~c~0 4)} assume !!(~c~0 < 200000); {138025#(<= main_~c~0 4)} is VALID [2022-04-15 06:37:55,888 INFO L290 TraceCheckUtils]: 21: Hoare triple {138025#(<= main_~c~0 4)} assume !(~c~0 == ~last~0); {138025#(<= main_~c~0 4)} is VALID [2022-04-15 06:37:55,888 INFO L290 TraceCheckUtils]: 22: Hoare triple {138025#(<= main_~c~0 4)} #t~post5 := ~c~0;~c~0 := 1 + #t~post5;havoc #t~post5; {138026#(<= main_~c~0 5)} is VALID [2022-04-15 06:37:55,888 INFO L290 TraceCheckUtils]: 23: Hoare triple {138026#(<= main_~c~0 5)} assume !!(~c~0 < 200000); {138026#(<= main_~c~0 5)} is VALID [2022-04-15 06:37:55,889 INFO L290 TraceCheckUtils]: 24: Hoare triple {138026#(<= main_~c~0 5)} assume !(~c~0 == ~last~0); {138026#(<= main_~c~0 5)} is VALID [2022-04-15 06:37:55,889 INFO L290 TraceCheckUtils]: 25: Hoare triple {138026#(<= main_~c~0 5)} #t~post5 := ~c~0;~c~0 := 1 + #t~post5;havoc #t~post5; {138027#(<= main_~c~0 6)} is VALID [2022-04-15 06:37:55,889 INFO L290 TraceCheckUtils]: 26: Hoare triple {138027#(<= main_~c~0 6)} assume !!(~c~0 < 200000); {138027#(<= main_~c~0 6)} is VALID [2022-04-15 06:37:55,890 INFO L290 TraceCheckUtils]: 27: Hoare triple {138027#(<= main_~c~0 6)} assume !(~c~0 == ~last~0); {138027#(<= main_~c~0 6)} is VALID [2022-04-15 06:37:55,890 INFO L290 TraceCheckUtils]: 28: Hoare triple {138027#(<= main_~c~0 6)} #t~post5 := ~c~0;~c~0 := 1 + #t~post5;havoc #t~post5; {138028#(<= main_~c~0 7)} is VALID [2022-04-15 06:37:55,890 INFO L290 TraceCheckUtils]: 29: Hoare triple {138028#(<= main_~c~0 7)} assume !!(~c~0 < 200000); {138028#(<= main_~c~0 7)} is VALID [2022-04-15 06:37:55,891 INFO L290 TraceCheckUtils]: 30: Hoare triple {138028#(<= main_~c~0 7)} assume !(~c~0 == ~last~0); {138028#(<= main_~c~0 7)} is VALID [2022-04-15 06:37:55,891 INFO L290 TraceCheckUtils]: 31: Hoare triple {138028#(<= main_~c~0 7)} #t~post5 := ~c~0;~c~0 := 1 + #t~post5;havoc #t~post5; {138029#(<= main_~c~0 8)} is VALID [2022-04-15 06:37:55,891 INFO L290 TraceCheckUtils]: 32: Hoare triple {138029#(<= main_~c~0 8)} assume !!(~c~0 < 200000); {138029#(<= main_~c~0 8)} is VALID [2022-04-15 06:37:55,891 INFO L290 TraceCheckUtils]: 33: Hoare triple {138029#(<= main_~c~0 8)} assume !(~c~0 == ~last~0); {138029#(<= main_~c~0 8)} is VALID [2022-04-15 06:37:55,892 INFO L290 TraceCheckUtils]: 34: Hoare triple {138029#(<= main_~c~0 8)} #t~post5 := ~c~0;~c~0 := 1 + #t~post5;havoc #t~post5; {138030#(<= main_~c~0 9)} is VALID [2022-04-15 06:37:55,892 INFO L290 TraceCheckUtils]: 35: Hoare triple {138030#(<= main_~c~0 9)} assume !!(~c~0 < 200000); {138030#(<= main_~c~0 9)} is VALID [2022-04-15 06:37:55,892 INFO L290 TraceCheckUtils]: 36: Hoare triple {138030#(<= main_~c~0 9)} assume !(~c~0 == ~last~0); {138030#(<= main_~c~0 9)} is VALID [2022-04-15 06:37:55,893 INFO L290 TraceCheckUtils]: 37: Hoare triple {138030#(<= main_~c~0 9)} #t~post5 := ~c~0;~c~0 := 1 + #t~post5;havoc #t~post5; {138031#(<= main_~c~0 10)} is VALID [2022-04-15 06:37:55,893 INFO L290 TraceCheckUtils]: 38: Hoare triple {138031#(<= main_~c~0 10)} assume !!(~c~0 < 200000); {138031#(<= main_~c~0 10)} is VALID [2022-04-15 06:37:55,893 INFO L290 TraceCheckUtils]: 39: Hoare triple {138031#(<= main_~c~0 10)} assume !(~c~0 == ~last~0); {138031#(<= main_~c~0 10)} is VALID [2022-04-15 06:37:55,894 INFO L290 TraceCheckUtils]: 40: Hoare triple {138031#(<= main_~c~0 10)} #t~post5 := ~c~0;~c~0 := 1 + #t~post5;havoc #t~post5; {138032#(<= main_~c~0 11)} is VALID [2022-04-15 06:37:55,894 INFO L290 TraceCheckUtils]: 41: Hoare triple {138032#(<= main_~c~0 11)} assume !!(~c~0 < 200000); {138032#(<= main_~c~0 11)} is VALID [2022-04-15 06:37:55,894 INFO L290 TraceCheckUtils]: 42: Hoare triple {138032#(<= main_~c~0 11)} assume !(~c~0 == ~last~0); {138032#(<= main_~c~0 11)} is VALID [2022-04-15 06:37:55,895 INFO L290 TraceCheckUtils]: 43: Hoare triple {138032#(<= main_~c~0 11)} #t~post5 := ~c~0;~c~0 := 1 + #t~post5;havoc #t~post5; {138033#(<= main_~c~0 12)} is VALID [2022-04-15 06:37:55,895 INFO L290 TraceCheckUtils]: 44: Hoare triple {138033#(<= main_~c~0 12)} assume !!(~c~0 < 200000); {138033#(<= main_~c~0 12)} is VALID [2022-04-15 06:37:55,895 INFO L290 TraceCheckUtils]: 45: Hoare triple {138033#(<= main_~c~0 12)} assume !(~c~0 == ~last~0); {138033#(<= main_~c~0 12)} is VALID [2022-04-15 06:37:55,895 INFO L290 TraceCheckUtils]: 46: Hoare triple {138033#(<= main_~c~0 12)} #t~post5 := ~c~0;~c~0 := 1 + #t~post5;havoc #t~post5; {138034#(<= main_~c~0 13)} is VALID [2022-04-15 06:37:55,896 INFO L290 TraceCheckUtils]: 47: Hoare triple {138034#(<= main_~c~0 13)} assume !!(~c~0 < 200000); {138034#(<= main_~c~0 13)} is VALID [2022-04-15 06:37:55,896 INFO L290 TraceCheckUtils]: 48: Hoare triple {138034#(<= main_~c~0 13)} assume !(~c~0 == ~last~0); {138034#(<= main_~c~0 13)} is VALID [2022-04-15 06:37:55,896 INFO L290 TraceCheckUtils]: 49: Hoare triple {138034#(<= main_~c~0 13)} #t~post5 := ~c~0;~c~0 := 1 + #t~post5;havoc #t~post5; {138035#(<= main_~c~0 14)} is VALID [2022-04-15 06:37:55,897 INFO L290 TraceCheckUtils]: 50: Hoare triple {138035#(<= main_~c~0 14)} assume !!(~c~0 < 200000); {138035#(<= main_~c~0 14)} is VALID [2022-04-15 06:37:55,897 INFO L290 TraceCheckUtils]: 51: Hoare triple {138035#(<= main_~c~0 14)} assume !(~c~0 == ~last~0); {138035#(<= main_~c~0 14)} is VALID [2022-04-15 06:37:55,897 INFO L290 TraceCheckUtils]: 52: Hoare triple {138035#(<= main_~c~0 14)} #t~post5 := ~c~0;~c~0 := 1 + #t~post5;havoc #t~post5; {138036#(<= main_~c~0 15)} is VALID [2022-04-15 06:37:55,898 INFO L290 TraceCheckUtils]: 53: Hoare triple {138036#(<= main_~c~0 15)} assume !!(~c~0 < 200000); {138036#(<= main_~c~0 15)} is VALID [2022-04-15 06:37:55,898 INFO L290 TraceCheckUtils]: 54: Hoare triple {138036#(<= main_~c~0 15)} assume !(~c~0 == ~last~0); {138036#(<= main_~c~0 15)} is VALID [2022-04-15 06:37:55,898 INFO L290 TraceCheckUtils]: 55: Hoare triple {138036#(<= main_~c~0 15)} #t~post5 := ~c~0;~c~0 := 1 + #t~post5;havoc #t~post5; {138037#(<= main_~c~0 16)} is VALID [2022-04-15 06:37:55,898 INFO L290 TraceCheckUtils]: 56: Hoare triple {138037#(<= main_~c~0 16)} assume !!(~c~0 < 200000); {138037#(<= main_~c~0 16)} is VALID [2022-04-15 06:37:55,899 INFO L290 TraceCheckUtils]: 57: Hoare triple {138037#(<= main_~c~0 16)} assume !(~c~0 == ~last~0); {138037#(<= main_~c~0 16)} is VALID [2022-04-15 06:37:55,899 INFO L290 TraceCheckUtils]: 58: Hoare triple {138037#(<= main_~c~0 16)} #t~post5 := ~c~0;~c~0 := 1 + #t~post5;havoc #t~post5; {138038#(<= main_~c~0 17)} is VALID [2022-04-15 06:37:55,899 INFO L290 TraceCheckUtils]: 59: Hoare triple {138038#(<= main_~c~0 17)} assume !!(~c~0 < 200000); {138038#(<= main_~c~0 17)} is VALID [2022-04-15 06:37:55,900 INFO L290 TraceCheckUtils]: 60: Hoare triple {138038#(<= main_~c~0 17)} assume !(~c~0 == ~last~0); {138038#(<= main_~c~0 17)} is VALID [2022-04-15 06:37:55,900 INFO L290 TraceCheckUtils]: 61: Hoare triple {138038#(<= main_~c~0 17)} #t~post5 := ~c~0;~c~0 := 1 + #t~post5;havoc #t~post5; {138039#(<= main_~c~0 18)} is VALID [2022-04-15 06:37:55,900 INFO L290 TraceCheckUtils]: 62: Hoare triple {138039#(<= main_~c~0 18)} assume !(~c~0 < 200000); {138017#false} is VALID [2022-04-15 06:37:55,900 INFO L290 TraceCheckUtils]: 63: Hoare triple {138017#false} assume 0 == ~st~0 && ~c~0 == 1 + ~last~0;~a~0 := 3 + ~a~0;~b~0 := 3 + ~b~0; {138017#false} is VALID [2022-04-15 06:37:55,900 INFO L290 TraceCheckUtils]: 64: Hoare triple {138017#false} assume !(~c~0 == ~last~0 && 0 == ~st~0); {138017#false} is VALID [2022-04-15 06:37:55,901 INFO L272 TraceCheckUtils]: 65: Hoare triple {138017#false} call __VERIFIER_assert((if ~a~0 == ~b~0 && 200000 == ~c~0 then 1 else 0)); {138017#false} is VALID [2022-04-15 06:37:55,901 INFO L290 TraceCheckUtils]: 66: Hoare triple {138017#false} ~cond := #in~cond; {138017#false} is VALID [2022-04-15 06:37:55,901 INFO L290 TraceCheckUtils]: 67: Hoare triple {138017#false} assume 0 == ~cond; {138017#false} is VALID [2022-04-15 06:37:55,901 INFO L290 TraceCheckUtils]: 68: Hoare triple {138017#false} assume !false; {138017#false} is VALID [2022-04-15 06:37:55,901 INFO L134 CoverageAnalysis]: Checked inductivity of 477 backedges. 0 proven. 477 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 06:37:55,901 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 06:37:56,596 INFO L290 TraceCheckUtils]: 68: Hoare triple {138017#false} assume !false; {138017#false} is VALID [2022-04-15 06:37:56,597 INFO L290 TraceCheckUtils]: 67: Hoare triple {138017#false} assume 0 == ~cond; {138017#false} is VALID [2022-04-15 06:37:56,597 INFO L290 TraceCheckUtils]: 66: Hoare triple {138017#false} ~cond := #in~cond; {138017#false} is VALID [2022-04-15 06:37:56,597 INFO L272 TraceCheckUtils]: 65: Hoare triple {138017#false} call __VERIFIER_assert((if ~a~0 == ~b~0 && 200000 == ~c~0 then 1 else 0)); {138017#false} is VALID [2022-04-15 06:37:56,597 INFO L290 TraceCheckUtils]: 64: Hoare triple {138017#false} assume !(~c~0 == ~last~0 && 0 == ~st~0); {138017#false} is VALID [2022-04-15 06:37:56,597 INFO L290 TraceCheckUtils]: 63: Hoare triple {138017#false} assume 0 == ~st~0 && ~c~0 == 1 + ~last~0;~a~0 := 3 + ~a~0;~b~0 := 3 + ~b~0; {138017#false} is VALID [2022-04-15 06:37:56,597 INFO L290 TraceCheckUtils]: 62: Hoare triple {138267#(< main_~c~0 200000)} assume !(~c~0 < 200000); {138017#false} is VALID [2022-04-15 06:37:56,597 INFO L290 TraceCheckUtils]: 61: Hoare triple {138271#(< main_~c~0 199999)} #t~post5 := ~c~0;~c~0 := 1 + #t~post5;havoc #t~post5; {138267#(< main_~c~0 200000)} is VALID [2022-04-15 06:37:56,598 INFO L290 TraceCheckUtils]: 60: Hoare triple {138271#(< main_~c~0 199999)} assume !(~c~0 == ~last~0); {138271#(< main_~c~0 199999)} is VALID [2022-04-15 06:37:56,598 INFO L290 TraceCheckUtils]: 59: Hoare triple {138271#(< main_~c~0 199999)} assume !!(~c~0 < 200000); {138271#(< main_~c~0 199999)} is VALID [2022-04-15 06:37:56,598 INFO L290 TraceCheckUtils]: 58: Hoare triple {138281#(< main_~c~0 199998)} #t~post5 := ~c~0;~c~0 := 1 + #t~post5;havoc #t~post5; {138271#(< main_~c~0 199999)} is VALID [2022-04-15 06:37:56,598 INFO L290 TraceCheckUtils]: 57: Hoare triple {138281#(< main_~c~0 199998)} assume !(~c~0 == ~last~0); {138281#(< main_~c~0 199998)} is VALID [2022-04-15 06:37:56,599 INFO L290 TraceCheckUtils]: 56: Hoare triple {138281#(< main_~c~0 199998)} assume !!(~c~0 < 200000); {138281#(< main_~c~0 199998)} is VALID [2022-04-15 06:37:56,599 INFO L290 TraceCheckUtils]: 55: Hoare triple {138291#(< main_~c~0 199997)} #t~post5 := ~c~0;~c~0 := 1 + #t~post5;havoc #t~post5; {138281#(< main_~c~0 199998)} is VALID [2022-04-15 06:37:56,599 INFO L290 TraceCheckUtils]: 54: Hoare triple {138291#(< main_~c~0 199997)} assume !(~c~0 == ~last~0); {138291#(< main_~c~0 199997)} is VALID [2022-04-15 06:37:56,599 INFO L290 TraceCheckUtils]: 53: Hoare triple {138291#(< main_~c~0 199997)} assume !!(~c~0 < 200000); {138291#(< main_~c~0 199997)} is VALID [2022-04-15 06:37:56,600 INFO L290 TraceCheckUtils]: 52: Hoare triple {138301#(< main_~c~0 199996)} #t~post5 := ~c~0;~c~0 := 1 + #t~post5;havoc #t~post5; {138291#(< main_~c~0 199997)} is VALID [2022-04-15 06:37:56,600 INFO L290 TraceCheckUtils]: 51: Hoare triple {138301#(< main_~c~0 199996)} assume !(~c~0 == ~last~0); {138301#(< main_~c~0 199996)} is VALID [2022-04-15 06:37:56,600 INFO L290 TraceCheckUtils]: 50: Hoare triple {138301#(< main_~c~0 199996)} assume !!(~c~0 < 200000); {138301#(< main_~c~0 199996)} is VALID [2022-04-15 06:37:56,600 INFO L290 TraceCheckUtils]: 49: Hoare triple {138311#(< main_~c~0 199995)} #t~post5 := ~c~0;~c~0 := 1 + #t~post5;havoc #t~post5; {138301#(< main_~c~0 199996)} is VALID [2022-04-15 06:37:56,601 INFO L290 TraceCheckUtils]: 48: Hoare triple {138311#(< main_~c~0 199995)} assume !(~c~0 == ~last~0); {138311#(< main_~c~0 199995)} is VALID [2022-04-15 06:37:56,601 INFO L290 TraceCheckUtils]: 47: Hoare triple {138311#(< main_~c~0 199995)} assume !!(~c~0 < 200000); {138311#(< main_~c~0 199995)} is VALID [2022-04-15 06:37:56,601 INFO L290 TraceCheckUtils]: 46: Hoare triple {138321#(< main_~c~0 199994)} #t~post5 := ~c~0;~c~0 := 1 + #t~post5;havoc #t~post5; {138311#(< main_~c~0 199995)} is VALID [2022-04-15 06:37:56,601 INFO L290 TraceCheckUtils]: 45: Hoare triple {138321#(< main_~c~0 199994)} assume !(~c~0 == ~last~0); {138321#(< main_~c~0 199994)} is VALID [2022-04-15 06:37:56,602 INFO L290 TraceCheckUtils]: 44: Hoare triple {138321#(< main_~c~0 199994)} assume !!(~c~0 < 200000); {138321#(< main_~c~0 199994)} is VALID [2022-04-15 06:37:56,602 INFO L290 TraceCheckUtils]: 43: Hoare triple {138331#(< main_~c~0 199993)} #t~post5 := ~c~0;~c~0 := 1 + #t~post5;havoc #t~post5; {138321#(< main_~c~0 199994)} is VALID [2022-04-15 06:37:56,602 INFO L290 TraceCheckUtils]: 42: Hoare triple {138331#(< main_~c~0 199993)} assume !(~c~0 == ~last~0); {138331#(< main_~c~0 199993)} is VALID [2022-04-15 06:37:56,602 INFO L290 TraceCheckUtils]: 41: Hoare triple {138331#(< main_~c~0 199993)} assume !!(~c~0 < 200000); {138331#(< main_~c~0 199993)} is VALID [2022-04-15 06:37:56,603 INFO L290 TraceCheckUtils]: 40: Hoare triple {138341#(< main_~c~0 199992)} #t~post5 := ~c~0;~c~0 := 1 + #t~post5;havoc #t~post5; {138331#(< main_~c~0 199993)} is VALID [2022-04-15 06:37:56,603 INFO L290 TraceCheckUtils]: 39: Hoare triple {138341#(< main_~c~0 199992)} assume !(~c~0 == ~last~0); {138341#(< main_~c~0 199992)} is VALID [2022-04-15 06:37:56,603 INFO L290 TraceCheckUtils]: 38: Hoare triple {138341#(< main_~c~0 199992)} assume !!(~c~0 < 200000); {138341#(< main_~c~0 199992)} is VALID [2022-04-15 06:37:56,603 INFO L290 TraceCheckUtils]: 37: Hoare triple {138351#(< main_~c~0 199991)} #t~post5 := ~c~0;~c~0 := 1 + #t~post5;havoc #t~post5; {138341#(< main_~c~0 199992)} is VALID [2022-04-15 06:37:56,604 INFO L290 TraceCheckUtils]: 36: Hoare triple {138351#(< main_~c~0 199991)} assume !(~c~0 == ~last~0); {138351#(< main_~c~0 199991)} is VALID [2022-04-15 06:37:56,604 INFO L290 TraceCheckUtils]: 35: Hoare triple {138351#(< main_~c~0 199991)} assume !!(~c~0 < 200000); {138351#(< main_~c~0 199991)} is VALID [2022-04-15 06:37:56,604 INFO L290 TraceCheckUtils]: 34: Hoare triple {138361#(< main_~c~0 199990)} #t~post5 := ~c~0;~c~0 := 1 + #t~post5;havoc #t~post5; {138351#(< main_~c~0 199991)} is VALID [2022-04-15 06:37:56,604 INFO L290 TraceCheckUtils]: 33: Hoare triple {138361#(< main_~c~0 199990)} assume !(~c~0 == ~last~0); {138361#(< main_~c~0 199990)} is VALID [2022-04-15 06:37:56,604 INFO L290 TraceCheckUtils]: 32: Hoare triple {138361#(< main_~c~0 199990)} assume !!(~c~0 < 200000); {138361#(< main_~c~0 199990)} is VALID [2022-04-15 06:37:56,605 INFO L290 TraceCheckUtils]: 31: Hoare triple {138371#(< main_~c~0 199989)} #t~post5 := ~c~0;~c~0 := 1 + #t~post5;havoc #t~post5; {138361#(< main_~c~0 199990)} is VALID [2022-04-15 06:37:56,605 INFO L290 TraceCheckUtils]: 30: Hoare triple {138371#(< main_~c~0 199989)} assume !(~c~0 == ~last~0); {138371#(< main_~c~0 199989)} is VALID [2022-04-15 06:37:56,605 INFO L290 TraceCheckUtils]: 29: Hoare triple {138371#(< main_~c~0 199989)} assume !!(~c~0 < 200000); {138371#(< main_~c~0 199989)} is VALID [2022-04-15 06:37:56,605 INFO L290 TraceCheckUtils]: 28: Hoare triple {138381#(< main_~c~0 199988)} #t~post5 := ~c~0;~c~0 := 1 + #t~post5;havoc #t~post5; {138371#(< main_~c~0 199989)} is VALID [2022-04-15 06:37:56,606 INFO L290 TraceCheckUtils]: 27: Hoare triple {138381#(< main_~c~0 199988)} assume !(~c~0 == ~last~0); {138381#(< main_~c~0 199988)} is VALID [2022-04-15 06:37:56,606 INFO L290 TraceCheckUtils]: 26: Hoare triple {138381#(< main_~c~0 199988)} assume !!(~c~0 < 200000); {138381#(< main_~c~0 199988)} is VALID [2022-04-15 06:37:56,606 INFO L290 TraceCheckUtils]: 25: Hoare triple {138391#(< main_~c~0 199987)} #t~post5 := ~c~0;~c~0 := 1 + #t~post5;havoc #t~post5; {138381#(< main_~c~0 199988)} is VALID [2022-04-15 06:37:56,606 INFO L290 TraceCheckUtils]: 24: Hoare triple {138391#(< main_~c~0 199987)} assume !(~c~0 == ~last~0); {138391#(< main_~c~0 199987)} is VALID [2022-04-15 06:37:56,607 INFO L290 TraceCheckUtils]: 23: Hoare triple {138391#(< main_~c~0 199987)} assume !!(~c~0 < 200000); {138391#(< main_~c~0 199987)} is VALID [2022-04-15 06:37:56,607 INFO L290 TraceCheckUtils]: 22: Hoare triple {138401#(< main_~c~0 199986)} #t~post5 := ~c~0;~c~0 := 1 + #t~post5;havoc #t~post5; {138391#(< main_~c~0 199987)} is VALID [2022-04-15 06:37:56,607 INFO L290 TraceCheckUtils]: 21: Hoare triple {138401#(< main_~c~0 199986)} assume !(~c~0 == ~last~0); {138401#(< main_~c~0 199986)} is VALID [2022-04-15 06:37:56,607 INFO L290 TraceCheckUtils]: 20: Hoare triple {138401#(< main_~c~0 199986)} assume !!(~c~0 < 200000); {138401#(< main_~c~0 199986)} is VALID [2022-04-15 06:37:56,608 INFO L290 TraceCheckUtils]: 19: Hoare triple {138411#(< main_~c~0 199985)} #t~post5 := ~c~0;~c~0 := 1 + #t~post5;havoc #t~post5; {138401#(< main_~c~0 199986)} is VALID [2022-04-15 06:37:56,608 INFO L290 TraceCheckUtils]: 18: Hoare triple {138411#(< main_~c~0 199985)} assume !(~c~0 == ~last~0); {138411#(< main_~c~0 199985)} is VALID [2022-04-15 06:37:56,608 INFO L290 TraceCheckUtils]: 17: Hoare triple {138411#(< main_~c~0 199985)} assume !!(~c~0 < 200000); {138411#(< main_~c~0 199985)} is VALID [2022-04-15 06:37:56,608 INFO L290 TraceCheckUtils]: 16: Hoare triple {138421#(< main_~c~0 199984)} #t~post5 := ~c~0;~c~0 := 1 + #t~post5;havoc #t~post5; {138411#(< main_~c~0 199985)} is VALID [2022-04-15 06:37:56,609 INFO L290 TraceCheckUtils]: 15: Hoare triple {138421#(< main_~c~0 199984)} assume !(~c~0 == ~last~0); {138421#(< main_~c~0 199984)} is VALID [2022-04-15 06:37:56,609 INFO L290 TraceCheckUtils]: 14: Hoare triple {138421#(< main_~c~0 199984)} assume !!(~c~0 < 200000); {138421#(< main_~c~0 199984)} is VALID [2022-04-15 06:37:56,609 INFO L290 TraceCheckUtils]: 13: Hoare triple {138431#(< main_~c~0 199983)} #t~post5 := ~c~0;~c~0 := 1 + #t~post5;havoc #t~post5; {138421#(< main_~c~0 199984)} is VALID [2022-04-15 06:37:56,609 INFO L290 TraceCheckUtils]: 12: Hoare triple {138431#(< main_~c~0 199983)} assume !(~c~0 == ~last~0); {138431#(< main_~c~0 199983)} is VALID [2022-04-15 06:37:56,610 INFO L290 TraceCheckUtils]: 11: Hoare triple {138431#(< main_~c~0 199983)} assume !!(~c~0 < 200000); {138431#(< main_~c~0 199983)} is VALID [2022-04-15 06:37:56,610 INFO L290 TraceCheckUtils]: 10: Hoare triple {138441#(< main_~c~0 199982)} #t~post5 := ~c~0;~c~0 := 1 + #t~post5;havoc #t~post5; {138431#(< main_~c~0 199983)} is VALID [2022-04-15 06:37:56,610 INFO L290 TraceCheckUtils]: 9: Hoare triple {138441#(< main_~c~0 199982)} assume ~c~0 == ~last~0;~st~0 := 0; {138441#(< main_~c~0 199982)} is VALID [2022-04-15 06:37:56,610 INFO L290 TraceCheckUtils]: 8: Hoare triple {138441#(< main_~c~0 199982)} assume !!(~c~0 < 200000); {138441#(< main_~c~0 199982)} is VALID [2022-04-15 06:37:56,611 INFO L290 TraceCheckUtils]: 7: Hoare triple {138016#true} [261] L23-3_primed-->L23-3: Formula: (and (= v_main_~c~0_7 0) (= v_main_~st~0_6 1)) InVars {} OutVars{main_~c~0=v_main_~c~0_7, main_~st~0=v_main_~st~0_6} AuxVars[] AssignedVars[main_~c~0, main_~st~0] {138441#(< main_~c~0 199982)} is VALID [2022-04-15 06:37:56,611 INFO L290 TraceCheckUtils]: 6: Hoare triple {138016#true} [262] L30-->L23-3_primed: Formula: (and (= v_main_~a~0_278 v_main_~a~0_277) (= v_main_~c~0_2181 v_main_~c~0_2162) (= |v_main_#t~post5_896| |v_main_#t~post5_878|) (= v_main_~st~0_535 v_main_~st~0_533) (= v_main_~b~0_275 v_main_~b~0_274)) InVars {main_~c~0=v_main_~c~0_2181, main_#t~post5=|v_main_#t~post5_896|, main_~st~0=v_main_~st~0_535, main_~b~0=v_main_~b~0_275, main_~a~0=v_main_~a~0_278} OutVars{main_~c~0=v_main_~c~0_2162, main_#t~post5=|v_main_#t~post5_878|, main_~st~0=v_main_~st~0_533, main_~b~0=v_main_~b~0_274, main_~a~0=v_main_~a~0_277} AuxVars[] AssignedVars[main_~c~0, main_#t~post5, main_~st~0, main_~b~0, main_~a~0] {138016#true} is VALID [2022-04-15 06:37:56,611 INFO L290 TraceCheckUtils]: 5: Hoare triple {138016#true} assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~last~0 := #t~nondet4;havoc #t~nondet4;~a~0 := 0;~b~0 := 0;~c~0 := 0;~st~0 := 0; {138016#true} is VALID [2022-04-15 06:37:56,611 INFO L272 TraceCheckUtils]: 4: Hoare triple {138016#true} call #t~ret6 := main(); {138016#true} is VALID [2022-04-15 06:37:56,611 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {138016#true} {138016#true} #66#return; {138016#true} is VALID [2022-04-15 06:37:56,611 INFO L290 TraceCheckUtils]: 2: Hoare triple {138016#true} assume true; {138016#true} is VALID [2022-04-15 06:37:56,611 INFO L290 TraceCheckUtils]: 1: Hoare triple {138016#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(11, 2);call #Ultimate.allocInit(12, 3);~last~0 := 0; {138016#true} is VALID [2022-04-15 06:37:56,611 INFO L272 TraceCheckUtils]: 0: Hoare triple {138016#true} call ULTIMATE.init(); {138016#true} is VALID [2022-04-15 06:37:56,611 INFO L134 CoverageAnalysis]: Checked inductivity of 477 backedges. 0 proven. 477 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 06:37:56,611 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [878136555] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 06:37:56,611 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 06:37:56,611 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 21, 21] total 42 [2022-04-15 06:37:57,260 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 06:37:57,261 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [2075017766] [2022-04-15 06:37:57,261 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [2075017766] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 06:37:57,261 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 06:37:57,261 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [42] imperfect sequences [] total 42 [2022-04-15 06:37:57,261 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1118756850] [2022-04-15 06:37:57,261 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 06:37:57,261 INFO L78 Accepts]: Start accepts. Automaton has has 42 states, 42 states have (on average 2.9285714285714284) internal successors, (123), 41 states have internal predecessors, (123), 2 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 131 [2022-04-15 06:37:57,261 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 06:37:57,261 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 42 states, 42 states have (on average 2.9285714285714284) internal successors, (123), 41 states have internal predecessors, (123), 2 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-15 06:37:57,340 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 128 edges. 128 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 06:37:57,340 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 42 states [2022-04-15 06:37:57,340 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 06:37:57,340 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2022-04-15 06:37:57,341 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1453, Invalid=2329, Unknown=0, NotChecked=0, Total=3782 [2022-04-15 06:37:57,341 INFO L87 Difference]: Start difference. First operand 747 states and 826 transitions. Second operand has 42 states, 42 states have (on average 2.9285714285714284) internal successors, (123), 41 states have internal predecessors, (123), 2 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-15 06:38:04,246 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:38:04,246 INFO L93 Difference]: Finished difference Result 1037 states and 1165 transitions. [2022-04-15 06:38:04,246 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2022-04-15 06:38:04,247 INFO L78 Accepts]: Start accepts. Automaton has has 42 states, 42 states have (on average 2.9285714285714284) internal successors, (123), 41 states have internal predecessors, (123), 2 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 131 [2022-04-15 06:38:04,247 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 06:38:04,247 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 42 states, 42 states have (on average 2.9285714285714284) internal successors, (123), 41 states have internal predecessors, (123), 2 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-15 06:38:04,248 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 172 transitions. [2022-04-15 06:38:04,248 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 42 states, 42 states have (on average 2.9285714285714284) internal successors, (123), 41 states have internal predecessors, (123), 2 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-15 06:38:04,249 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 172 transitions. [2022-04-15 06:38:04,249 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 42 states and 172 transitions. [2022-04-15 06:38:04,363 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-15 06:38:04,398 INFO L225 Difference]: With dead ends: 1037 [2022-04-15 06:38:04,398 INFO L226 Difference]: Without dead ends: 907 [2022-04-15 06:38:04,398 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 231 GetRequests, 147 SyntacticMatches, 24 SemanticMatches, 60 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3473 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=1453, Invalid=2329, Unknown=0, NotChecked=0, Total=3782 [2022-04-15 06:38:04,399 INFO L913 BasicCegarLoop]: 18 mSDtfsCounter, 143 mSDsluCounter, 20 mSDsCounter, 0 mSdLazyCounter, 939 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 143 SdHoareTripleChecker+Valid, 38 SdHoareTripleChecker+Invalid, 964 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 939 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-04-15 06:38:04,399 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [143 Valid, 38 Invalid, 964 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 939 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-04-15 06:38:04,399 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 907 states. [2022-04-15 06:38:08,813 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 907 to 809. [2022-04-15 06:38:08,813 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 06:38:08,814 INFO L82 GeneralOperation]: Start isEquivalent. First operand 907 states. Second operand has 809 states, 801 states have (on average 1.1023720349563046) internal successors, (883), 802 states have internal predecessors, (883), 4 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-15 06:38:08,815 INFO L74 IsIncluded]: Start isIncluded. First operand 907 states. Second operand has 809 states, 801 states have (on average 1.1023720349563046) internal successors, (883), 802 states have internal predecessors, (883), 4 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-15 06:38:08,815 INFO L87 Difference]: Start difference. First operand 907 states. Second operand has 809 states, 801 states have (on average 1.1023720349563046) internal successors, (883), 802 states have internal predecessors, (883), 4 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-15 06:38:08,836 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:38:08,836 INFO L93 Difference]: Finished difference Result 907 states and 990 transitions. [2022-04-15 06:38:08,836 INFO L276 IsEmpty]: Start isEmpty. Operand 907 states and 990 transitions. [2022-04-15 06:38:08,837 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 06:38:08,837 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 06:38:08,837 INFO L74 IsIncluded]: Start isIncluded. First operand has 809 states, 801 states have (on average 1.1023720349563046) internal successors, (883), 802 states have internal predecessors, (883), 4 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) Second operand 907 states. [2022-04-15 06:38:08,838 INFO L87 Difference]: Start difference. First operand has 809 states, 801 states have (on average 1.1023720349563046) internal successors, (883), 802 states have internal predecessors, (883), 4 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) Second operand 907 states. [2022-04-15 06:38:08,859 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:38:08,859 INFO L93 Difference]: Finished difference Result 907 states and 990 transitions. [2022-04-15 06:38:08,859 INFO L276 IsEmpty]: Start isEmpty. Operand 907 states and 990 transitions. [2022-04-15 06:38:08,859 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 06:38:08,859 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 06:38:08,860 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 06:38:08,860 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 06:38:08,860 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 809 states, 801 states have (on average 1.1023720349563046) internal successors, (883), 802 states have internal predecessors, (883), 4 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-15 06:38:08,886 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 809 states to 809 states and 890 transitions. [2022-04-15 06:38:08,886 INFO L78 Accepts]: Start accepts. Automaton has 809 states and 890 transitions. Word has length 131 [2022-04-15 06:38:08,886 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 06:38:08,886 INFO L478 AbstractCegarLoop]: Abstraction has 809 states and 890 transitions. [2022-04-15 06:38:08,886 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 42 states, 42 states have (on average 2.9285714285714284) internal successors, (123), 41 states have internal predecessors, (123), 2 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-15 06:38:08,886 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 809 states and 890 transitions. [2022-04-15 06:38:12,367 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 890 edges. 890 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 06:38:12,368 INFO L276 IsEmpty]: Start isEmpty. Operand 809 states and 890 transitions. [2022-04-15 06:38:12,369 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2022-04-15 06:38:12,369 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 06:38:12,369 INFO L499 BasicCegarLoop]: trace histogram [39, 39, 38, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 06:38:12,385 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (56)] Forceful destruction successful, exit code 0 [2022-04-15 06:38:12,585 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable59,56 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 06:38:12,585 INFO L403 AbstractCegarLoop]: === Iteration 61 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 06:38:12,585 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 06:38:12,585 INFO L85 PathProgramCache]: Analyzing trace with hash 1929169028, now seen corresponding path program 38 times [2022-04-15 06:38:12,586 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 06:38:12,586 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1799947591] [2022-04-15 06:38:13,834 WARN L970 rdanLoopAcceleration]: Unable to prove correctness of quantifier elimination. [2022-04-15 06:38:13,968 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 1 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-15 06:38:14,197 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {0={1=1}, 1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-15 06:38:14,198 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-15 06:38:14,199 INFO L85 PathProgramCache]: Analyzing trace with hash -2024944312, now seen corresponding path program 1 times [2022-04-15 06:38:14,199 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 06:38:14,199 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1918290365] [2022-04-15 06:38:14,199 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 06:38:14,200 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 06:38:14,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:38:14,306 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 06:38:14,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:38:14,308 INFO L290 TraceCheckUtils]: 0: Hoare triple {144012#(and (= ~last~0 |old(~last~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(11, 2);call #Ultimate.allocInit(12, 3);~last~0 := 0; {144000#true} is VALID [2022-04-15 06:38:14,308 INFO L290 TraceCheckUtils]: 1: Hoare triple {144000#true} assume true; {144000#true} is VALID [2022-04-15 06:38:14,308 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {144000#true} {144000#true} #66#return; {144000#true} is VALID [2022-04-15 06:38:14,309 INFO L272 TraceCheckUtils]: 0: Hoare triple {144000#true} call ULTIMATE.init(); {144012#(and (= ~last~0 |old(~last~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 06:38:14,309 INFO L290 TraceCheckUtils]: 1: Hoare triple {144012#(and (= ~last~0 |old(~last~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(11, 2);call #Ultimate.allocInit(12, 3);~last~0 := 0; {144000#true} is VALID [2022-04-15 06:38:14,309 INFO L290 TraceCheckUtils]: 2: Hoare triple {144000#true} assume true; {144000#true} is VALID [2022-04-15 06:38:14,309 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {144000#true} {144000#true} #66#return; {144000#true} is VALID [2022-04-15 06:38:14,309 INFO L272 TraceCheckUtils]: 4: Hoare triple {144000#true} call #t~ret6 := main(); {144000#true} is VALID [2022-04-15 06:38:14,309 INFO L290 TraceCheckUtils]: 5: Hoare triple {144000#true} assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~last~0 := #t~nondet4;havoc #t~nondet4;~a~0 := 0;~b~0 := 0;~c~0 := 0;~st~0 := 0; {144005#(and (= main_~a~0 0) (= main_~b~0 0))} is VALID [2022-04-15 06:38:14,310 INFO L290 TraceCheckUtils]: 6: Hoare triple {144005#(and (= main_~a~0 0) (= main_~b~0 0))} assume !false;~st~0 := 1;~c~0 := 0; {144006#(and (= main_~a~0 0) (= main_~st~0 1) (= main_~b~0 0))} is VALID [2022-04-15 06:38:14,310 INFO L290 TraceCheckUtils]: 7: Hoare triple {144006#(and (= main_~a~0 0) (= main_~st~0 1) (= main_~b~0 0))} [264] L23-3-->L23-4_primed: Formula: (let ((.cse0 (= v_~last~0_406 v_main_~c~0_2241)) (.cse1 (= v_main_~c~0_2241 v_main_~c~0_2240))) (or (and (= |v_main_#t~post5_918| |v_main_#t~post5_920|) (or .cse0 (not (< v_main_~c~0_2241 200000))) .cse1) (and (< v_main_~c~0_2241 v_main_~c~0_2240) (not .cse0) (< v_main_~c~0_2240 200001) (or (not (<= (+ v_~last~0_406 1) v_main_~c~0_2240)) (not (<= (+ v_main_~c~0_2241 1) v_~last~0_406)))) (and (= |v_main_#t~post5_920| |v_main_#t~post5_918|) (= v_~last~0_406 v_~last~0_406) .cse1))) InVars {main_~c~0=v_main_~c~0_2241, main_#t~post5=|v_main_#t~post5_920|, ~last~0=v_~last~0_406} OutVars{main_#t~post5=|v_main_#t~post5_918|, main_~c~0=v_main_~c~0_2240, ~last~0=v_~last~0_406} AuxVars[] AssignedVars[main_#t~post5, main_~c~0] {144006#(and (= main_~a~0 0) (= main_~st~0 1) (= main_~b~0 0))} is VALID [2022-04-15 06:38:14,310 INFO L290 TraceCheckUtils]: 8: Hoare triple {144006#(and (= main_~a~0 0) (= main_~st~0 1) (= main_~b~0 0))} [265] L23-4_primed-->L23-3: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {144006#(and (= main_~a~0 0) (= main_~st~0 1) (= main_~b~0 0))} is VALID [2022-04-15 06:38:14,311 INFO L290 TraceCheckUtils]: 9: Hoare triple {144006#(and (= main_~a~0 0) (= main_~st~0 1) (= main_~b~0 0))} [266] L23-3-->L23-4_primed: Formula: (let ((.cse0 (= v_main_~c~0_2243 v_main_~c~0_2242)) (.cse3 (= v_main_~st~0_543 v_main_~st~0_542)) (.cse4 (= |v_main_#t~post5_923| |v_main_#t~post5_919|)) (.cse2 (< v_main_~c~0_2243 200000)) (.cse1 (= v_~last~0_407 v_main_~c~0_2243))) (or (and .cse0 (or (not .cse1) (not .cse2)) .cse3 .cse4) (and .cse0 (= v_~last~0_407 v_~last~0_407) .cse3 .cse4) (and (< v_main_~c~0_2243 v_main_~c~0_2242) .cse2 (< v_main_~c~0_2242 (+ 2 v_main_~c~0_2243)) .cse1 (= v_main_~st~0_542 0)))) InVars {main_~c~0=v_main_~c~0_2243, main_#t~post5=|v_main_#t~post5_923|, main_~st~0=v_main_~st~0_543, ~last~0=v_~last~0_407} OutVars{main_#t~post5=|v_main_#t~post5_919|, main_~c~0=v_main_~c~0_2242, main_~st~0=v_main_~st~0_542, ~last~0=v_~last~0_407} AuxVars[] AssignedVars[main_#t~post5, main_~c~0, main_~st~0] {144007#(or (= main_~st~0 1) (and (= main_~a~0 0) (or (<= ~last~0 199999) (<= main_~c~0 200000)) (= main_~b~0 0)))} is VALID [2022-04-15 06:38:14,312 INFO L290 TraceCheckUtils]: 10: Hoare triple {144007#(or (= main_~st~0 1) (and (= main_~a~0 0) (or (<= ~last~0 199999) (<= main_~c~0 200000)) (= main_~b~0 0)))} [263] L23-4_primed-->L23-4: Formula: (not (< v_main_~c~0_8 200000)) InVars {main_~c~0=v_main_~c~0_8} OutVars{main_~c~0=v_main_~c~0_8} AuxVars[] AssignedVars[] {144008#(or (= main_~st~0 1) (and (= main_~a~0 0) (or (<= ~last~0 199999) (<= main_~c~0 200000)) (= main_~b~0 0) (< 199999 main_~c~0)))} is VALID [2022-04-15 06:38:14,312 INFO L290 TraceCheckUtils]: 11: Hoare triple {144008#(or (= main_~st~0 1) (and (= main_~a~0 0) (or (<= ~last~0 199999) (<= main_~c~0 200000)) (= main_~b~0 0) (< 199999 main_~c~0)))} assume 0 == ~st~0 && ~c~0 == 1 + ~last~0;~a~0 := 3 + ~a~0;~b~0 := 3 + ~b~0; {144009#(and (<= main_~b~0 main_~a~0) (< main_~a~0 (+ main_~b~0 1)) (< 199999 main_~c~0) (<= main_~c~0 200000))} is VALID [2022-04-15 06:38:14,313 INFO L290 TraceCheckUtils]: 12: Hoare triple {144009#(and (<= main_~b~0 main_~a~0) (< main_~a~0 (+ main_~b~0 1)) (< 199999 main_~c~0) (<= main_~c~0 200000))} assume !(~c~0 == ~last~0 && 0 == ~st~0); {144009#(and (<= main_~b~0 main_~a~0) (< main_~a~0 (+ main_~b~0 1)) (< 199999 main_~c~0) (<= main_~c~0 200000))} is VALID [2022-04-15 06:38:14,313 INFO L272 TraceCheckUtils]: 13: Hoare triple {144009#(and (<= main_~b~0 main_~a~0) (< main_~a~0 (+ main_~b~0 1)) (< 199999 main_~c~0) (<= main_~c~0 200000))} call __VERIFIER_assert((if ~a~0 == ~b~0 && 200000 == ~c~0 then 1 else 0)); {144010#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-15 06:38:14,313 INFO L290 TraceCheckUtils]: 14: Hoare triple {144010#(not (= |__VERIFIER_assert_#in~cond| 0))} ~cond := #in~cond; {144011#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-15 06:38:14,314 INFO L290 TraceCheckUtils]: 15: Hoare triple {144011#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {144001#false} is VALID [2022-04-15 06:38:14,314 INFO L290 TraceCheckUtils]: 16: Hoare triple {144001#false} assume !false; {144001#false} is VALID [2022-04-15 06:38:14,314 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-04-15 06:38:14,314 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 06:38:14,314 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1918290365] [2022-04-15 06:38:14,314 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1918290365] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 06:38:14,314 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [371836508] [2022-04-15 06:38:14,314 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 06:38:14,314 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 06:38:14,314 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 06:38:14,315 INFO L229 MonitoredProcess]: Starting monitored process 57 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-15 06:38:14,321 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (57)] Waiting until timeout for monitored process [2022-04-15 06:38:14,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:38:14,352 INFO L263 TraceCheckSpWp]: Trace formula consists of 85 conjuncts, 18 conjunts are in the unsatisfiable core [2022-04-15 06:38:14,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:38:14,357 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 06:38:14,548 INFO L272 TraceCheckUtils]: 0: Hoare triple {144000#true} call ULTIMATE.init(); {144000#true} is VALID [2022-04-15 06:38:14,548 INFO L290 TraceCheckUtils]: 1: Hoare triple {144000#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(11, 2);call #Ultimate.allocInit(12, 3);~last~0 := 0; {144000#true} is VALID [2022-04-15 06:38:14,548 INFO L290 TraceCheckUtils]: 2: Hoare triple {144000#true} assume true; {144000#true} is VALID [2022-04-15 06:38:14,548 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {144000#true} {144000#true} #66#return; {144000#true} is VALID [2022-04-15 06:38:14,548 INFO L272 TraceCheckUtils]: 4: Hoare triple {144000#true} call #t~ret6 := main(); {144000#true} is VALID [2022-04-15 06:38:14,549 INFO L290 TraceCheckUtils]: 5: Hoare triple {144000#true} assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~last~0 := #t~nondet4;havoc #t~nondet4;~a~0 := 0;~b~0 := 0;~c~0 := 0;~st~0 := 0; {144005#(and (= main_~a~0 0) (= main_~b~0 0))} is VALID [2022-04-15 06:38:14,549 INFO L290 TraceCheckUtils]: 6: Hoare triple {144005#(and (= main_~a~0 0) (= main_~b~0 0))} assume !false;~st~0 := 1;~c~0 := 0; {144006#(and (= main_~a~0 0) (= main_~st~0 1) (= main_~b~0 0))} is VALID [2022-04-15 06:38:14,549 INFO L290 TraceCheckUtils]: 7: Hoare triple {144006#(and (= main_~a~0 0) (= main_~st~0 1) (= main_~b~0 0))} [264] L23-3-->L23-4_primed: Formula: (let ((.cse0 (= v_~last~0_406 v_main_~c~0_2241)) (.cse1 (= v_main_~c~0_2241 v_main_~c~0_2240))) (or (and (= |v_main_#t~post5_918| |v_main_#t~post5_920|) (or .cse0 (not (< v_main_~c~0_2241 200000))) .cse1) (and (< v_main_~c~0_2241 v_main_~c~0_2240) (not .cse0) (< v_main_~c~0_2240 200001) (or (not (<= (+ v_~last~0_406 1) v_main_~c~0_2240)) (not (<= (+ v_main_~c~0_2241 1) v_~last~0_406)))) (and (= |v_main_#t~post5_920| |v_main_#t~post5_918|) (= v_~last~0_406 v_~last~0_406) .cse1))) InVars {main_~c~0=v_main_~c~0_2241, main_#t~post5=|v_main_#t~post5_920|, ~last~0=v_~last~0_406} OutVars{main_#t~post5=|v_main_#t~post5_918|, main_~c~0=v_main_~c~0_2240, ~last~0=v_~last~0_406} AuxVars[] AssignedVars[main_#t~post5, main_~c~0] {144006#(and (= main_~a~0 0) (= main_~st~0 1) (= main_~b~0 0))} is VALID [2022-04-15 06:38:14,550 INFO L290 TraceCheckUtils]: 8: Hoare triple {144006#(and (= main_~a~0 0) (= main_~st~0 1) (= main_~b~0 0))} [265] L23-4_primed-->L23-3: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {144006#(and (= main_~a~0 0) (= main_~st~0 1) (= main_~b~0 0))} is VALID [2022-04-15 06:38:14,550 INFO L290 TraceCheckUtils]: 9: Hoare triple {144006#(and (= main_~a~0 0) (= main_~st~0 1) (= main_~b~0 0))} [266] L23-3-->L23-4_primed: Formula: (let ((.cse0 (= v_main_~c~0_2243 v_main_~c~0_2242)) (.cse3 (= v_main_~st~0_543 v_main_~st~0_542)) (.cse4 (= |v_main_#t~post5_923| |v_main_#t~post5_919|)) (.cse2 (< v_main_~c~0_2243 200000)) (.cse1 (= v_~last~0_407 v_main_~c~0_2243))) (or (and .cse0 (or (not .cse1) (not .cse2)) .cse3 .cse4) (and .cse0 (= v_~last~0_407 v_~last~0_407) .cse3 .cse4) (and (< v_main_~c~0_2243 v_main_~c~0_2242) .cse2 (< v_main_~c~0_2242 (+ 2 v_main_~c~0_2243)) .cse1 (= v_main_~st~0_542 0)))) InVars {main_~c~0=v_main_~c~0_2243, main_#t~post5=|v_main_#t~post5_923|, main_~st~0=v_main_~st~0_543, ~last~0=v_~last~0_407} OutVars{main_#t~post5=|v_main_#t~post5_919|, main_~c~0=v_main_~c~0_2242, main_~st~0=v_main_~st~0_542, ~last~0=v_~last~0_407} AuxVars[] AssignedVars[main_#t~post5, main_~c~0, main_~st~0] {144043#(and (= main_~a~0 0) (= main_~b~0 0) (or (= main_~st~0 1) (and (< ~last~0 200000) (< ~last~0 main_~c~0) (< main_~c~0 (+ ~last~0 2)) (= main_~st~0 0))))} is VALID [2022-04-15 06:38:14,551 INFO L290 TraceCheckUtils]: 10: Hoare triple {144043#(and (= main_~a~0 0) (= main_~b~0 0) (or (= main_~st~0 1) (and (< ~last~0 200000) (< ~last~0 main_~c~0) (< main_~c~0 (+ ~last~0 2)) (= main_~st~0 0))))} [263] L23-4_primed-->L23-4: Formula: (not (< v_main_~c~0_8 200000)) InVars {main_~c~0=v_main_~c~0_8} OutVars{main_~c~0=v_main_~c~0_8} AuxVars[] AssignedVars[] {144047#(and (= main_~a~0 0) (or (and (< ~last~0 200000) (< main_~c~0 (+ ~last~0 2)) (= main_~st~0 0)) (= main_~st~0 1)) (= main_~b~0 0) (not (< main_~c~0 200000)))} is VALID [2022-04-15 06:38:14,551 INFO L290 TraceCheckUtils]: 11: Hoare triple {144047#(and (= main_~a~0 0) (or (and (< ~last~0 200000) (< main_~c~0 (+ ~last~0 2)) (= main_~st~0 0)) (= main_~st~0 1)) (= main_~b~0 0) (not (< main_~c~0 200000)))} assume 0 == ~st~0 && ~c~0 == 1 + ~last~0;~a~0 := 3 + ~a~0;~b~0 := 3 + ~b~0; {144051#(and (= main_~b~0 3) (<= 200000 main_~c~0) (< main_~c~0 200001) (= main_~a~0 3))} is VALID [2022-04-15 06:38:14,552 INFO L290 TraceCheckUtils]: 12: Hoare triple {144051#(and (= main_~b~0 3) (<= 200000 main_~c~0) (< main_~c~0 200001) (= main_~a~0 3))} assume !(~c~0 == ~last~0 && 0 == ~st~0); {144051#(and (= main_~b~0 3) (<= 200000 main_~c~0) (< main_~c~0 200001) (= main_~a~0 3))} is VALID [2022-04-15 06:38:14,552 INFO L272 TraceCheckUtils]: 13: Hoare triple {144051#(and (= main_~b~0 3) (<= 200000 main_~c~0) (< main_~c~0 200001) (= main_~a~0 3))} call __VERIFIER_assert((if ~a~0 == ~b~0 && 200000 == ~c~0 then 1 else 0)); {144058#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-15 06:38:14,552 INFO L290 TraceCheckUtils]: 14: Hoare triple {144058#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {144062#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-15 06:38:14,553 INFO L290 TraceCheckUtils]: 15: Hoare triple {144062#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {144001#false} is VALID [2022-04-15 06:38:14,553 INFO L290 TraceCheckUtils]: 16: Hoare triple {144001#false} assume !false; {144001#false} is VALID [2022-04-15 06:38:14,553 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-04-15 06:38:14,553 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 06:38:14,847 INFO L290 TraceCheckUtils]: 16: Hoare triple {144001#false} assume !false; {144001#false} is VALID [2022-04-15 06:38:14,847 INFO L290 TraceCheckUtils]: 15: Hoare triple {144062#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {144001#false} is VALID [2022-04-15 06:38:14,848 INFO L290 TraceCheckUtils]: 14: Hoare triple {144058#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {144062#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-15 06:38:14,848 INFO L272 TraceCheckUtils]: 13: Hoare triple {144009#(and (<= main_~b~0 main_~a~0) (< main_~a~0 (+ main_~b~0 1)) (< 199999 main_~c~0) (<= main_~c~0 200000))} call __VERIFIER_assert((if ~a~0 == ~b~0 && 200000 == ~c~0 then 1 else 0)); {144058#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-15 06:38:14,849 INFO L290 TraceCheckUtils]: 12: Hoare triple {144009#(and (<= main_~b~0 main_~a~0) (< main_~a~0 (+ main_~b~0 1)) (< 199999 main_~c~0) (<= main_~c~0 200000))} assume !(~c~0 == ~last~0 && 0 == ~st~0); {144009#(and (<= main_~b~0 main_~a~0) (< main_~a~0 (+ main_~b~0 1)) (< 199999 main_~c~0) (<= main_~c~0 200000))} is VALID [2022-04-15 06:38:14,849 INFO L290 TraceCheckUtils]: 11: Hoare triple {144084#(or (not (<= main_~c~0 (+ ~last~0 1))) (and (<= main_~b~0 main_~a~0) (< main_~a~0 (+ main_~b~0 1)) (< 199999 main_~c~0) (<= main_~c~0 200000)) (not (= main_~st~0 0)))} assume 0 == ~st~0 && ~c~0 == 1 + ~last~0;~a~0 := 3 + ~a~0;~b~0 := 3 + ~b~0; {144009#(and (<= main_~b~0 main_~a~0) (< main_~a~0 (+ main_~b~0 1)) (< 199999 main_~c~0) (<= main_~c~0 200000))} is VALID [2022-04-15 06:38:14,850 INFO L290 TraceCheckUtils]: 10: Hoare triple {144088#(or (not (<= main_~c~0 (+ ~last~0 1))) (and (<= main_~b~0 main_~a~0) (< main_~a~0 (+ main_~b~0 1)) (<= main_~c~0 200000)) (not (= main_~st~0 0)) (< main_~c~0 200000))} [263] L23-4_primed-->L23-4: Formula: (not (< v_main_~c~0_8 200000)) InVars {main_~c~0=v_main_~c~0_8} OutVars{main_~c~0=v_main_~c~0_8} AuxVars[] AssignedVars[] {144084#(or (not (<= main_~c~0 (+ ~last~0 1))) (and (<= main_~b~0 main_~a~0) (< main_~a~0 (+ main_~b~0 1)) (< 199999 main_~c~0) (<= main_~c~0 200000)) (not (= main_~st~0 0)))} is VALID [2022-04-15 06:38:14,850 INFO L290 TraceCheckUtils]: 9: Hoare triple {144092#(and (<= main_~b~0 main_~a~0) (< main_~a~0 (+ main_~b~0 1)) (not (= main_~st~0 0)))} [266] L23-3-->L23-4_primed: Formula: (let ((.cse0 (= v_main_~c~0_2243 v_main_~c~0_2242)) (.cse3 (= v_main_~st~0_543 v_main_~st~0_542)) (.cse4 (= |v_main_#t~post5_923| |v_main_#t~post5_919|)) (.cse2 (< v_main_~c~0_2243 200000)) (.cse1 (= v_~last~0_407 v_main_~c~0_2243))) (or (and .cse0 (or (not .cse1) (not .cse2)) .cse3 .cse4) (and .cse0 (= v_~last~0_407 v_~last~0_407) .cse3 .cse4) (and (< v_main_~c~0_2243 v_main_~c~0_2242) .cse2 (< v_main_~c~0_2242 (+ 2 v_main_~c~0_2243)) .cse1 (= v_main_~st~0_542 0)))) InVars {main_~c~0=v_main_~c~0_2243, main_#t~post5=|v_main_#t~post5_923|, main_~st~0=v_main_~st~0_543, ~last~0=v_~last~0_407} OutVars{main_#t~post5=|v_main_#t~post5_919|, main_~c~0=v_main_~c~0_2242, main_~st~0=v_main_~st~0_542, ~last~0=v_~last~0_407} AuxVars[] AssignedVars[main_#t~post5, main_~c~0, main_~st~0] {144088#(or (not (<= main_~c~0 (+ ~last~0 1))) (and (<= main_~b~0 main_~a~0) (< main_~a~0 (+ main_~b~0 1)) (<= main_~c~0 200000)) (not (= main_~st~0 0)) (< main_~c~0 200000))} is VALID [2022-04-15 06:38:14,851 INFO L290 TraceCheckUtils]: 8: Hoare triple {144092#(and (<= main_~b~0 main_~a~0) (< main_~a~0 (+ main_~b~0 1)) (not (= main_~st~0 0)))} [265] L23-4_primed-->L23-3: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {144092#(and (<= main_~b~0 main_~a~0) (< main_~a~0 (+ main_~b~0 1)) (not (= main_~st~0 0)))} is VALID [2022-04-15 06:38:14,851 INFO L290 TraceCheckUtils]: 7: Hoare triple {144092#(and (<= main_~b~0 main_~a~0) (< main_~a~0 (+ main_~b~0 1)) (not (= main_~st~0 0)))} [264] L23-3-->L23-4_primed: Formula: (let ((.cse0 (= v_~last~0_406 v_main_~c~0_2241)) (.cse1 (= v_main_~c~0_2241 v_main_~c~0_2240))) (or (and (= |v_main_#t~post5_918| |v_main_#t~post5_920|) (or .cse0 (not (< v_main_~c~0_2241 200000))) .cse1) (and (< v_main_~c~0_2241 v_main_~c~0_2240) (not .cse0) (< v_main_~c~0_2240 200001) (or (not (<= (+ v_~last~0_406 1) v_main_~c~0_2240)) (not (<= (+ v_main_~c~0_2241 1) v_~last~0_406)))) (and (= |v_main_#t~post5_920| |v_main_#t~post5_918|) (= v_~last~0_406 v_~last~0_406) .cse1))) InVars {main_~c~0=v_main_~c~0_2241, main_#t~post5=|v_main_#t~post5_920|, ~last~0=v_~last~0_406} OutVars{main_#t~post5=|v_main_#t~post5_918|, main_~c~0=v_main_~c~0_2240, ~last~0=v_~last~0_406} AuxVars[] AssignedVars[main_#t~post5, main_~c~0] {144092#(and (<= main_~b~0 main_~a~0) (< main_~a~0 (+ main_~b~0 1)) (not (= main_~st~0 0)))} is VALID [2022-04-15 06:38:14,851 INFO L290 TraceCheckUtils]: 6: Hoare triple {144102#(and (<= main_~b~0 main_~a~0) (< main_~a~0 (+ main_~b~0 1)))} assume !false;~st~0 := 1;~c~0 := 0; {144092#(and (<= main_~b~0 main_~a~0) (< main_~a~0 (+ main_~b~0 1)) (not (= main_~st~0 0)))} is VALID [2022-04-15 06:38:14,852 INFO L290 TraceCheckUtils]: 5: Hoare triple {144000#true} assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~last~0 := #t~nondet4;havoc #t~nondet4;~a~0 := 0;~b~0 := 0;~c~0 := 0;~st~0 := 0; {144102#(and (<= main_~b~0 main_~a~0) (< main_~a~0 (+ main_~b~0 1)))} is VALID [2022-04-15 06:38:14,852 INFO L272 TraceCheckUtils]: 4: Hoare triple {144000#true} call #t~ret6 := main(); {144000#true} is VALID [2022-04-15 06:38:14,852 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {144000#true} {144000#true} #66#return; {144000#true} is VALID [2022-04-15 06:38:14,852 INFO L290 TraceCheckUtils]: 2: Hoare triple {144000#true} assume true; {144000#true} is VALID [2022-04-15 06:38:14,852 INFO L290 TraceCheckUtils]: 1: Hoare triple {144000#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(11, 2);call #Ultimate.allocInit(12, 3);~last~0 := 0; {144000#true} is VALID [2022-04-15 06:38:14,852 INFO L272 TraceCheckUtils]: 0: Hoare triple {144000#true} call ULTIMATE.init(); {144000#true} is VALID [2022-04-15 06:38:14,852 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-04-15 06:38:14,852 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [371836508] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 06:38:14,852 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 06:38:14,853 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9, 9] total 19 [2022-04-15 06:38:18,870 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 06:38:18,870 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1799947591] [2022-04-15 06:38:18,870 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1799947591] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 06:38:18,870 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 06:38:18,870 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [88] imperfect sequences [] total 88 [2022-04-15 06:38:18,870 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1216864852] [2022-04-15 06:38:18,871 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 06:38:18,871 INFO L78 Accepts]: Start accepts. Automaton has has 88 states, 88 states have (on average 1.4431818181818181) internal successors, (127), 86 states have internal predecessors, (127), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 131 [2022-04-15 06:38:18,871 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 06:38:18,871 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 88 states, 88 states have (on average 1.4431818181818181) internal successors, (127), 86 states have internal predecessors, (127), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:38:19,006 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 131 edges. 131 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 06:38:19,006 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 88 states [2022-04-15 06:38:19,006 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 06:38:19,006 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 88 interpolants. [2022-04-15 06:38:19,007 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=666, Invalid=8840, Unknown=0, NotChecked=0, Total=9506 [2022-04-15 06:38:19,007 INFO L87 Difference]: Start difference. First operand 809 states and 890 transitions. Second operand has 88 states, 88 states have (on average 1.4431818181818181) internal successors, (127), 86 states have internal predecessors, (127), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:38:37,346 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:38:37,346 INFO L93 Difference]: Finished difference Result 998 states and 1107 transitions. [2022-04-15 06:38:37,346 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 128 states. [2022-04-15 06:38:37,346 INFO L78 Accepts]: Start accepts. Automaton has has 88 states, 88 states have (on average 1.4431818181818181) internal successors, (127), 86 states have internal predecessors, (127), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 131 [2022-04-15 06:38:37,346 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 06:38:37,346 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 88 states, 88 states have (on average 1.4431818181818181) internal successors, (127), 86 states have internal predecessors, (127), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:38:37,348 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 128 states to 128 states and 265 transitions. [2022-04-15 06:38:37,348 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 88 states, 88 states have (on average 1.4431818181818181) internal successors, (127), 86 states have internal predecessors, (127), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:38:37,349 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 128 states to 128 states and 265 transitions. [2022-04-15 06:38:37,350 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 128 states and 265 transitions. [2022-04-15 06:38:37,494 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 265 edges. 265 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 06:38:37,524 INFO L225 Difference]: With dead ends: 998 [2022-04-15 06:38:37,524 INFO L226 Difference]: Without dead ends: 870 [2022-04-15 06:38:37,525 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 205 GetRequests, 65 SyntacticMatches, 2 SemanticMatches, 138 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5491 ImplicationChecksByTransitivity, 5.4s TimeCoverageRelationStatistics Valid=1073, Invalid=18387, Unknown=0, NotChecked=0, Total=19460 [2022-04-15 06:38:37,525 INFO L913 BasicCegarLoop]: 16 mSDtfsCounter, 256 mSDsluCounter, 58 mSDsCounter, 0 mSdLazyCounter, 11486 mSolverCounterSat, 170 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 258 SdHoareTripleChecker+Valid, 74 SdHoareTripleChecker+Invalid, 11656 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 170 IncrementalHoareTripleChecker+Valid, 11486 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6.2s IncrementalHoareTripleChecker+Time [2022-04-15 06:38:37,525 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [258 Valid, 74 Invalid, 11656 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [170 Valid, 11486 Invalid, 0 Unknown, 0 Unchecked, 6.2s Time] [2022-04-15 06:38:37,526 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 870 states. [2022-04-15 06:38:41,109 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 870 to 812. [2022-04-15 06:38:41,109 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 06:38:41,110 INFO L82 GeneralOperation]: Start isEquivalent. First operand 870 states. Second operand has 812 states, 804 states have (on average 1.1032338308457712) internal successors, (887), 805 states have internal predecessors, (887), 4 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-15 06:38:41,111 INFO L74 IsIncluded]: Start isIncluded. First operand 870 states. Second operand has 812 states, 804 states have (on average 1.1032338308457712) internal successors, (887), 805 states have internal predecessors, (887), 4 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-15 06:38:41,111 INFO L87 Difference]: Start difference. First operand 870 states. Second operand has 812 states, 804 states have (on average 1.1032338308457712) internal successors, (887), 805 states have internal predecessors, (887), 4 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-15 06:38:41,132 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:38:41,132 INFO L93 Difference]: Finished difference Result 870 states and 954 transitions. [2022-04-15 06:38:41,132 INFO L276 IsEmpty]: Start isEmpty. Operand 870 states and 954 transitions. [2022-04-15 06:38:41,133 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 06:38:41,133 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 06:38:41,133 INFO L74 IsIncluded]: Start isIncluded. First operand has 812 states, 804 states have (on average 1.1032338308457712) internal successors, (887), 805 states have internal predecessors, (887), 4 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) Second operand 870 states. [2022-04-15 06:38:41,134 INFO L87 Difference]: Start difference. First operand has 812 states, 804 states have (on average 1.1032338308457712) internal successors, (887), 805 states have internal predecessors, (887), 4 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) Second operand 870 states. [2022-04-15 06:38:41,154 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:38:41,154 INFO L93 Difference]: Finished difference Result 870 states and 954 transitions. [2022-04-15 06:38:41,154 INFO L276 IsEmpty]: Start isEmpty. Operand 870 states and 954 transitions. [2022-04-15 06:38:41,155 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 06:38:41,155 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 06:38:41,155 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 06:38:41,155 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 06:38:41,156 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 812 states, 804 states have (on average 1.1032338308457712) internal successors, (887), 805 states have internal predecessors, (887), 4 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-15 06:38:41,182 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 812 states to 812 states and 894 transitions. [2022-04-15 06:38:41,182 INFO L78 Accepts]: Start accepts. Automaton has 812 states and 894 transitions. Word has length 131 [2022-04-15 06:38:41,182 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 06:38:41,182 INFO L478 AbstractCegarLoop]: Abstraction has 812 states and 894 transitions. [2022-04-15 06:38:41,183 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 88 states, 88 states have (on average 1.4431818181818181) internal successors, (127), 86 states have internal predecessors, (127), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:38:41,183 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 812 states and 894 transitions. [2022-04-15 06:38:44,472 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 894 edges. 894 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 06:38:44,473 INFO L276 IsEmpty]: Start isEmpty. Operand 812 states and 894 transitions. [2022-04-15 06:38:44,474 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2022-04-15 06:38:44,474 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 06:38:44,474 INFO L499 BasicCegarLoop]: trace histogram [40, 40, 39, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 06:38:44,496 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (57)] Forceful destruction successful, exit code 0 [2022-04-15 06:38:44,689 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable60,57 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 06:38:44,689 INFO L403 AbstractCegarLoop]: === Iteration 62 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 06:38:44,689 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 06:38:44,689 INFO L85 PathProgramCache]: Analyzing trace with hash 712622247, now seen corresponding path program 39 times [2022-04-15 06:38:44,689 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 06:38:44,689 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [749732678] [2022-04-15 06:38:48,787 WARN L970 rdanLoopAcceleration]: Unable to prove correctness of quantifier elimination. [2022-04-15 06:38:51,222 WARN L977 rdanLoopAcceleration]: Unable to prove correctness of quantifier elimination. [2022-04-15 06:38:51,338 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 1 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-15 06:38:51,516 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {0={1=1}, 1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-15 06:38:51,517 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-15 06:38:51,519 INFO L85 PathProgramCache]: Analyzing trace with hash 480439880, now seen corresponding path program 1 times [2022-04-15 06:38:51,519 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 06:38:51,519 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1569723394] [2022-04-15 06:38:51,519 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 06:38:51,519 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 06:38:51,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:38:51,692 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 06:38:51,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:38:51,696 INFO L290 TraceCheckUtils]: 0: Hoare triple {149659#(and (= ~last~0 |old(~last~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(11, 2);call #Ultimate.allocInit(12, 3);~last~0 := 0; {149646#true} is VALID [2022-04-15 06:38:51,696 INFO L290 TraceCheckUtils]: 1: Hoare triple {149646#true} assume true; {149646#true} is VALID [2022-04-15 06:38:51,696 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {149646#true} {149646#true} #66#return; {149646#true} is VALID [2022-04-15 06:38:51,696 INFO L272 TraceCheckUtils]: 0: Hoare triple {149646#true} call ULTIMATE.init(); {149659#(and (= ~last~0 |old(~last~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 06:38:51,696 INFO L290 TraceCheckUtils]: 1: Hoare triple {149659#(and (= ~last~0 |old(~last~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(11, 2);call #Ultimate.allocInit(12, 3);~last~0 := 0; {149646#true} is VALID [2022-04-15 06:38:51,696 INFO L290 TraceCheckUtils]: 2: Hoare triple {149646#true} assume true; {149646#true} is VALID [2022-04-15 06:38:51,696 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {149646#true} {149646#true} #66#return; {149646#true} is VALID [2022-04-15 06:38:51,697 INFO L272 TraceCheckUtils]: 4: Hoare triple {149646#true} call #t~ret6 := main(); {149646#true} is VALID [2022-04-15 06:38:51,697 INFO L290 TraceCheckUtils]: 5: Hoare triple {149646#true} assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~last~0 := #t~nondet4;havoc #t~nondet4;~a~0 := 0;~b~0 := 0;~c~0 := 0;~st~0 := 0; {149651#(and (= main_~a~0 0) (= main_~b~0 0))} is VALID [2022-04-15 06:38:51,697 INFO L290 TraceCheckUtils]: 6: Hoare triple {149651#(and (= main_~a~0 0) (= main_~b~0 0))} assume !false;~st~0 := 1;~c~0 := 0; {149652#(and (= main_~a~0 0) (= main_~b~0 0) (= main_~c~0 0))} is VALID [2022-04-15 06:38:51,698 INFO L290 TraceCheckUtils]: 7: Hoare triple {149652#(and (= main_~a~0 0) (= main_~b~0 0) (= main_~c~0 0))} [268] L23-3-->L23-4_primed: Formula: (let ((.cse2 (= v_~last~0_414 v_main_~c~0_2297)) (.cse0 (= v_main_~c~0_2297 v_main_~c~0_2296)) (.cse1 (= |v_main_#t~post5_933| |v_main_#t~post5_931|))) (or (and .cse0 (= v_~last~0_414 v_~last~0_414) .cse1) (and (not .cse2) (< v_main_~c~0_2297 v_main_~c~0_2296) (or (not (<= (+ v_main_~c~0_2297 1) v_~last~0_414)) (not (<= (+ v_~last~0_414 1) v_main_~c~0_2296))) (< v_main_~c~0_2296 200001)) (and (or (not (< v_main_~c~0_2297 200000)) .cse2) .cse0 .cse1))) InVars {main_~c~0=v_main_~c~0_2297, main_#t~post5=|v_main_#t~post5_933|, ~last~0=v_~last~0_414} OutVars{main_#t~post5=|v_main_#t~post5_931|, main_~c~0=v_main_~c~0_2296, ~last~0=v_~last~0_414} AuxVars[] AssignedVars[main_#t~post5, main_~c~0] {149653#(and (= main_~a~0 0) (= main_~b~0 0) (or (<= ~last~0 0) (<= main_~c~0 200000)))} is VALID [2022-04-15 06:38:51,698 INFO L290 TraceCheckUtils]: 8: Hoare triple {149653#(and (= main_~a~0 0) (= main_~b~0 0) (or (<= ~last~0 0) (<= main_~c~0 200000)))} [269] L23-4_primed-->L23-3: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {149653#(and (= main_~a~0 0) (= main_~b~0 0) (or (<= ~last~0 0) (<= main_~c~0 200000)))} is VALID [2022-04-15 06:38:51,699 INFO L290 TraceCheckUtils]: 9: Hoare triple {149653#(and (= main_~a~0 0) (= main_~b~0 0) (or (<= ~last~0 0) (<= main_~c~0 200000)))} [270] L23-3-->L23-4_primed: Formula: (let ((.cse2 (= v_main_~st~0_553 v_main_~st~0_552)) (.cse3 (= v_main_~c~0_2299 v_main_~c~0_2298)) (.cse1 (= v_~last~0_415 v_main_~c~0_2299)) (.cse0 (< v_main_~c~0_2299 200000))) (or (and (= v_main_~st~0_552 0) (< v_main_~c~0_2299 v_main_~c~0_2298) .cse0 (<= v_main_~c~0_2298 (+ v_~last~0_415 1)) .cse1) (and .cse2 (= |v_main_#t~post5_936| |v_main_#t~post5_932|) .cse3 (= v_~last~0_415 v_~last~0_415)) (and .cse2 .cse3 (= |v_main_#t~post5_932| |v_main_#t~post5_936|) (or (not .cse1) (not .cse0))))) InVars {main_~c~0=v_main_~c~0_2299, main_#t~post5=|v_main_#t~post5_936|, main_~st~0=v_main_~st~0_553, ~last~0=v_~last~0_415} OutVars{main_#t~post5=|v_main_#t~post5_932|, main_~c~0=v_main_~c~0_2298, main_~st~0=v_main_~st~0_552, ~last~0=v_~last~0_415} AuxVars[] AssignedVars[main_#t~post5, main_~c~0, main_~st~0] {149654#(and (= main_~a~0 0) (or (<= ~last~0 199999) (<= main_~c~0 200000)) (= main_~b~0 0))} is VALID [2022-04-15 06:38:51,699 INFO L290 TraceCheckUtils]: 10: Hoare triple {149654#(and (= main_~a~0 0) (or (<= ~last~0 199999) (<= main_~c~0 200000)) (= main_~b~0 0))} [267] L23-4_primed-->L23-4: Formula: (not (< v_main_~c~0_8 200000)) InVars {main_~c~0=v_main_~c~0_8} OutVars{main_~c~0=v_main_~c~0_8} AuxVars[] AssignedVars[] {149655#(and (= main_~a~0 0) (= main_~b~0 0) (or (<= (+ ~last~0 200000) main_~c~0) (and (< 199999 main_~c~0) (<= main_~c~0 200000)) (and (<= ~last~0 199999) (< 199999 main_~c~0))))} is VALID [2022-04-15 06:38:51,700 INFO L290 TraceCheckUtils]: 11: Hoare triple {149655#(and (= main_~a~0 0) (= main_~b~0 0) (or (<= (+ ~last~0 200000) main_~c~0) (and (< 199999 main_~c~0) (<= main_~c~0 200000)) (and (<= ~last~0 199999) (< 199999 main_~c~0))))} assume 0 == ~st~0 && ~c~0 == 1 + ~last~0;~a~0 := 3 + ~a~0;~b~0 := 3 + ~b~0; {149656#(and (<= main_~b~0 main_~a~0) (< main_~a~0 (+ main_~b~0 1)) (< 199999 main_~c~0) (<= main_~c~0 200000))} is VALID [2022-04-15 06:38:51,700 INFO L290 TraceCheckUtils]: 12: Hoare triple {149656#(and (<= main_~b~0 main_~a~0) (< main_~a~0 (+ main_~b~0 1)) (< 199999 main_~c~0) (<= main_~c~0 200000))} assume !(~c~0 == ~last~0 && 0 == ~st~0); {149656#(and (<= main_~b~0 main_~a~0) (< main_~a~0 (+ main_~b~0 1)) (< 199999 main_~c~0) (<= main_~c~0 200000))} is VALID [2022-04-15 06:38:51,701 INFO L272 TraceCheckUtils]: 13: Hoare triple {149656#(and (<= main_~b~0 main_~a~0) (< main_~a~0 (+ main_~b~0 1)) (< 199999 main_~c~0) (<= main_~c~0 200000))} call __VERIFIER_assert((if ~a~0 == ~b~0 && 200000 == ~c~0 then 1 else 0)); {149657#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-15 06:38:51,701 INFO L290 TraceCheckUtils]: 14: Hoare triple {149657#(not (= |__VERIFIER_assert_#in~cond| 0))} ~cond := #in~cond; {149658#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-15 06:38:51,701 INFO L290 TraceCheckUtils]: 15: Hoare triple {149658#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {149647#false} is VALID [2022-04-15 06:38:51,701 INFO L290 TraceCheckUtils]: 16: Hoare triple {149647#false} assume !false; {149647#false} is VALID [2022-04-15 06:38:51,701 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 06:38:51,702 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 06:38:51,702 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1569723394] [2022-04-15 06:38:51,702 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1569723394] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 06:38:51,702 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1463945931] [2022-04-15 06:38:51,702 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 06:38:51,702 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 06:38:51,702 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 06:38:51,703 INFO L229 MonitoredProcess]: Starting monitored process 58 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-15 06:38:51,703 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (58)] Waiting until timeout for monitored process [2022-04-15 06:38:51,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:38:51,733 INFO L263 TraceCheckSpWp]: Trace formula consists of 85 conjuncts, 18 conjunts are in the unsatisfiable core [2022-04-15 06:38:51,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:38:51,739 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 06:38:52,019 INFO L272 TraceCheckUtils]: 0: Hoare triple {149646#true} call ULTIMATE.init(); {149646#true} is VALID [2022-04-15 06:38:52,019 INFO L290 TraceCheckUtils]: 1: Hoare triple {149646#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(11, 2);call #Ultimate.allocInit(12, 3);~last~0 := 0; {149646#true} is VALID [2022-04-15 06:38:52,019 INFO L290 TraceCheckUtils]: 2: Hoare triple {149646#true} assume true; {149646#true} is VALID [2022-04-15 06:38:52,019 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {149646#true} {149646#true} #66#return; {149646#true} is VALID [2022-04-15 06:38:52,020 INFO L272 TraceCheckUtils]: 4: Hoare triple {149646#true} call #t~ret6 := main(); {149646#true} is VALID [2022-04-15 06:38:52,020 INFO L290 TraceCheckUtils]: 5: Hoare triple {149646#true} assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~last~0 := #t~nondet4;havoc #t~nondet4;~a~0 := 0;~b~0 := 0;~c~0 := 0;~st~0 := 0; {149651#(and (= main_~a~0 0) (= main_~b~0 0))} is VALID [2022-04-15 06:38:52,020 INFO L290 TraceCheckUtils]: 6: Hoare triple {149651#(and (= main_~a~0 0) (= main_~b~0 0))} assume !false;~st~0 := 1;~c~0 := 0; {149681#(and (= main_~a~0 0) (= main_~st~0 1) (= main_~b~0 0))} is VALID [2022-04-15 06:38:52,021 INFO L290 TraceCheckUtils]: 7: Hoare triple {149681#(and (= main_~a~0 0) (= main_~st~0 1) (= main_~b~0 0))} [268] L23-3-->L23-4_primed: Formula: (let ((.cse2 (= v_~last~0_414 v_main_~c~0_2297)) (.cse0 (= v_main_~c~0_2297 v_main_~c~0_2296)) (.cse1 (= |v_main_#t~post5_933| |v_main_#t~post5_931|))) (or (and .cse0 (= v_~last~0_414 v_~last~0_414) .cse1) (and (not .cse2) (< v_main_~c~0_2297 v_main_~c~0_2296) (or (not (<= (+ v_main_~c~0_2297 1) v_~last~0_414)) (not (<= (+ v_~last~0_414 1) v_main_~c~0_2296))) (< v_main_~c~0_2296 200001)) (and (or (not (< v_main_~c~0_2297 200000)) .cse2) .cse0 .cse1))) InVars {main_~c~0=v_main_~c~0_2297, main_#t~post5=|v_main_#t~post5_933|, ~last~0=v_~last~0_414} OutVars{main_#t~post5=|v_main_#t~post5_931|, main_~c~0=v_main_~c~0_2296, ~last~0=v_~last~0_414} AuxVars[] AssignedVars[main_#t~post5, main_~c~0] {149681#(and (= main_~a~0 0) (= main_~st~0 1) (= main_~b~0 0))} is VALID [2022-04-15 06:38:52,021 INFO L290 TraceCheckUtils]: 8: Hoare triple {149681#(and (= main_~a~0 0) (= main_~st~0 1) (= main_~b~0 0))} [269] L23-4_primed-->L23-3: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {149681#(and (= main_~a~0 0) (= main_~st~0 1) (= main_~b~0 0))} is VALID [2022-04-15 06:38:52,022 INFO L290 TraceCheckUtils]: 9: Hoare triple {149681#(and (= main_~a~0 0) (= main_~st~0 1) (= main_~b~0 0))} [270] L23-3-->L23-4_primed: Formula: (let ((.cse2 (= v_main_~st~0_553 v_main_~st~0_552)) (.cse3 (= v_main_~c~0_2299 v_main_~c~0_2298)) (.cse1 (= v_~last~0_415 v_main_~c~0_2299)) (.cse0 (< v_main_~c~0_2299 200000))) (or (and (= v_main_~st~0_552 0) (< v_main_~c~0_2299 v_main_~c~0_2298) .cse0 (<= v_main_~c~0_2298 (+ v_~last~0_415 1)) .cse1) (and .cse2 (= |v_main_#t~post5_936| |v_main_#t~post5_932|) .cse3 (= v_~last~0_415 v_~last~0_415)) (and .cse2 .cse3 (= |v_main_#t~post5_932| |v_main_#t~post5_936|) (or (not .cse1) (not .cse0))))) InVars {main_~c~0=v_main_~c~0_2299, main_#t~post5=|v_main_#t~post5_936|, main_~st~0=v_main_~st~0_553, ~last~0=v_~last~0_415} OutVars{main_#t~post5=|v_main_#t~post5_932|, main_~c~0=v_main_~c~0_2298, main_~st~0=v_main_~st~0_552, ~last~0=v_~last~0_415} AuxVars[] AssignedVars[main_#t~post5, main_~c~0, main_~st~0] {149691#(and (= main_~a~0 0) (= main_~b~0 0) (or (and (< ~last~0 200000) (< ~last~0 main_~c~0) (<= main_~c~0 (+ ~last~0 1)) (= main_~st~0 0)) (= main_~st~0 1)))} is VALID [2022-04-15 06:38:52,023 INFO L290 TraceCheckUtils]: 10: Hoare triple {149691#(and (= main_~a~0 0) (= main_~b~0 0) (or (and (< ~last~0 200000) (< ~last~0 main_~c~0) (<= main_~c~0 (+ ~last~0 1)) (= main_~st~0 0)) (= main_~st~0 1)))} [267] L23-4_primed-->L23-4: Formula: (not (< v_main_~c~0_8 200000)) InVars {main_~c~0=v_main_~c~0_8} OutVars{main_~c~0=v_main_~c~0_8} AuxVars[] AssignedVars[] {149695#(and (= main_~a~0 0) (or (= main_~st~0 1) (and (< ~last~0 200000) (<= main_~c~0 (+ ~last~0 1)) (= main_~st~0 0))) (= main_~b~0 0) (not (< main_~c~0 200000)))} is VALID [2022-04-15 06:38:52,023 INFO L290 TraceCheckUtils]: 11: Hoare triple {149695#(and (= main_~a~0 0) (or (= main_~st~0 1) (and (< ~last~0 200000) (<= main_~c~0 (+ ~last~0 1)) (= main_~st~0 0))) (= main_~b~0 0) (not (< main_~c~0 200000)))} assume 0 == ~st~0 && ~c~0 == 1 + ~last~0;~a~0 := 3 + ~a~0;~b~0 := 3 + ~b~0; {149699#(and (= main_~b~0 3) (<= 200000 main_~c~0) (< main_~c~0 200001) (= main_~a~0 3))} is VALID [2022-04-15 06:38:52,024 INFO L290 TraceCheckUtils]: 12: Hoare triple {149699#(and (= main_~b~0 3) (<= 200000 main_~c~0) (< main_~c~0 200001) (= main_~a~0 3))} assume !(~c~0 == ~last~0 && 0 == ~st~0); {149699#(and (= main_~b~0 3) (<= 200000 main_~c~0) (< main_~c~0 200001) (= main_~a~0 3))} is VALID [2022-04-15 06:38:52,024 INFO L272 TraceCheckUtils]: 13: Hoare triple {149699#(and (= main_~b~0 3) (<= 200000 main_~c~0) (< main_~c~0 200001) (= main_~a~0 3))} call __VERIFIER_assert((if ~a~0 == ~b~0 && 200000 == ~c~0 then 1 else 0)); {149706#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-15 06:38:52,025 INFO L290 TraceCheckUtils]: 14: Hoare triple {149706#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {149710#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-15 06:38:52,025 INFO L290 TraceCheckUtils]: 15: Hoare triple {149710#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {149647#false} is VALID [2022-04-15 06:38:52,025 INFO L290 TraceCheckUtils]: 16: Hoare triple {149647#false} assume !false; {149647#false} is VALID [2022-04-15 06:38:52,025 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-04-15 06:38:52,025 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 06:38:52,421 INFO L290 TraceCheckUtils]: 16: Hoare triple {149647#false} assume !false; {149647#false} is VALID [2022-04-15 06:38:52,421 INFO L290 TraceCheckUtils]: 15: Hoare triple {149710#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {149647#false} is VALID [2022-04-15 06:38:52,421 INFO L290 TraceCheckUtils]: 14: Hoare triple {149706#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {149710#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-15 06:38:52,422 INFO L272 TraceCheckUtils]: 13: Hoare triple {149656#(and (<= main_~b~0 main_~a~0) (< main_~a~0 (+ main_~b~0 1)) (< 199999 main_~c~0) (<= main_~c~0 200000))} call __VERIFIER_assert((if ~a~0 == ~b~0 && 200000 == ~c~0 then 1 else 0)); {149706#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-15 06:38:52,422 INFO L290 TraceCheckUtils]: 12: Hoare triple {149656#(and (<= main_~b~0 main_~a~0) (< main_~a~0 (+ main_~b~0 1)) (< 199999 main_~c~0) (<= main_~c~0 200000))} assume !(~c~0 == ~last~0 && 0 == ~st~0); {149656#(and (<= main_~b~0 main_~a~0) (< main_~a~0 (+ main_~b~0 1)) (< 199999 main_~c~0) (<= main_~c~0 200000))} is VALID [2022-04-15 06:38:52,423 INFO L290 TraceCheckUtils]: 11: Hoare triple {149732#(or (not (<= main_~c~0 (+ ~last~0 1))) (and (<= main_~b~0 main_~a~0) (< main_~a~0 (+ main_~b~0 1)) (< 199999 main_~c~0) (<= main_~c~0 200000)) (not (= main_~st~0 0)))} assume 0 == ~st~0 && ~c~0 == 1 + ~last~0;~a~0 := 3 + ~a~0;~b~0 := 3 + ~b~0; {149656#(and (<= main_~b~0 main_~a~0) (< main_~a~0 (+ main_~b~0 1)) (< 199999 main_~c~0) (<= main_~c~0 200000))} is VALID [2022-04-15 06:38:52,423 INFO L290 TraceCheckUtils]: 10: Hoare triple {149736#(or (not (<= main_~c~0 (+ ~last~0 1))) (and (<= main_~b~0 main_~a~0) (< main_~a~0 (+ main_~b~0 1)) (<= main_~c~0 200000)) (not (= main_~st~0 0)) (< main_~c~0 200000))} [267] L23-4_primed-->L23-4: Formula: (not (< v_main_~c~0_8 200000)) InVars {main_~c~0=v_main_~c~0_8} OutVars{main_~c~0=v_main_~c~0_8} AuxVars[] AssignedVars[] {149732#(or (not (<= main_~c~0 (+ ~last~0 1))) (and (<= main_~b~0 main_~a~0) (< main_~a~0 (+ main_~b~0 1)) (< 199999 main_~c~0) (<= main_~c~0 200000)) (not (= main_~st~0 0)))} is VALID [2022-04-15 06:38:52,424 INFO L290 TraceCheckUtils]: 9: Hoare triple {149740#(and (<= main_~b~0 main_~a~0) (< main_~a~0 (+ main_~b~0 1)) (not (= main_~st~0 0)))} [270] L23-3-->L23-4_primed: Formula: (let ((.cse2 (= v_main_~st~0_553 v_main_~st~0_552)) (.cse3 (= v_main_~c~0_2299 v_main_~c~0_2298)) (.cse1 (= v_~last~0_415 v_main_~c~0_2299)) (.cse0 (< v_main_~c~0_2299 200000))) (or (and (= v_main_~st~0_552 0) (< v_main_~c~0_2299 v_main_~c~0_2298) .cse0 (<= v_main_~c~0_2298 (+ v_~last~0_415 1)) .cse1) (and .cse2 (= |v_main_#t~post5_936| |v_main_#t~post5_932|) .cse3 (= v_~last~0_415 v_~last~0_415)) (and .cse2 .cse3 (= |v_main_#t~post5_932| |v_main_#t~post5_936|) (or (not .cse1) (not .cse0))))) InVars {main_~c~0=v_main_~c~0_2299, main_#t~post5=|v_main_#t~post5_936|, main_~st~0=v_main_~st~0_553, ~last~0=v_~last~0_415} OutVars{main_#t~post5=|v_main_#t~post5_932|, main_~c~0=v_main_~c~0_2298, main_~st~0=v_main_~st~0_552, ~last~0=v_~last~0_415} AuxVars[] AssignedVars[main_#t~post5, main_~c~0, main_~st~0] {149736#(or (not (<= main_~c~0 (+ ~last~0 1))) (and (<= main_~b~0 main_~a~0) (< main_~a~0 (+ main_~b~0 1)) (<= main_~c~0 200000)) (not (= main_~st~0 0)) (< main_~c~0 200000))} is VALID [2022-04-15 06:38:52,424 INFO L290 TraceCheckUtils]: 8: Hoare triple {149740#(and (<= main_~b~0 main_~a~0) (< main_~a~0 (+ main_~b~0 1)) (not (= main_~st~0 0)))} [269] L23-4_primed-->L23-3: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {149740#(and (<= main_~b~0 main_~a~0) (< main_~a~0 (+ main_~b~0 1)) (not (= main_~st~0 0)))} is VALID [2022-04-15 06:38:52,425 INFO L290 TraceCheckUtils]: 7: Hoare triple {149740#(and (<= main_~b~0 main_~a~0) (< main_~a~0 (+ main_~b~0 1)) (not (= main_~st~0 0)))} [268] L23-3-->L23-4_primed: Formula: (let ((.cse2 (= v_~last~0_414 v_main_~c~0_2297)) (.cse0 (= v_main_~c~0_2297 v_main_~c~0_2296)) (.cse1 (= |v_main_#t~post5_933| |v_main_#t~post5_931|))) (or (and .cse0 (= v_~last~0_414 v_~last~0_414) .cse1) (and (not .cse2) (< v_main_~c~0_2297 v_main_~c~0_2296) (or (not (<= (+ v_main_~c~0_2297 1) v_~last~0_414)) (not (<= (+ v_~last~0_414 1) v_main_~c~0_2296))) (< v_main_~c~0_2296 200001)) (and (or (not (< v_main_~c~0_2297 200000)) .cse2) .cse0 .cse1))) InVars {main_~c~0=v_main_~c~0_2297, main_#t~post5=|v_main_#t~post5_933|, ~last~0=v_~last~0_414} OutVars{main_#t~post5=|v_main_#t~post5_931|, main_~c~0=v_main_~c~0_2296, ~last~0=v_~last~0_414} AuxVars[] AssignedVars[main_#t~post5, main_~c~0] {149740#(and (<= main_~b~0 main_~a~0) (< main_~a~0 (+ main_~b~0 1)) (not (= main_~st~0 0)))} is VALID [2022-04-15 06:38:52,425 INFO L290 TraceCheckUtils]: 6: Hoare triple {149750#(and (<= main_~b~0 main_~a~0) (< main_~a~0 (+ main_~b~0 1)))} assume !false;~st~0 := 1;~c~0 := 0; {149740#(and (<= main_~b~0 main_~a~0) (< main_~a~0 (+ main_~b~0 1)) (not (= main_~st~0 0)))} is VALID [2022-04-15 06:38:52,425 INFO L290 TraceCheckUtils]: 5: Hoare triple {149646#true} assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~last~0 := #t~nondet4;havoc #t~nondet4;~a~0 := 0;~b~0 := 0;~c~0 := 0;~st~0 := 0; {149750#(and (<= main_~b~0 main_~a~0) (< main_~a~0 (+ main_~b~0 1)))} is VALID [2022-04-15 06:38:52,425 INFO L272 TraceCheckUtils]: 4: Hoare triple {149646#true} call #t~ret6 := main(); {149646#true} is VALID [2022-04-15 06:38:52,426 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {149646#true} {149646#true} #66#return; {149646#true} is VALID [2022-04-15 06:38:52,426 INFO L290 TraceCheckUtils]: 2: Hoare triple {149646#true} assume true; {149646#true} is VALID [2022-04-15 06:38:52,426 INFO L290 TraceCheckUtils]: 1: Hoare triple {149646#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(11, 2);call #Ultimate.allocInit(12, 3);~last~0 := 0; {149646#true} is VALID [2022-04-15 06:38:52,426 INFO L272 TraceCheckUtils]: 0: Hoare triple {149646#true} call ULTIMATE.init(); {149646#true} is VALID [2022-04-15 06:38:52,426 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-04-15 06:38:52,426 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1463945931] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 06:38:52,426 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 06:38:52,426 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 9, 9] total 21 [2022-04-15 06:38:56,495 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 06:38:56,496 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [749732678] [2022-04-15 06:38:56,496 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [749732678] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 06:38:56,496 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 06:38:56,496 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [90] imperfect sequences [] total 90 [2022-04-15 06:38:56,496 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [868589293] [2022-04-15 06:38:56,496 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 06:38:56,496 INFO L78 Accepts]: Start accepts. Automaton has has 90 states, 90 states have (on average 1.4444444444444444) internal successors, (130), 88 states have internal predecessors, (130), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 134 [2022-04-15 06:38:56,496 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 06:38:56,497 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 90 states, 90 states have (on average 1.4444444444444444) internal successors, (130), 88 states have internal predecessors, (130), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:38:56,572 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 134 edges. 134 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 06:38:56,572 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 90 states [2022-04-15 06:38:56,572 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 06:38:56,572 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 90 interpolants. [2022-04-15 06:38:56,573 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=780, Invalid=9726, Unknown=0, NotChecked=0, Total=10506 [2022-04-15 06:38:56,573 INFO L87 Difference]: Start difference. First operand 812 states and 894 transitions. Second operand has 90 states, 90 states have (on average 1.4444444444444444) internal successors, (130), 88 states have internal predecessors, (130), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:39:14,456 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:39:14,456 INFO L93 Difference]: Finished difference Result 1047 states and 1178 transitions. [2022-04-15 06:39:14,456 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 111 states. [2022-04-15 06:39:14,457 INFO L78 Accepts]: Start accepts. Automaton has has 90 states, 90 states have (on average 1.4444444444444444) internal successors, (130), 88 states have internal predecessors, (130), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 134 [2022-04-15 06:39:14,457 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 06:39:14,457 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 90 states, 90 states have (on average 1.4444444444444444) internal successors, (130), 88 states have internal predecessors, (130), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:39:14,458 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 224 transitions. [2022-04-15 06:39:14,458 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 90 states, 90 states have (on average 1.4444444444444444) internal successors, (130), 88 states have internal predecessors, (130), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:39:14,467 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 224 transitions. [2022-04-15 06:39:14,467 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 111 states and 224 transitions. [2022-04-15 06:39:14,642 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 224 edges. 224 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 06:39:14,674 INFO L225 Difference]: With dead ends: 1047 [2022-04-15 06:39:14,674 INFO L226 Difference]: Without dead ends: 919 [2022-04-15 06:39:14,675 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 192 GetRequests, 64 SyntacticMatches, 2 SemanticMatches, 126 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4756 ImplicationChecksByTransitivity, 4.9s TimeCoverageRelationStatistics Valid=1037, Invalid=15219, Unknown=0, NotChecked=0, Total=16256 [2022-04-15 06:39:14,675 INFO L913 BasicCegarLoop]: 13 mSDtfsCounter, 125 mSDsluCounter, 152 mSDsCounter, 0 mSdLazyCounter, 10607 mSolverCounterSat, 75 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 126 SdHoareTripleChecker+Valid, 165 SdHoareTripleChecker+Invalid, 10682 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 75 IncrementalHoareTripleChecker+Valid, 10607 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6.3s IncrementalHoareTripleChecker+Time [2022-04-15 06:39:14,675 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [126 Valid, 165 Invalid, 10682 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [75 Valid, 10607 Invalid, 0 Unknown, 0 Unchecked, 6.3s Time] [2022-04-15 06:39:14,675 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 919 states. [2022-04-15 06:39:19,667 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 919 to 762. [2022-04-15 06:39:19,667 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 06:39:19,668 INFO L82 GeneralOperation]: Start isEquivalent. First operand 919 states. Second operand has 762 states, 754 states have (on average 1.110079575596817) internal successors, (837), 755 states have internal predecessors, (837), 4 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-15 06:39:19,669 INFO L74 IsIncluded]: Start isIncluded. First operand 919 states. Second operand has 762 states, 754 states have (on average 1.110079575596817) internal successors, (837), 755 states have internal predecessors, (837), 4 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-15 06:39:19,669 INFO L87 Difference]: Start difference. First operand 919 states. Second operand has 762 states, 754 states have (on average 1.110079575596817) internal successors, (837), 755 states have internal predecessors, (837), 4 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-15 06:39:19,691 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:39:19,691 INFO L93 Difference]: Finished difference Result 919 states and 1025 transitions. [2022-04-15 06:39:19,691 INFO L276 IsEmpty]: Start isEmpty. Operand 919 states and 1025 transitions. [2022-04-15 06:39:19,707 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 06:39:19,707 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 06:39:19,708 INFO L74 IsIncluded]: Start isIncluded. First operand has 762 states, 754 states have (on average 1.110079575596817) internal successors, (837), 755 states have internal predecessors, (837), 4 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) Second operand 919 states. [2022-04-15 06:39:19,709 INFO L87 Difference]: Start difference. First operand has 762 states, 754 states have (on average 1.110079575596817) internal successors, (837), 755 states have internal predecessors, (837), 4 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) Second operand 919 states. [2022-04-15 06:39:19,743 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:39:19,743 INFO L93 Difference]: Finished difference Result 919 states and 1025 transitions. [2022-04-15 06:39:19,744 INFO L276 IsEmpty]: Start isEmpty. Operand 919 states and 1025 transitions. [2022-04-15 06:39:19,744 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 06:39:19,744 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 06:39:19,744 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 06:39:19,744 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 06:39:19,745 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 762 states, 754 states have (on average 1.110079575596817) internal successors, (837), 755 states have internal predecessors, (837), 4 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-15 06:39:19,767 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 762 states to 762 states and 844 transitions. [2022-04-15 06:39:19,767 INFO L78 Accepts]: Start accepts. Automaton has 762 states and 844 transitions. Word has length 134 [2022-04-15 06:39:19,767 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 06:39:19,767 INFO L478 AbstractCegarLoop]: Abstraction has 762 states and 844 transitions. [2022-04-15 06:39:19,767 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 90 states, 90 states have (on average 1.4444444444444444) internal successors, (130), 88 states have internal predecessors, (130), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:39:19,768 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 762 states and 844 transitions. [2022-04-15 06:39:23,460 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 844 edges. 844 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 06:39:23,461 INFO L276 IsEmpty]: Start isEmpty. Operand 762 states and 844 transitions. [2022-04-15 06:39:23,462 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2022-04-15 06:39:23,462 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 06:39:23,462 INFO L499 BasicCegarLoop]: trace histogram [38, 38, 36, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 06:39:23,478 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (58)] Forceful destruction successful, exit code 0 [2022-04-15 06:39:23,678 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable61,58 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 06:39:23,679 INFO L403 AbstractCegarLoop]: === Iteration 63 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 06:39:23,679 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 06:39:23,679 INFO L85 PathProgramCache]: Analyzing trace with hash -718368346, now seen corresponding path program 18 times [2022-04-15 06:39:23,679 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 06:39:23,679 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [874547577] [2022-04-15 06:39:24,028 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 4 AssignedVariables, 1 ReadonlyVariables, Eigenvalues: {-1={1=1}, 0={1=2}, 1={1=1, 2=1}}, 0 SequentialAcceleration, 1 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-15 06:39:24,028 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-15 06:39:24,028 INFO L85 PathProgramCache]: Analyzing trace with hash 960217912, now seen corresponding path program 1 times [2022-04-15 06:39:24,028 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 06:39:24,028 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1913221548] [2022-04-15 06:39:24,029 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 06:39:24,029 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 06:39:24,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:39:24,268 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 06:39:24,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:39:24,271 INFO L290 TraceCheckUtils]: 0: Hoare triple {155384#(and (= ~last~0 |old(~last~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(11, 2);call #Ultimate.allocInit(12, 3);~last~0 := 0; {155359#true} is VALID [2022-04-15 06:39:24,271 INFO L290 TraceCheckUtils]: 1: Hoare triple {155359#true} assume true; {155359#true} is VALID [2022-04-15 06:39:24,271 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {155359#true} {155359#true} #66#return; {155359#true} is VALID [2022-04-15 06:39:24,271 INFO L272 TraceCheckUtils]: 0: Hoare triple {155359#true} call ULTIMATE.init(); {155384#(and (= ~last~0 |old(~last~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 06:39:24,271 INFO L290 TraceCheckUtils]: 1: Hoare triple {155384#(and (= ~last~0 |old(~last~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(11, 2);call #Ultimate.allocInit(12, 3);~last~0 := 0; {155359#true} is VALID [2022-04-15 06:39:24,271 INFO L290 TraceCheckUtils]: 2: Hoare triple {155359#true} assume true; {155359#true} is VALID [2022-04-15 06:39:24,271 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {155359#true} {155359#true} #66#return; {155359#true} is VALID [2022-04-15 06:39:24,271 INFO L272 TraceCheckUtils]: 4: Hoare triple {155359#true} call #t~ret6 := main(); {155359#true} is VALID [2022-04-15 06:39:24,272 INFO L290 TraceCheckUtils]: 5: Hoare triple {155359#true} assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~last~0 := #t~nondet4;havoc #t~nondet4;~a~0 := 0;~b~0 := 0;~c~0 := 0;~st~0 := 0; {155359#true} is VALID [2022-04-15 06:39:24,272 INFO L290 TraceCheckUtils]: 6: Hoare triple {155359#true} [272] L30-->L23-3_primed: Formula: (let ((.cse0 (= |v_main_#t~post5_963| |v_main_#t~post5_944|)) (.cse1 (= v_main_~a~0_293 v_main_~a~0_292)) (.cse2 (= v_main_~c~0_2375 v_main_~c~0_2355)) (.cse3 (= v_main_~st~0_563 v_main_~st~0_561))) (or (and .cse0 (= v_main_~b~0_290 v_main_~b~0_289) .cse1 .cse2 .cse3) (and .cse0 .cse1 .cse2 .cse3 (= v_main_~b~0_289 v_main_~b~0_290)))) InVars {main_~c~0=v_main_~c~0_2375, main_#t~post5=|v_main_#t~post5_963|, main_~st~0=v_main_~st~0_563, main_~b~0=v_main_~b~0_290, main_~a~0=v_main_~a~0_293} OutVars{main_~c~0=v_main_~c~0_2355, main_#t~post5=|v_main_#t~post5_944|, main_~st~0=v_main_~st~0_561, main_~b~0=v_main_~b~0_289, main_~a~0=v_main_~a~0_292} AuxVars[] AssignedVars[main_~c~0, main_#t~post5, main_~st~0, main_~b~0, main_~a~0] {155359#true} is VALID [2022-04-15 06:39:24,272 INFO L290 TraceCheckUtils]: 7: Hoare triple {155359#true} [271] L23-3_primed-->L23-3: Formula: (and (= v_main_~c~0_7 0) (= v_main_~st~0_6 1)) InVars {} OutVars{main_~c~0=v_main_~c~0_7, main_~st~0=v_main_~st~0_6} AuxVars[] AssignedVars[main_~c~0, main_~st~0] {155364#(= main_~c~0 0)} is VALID [2022-04-15 06:39:24,272 INFO L290 TraceCheckUtils]: 8: Hoare triple {155364#(= main_~c~0 0)} assume !!(~c~0 < 200000); {155364#(= main_~c~0 0)} is VALID [2022-04-15 06:39:24,272 INFO L290 TraceCheckUtils]: 9: Hoare triple {155364#(= main_~c~0 0)} assume ~c~0 == ~last~0;~st~0 := 0; {155364#(= main_~c~0 0)} is VALID [2022-04-15 06:39:24,273 INFO L290 TraceCheckUtils]: 10: Hoare triple {155364#(= main_~c~0 0)} #t~post5 := ~c~0;~c~0 := 1 + #t~post5;havoc #t~post5; {155365#(<= main_~c~0 1)} is VALID [2022-04-15 06:39:24,273 INFO L290 TraceCheckUtils]: 11: Hoare triple {155365#(<= main_~c~0 1)} assume !!(~c~0 < 200000); {155365#(<= main_~c~0 1)} is VALID [2022-04-15 06:39:24,273 INFO L290 TraceCheckUtils]: 12: Hoare triple {155365#(<= main_~c~0 1)} assume !(~c~0 == ~last~0); {155365#(<= main_~c~0 1)} is VALID [2022-04-15 06:39:24,274 INFO L290 TraceCheckUtils]: 13: Hoare triple {155365#(<= main_~c~0 1)} #t~post5 := ~c~0;~c~0 := 1 + #t~post5;havoc #t~post5; {155366#(<= main_~c~0 2)} is VALID [2022-04-15 06:39:24,274 INFO L290 TraceCheckUtils]: 14: Hoare triple {155366#(<= main_~c~0 2)} assume !!(~c~0 < 200000); {155366#(<= main_~c~0 2)} is VALID [2022-04-15 06:39:24,274 INFO L290 TraceCheckUtils]: 15: Hoare triple {155366#(<= main_~c~0 2)} assume !(~c~0 == ~last~0); {155366#(<= main_~c~0 2)} is VALID [2022-04-15 06:39:24,275 INFO L290 TraceCheckUtils]: 16: Hoare triple {155366#(<= main_~c~0 2)} #t~post5 := ~c~0;~c~0 := 1 + #t~post5;havoc #t~post5; {155367#(<= main_~c~0 3)} is VALID [2022-04-15 06:39:24,275 INFO L290 TraceCheckUtils]: 17: Hoare triple {155367#(<= main_~c~0 3)} assume !!(~c~0 < 200000); {155367#(<= main_~c~0 3)} is VALID [2022-04-15 06:39:24,275 INFO L290 TraceCheckUtils]: 18: Hoare triple {155367#(<= main_~c~0 3)} assume !(~c~0 == ~last~0); {155367#(<= main_~c~0 3)} is VALID [2022-04-15 06:39:24,276 INFO L290 TraceCheckUtils]: 19: Hoare triple {155367#(<= main_~c~0 3)} #t~post5 := ~c~0;~c~0 := 1 + #t~post5;havoc #t~post5; {155368#(<= main_~c~0 4)} is VALID [2022-04-15 06:39:24,276 INFO L290 TraceCheckUtils]: 20: Hoare triple {155368#(<= main_~c~0 4)} assume !!(~c~0 < 200000); {155368#(<= main_~c~0 4)} is VALID [2022-04-15 06:39:24,276 INFO L290 TraceCheckUtils]: 21: Hoare triple {155368#(<= main_~c~0 4)} assume !(~c~0 == ~last~0); {155368#(<= main_~c~0 4)} is VALID [2022-04-15 06:39:24,277 INFO L290 TraceCheckUtils]: 22: Hoare triple {155368#(<= main_~c~0 4)} #t~post5 := ~c~0;~c~0 := 1 + #t~post5;havoc #t~post5; {155369#(<= main_~c~0 5)} is VALID [2022-04-15 06:39:24,277 INFO L290 TraceCheckUtils]: 23: Hoare triple {155369#(<= main_~c~0 5)} assume !!(~c~0 < 200000); {155369#(<= main_~c~0 5)} is VALID [2022-04-15 06:39:24,277 INFO L290 TraceCheckUtils]: 24: Hoare triple {155369#(<= main_~c~0 5)} assume !(~c~0 == ~last~0); {155369#(<= main_~c~0 5)} is VALID [2022-04-15 06:39:24,277 INFO L290 TraceCheckUtils]: 25: Hoare triple {155369#(<= main_~c~0 5)} #t~post5 := ~c~0;~c~0 := 1 + #t~post5;havoc #t~post5; {155370#(<= main_~c~0 6)} is VALID [2022-04-15 06:39:24,278 INFO L290 TraceCheckUtils]: 26: Hoare triple {155370#(<= main_~c~0 6)} assume !!(~c~0 < 200000); {155370#(<= main_~c~0 6)} is VALID [2022-04-15 06:39:24,278 INFO L290 TraceCheckUtils]: 27: Hoare triple {155370#(<= main_~c~0 6)} assume !(~c~0 == ~last~0); {155370#(<= main_~c~0 6)} is VALID [2022-04-15 06:39:24,278 INFO L290 TraceCheckUtils]: 28: Hoare triple {155370#(<= main_~c~0 6)} #t~post5 := ~c~0;~c~0 := 1 + #t~post5;havoc #t~post5; {155371#(<= main_~c~0 7)} is VALID [2022-04-15 06:39:24,279 INFO L290 TraceCheckUtils]: 29: Hoare triple {155371#(<= main_~c~0 7)} assume !!(~c~0 < 200000); {155371#(<= main_~c~0 7)} is VALID [2022-04-15 06:39:24,279 INFO L290 TraceCheckUtils]: 30: Hoare triple {155371#(<= main_~c~0 7)} assume !(~c~0 == ~last~0); {155371#(<= main_~c~0 7)} is VALID [2022-04-15 06:39:24,279 INFO L290 TraceCheckUtils]: 31: Hoare triple {155371#(<= main_~c~0 7)} #t~post5 := ~c~0;~c~0 := 1 + #t~post5;havoc #t~post5; {155372#(<= main_~c~0 8)} is VALID [2022-04-15 06:39:24,280 INFO L290 TraceCheckUtils]: 32: Hoare triple {155372#(<= main_~c~0 8)} assume !!(~c~0 < 200000); {155372#(<= main_~c~0 8)} is VALID [2022-04-15 06:39:24,280 INFO L290 TraceCheckUtils]: 33: Hoare triple {155372#(<= main_~c~0 8)} assume !(~c~0 == ~last~0); {155372#(<= main_~c~0 8)} is VALID [2022-04-15 06:39:24,280 INFO L290 TraceCheckUtils]: 34: Hoare triple {155372#(<= main_~c~0 8)} #t~post5 := ~c~0;~c~0 := 1 + #t~post5;havoc #t~post5; {155373#(<= main_~c~0 9)} is VALID [2022-04-15 06:39:24,280 INFO L290 TraceCheckUtils]: 35: Hoare triple {155373#(<= main_~c~0 9)} assume !!(~c~0 < 200000); {155373#(<= main_~c~0 9)} is VALID [2022-04-15 06:39:24,281 INFO L290 TraceCheckUtils]: 36: Hoare triple {155373#(<= main_~c~0 9)} assume !(~c~0 == ~last~0); {155373#(<= main_~c~0 9)} is VALID [2022-04-15 06:39:24,281 INFO L290 TraceCheckUtils]: 37: Hoare triple {155373#(<= main_~c~0 9)} #t~post5 := ~c~0;~c~0 := 1 + #t~post5;havoc #t~post5; {155374#(<= main_~c~0 10)} is VALID [2022-04-15 06:39:24,281 INFO L290 TraceCheckUtils]: 38: Hoare triple {155374#(<= main_~c~0 10)} assume !!(~c~0 < 200000); {155374#(<= main_~c~0 10)} is VALID [2022-04-15 06:39:24,282 INFO L290 TraceCheckUtils]: 39: Hoare triple {155374#(<= main_~c~0 10)} assume !(~c~0 == ~last~0); {155374#(<= main_~c~0 10)} is VALID [2022-04-15 06:39:24,282 INFO L290 TraceCheckUtils]: 40: Hoare triple {155374#(<= main_~c~0 10)} #t~post5 := ~c~0;~c~0 := 1 + #t~post5;havoc #t~post5; {155375#(<= main_~c~0 11)} is VALID [2022-04-15 06:39:24,282 INFO L290 TraceCheckUtils]: 41: Hoare triple {155375#(<= main_~c~0 11)} assume !!(~c~0 < 200000); {155375#(<= main_~c~0 11)} is VALID [2022-04-15 06:39:24,283 INFO L290 TraceCheckUtils]: 42: Hoare triple {155375#(<= main_~c~0 11)} assume !(~c~0 == ~last~0); {155375#(<= main_~c~0 11)} is VALID [2022-04-15 06:39:24,283 INFO L290 TraceCheckUtils]: 43: Hoare triple {155375#(<= main_~c~0 11)} #t~post5 := ~c~0;~c~0 := 1 + #t~post5;havoc #t~post5; {155376#(<= main_~c~0 12)} is VALID [2022-04-15 06:39:24,283 INFO L290 TraceCheckUtils]: 44: Hoare triple {155376#(<= main_~c~0 12)} assume !!(~c~0 < 200000); {155376#(<= main_~c~0 12)} is VALID [2022-04-15 06:39:24,284 INFO L290 TraceCheckUtils]: 45: Hoare triple {155376#(<= main_~c~0 12)} assume !(~c~0 == ~last~0); {155376#(<= main_~c~0 12)} is VALID [2022-04-15 06:39:24,284 INFO L290 TraceCheckUtils]: 46: Hoare triple {155376#(<= main_~c~0 12)} #t~post5 := ~c~0;~c~0 := 1 + #t~post5;havoc #t~post5; {155377#(<= main_~c~0 13)} is VALID [2022-04-15 06:39:24,284 INFO L290 TraceCheckUtils]: 47: Hoare triple {155377#(<= main_~c~0 13)} assume !!(~c~0 < 200000); {155377#(<= main_~c~0 13)} is VALID [2022-04-15 06:39:24,284 INFO L290 TraceCheckUtils]: 48: Hoare triple {155377#(<= main_~c~0 13)} assume !(~c~0 == ~last~0); {155377#(<= main_~c~0 13)} is VALID [2022-04-15 06:39:24,285 INFO L290 TraceCheckUtils]: 49: Hoare triple {155377#(<= main_~c~0 13)} #t~post5 := ~c~0;~c~0 := 1 + #t~post5;havoc #t~post5; {155378#(<= main_~c~0 14)} is VALID [2022-04-15 06:39:24,285 INFO L290 TraceCheckUtils]: 50: Hoare triple {155378#(<= main_~c~0 14)} assume !!(~c~0 < 200000); {155378#(<= main_~c~0 14)} is VALID [2022-04-15 06:39:24,285 INFO L290 TraceCheckUtils]: 51: Hoare triple {155378#(<= main_~c~0 14)} assume !(~c~0 == ~last~0); {155378#(<= main_~c~0 14)} is VALID [2022-04-15 06:39:24,286 INFO L290 TraceCheckUtils]: 52: Hoare triple {155378#(<= main_~c~0 14)} #t~post5 := ~c~0;~c~0 := 1 + #t~post5;havoc #t~post5; {155379#(<= main_~c~0 15)} is VALID [2022-04-15 06:39:24,286 INFO L290 TraceCheckUtils]: 53: Hoare triple {155379#(<= main_~c~0 15)} assume !!(~c~0 < 200000); {155379#(<= main_~c~0 15)} is VALID [2022-04-15 06:39:24,286 INFO L290 TraceCheckUtils]: 54: Hoare triple {155379#(<= main_~c~0 15)} assume !(~c~0 == ~last~0); {155379#(<= main_~c~0 15)} is VALID [2022-04-15 06:39:24,287 INFO L290 TraceCheckUtils]: 55: Hoare triple {155379#(<= main_~c~0 15)} #t~post5 := ~c~0;~c~0 := 1 + #t~post5;havoc #t~post5; {155380#(<= main_~c~0 16)} is VALID [2022-04-15 06:39:24,287 INFO L290 TraceCheckUtils]: 56: Hoare triple {155380#(<= main_~c~0 16)} assume !!(~c~0 < 200000); {155380#(<= main_~c~0 16)} is VALID [2022-04-15 06:39:24,287 INFO L290 TraceCheckUtils]: 57: Hoare triple {155380#(<= main_~c~0 16)} assume !(~c~0 == ~last~0); {155380#(<= main_~c~0 16)} is VALID [2022-04-15 06:39:24,288 INFO L290 TraceCheckUtils]: 58: Hoare triple {155380#(<= main_~c~0 16)} #t~post5 := ~c~0;~c~0 := 1 + #t~post5;havoc #t~post5; {155381#(<= main_~c~0 17)} is VALID [2022-04-15 06:39:24,288 INFO L290 TraceCheckUtils]: 59: Hoare triple {155381#(<= main_~c~0 17)} assume !!(~c~0 < 200000); {155381#(<= main_~c~0 17)} is VALID [2022-04-15 06:39:24,288 INFO L290 TraceCheckUtils]: 60: Hoare triple {155381#(<= main_~c~0 17)} assume !(~c~0 == ~last~0); {155381#(<= main_~c~0 17)} is VALID [2022-04-15 06:39:24,289 INFO L290 TraceCheckUtils]: 61: Hoare triple {155381#(<= main_~c~0 17)} #t~post5 := ~c~0;~c~0 := 1 + #t~post5;havoc #t~post5; {155382#(<= main_~c~0 18)} is VALID [2022-04-15 06:39:24,289 INFO L290 TraceCheckUtils]: 62: Hoare triple {155382#(<= main_~c~0 18)} assume !!(~c~0 < 200000); {155382#(<= main_~c~0 18)} is VALID [2022-04-15 06:39:24,289 INFO L290 TraceCheckUtils]: 63: Hoare triple {155382#(<= main_~c~0 18)} assume !(~c~0 == ~last~0); {155382#(<= main_~c~0 18)} is VALID [2022-04-15 06:39:24,290 INFO L290 TraceCheckUtils]: 64: Hoare triple {155382#(<= main_~c~0 18)} #t~post5 := ~c~0;~c~0 := 1 + #t~post5;havoc #t~post5; {155383#(<= main_~c~0 19)} is VALID [2022-04-15 06:39:24,290 INFO L290 TraceCheckUtils]: 65: Hoare triple {155383#(<= main_~c~0 19)} assume !(~c~0 < 200000); {155360#false} is VALID [2022-04-15 06:39:24,290 INFO L290 TraceCheckUtils]: 66: Hoare triple {155360#false} assume 0 == ~st~0 && ~c~0 == 1 + ~last~0;~a~0 := 3 + ~a~0;~b~0 := 3 + ~b~0; {155360#false} is VALID [2022-04-15 06:39:24,290 INFO L290 TraceCheckUtils]: 67: Hoare triple {155360#false} assume !(~c~0 == ~last~0 && 0 == ~st~0); {155360#false} is VALID [2022-04-15 06:39:24,290 INFO L272 TraceCheckUtils]: 68: Hoare triple {155360#false} call __VERIFIER_assert((if ~a~0 == ~b~0 && 200000 == ~c~0 then 1 else 0)); {155360#false} is VALID [2022-04-15 06:39:24,290 INFO L290 TraceCheckUtils]: 69: Hoare triple {155360#false} ~cond := #in~cond; {155360#false} is VALID [2022-04-15 06:39:24,290 INFO L290 TraceCheckUtils]: 70: Hoare triple {155360#false} assume 0 == ~cond; {155360#false} is VALID [2022-04-15 06:39:24,290 INFO L290 TraceCheckUtils]: 71: Hoare triple {155360#false} assume !false; {155360#false} is VALID [2022-04-15 06:39:24,291 INFO L134 CoverageAnalysis]: Checked inductivity of 532 backedges. 0 proven. 532 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 06:39:24,291 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 06:39:24,291 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1913221548] [2022-04-15 06:39:24,291 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1913221548] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 06:39:24,291 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1238267798] [2022-04-15 06:39:24,291 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 06:39:24,291 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 06:39:24,291 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 06:39:24,292 INFO L229 MonitoredProcess]: Starting monitored process 59 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-15 06:39:24,293 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (59)] Waiting until timeout for monitored process [2022-04-15 06:39:24,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:39:24,334 INFO L263 TraceCheckSpWp]: Trace formula consists of 162 conjuncts, 21 conjunts are in the unsatisfiable core [2022-04-15 06:39:24,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:39:24,343 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 06:39:24,642 INFO L272 TraceCheckUtils]: 0: Hoare triple {155359#true} call ULTIMATE.init(); {155359#true} is VALID [2022-04-15 06:39:24,642 INFO L290 TraceCheckUtils]: 1: Hoare triple {155359#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(11, 2);call #Ultimate.allocInit(12, 3);~last~0 := 0; {155359#true} is VALID [2022-04-15 06:39:24,642 INFO L290 TraceCheckUtils]: 2: Hoare triple {155359#true} assume true; {155359#true} is VALID [2022-04-15 06:39:24,642 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {155359#true} {155359#true} #66#return; {155359#true} is VALID [2022-04-15 06:39:24,642 INFO L272 TraceCheckUtils]: 4: Hoare triple {155359#true} call #t~ret6 := main(); {155359#true} is VALID [2022-04-15 06:39:24,642 INFO L290 TraceCheckUtils]: 5: Hoare triple {155359#true} assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~last~0 := #t~nondet4;havoc #t~nondet4;~a~0 := 0;~b~0 := 0;~c~0 := 0;~st~0 := 0; {155359#true} is VALID [2022-04-15 06:39:24,642 INFO L290 TraceCheckUtils]: 6: Hoare triple {155359#true} [272] L30-->L23-3_primed: Formula: (let ((.cse0 (= |v_main_#t~post5_963| |v_main_#t~post5_944|)) (.cse1 (= v_main_~a~0_293 v_main_~a~0_292)) (.cse2 (= v_main_~c~0_2375 v_main_~c~0_2355)) (.cse3 (= v_main_~st~0_563 v_main_~st~0_561))) (or (and .cse0 (= v_main_~b~0_290 v_main_~b~0_289) .cse1 .cse2 .cse3) (and .cse0 .cse1 .cse2 .cse3 (= v_main_~b~0_289 v_main_~b~0_290)))) InVars {main_~c~0=v_main_~c~0_2375, main_#t~post5=|v_main_#t~post5_963|, main_~st~0=v_main_~st~0_563, main_~b~0=v_main_~b~0_290, main_~a~0=v_main_~a~0_293} OutVars{main_~c~0=v_main_~c~0_2355, main_#t~post5=|v_main_#t~post5_944|, main_~st~0=v_main_~st~0_561, main_~b~0=v_main_~b~0_289, main_~a~0=v_main_~a~0_292} AuxVars[] AssignedVars[main_~c~0, main_#t~post5, main_~st~0, main_~b~0, main_~a~0] {155359#true} is VALID [2022-04-15 06:39:24,643 INFO L290 TraceCheckUtils]: 7: Hoare triple {155359#true} [271] L23-3_primed-->L23-3: Formula: (and (= v_main_~c~0_7 0) (= v_main_~st~0_6 1)) InVars {} OutVars{main_~c~0=v_main_~c~0_7, main_~st~0=v_main_~st~0_6} AuxVars[] AssignedVars[main_~c~0, main_~st~0] {155409#(<= main_~c~0 0)} is VALID [2022-04-15 06:39:24,643 INFO L290 TraceCheckUtils]: 8: Hoare triple {155409#(<= main_~c~0 0)} assume !!(~c~0 < 200000); {155409#(<= main_~c~0 0)} is VALID [2022-04-15 06:39:24,643 INFO L290 TraceCheckUtils]: 9: Hoare triple {155409#(<= main_~c~0 0)} assume ~c~0 == ~last~0;~st~0 := 0; {155409#(<= main_~c~0 0)} is VALID [2022-04-15 06:39:24,644 INFO L290 TraceCheckUtils]: 10: Hoare triple {155409#(<= main_~c~0 0)} #t~post5 := ~c~0;~c~0 := 1 + #t~post5;havoc #t~post5; {155365#(<= main_~c~0 1)} is VALID [2022-04-15 06:39:24,644 INFO L290 TraceCheckUtils]: 11: Hoare triple {155365#(<= main_~c~0 1)} assume !!(~c~0 < 200000); {155365#(<= main_~c~0 1)} is VALID [2022-04-15 06:39:24,644 INFO L290 TraceCheckUtils]: 12: Hoare triple {155365#(<= main_~c~0 1)} assume !(~c~0 == ~last~0); {155365#(<= main_~c~0 1)} is VALID [2022-04-15 06:39:24,645 INFO L290 TraceCheckUtils]: 13: Hoare triple {155365#(<= main_~c~0 1)} #t~post5 := ~c~0;~c~0 := 1 + #t~post5;havoc #t~post5; {155366#(<= main_~c~0 2)} is VALID [2022-04-15 06:39:24,645 INFO L290 TraceCheckUtils]: 14: Hoare triple {155366#(<= main_~c~0 2)} assume !!(~c~0 < 200000); {155366#(<= main_~c~0 2)} is VALID [2022-04-15 06:39:24,645 INFO L290 TraceCheckUtils]: 15: Hoare triple {155366#(<= main_~c~0 2)} assume !(~c~0 == ~last~0); {155366#(<= main_~c~0 2)} is VALID [2022-04-15 06:39:24,646 INFO L290 TraceCheckUtils]: 16: Hoare triple {155366#(<= main_~c~0 2)} #t~post5 := ~c~0;~c~0 := 1 + #t~post5;havoc #t~post5; {155367#(<= main_~c~0 3)} is VALID [2022-04-15 06:39:24,646 INFO L290 TraceCheckUtils]: 17: Hoare triple {155367#(<= main_~c~0 3)} assume !!(~c~0 < 200000); {155367#(<= main_~c~0 3)} is VALID [2022-04-15 06:39:24,646 INFO L290 TraceCheckUtils]: 18: Hoare triple {155367#(<= main_~c~0 3)} assume !(~c~0 == ~last~0); {155367#(<= main_~c~0 3)} is VALID [2022-04-15 06:39:24,647 INFO L290 TraceCheckUtils]: 19: Hoare triple {155367#(<= main_~c~0 3)} #t~post5 := ~c~0;~c~0 := 1 + #t~post5;havoc #t~post5; {155368#(<= main_~c~0 4)} is VALID [2022-04-15 06:39:24,647 INFO L290 TraceCheckUtils]: 20: Hoare triple {155368#(<= main_~c~0 4)} assume !!(~c~0 < 200000); {155368#(<= main_~c~0 4)} is VALID [2022-04-15 06:39:24,647 INFO L290 TraceCheckUtils]: 21: Hoare triple {155368#(<= main_~c~0 4)} assume !(~c~0 == ~last~0); {155368#(<= main_~c~0 4)} is VALID [2022-04-15 06:39:24,648 INFO L290 TraceCheckUtils]: 22: Hoare triple {155368#(<= main_~c~0 4)} #t~post5 := ~c~0;~c~0 := 1 + #t~post5;havoc #t~post5; {155369#(<= main_~c~0 5)} is VALID [2022-04-15 06:39:24,648 INFO L290 TraceCheckUtils]: 23: Hoare triple {155369#(<= main_~c~0 5)} assume !!(~c~0 < 200000); {155369#(<= main_~c~0 5)} is VALID [2022-04-15 06:39:24,648 INFO L290 TraceCheckUtils]: 24: Hoare triple {155369#(<= main_~c~0 5)} assume !(~c~0 == ~last~0); {155369#(<= main_~c~0 5)} is VALID [2022-04-15 06:39:24,649 INFO L290 TraceCheckUtils]: 25: Hoare triple {155369#(<= main_~c~0 5)} #t~post5 := ~c~0;~c~0 := 1 + #t~post5;havoc #t~post5; {155370#(<= main_~c~0 6)} is VALID [2022-04-15 06:39:24,649 INFO L290 TraceCheckUtils]: 26: Hoare triple {155370#(<= main_~c~0 6)} assume !!(~c~0 < 200000); {155370#(<= main_~c~0 6)} is VALID [2022-04-15 06:39:24,649 INFO L290 TraceCheckUtils]: 27: Hoare triple {155370#(<= main_~c~0 6)} assume !(~c~0 == ~last~0); {155370#(<= main_~c~0 6)} is VALID [2022-04-15 06:39:24,650 INFO L290 TraceCheckUtils]: 28: Hoare triple {155370#(<= main_~c~0 6)} #t~post5 := ~c~0;~c~0 := 1 + #t~post5;havoc #t~post5; {155371#(<= main_~c~0 7)} is VALID [2022-04-15 06:39:24,650 INFO L290 TraceCheckUtils]: 29: Hoare triple {155371#(<= main_~c~0 7)} assume !!(~c~0 < 200000); {155371#(<= main_~c~0 7)} is VALID [2022-04-15 06:39:24,650 INFO L290 TraceCheckUtils]: 30: Hoare triple {155371#(<= main_~c~0 7)} assume !(~c~0 == ~last~0); {155371#(<= main_~c~0 7)} is VALID [2022-04-15 06:39:24,651 INFO L290 TraceCheckUtils]: 31: Hoare triple {155371#(<= main_~c~0 7)} #t~post5 := ~c~0;~c~0 := 1 + #t~post5;havoc #t~post5; {155372#(<= main_~c~0 8)} is VALID [2022-04-15 06:39:24,651 INFO L290 TraceCheckUtils]: 32: Hoare triple {155372#(<= main_~c~0 8)} assume !!(~c~0 < 200000); {155372#(<= main_~c~0 8)} is VALID [2022-04-15 06:39:24,651 INFO L290 TraceCheckUtils]: 33: Hoare triple {155372#(<= main_~c~0 8)} assume !(~c~0 == ~last~0); {155372#(<= main_~c~0 8)} is VALID [2022-04-15 06:39:24,652 INFO L290 TraceCheckUtils]: 34: Hoare triple {155372#(<= main_~c~0 8)} #t~post5 := ~c~0;~c~0 := 1 + #t~post5;havoc #t~post5; {155373#(<= main_~c~0 9)} is VALID [2022-04-15 06:39:24,652 INFO L290 TraceCheckUtils]: 35: Hoare triple {155373#(<= main_~c~0 9)} assume !!(~c~0 < 200000); {155373#(<= main_~c~0 9)} is VALID [2022-04-15 06:39:24,652 INFO L290 TraceCheckUtils]: 36: Hoare triple {155373#(<= main_~c~0 9)} assume !(~c~0 == ~last~0); {155373#(<= main_~c~0 9)} is VALID [2022-04-15 06:39:24,653 INFO L290 TraceCheckUtils]: 37: Hoare triple {155373#(<= main_~c~0 9)} #t~post5 := ~c~0;~c~0 := 1 + #t~post5;havoc #t~post5; {155374#(<= main_~c~0 10)} is VALID [2022-04-15 06:39:24,653 INFO L290 TraceCheckUtils]: 38: Hoare triple {155374#(<= main_~c~0 10)} assume !!(~c~0 < 200000); {155374#(<= main_~c~0 10)} is VALID [2022-04-15 06:39:24,653 INFO L290 TraceCheckUtils]: 39: Hoare triple {155374#(<= main_~c~0 10)} assume !(~c~0 == ~last~0); {155374#(<= main_~c~0 10)} is VALID [2022-04-15 06:39:24,654 INFO L290 TraceCheckUtils]: 40: Hoare triple {155374#(<= main_~c~0 10)} #t~post5 := ~c~0;~c~0 := 1 + #t~post5;havoc #t~post5; {155375#(<= main_~c~0 11)} is VALID [2022-04-15 06:39:24,654 INFO L290 TraceCheckUtils]: 41: Hoare triple {155375#(<= main_~c~0 11)} assume !!(~c~0 < 200000); {155375#(<= main_~c~0 11)} is VALID [2022-04-15 06:39:24,654 INFO L290 TraceCheckUtils]: 42: Hoare triple {155375#(<= main_~c~0 11)} assume !(~c~0 == ~last~0); {155375#(<= main_~c~0 11)} is VALID [2022-04-15 06:39:24,655 INFO L290 TraceCheckUtils]: 43: Hoare triple {155375#(<= main_~c~0 11)} #t~post5 := ~c~0;~c~0 := 1 + #t~post5;havoc #t~post5; {155376#(<= main_~c~0 12)} is VALID [2022-04-15 06:39:24,655 INFO L290 TraceCheckUtils]: 44: Hoare triple {155376#(<= main_~c~0 12)} assume !!(~c~0 < 200000); {155376#(<= main_~c~0 12)} is VALID [2022-04-15 06:39:24,655 INFO L290 TraceCheckUtils]: 45: Hoare triple {155376#(<= main_~c~0 12)} assume !(~c~0 == ~last~0); {155376#(<= main_~c~0 12)} is VALID [2022-04-15 06:39:24,656 INFO L290 TraceCheckUtils]: 46: Hoare triple {155376#(<= main_~c~0 12)} #t~post5 := ~c~0;~c~0 := 1 + #t~post5;havoc #t~post5; {155377#(<= main_~c~0 13)} is VALID [2022-04-15 06:39:24,656 INFO L290 TraceCheckUtils]: 47: Hoare triple {155377#(<= main_~c~0 13)} assume !!(~c~0 < 200000); {155377#(<= main_~c~0 13)} is VALID [2022-04-15 06:39:24,656 INFO L290 TraceCheckUtils]: 48: Hoare triple {155377#(<= main_~c~0 13)} assume !(~c~0 == ~last~0); {155377#(<= main_~c~0 13)} is VALID [2022-04-15 06:39:24,657 INFO L290 TraceCheckUtils]: 49: Hoare triple {155377#(<= main_~c~0 13)} #t~post5 := ~c~0;~c~0 := 1 + #t~post5;havoc #t~post5; {155378#(<= main_~c~0 14)} is VALID [2022-04-15 06:39:24,657 INFO L290 TraceCheckUtils]: 50: Hoare triple {155378#(<= main_~c~0 14)} assume !!(~c~0 < 200000); {155378#(<= main_~c~0 14)} is VALID [2022-04-15 06:39:24,657 INFO L290 TraceCheckUtils]: 51: Hoare triple {155378#(<= main_~c~0 14)} assume !(~c~0 == ~last~0); {155378#(<= main_~c~0 14)} is VALID [2022-04-15 06:39:24,658 INFO L290 TraceCheckUtils]: 52: Hoare triple {155378#(<= main_~c~0 14)} #t~post5 := ~c~0;~c~0 := 1 + #t~post5;havoc #t~post5; {155379#(<= main_~c~0 15)} is VALID [2022-04-15 06:39:24,658 INFO L290 TraceCheckUtils]: 53: Hoare triple {155379#(<= main_~c~0 15)} assume !!(~c~0 < 200000); {155379#(<= main_~c~0 15)} is VALID [2022-04-15 06:39:24,658 INFO L290 TraceCheckUtils]: 54: Hoare triple {155379#(<= main_~c~0 15)} assume !(~c~0 == ~last~0); {155379#(<= main_~c~0 15)} is VALID [2022-04-15 06:39:24,659 INFO L290 TraceCheckUtils]: 55: Hoare triple {155379#(<= main_~c~0 15)} #t~post5 := ~c~0;~c~0 := 1 + #t~post5;havoc #t~post5; {155380#(<= main_~c~0 16)} is VALID [2022-04-15 06:39:24,659 INFO L290 TraceCheckUtils]: 56: Hoare triple {155380#(<= main_~c~0 16)} assume !!(~c~0 < 200000); {155380#(<= main_~c~0 16)} is VALID [2022-04-15 06:39:24,659 INFO L290 TraceCheckUtils]: 57: Hoare triple {155380#(<= main_~c~0 16)} assume !(~c~0 == ~last~0); {155380#(<= main_~c~0 16)} is VALID [2022-04-15 06:39:24,660 INFO L290 TraceCheckUtils]: 58: Hoare triple {155380#(<= main_~c~0 16)} #t~post5 := ~c~0;~c~0 := 1 + #t~post5;havoc #t~post5; {155381#(<= main_~c~0 17)} is VALID [2022-04-15 06:39:24,660 INFO L290 TraceCheckUtils]: 59: Hoare triple {155381#(<= main_~c~0 17)} assume !!(~c~0 < 200000); {155381#(<= main_~c~0 17)} is VALID [2022-04-15 06:39:24,660 INFO L290 TraceCheckUtils]: 60: Hoare triple {155381#(<= main_~c~0 17)} assume !(~c~0 == ~last~0); {155381#(<= main_~c~0 17)} is VALID [2022-04-15 06:39:24,661 INFO L290 TraceCheckUtils]: 61: Hoare triple {155381#(<= main_~c~0 17)} #t~post5 := ~c~0;~c~0 := 1 + #t~post5;havoc #t~post5; {155382#(<= main_~c~0 18)} is VALID [2022-04-15 06:39:24,661 INFO L290 TraceCheckUtils]: 62: Hoare triple {155382#(<= main_~c~0 18)} assume !!(~c~0 < 200000); {155382#(<= main_~c~0 18)} is VALID [2022-04-15 06:39:24,661 INFO L290 TraceCheckUtils]: 63: Hoare triple {155382#(<= main_~c~0 18)} assume !(~c~0 == ~last~0); {155382#(<= main_~c~0 18)} is VALID [2022-04-15 06:39:24,662 INFO L290 TraceCheckUtils]: 64: Hoare triple {155382#(<= main_~c~0 18)} #t~post5 := ~c~0;~c~0 := 1 + #t~post5;havoc #t~post5; {155383#(<= main_~c~0 19)} is VALID [2022-04-15 06:39:24,662 INFO L290 TraceCheckUtils]: 65: Hoare triple {155383#(<= main_~c~0 19)} assume !(~c~0 < 200000); {155360#false} is VALID [2022-04-15 06:39:24,662 INFO L290 TraceCheckUtils]: 66: Hoare triple {155360#false} assume 0 == ~st~0 && ~c~0 == 1 + ~last~0;~a~0 := 3 + ~a~0;~b~0 := 3 + ~b~0; {155360#false} is VALID [2022-04-15 06:39:24,662 INFO L290 TraceCheckUtils]: 67: Hoare triple {155360#false} assume !(~c~0 == ~last~0 && 0 == ~st~0); {155360#false} is VALID [2022-04-15 06:39:24,662 INFO L272 TraceCheckUtils]: 68: Hoare triple {155360#false} call __VERIFIER_assert((if ~a~0 == ~b~0 && 200000 == ~c~0 then 1 else 0)); {155360#false} is VALID [2022-04-15 06:39:24,662 INFO L290 TraceCheckUtils]: 69: Hoare triple {155360#false} ~cond := #in~cond; {155360#false} is VALID [2022-04-15 06:39:24,662 INFO L290 TraceCheckUtils]: 70: Hoare triple {155360#false} assume 0 == ~cond; {155360#false} is VALID [2022-04-15 06:39:24,662 INFO L290 TraceCheckUtils]: 71: Hoare triple {155360#false} assume !false; {155360#false} is VALID [2022-04-15 06:39:24,663 INFO L134 CoverageAnalysis]: Checked inductivity of 532 backedges. 0 proven. 532 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 06:39:24,663 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 06:39:25,434 INFO L290 TraceCheckUtils]: 71: Hoare triple {155360#false} assume !false; {155360#false} is VALID [2022-04-15 06:39:25,434 INFO L290 TraceCheckUtils]: 70: Hoare triple {155360#false} assume 0 == ~cond; {155360#false} is VALID [2022-04-15 06:39:25,434 INFO L290 TraceCheckUtils]: 69: Hoare triple {155360#false} ~cond := #in~cond; {155360#false} is VALID [2022-04-15 06:39:25,434 INFO L272 TraceCheckUtils]: 68: Hoare triple {155360#false} call __VERIFIER_assert((if ~a~0 == ~b~0 && 200000 == ~c~0 then 1 else 0)); {155360#false} is VALID [2022-04-15 06:39:25,434 INFO L290 TraceCheckUtils]: 67: Hoare triple {155360#false} assume !(~c~0 == ~last~0 && 0 == ~st~0); {155360#false} is VALID [2022-04-15 06:39:25,435 INFO L290 TraceCheckUtils]: 66: Hoare triple {155360#false} assume 0 == ~st~0 && ~c~0 == 1 + ~last~0;~a~0 := 3 + ~a~0;~b~0 := 3 + ~b~0; {155360#false} is VALID [2022-04-15 06:39:25,435 INFO L290 TraceCheckUtils]: 65: Hoare triple {155620#(< main_~c~0 200000)} assume !(~c~0 < 200000); {155360#false} is VALID [2022-04-15 06:39:25,435 INFO L290 TraceCheckUtils]: 64: Hoare triple {155624#(< main_~c~0 199999)} #t~post5 := ~c~0;~c~0 := 1 + #t~post5;havoc #t~post5; {155620#(< main_~c~0 200000)} is VALID [2022-04-15 06:39:25,435 INFO L290 TraceCheckUtils]: 63: Hoare triple {155624#(< main_~c~0 199999)} assume !(~c~0 == ~last~0); {155624#(< main_~c~0 199999)} is VALID [2022-04-15 06:39:25,435 INFO L290 TraceCheckUtils]: 62: Hoare triple {155624#(< main_~c~0 199999)} assume !!(~c~0 < 200000); {155624#(< main_~c~0 199999)} is VALID [2022-04-15 06:39:25,436 INFO L290 TraceCheckUtils]: 61: Hoare triple {155634#(< main_~c~0 199998)} #t~post5 := ~c~0;~c~0 := 1 + #t~post5;havoc #t~post5; {155624#(< main_~c~0 199999)} is VALID [2022-04-15 06:39:25,436 INFO L290 TraceCheckUtils]: 60: Hoare triple {155634#(< main_~c~0 199998)} assume !(~c~0 == ~last~0); {155634#(< main_~c~0 199998)} is VALID [2022-04-15 06:39:25,436 INFO L290 TraceCheckUtils]: 59: Hoare triple {155634#(< main_~c~0 199998)} assume !!(~c~0 < 200000); {155634#(< main_~c~0 199998)} is VALID [2022-04-15 06:39:25,437 INFO L290 TraceCheckUtils]: 58: Hoare triple {155644#(< main_~c~0 199997)} #t~post5 := ~c~0;~c~0 := 1 + #t~post5;havoc #t~post5; {155634#(< main_~c~0 199998)} is VALID [2022-04-15 06:39:25,437 INFO L290 TraceCheckUtils]: 57: Hoare triple {155644#(< main_~c~0 199997)} assume !(~c~0 == ~last~0); {155644#(< main_~c~0 199997)} is VALID [2022-04-15 06:39:25,437 INFO L290 TraceCheckUtils]: 56: Hoare triple {155644#(< main_~c~0 199997)} assume !!(~c~0 < 200000); {155644#(< main_~c~0 199997)} is VALID [2022-04-15 06:39:25,437 INFO L290 TraceCheckUtils]: 55: Hoare triple {155654#(< main_~c~0 199996)} #t~post5 := ~c~0;~c~0 := 1 + #t~post5;havoc #t~post5; {155644#(< main_~c~0 199997)} is VALID [2022-04-15 06:39:25,438 INFO L290 TraceCheckUtils]: 54: Hoare triple {155654#(< main_~c~0 199996)} assume !(~c~0 == ~last~0); {155654#(< main_~c~0 199996)} is VALID [2022-04-15 06:39:25,438 INFO L290 TraceCheckUtils]: 53: Hoare triple {155654#(< main_~c~0 199996)} assume !!(~c~0 < 200000); {155654#(< main_~c~0 199996)} is VALID [2022-04-15 06:39:25,438 INFO L290 TraceCheckUtils]: 52: Hoare triple {155664#(< main_~c~0 199995)} #t~post5 := ~c~0;~c~0 := 1 + #t~post5;havoc #t~post5; {155654#(< main_~c~0 199996)} is VALID [2022-04-15 06:39:25,438 INFO L290 TraceCheckUtils]: 51: Hoare triple {155664#(< main_~c~0 199995)} assume !(~c~0 == ~last~0); {155664#(< main_~c~0 199995)} is VALID [2022-04-15 06:39:25,439 INFO L290 TraceCheckUtils]: 50: Hoare triple {155664#(< main_~c~0 199995)} assume !!(~c~0 < 200000); {155664#(< main_~c~0 199995)} is VALID [2022-04-15 06:39:25,439 INFO L290 TraceCheckUtils]: 49: Hoare triple {155674#(< main_~c~0 199994)} #t~post5 := ~c~0;~c~0 := 1 + #t~post5;havoc #t~post5; {155664#(< main_~c~0 199995)} is VALID [2022-04-15 06:39:25,439 INFO L290 TraceCheckUtils]: 48: Hoare triple {155674#(< main_~c~0 199994)} assume !(~c~0 == ~last~0); {155674#(< main_~c~0 199994)} is VALID [2022-04-15 06:39:25,439 INFO L290 TraceCheckUtils]: 47: Hoare triple {155674#(< main_~c~0 199994)} assume !!(~c~0 < 200000); {155674#(< main_~c~0 199994)} is VALID [2022-04-15 06:39:25,440 INFO L290 TraceCheckUtils]: 46: Hoare triple {155684#(< main_~c~0 199993)} #t~post5 := ~c~0;~c~0 := 1 + #t~post5;havoc #t~post5; {155674#(< main_~c~0 199994)} is VALID [2022-04-15 06:39:25,440 INFO L290 TraceCheckUtils]: 45: Hoare triple {155684#(< main_~c~0 199993)} assume !(~c~0 == ~last~0); {155684#(< main_~c~0 199993)} is VALID [2022-04-15 06:39:25,440 INFO L290 TraceCheckUtils]: 44: Hoare triple {155684#(< main_~c~0 199993)} assume !!(~c~0 < 200000); {155684#(< main_~c~0 199993)} is VALID [2022-04-15 06:39:25,440 INFO L290 TraceCheckUtils]: 43: Hoare triple {155694#(< main_~c~0 199992)} #t~post5 := ~c~0;~c~0 := 1 + #t~post5;havoc #t~post5; {155684#(< main_~c~0 199993)} is VALID [2022-04-15 06:39:25,441 INFO L290 TraceCheckUtils]: 42: Hoare triple {155694#(< main_~c~0 199992)} assume !(~c~0 == ~last~0); {155694#(< main_~c~0 199992)} is VALID [2022-04-15 06:39:25,441 INFO L290 TraceCheckUtils]: 41: Hoare triple {155694#(< main_~c~0 199992)} assume !!(~c~0 < 200000); {155694#(< main_~c~0 199992)} is VALID [2022-04-15 06:39:25,441 INFO L290 TraceCheckUtils]: 40: Hoare triple {155704#(< main_~c~0 199991)} #t~post5 := ~c~0;~c~0 := 1 + #t~post5;havoc #t~post5; {155694#(< main_~c~0 199992)} is VALID [2022-04-15 06:39:25,441 INFO L290 TraceCheckUtils]: 39: Hoare triple {155704#(< main_~c~0 199991)} assume !(~c~0 == ~last~0); {155704#(< main_~c~0 199991)} is VALID [2022-04-15 06:39:25,441 INFO L290 TraceCheckUtils]: 38: Hoare triple {155704#(< main_~c~0 199991)} assume !!(~c~0 < 200000); {155704#(< main_~c~0 199991)} is VALID [2022-04-15 06:39:25,442 INFO L290 TraceCheckUtils]: 37: Hoare triple {155714#(< main_~c~0 199990)} #t~post5 := ~c~0;~c~0 := 1 + #t~post5;havoc #t~post5; {155704#(< main_~c~0 199991)} is VALID [2022-04-15 06:39:25,442 INFO L290 TraceCheckUtils]: 36: Hoare triple {155714#(< main_~c~0 199990)} assume !(~c~0 == ~last~0); {155714#(< main_~c~0 199990)} is VALID [2022-04-15 06:39:25,442 INFO L290 TraceCheckUtils]: 35: Hoare triple {155714#(< main_~c~0 199990)} assume !!(~c~0 < 200000); {155714#(< main_~c~0 199990)} is VALID [2022-04-15 06:39:25,443 INFO L290 TraceCheckUtils]: 34: Hoare triple {155724#(< main_~c~0 199989)} #t~post5 := ~c~0;~c~0 := 1 + #t~post5;havoc #t~post5; {155714#(< main_~c~0 199990)} is VALID [2022-04-15 06:39:25,443 INFO L290 TraceCheckUtils]: 33: Hoare triple {155724#(< main_~c~0 199989)} assume !(~c~0 == ~last~0); {155724#(< main_~c~0 199989)} is VALID [2022-04-15 06:39:25,443 INFO L290 TraceCheckUtils]: 32: Hoare triple {155724#(< main_~c~0 199989)} assume !!(~c~0 < 200000); {155724#(< main_~c~0 199989)} is VALID [2022-04-15 06:39:25,443 INFO L290 TraceCheckUtils]: 31: Hoare triple {155734#(< main_~c~0 199988)} #t~post5 := ~c~0;~c~0 := 1 + #t~post5;havoc #t~post5; {155724#(< main_~c~0 199989)} is VALID [2022-04-15 06:39:25,443 INFO L290 TraceCheckUtils]: 30: Hoare triple {155734#(< main_~c~0 199988)} assume !(~c~0 == ~last~0); {155734#(< main_~c~0 199988)} is VALID [2022-04-15 06:39:25,444 INFO L290 TraceCheckUtils]: 29: Hoare triple {155734#(< main_~c~0 199988)} assume !!(~c~0 < 200000); {155734#(< main_~c~0 199988)} is VALID [2022-04-15 06:39:25,444 INFO L290 TraceCheckUtils]: 28: Hoare triple {155744#(< main_~c~0 199987)} #t~post5 := ~c~0;~c~0 := 1 + #t~post5;havoc #t~post5; {155734#(< main_~c~0 199988)} is VALID [2022-04-15 06:39:25,444 INFO L290 TraceCheckUtils]: 27: Hoare triple {155744#(< main_~c~0 199987)} assume !(~c~0 == ~last~0); {155744#(< main_~c~0 199987)} is VALID [2022-04-15 06:39:25,444 INFO L290 TraceCheckUtils]: 26: Hoare triple {155744#(< main_~c~0 199987)} assume !!(~c~0 < 200000); {155744#(< main_~c~0 199987)} is VALID [2022-04-15 06:39:25,445 INFO L290 TraceCheckUtils]: 25: Hoare triple {155754#(< main_~c~0 199986)} #t~post5 := ~c~0;~c~0 := 1 + #t~post5;havoc #t~post5; {155744#(< main_~c~0 199987)} is VALID [2022-04-15 06:39:25,445 INFO L290 TraceCheckUtils]: 24: Hoare triple {155754#(< main_~c~0 199986)} assume !(~c~0 == ~last~0); {155754#(< main_~c~0 199986)} is VALID [2022-04-15 06:39:25,445 INFO L290 TraceCheckUtils]: 23: Hoare triple {155754#(< main_~c~0 199986)} assume !!(~c~0 < 200000); {155754#(< main_~c~0 199986)} is VALID [2022-04-15 06:39:25,446 INFO L290 TraceCheckUtils]: 22: Hoare triple {155764#(< main_~c~0 199985)} #t~post5 := ~c~0;~c~0 := 1 + #t~post5;havoc #t~post5; {155754#(< main_~c~0 199986)} is VALID [2022-04-15 06:39:25,446 INFO L290 TraceCheckUtils]: 21: Hoare triple {155764#(< main_~c~0 199985)} assume !(~c~0 == ~last~0); {155764#(< main_~c~0 199985)} is VALID [2022-04-15 06:39:25,446 INFO L290 TraceCheckUtils]: 20: Hoare triple {155764#(< main_~c~0 199985)} assume !!(~c~0 < 200000); {155764#(< main_~c~0 199985)} is VALID [2022-04-15 06:39:25,446 INFO L290 TraceCheckUtils]: 19: Hoare triple {155774#(< main_~c~0 199984)} #t~post5 := ~c~0;~c~0 := 1 + #t~post5;havoc #t~post5; {155764#(< main_~c~0 199985)} is VALID [2022-04-15 06:39:25,446 INFO L290 TraceCheckUtils]: 18: Hoare triple {155774#(< main_~c~0 199984)} assume !(~c~0 == ~last~0); {155774#(< main_~c~0 199984)} is VALID [2022-04-15 06:39:25,447 INFO L290 TraceCheckUtils]: 17: Hoare triple {155774#(< main_~c~0 199984)} assume !!(~c~0 < 200000); {155774#(< main_~c~0 199984)} is VALID [2022-04-15 06:39:25,447 INFO L290 TraceCheckUtils]: 16: Hoare triple {155784#(< main_~c~0 199983)} #t~post5 := ~c~0;~c~0 := 1 + #t~post5;havoc #t~post5; {155774#(< main_~c~0 199984)} is VALID [2022-04-15 06:39:25,447 INFO L290 TraceCheckUtils]: 15: Hoare triple {155784#(< main_~c~0 199983)} assume !(~c~0 == ~last~0); {155784#(< main_~c~0 199983)} is VALID [2022-04-15 06:39:25,447 INFO L290 TraceCheckUtils]: 14: Hoare triple {155784#(< main_~c~0 199983)} assume !!(~c~0 < 200000); {155784#(< main_~c~0 199983)} is VALID [2022-04-15 06:39:25,448 INFO L290 TraceCheckUtils]: 13: Hoare triple {155794#(< main_~c~0 199982)} #t~post5 := ~c~0;~c~0 := 1 + #t~post5;havoc #t~post5; {155784#(< main_~c~0 199983)} is VALID [2022-04-15 06:39:25,448 INFO L290 TraceCheckUtils]: 12: Hoare triple {155794#(< main_~c~0 199982)} assume !(~c~0 == ~last~0); {155794#(< main_~c~0 199982)} is VALID [2022-04-15 06:39:25,448 INFO L290 TraceCheckUtils]: 11: Hoare triple {155794#(< main_~c~0 199982)} assume !!(~c~0 < 200000); {155794#(< main_~c~0 199982)} is VALID [2022-04-15 06:39:25,448 INFO L290 TraceCheckUtils]: 10: Hoare triple {155804#(< main_~c~0 199981)} #t~post5 := ~c~0;~c~0 := 1 + #t~post5;havoc #t~post5; {155794#(< main_~c~0 199982)} is VALID [2022-04-15 06:39:25,449 INFO L290 TraceCheckUtils]: 9: Hoare triple {155804#(< main_~c~0 199981)} assume ~c~0 == ~last~0;~st~0 := 0; {155804#(< main_~c~0 199981)} is VALID [2022-04-15 06:39:25,449 INFO L290 TraceCheckUtils]: 8: Hoare triple {155804#(< main_~c~0 199981)} assume !!(~c~0 < 200000); {155804#(< main_~c~0 199981)} is VALID [2022-04-15 06:39:25,449 INFO L290 TraceCheckUtils]: 7: Hoare triple {155359#true} [271] L23-3_primed-->L23-3: Formula: (and (= v_main_~c~0_7 0) (= v_main_~st~0_6 1)) InVars {} OutVars{main_~c~0=v_main_~c~0_7, main_~st~0=v_main_~st~0_6} AuxVars[] AssignedVars[main_~c~0, main_~st~0] {155804#(< main_~c~0 199981)} is VALID [2022-04-15 06:39:25,449 INFO L290 TraceCheckUtils]: 6: Hoare triple {155359#true} [272] L30-->L23-3_primed: Formula: (let ((.cse0 (= |v_main_#t~post5_963| |v_main_#t~post5_944|)) (.cse1 (= v_main_~a~0_293 v_main_~a~0_292)) (.cse2 (= v_main_~c~0_2375 v_main_~c~0_2355)) (.cse3 (= v_main_~st~0_563 v_main_~st~0_561))) (or (and .cse0 (= v_main_~b~0_290 v_main_~b~0_289) .cse1 .cse2 .cse3) (and .cse0 .cse1 .cse2 .cse3 (= v_main_~b~0_289 v_main_~b~0_290)))) InVars {main_~c~0=v_main_~c~0_2375, main_#t~post5=|v_main_#t~post5_963|, main_~st~0=v_main_~st~0_563, main_~b~0=v_main_~b~0_290, main_~a~0=v_main_~a~0_293} OutVars{main_~c~0=v_main_~c~0_2355, main_#t~post5=|v_main_#t~post5_944|, main_~st~0=v_main_~st~0_561, main_~b~0=v_main_~b~0_289, main_~a~0=v_main_~a~0_292} AuxVars[] AssignedVars[main_~c~0, main_#t~post5, main_~st~0, main_~b~0, main_~a~0] {155359#true} is VALID [2022-04-15 06:39:25,449 INFO L290 TraceCheckUtils]: 5: Hoare triple {155359#true} assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~last~0 := #t~nondet4;havoc #t~nondet4;~a~0 := 0;~b~0 := 0;~c~0 := 0;~st~0 := 0; {155359#true} is VALID [2022-04-15 06:39:25,449 INFO L272 TraceCheckUtils]: 4: Hoare triple {155359#true} call #t~ret6 := main(); {155359#true} is VALID [2022-04-15 06:39:25,449 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {155359#true} {155359#true} #66#return; {155359#true} is VALID [2022-04-15 06:39:25,449 INFO L290 TraceCheckUtils]: 2: Hoare triple {155359#true} assume true; {155359#true} is VALID [2022-04-15 06:39:25,450 INFO L290 TraceCheckUtils]: 1: Hoare triple {155359#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(11, 2);call #Ultimate.allocInit(12, 3);~last~0 := 0; {155359#true} is VALID [2022-04-15 06:39:25,450 INFO L272 TraceCheckUtils]: 0: Hoare triple {155359#true} call ULTIMATE.init(); {155359#true} is VALID [2022-04-15 06:39:25,450 INFO L134 CoverageAnalysis]: Checked inductivity of 532 backedges. 0 proven. 532 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 06:39:25,450 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1238267798] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 06:39:25,450 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 06:39:25,450 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 22, 22] total 44 [2022-04-15 06:39:25,939 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 06:39:25,939 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [874547577] [2022-04-15 06:39:25,940 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [874547577] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 06:39:25,941 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 06:39:25,941 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [44] imperfect sequences [] total 44 [2022-04-15 06:39:25,941 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1685069168] [2022-04-15 06:39:25,941 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 06:39:25,941 INFO L78 Accepts]: Start accepts. Automaton has has 44 states, 44 states have (on average 2.9318181818181817) internal successors, (129), 43 states have internal predecessors, (129), 2 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 137 [2022-04-15 06:39:25,942 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 06:39:25,942 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 44 states, 44 states have (on average 2.9318181818181817) internal successors, (129), 43 states have internal predecessors, (129), 2 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-15 06:39:26,004 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 134 edges. 134 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 06:39:26,004 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 44 states [2022-04-15 06:39:26,004 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 06:39:26,005 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2022-04-15 06:39:26,005 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1599, Invalid=2561, Unknown=0, NotChecked=0, Total=4160 [2022-04-15 06:39:26,005 INFO L87 Difference]: Start difference. First operand 762 states and 844 transitions. Second operand has 44 states, 44 states have (on average 2.9318181818181817) internal successors, (129), 43 states have internal predecessors, (129), 2 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-15 06:39:32,705 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:39:32,705 INFO L93 Difference]: Finished difference Result 1116 states and 1249 transitions. [2022-04-15 06:39:32,705 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2022-04-15 06:39:32,705 INFO L78 Accepts]: Start accepts. Automaton has has 44 states, 44 states have (on average 2.9318181818181817) internal successors, (129), 43 states have internal predecessors, (129), 2 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 137 [2022-04-15 06:39:32,705 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 06:39:32,705 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 44 states, 44 states have (on average 2.9318181818181817) internal successors, (129), 43 states have internal predecessors, (129), 2 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-15 06:39:32,706 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 179 transitions. [2022-04-15 06:39:32,706 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 44 states, 44 states have (on average 2.9318181818181817) internal successors, (129), 43 states have internal predecessors, (129), 2 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-15 06:39:32,707 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 179 transitions. [2022-04-15 06:39:32,707 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 44 states and 179 transitions. [2022-04-15 06:39:32,821 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 179 edges. 179 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 06:39:32,855 INFO L225 Difference]: With dead ends: 1116 [2022-04-15 06:39:32,855 INFO L226 Difference]: Without dead ends: 980 [2022-04-15 06:39:32,856 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 241 GetRequests, 149 SyntacticMatches, 29 SemanticMatches, 63 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4141 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=1599, Invalid=2561, Unknown=0, NotChecked=0, Total=4160 [2022-04-15 06:39:32,856 INFO L913 BasicCegarLoop]: 18 mSDtfsCounter, 138 mSDsluCounter, 39 mSDsCounter, 0 mSdLazyCounter, 1110 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 138 SdHoareTripleChecker+Valid, 57 SdHoareTripleChecker+Invalid, 1135 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 1110 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-04-15 06:39:32,857 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [138 Valid, 57 Invalid, 1135 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 1110 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-04-15 06:39:32,857 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 980 states. [2022-04-15 06:39:38,787 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 980 to 824. [2022-04-15 06:39:38,788 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 06:39:38,788 INFO L82 GeneralOperation]: Start isEquivalent. First operand 980 states. Second operand has 824 states, 816 states have (on average 1.1041666666666667) internal successors, (901), 817 states have internal predecessors, (901), 4 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-15 06:39:38,789 INFO L74 IsIncluded]: Start isIncluded. First operand 980 states. Second operand has 824 states, 816 states have (on average 1.1041666666666667) internal successors, (901), 817 states have internal predecessors, (901), 4 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-15 06:39:38,789 INFO L87 Difference]: Start difference. First operand 980 states. Second operand has 824 states, 816 states have (on average 1.1041666666666667) internal successors, (901), 817 states have internal predecessors, (901), 4 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-15 06:39:38,813 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:39:38,813 INFO L93 Difference]: Finished difference Result 980 states and 1066 transitions. [2022-04-15 06:39:38,813 INFO L276 IsEmpty]: Start isEmpty. Operand 980 states and 1066 transitions. [2022-04-15 06:39:38,813 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 06:39:38,814 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 06:39:38,814 INFO L74 IsIncluded]: Start isIncluded. First operand has 824 states, 816 states have (on average 1.1041666666666667) internal successors, (901), 817 states have internal predecessors, (901), 4 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) Second operand 980 states. [2022-04-15 06:39:38,814 INFO L87 Difference]: Start difference. First operand has 824 states, 816 states have (on average 1.1041666666666667) internal successors, (901), 817 states have internal predecessors, (901), 4 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) Second operand 980 states. [2022-04-15 06:39:38,838 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:39:38,838 INFO L93 Difference]: Finished difference Result 980 states and 1066 transitions. [2022-04-15 06:39:38,838 INFO L276 IsEmpty]: Start isEmpty. Operand 980 states and 1066 transitions. [2022-04-15 06:39:38,839 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 06:39:38,839 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 06:39:38,839 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 06:39:38,839 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 06:39:38,839 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 824 states, 816 states have (on average 1.1041666666666667) internal successors, (901), 817 states have internal predecessors, (901), 4 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-15 06:39:38,866 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 824 states to 824 states and 908 transitions. [2022-04-15 06:39:38,866 INFO L78 Accepts]: Start accepts. Automaton has 824 states and 908 transitions. Word has length 137 [2022-04-15 06:39:38,866 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 06:39:38,866 INFO L478 AbstractCegarLoop]: Abstraction has 824 states and 908 transitions. [2022-04-15 06:39:38,866 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 44 states, 44 states have (on average 2.9318181818181817) internal successors, (129), 43 states have internal predecessors, (129), 2 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-15 06:39:38,866 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 824 states and 908 transitions. [2022-04-15 06:39:42,936 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 908 edges. 908 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 06:39:42,936 INFO L276 IsEmpty]: Start isEmpty. Operand 824 states and 908 transitions. [2022-04-15 06:39:42,937 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2022-04-15 06:39:42,937 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 06:39:42,937 INFO L499 BasicCegarLoop]: trace histogram [41, 41, 40, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 06:39:42,955 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (59)] Forceful destruction successful, exit code 0 [2022-04-15 06:39:43,144 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 59 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable62 [2022-04-15 06:39:43,144 INFO L403 AbstractCegarLoop]: === Iteration 64 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 06:39:43,144 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 06:39:43,144 INFO L85 PathProgramCache]: Analyzing trace with hash -498486876, now seen corresponding path program 40 times [2022-04-15 06:39:43,144 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 06:39:43,144 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1854162949] [2022-04-15 06:39:47,281 WARN L977 rdanLoopAcceleration]: Unable to prove correctness of quantifier elimination. [2022-04-15 06:39:47,380 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 1 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-15 06:39:47,591 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {0={1=1}, 1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-15 06:39:47,592 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-15 06:39:47,594 INFO L85 PathProgramCache]: Analyzing trace with hash -56451128, now seen corresponding path program 1 times [2022-04-15 06:39:47,594 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 06:39:47,594 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1481556188] [2022-04-15 06:39:47,594 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 06:39:47,594 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 06:39:47,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:39:47,723 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 06:39:47,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:39:47,726 INFO L290 TraceCheckUtils]: 0: Hoare triple {161710#(and (= ~last~0 |old(~last~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(11, 2);call #Ultimate.allocInit(12, 3);~last~0 := 0; {161698#true} is VALID [2022-04-15 06:39:47,726 INFO L290 TraceCheckUtils]: 1: Hoare triple {161698#true} assume true; {161698#true} is VALID [2022-04-15 06:39:47,726 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {161698#true} {161698#true} #66#return; {161698#true} is VALID [2022-04-15 06:39:47,726 INFO L272 TraceCheckUtils]: 0: Hoare triple {161698#true} call ULTIMATE.init(); {161710#(and (= ~last~0 |old(~last~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 06:39:47,726 INFO L290 TraceCheckUtils]: 1: Hoare triple {161710#(and (= ~last~0 |old(~last~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(11, 2);call #Ultimate.allocInit(12, 3);~last~0 := 0; {161698#true} is VALID [2022-04-15 06:39:47,726 INFO L290 TraceCheckUtils]: 2: Hoare triple {161698#true} assume true; {161698#true} is VALID [2022-04-15 06:39:47,726 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {161698#true} {161698#true} #66#return; {161698#true} is VALID [2022-04-15 06:39:47,726 INFO L272 TraceCheckUtils]: 4: Hoare triple {161698#true} call #t~ret6 := main(); {161698#true} is VALID [2022-04-15 06:39:47,727 INFO L290 TraceCheckUtils]: 5: Hoare triple {161698#true} assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~last~0 := #t~nondet4;havoc #t~nondet4;~a~0 := 0;~b~0 := 0;~c~0 := 0;~st~0 := 0; {161703#(and (= main_~a~0 0) (= main_~b~0 0))} is VALID [2022-04-15 06:39:47,727 INFO L290 TraceCheckUtils]: 6: Hoare triple {161703#(and (= main_~a~0 0) (= main_~b~0 0))} assume !false;~st~0 := 1;~c~0 := 0; {161704#(and (= main_~a~0 0) (= main_~st~0 1) (= main_~b~0 0))} is VALID [2022-04-15 06:39:47,728 INFO L290 TraceCheckUtils]: 7: Hoare triple {161704#(and (= main_~a~0 0) (= main_~st~0 1) (= main_~b~0 0))} [274] L23-3-->L23-4_primed: Formula: (let ((.cse0 (= |v_main_#t~post5_986| |v_main_#t~post5_984|)) (.cse1 (= v_~last~0_426 v_main_~c~0_2436))) (or (and (= v_main_~c~0_2436 v_main_~c~0_2435) (= v_~last~0_426 v_~last~0_426) .cse0) (and (or (not (< v_main_~c~0_2436 200000)) .cse1) (= v_main_~c~0_2435 v_main_~c~0_2436) .cse0) (and (or (not (<= (+ v_main_~c~0_2436 1) v_~last~0_426)) (not (<= (+ v_~last~0_426 1) v_main_~c~0_2435))) (< v_main_~c~0_2436 v_main_~c~0_2435) (< v_main_~c~0_2435 200001) (not .cse1)))) InVars {main_~c~0=v_main_~c~0_2436, main_#t~post5=|v_main_#t~post5_986|, ~last~0=v_~last~0_426} OutVars{main_#t~post5=|v_main_#t~post5_984|, main_~c~0=v_main_~c~0_2435, ~last~0=v_~last~0_426} AuxVars[] AssignedVars[main_#t~post5, main_~c~0] {161704#(and (= main_~a~0 0) (= main_~st~0 1) (= main_~b~0 0))} is VALID [2022-04-15 06:39:47,728 INFO L290 TraceCheckUtils]: 8: Hoare triple {161704#(and (= main_~a~0 0) (= main_~st~0 1) (= main_~b~0 0))} [275] L23-4_primed-->L23-3: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {161704#(and (= main_~a~0 0) (= main_~st~0 1) (= main_~b~0 0))} is VALID [2022-04-15 06:39:47,729 INFO L290 TraceCheckUtils]: 9: Hoare triple {161704#(and (= main_~a~0 0) (= main_~st~0 1) (= main_~b~0 0))} [276] L23-3-->L23-4_primed: Formula: (let ((.cse0 (= |v_main_#t~post5_989| |v_main_#t~post5_985|)) (.cse3 (= v_~last~0_427 v_main_~c~0_2438)) (.cse4 (< v_main_~c~0_2438 200000)) (.cse1 (= v_main_~st~0_569 v_main_~st~0_568)) (.cse2 (= v_main_~c~0_2438 v_main_~c~0_2437))) (or (and .cse0 .cse1 (= v_~last~0_427 v_~last~0_427) .cse2) (and (= v_main_~st~0_568 0) .cse3 (<= v_main_~c~0_2437 (+ v_~last~0_427 1)) .cse4 (< v_main_~c~0_2438 v_main_~c~0_2437)) (and .cse0 (or (not .cse3) (not .cse4)) .cse1 .cse2))) InVars {main_~c~0=v_main_~c~0_2438, main_#t~post5=|v_main_#t~post5_989|, main_~st~0=v_main_~st~0_569, ~last~0=v_~last~0_427} OutVars{main_#t~post5=|v_main_#t~post5_985|, main_~c~0=v_main_~c~0_2437, main_~st~0=v_main_~st~0_568, ~last~0=v_~last~0_427} AuxVars[] AssignedVars[main_#t~post5, main_~c~0, main_~st~0] {161705#(or (= main_~st~0 1) (and (= main_~a~0 0) (or (<= ~last~0 199999) (<= main_~c~0 ~last~0)) (= main_~b~0 0)))} is VALID [2022-04-15 06:39:47,729 INFO L290 TraceCheckUtils]: 10: Hoare triple {161705#(or (= main_~st~0 1) (and (= main_~a~0 0) (or (<= ~last~0 199999) (<= main_~c~0 ~last~0)) (= main_~b~0 0)))} [273] L23-4_primed-->L23-4: Formula: (not (< v_main_~c~0_8 200000)) InVars {main_~c~0=v_main_~c~0_8} OutVars{main_~c~0=v_main_~c~0_8} AuxVars[] AssignedVars[] {161706#(or (and (= main_~a~0 0) (= main_~b~0 0) (or (and (<= ~last~0 199999) (< 199999 main_~c~0)) (<= main_~c~0 ~last~0))) (= main_~st~0 1))} is VALID [2022-04-15 06:39:47,730 INFO L290 TraceCheckUtils]: 11: Hoare triple {161706#(or (and (= main_~a~0 0) (= main_~b~0 0) (or (and (<= ~last~0 199999) (< 199999 main_~c~0)) (<= main_~c~0 ~last~0))) (= main_~st~0 1))} assume 0 == ~st~0 && ~c~0 == 1 + ~last~0;~a~0 := 3 + ~a~0;~b~0 := 3 + ~b~0; {161707#(and (<= main_~b~0 main_~a~0) (< main_~a~0 (+ main_~b~0 1)) (< 199999 main_~c~0) (<= main_~c~0 200000))} is VALID [2022-04-15 06:39:47,730 INFO L290 TraceCheckUtils]: 12: Hoare triple {161707#(and (<= main_~b~0 main_~a~0) (< main_~a~0 (+ main_~b~0 1)) (< 199999 main_~c~0) (<= main_~c~0 200000))} assume !(~c~0 == ~last~0 && 0 == ~st~0); {161707#(and (<= main_~b~0 main_~a~0) (< main_~a~0 (+ main_~b~0 1)) (< 199999 main_~c~0) (<= main_~c~0 200000))} is VALID [2022-04-15 06:39:47,731 INFO L272 TraceCheckUtils]: 13: Hoare triple {161707#(and (<= main_~b~0 main_~a~0) (< main_~a~0 (+ main_~b~0 1)) (< 199999 main_~c~0) (<= main_~c~0 200000))} call __VERIFIER_assert((if ~a~0 == ~b~0 && 200000 == ~c~0 then 1 else 0)); {161708#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-15 06:39:47,731 INFO L290 TraceCheckUtils]: 14: Hoare triple {161708#(not (= |__VERIFIER_assert_#in~cond| 0))} ~cond := #in~cond; {161709#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-15 06:39:47,731 INFO L290 TraceCheckUtils]: 15: Hoare triple {161709#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {161699#false} is VALID [2022-04-15 06:39:47,732 INFO L290 TraceCheckUtils]: 16: Hoare triple {161699#false} assume !false; {161699#false} is VALID [2022-04-15 06:39:47,732 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-04-15 06:39:47,732 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 06:39:47,732 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1481556188] [2022-04-15 06:39:47,732 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1481556188] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 06:39:47,732 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [118043625] [2022-04-15 06:39:47,732 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 06:39:47,732 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 06:39:47,732 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 06:39:47,733 INFO L229 MonitoredProcess]: Starting monitored process 60 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-15 06:39:47,734 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (60)] Waiting until timeout for monitored process [2022-04-15 06:39:47,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:39:47,763 INFO L263 TraceCheckSpWp]: Trace formula consists of 85 conjuncts, 18 conjunts are in the unsatisfiable core [2022-04-15 06:39:47,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:39:47,769 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 06:39:48,031 INFO L272 TraceCheckUtils]: 0: Hoare triple {161698#true} call ULTIMATE.init(); {161698#true} is VALID [2022-04-15 06:39:48,031 INFO L290 TraceCheckUtils]: 1: Hoare triple {161698#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(11, 2);call #Ultimate.allocInit(12, 3);~last~0 := 0; {161698#true} is VALID [2022-04-15 06:39:48,031 INFO L290 TraceCheckUtils]: 2: Hoare triple {161698#true} assume true; {161698#true} is VALID [2022-04-15 06:39:48,031 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {161698#true} {161698#true} #66#return; {161698#true} is VALID [2022-04-15 06:39:48,031 INFO L272 TraceCheckUtils]: 4: Hoare triple {161698#true} call #t~ret6 := main(); {161698#true} is VALID [2022-04-15 06:39:48,031 INFO L290 TraceCheckUtils]: 5: Hoare triple {161698#true} assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~last~0 := #t~nondet4;havoc #t~nondet4;~a~0 := 0;~b~0 := 0;~c~0 := 0;~st~0 := 0; {161703#(and (= main_~a~0 0) (= main_~b~0 0))} is VALID [2022-04-15 06:39:48,032 INFO L290 TraceCheckUtils]: 6: Hoare triple {161703#(and (= main_~a~0 0) (= main_~b~0 0))} assume !false;~st~0 := 1;~c~0 := 0; {161704#(and (= main_~a~0 0) (= main_~st~0 1) (= main_~b~0 0))} is VALID [2022-04-15 06:39:48,032 INFO L290 TraceCheckUtils]: 7: Hoare triple {161704#(and (= main_~a~0 0) (= main_~st~0 1) (= main_~b~0 0))} [274] L23-3-->L23-4_primed: Formula: (let ((.cse0 (= |v_main_#t~post5_986| |v_main_#t~post5_984|)) (.cse1 (= v_~last~0_426 v_main_~c~0_2436))) (or (and (= v_main_~c~0_2436 v_main_~c~0_2435) (= v_~last~0_426 v_~last~0_426) .cse0) (and (or (not (< v_main_~c~0_2436 200000)) .cse1) (= v_main_~c~0_2435 v_main_~c~0_2436) .cse0) (and (or (not (<= (+ v_main_~c~0_2436 1) v_~last~0_426)) (not (<= (+ v_~last~0_426 1) v_main_~c~0_2435))) (< v_main_~c~0_2436 v_main_~c~0_2435) (< v_main_~c~0_2435 200001) (not .cse1)))) InVars {main_~c~0=v_main_~c~0_2436, main_#t~post5=|v_main_#t~post5_986|, ~last~0=v_~last~0_426} OutVars{main_#t~post5=|v_main_#t~post5_984|, main_~c~0=v_main_~c~0_2435, ~last~0=v_~last~0_426} AuxVars[] AssignedVars[main_#t~post5, main_~c~0] {161704#(and (= main_~a~0 0) (= main_~st~0 1) (= main_~b~0 0))} is VALID [2022-04-15 06:39:48,032 INFO L290 TraceCheckUtils]: 8: Hoare triple {161704#(and (= main_~a~0 0) (= main_~st~0 1) (= main_~b~0 0))} [275] L23-4_primed-->L23-3: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {161704#(and (= main_~a~0 0) (= main_~st~0 1) (= main_~b~0 0))} is VALID [2022-04-15 06:39:48,033 INFO L290 TraceCheckUtils]: 9: Hoare triple {161704#(and (= main_~a~0 0) (= main_~st~0 1) (= main_~b~0 0))} [276] L23-3-->L23-4_primed: Formula: (let ((.cse0 (= |v_main_#t~post5_989| |v_main_#t~post5_985|)) (.cse3 (= v_~last~0_427 v_main_~c~0_2438)) (.cse4 (< v_main_~c~0_2438 200000)) (.cse1 (= v_main_~st~0_569 v_main_~st~0_568)) (.cse2 (= v_main_~c~0_2438 v_main_~c~0_2437))) (or (and .cse0 .cse1 (= v_~last~0_427 v_~last~0_427) .cse2) (and (= v_main_~st~0_568 0) .cse3 (<= v_main_~c~0_2437 (+ v_~last~0_427 1)) .cse4 (< v_main_~c~0_2438 v_main_~c~0_2437)) (and .cse0 (or (not .cse3) (not .cse4)) .cse1 .cse2))) InVars {main_~c~0=v_main_~c~0_2438, main_#t~post5=|v_main_#t~post5_989|, main_~st~0=v_main_~st~0_569, ~last~0=v_~last~0_427} OutVars{main_#t~post5=|v_main_#t~post5_985|, main_~c~0=v_main_~c~0_2437, main_~st~0=v_main_~st~0_568, ~last~0=v_~last~0_427} AuxVars[] AssignedVars[main_#t~post5, main_~c~0, main_~st~0] {161741#(and (= main_~a~0 0) (= main_~b~0 0) (or (and (< ~last~0 200000) (< ~last~0 main_~c~0) (<= main_~c~0 (+ ~last~0 1)) (= main_~st~0 0)) (= main_~st~0 1)))} is VALID [2022-04-15 06:39:48,033 INFO L290 TraceCheckUtils]: 10: Hoare triple {161741#(and (= main_~a~0 0) (= main_~b~0 0) (or (and (< ~last~0 200000) (< ~last~0 main_~c~0) (<= main_~c~0 (+ ~last~0 1)) (= main_~st~0 0)) (= main_~st~0 1)))} [273] L23-4_primed-->L23-4: Formula: (not (< v_main_~c~0_8 200000)) InVars {main_~c~0=v_main_~c~0_8} OutVars{main_~c~0=v_main_~c~0_8} AuxVars[] AssignedVars[] {161745#(and (= main_~a~0 0) (or (= main_~st~0 1) (and (< ~last~0 200000) (<= main_~c~0 (+ ~last~0 1)) (= main_~st~0 0))) (= main_~b~0 0) (not (< main_~c~0 200000)))} is VALID [2022-04-15 06:39:48,034 INFO L290 TraceCheckUtils]: 11: Hoare triple {161745#(and (= main_~a~0 0) (or (= main_~st~0 1) (and (< ~last~0 200000) (<= main_~c~0 (+ ~last~0 1)) (= main_~st~0 0))) (= main_~b~0 0) (not (< main_~c~0 200000)))} assume 0 == ~st~0 && ~c~0 == 1 + ~last~0;~a~0 := 3 + ~a~0;~b~0 := 3 + ~b~0; {161749#(and (= main_~b~0 3) (<= 200000 main_~c~0) (< main_~c~0 200001) (= main_~a~0 3))} is VALID [2022-04-15 06:39:48,034 INFO L290 TraceCheckUtils]: 12: Hoare triple {161749#(and (= main_~b~0 3) (<= 200000 main_~c~0) (< main_~c~0 200001) (= main_~a~0 3))} assume !(~c~0 == ~last~0 && 0 == ~st~0); {161749#(and (= main_~b~0 3) (<= 200000 main_~c~0) (< main_~c~0 200001) (= main_~a~0 3))} is VALID [2022-04-15 06:39:48,035 INFO L272 TraceCheckUtils]: 13: Hoare triple {161749#(and (= main_~b~0 3) (<= 200000 main_~c~0) (< main_~c~0 200001) (= main_~a~0 3))} call __VERIFIER_assert((if ~a~0 == ~b~0 && 200000 == ~c~0 then 1 else 0)); {161756#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-15 06:39:48,035 INFO L290 TraceCheckUtils]: 14: Hoare triple {161756#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {161760#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-15 06:39:48,035 INFO L290 TraceCheckUtils]: 15: Hoare triple {161760#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {161699#false} is VALID [2022-04-15 06:39:48,035 INFO L290 TraceCheckUtils]: 16: Hoare triple {161699#false} assume !false; {161699#false} is VALID [2022-04-15 06:39:48,035 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-04-15 06:39:48,036 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 06:39:48,322 INFO L290 TraceCheckUtils]: 16: Hoare triple {161699#false} assume !false; {161699#false} is VALID [2022-04-15 06:39:48,323 INFO L290 TraceCheckUtils]: 15: Hoare triple {161760#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {161699#false} is VALID [2022-04-15 06:39:48,323 INFO L290 TraceCheckUtils]: 14: Hoare triple {161756#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {161760#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-15 06:39:48,323 INFO L272 TraceCheckUtils]: 13: Hoare triple {161707#(and (<= main_~b~0 main_~a~0) (< main_~a~0 (+ main_~b~0 1)) (< 199999 main_~c~0) (<= main_~c~0 200000))} call __VERIFIER_assert((if ~a~0 == ~b~0 && 200000 == ~c~0 then 1 else 0)); {161756#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-15 06:39:48,324 INFO L290 TraceCheckUtils]: 12: Hoare triple {161707#(and (<= main_~b~0 main_~a~0) (< main_~a~0 (+ main_~b~0 1)) (< 199999 main_~c~0) (<= main_~c~0 200000))} assume !(~c~0 == ~last~0 && 0 == ~st~0); {161707#(and (<= main_~b~0 main_~a~0) (< main_~a~0 (+ main_~b~0 1)) (< 199999 main_~c~0) (<= main_~c~0 200000))} is VALID [2022-04-15 06:39:48,324 INFO L290 TraceCheckUtils]: 11: Hoare triple {161782#(or (not (<= main_~c~0 (+ ~last~0 1))) (and (<= main_~b~0 main_~a~0) (< main_~a~0 (+ main_~b~0 1)) (< 199999 main_~c~0) (<= main_~c~0 200000)) (not (= main_~st~0 0)))} assume 0 == ~st~0 && ~c~0 == 1 + ~last~0;~a~0 := 3 + ~a~0;~b~0 := 3 + ~b~0; {161707#(and (<= main_~b~0 main_~a~0) (< main_~a~0 (+ main_~b~0 1)) (< 199999 main_~c~0) (<= main_~c~0 200000))} is VALID [2022-04-15 06:39:48,325 INFO L290 TraceCheckUtils]: 10: Hoare triple {161786#(or (not (<= main_~c~0 (+ ~last~0 1))) (and (<= main_~b~0 main_~a~0) (< main_~a~0 (+ main_~b~0 1)) (<= main_~c~0 200000)) (not (= main_~st~0 0)) (< main_~c~0 200000))} [273] L23-4_primed-->L23-4: Formula: (not (< v_main_~c~0_8 200000)) InVars {main_~c~0=v_main_~c~0_8} OutVars{main_~c~0=v_main_~c~0_8} AuxVars[] AssignedVars[] {161782#(or (not (<= main_~c~0 (+ ~last~0 1))) (and (<= main_~b~0 main_~a~0) (< main_~a~0 (+ main_~b~0 1)) (< 199999 main_~c~0) (<= main_~c~0 200000)) (not (= main_~st~0 0)))} is VALID [2022-04-15 06:39:48,325 INFO L290 TraceCheckUtils]: 9: Hoare triple {161790#(and (<= main_~b~0 main_~a~0) (< main_~a~0 (+ main_~b~0 1)) (not (= main_~st~0 0)))} [276] L23-3-->L23-4_primed: Formula: (let ((.cse0 (= |v_main_#t~post5_989| |v_main_#t~post5_985|)) (.cse3 (= v_~last~0_427 v_main_~c~0_2438)) (.cse4 (< v_main_~c~0_2438 200000)) (.cse1 (= v_main_~st~0_569 v_main_~st~0_568)) (.cse2 (= v_main_~c~0_2438 v_main_~c~0_2437))) (or (and .cse0 .cse1 (= v_~last~0_427 v_~last~0_427) .cse2) (and (= v_main_~st~0_568 0) .cse3 (<= v_main_~c~0_2437 (+ v_~last~0_427 1)) .cse4 (< v_main_~c~0_2438 v_main_~c~0_2437)) (and .cse0 (or (not .cse3) (not .cse4)) .cse1 .cse2))) InVars {main_~c~0=v_main_~c~0_2438, main_#t~post5=|v_main_#t~post5_989|, main_~st~0=v_main_~st~0_569, ~last~0=v_~last~0_427} OutVars{main_#t~post5=|v_main_#t~post5_985|, main_~c~0=v_main_~c~0_2437, main_~st~0=v_main_~st~0_568, ~last~0=v_~last~0_427} AuxVars[] AssignedVars[main_#t~post5, main_~c~0, main_~st~0] {161786#(or (not (<= main_~c~0 (+ ~last~0 1))) (and (<= main_~b~0 main_~a~0) (< main_~a~0 (+ main_~b~0 1)) (<= main_~c~0 200000)) (not (= main_~st~0 0)) (< main_~c~0 200000))} is VALID [2022-04-15 06:39:48,326 INFO L290 TraceCheckUtils]: 8: Hoare triple {161790#(and (<= main_~b~0 main_~a~0) (< main_~a~0 (+ main_~b~0 1)) (not (= main_~st~0 0)))} [275] L23-4_primed-->L23-3: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {161790#(and (<= main_~b~0 main_~a~0) (< main_~a~0 (+ main_~b~0 1)) (not (= main_~st~0 0)))} is VALID [2022-04-15 06:39:48,326 INFO L290 TraceCheckUtils]: 7: Hoare triple {161790#(and (<= main_~b~0 main_~a~0) (< main_~a~0 (+ main_~b~0 1)) (not (= main_~st~0 0)))} [274] L23-3-->L23-4_primed: Formula: (let ((.cse0 (= |v_main_#t~post5_986| |v_main_#t~post5_984|)) (.cse1 (= v_~last~0_426 v_main_~c~0_2436))) (or (and (= v_main_~c~0_2436 v_main_~c~0_2435) (= v_~last~0_426 v_~last~0_426) .cse0) (and (or (not (< v_main_~c~0_2436 200000)) .cse1) (= v_main_~c~0_2435 v_main_~c~0_2436) .cse0) (and (or (not (<= (+ v_main_~c~0_2436 1) v_~last~0_426)) (not (<= (+ v_~last~0_426 1) v_main_~c~0_2435))) (< v_main_~c~0_2436 v_main_~c~0_2435) (< v_main_~c~0_2435 200001) (not .cse1)))) InVars {main_~c~0=v_main_~c~0_2436, main_#t~post5=|v_main_#t~post5_986|, ~last~0=v_~last~0_426} OutVars{main_#t~post5=|v_main_#t~post5_984|, main_~c~0=v_main_~c~0_2435, ~last~0=v_~last~0_426} AuxVars[] AssignedVars[main_#t~post5, main_~c~0] {161790#(and (<= main_~b~0 main_~a~0) (< main_~a~0 (+ main_~b~0 1)) (not (= main_~st~0 0)))} is VALID [2022-04-15 06:39:48,326 INFO L290 TraceCheckUtils]: 6: Hoare triple {161800#(and (<= main_~b~0 main_~a~0) (< main_~a~0 (+ main_~b~0 1)))} assume !false;~st~0 := 1;~c~0 := 0; {161790#(and (<= main_~b~0 main_~a~0) (< main_~a~0 (+ main_~b~0 1)) (not (= main_~st~0 0)))} is VALID [2022-04-15 06:39:48,328 INFO L290 TraceCheckUtils]: 5: Hoare triple {161698#true} assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~last~0 := #t~nondet4;havoc #t~nondet4;~a~0 := 0;~b~0 := 0;~c~0 := 0;~st~0 := 0; {161800#(and (<= main_~b~0 main_~a~0) (< main_~a~0 (+ main_~b~0 1)))} is VALID [2022-04-15 06:39:48,329 INFO L272 TraceCheckUtils]: 4: Hoare triple {161698#true} call #t~ret6 := main(); {161698#true} is VALID [2022-04-15 06:39:48,329 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {161698#true} {161698#true} #66#return; {161698#true} is VALID [2022-04-15 06:39:48,329 INFO L290 TraceCheckUtils]: 2: Hoare triple {161698#true} assume true; {161698#true} is VALID [2022-04-15 06:39:48,329 INFO L290 TraceCheckUtils]: 1: Hoare triple {161698#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(11, 2);call #Ultimate.allocInit(12, 3);~last~0 := 0; {161698#true} is VALID [2022-04-15 06:39:48,329 INFO L272 TraceCheckUtils]: 0: Hoare triple {161698#true} call ULTIMATE.init(); {161698#true} is VALID [2022-04-15 06:39:48,329 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-04-15 06:39:48,329 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [118043625] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 06:39:48,329 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 06:39:48,329 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9, 9] total 19 [2022-04-15 06:39:51,563 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 06:39:51,563 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1854162949] [2022-04-15 06:39:51,563 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1854162949] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 06:39:51,563 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 06:39:51,563 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [92] imperfect sequences [] total 92 [2022-04-15 06:39:51,563 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [413817432] [2022-04-15 06:39:51,563 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 06:39:51,564 INFO L78 Accepts]: Start accepts. Automaton has has 92 states, 92 states have (on average 1.4456521739130435) internal successors, (133), 90 states have internal predecessors, (133), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 137 [2022-04-15 06:39:51,564 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 06:39:51,564 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 92 states, 92 states have (on average 1.4456521739130435) internal successors, (133), 90 states have internal predecessors, (133), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:39:51,633 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 137 edges. 137 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 06:39:51,633 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 92 states [2022-04-15 06:39:51,634 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 06:39:51,635 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 92 interpolants. [2022-04-15 06:39:51,635 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=694, Invalid=9608, Unknown=0, NotChecked=0, Total=10302 [2022-04-15 06:39:51,636 INFO L87 Difference]: Start difference. First operand 824 states and 908 transitions. Second operand has 92 states, 92 states have (on average 1.4456521739130435) internal successors, (133), 90 states have internal predecessors, (133), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:40:11,029 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:40:11,029 INFO L93 Difference]: Finished difference Result 1141 states and 1277 transitions. [2022-04-15 06:40:11,029 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 134 states. [2022-04-15 06:40:11,030 INFO L78 Accepts]: Start accepts. Automaton has has 92 states, 92 states have (on average 1.4456521739130435) internal successors, (133), 90 states have internal predecessors, (133), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 137 [2022-04-15 06:40:11,030 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 06:40:11,030 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 92 states, 92 states have (on average 1.4456521739130435) internal successors, (133), 90 states have internal predecessors, (133), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:40:11,043 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 134 states to 134 states and 276 transitions. [2022-04-15 06:40:11,044 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 92 states, 92 states have (on average 1.4456521739130435) internal successors, (133), 90 states have internal predecessors, (133), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:40:11,046 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 134 states to 134 states and 276 transitions. [2022-04-15 06:40:11,046 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 134 states and 276 transitions. [2022-04-15 06:40:11,210 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 276 edges. 276 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 06:40:11,248 INFO L225 Difference]: With dead ends: 1141 [2022-04-15 06:40:11,248 INFO L226 Difference]: Without dead ends: 1007 [2022-04-15 06:40:11,249 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 213 GetRequests, 67 SyntacticMatches, 2 SemanticMatches, 144 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6046 ImplicationChecksByTransitivity, 5.0s TimeCoverageRelationStatistics Valid=1121, Invalid=20049, Unknown=0, NotChecked=0, Total=21170 [2022-04-15 06:40:11,249 INFO L913 BasicCegarLoop]: 16 mSDtfsCounter, 254 mSDsluCounter, 90 mSDsCounter, 0 mSdLazyCounter, 11417 mSolverCounterSat, 181 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 256 SdHoareTripleChecker+Valid, 106 SdHoareTripleChecker+Invalid, 11598 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 181 IncrementalHoareTripleChecker+Valid, 11417 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6.3s IncrementalHoareTripleChecker+Time [2022-04-15 06:40:11,254 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [256 Valid, 106 Invalid, 11598 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [181 Valid, 11417 Invalid, 0 Unknown, 0 Unchecked, 6.3s Time] [2022-04-15 06:40:11,255 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1007 states. [2022-04-15 06:40:15,314 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1007 to 883. [2022-04-15 06:40:15,314 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 06:40:15,315 INFO L82 GeneralOperation]: Start isEquivalent. First operand 1007 states. Second operand has 883 states, 875 states have (on average 1.0994285714285714) internal successors, (962), 876 states have internal predecessors, (962), 4 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-15 06:40:15,316 INFO L74 IsIncluded]: Start isIncluded. First operand 1007 states. Second operand has 883 states, 875 states have (on average 1.0994285714285714) internal successors, (962), 876 states have internal predecessors, (962), 4 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-15 06:40:15,316 INFO L87 Difference]: Start difference. First operand 1007 states. Second operand has 883 states, 875 states have (on average 1.0994285714285714) internal successors, (962), 876 states have internal predecessors, (962), 4 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-15 06:40:15,342 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:40:15,342 INFO L93 Difference]: Finished difference Result 1007 states and 1116 transitions. [2022-04-15 06:40:15,342 INFO L276 IsEmpty]: Start isEmpty. Operand 1007 states and 1116 transitions. [2022-04-15 06:40:15,342 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 06:40:15,342 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 06:40:15,344 INFO L74 IsIncluded]: Start isIncluded. First operand has 883 states, 875 states have (on average 1.0994285714285714) internal successors, (962), 876 states have internal predecessors, (962), 4 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) Second operand 1007 states. [2022-04-15 06:40:15,345 INFO L87 Difference]: Start difference. First operand has 883 states, 875 states have (on average 1.0994285714285714) internal successors, (962), 876 states have internal predecessors, (962), 4 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) Second operand 1007 states. [2022-04-15 06:40:15,371 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:40:15,372 INFO L93 Difference]: Finished difference Result 1007 states and 1116 transitions. [2022-04-15 06:40:15,372 INFO L276 IsEmpty]: Start isEmpty. Operand 1007 states and 1116 transitions. [2022-04-15 06:40:15,372 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 06:40:15,372 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 06:40:15,373 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 06:40:15,373 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 06:40:15,373 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 883 states, 875 states have (on average 1.0994285714285714) internal successors, (962), 876 states have internal predecessors, (962), 4 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-15 06:40:15,411 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 883 states to 883 states and 969 transitions. [2022-04-15 06:40:15,412 INFO L78 Accepts]: Start accepts. Automaton has 883 states and 969 transitions. Word has length 137 [2022-04-15 06:40:15,412 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 06:40:15,413 INFO L478 AbstractCegarLoop]: Abstraction has 883 states and 969 transitions. [2022-04-15 06:40:15,413 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 92 states, 92 states have (on average 1.4456521739130435) internal successors, (133), 90 states have internal predecessors, (133), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:40:15,413 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 883 states and 969 transitions. [2022-04-15 06:40:19,808 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 969 edges. 969 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 06:40:19,808 INFO L276 IsEmpty]: Start isEmpty. Operand 883 states and 969 transitions. [2022-04-15 06:40:19,810 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2022-04-15 06:40:19,810 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 06:40:19,810 INFO L499 BasicCegarLoop]: trace histogram [42, 42, 41, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 06:40:19,832 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (60)] Forceful destruction successful, exit code 0 [2022-04-15 06:40:20,016 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 60 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable63 [2022-04-15 06:40:20,017 INFO L403 AbstractCegarLoop]: === Iteration 65 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 06:40:20,017 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 06:40:20,017 INFO L85 PathProgramCache]: Analyzing trace with hash 1369883527, now seen corresponding path program 41 times [2022-04-15 06:40:20,017 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 06:40:20,017 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1624786168] [2022-04-15 06:40:24,146 WARN L977 rdanLoopAcceleration]: Unable to prove correctness of quantifier elimination. [2022-04-15 06:40:24,254 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 1 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-15 06:40:24,455 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {0={1=1}, 1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-15 06:40:24,456 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-15 06:40:24,459 INFO L85 PathProgramCache]: Analyzing trace with hash -1846034232, now seen corresponding path program 1 times [2022-04-15 06:40:24,459 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 06:40:24,459 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [300959307] [2022-04-15 06:40:24,459 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 06:40:24,459 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 06:40:24,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:40:24,580 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 06:40:24,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:40:24,583 INFO L290 TraceCheckUtils]: 0: Hoare triple {168066#(and (= ~last~0 |old(~last~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(11, 2);call #Ultimate.allocInit(12, 3);~last~0 := 0; {168054#true} is VALID [2022-04-15 06:40:24,583 INFO L290 TraceCheckUtils]: 1: Hoare triple {168054#true} assume true; {168054#true} is VALID [2022-04-15 06:40:24,583 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {168054#true} {168054#true} #66#return; {168054#true} is VALID [2022-04-15 06:40:24,583 INFO L272 TraceCheckUtils]: 0: Hoare triple {168054#true} call ULTIMATE.init(); {168066#(and (= ~last~0 |old(~last~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 06:40:24,583 INFO L290 TraceCheckUtils]: 1: Hoare triple {168066#(and (= ~last~0 |old(~last~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(11, 2);call #Ultimate.allocInit(12, 3);~last~0 := 0; {168054#true} is VALID [2022-04-15 06:40:24,584 INFO L290 TraceCheckUtils]: 2: Hoare triple {168054#true} assume true; {168054#true} is VALID [2022-04-15 06:40:24,584 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {168054#true} {168054#true} #66#return; {168054#true} is VALID [2022-04-15 06:40:24,584 INFO L272 TraceCheckUtils]: 4: Hoare triple {168054#true} call #t~ret6 := main(); {168054#true} is VALID [2022-04-15 06:40:24,584 INFO L290 TraceCheckUtils]: 5: Hoare triple {168054#true} assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~last~0 := #t~nondet4;havoc #t~nondet4;~a~0 := 0;~b~0 := 0;~c~0 := 0;~st~0 := 0; {168059#(and (= main_~a~0 0) (= main_~b~0 0))} is VALID [2022-04-15 06:40:24,584 INFO L290 TraceCheckUtils]: 6: Hoare triple {168059#(and (= main_~a~0 0) (= main_~b~0 0))} assume !false;~st~0 := 1;~c~0 := 0; {168060#(and (= main_~a~0 0) (= main_~st~0 1) (= main_~b~0 0))} is VALID [2022-04-15 06:40:24,585 INFO L290 TraceCheckUtils]: 7: Hoare triple {168060#(and (= main_~a~0 0) (= main_~st~0 1) (= main_~b~0 0))} [278] L23-3-->L23-4_primed: Formula: (let ((.cse0 (= v_main_~c~0_2494 v_main_~c~0_2493)) (.cse2 (= v_~last~0_434 v_main_~c~0_2494)) (.cse1 (= |v_main_#t~post5_999| |v_main_#t~post5_997|))) (or (and .cse0 (= v_~last~0_434 v_~last~0_434) .cse1) (and (< v_main_~c~0_2493 200001) (< v_main_~c~0_2494 v_main_~c~0_2493) (or (not (<= (+ v_main_~c~0_2494 1) v_~last~0_434)) (not (<= (+ v_~last~0_434 1) v_main_~c~0_2493))) (not .cse2)) (and .cse0 (or (not (< v_main_~c~0_2494 200000)) .cse2) .cse1))) InVars {main_~c~0=v_main_~c~0_2494, main_#t~post5=|v_main_#t~post5_999|, ~last~0=v_~last~0_434} OutVars{main_#t~post5=|v_main_#t~post5_997|, main_~c~0=v_main_~c~0_2493, ~last~0=v_~last~0_434} AuxVars[] AssignedVars[main_#t~post5, main_~c~0] {168060#(and (= main_~a~0 0) (= main_~st~0 1) (= main_~b~0 0))} is VALID [2022-04-15 06:40:24,585 INFO L290 TraceCheckUtils]: 8: Hoare triple {168060#(and (= main_~a~0 0) (= main_~st~0 1) (= main_~b~0 0))} [279] L23-4_primed-->L23-3: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {168060#(and (= main_~a~0 0) (= main_~st~0 1) (= main_~b~0 0))} is VALID [2022-04-15 06:40:24,586 INFO L290 TraceCheckUtils]: 9: Hoare triple {168060#(and (= main_~a~0 0) (= main_~st~0 1) (= main_~b~0 0))} [280] L23-3-->L23-4_primed: Formula: (let ((.cse3 (= v_~last~0_435 v_main_~c~0_2496)) (.cse2 (< v_main_~c~0_2496 200000)) (.cse0 (= v_main_~c~0_2496 v_main_~c~0_2495)) (.cse1 (= |v_main_#t~post5_1002| |v_main_#t~post5_998|)) (.cse4 (= v_main_~st~0_579 v_main_~st~0_578))) (or (and .cse0 .cse1 (or (not .cse2) (not .cse3)) .cse4) (and .cse3 (= v_main_~st~0_578 0) .cse2 (<= v_main_~c~0_2495 (+ v_~last~0_435 1)) (< v_main_~c~0_2496 v_main_~c~0_2495)) (and .cse0 .cse1 (= v_~last~0_435 v_~last~0_435) .cse4))) InVars {main_~c~0=v_main_~c~0_2496, main_#t~post5=|v_main_#t~post5_1002|, main_~st~0=v_main_~st~0_579, ~last~0=v_~last~0_435} OutVars{main_#t~post5=|v_main_#t~post5_998|, main_~c~0=v_main_~c~0_2495, main_~st~0=v_main_~st~0_578, ~last~0=v_~last~0_435} AuxVars[] AssignedVars[main_#t~post5, main_~c~0, main_~st~0] {168061#(or (= main_~st~0 1) (and (= main_~a~0 0) (or (<= ~last~0 199999) (<= main_~c~0 200000)) (= main_~b~0 0)))} is VALID [2022-04-15 06:40:24,587 INFO L290 TraceCheckUtils]: 10: Hoare triple {168061#(or (= main_~st~0 1) (and (= main_~a~0 0) (or (<= ~last~0 199999) (<= main_~c~0 200000)) (= main_~b~0 0)))} [277] L23-4_primed-->L23-4: Formula: (not (< v_main_~c~0_8 200000)) InVars {main_~c~0=v_main_~c~0_8} OutVars{main_~c~0=v_main_~c~0_8} AuxVars[] AssignedVars[] {168062#(or (= main_~st~0 1) (and (= main_~a~0 0) (or (<= ~last~0 199999) (<= main_~c~0 200000)) (= main_~b~0 0) (< 199999 main_~c~0)))} is VALID [2022-04-15 06:40:24,587 INFO L290 TraceCheckUtils]: 11: Hoare triple {168062#(or (= main_~st~0 1) (and (= main_~a~0 0) (or (<= ~last~0 199999) (<= main_~c~0 200000)) (= main_~b~0 0) (< 199999 main_~c~0)))} assume 0 == ~st~0 && ~c~0 == 1 + ~last~0;~a~0 := 3 + ~a~0;~b~0 := 3 + ~b~0; {168063#(and (<= main_~b~0 main_~a~0) (< main_~a~0 (+ main_~b~0 1)) (< 199999 main_~c~0) (<= main_~c~0 200000))} is VALID [2022-04-15 06:40:24,588 INFO L290 TraceCheckUtils]: 12: Hoare triple {168063#(and (<= main_~b~0 main_~a~0) (< main_~a~0 (+ main_~b~0 1)) (< 199999 main_~c~0) (<= main_~c~0 200000))} assume !(~c~0 == ~last~0 && 0 == ~st~0); {168063#(and (<= main_~b~0 main_~a~0) (< main_~a~0 (+ main_~b~0 1)) (< 199999 main_~c~0) (<= main_~c~0 200000))} is VALID [2022-04-15 06:40:24,588 INFO L272 TraceCheckUtils]: 13: Hoare triple {168063#(and (<= main_~b~0 main_~a~0) (< main_~a~0 (+ main_~b~0 1)) (< 199999 main_~c~0) (<= main_~c~0 200000))} call __VERIFIER_assert((if ~a~0 == ~b~0 && 200000 == ~c~0 then 1 else 0)); {168064#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-15 06:40:24,589 INFO L290 TraceCheckUtils]: 14: Hoare triple {168064#(not (= |__VERIFIER_assert_#in~cond| 0))} ~cond := #in~cond; {168065#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-15 06:40:24,589 INFO L290 TraceCheckUtils]: 15: Hoare triple {168065#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {168055#false} is VALID [2022-04-15 06:40:24,589 INFO L290 TraceCheckUtils]: 16: Hoare triple {168055#false} assume !false; {168055#false} is VALID [2022-04-15 06:40:24,589 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-04-15 06:40:24,589 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 06:40:24,589 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [300959307] [2022-04-15 06:40:24,589 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [300959307] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 06:40:24,589 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [271540123] [2022-04-15 06:40:24,590 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 06:40:24,590 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 06:40:24,590 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 06:40:24,590 INFO L229 MonitoredProcess]: Starting monitored process 61 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-15 06:40:24,592 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (61)] Waiting until timeout for monitored process [2022-04-15 06:40:24,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:40:24,622 INFO L263 TraceCheckSpWp]: Trace formula consists of 85 conjuncts, 18 conjunts are in the unsatisfiable core [2022-04-15 06:40:24,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:40:24,629 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 06:40:24,907 INFO L272 TraceCheckUtils]: 0: Hoare triple {168054#true} call ULTIMATE.init(); {168054#true} is VALID [2022-04-15 06:40:24,907 INFO L290 TraceCheckUtils]: 1: Hoare triple {168054#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(11, 2);call #Ultimate.allocInit(12, 3);~last~0 := 0; {168054#true} is VALID [2022-04-15 06:40:24,907 INFO L290 TraceCheckUtils]: 2: Hoare triple {168054#true} assume true; {168054#true} is VALID [2022-04-15 06:40:24,907 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {168054#true} {168054#true} #66#return; {168054#true} is VALID [2022-04-15 06:40:24,907 INFO L272 TraceCheckUtils]: 4: Hoare triple {168054#true} call #t~ret6 := main(); {168054#true} is VALID [2022-04-15 06:40:24,908 INFO L290 TraceCheckUtils]: 5: Hoare triple {168054#true} assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~last~0 := #t~nondet4;havoc #t~nondet4;~a~0 := 0;~b~0 := 0;~c~0 := 0;~st~0 := 0; {168059#(and (= main_~a~0 0) (= main_~b~0 0))} is VALID [2022-04-15 06:40:24,908 INFO L290 TraceCheckUtils]: 6: Hoare triple {168059#(and (= main_~a~0 0) (= main_~b~0 0))} assume !false;~st~0 := 1;~c~0 := 0; {168060#(and (= main_~a~0 0) (= main_~st~0 1) (= main_~b~0 0))} is VALID [2022-04-15 06:40:24,908 INFO L290 TraceCheckUtils]: 7: Hoare triple {168060#(and (= main_~a~0 0) (= main_~st~0 1) (= main_~b~0 0))} [278] L23-3-->L23-4_primed: Formula: (let ((.cse0 (= v_main_~c~0_2494 v_main_~c~0_2493)) (.cse2 (= v_~last~0_434 v_main_~c~0_2494)) (.cse1 (= |v_main_#t~post5_999| |v_main_#t~post5_997|))) (or (and .cse0 (= v_~last~0_434 v_~last~0_434) .cse1) (and (< v_main_~c~0_2493 200001) (< v_main_~c~0_2494 v_main_~c~0_2493) (or (not (<= (+ v_main_~c~0_2494 1) v_~last~0_434)) (not (<= (+ v_~last~0_434 1) v_main_~c~0_2493))) (not .cse2)) (and .cse0 (or (not (< v_main_~c~0_2494 200000)) .cse2) .cse1))) InVars {main_~c~0=v_main_~c~0_2494, main_#t~post5=|v_main_#t~post5_999|, ~last~0=v_~last~0_434} OutVars{main_#t~post5=|v_main_#t~post5_997|, main_~c~0=v_main_~c~0_2493, ~last~0=v_~last~0_434} AuxVars[] AssignedVars[main_#t~post5, main_~c~0] {168060#(and (= main_~a~0 0) (= main_~st~0 1) (= main_~b~0 0))} is VALID [2022-04-15 06:40:24,909 INFO L290 TraceCheckUtils]: 8: Hoare triple {168060#(and (= main_~a~0 0) (= main_~st~0 1) (= main_~b~0 0))} [279] L23-4_primed-->L23-3: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {168060#(and (= main_~a~0 0) (= main_~st~0 1) (= main_~b~0 0))} is VALID [2022-04-15 06:40:24,910 INFO L290 TraceCheckUtils]: 9: Hoare triple {168060#(and (= main_~a~0 0) (= main_~st~0 1) (= main_~b~0 0))} [280] L23-3-->L23-4_primed: Formula: (let ((.cse3 (= v_~last~0_435 v_main_~c~0_2496)) (.cse2 (< v_main_~c~0_2496 200000)) (.cse0 (= v_main_~c~0_2496 v_main_~c~0_2495)) (.cse1 (= |v_main_#t~post5_1002| |v_main_#t~post5_998|)) (.cse4 (= v_main_~st~0_579 v_main_~st~0_578))) (or (and .cse0 .cse1 (or (not .cse2) (not .cse3)) .cse4) (and .cse3 (= v_main_~st~0_578 0) .cse2 (<= v_main_~c~0_2495 (+ v_~last~0_435 1)) (< v_main_~c~0_2496 v_main_~c~0_2495)) (and .cse0 .cse1 (= v_~last~0_435 v_~last~0_435) .cse4))) InVars {main_~c~0=v_main_~c~0_2496, main_#t~post5=|v_main_#t~post5_1002|, main_~st~0=v_main_~st~0_579, ~last~0=v_~last~0_435} OutVars{main_#t~post5=|v_main_#t~post5_998|, main_~c~0=v_main_~c~0_2495, main_~st~0=v_main_~st~0_578, ~last~0=v_~last~0_435} AuxVars[] AssignedVars[main_#t~post5, main_~c~0, main_~st~0] {168097#(and (= main_~a~0 0) (= main_~b~0 0) (or (and (< ~last~0 200000) (< ~last~0 main_~c~0) (<= main_~c~0 (+ ~last~0 1)) (= main_~st~0 0)) (= main_~st~0 1)))} is VALID [2022-04-15 06:40:24,910 INFO L290 TraceCheckUtils]: 10: Hoare triple {168097#(and (= main_~a~0 0) (= main_~b~0 0) (or (and (< ~last~0 200000) (< ~last~0 main_~c~0) (<= main_~c~0 (+ ~last~0 1)) (= main_~st~0 0)) (= main_~st~0 1)))} [277] L23-4_primed-->L23-4: Formula: (not (< v_main_~c~0_8 200000)) InVars {main_~c~0=v_main_~c~0_8} OutVars{main_~c~0=v_main_~c~0_8} AuxVars[] AssignedVars[] {168101#(and (= main_~a~0 0) (or (= main_~st~0 1) (and (< ~last~0 200000) (<= main_~c~0 (+ ~last~0 1)) (= main_~st~0 0))) (= main_~b~0 0) (not (< main_~c~0 200000)))} is VALID [2022-04-15 06:40:24,911 INFO L290 TraceCheckUtils]: 11: Hoare triple {168101#(and (= main_~a~0 0) (or (= main_~st~0 1) (and (< ~last~0 200000) (<= main_~c~0 (+ ~last~0 1)) (= main_~st~0 0))) (= main_~b~0 0) (not (< main_~c~0 200000)))} assume 0 == ~st~0 && ~c~0 == 1 + ~last~0;~a~0 := 3 + ~a~0;~b~0 := 3 + ~b~0; {168105#(and (= main_~b~0 3) (<= 200000 main_~c~0) (< main_~c~0 200001) (= main_~a~0 3))} is VALID [2022-04-15 06:40:24,911 INFO L290 TraceCheckUtils]: 12: Hoare triple {168105#(and (= main_~b~0 3) (<= 200000 main_~c~0) (< main_~c~0 200001) (= main_~a~0 3))} assume !(~c~0 == ~last~0 && 0 == ~st~0); {168105#(and (= main_~b~0 3) (<= 200000 main_~c~0) (< main_~c~0 200001) (= main_~a~0 3))} is VALID [2022-04-15 06:40:24,912 INFO L272 TraceCheckUtils]: 13: Hoare triple {168105#(and (= main_~b~0 3) (<= 200000 main_~c~0) (< main_~c~0 200001) (= main_~a~0 3))} call __VERIFIER_assert((if ~a~0 == ~b~0 && 200000 == ~c~0 then 1 else 0)); {168112#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-15 06:40:24,912 INFO L290 TraceCheckUtils]: 14: Hoare triple {168112#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {168116#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-15 06:40:24,912 INFO L290 TraceCheckUtils]: 15: Hoare triple {168116#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {168055#false} is VALID [2022-04-15 06:40:24,912 INFO L290 TraceCheckUtils]: 16: Hoare triple {168055#false} assume !false; {168055#false} is VALID [2022-04-15 06:40:24,913 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-04-15 06:40:24,913 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 06:40:25,313 INFO L290 TraceCheckUtils]: 16: Hoare triple {168055#false} assume !false; {168055#false} is VALID [2022-04-15 06:40:25,314 INFO L290 TraceCheckUtils]: 15: Hoare triple {168116#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {168055#false} is VALID [2022-04-15 06:40:25,314 INFO L290 TraceCheckUtils]: 14: Hoare triple {168112#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {168116#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-15 06:40:25,315 INFO L272 TraceCheckUtils]: 13: Hoare triple {168063#(and (<= main_~b~0 main_~a~0) (< main_~a~0 (+ main_~b~0 1)) (< 199999 main_~c~0) (<= main_~c~0 200000))} call __VERIFIER_assert((if ~a~0 == ~b~0 && 200000 == ~c~0 then 1 else 0)); {168112#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-15 06:40:25,315 INFO L290 TraceCheckUtils]: 12: Hoare triple {168063#(and (<= main_~b~0 main_~a~0) (< main_~a~0 (+ main_~b~0 1)) (< 199999 main_~c~0) (<= main_~c~0 200000))} assume !(~c~0 == ~last~0 && 0 == ~st~0); {168063#(and (<= main_~b~0 main_~a~0) (< main_~a~0 (+ main_~b~0 1)) (< 199999 main_~c~0) (<= main_~c~0 200000))} is VALID [2022-04-15 06:40:25,316 INFO L290 TraceCheckUtils]: 11: Hoare triple {168138#(or (not (<= main_~c~0 (+ ~last~0 1))) (and (<= main_~b~0 main_~a~0) (< main_~a~0 (+ main_~b~0 1)) (< 199999 main_~c~0) (<= main_~c~0 200000)) (not (= main_~st~0 0)))} assume 0 == ~st~0 && ~c~0 == 1 + ~last~0;~a~0 := 3 + ~a~0;~b~0 := 3 + ~b~0; {168063#(and (<= main_~b~0 main_~a~0) (< main_~a~0 (+ main_~b~0 1)) (< 199999 main_~c~0) (<= main_~c~0 200000))} is VALID [2022-04-15 06:40:25,317 INFO L290 TraceCheckUtils]: 10: Hoare triple {168142#(or (not (<= main_~c~0 (+ ~last~0 1))) (and (<= main_~b~0 main_~a~0) (< main_~a~0 (+ main_~b~0 1)) (<= main_~c~0 200000)) (not (= main_~st~0 0)) (< main_~c~0 200000))} [277] L23-4_primed-->L23-4: Formula: (not (< v_main_~c~0_8 200000)) InVars {main_~c~0=v_main_~c~0_8} OutVars{main_~c~0=v_main_~c~0_8} AuxVars[] AssignedVars[] {168138#(or (not (<= main_~c~0 (+ ~last~0 1))) (and (<= main_~b~0 main_~a~0) (< main_~a~0 (+ main_~b~0 1)) (< 199999 main_~c~0) (<= main_~c~0 200000)) (not (= main_~st~0 0)))} is VALID [2022-04-15 06:40:25,317 INFO L290 TraceCheckUtils]: 9: Hoare triple {168146#(and (<= main_~b~0 main_~a~0) (< main_~a~0 (+ main_~b~0 1)) (not (= main_~st~0 0)))} [280] L23-3-->L23-4_primed: Formula: (let ((.cse3 (= v_~last~0_435 v_main_~c~0_2496)) (.cse2 (< v_main_~c~0_2496 200000)) (.cse0 (= v_main_~c~0_2496 v_main_~c~0_2495)) (.cse1 (= |v_main_#t~post5_1002| |v_main_#t~post5_998|)) (.cse4 (= v_main_~st~0_579 v_main_~st~0_578))) (or (and .cse0 .cse1 (or (not .cse2) (not .cse3)) .cse4) (and .cse3 (= v_main_~st~0_578 0) .cse2 (<= v_main_~c~0_2495 (+ v_~last~0_435 1)) (< v_main_~c~0_2496 v_main_~c~0_2495)) (and .cse0 .cse1 (= v_~last~0_435 v_~last~0_435) .cse4))) InVars {main_~c~0=v_main_~c~0_2496, main_#t~post5=|v_main_#t~post5_1002|, main_~st~0=v_main_~st~0_579, ~last~0=v_~last~0_435} OutVars{main_#t~post5=|v_main_#t~post5_998|, main_~c~0=v_main_~c~0_2495, main_~st~0=v_main_~st~0_578, ~last~0=v_~last~0_435} AuxVars[] AssignedVars[main_#t~post5, main_~c~0, main_~st~0] {168142#(or (not (<= main_~c~0 (+ ~last~0 1))) (and (<= main_~b~0 main_~a~0) (< main_~a~0 (+ main_~b~0 1)) (<= main_~c~0 200000)) (not (= main_~st~0 0)) (< main_~c~0 200000))} is VALID [2022-04-15 06:40:25,318 INFO L290 TraceCheckUtils]: 8: Hoare triple {168146#(and (<= main_~b~0 main_~a~0) (< main_~a~0 (+ main_~b~0 1)) (not (= main_~st~0 0)))} [279] L23-4_primed-->L23-3: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {168146#(and (<= main_~b~0 main_~a~0) (< main_~a~0 (+ main_~b~0 1)) (not (= main_~st~0 0)))} is VALID [2022-04-15 06:40:25,318 INFO L290 TraceCheckUtils]: 7: Hoare triple {168146#(and (<= main_~b~0 main_~a~0) (< main_~a~0 (+ main_~b~0 1)) (not (= main_~st~0 0)))} [278] L23-3-->L23-4_primed: Formula: (let ((.cse0 (= v_main_~c~0_2494 v_main_~c~0_2493)) (.cse2 (= v_~last~0_434 v_main_~c~0_2494)) (.cse1 (= |v_main_#t~post5_999| |v_main_#t~post5_997|))) (or (and .cse0 (= v_~last~0_434 v_~last~0_434) .cse1) (and (< v_main_~c~0_2493 200001) (< v_main_~c~0_2494 v_main_~c~0_2493) (or (not (<= (+ v_main_~c~0_2494 1) v_~last~0_434)) (not (<= (+ v_~last~0_434 1) v_main_~c~0_2493))) (not .cse2)) (and .cse0 (or (not (< v_main_~c~0_2494 200000)) .cse2) .cse1))) InVars {main_~c~0=v_main_~c~0_2494, main_#t~post5=|v_main_#t~post5_999|, ~last~0=v_~last~0_434} OutVars{main_#t~post5=|v_main_#t~post5_997|, main_~c~0=v_main_~c~0_2493, ~last~0=v_~last~0_434} AuxVars[] AssignedVars[main_#t~post5, main_~c~0] {168146#(and (<= main_~b~0 main_~a~0) (< main_~a~0 (+ main_~b~0 1)) (not (= main_~st~0 0)))} is VALID [2022-04-15 06:40:25,319 INFO L290 TraceCheckUtils]: 6: Hoare triple {168156#(and (<= main_~b~0 main_~a~0) (< main_~a~0 (+ main_~b~0 1)))} assume !false;~st~0 := 1;~c~0 := 0; {168146#(and (<= main_~b~0 main_~a~0) (< main_~a~0 (+ main_~b~0 1)) (not (= main_~st~0 0)))} is VALID [2022-04-15 06:40:25,319 INFO L290 TraceCheckUtils]: 5: Hoare triple {168054#true} assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~last~0 := #t~nondet4;havoc #t~nondet4;~a~0 := 0;~b~0 := 0;~c~0 := 0;~st~0 := 0; {168156#(and (<= main_~b~0 main_~a~0) (< main_~a~0 (+ main_~b~0 1)))} is VALID [2022-04-15 06:40:25,319 INFO L272 TraceCheckUtils]: 4: Hoare triple {168054#true} call #t~ret6 := main(); {168054#true} is VALID [2022-04-15 06:40:25,319 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {168054#true} {168054#true} #66#return; {168054#true} is VALID [2022-04-15 06:40:25,319 INFO L290 TraceCheckUtils]: 2: Hoare triple {168054#true} assume true; {168054#true} is VALID [2022-04-15 06:40:25,319 INFO L290 TraceCheckUtils]: 1: Hoare triple {168054#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(11, 2);call #Ultimate.allocInit(12, 3);~last~0 := 0; {168054#true} is VALID [2022-04-15 06:40:25,319 INFO L272 TraceCheckUtils]: 0: Hoare triple {168054#true} call ULTIMATE.init(); {168054#true} is VALID [2022-04-15 06:40:25,319 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-04-15 06:40:25,320 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [271540123] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 06:40:25,320 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 06:40:25,320 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9, 9] total 19 [2022-04-15 06:40:28,767 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 06:40:28,767 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1624786168] [2022-04-15 06:40:28,767 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1624786168] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 06:40:28,767 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 06:40:28,768 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [94] imperfect sequences [] total 94 [2022-04-15 06:40:28,768 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [349016619] [2022-04-15 06:40:28,768 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 06:40:28,768 INFO L78 Accepts]: Start accepts. Automaton has has 94 states, 94 states have (on average 1.446808510638298) internal successors, (136), 92 states have internal predecessors, (136), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 140 [2022-04-15 06:40:28,768 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 06:40:28,768 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 94 states, 94 states have (on average 1.446808510638298) internal successors, (136), 92 states have internal predecessors, (136), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:40:28,834 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 140 edges. 140 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 06:40:28,834 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 94 states [2022-04-15 06:40:28,834 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 06:40:28,835 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 94 interpolants. [2022-04-15 06:40:28,835 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=711, Invalid=10001, Unknown=0, NotChecked=0, Total=10712 [2022-04-15 06:40:28,836 INFO L87 Difference]: Start difference. First operand 883 states and 969 transitions. Second operand has 94 states, 94 states have (on average 1.446808510638298) internal successors, (136), 92 states have internal predecessors, (136), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:40:48,518 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:40:48,519 INFO L93 Difference]: Finished difference Result 1081 states and 1196 transitions. [2022-04-15 06:40:48,519 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 137 states. [2022-04-15 06:40:48,519 INFO L78 Accepts]: Start accepts. Automaton has has 94 states, 94 states have (on average 1.446808510638298) internal successors, (136), 92 states have internal predecessors, (136), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 140 [2022-04-15 06:40:48,519 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 06:40:48,519 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 94 states, 94 states have (on average 1.446808510638298) internal successors, (136), 92 states have internal predecessors, (136), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:40:48,521 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 137 states to 137 states and 280 transitions. [2022-04-15 06:40:48,521 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 94 states, 94 states have (on average 1.446808510638298) internal successors, (136), 92 states have internal predecessors, (136), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:40:48,522 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 137 states to 137 states and 280 transitions. [2022-04-15 06:40:48,522 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 137 states and 280 transitions. [2022-04-15 06:40:48,660 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 280 edges. 280 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 06:40:48,693 INFO L225 Difference]: With dead ends: 1081 [2022-04-15 06:40:48,693 INFO L226 Difference]: Without dead ends: 947 [2022-04-15 06:40:48,694 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 217 GetRequests, 68 SyntacticMatches, 2 SemanticMatches, 147 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6217 ImplicationChecksByTransitivity, 5.2s TimeCoverageRelationStatistics Valid=1148, Invalid=20904, Unknown=0, NotChecked=0, Total=22052 [2022-04-15 06:40:48,694 INFO L913 BasicCegarLoop]: 16 mSDtfsCounter, 246 mSDsluCounter, 102 mSDsCounter, 0 mSdLazyCounter, 12630 mSolverCounterSat, 181 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 248 SdHoareTripleChecker+Valid, 118 SdHoareTripleChecker+Invalid, 12811 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 181 IncrementalHoareTripleChecker+Valid, 12630 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6.7s IncrementalHoareTripleChecker+Time [2022-04-15 06:40:48,694 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [248 Valid, 118 Invalid, 12811 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [181 Valid, 12630 Invalid, 0 Unknown, 0 Unchecked, 6.7s Time] [2022-04-15 06:40:48,699 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 947 states. [2022-04-15 06:40:52,755 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 947 to 886. [2022-04-15 06:40:52,756 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 06:40:52,757 INFO L82 GeneralOperation]: Start isEquivalent. First operand 947 states. Second operand has 886 states, 878 states have (on average 1.1002277904328017) internal successors, (966), 879 states have internal predecessors, (966), 4 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-15 06:40:52,757 INFO L74 IsIncluded]: Start isIncluded. First operand 947 states. Second operand has 886 states, 878 states have (on average 1.1002277904328017) internal successors, (966), 879 states have internal predecessors, (966), 4 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-15 06:40:52,758 INFO L87 Difference]: Start difference. First operand 947 states. Second operand has 886 states, 878 states have (on average 1.1002277904328017) internal successors, (966), 879 states have internal predecessors, (966), 4 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-15 06:40:52,782 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:40:52,782 INFO L93 Difference]: Finished difference Result 947 states and 1036 transitions. [2022-04-15 06:40:52,782 INFO L276 IsEmpty]: Start isEmpty. Operand 947 states and 1036 transitions. [2022-04-15 06:40:52,782 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 06:40:52,782 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 06:40:52,783 INFO L74 IsIncluded]: Start isIncluded. First operand has 886 states, 878 states have (on average 1.1002277904328017) internal successors, (966), 879 states have internal predecessors, (966), 4 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) Second operand 947 states. [2022-04-15 06:40:52,783 INFO L87 Difference]: Start difference. First operand has 886 states, 878 states have (on average 1.1002277904328017) internal successors, (966), 879 states have internal predecessors, (966), 4 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) Second operand 947 states. [2022-04-15 06:40:52,807 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:40:52,807 INFO L93 Difference]: Finished difference Result 947 states and 1036 transitions. [2022-04-15 06:40:52,807 INFO L276 IsEmpty]: Start isEmpty. Operand 947 states and 1036 transitions. [2022-04-15 06:40:52,808 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 06:40:52,808 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 06:40:52,808 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 06:40:52,808 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 06:40:52,809 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 886 states, 878 states have (on average 1.1002277904328017) internal successors, (966), 879 states have internal predecessors, (966), 4 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-15 06:40:52,843 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 886 states to 886 states and 973 transitions. [2022-04-15 06:40:52,843 INFO L78 Accepts]: Start accepts. Automaton has 886 states and 973 transitions. Word has length 140 [2022-04-15 06:40:52,843 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 06:40:52,843 INFO L478 AbstractCegarLoop]: Abstraction has 886 states and 973 transitions. [2022-04-15 06:40:52,844 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 94 states, 94 states have (on average 1.446808510638298) internal successors, (136), 92 states have internal predecessors, (136), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:40:52,844 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 886 states and 973 transitions. [2022-04-15 06:40:56,896 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 973 edges. 973 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 06:40:56,896 INFO L276 IsEmpty]: Start isEmpty. Operand 886 states and 973 transitions. [2022-04-15 06:40:56,897 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2022-04-15 06:40:56,897 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 06:40:56,898 INFO L499 BasicCegarLoop]: trace histogram [40, 40, 38, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 06:40:56,914 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (61)] Forceful destruction successful, exit code 0 [2022-04-15 06:40:57,105 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable64,61 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 06:40:57,105 INFO L403 AbstractCegarLoop]: === Iteration 66 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 06:40:57,105 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 06:40:57,105 INFO L85 PathProgramCache]: Analyzing trace with hash -1447343230, now seen corresponding path program 19 times [2022-04-15 06:40:57,105 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 06:40:57,105 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [744520945] [2022-04-15 06:40:57,420 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 4 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {-1={1=1}, 0={1=2}, 1={2=1}}, 0 SequentialAcceleration, 1 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-15 06:40:57,421 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-15 06:40:57,421 INFO L85 PathProgramCache]: Analyzing trace with hash -823275469, now seen corresponding path program 1 times [2022-04-15 06:40:57,421 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 06:40:57,421 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [786729181] [2022-04-15 06:40:57,421 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 06:40:57,421 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 06:40:57,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:40:57,673 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 06:40:57,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:40:57,676 INFO L290 TraceCheckUtils]: 0: Hoare triple {174206#(and (= ~last~0 |old(~last~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(11, 2);call #Ultimate.allocInit(12, 3);~last~0 := 0; {174180#true} is VALID [2022-04-15 06:40:57,676 INFO L290 TraceCheckUtils]: 1: Hoare triple {174180#true} assume true; {174180#true} is VALID [2022-04-15 06:40:57,676 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {174180#true} {174180#true} #66#return; {174180#true} is VALID [2022-04-15 06:40:57,677 INFO L272 TraceCheckUtils]: 0: Hoare triple {174180#true} call ULTIMATE.init(); {174206#(and (= ~last~0 |old(~last~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 06:40:57,677 INFO L290 TraceCheckUtils]: 1: Hoare triple {174206#(and (= ~last~0 |old(~last~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(11, 2);call #Ultimate.allocInit(12, 3);~last~0 := 0; {174180#true} is VALID [2022-04-15 06:40:57,677 INFO L290 TraceCheckUtils]: 2: Hoare triple {174180#true} assume true; {174180#true} is VALID [2022-04-15 06:40:57,677 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {174180#true} {174180#true} #66#return; {174180#true} is VALID [2022-04-15 06:40:57,677 INFO L272 TraceCheckUtils]: 4: Hoare triple {174180#true} call #t~ret6 := main(); {174180#true} is VALID [2022-04-15 06:40:57,677 INFO L290 TraceCheckUtils]: 5: Hoare triple {174180#true} assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~last~0 := #t~nondet4;havoc #t~nondet4;~a~0 := 0;~b~0 := 0;~c~0 := 0;~st~0 := 0; {174180#true} is VALID [2022-04-15 06:40:57,677 INFO L290 TraceCheckUtils]: 6: Hoare triple {174180#true} [282] L30-->L23-3_primed: Formula: (and (= v_main_~b~0_302 v_main_~b~0_301) (= v_main_~a~0_305 v_main_~a~0_304) (= v_main_~c~0_2575 v_main_~c~0_2554) (= v_main_~st~0_590 v_main_~st~0_588) (= |v_main_#t~post5_1030| |v_main_#t~post5_1010|)) InVars {main_~c~0=v_main_~c~0_2575, main_#t~post5=|v_main_#t~post5_1030|, main_~st~0=v_main_~st~0_590, main_~b~0=v_main_~b~0_302, main_~a~0=v_main_~a~0_305} OutVars{main_~c~0=v_main_~c~0_2554, main_#t~post5=|v_main_#t~post5_1010|, main_~st~0=v_main_~st~0_588, main_~b~0=v_main_~b~0_301, main_~a~0=v_main_~a~0_304} AuxVars[] AssignedVars[main_~c~0, main_#t~post5, main_~st~0, main_~b~0, main_~a~0] {174180#true} is VALID [2022-04-15 06:40:57,677 INFO L290 TraceCheckUtils]: 7: Hoare triple {174180#true} [281] L23-3_primed-->L23-3: Formula: (and (= v_main_~c~0_7 0) (= v_main_~st~0_6 1)) InVars {} OutVars{main_~c~0=v_main_~c~0_7, main_~st~0=v_main_~st~0_6} AuxVars[] AssignedVars[main_~c~0, main_~st~0] {174185#(= main_~c~0 0)} is VALID [2022-04-15 06:40:57,677 INFO L290 TraceCheckUtils]: 8: Hoare triple {174185#(= main_~c~0 0)} assume !!(~c~0 < 200000); {174185#(= main_~c~0 0)} is VALID [2022-04-15 06:40:57,678 INFO L290 TraceCheckUtils]: 9: Hoare triple {174185#(= main_~c~0 0)} assume ~c~0 == ~last~0;~st~0 := 0; {174185#(= main_~c~0 0)} is VALID [2022-04-15 06:40:57,678 INFO L290 TraceCheckUtils]: 10: Hoare triple {174185#(= main_~c~0 0)} #t~post5 := ~c~0;~c~0 := 1 + #t~post5;havoc #t~post5; {174186#(<= main_~c~0 1)} is VALID [2022-04-15 06:40:57,678 INFO L290 TraceCheckUtils]: 11: Hoare triple {174186#(<= main_~c~0 1)} assume !!(~c~0 < 200000); {174186#(<= main_~c~0 1)} is VALID [2022-04-15 06:40:57,679 INFO L290 TraceCheckUtils]: 12: Hoare triple {174186#(<= main_~c~0 1)} assume !(~c~0 == ~last~0); {174186#(<= main_~c~0 1)} is VALID [2022-04-15 06:40:57,679 INFO L290 TraceCheckUtils]: 13: Hoare triple {174186#(<= main_~c~0 1)} #t~post5 := ~c~0;~c~0 := 1 + #t~post5;havoc #t~post5; {174187#(<= main_~c~0 2)} is VALID [2022-04-15 06:40:57,679 INFO L290 TraceCheckUtils]: 14: Hoare triple {174187#(<= main_~c~0 2)} assume !!(~c~0 < 200000); {174187#(<= main_~c~0 2)} is VALID [2022-04-15 06:40:57,680 INFO L290 TraceCheckUtils]: 15: Hoare triple {174187#(<= main_~c~0 2)} assume !(~c~0 == ~last~0); {174187#(<= main_~c~0 2)} is VALID [2022-04-15 06:40:57,680 INFO L290 TraceCheckUtils]: 16: Hoare triple {174187#(<= main_~c~0 2)} #t~post5 := ~c~0;~c~0 := 1 + #t~post5;havoc #t~post5; {174188#(<= main_~c~0 3)} is VALID [2022-04-15 06:40:57,680 INFO L290 TraceCheckUtils]: 17: Hoare triple {174188#(<= main_~c~0 3)} assume !!(~c~0 < 200000); {174188#(<= main_~c~0 3)} is VALID [2022-04-15 06:40:57,680 INFO L290 TraceCheckUtils]: 18: Hoare triple {174188#(<= main_~c~0 3)} assume !(~c~0 == ~last~0); {174188#(<= main_~c~0 3)} is VALID [2022-04-15 06:40:57,681 INFO L290 TraceCheckUtils]: 19: Hoare triple {174188#(<= main_~c~0 3)} #t~post5 := ~c~0;~c~0 := 1 + #t~post5;havoc #t~post5; {174189#(<= main_~c~0 4)} is VALID [2022-04-15 06:40:57,681 INFO L290 TraceCheckUtils]: 20: Hoare triple {174189#(<= main_~c~0 4)} assume !!(~c~0 < 200000); {174189#(<= main_~c~0 4)} is VALID [2022-04-15 06:40:57,681 INFO L290 TraceCheckUtils]: 21: Hoare triple {174189#(<= main_~c~0 4)} assume !(~c~0 == ~last~0); {174189#(<= main_~c~0 4)} is VALID [2022-04-15 06:40:57,682 INFO L290 TraceCheckUtils]: 22: Hoare triple {174189#(<= main_~c~0 4)} #t~post5 := ~c~0;~c~0 := 1 + #t~post5;havoc #t~post5; {174190#(<= main_~c~0 5)} is VALID [2022-04-15 06:40:57,682 INFO L290 TraceCheckUtils]: 23: Hoare triple {174190#(<= main_~c~0 5)} assume !!(~c~0 < 200000); {174190#(<= main_~c~0 5)} is VALID [2022-04-15 06:40:57,682 INFO L290 TraceCheckUtils]: 24: Hoare triple {174190#(<= main_~c~0 5)} assume !(~c~0 == ~last~0); {174190#(<= main_~c~0 5)} is VALID [2022-04-15 06:40:57,683 INFO L290 TraceCheckUtils]: 25: Hoare triple {174190#(<= main_~c~0 5)} #t~post5 := ~c~0;~c~0 := 1 + #t~post5;havoc #t~post5; {174191#(<= main_~c~0 6)} is VALID [2022-04-15 06:40:57,683 INFO L290 TraceCheckUtils]: 26: Hoare triple {174191#(<= main_~c~0 6)} assume !!(~c~0 < 200000); {174191#(<= main_~c~0 6)} is VALID [2022-04-15 06:40:57,683 INFO L290 TraceCheckUtils]: 27: Hoare triple {174191#(<= main_~c~0 6)} assume !(~c~0 == ~last~0); {174191#(<= main_~c~0 6)} is VALID [2022-04-15 06:40:57,684 INFO L290 TraceCheckUtils]: 28: Hoare triple {174191#(<= main_~c~0 6)} #t~post5 := ~c~0;~c~0 := 1 + #t~post5;havoc #t~post5; {174192#(<= main_~c~0 7)} is VALID [2022-04-15 06:40:57,684 INFO L290 TraceCheckUtils]: 29: Hoare triple {174192#(<= main_~c~0 7)} assume !!(~c~0 < 200000); {174192#(<= main_~c~0 7)} is VALID [2022-04-15 06:40:57,684 INFO L290 TraceCheckUtils]: 30: Hoare triple {174192#(<= main_~c~0 7)} assume !(~c~0 == ~last~0); {174192#(<= main_~c~0 7)} is VALID [2022-04-15 06:40:57,685 INFO L290 TraceCheckUtils]: 31: Hoare triple {174192#(<= main_~c~0 7)} #t~post5 := ~c~0;~c~0 := 1 + #t~post5;havoc #t~post5; {174193#(<= main_~c~0 8)} is VALID [2022-04-15 06:40:57,685 INFO L290 TraceCheckUtils]: 32: Hoare triple {174193#(<= main_~c~0 8)} assume !!(~c~0 < 200000); {174193#(<= main_~c~0 8)} is VALID [2022-04-15 06:40:57,685 INFO L290 TraceCheckUtils]: 33: Hoare triple {174193#(<= main_~c~0 8)} assume !(~c~0 == ~last~0); {174193#(<= main_~c~0 8)} is VALID [2022-04-15 06:40:57,685 INFO L290 TraceCheckUtils]: 34: Hoare triple {174193#(<= main_~c~0 8)} #t~post5 := ~c~0;~c~0 := 1 + #t~post5;havoc #t~post5; {174194#(<= main_~c~0 9)} is VALID [2022-04-15 06:40:57,686 INFO L290 TraceCheckUtils]: 35: Hoare triple {174194#(<= main_~c~0 9)} assume !!(~c~0 < 200000); {174194#(<= main_~c~0 9)} is VALID [2022-04-15 06:40:57,686 INFO L290 TraceCheckUtils]: 36: Hoare triple {174194#(<= main_~c~0 9)} assume !(~c~0 == ~last~0); {174194#(<= main_~c~0 9)} is VALID [2022-04-15 06:40:57,686 INFO L290 TraceCheckUtils]: 37: Hoare triple {174194#(<= main_~c~0 9)} #t~post5 := ~c~0;~c~0 := 1 + #t~post5;havoc #t~post5; {174195#(<= main_~c~0 10)} is VALID [2022-04-15 06:40:57,687 INFO L290 TraceCheckUtils]: 38: Hoare triple {174195#(<= main_~c~0 10)} assume !!(~c~0 < 200000); {174195#(<= main_~c~0 10)} is VALID [2022-04-15 06:40:57,687 INFO L290 TraceCheckUtils]: 39: Hoare triple {174195#(<= main_~c~0 10)} assume !(~c~0 == ~last~0); {174195#(<= main_~c~0 10)} is VALID [2022-04-15 06:40:57,687 INFO L290 TraceCheckUtils]: 40: Hoare triple {174195#(<= main_~c~0 10)} #t~post5 := ~c~0;~c~0 := 1 + #t~post5;havoc #t~post5; {174196#(<= main_~c~0 11)} is VALID [2022-04-15 06:40:57,688 INFO L290 TraceCheckUtils]: 41: Hoare triple {174196#(<= main_~c~0 11)} assume !!(~c~0 < 200000); {174196#(<= main_~c~0 11)} is VALID [2022-04-15 06:40:57,688 INFO L290 TraceCheckUtils]: 42: Hoare triple {174196#(<= main_~c~0 11)} assume !(~c~0 == ~last~0); {174196#(<= main_~c~0 11)} is VALID [2022-04-15 06:40:57,688 INFO L290 TraceCheckUtils]: 43: Hoare triple {174196#(<= main_~c~0 11)} #t~post5 := ~c~0;~c~0 := 1 + #t~post5;havoc #t~post5; {174197#(<= main_~c~0 12)} is VALID [2022-04-15 06:40:57,689 INFO L290 TraceCheckUtils]: 44: Hoare triple {174197#(<= main_~c~0 12)} assume !!(~c~0 < 200000); {174197#(<= main_~c~0 12)} is VALID [2022-04-15 06:40:57,689 INFO L290 TraceCheckUtils]: 45: Hoare triple {174197#(<= main_~c~0 12)} assume !(~c~0 == ~last~0); {174197#(<= main_~c~0 12)} is VALID [2022-04-15 06:40:57,689 INFO L290 TraceCheckUtils]: 46: Hoare triple {174197#(<= main_~c~0 12)} #t~post5 := ~c~0;~c~0 := 1 + #t~post5;havoc #t~post5; {174198#(<= main_~c~0 13)} is VALID [2022-04-15 06:40:57,689 INFO L290 TraceCheckUtils]: 47: Hoare triple {174198#(<= main_~c~0 13)} assume !!(~c~0 < 200000); {174198#(<= main_~c~0 13)} is VALID [2022-04-15 06:40:57,690 INFO L290 TraceCheckUtils]: 48: Hoare triple {174198#(<= main_~c~0 13)} assume !(~c~0 == ~last~0); {174198#(<= main_~c~0 13)} is VALID [2022-04-15 06:40:57,690 INFO L290 TraceCheckUtils]: 49: Hoare triple {174198#(<= main_~c~0 13)} #t~post5 := ~c~0;~c~0 := 1 + #t~post5;havoc #t~post5; {174199#(<= main_~c~0 14)} is VALID [2022-04-15 06:40:57,690 INFO L290 TraceCheckUtils]: 50: Hoare triple {174199#(<= main_~c~0 14)} assume !!(~c~0 < 200000); {174199#(<= main_~c~0 14)} is VALID [2022-04-15 06:40:57,691 INFO L290 TraceCheckUtils]: 51: Hoare triple {174199#(<= main_~c~0 14)} assume !(~c~0 == ~last~0); {174199#(<= main_~c~0 14)} is VALID [2022-04-15 06:40:57,691 INFO L290 TraceCheckUtils]: 52: Hoare triple {174199#(<= main_~c~0 14)} #t~post5 := ~c~0;~c~0 := 1 + #t~post5;havoc #t~post5; {174200#(<= main_~c~0 15)} is VALID [2022-04-15 06:40:57,691 INFO L290 TraceCheckUtils]: 53: Hoare triple {174200#(<= main_~c~0 15)} assume !!(~c~0 < 200000); {174200#(<= main_~c~0 15)} is VALID [2022-04-15 06:40:57,692 INFO L290 TraceCheckUtils]: 54: Hoare triple {174200#(<= main_~c~0 15)} assume !(~c~0 == ~last~0); {174200#(<= main_~c~0 15)} is VALID [2022-04-15 06:40:57,692 INFO L290 TraceCheckUtils]: 55: Hoare triple {174200#(<= main_~c~0 15)} #t~post5 := ~c~0;~c~0 := 1 + #t~post5;havoc #t~post5; {174201#(<= main_~c~0 16)} is VALID [2022-04-15 06:40:57,692 INFO L290 TraceCheckUtils]: 56: Hoare triple {174201#(<= main_~c~0 16)} assume !!(~c~0 < 200000); {174201#(<= main_~c~0 16)} is VALID [2022-04-15 06:40:57,693 INFO L290 TraceCheckUtils]: 57: Hoare triple {174201#(<= main_~c~0 16)} assume !(~c~0 == ~last~0); {174201#(<= main_~c~0 16)} is VALID [2022-04-15 06:40:57,693 INFO L290 TraceCheckUtils]: 58: Hoare triple {174201#(<= main_~c~0 16)} #t~post5 := ~c~0;~c~0 := 1 + #t~post5;havoc #t~post5; {174202#(<= main_~c~0 17)} is VALID [2022-04-15 06:40:57,694 INFO L290 TraceCheckUtils]: 59: Hoare triple {174202#(<= main_~c~0 17)} assume !!(~c~0 < 200000); {174202#(<= main_~c~0 17)} is VALID [2022-04-15 06:40:57,694 INFO L290 TraceCheckUtils]: 60: Hoare triple {174202#(<= main_~c~0 17)} assume !(~c~0 == ~last~0); {174202#(<= main_~c~0 17)} is VALID [2022-04-15 06:40:57,694 INFO L290 TraceCheckUtils]: 61: Hoare triple {174202#(<= main_~c~0 17)} #t~post5 := ~c~0;~c~0 := 1 + #t~post5;havoc #t~post5; {174203#(<= main_~c~0 18)} is VALID [2022-04-15 06:40:57,694 INFO L290 TraceCheckUtils]: 62: Hoare triple {174203#(<= main_~c~0 18)} assume !!(~c~0 < 200000); {174203#(<= main_~c~0 18)} is VALID [2022-04-15 06:40:57,695 INFO L290 TraceCheckUtils]: 63: Hoare triple {174203#(<= main_~c~0 18)} assume !(~c~0 == ~last~0); {174203#(<= main_~c~0 18)} is VALID [2022-04-15 06:40:57,695 INFO L290 TraceCheckUtils]: 64: Hoare triple {174203#(<= main_~c~0 18)} #t~post5 := ~c~0;~c~0 := 1 + #t~post5;havoc #t~post5; {174204#(<= main_~c~0 19)} is VALID [2022-04-15 06:40:57,695 INFO L290 TraceCheckUtils]: 65: Hoare triple {174204#(<= main_~c~0 19)} assume !!(~c~0 < 200000); {174204#(<= main_~c~0 19)} is VALID [2022-04-15 06:40:57,696 INFO L290 TraceCheckUtils]: 66: Hoare triple {174204#(<= main_~c~0 19)} assume !(~c~0 == ~last~0); {174204#(<= main_~c~0 19)} is VALID [2022-04-15 06:40:57,696 INFO L290 TraceCheckUtils]: 67: Hoare triple {174204#(<= main_~c~0 19)} #t~post5 := ~c~0;~c~0 := 1 + #t~post5;havoc #t~post5; {174205#(<= main_~c~0 20)} is VALID [2022-04-15 06:40:57,696 INFO L290 TraceCheckUtils]: 68: Hoare triple {174205#(<= main_~c~0 20)} assume !(~c~0 < 200000); {174181#false} is VALID [2022-04-15 06:40:57,696 INFO L290 TraceCheckUtils]: 69: Hoare triple {174181#false} assume 0 == ~st~0 && ~c~0 == 1 + ~last~0;~a~0 := 3 + ~a~0;~b~0 := 3 + ~b~0; {174181#false} is VALID [2022-04-15 06:40:57,697 INFO L290 TraceCheckUtils]: 70: Hoare triple {174181#false} assume !(~c~0 == ~last~0 && 0 == ~st~0); {174181#false} is VALID [2022-04-15 06:40:57,697 INFO L272 TraceCheckUtils]: 71: Hoare triple {174181#false} call __VERIFIER_assert((if ~a~0 == ~b~0 && 200000 == ~c~0 then 1 else 0)); {174181#false} is VALID [2022-04-15 06:40:57,697 INFO L290 TraceCheckUtils]: 72: Hoare triple {174181#false} ~cond := #in~cond; {174181#false} is VALID [2022-04-15 06:40:57,697 INFO L290 TraceCheckUtils]: 73: Hoare triple {174181#false} assume 0 == ~cond; {174181#false} is VALID [2022-04-15 06:40:57,697 INFO L290 TraceCheckUtils]: 74: Hoare triple {174181#false} assume !false; {174181#false} is VALID [2022-04-15 06:40:57,697 INFO L134 CoverageAnalysis]: Checked inductivity of 590 backedges. 0 proven. 590 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 06:40:57,697 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 06:40:57,697 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [786729181] [2022-04-15 06:40:57,697 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [786729181] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 06:40:57,697 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1042128175] [2022-04-15 06:40:57,697 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 06:40:57,697 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 06:40:57,697 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 06:40:57,698 INFO L229 MonitoredProcess]: Starting monitored process 62 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-15 06:40:57,699 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (62)] Waiting until timeout for monitored process [2022-04-15 06:40:57,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:40:57,745 INFO L263 TraceCheckSpWp]: Trace formula consists of 175 conjuncts, 22 conjunts are in the unsatisfiable core [2022-04-15 06:40:57,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:40:57,760 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 06:40:58,104 INFO L272 TraceCheckUtils]: 0: Hoare triple {174180#true} call ULTIMATE.init(); {174180#true} is VALID [2022-04-15 06:40:58,105 INFO L290 TraceCheckUtils]: 1: Hoare triple {174180#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(11, 2);call #Ultimate.allocInit(12, 3);~last~0 := 0; {174180#true} is VALID [2022-04-15 06:40:58,105 INFO L290 TraceCheckUtils]: 2: Hoare triple {174180#true} assume true; {174180#true} is VALID [2022-04-15 06:40:58,105 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {174180#true} {174180#true} #66#return; {174180#true} is VALID [2022-04-15 06:40:58,105 INFO L272 TraceCheckUtils]: 4: Hoare triple {174180#true} call #t~ret6 := main(); {174180#true} is VALID [2022-04-15 06:40:58,105 INFO L290 TraceCheckUtils]: 5: Hoare triple {174180#true} assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~last~0 := #t~nondet4;havoc #t~nondet4;~a~0 := 0;~b~0 := 0;~c~0 := 0;~st~0 := 0; {174180#true} is VALID [2022-04-15 06:40:58,105 INFO L290 TraceCheckUtils]: 6: Hoare triple {174180#true} [282] L30-->L23-3_primed: Formula: (and (= v_main_~b~0_302 v_main_~b~0_301) (= v_main_~a~0_305 v_main_~a~0_304) (= v_main_~c~0_2575 v_main_~c~0_2554) (= v_main_~st~0_590 v_main_~st~0_588) (= |v_main_#t~post5_1030| |v_main_#t~post5_1010|)) InVars {main_~c~0=v_main_~c~0_2575, main_#t~post5=|v_main_#t~post5_1030|, main_~st~0=v_main_~st~0_590, main_~b~0=v_main_~b~0_302, main_~a~0=v_main_~a~0_305} OutVars{main_~c~0=v_main_~c~0_2554, main_#t~post5=|v_main_#t~post5_1010|, main_~st~0=v_main_~st~0_588, main_~b~0=v_main_~b~0_301, main_~a~0=v_main_~a~0_304} AuxVars[] AssignedVars[main_~c~0, main_#t~post5, main_~st~0, main_~b~0, main_~a~0] {174180#true} is VALID [2022-04-15 06:40:58,105 INFO L290 TraceCheckUtils]: 7: Hoare triple {174180#true} [281] L23-3_primed-->L23-3: Formula: (and (= v_main_~c~0_7 0) (= v_main_~st~0_6 1)) InVars {} OutVars{main_~c~0=v_main_~c~0_7, main_~st~0=v_main_~st~0_6} AuxVars[] AssignedVars[main_~c~0, main_~st~0] {174231#(<= main_~c~0 0)} is VALID [2022-04-15 06:40:58,106 INFO L290 TraceCheckUtils]: 8: Hoare triple {174231#(<= main_~c~0 0)} assume !!(~c~0 < 200000); {174231#(<= main_~c~0 0)} is VALID [2022-04-15 06:40:58,106 INFO L290 TraceCheckUtils]: 9: Hoare triple {174231#(<= main_~c~0 0)} assume ~c~0 == ~last~0;~st~0 := 0; {174231#(<= main_~c~0 0)} is VALID [2022-04-15 06:40:58,106 INFO L290 TraceCheckUtils]: 10: Hoare triple {174231#(<= main_~c~0 0)} #t~post5 := ~c~0;~c~0 := 1 + #t~post5;havoc #t~post5; {174186#(<= main_~c~0 1)} is VALID [2022-04-15 06:40:58,107 INFO L290 TraceCheckUtils]: 11: Hoare triple {174186#(<= main_~c~0 1)} assume !!(~c~0 < 200000); {174186#(<= main_~c~0 1)} is VALID [2022-04-15 06:40:58,107 INFO L290 TraceCheckUtils]: 12: Hoare triple {174186#(<= main_~c~0 1)} assume !(~c~0 == ~last~0); {174186#(<= main_~c~0 1)} is VALID [2022-04-15 06:40:58,107 INFO L290 TraceCheckUtils]: 13: Hoare triple {174186#(<= main_~c~0 1)} #t~post5 := ~c~0;~c~0 := 1 + #t~post5;havoc #t~post5; {174187#(<= main_~c~0 2)} is VALID [2022-04-15 06:40:58,107 INFO L290 TraceCheckUtils]: 14: Hoare triple {174187#(<= main_~c~0 2)} assume !!(~c~0 < 200000); {174187#(<= main_~c~0 2)} is VALID [2022-04-15 06:40:58,108 INFO L290 TraceCheckUtils]: 15: Hoare triple {174187#(<= main_~c~0 2)} assume !(~c~0 == ~last~0); {174187#(<= main_~c~0 2)} is VALID [2022-04-15 06:40:58,108 INFO L290 TraceCheckUtils]: 16: Hoare triple {174187#(<= main_~c~0 2)} #t~post5 := ~c~0;~c~0 := 1 + #t~post5;havoc #t~post5; {174188#(<= main_~c~0 3)} is VALID [2022-04-15 06:40:58,108 INFO L290 TraceCheckUtils]: 17: Hoare triple {174188#(<= main_~c~0 3)} assume !!(~c~0 < 200000); {174188#(<= main_~c~0 3)} is VALID [2022-04-15 06:40:58,109 INFO L290 TraceCheckUtils]: 18: Hoare triple {174188#(<= main_~c~0 3)} assume !(~c~0 == ~last~0); {174188#(<= main_~c~0 3)} is VALID [2022-04-15 06:40:58,109 INFO L290 TraceCheckUtils]: 19: Hoare triple {174188#(<= main_~c~0 3)} #t~post5 := ~c~0;~c~0 := 1 + #t~post5;havoc #t~post5; {174189#(<= main_~c~0 4)} is VALID [2022-04-15 06:40:58,109 INFO L290 TraceCheckUtils]: 20: Hoare triple {174189#(<= main_~c~0 4)} assume !!(~c~0 < 200000); {174189#(<= main_~c~0 4)} is VALID [2022-04-15 06:40:58,110 INFO L290 TraceCheckUtils]: 21: Hoare triple {174189#(<= main_~c~0 4)} assume !(~c~0 == ~last~0); {174189#(<= main_~c~0 4)} is VALID [2022-04-15 06:40:58,110 INFO L290 TraceCheckUtils]: 22: Hoare triple {174189#(<= main_~c~0 4)} #t~post5 := ~c~0;~c~0 := 1 + #t~post5;havoc #t~post5; {174190#(<= main_~c~0 5)} is VALID [2022-04-15 06:40:58,110 INFO L290 TraceCheckUtils]: 23: Hoare triple {174190#(<= main_~c~0 5)} assume !!(~c~0 < 200000); {174190#(<= main_~c~0 5)} is VALID [2022-04-15 06:40:58,110 INFO L290 TraceCheckUtils]: 24: Hoare triple {174190#(<= main_~c~0 5)} assume !(~c~0 == ~last~0); {174190#(<= main_~c~0 5)} is VALID [2022-04-15 06:40:58,111 INFO L290 TraceCheckUtils]: 25: Hoare triple {174190#(<= main_~c~0 5)} #t~post5 := ~c~0;~c~0 := 1 + #t~post5;havoc #t~post5; {174191#(<= main_~c~0 6)} is VALID [2022-04-15 06:40:58,111 INFO L290 TraceCheckUtils]: 26: Hoare triple {174191#(<= main_~c~0 6)} assume !!(~c~0 < 200000); {174191#(<= main_~c~0 6)} is VALID [2022-04-15 06:40:58,111 INFO L290 TraceCheckUtils]: 27: Hoare triple {174191#(<= main_~c~0 6)} assume !(~c~0 == ~last~0); {174191#(<= main_~c~0 6)} is VALID [2022-04-15 06:40:58,112 INFO L290 TraceCheckUtils]: 28: Hoare triple {174191#(<= main_~c~0 6)} #t~post5 := ~c~0;~c~0 := 1 + #t~post5;havoc #t~post5; {174192#(<= main_~c~0 7)} is VALID [2022-04-15 06:40:58,112 INFO L290 TraceCheckUtils]: 29: Hoare triple {174192#(<= main_~c~0 7)} assume !!(~c~0 < 200000); {174192#(<= main_~c~0 7)} is VALID [2022-04-15 06:40:58,112 INFO L290 TraceCheckUtils]: 30: Hoare triple {174192#(<= main_~c~0 7)} assume !(~c~0 == ~last~0); {174192#(<= main_~c~0 7)} is VALID [2022-04-15 06:40:58,113 INFO L290 TraceCheckUtils]: 31: Hoare triple {174192#(<= main_~c~0 7)} #t~post5 := ~c~0;~c~0 := 1 + #t~post5;havoc #t~post5; {174193#(<= main_~c~0 8)} is VALID [2022-04-15 06:40:58,113 INFO L290 TraceCheckUtils]: 32: Hoare triple {174193#(<= main_~c~0 8)} assume !!(~c~0 < 200000); {174193#(<= main_~c~0 8)} is VALID [2022-04-15 06:40:58,113 INFO L290 TraceCheckUtils]: 33: Hoare triple {174193#(<= main_~c~0 8)} assume !(~c~0 == ~last~0); {174193#(<= main_~c~0 8)} is VALID [2022-04-15 06:40:58,114 INFO L290 TraceCheckUtils]: 34: Hoare triple {174193#(<= main_~c~0 8)} #t~post5 := ~c~0;~c~0 := 1 + #t~post5;havoc #t~post5; {174194#(<= main_~c~0 9)} is VALID [2022-04-15 06:40:58,114 INFO L290 TraceCheckUtils]: 35: Hoare triple {174194#(<= main_~c~0 9)} assume !!(~c~0 < 200000); {174194#(<= main_~c~0 9)} is VALID [2022-04-15 06:40:58,114 INFO L290 TraceCheckUtils]: 36: Hoare triple {174194#(<= main_~c~0 9)} assume !(~c~0 == ~last~0); {174194#(<= main_~c~0 9)} is VALID [2022-04-15 06:40:58,115 INFO L290 TraceCheckUtils]: 37: Hoare triple {174194#(<= main_~c~0 9)} #t~post5 := ~c~0;~c~0 := 1 + #t~post5;havoc #t~post5; {174195#(<= main_~c~0 10)} is VALID [2022-04-15 06:40:58,115 INFO L290 TraceCheckUtils]: 38: Hoare triple {174195#(<= main_~c~0 10)} assume !!(~c~0 < 200000); {174195#(<= main_~c~0 10)} is VALID [2022-04-15 06:40:58,115 INFO L290 TraceCheckUtils]: 39: Hoare triple {174195#(<= main_~c~0 10)} assume !(~c~0 == ~last~0); {174195#(<= main_~c~0 10)} is VALID [2022-04-15 06:40:58,115 INFO L290 TraceCheckUtils]: 40: Hoare triple {174195#(<= main_~c~0 10)} #t~post5 := ~c~0;~c~0 := 1 + #t~post5;havoc #t~post5; {174196#(<= main_~c~0 11)} is VALID [2022-04-15 06:40:58,116 INFO L290 TraceCheckUtils]: 41: Hoare triple {174196#(<= main_~c~0 11)} assume !!(~c~0 < 200000); {174196#(<= main_~c~0 11)} is VALID [2022-04-15 06:40:58,116 INFO L290 TraceCheckUtils]: 42: Hoare triple {174196#(<= main_~c~0 11)} assume !(~c~0 == ~last~0); {174196#(<= main_~c~0 11)} is VALID [2022-04-15 06:40:58,116 INFO L290 TraceCheckUtils]: 43: Hoare triple {174196#(<= main_~c~0 11)} #t~post5 := ~c~0;~c~0 := 1 + #t~post5;havoc #t~post5; {174197#(<= main_~c~0 12)} is VALID [2022-04-15 06:40:58,117 INFO L290 TraceCheckUtils]: 44: Hoare triple {174197#(<= main_~c~0 12)} assume !!(~c~0 < 200000); {174197#(<= main_~c~0 12)} is VALID [2022-04-15 06:40:58,117 INFO L290 TraceCheckUtils]: 45: Hoare triple {174197#(<= main_~c~0 12)} assume !(~c~0 == ~last~0); {174197#(<= main_~c~0 12)} is VALID [2022-04-15 06:40:58,117 INFO L290 TraceCheckUtils]: 46: Hoare triple {174197#(<= main_~c~0 12)} #t~post5 := ~c~0;~c~0 := 1 + #t~post5;havoc #t~post5; {174198#(<= main_~c~0 13)} is VALID [2022-04-15 06:40:58,118 INFO L290 TraceCheckUtils]: 47: Hoare triple {174198#(<= main_~c~0 13)} assume !!(~c~0 < 200000); {174198#(<= main_~c~0 13)} is VALID [2022-04-15 06:40:58,118 INFO L290 TraceCheckUtils]: 48: Hoare triple {174198#(<= main_~c~0 13)} assume !(~c~0 == ~last~0); {174198#(<= main_~c~0 13)} is VALID [2022-04-15 06:40:58,118 INFO L290 TraceCheckUtils]: 49: Hoare triple {174198#(<= main_~c~0 13)} #t~post5 := ~c~0;~c~0 := 1 + #t~post5;havoc #t~post5; {174199#(<= main_~c~0 14)} is VALID [2022-04-15 06:40:58,119 INFO L290 TraceCheckUtils]: 50: Hoare triple {174199#(<= main_~c~0 14)} assume !!(~c~0 < 200000); {174199#(<= main_~c~0 14)} is VALID [2022-04-15 06:40:58,119 INFO L290 TraceCheckUtils]: 51: Hoare triple {174199#(<= main_~c~0 14)} assume !(~c~0 == ~last~0); {174199#(<= main_~c~0 14)} is VALID [2022-04-15 06:40:58,119 INFO L290 TraceCheckUtils]: 52: Hoare triple {174199#(<= main_~c~0 14)} #t~post5 := ~c~0;~c~0 := 1 + #t~post5;havoc #t~post5; {174200#(<= main_~c~0 15)} is VALID [2022-04-15 06:40:58,119 INFO L290 TraceCheckUtils]: 53: Hoare triple {174200#(<= main_~c~0 15)} assume !!(~c~0 < 200000); {174200#(<= main_~c~0 15)} is VALID [2022-04-15 06:40:58,120 INFO L290 TraceCheckUtils]: 54: Hoare triple {174200#(<= main_~c~0 15)} assume !(~c~0 == ~last~0); {174200#(<= main_~c~0 15)} is VALID [2022-04-15 06:40:58,120 INFO L290 TraceCheckUtils]: 55: Hoare triple {174200#(<= main_~c~0 15)} #t~post5 := ~c~0;~c~0 := 1 + #t~post5;havoc #t~post5; {174201#(<= main_~c~0 16)} is VALID [2022-04-15 06:40:58,120 INFO L290 TraceCheckUtils]: 56: Hoare triple {174201#(<= main_~c~0 16)} assume !!(~c~0 < 200000); {174201#(<= main_~c~0 16)} is VALID [2022-04-15 06:40:58,121 INFO L290 TraceCheckUtils]: 57: Hoare triple {174201#(<= main_~c~0 16)} assume !(~c~0 == ~last~0); {174201#(<= main_~c~0 16)} is VALID [2022-04-15 06:40:58,121 INFO L290 TraceCheckUtils]: 58: Hoare triple {174201#(<= main_~c~0 16)} #t~post5 := ~c~0;~c~0 := 1 + #t~post5;havoc #t~post5; {174202#(<= main_~c~0 17)} is VALID [2022-04-15 06:40:58,121 INFO L290 TraceCheckUtils]: 59: Hoare triple {174202#(<= main_~c~0 17)} assume !!(~c~0 < 200000); {174202#(<= main_~c~0 17)} is VALID [2022-04-15 06:40:58,122 INFO L290 TraceCheckUtils]: 60: Hoare triple {174202#(<= main_~c~0 17)} assume !(~c~0 == ~last~0); {174202#(<= main_~c~0 17)} is VALID [2022-04-15 06:40:58,122 INFO L290 TraceCheckUtils]: 61: Hoare triple {174202#(<= main_~c~0 17)} #t~post5 := ~c~0;~c~0 := 1 + #t~post5;havoc #t~post5; {174203#(<= main_~c~0 18)} is VALID [2022-04-15 06:40:58,122 INFO L290 TraceCheckUtils]: 62: Hoare triple {174203#(<= main_~c~0 18)} assume !!(~c~0 < 200000); {174203#(<= main_~c~0 18)} is VALID [2022-04-15 06:40:58,122 INFO L290 TraceCheckUtils]: 63: Hoare triple {174203#(<= main_~c~0 18)} assume !(~c~0 == ~last~0); {174203#(<= main_~c~0 18)} is VALID [2022-04-15 06:40:58,123 INFO L290 TraceCheckUtils]: 64: Hoare triple {174203#(<= main_~c~0 18)} #t~post5 := ~c~0;~c~0 := 1 + #t~post5;havoc #t~post5; {174204#(<= main_~c~0 19)} is VALID [2022-04-15 06:40:58,123 INFO L290 TraceCheckUtils]: 65: Hoare triple {174204#(<= main_~c~0 19)} assume !!(~c~0 < 200000); {174204#(<= main_~c~0 19)} is VALID [2022-04-15 06:40:58,123 INFO L290 TraceCheckUtils]: 66: Hoare triple {174204#(<= main_~c~0 19)} assume !(~c~0 == ~last~0); {174204#(<= main_~c~0 19)} is VALID [2022-04-15 06:40:58,124 INFO L290 TraceCheckUtils]: 67: Hoare triple {174204#(<= main_~c~0 19)} #t~post5 := ~c~0;~c~0 := 1 + #t~post5;havoc #t~post5; {174205#(<= main_~c~0 20)} is VALID [2022-04-15 06:40:58,124 INFO L290 TraceCheckUtils]: 68: Hoare triple {174205#(<= main_~c~0 20)} assume !(~c~0 < 200000); {174181#false} is VALID [2022-04-15 06:40:58,124 INFO L290 TraceCheckUtils]: 69: Hoare triple {174181#false} assume 0 == ~st~0 && ~c~0 == 1 + ~last~0;~a~0 := 3 + ~a~0;~b~0 := 3 + ~b~0; {174181#false} is VALID [2022-04-15 06:40:58,124 INFO L290 TraceCheckUtils]: 70: Hoare triple {174181#false} assume !(~c~0 == ~last~0 && 0 == ~st~0); {174181#false} is VALID [2022-04-15 06:40:58,124 INFO L272 TraceCheckUtils]: 71: Hoare triple {174181#false} call __VERIFIER_assert((if ~a~0 == ~b~0 && 200000 == ~c~0 then 1 else 0)); {174181#false} is VALID [2022-04-15 06:40:58,124 INFO L290 TraceCheckUtils]: 72: Hoare triple {174181#false} ~cond := #in~cond; {174181#false} is VALID [2022-04-15 06:40:58,124 INFO L290 TraceCheckUtils]: 73: Hoare triple {174181#false} assume 0 == ~cond; {174181#false} is VALID [2022-04-15 06:40:58,124 INFO L290 TraceCheckUtils]: 74: Hoare triple {174181#false} assume !false; {174181#false} is VALID [2022-04-15 06:40:58,125 INFO L134 CoverageAnalysis]: Checked inductivity of 590 backedges. 0 proven. 590 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 06:40:58,125 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 06:40:58,930 INFO L290 TraceCheckUtils]: 74: Hoare triple {174181#false} assume !false; {174181#false} is VALID [2022-04-15 06:40:58,931 INFO L290 TraceCheckUtils]: 73: Hoare triple {174181#false} assume 0 == ~cond; {174181#false} is VALID [2022-04-15 06:40:58,931 INFO L290 TraceCheckUtils]: 72: Hoare triple {174181#false} ~cond := #in~cond; {174181#false} is VALID [2022-04-15 06:40:58,931 INFO L272 TraceCheckUtils]: 71: Hoare triple {174181#false} call __VERIFIER_assert((if ~a~0 == ~b~0 && 200000 == ~c~0 then 1 else 0)); {174181#false} is VALID [2022-04-15 06:40:58,931 INFO L290 TraceCheckUtils]: 70: Hoare triple {174181#false} assume !(~c~0 == ~last~0 && 0 == ~st~0); {174181#false} is VALID [2022-04-15 06:40:58,931 INFO L290 TraceCheckUtils]: 69: Hoare triple {174181#false} assume 0 == ~st~0 && ~c~0 == 1 + ~last~0;~a~0 := 3 + ~a~0;~b~0 := 3 + ~b~0; {174181#false} is VALID [2022-04-15 06:40:58,931 INFO L290 TraceCheckUtils]: 68: Hoare triple {174451#(< main_~c~0 200000)} assume !(~c~0 < 200000); {174181#false} is VALID [2022-04-15 06:40:58,931 INFO L290 TraceCheckUtils]: 67: Hoare triple {174455#(< main_~c~0 199999)} #t~post5 := ~c~0;~c~0 := 1 + #t~post5;havoc #t~post5; {174451#(< main_~c~0 200000)} is VALID [2022-04-15 06:40:58,932 INFO L290 TraceCheckUtils]: 66: Hoare triple {174455#(< main_~c~0 199999)} assume !(~c~0 == ~last~0); {174455#(< main_~c~0 199999)} is VALID [2022-04-15 06:40:58,932 INFO L290 TraceCheckUtils]: 65: Hoare triple {174455#(< main_~c~0 199999)} assume !!(~c~0 < 200000); {174455#(< main_~c~0 199999)} is VALID [2022-04-15 06:40:58,932 INFO L290 TraceCheckUtils]: 64: Hoare triple {174465#(< main_~c~0 199998)} #t~post5 := ~c~0;~c~0 := 1 + #t~post5;havoc #t~post5; {174455#(< main_~c~0 199999)} is VALID [2022-04-15 06:40:58,932 INFO L290 TraceCheckUtils]: 63: Hoare triple {174465#(< main_~c~0 199998)} assume !(~c~0 == ~last~0); {174465#(< main_~c~0 199998)} is VALID [2022-04-15 06:40:58,933 INFO L290 TraceCheckUtils]: 62: Hoare triple {174465#(< main_~c~0 199998)} assume !!(~c~0 < 200000); {174465#(< main_~c~0 199998)} is VALID [2022-04-15 06:40:58,933 INFO L290 TraceCheckUtils]: 61: Hoare triple {174475#(< main_~c~0 199997)} #t~post5 := ~c~0;~c~0 := 1 + #t~post5;havoc #t~post5; {174465#(< main_~c~0 199998)} is VALID [2022-04-15 06:40:58,933 INFO L290 TraceCheckUtils]: 60: Hoare triple {174475#(< main_~c~0 199997)} assume !(~c~0 == ~last~0); {174475#(< main_~c~0 199997)} is VALID [2022-04-15 06:40:58,933 INFO L290 TraceCheckUtils]: 59: Hoare triple {174475#(< main_~c~0 199997)} assume !!(~c~0 < 200000); {174475#(< main_~c~0 199997)} is VALID [2022-04-15 06:40:58,934 INFO L290 TraceCheckUtils]: 58: Hoare triple {174485#(< main_~c~0 199996)} #t~post5 := ~c~0;~c~0 := 1 + #t~post5;havoc #t~post5; {174475#(< main_~c~0 199997)} is VALID [2022-04-15 06:40:58,934 INFO L290 TraceCheckUtils]: 57: Hoare triple {174485#(< main_~c~0 199996)} assume !(~c~0 == ~last~0); {174485#(< main_~c~0 199996)} is VALID [2022-04-15 06:40:58,934 INFO L290 TraceCheckUtils]: 56: Hoare triple {174485#(< main_~c~0 199996)} assume !!(~c~0 < 200000); {174485#(< main_~c~0 199996)} is VALID [2022-04-15 06:40:58,935 INFO L290 TraceCheckUtils]: 55: Hoare triple {174495#(< main_~c~0 199995)} #t~post5 := ~c~0;~c~0 := 1 + #t~post5;havoc #t~post5; {174485#(< main_~c~0 199996)} is VALID [2022-04-15 06:40:58,935 INFO L290 TraceCheckUtils]: 54: Hoare triple {174495#(< main_~c~0 199995)} assume !(~c~0 == ~last~0); {174495#(< main_~c~0 199995)} is VALID [2022-04-15 06:40:58,935 INFO L290 TraceCheckUtils]: 53: Hoare triple {174495#(< main_~c~0 199995)} assume !!(~c~0 < 200000); {174495#(< main_~c~0 199995)} is VALID [2022-04-15 06:40:58,935 INFO L290 TraceCheckUtils]: 52: Hoare triple {174505#(< main_~c~0 199994)} #t~post5 := ~c~0;~c~0 := 1 + #t~post5;havoc #t~post5; {174495#(< main_~c~0 199995)} is VALID [2022-04-15 06:40:58,935 INFO L290 TraceCheckUtils]: 51: Hoare triple {174505#(< main_~c~0 199994)} assume !(~c~0 == ~last~0); {174505#(< main_~c~0 199994)} is VALID [2022-04-15 06:40:58,936 INFO L290 TraceCheckUtils]: 50: Hoare triple {174505#(< main_~c~0 199994)} assume !!(~c~0 < 200000); {174505#(< main_~c~0 199994)} is VALID [2022-04-15 06:40:58,936 INFO L290 TraceCheckUtils]: 49: Hoare triple {174515#(< main_~c~0 199993)} #t~post5 := ~c~0;~c~0 := 1 + #t~post5;havoc #t~post5; {174505#(< main_~c~0 199994)} is VALID [2022-04-15 06:40:58,936 INFO L290 TraceCheckUtils]: 48: Hoare triple {174515#(< main_~c~0 199993)} assume !(~c~0 == ~last~0); {174515#(< main_~c~0 199993)} is VALID [2022-04-15 06:40:58,936 INFO L290 TraceCheckUtils]: 47: Hoare triple {174515#(< main_~c~0 199993)} assume !!(~c~0 < 200000); {174515#(< main_~c~0 199993)} is VALID [2022-04-15 06:40:58,937 INFO L290 TraceCheckUtils]: 46: Hoare triple {174525#(< main_~c~0 199992)} #t~post5 := ~c~0;~c~0 := 1 + #t~post5;havoc #t~post5; {174515#(< main_~c~0 199993)} is VALID [2022-04-15 06:40:58,937 INFO L290 TraceCheckUtils]: 45: Hoare triple {174525#(< main_~c~0 199992)} assume !(~c~0 == ~last~0); {174525#(< main_~c~0 199992)} is VALID [2022-04-15 06:40:58,937 INFO L290 TraceCheckUtils]: 44: Hoare triple {174525#(< main_~c~0 199992)} assume !!(~c~0 < 200000); {174525#(< main_~c~0 199992)} is VALID [2022-04-15 06:40:58,938 INFO L290 TraceCheckUtils]: 43: Hoare triple {174535#(< main_~c~0 199991)} #t~post5 := ~c~0;~c~0 := 1 + #t~post5;havoc #t~post5; {174525#(< main_~c~0 199992)} is VALID [2022-04-15 06:40:58,938 INFO L290 TraceCheckUtils]: 42: Hoare triple {174535#(< main_~c~0 199991)} assume !(~c~0 == ~last~0); {174535#(< main_~c~0 199991)} is VALID [2022-04-15 06:40:58,938 INFO L290 TraceCheckUtils]: 41: Hoare triple {174535#(< main_~c~0 199991)} assume !!(~c~0 < 200000); {174535#(< main_~c~0 199991)} is VALID [2022-04-15 06:40:58,938 INFO L290 TraceCheckUtils]: 40: Hoare triple {174545#(< main_~c~0 199990)} #t~post5 := ~c~0;~c~0 := 1 + #t~post5;havoc #t~post5; {174535#(< main_~c~0 199991)} is VALID [2022-04-15 06:40:58,939 INFO L290 TraceCheckUtils]: 39: Hoare triple {174545#(< main_~c~0 199990)} assume !(~c~0 == ~last~0); {174545#(< main_~c~0 199990)} is VALID [2022-04-15 06:40:58,939 INFO L290 TraceCheckUtils]: 38: Hoare triple {174545#(< main_~c~0 199990)} assume !!(~c~0 < 200000); {174545#(< main_~c~0 199990)} is VALID [2022-04-15 06:40:58,939 INFO L290 TraceCheckUtils]: 37: Hoare triple {174555#(< main_~c~0 199989)} #t~post5 := ~c~0;~c~0 := 1 + #t~post5;havoc #t~post5; {174545#(< main_~c~0 199990)} is VALID [2022-04-15 06:40:58,939 INFO L290 TraceCheckUtils]: 36: Hoare triple {174555#(< main_~c~0 199989)} assume !(~c~0 == ~last~0); {174555#(< main_~c~0 199989)} is VALID [2022-04-15 06:40:58,940 INFO L290 TraceCheckUtils]: 35: Hoare triple {174555#(< main_~c~0 199989)} assume !!(~c~0 < 200000); {174555#(< main_~c~0 199989)} is VALID [2022-04-15 06:40:58,940 INFO L290 TraceCheckUtils]: 34: Hoare triple {174565#(< main_~c~0 199988)} #t~post5 := ~c~0;~c~0 := 1 + #t~post5;havoc #t~post5; {174555#(< main_~c~0 199989)} is VALID [2022-04-15 06:40:58,940 INFO L290 TraceCheckUtils]: 33: Hoare triple {174565#(< main_~c~0 199988)} assume !(~c~0 == ~last~0); {174565#(< main_~c~0 199988)} is VALID [2022-04-15 06:40:58,940 INFO L290 TraceCheckUtils]: 32: Hoare triple {174565#(< main_~c~0 199988)} assume !!(~c~0 < 200000); {174565#(< main_~c~0 199988)} is VALID [2022-04-15 06:40:58,941 INFO L290 TraceCheckUtils]: 31: Hoare triple {174575#(< main_~c~0 199987)} #t~post5 := ~c~0;~c~0 := 1 + #t~post5;havoc #t~post5; {174565#(< main_~c~0 199988)} is VALID [2022-04-15 06:40:58,941 INFO L290 TraceCheckUtils]: 30: Hoare triple {174575#(< main_~c~0 199987)} assume !(~c~0 == ~last~0); {174575#(< main_~c~0 199987)} is VALID [2022-04-15 06:40:58,941 INFO L290 TraceCheckUtils]: 29: Hoare triple {174575#(< main_~c~0 199987)} assume !!(~c~0 < 200000); {174575#(< main_~c~0 199987)} is VALID [2022-04-15 06:40:58,941 INFO L290 TraceCheckUtils]: 28: Hoare triple {174585#(< main_~c~0 199986)} #t~post5 := ~c~0;~c~0 := 1 + #t~post5;havoc #t~post5; {174575#(< main_~c~0 199987)} is VALID [2022-04-15 06:40:58,942 INFO L290 TraceCheckUtils]: 27: Hoare triple {174585#(< main_~c~0 199986)} assume !(~c~0 == ~last~0); {174585#(< main_~c~0 199986)} is VALID [2022-04-15 06:40:58,942 INFO L290 TraceCheckUtils]: 26: Hoare triple {174585#(< main_~c~0 199986)} assume !!(~c~0 < 200000); {174585#(< main_~c~0 199986)} is VALID [2022-04-15 06:40:58,942 INFO L290 TraceCheckUtils]: 25: Hoare triple {174595#(< main_~c~0 199985)} #t~post5 := ~c~0;~c~0 := 1 + #t~post5;havoc #t~post5; {174585#(< main_~c~0 199986)} is VALID [2022-04-15 06:40:58,942 INFO L290 TraceCheckUtils]: 24: Hoare triple {174595#(< main_~c~0 199985)} assume !(~c~0 == ~last~0); {174595#(< main_~c~0 199985)} is VALID [2022-04-15 06:40:58,942 INFO L290 TraceCheckUtils]: 23: Hoare triple {174595#(< main_~c~0 199985)} assume !!(~c~0 < 200000); {174595#(< main_~c~0 199985)} is VALID [2022-04-15 06:40:58,943 INFO L290 TraceCheckUtils]: 22: Hoare triple {174605#(< main_~c~0 199984)} #t~post5 := ~c~0;~c~0 := 1 + #t~post5;havoc #t~post5; {174595#(< main_~c~0 199985)} is VALID [2022-04-15 06:40:58,943 INFO L290 TraceCheckUtils]: 21: Hoare triple {174605#(< main_~c~0 199984)} assume !(~c~0 == ~last~0); {174605#(< main_~c~0 199984)} is VALID [2022-04-15 06:40:58,943 INFO L290 TraceCheckUtils]: 20: Hoare triple {174605#(< main_~c~0 199984)} assume !!(~c~0 < 200000); {174605#(< main_~c~0 199984)} is VALID [2022-04-15 06:40:58,944 INFO L290 TraceCheckUtils]: 19: Hoare triple {174615#(< main_~c~0 199983)} #t~post5 := ~c~0;~c~0 := 1 + #t~post5;havoc #t~post5; {174605#(< main_~c~0 199984)} is VALID [2022-04-15 06:40:58,944 INFO L290 TraceCheckUtils]: 18: Hoare triple {174615#(< main_~c~0 199983)} assume !(~c~0 == ~last~0); {174615#(< main_~c~0 199983)} is VALID [2022-04-15 06:40:58,944 INFO L290 TraceCheckUtils]: 17: Hoare triple {174615#(< main_~c~0 199983)} assume !!(~c~0 < 200000); {174615#(< main_~c~0 199983)} is VALID [2022-04-15 06:40:58,944 INFO L290 TraceCheckUtils]: 16: Hoare triple {174625#(< main_~c~0 199982)} #t~post5 := ~c~0;~c~0 := 1 + #t~post5;havoc #t~post5; {174615#(< main_~c~0 199983)} is VALID [2022-04-15 06:40:58,945 INFO L290 TraceCheckUtils]: 15: Hoare triple {174625#(< main_~c~0 199982)} assume !(~c~0 == ~last~0); {174625#(< main_~c~0 199982)} is VALID [2022-04-15 06:40:58,945 INFO L290 TraceCheckUtils]: 14: Hoare triple {174625#(< main_~c~0 199982)} assume !!(~c~0 < 200000); {174625#(< main_~c~0 199982)} is VALID [2022-04-15 06:40:58,945 INFO L290 TraceCheckUtils]: 13: Hoare triple {174635#(< main_~c~0 199981)} #t~post5 := ~c~0;~c~0 := 1 + #t~post5;havoc #t~post5; {174625#(< main_~c~0 199982)} is VALID [2022-04-15 06:40:58,945 INFO L290 TraceCheckUtils]: 12: Hoare triple {174635#(< main_~c~0 199981)} assume !(~c~0 == ~last~0); {174635#(< main_~c~0 199981)} is VALID [2022-04-15 06:40:58,945 INFO L290 TraceCheckUtils]: 11: Hoare triple {174635#(< main_~c~0 199981)} assume !!(~c~0 < 200000); {174635#(< main_~c~0 199981)} is VALID [2022-04-15 06:40:58,946 INFO L290 TraceCheckUtils]: 10: Hoare triple {174645#(< main_~c~0 199980)} #t~post5 := ~c~0;~c~0 := 1 + #t~post5;havoc #t~post5; {174635#(< main_~c~0 199981)} is VALID [2022-04-15 06:40:58,946 INFO L290 TraceCheckUtils]: 9: Hoare triple {174645#(< main_~c~0 199980)} assume ~c~0 == ~last~0;~st~0 := 0; {174645#(< main_~c~0 199980)} is VALID [2022-04-15 06:40:58,946 INFO L290 TraceCheckUtils]: 8: Hoare triple {174645#(< main_~c~0 199980)} assume !!(~c~0 < 200000); {174645#(< main_~c~0 199980)} is VALID [2022-04-15 06:40:58,947 INFO L290 TraceCheckUtils]: 7: Hoare triple {174180#true} [281] L23-3_primed-->L23-3: Formula: (and (= v_main_~c~0_7 0) (= v_main_~st~0_6 1)) InVars {} OutVars{main_~c~0=v_main_~c~0_7, main_~st~0=v_main_~st~0_6} AuxVars[] AssignedVars[main_~c~0, main_~st~0] {174645#(< main_~c~0 199980)} is VALID [2022-04-15 06:40:58,947 INFO L290 TraceCheckUtils]: 6: Hoare triple {174180#true} [282] L30-->L23-3_primed: Formula: (and (= v_main_~b~0_302 v_main_~b~0_301) (= v_main_~a~0_305 v_main_~a~0_304) (= v_main_~c~0_2575 v_main_~c~0_2554) (= v_main_~st~0_590 v_main_~st~0_588) (= |v_main_#t~post5_1030| |v_main_#t~post5_1010|)) InVars {main_~c~0=v_main_~c~0_2575, main_#t~post5=|v_main_#t~post5_1030|, main_~st~0=v_main_~st~0_590, main_~b~0=v_main_~b~0_302, main_~a~0=v_main_~a~0_305} OutVars{main_~c~0=v_main_~c~0_2554, main_#t~post5=|v_main_#t~post5_1010|, main_~st~0=v_main_~st~0_588, main_~b~0=v_main_~b~0_301, main_~a~0=v_main_~a~0_304} AuxVars[] AssignedVars[main_~c~0, main_#t~post5, main_~st~0, main_~b~0, main_~a~0] {174180#true} is VALID [2022-04-15 06:40:58,947 INFO L290 TraceCheckUtils]: 5: Hoare triple {174180#true} assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~last~0 := #t~nondet4;havoc #t~nondet4;~a~0 := 0;~b~0 := 0;~c~0 := 0;~st~0 := 0; {174180#true} is VALID [2022-04-15 06:40:58,947 INFO L272 TraceCheckUtils]: 4: Hoare triple {174180#true} call #t~ret6 := main(); {174180#true} is VALID [2022-04-15 06:40:58,947 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {174180#true} {174180#true} #66#return; {174180#true} is VALID [2022-04-15 06:40:58,947 INFO L290 TraceCheckUtils]: 2: Hoare triple {174180#true} assume true; {174180#true} is VALID [2022-04-15 06:40:58,947 INFO L290 TraceCheckUtils]: 1: Hoare triple {174180#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(11, 2);call #Ultimate.allocInit(12, 3);~last~0 := 0; {174180#true} is VALID [2022-04-15 06:40:58,947 INFO L272 TraceCheckUtils]: 0: Hoare triple {174180#true} call ULTIMATE.init(); {174180#true} is VALID [2022-04-15 06:40:58,947 INFO L134 CoverageAnalysis]: Checked inductivity of 590 backedges. 0 proven. 590 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 06:40:58,947 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1042128175] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 06:40:58,947 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 06:40:58,947 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 23, 23] total 46 [2022-04-15 06:40:59,605 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 06:40:59,605 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [744520945] [2022-04-15 06:40:59,605 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [744520945] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 06:40:59,605 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 06:40:59,605 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [46] imperfect sequences [] total 46 [2022-04-15 06:40:59,605 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1655607185] [2022-04-15 06:40:59,605 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 06:40:59,605 INFO L78 Accepts]: Start accepts. Automaton has has 46 states, 46 states have (on average 2.9347826086956523) internal successors, (135), 45 states have internal predecessors, (135), 2 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 143 [2022-04-15 06:40:59,606 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 06:40:59,606 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 46 states, 46 states have (on average 2.9347826086956523) internal successors, (135), 45 states have internal predecessors, (135), 2 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-15 06:40:59,679 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 140 edges. 140 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 06:40:59,680 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 46 states [2022-04-15 06:40:59,680 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 06:40:59,680 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2022-04-15 06:40:59,681 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1752, Invalid=2804, Unknown=0, NotChecked=0, Total=4556 [2022-04-15 06:40:59,681 INFO L87 Difference]: Start difference. First operand 886 states and 973 transitions. Second operand has 46 states, 46 states have (on average 2.9347826086956523) internal successors, (135), 45 states have internal predecessors, (135), 2 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2)